3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * Now far ahead the Road has gone,
13 * And I must follow, if I can,
14 * Pursuing it with eager feet,
15 * Until it joins some larger way
16 * Where many paths and errands meet.
17 * And whither then? I cannot say.
20 /* This file contains control-oriented pp ("push/pop") functions that
21 * execute the opcodes that make up a perl program. A typical pp function
22 * expects to find its arguments on the stack, and usually pushes its
23 * results onto the stack, hence the 'pp' terminology. Each OP structure
24 * contains a pointer to the relevant pp_foo() function.
26 * Control-oriented means things like pp_enteriter() and pp_next(), which
27 * alter the flow of control of the program.
32 #define PERL_IN_PP_CTL_C
36 #define WORD_ALIGN sizeof(U32)
39 #define DOCATCH(o) ((CATCH_GET == TRUE) ? docatch(o) : (o))
41 static I32 run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen);
49 cxix = dopoptosub(cxstack_ix);
53 switch (cxstack[cxix].blk_gimme) {
70 /* XXXX Should store the old value to allow for tie/overload - and
71 restore in regcomp, where marked with XXXX. */
80 register PMOP *pm = (PMOP*)cLOGOP->op_other;
82 MAGIC *mg = Null(MAGIC*);
84 /* prevent recompiling under /o and ithreads. */
85 #if defined(USE_ITHREADS)
86 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
87 if (PL_op->op_flags & OPf_STACKED) {
96 if (PL_op->op_flags & OPf_STACKED) {
97 /* multiple args; concatentate them */
99 tmpstr = PAD_SV(ARGTARG);
100 sv_setpvn(tmpstr, "", 0);
101 while (++MARK <= SP) {
102 if (PL_amagic_generation) {
104 if ((SvAMAGIC(tmpstr) || SvAMAGIC(*MARK)) &&
105 (sv = amagic_call(tmpstr, *MARK, concat_amg, AMGf_assign)))
107 sv_setsv(tmpstr, sv);
111 sv_catsv(tmpstr, *MARK);
120 SV *sv = SvRV(tmpstr);
122 mg = mg_find(sv, PERL_MAGIC_qr);
125 regexp *re = (regexp *)mg->mg_obj;
126 ReREFCNT_dec(PM_GETRE(pm));
127 PM_SETRE(pm, ReREFCNT_inc(re));
131 const char *t = SvPV_const(tmpstr, len);
133 /* Check against the last compiled regexp. */
134 if (!PM_GETRE(pm) || !PM_GETRE(pm)->precomp ||
135 PM_GETRE(pm)->prelen != (I32)len ||
136 memNE(PM_GETRE(pm)->precomp, t, len))
139 ReREFCNT_dec(PM_GETRE(pm));
140 PM_SETRE(pm, Null(REGEXP*)); /* crucial if regcomp aborts */
142 if (PL_op->op_flags & OPf_SPECIAL)
143 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
145 pm->op_pmflags = pm->op_pmpermflags; /* reset case sensitivity */
147 pm->op_pmdynflags |= PMdf_DYN_UTF8;
149 pm->op_pmdynflags &= ~PMdf_DYN_UTF8;
150 if (pm->op_pmdynflags & PMdf_UTF8)
151 t = (char*)bytes_to_utf8((U8*)t, &len);
153 PM_SETRE(pm, CALLREGCOMP(aTHX_ (char *)t, (char *)t + len, pm));
154 if (!DO_UTF8(tmpstr) && (pm->op_pmdynflags & PMdf_UTF8))
156 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
157 inside tie/overload accessors. */
161 #ifndef INCOMPLETE_TAINTS
164 pm->op_pmdynflags |= PMdf_TAINTED;
166 pm->op_pmdynflags &= ~PMdf_TAINTED;
170 if (!PM_GETRE(pm)->prelen && PL_curpm)
172 else if (strEQ("\\s+", PM_GETRE(pm)->precomp))
173 pm->op_pmflags |= PMf_WHITE;
175 pm->op_pmflags &= ~PMf_WHITE;
177 /* XXX runtime compiled output needs to move to the pad */
178 if (pm->op_pmflags & PMf_KEEP) {
179 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
180 #if !defined(USE_ITHREADS)
181 /* XXX can't change the optree at runtime either */
182 cLOGOP->op_first->op_next = PL_op->op_next;
191 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
192 register PMOP * const pm = (PMOP*) cLOGOP->op_other;
193 register SV * const dstr = cx->sb_dstr;
194 register char *s = cx->sb_s;
195 register char *m = cx->sb_m;
196 char *orig = cx->sb_orig;
197 register REGEXP * const rx = cx->sb_rx;
199 REGEXP *old = PM_GETRE(pm);
206 rxres_restore(&cx->sb_rxres, rx);
207 RX_MATCH_UTF8_set(rx, SvUTF8(cx->sb_targ));
209 if (cx->sb_iters++) {
210 const I32 saviters = cx->sb_iters;
211 if (cx->sb_iters > cx->sb_maxiters)
212 DIE(aTHX_ "Substitution loop");
214 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
215 cx->sb_rxtainted |= 2;
216 sv_catsv(dstr, POPs);
219 if (cx->sb_once || !CALLREGEXEC(aTHX_ rx, s, cx->sb_strend, orig,
220 s == m, cx->sb_targ, NULL,
221 ((cx->sb_rflags & REXEC_COPY_STR)
222 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
223 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
225 SV *targ = cx->sb_targ;
227 assert(cx->sb_strend >= s);
228 if(cx->sb_strend > s) {
229 if (DO_UTF8(dstr) && !SvUTF8(targ))
230 sv_catpvn_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
232 sv_catpvn(dstr, s, cx->sb_strend - s);
234 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
236 #ifdef PERL_OLD_COPY_ON_WRITE
238 sv_force_normal_flags(targ, SV_COW_DROP_PV);
244 SvPV_set(targ, SvPVX(dstr));
245 SvCUR_set(targ, SvCUR(dstr));
246 SvLEN_set(targ, SvLEN(dstr));
249 SvPV_set(dstr, (char*)0);
252 TAINT_IF(cx->sb_rxtainted & 1);
253 PUSHs(sv_2mortal(newSViv(saviters - 1)));
255 (void)SvPOK_only_UTF8(targ);
256 TAINT_IF(cx->sb_rxtainted);
260 LEAVE_SCOPE(cx->sb_oldsave);
263 RETURNOP(pm->op_next);
265 cx->sb_iters = saviters;
267 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
270 cx->sb_orig = orig = rx->subbeg;
272 cx->sb_strend = s + (cx->sb_strend - m);
274 cx->sb_m = m = rx->startp[0] + orig;
276 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
277 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
279 sv_catpvn(dstr, s, m-s);
281 cx->sb_s = rx->endp[0] + orig;
282 { /* Update the pos() information. */
283 SV *sv = cx->sb_targ;
286 if (SvTYPE(sv) < SVt_PVMG)
287 SvUPGRADE(sv, SVt_PVMG);
288 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
289 sv_magic(sv, Nullsv, PERL_MAGIC_regex_global, Nullch, 0);
290 mg = mg_find(sv, PERL_MAGIC_regex_global);
298 (void)ReREFCNT_inc(rx);
299 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
300 rxres_save(&cx->sb_rxres, rx);
301 RETURNOP(pm->op_pmreplstart);
305 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
310 if (!p || p[1] < rx->nparens) {
311 #ifdef PERL_OLD_COPY_ON_WRITE
312 i = 7 + rx->nparens * 2;
314 i = 6 + rx->nparens * 2;
323 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? rx->subbeg : Nullch);
324 RX_MATCH_COPIED_off(rx);
326 #ifdef PERL_OLD_COPY_ON_WRITE
327 *p++ = PTR2UV(rx->saved_copy);
328 rx->saved_copy = Nullsv;
333 *p++ = PTR2UV(rx->subbeg);
334 *p++ = (UV)rx->sublen;
335 for (i = 0; i <= rx->nparens; ++i) {
336 *p++ = (UV)rx->startp[i];
337 *p++ = (UV)rx->endp[i];
342 Perl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
347 RX_MATCH_COPY_FREE(rx);
348 RX_MATCH_COPIED_set(rx, *p);
351 #ifdef PERL_OLD_COPY_ON_WRITE
353 SvREFCNT_dec (rx->saved_copy);
354 rx->saved_copy = INT2PTR(SV*,*p);
360 rx->subbeg = INT2PTR(char*,*p++);
361 rx->sublen = (I32)(*p++);
362 for (i = 0; i <= rx->nparens; ++i) {
363 rx->startp[i] = (I32)(*p++);
364 rx->endp[i] = (I32)(*p++);
369 Perl_rxres_free(pTHX_ void **rsp)
375 void *tmp = INT2PTR(char*,*p);
378 Poison(*p, 1, sizeof(*p));
380 Safefree(INT2PTR(char*,*p));
382 #ifdef PERL_OLD_COPY_ON_WRITE
384 SvREFCNT_dec (INT2PTR(SV*,p[1]));
394 dSP; dMARK; dORIGMARK;
395 register SV *tmpForm = *++MARK;
400 register SV *sv = Nullsv;
401 const char *item = Nullch;
405 bool chopspace = (strchr(PL_chopset, ' ') != Nullch);
406 const char *chophere = Nullch;
407 char *linemark = Nullch;
409 bool gotsome = FALSE;
411 STRLEN fudge = SvPOK(tmpForm)
412 ? (SvCUR(tmpForm) * (IN_BYTES ? 1 : 3) + 1) : 0;
413 bool item_is_utf8 = FALSE;
414 bool targ_is_utf8 = FALSE;
420 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
421 if (SvREADONLY(tmpForm)) {
422 SvREADONLY_off(tmpForm);
423 parseres = doparseform(tmpForm);
424 SvREADONLY_on(tmpForm);
427 parseres = doparseform(tmpForm);
431 SvPV_force(PL_formtarget, len);
432 if (DO_UTF8(PL_formtarget))
434 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
436 f = SvPV_const(tmpForm, len);
437 /* need to jump to the next word */
438 fpc = (U32*)(f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN);
442 const char *name = "???";
445 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
446 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
447 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
448 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
449 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
451 case FF_CHECKNL: name = "CHECKNL"; break;
452 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
453 case FF_SPACE: name = "SPACE"; break;
454 case FF_HALFSPACE: name = "HALFSPACE"; break;
455 case FF_ITEM: name = "ITEM"; break;
456 case FF_CHOP: name = "CHOP"; break;
457 case FF_LINEGLOB: name = "LINEGLOB"; break;
458 case FF_NEWLINE: name = "NEWLINE"; break;
459 case FF_MORE: name = "MORE"; break;
460 case FF_LINEMARK: name = "LINEMARK"; break;
461 case FF_END: name = "END"; break;
462 case FF_0DECIMAL: name = "0DECIMAL"; break;
463 case FF_LINESNGL: name = "LINESNGL"; break;
466 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
468 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
479 if (targ_is_utf8 && !SvUTF8(tmpForm)) {
480 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
482 sv_catpvn_utf8_upgrade(PL_formtarget, f, arg, nsv);
483 t = SvEND(PL_formtarget);
486 if (!targ_is_utf8 && DO_UTF8(tmpForm)) {
487 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
489 sv_utf8_upgrade(PL_formtarget);
490 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
491 t = SvEND(PL_formtarget);
511 if (ckWARN(WARN_SYNTAX))
512 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
519 const char *s = item = SvPV_const(sv, len);
522 itemsize = sv_len_utf8(sv);
523 if (itemsize != (I32)len) {
525 if (itemsize > fieldsize) {
526 itemsize = fieldsize;
527 itembytes = itemsize;
528 sv_pos_u2b(sv, &itembytes, 0);
532 send = chophere = s + itembytes;
542 sv_pos_b2u(sv, &itemsize);
546 item_is_utf8 = FALSE;
547 if (itemsize > fieldsize)
548 itemsize = fieldsize;
549 send = chophere = s + itemsize;
563 const char *s = item = SvPV_const(sv, len);
566 itemsize = sv_len_utf8(sv);
567 if (itemsize != (I32)len) {
569 if (itemsize <= fieldsize) {
570 const char *send = chophere = s + itemsize;
583 itemsize = fieldsize;
584 itembytes = itemsize;
585 sv_pos_u2b(sv, &itembytes, 0);
586 send = chophere = s + itembytes;
587 while (s < send || (s == send && isSPACE(*s))) {
597 if (strchr(PL_chopset, *s))
602 itemsize = chophere - item;
603 sv_pos_b2u(sv, &itemsize);
609 item_is_utf8 = FALSE;
610 if (itemsize <= fieldsize) {
611 const char *const send = chophere = s + itemsize;
624 itemsize = fieldsize;
625 send = chophere = s + itemsize;
626 while (s < send || (s == send && isSPACE(*s))) {
636 if (strchr(PL_chopset, *s))
641 itemsize = chophere - item;
647 arg = fieldsize - itemsize;
656 arg = fieldsize - itemsize;
667 const char *s = item;
671 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
673 sv_utf8_upgrade(PL_formtarget);
674 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
675 t = SvEND(PL_formtarget);
679 if (UTF8_IS_CONTINUED(*s)) {
680 STRLEN skip = UTF8SKIP(s);
697 if ( !((*t++ = *s++) & ~31) )
703 if (targ_is_utf8 && !item_is_utf8) {
704 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
706 sv_catpvn_utf8_upgrade(PL_formtarget, s, arg, nsv);
707 for (; t < SvEND(PL_formtarget); t++) {
720 const int ch = *t++ = *s++;
723 if ( !((*t++ = *s++) & ~31) )
732 const char *s = chophere;
734 while (*s && isSPACE(*s))
750 const char *s = item = SvPV_const(sv, len);
752 if ((item_is_utf8 = DO_UTF8(sv)))
753 itemsize = sv_len_utf8(sv);
755 bool chopped = FALSE;
756 const char *const send = s + len;
758 chophere = s + itemsize;
774 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
776 SvUTF8_on(PL_formtarget);
778 SvCUR_set(sv, chophere - item);
779 sv_catsv(PL_formtarget, sv);
780 SvCUR_set(sv, itemsize);
782 sv_catsv(PL_formtarget, sv);
784 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) - 1);
785 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
786 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
795 #if defined(USE_LONG_DOUBLE)
796 fmt = (arg & 256) ? "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl;
798 fmt = (arg & 256) ? "%#0*.*f" : "%0*.*f";
803 #if defined(USE_LONG_DOUBLE)
804 fmt = (arg & 256) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl;
806 fmt = (arg & 256) ? "%#*.*f" : "%*.*f";
809 /* If the field is marked with ^ and the value is undefined,
811 if ((arg & 512) && !SvOK(sv)) {
819 /* overflow evidence */
820 if (num_overflow(value, fieldsize, arg)) {
826 /* Formats aren't yet marked for locales, so assume "yes". */
828 STORE_NUMERIC_STANDARD_SET_LOCAL();
829 sprintf(t, fmt, (int) fieldsize, (int) arg & 255, value);
830 RESTORE_NUMERIC_STANDARD();
837 while (t-- > linemark && *t == ' ') ;
845 if (arg) { /* repeat until fields exhausted? */
847 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
848 lines += FmLINES(PL_formtarget);
851 if (strnEQ(linemark, linemark - arg, arg))
852 DIE(aTHX_ "Runaway format");
855 SvUTF8_on(PL_formtarget);
856 FmLINES(PL_formtarget) = lines;
858 RETURNOP(cLISTOP->op_first);
869 const char *s = chophere;
870 const char *send = item + len;
872 while (*s && isSPACE(*s) && s < send)
877 arg = fieldsize - itemsize;
884 if (strnEQ(s1," ",3)) {
885 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
896 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
898 SvUTF8_on(PL_formtarget);
899 FmLINES(PL_formtarget) += lines;
911 if (PL_stack_base + *PL_markstack_ptr == SP) {
913 if (GIMME_V == G_SCALAR)
914 XPUSHs(sv_2mortal(newSViv(0)));
915 RETURNOP(PL_op->op_next->op_next);
917 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
918 pp_pushmark(); /* push dst */
919 pp_pushmark(); /* push src */
920 ENTER; /* enter outer scope */
923 if (PL_op->op_private & OPpGREP_LEX)
924 SAVESPTR(PAD_SVl(PL_op->op_targ));
927 ENTER; /* enter inner scope */
930 src = PL_stack_base[*PL_markstack_ptr];
932 if (PL_op->op_private & OPpGREP_LEX)
933 PAD_SVl(PL_op->op_targ) = src;
938 if (PL_op->op_type == OP_MAPSTART)
939 pp_pushmark(); /* push top */
940 return ((LOGOP*)PL_op->op_next)->op_other;
945 DIE(aTHX_ "panic: mapstart"); /* uses grepstart */
951 const I32 gimme = GIMME_V;
952 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
958 /* first, move source pointer to the next item in the source list */
959 ++PL_markstack_ptr[-1];
961 /* if there are new items, push them into the destination list */
962 if (items && gimme != G_VOID) {
963 /* might need to make room back there first */
964 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
965 /* XXX this implementation is very pessimal because the stack
966 * is repeatedly extended for every set of items. Is possible
967 * to do this without any stack extension or copying at all
968 * by maintaining a separate list over which the map iterates
969 * (like foreach does). --gsar */
971 /* everything in the stack after the destination list moves
972 * towards the end the stack by the amount of room needed */
973 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
975 /* items to shift up (accounting for the moved source pointer) */
976 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
978 /* This optimization is by Ben Tilly and it does
979 * things differently from what Sarathy (gsar)
980 * is describing. The downside of this optimization is
981 * that leaves "holes" (uninitialized and hopefully unused areas)
982 * to the Perl stack, but on the other hand this
983 * shouldn't be a problem. If Sarathy's idea gets
984 * implemented, this optimization should become
985 * irrelevant. --jhi */
987 shift = count; /* Avoid shifting too often --Ben Tilly */
992 PL_markstack_ptr[-1] += shift;
993 *PL_markstack_ptr += shift;
997 /* copy the new items down to the destination list */
998 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
999 if (gimme == G_ARRAY) {
1001 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
1004 /* scalar context: we don't care about which values map returns
1005 * (we use undef here). And so we certainly don't want to do mortal
1006 * copies of meaningless values. */
1007 while (items-- > 0) {
1009 *dst-- = &PL_sv_undef;
1013 LEAVE; /* exit inner scope */
1016 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
1018 (void)POPMARK; /* pop top */
1019 LEAVE; /* exit outer scope */
1020 (void)POPMARK; /* pop src */
1021 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1022 (void)POPMARK; /* pop dst */
1023 SP = PL_stack_base + POPMARK; /* pop original mark */
1024 if (gimme == G_SCALAR) {
1025 if (PL_op->op_private & OPpGREP_LEX) {
1026 SV* sv = sv_newmortal();
1027 sv_setiv(sv, items);
1035 else if (gimme == G_ARRAY)
1042 ENTER; /* enter inner scope */
1045 /* set $_ to the new source item */
1046 src = PL_stack_base[PL_markstack_ptr[-1]];
1048 if (PL_op->op_private & OPpGREP_LEX)
1049 PAD_SVl(PL_op->op_targ) = src;
1053 RETURNOP(cLOGOP->op_other);
1061 if (GIMME == G_ARRAY)
1063 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1064 return cLOGOP->op_other;
1073 if (GIMME == G_ARRAY) {
1074 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1078 SV *targ = PAD_SV(PL_op->op_targ);
1081 if (PL_op->op_private & OPpFLIP_LINENUM) {
1082 if (GvIO(PL_last_in_gv)) {
1083 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1086 GV *gv = gv_fetchpv(".", TRUE, SVt_PV);
1087 if (gv && GvSV(gv)) flip = SvIV(sv) == SvIV(GvSV(gv));
1093 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1094 if (PL_op->op_flags & OPf_SPECIAL) {
1102 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1105 sv_setpvn(TARG, "", 0);
1111 /* This code tries to decide if "$left .. $right" should use the
1112 magical string increment, or if the range is numeric (we make
1113 an exception for .."0" [#18165]). AMS 20021031. */
1115 #define RANGE_IS_NUMERIC(left,right) ( \
1116 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1117 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1118 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1119 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1120 && (!SvOK(right) || looks_like_number(right))))
1126 if (GIMME == G_ARRAY) {
1129 if (SvGMAGICAL(left))
1131 if (SvGMAGICAL(right))
1134 if (RANGE_IS_NUMERIC(left,right)) {
1137 if ((SvOK(left) && SvNV(left) < IV_MIN) ||
1138 (SvOK(right) && SvNV(right) > IV_MAX))
1139 DIE(aTHX_ "Range iterator outside integer range");
1150 SV * const sv = sv_2mortal(newSViv(i++));
1155 SV *final = sv_mortalcopy(right);
1157 const char *tmps = SvPV_const(final, len);
1159 SV *sv = sv_mortalcopy(left);
1160 SvPV_force_nolen(sv);
1161 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1163 if (strEQ(SvPVX_const(sv),tmps))
1165 sv = sv_2mortal(newSVsv(sv));
1172 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1176 if (PL_op->op_private & OPpFLIP_LINENUM) {
1177 if (GvIO(PL_last_in_gv)) {
1178 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1181 GV * const gv = gv_fetchpv(".", TRUE, SVt_PV);
1182 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1190 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1191 sv_catpvn(targ, "E0", 2);
1201 static const char * const context_name[] = {
1212 S_dopoptolabel(pTHX_ const char *label)
1216 for (i = cxstack_ix; i >= 0; i--) {
1217 register const PERL_CONTEXT * const cx = &cxstack[i];
1218 switch (CxTYPE(cx)) {
1224 if (ckWARN(WARN_EXITING))
1225 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1226 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1227 if (CxTYPE(cx) == CXt_NULL)
1231 if ( !cx->blk_loop.label || strNE(label, cx->blk_loop.label) ) {
1232 DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1233 (long)i, cx->blk_loop.label));
1236 DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1244 Perl_dowantarray(pTHX)
1246 const I32 gimme = block_gimme();
1247 return (gimme == G_VOID) ? G_SCALAR : gimme;
1251 Perl_block_gimme(pTHX)
1253 const I32 cxix = dopoptosub(cxstack_ix);
1257 switch (cxstack[cxix].blk_gimme) {
1265 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1272 Perl_is_lvalue_sub(pTHX)
1274 const I32 cxix = dopoptosub(cxstack_ix);
1275 assert(cxix >= 0); /* We should only be called from inside subs */
1277 if (cxstack[cxix].blk_sub.lval && CvLVALUE(cxstack[cxix].blk_sub.cv))
1278 return cxstack[cxix].blk_sub.lval;
1284 S_dopoptosub(pTHX_ I32 startingblock)
1286 return dopoptosub_at(cxstack, startingblock);
1290 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1293 for (i = startingblock; i >= 0; i--) {
1294 register const PERL_CONTEXT * const cx = &cxstk[i];
1295 switch (CxTYPE(cx)) {
1301 DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1309 S_dopoptoeval(pTHX_ I32 startingblock)
1312 for (i = startingblock; i >= 0; i--) {
1313 register const PERL_CONTEXT *cx = &cxstack[i];
1314 switch (CxTYPE(cx)) {
1318 DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1326 S_dopoptoloop(pTHX_ I32 startingblock)
1329 for (i = startingblock; i >= 0; i--) {
1330 register const PERL_CONTEXT * const cx = &cxstack[i];
1331 switch (CxTYPE(cx)) {
1337 if (ckWARN(WARN_EXITING))
1338 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1339 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1340 if ((CxTYPE(cx)) == CXt_NULL)
1344 DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1352 Perl_dounwind(pTHX_ I32 cxix)
1356 while (cxstack_ix > cxix) {
1358 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1359 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1360 (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1361 /* Note: we don't need to restore the base context info till the end. */
1362 switch (CxTYPE(cx)) {
1365 continue; /* not break */
1384 PERL_UNUSED_VAR(optype);
1388 Perl_qerror(pTHX_ SV *err)
1391 sv_catsv(ERRSV, err);
1393 sv_catsv(PL_errors, err);
1395 Perl_warn(aTHX_ "%"SVf, err);
1400 Perl_die_where(pTHX_ const char *message, STRLEN msglen)
1409 if (PL_in_eval & EVAL_KEEPERR) {
1410 static const char prefix[] = "\t(in cleanup) ";
1412 const char *e = Nullch;
1414 sv_setpvn(err,"",0);
1415 else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1417 e = SvPV_const(err, len);
1419 if (*e != *message || strNE(e,message))
1423 SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1424 sv_catpvn(err, prefix, sizeof(prefix)-1);
1425 sv_catpvn(err, message, msglen);
1426 if (ckWARN(WARN_MISC)) {
1427 const STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1428 Perl_warner(aTHX_ packWARN(WARN_MISC), SvPVX_const(err)+start);
1433 sv_setpvn(ERRSV, message, msglen);
1437 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1438 && PL_curstackinfo->si_prev)
1446 register PERL_CONTEXT *cx;
1449 if (cxix < cxstack_ix)
1452 POPBLOCK(cx,PL_curpm);
1453 if (CxTYPE(cx) != CXt_EVAL) {
1455 message = SvPVx_const(ERRSV, msglen);
1456 PerlIO_write(Perl_error_log, "panic: die ", 11);
1457 PerlIO_write(Perl_error_log, message, msglen);
1462 if (gimme == G_SCALAR)
1463 *++newsp = &PL_sv_undef;
1464 PL_stack_sp = newsp;
1468 /* LEAVE could clobber PL_curcop (see save_re_context())
1469 * XXX it might be better to find a way to avoid messing with
1470 * PL_curcop in save_re_context() instead, but this is a more
1471 * minimal fix --GSAR */
1472 PL_curcop = cx->blk_oldcop;
1474 if (optype == OP_REQUIRE) {
1475 const char* msg = SvPVx_nolen_const(ERRSV);
1476 SV * const nsv = cx->blk_eval.old_namesv;
1477 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
1479 DIE(aTHX_ "%sCompilation failed in require",
1480 *msg ? msg : "Unknown error\n");
1482 assert(CxTYPE(cx) == CXt_EVAL);
1483 return cx->blk_eval.retop;
1487 message = SvPVx_const(ERRSV, msglen);
1489 write_to_stderr(message, msglen);
1498 if (SvTRUE(left) != SvTRUE(right))
1510 RETURNOP(cLOGOP->op_other);
1519 RETURNOP(cLOGOP->op_other);
1528 if (!sv || !SvANY(sv)) {
1529 RETURNOP(cLOGOP->op_other);
1532 switch (SvTYPE(sv)) {
1534 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
1538 if (HvARRAY(sv) || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
1542 if (CvROOT(sv) || CvXSUB(sv))
1552 RETURNOP(cLOGOP->op_other);
1558 register I32 cxix = dopoptosub(cxstack_ix);
1559 register const PERL_CONTEXT *cx;
1560 register const PERL_CONTEXT *ccstack = cxstack;
1561 const PERL_SI *top_si = PL_curstackinfo;
1563 const char *stashname;
1570 /* we may be in a higher stacklevel, so dig down deeper */
1571 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1572 top_si = top_si->si_prev;
1573 ccstack = top_si->si_cxstack;
1574 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1577 if (GIMME != G_ARRAY) {
1583 /* caller() should not report the automatic calls to &DB::sub */
1584 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1585 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1589 cxix = dopoptosub_at(ccstack, cxix - 1);
1592 cx = &ccstack[cxix];
1593 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1594 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1595 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1596 field below is defined for any cx. */
1597 /* caller() should not report the automatic calls to &DB::sub */
1598 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1599 cx = &ccstack[dbcxix];
1602 stashname = CopSTASHPV(cx->blk_oldcop);
1603 if (GIMME != G_ARRAY) {
1606 PUSHs(&PL_sv_undef);
1609 sv_setpv(TARG, stashname);
1618 PUSHs(&PL_sv_undef);
1620 PUSHs(sv_2mortal(newSVpv(stashname, 0)));
1621 PUSHs(sv_2mortal(newSVpv(OutCopFILE(cx->blk_oldcop), 0)));
1622 PUSHs(sv_2mortal(newSViv((I32)CopLINE(cx->blk_oldcop))));
1625 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1626 GV *cvgv = CvGV(ccstack[cxix].blk_sub.cv);
1627 /* So is ccstack[dbcxix]. */
1629 SV * const sv = NEWSV(49, 0);
1630 gv_efullname3(sv, cvgv, Nullch);
1631 PUSHs(sv_2mortal(sv));
1632 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1635 PUSHs(sv_2mortal(newSVpvn("(unknown)",9)));
1636 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1640 PUSHs(sv_2mortal(newSVpvn("(eval)",6)));
1641 PUSHs(sv_2mortal(newSViv(0)));
1643 gimme = (I32)cx->blk_gimme;
1644 if (gimme == G_VOID)
1645 PUSHs(&PL_sv_undef);
1647 PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1648 if (CxTYPE(cx) == CXt_EVAL) {
1650 if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1651 PUSHs(cx->blk_eval.cur_text);
1655 else if (cx->blk_eval.old_namesv) {
1656 PUSHs(sv_2mortal(newSVsv(cx->blk_eval.old_namesv)));
1659 /* eval BLOCK (try blocks have old_namesv == 0) */
1661 PUSHs(&PL_sv_undef);
1662 PUSHs(&PL_sv_undef);
1666 PUSHs(&PL_sv_undef);
1667 PUSHs(&PL_sv_undef);
1669 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs
1670 && CopSTASH_eq(PL_curcop, PL_debstash))
1672 AV * const ary = cx->blk_sub.argarray;
1673 const int off = AvARRAY(ary) - AvALLOC(ary);
1677 PL_dbargs = GvAV(gv_AVadd(tmpgv = gv_fetchpv("DB::args", TRUE,
1680 AvREAL_off(PL_dbargs); /* XXX should be REIFY (see av.h) */
1683 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1684 av_extend(PL_dbargs, AvFILLp(ary) + off);
1685 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1686 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1688 /* XXX only hints propagated via op_private are currently
1689 * visible (others are not easily accessible, since they
1690 * use the global PL_hints) */
1691 PUSHs(sv_2mortal(newSViv((I32)cx->blk_oldcop->op_private &
1692 HINT_PRIVATE_MASK)));
1695 SV * old_warnings = cx->blk_oldcop->cop_warnings ;
1697 if (old_warnings == pWARN_NONE ||
1698 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
1699 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1700 else if (old_warnings == pWARN_ALL ||
1701 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1702 /* Get the bit mask for $warnings::Bits{all}, because
1703 * it could have been extended by warnings::register */
1705 HV *bits = get_hv("warnings::Bits", FALSE);
1706 if (bits && (bits_all=hv_fetch(bits, "all", 3, FALSE))) {
1707 mask = newSVsv(*bits_all);
1710 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1714 mask = newSVsv(old_warnings);
1715 PUSHs(sv_2mortal(mask));
1729 sv_reset(tmps, CopSTASH(PL_curcop));
1739 /* like pp_nextstate, but used instead when the debugger is active */
1744 PL_curcop = (COP*)PL_op;
1745 TAINT_NOT; /* Each statement is presumed innocent */
1746 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1749 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1750 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1754 register PERL_CONTEXT *cx;
1755 const I32 gimme = G_ARRAY;
1762 DIE(aTHX_ "No DB::DB routine defined");
1764 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1765 /* don't do recursive DB::DB call */
1777 PUSHBLOCK(cx, CXt_SUB, SP);
1779 cx->blk_sub.retop = PL_op->op_next;
1781 PAD_SET_CUR(CvPADLIST(cv),1);
1782 RETURNOP(CvSTART(cv));
1796 register PERL_CONTEXT *cx;
1797 const I32 gimme = GIMME_V;
1799 U32 cxtype = CXt_LOOP;
1807 if (PL_op->op_targ) {
1808 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
1809 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
1810 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
1811 SVs_PADSTALE, SVs_PADSTALE);
1813 #ifndef USE_ITHREADS
1814 svp = &PAD_SVl(PL_op->op_targ); /* "my" variable */
1817 SAVEPADSV(PL_op->op_targ);
1818 iterdata = INT2PTR(void*, PL_op->op_targ);
1819 cxtype |= CXp_PADVAR;
1824 svp = &GvSV(gv); /* symbol table variable */
1825 SAVEGENERICSV(*svp);
1828 iterdata = (void*)gv;
1834 PUSHBLOCK(cx, cxtype, SP);
1836 PUSHLOOP(cx, iterdata, MARK);
1838 PUSHLOOP(cx, svp, MARK);
1840 if (PL_op->op_flags & OPf_STACKED) {
1841 cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1842 if (SvTYPE(cx->blk_loop.iterary) != SVt_PVAV) {
1844 SV *right = (SV*)cx->blk_loop.iterary;
1845 if (RANGE_IS_NUMERIC(sv,right)) {
1846 if ((SvOK(sv) && SvNV(sv) < IV_MIN) ||
1847 (SvOK(right) && SvNV(right) >= IV_MAX))
1848 DIE(aTHX_ "Range iterator outside integer range");
1849 cx->blk_loop.iterix = SvIV(sv);
1850 cx->blk_loop.itermax = SvIV(right);
1853 cx->blk_loop.iterlval = newSVsv(sv);
1854 (void) SvPV_force_nolen(cx->blk_loop.iterlval);
1855 (void) SvPV_nolen_const(right);
1858 else if (PL_op->op_private & OPpITER_REVERSED) {
1859 cx->blk_loop.itermax = -1;
1860 cx->blk_loop.iterix = AvFILL(cx->blk_loop.iterary);
1865 cx->blk_loop.iterary = PL_curstack;
1866 AvFILLp(PL_curstack) = SP - PL_stack_base;
1867 if (PL_op->op_private & OPpITER_REVERSED) {
1868 cx->blk_loop.itermax = MARK - PL_stack_base;
1869 cx->blk_loop.iterix = cx->blk_oldsp;
1872 cx->blk_loop.iterix = MARK - PL_stack_base;
1882 register PERL_CONTEXT *cx;
1883 const I32 gimme = GIMME_V;
1889 PUSHBLOCK(cx, CXt_LOOP, SP);
1890 PUSHLOOP(cx, 0, SP);
1898 register PERL_CONTEXT *cx;
1905 assert(CxTYPE(cx) == CXt_LOOP);
1907 newsp = PL_stack_base + cx->blk_loop.resetsp;
1910 if (gimme == G_VOID)
1912 else if (gimme == G_SCALAR) {
1914 *++newsp = sv_mortalcopy(*SP);
1916 *++newsp = &PL_sv_undef;
1920 *++newsp = sv_mortalcopy(*++mark);
1921 TAINT_NOT; /* Each item is independent */
1927 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
1928 PL_curpm = newpm; /* ... and pop $1 et al */
1940 register PERL_CONTEXT *cx;
1941 bool popsub2 = FALSE;
1942 bool clear_errsv = FALSE;
1950 if (PL_curstackinfo->si_type == PERLSI_SORT) {
1951 if (cxstack_ix == PL_sortcxix
1952 || dopoptosub(cxstack_ix) <= PL_sortcxix)
1954 if (cxstack_ix > PL_sortcxix)
1955 dounwind(PL_sortcxix);
1956 AvARRAY(PL_curstack)[1] = *SP;
1957 PL_stack_sp = PL_stack_base + 1;
1962 cxix = dopoptosub(cxstack_ix);
1964 DIE(aTHX_ "Can't return outside a subroutine");
1965 if (cxix < cxstack_ix)
1969 switch (CxTYPE(cx)) {
1972 retop = cx->blk_sub.retop;
1973 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
1976 if (!(PL_in_eval & EVAL_KEEPERR))
1979 retop = cx->blk_eval.retop;
1983 if (optype == OP_REQUIRE &&
1984 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
1986 /* Unassume the success we assumed earlier. */
1987 SV * const nsv = cx->blk_eval.old_namesv;
1988 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
1989 DIE(aTHX_ "%"SVf" did not return a true value", nsv);
1994 retop = cx->blk_sub.retop;
1997 DIE(aTHX_ "panic: return");
2001 if (gimme == G_SCALAR) {
2004 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2006 *++newsp = SvREFCNT_inc(*SP);
2011 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
2013 *++newsp = sv_mortalcopy(sv);
2018 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
2021 *++newsp = sv_mortalcopy(*SP);
2024 *++newsp = &PL_sv_undef;
2026 else if (gimme == G_ARRAY) {
2027 while (++MARK <= SP) {
2028 *++newsp = (popsub2 && SvTEMP(*MARK))
2029 ? *MARK : sv_mortalcopy(*MARK);
2030 TAINT_NOT; /* Each item is independent */
2033 PL_stack_sp = newsp;
2036 /* Stack values are safe: */
2039 POPSUB(cx,sv); /* release CV and @_ ... */
2043 PL_curpm = newpm; /* ... and pop $1 et al */
2047 sv_setpvn(ERRSV,"",0);
2055 register PERL_CONTEXT *cx;
2065 if (PL_op->op_flags & OPf_SPECIAL) {
2066 cxix = dopoptoloop(cxstack_ix);
2068 DIE(aTHX_ "Can't \"last\" outside a loop block");
2071 cxix = dopoptolabel(cPVOP->op_pv);
2073 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
2075 if (cxix < cxstack_ix)
2079 PERL_UNUSED_VAR(optype);
2080 cxstack_ix++; /* temporarily protect top context */
2082 switch (CxTYPE(cx)) {
2085 newsp = PL_stack_base + cx->blk_loop.resetsp;
2086 nextop = cx->blk_loop.last_op->op_next;
2090 nextop = cx->blk_sub.retop;
2094 nextop = cx->blk_eval.retop;
2098 nextop = cx->blk_sub.retop;
2101 DIE(aTHX_ "panic: last");
2105 if (gimme == G_SCALAR) {
2107 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
2108 ? *SP : sv_mortalcopy(*SP);
2110 *++newsp = &PL_sv_undef;
2112 else if (gimme == G_ARRAY) {
2113 while (++MARK <= SP) {
2114 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
2115 ? *MARK : sv_mortalcopy(*MARK);
2116 TAINT_NOT; /* Each item is independent */
2124 /* Stack values are safe: */
2127 POPLOOP(cx); /* release loop vars ... */
2131 POPSUB(cx,sv); /* release CV and @_ ... */
2134 PL_curpm = newpm; /* ... and pop $1 et al */
2144 register PERL_CONTEXT *cx;
2147 if (PL_op->op_flags & OPf_SPECIAL) {
2148 cxix = dopoptoloop(cxstack_ix);
2150 DIE(aTHX_ "Can't \"next\" outside a loop block");
2153 cxix = dopoptolabel(cPVOP->op_pv);
2155 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
2157 if (cxix < cxstack_ix)
2160 /* clear off anything above the scope we're re-entering, but
2161 * save the rest until after a possible continue block */
2162 inner = PL_scopestack_ix;
2164 if (PL_scopestack_ix < inner)
2165 leave_scope(PL_scopestack[PL_scopestack_ix]);
2166 PL_curcop = cx->blk_oldcop;
2167 return cx->blk_loop.next_op;
2174 register PERL_CONTEXT *cx;
2178 if (PL_op->op_flags & OPf_SPECIAL) {
2179 cxix = dopoptoloop(cxstack_ix);
2181 DIE(aTHX_ "Can't \"redo\" outside a loop block");
2184 cxix = dopoptolabel(cPVOP->op_pv);
2186 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
2188 if (cxix < cxstack_ix)
2191 redo_op = cxstack[cxix].blk_loop.redo_op;
2192 if (redo_op->op_type == OP_ENTER) {
2193 /* pop one less context to avoid $x being freed in while (my $x..) */
2195 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2196 redo_op = redo_op->op_next;
2200 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2201 LEAVE_SCOPE(oldsave);
2203 PL_curcop = cx->blk_oldcop;
2208 S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
2212 static const char too_deep[] = "Target of goto is too deeply nested";
2215 Perl_croak(aTHX_ too_deep);
2216 if (o->op_type == OP_LEAVE ||
2217 o->op_type == OP_SCOPE ||
2218 o->op_type == OP_LEAVELOOP ||
2219 o->op_type == OP_LEAVESUB ||
2220 o->op_type == OP_LEAVETRY)
2222 *ops++ = cUNOPo->op_first;
2224 Perl_croak(aTHX_ too_deep);
2227 if (o->op_flags & OPf_KIDS) {
2228 /* First try all the kids at this level, since that's likeliest. */
2229 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2230 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2231 kCOP->cop_label && strEQ(kCOP->cop_label, label))
2234 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2235 if (kid == PL_lastgotoprobe)
2237 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2240 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2241 ops[-1]->op_type == OP_DBSTATE)
2246 if ((o = dofindlabel(kid, label, ops, oplimit)))
2265 register PERL_CONTEXT *cx;
2266 #define GOTO_DEPTH 64
2267 OP *enterops[GOTO_DEPTH];
2268 const char *label = 0;
2269 const bool do_dump = (PL_op->op_type == OP_DUMP);
2270 static const char must_have_label[] = "goto must have label";
2272 if (PL_op->op_flags & OPf_STACKED) {
2275 /* This egregious kludge implements goto &subroutine */
2276 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2278 register PERL_CONTEXT *cx;
2279 CV* cv = (CV*)SvRV(sv);
2286 if (!CvROOT(cv) && !CvXSUB(cv)) {
2287 const GV * const gv = CvGV(cv);
2291 /* autoloaded stub? */
2292 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2294 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
2295 GvNAMELEN(gv), FALSE);
2296 if (autogv && (cv = GvCV(autogv)))
2298 tmpstr = sv_newmortal();
2299 gv_efullname3(tmpstr, gv, Nullch);
2300 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",tmpstr);
2302 DIE(aTHX_ "Goto undefined subroutine");
2305 /* First do some returnish stuff. */
2306 (void)SvREFCNT_inc(cv); /* avoid premature free during unwind */
2308 cxix = dopoptosub(cxstack_ix);
2310 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2311 if (cxix < cxstack_ix)
2315 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2316 if (CxTYPE(cx) == CXt_EVAL) {
2318 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2320 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2322 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs) {
2323 /* put @_ back onto stack */
2324 AV* av = cx->blk_sub.argarray;
2326 items = AvFILLp(av) + 1;
2327 EXTEND(SP, items+1); /* @_ could have been extended. */
2328 Copy(AvARRAY(av), SP + 1, items, SV*);
2329 SvREFCNT_dec(GvAV(PL_defgv));
2330 GvAV(PL_defgv) = cx->blk_sub.savearray;
2332 /* abandon @_ if it got reified */
2337 av_extend(av, items-1);
2339 PAD_SVl(0) = (SV*)(cx->blk_sub.argarray = av);
2342 else if (CvXSUB(cv)) { /* put GvAV(defgv) back onto stack */
2344 av = GvAV(PL_defgv);
2345 items = AvFILLp(av) + 1;
2346 EXTEND(SP, items+1); /* @_ could have been extended. */
2347 Copy(AvARRAY(av), SP + 1, items, SV*);
2351 if (CxTYPE(cx) == CXt_SUB &&
2352 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2353 SvREFCNT_dec(cx->blk_sub.cv);
2354 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2355 LEAVE_SCOPE(oldsave);
2357 /* Now do some callish stuff. */
2359 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2361 OP* retop = cx->blk_sub.retop;
2364 for (index=0; index<items; index++)
2365 sv_2mortal(SP[-index]);
2367 #ifdef PERL_XSUB_OLDSTYLE
2368 if (CvOLDSTYLE(cv)) {
2369 I32 (*fp3)(int,int,int);
2374 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2375 items = (*fp3)(CvXSUBANY(cv).any_i32,
2376 mark - PL_stack_base + 1,
2378 SP = PL_stack_base + items;
2381 #endif /* PERL_XSUB_OLDSTYLE */
2386 /* XS subs don't have a CxSUB, so pop it */
2387 POPBLOCK(cx, PL_curpm);
2388 /* Push a mark for the start of arglist */
2391 (void)(*CvXSUB(cv))(aTHX_ cv);
2392 /* Put these at the bottom since the vars are set but not used */
2393 PERL_UNUSED_VAR(newsp);
2394 PERL_UNUSED_VAR(gimme);
2400 AV* padlist = CvPADLIST(cv);
2401 if (CxTYPE(cx) == CXt_EVAL) {
2402 PL_in_eval = cx->blk_eval.old_in_eval;
2403 PL_eval_root = cx->blk_eval.old_eval_root;
2404 cx->cx_type = CXt_SUB;
2405 cx->blk_sub.hasargs = 0;
2407 cx->blk_sub.cv = cv;
2408 cx->blk_sub.olddepth = (U16)CvDEPTH(cv);
2411 if (CvDEPTH(cv) < 2)
2412 (void)SvREFCNT_inc(cv);
2414 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION))
2415 sub_crush_depth(cv);
2416 pad_push(padlist, CvDEPTH(cv));
2418 PAD_SET_CUR(padlist, CvDEPTH(cv));
2419 if (cx->blk_sub.hasargs)
2421 AV* av = (AV*)PAD_SVl(0);
2424 cx->blk_sub.savearray = GvAV(PL_defgv);
2425 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2426 CX_CURPAD_SAVE(cx->blk_sub);
2427 cx->blk_sub.argarray = av;
2429 if (items >= AvMAX(av) + 1) {
2431 if (AvARRAY(av) != ary) {
2432 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2433 SvPV_set(av, (char*)ary);
2435 if (items >= AvMAX(av) + 1) {
2436 AvMAX(av) = items - 1;
2437 Renew(ary,items+1,SV*);
2439 SvPV_set(av, (char*)ary);
2443 Copy(mark,AvARRAY(av),items,SV*);
2444 AvFILLp(av) = items - 1;
2445 assert(!AvREAL(av));
2447 /* transfer 'ownership' of refcnts to new @_ */
2457 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2459 * We do not care about using sv to call CV;
2460 * it's for informational purposes only.
2462 SV *sv = GvSV(PL_DBsub);
2466 if (PERLDB_SUB_NN) {
2467 int type = SvTYPE(sv);
2468 if (type < SVt_PVIV && type != SVt_IV)
2469 sv_upgrade(sv, SVt_PVIV);
2471 SvIV_set(sv, PTR2IV(cv)); /* Do it the quickest way */
2473 gv_efullname3(sv, CvGV(cv), Nullch);
2476 && (gotocv = get_cv("DB::goto", FALSE)) ) {
2477 PUSHMARK( PL_stack_sp );
2478 call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2482 RETURNOP(CvSTART(cv));
2486 label = SvPV_nolen_const(sv);
2487 if (!(do_dump || *label))
2488 DIE(aTHX_ must_have_label);
2491 else if (PL_op->op_flags & OPf_SPECIAL) {
2493 DIE(aTHX_ must_have_label);
2496 label = cPVOP->op_pv;
2498 if (label && *label) {
2500 bool leaving_eval = FALSE;
2501 bool in_block = FALSE;
2502 PERL_CONTEXT *last_eval_cx = 0;
2506 PL_lastgotoprobe = 0;
2508 for (ix = cxstack_ix; ix >= 0; ix--) {
2510 switch (CxTYPE(cx)) {
2512 leaving_eval = TRUE;
2513 if (!CxTRYBLOCK(cx)) {
2514 gotoprobe = (last_eval_cx ?
2515 last_eval_cx->blk_eval.old_eval_root :
2520 /* else fall through */
2522 gotoprobe = cx->blk_oldcop->op_sibling;
2528 gotoprobe = cx->blk_oldcop->op_sibling;
2531 gotoprobe = PL_main_root;
2534 if (CvDEPTH(cx->blk_sub.cv)) {
2535 gotoprobe = CvROOT(cx->blk_sub.cv);
2541 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2544 DIE(aTHX_ "panic: goto");
2545 gotoprobe = PL_main_root;
2549 retop = dofindlabel(gotoprobe, label,
2550 enterops, enterops + GOTO_DEPTH);
2554 PL_lastgotoprobe = gotoprobe;
2557 DIE(aTHX_ "Can't find label %s", label);
2559 /* if we're leaving an eval, check before we pop any frames
2560 that we're not going to punt, otherwise the error
2563 if (leaving_eval && *enterops && enterops[1]) {
2565 for (i = 1; enterops[i]; i++)
2566 if (enterops[i]->op_type == OP_ENTERITER)
2567 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2570 /* pop unwanted frames */
2572 if (ix < cxstack_ix) {
2579 oldsave = PL_scopestack[PL_scopestack_ix];
2580 LEAVE_SCOPE(oldsave);
2583 /* push wanted frames */
2585 if (*enterops && enterops[1]) {
2587 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
2588 for (; enterops[ix]; ix++) {
2589 PL_op = enterops[ix];
2590 /* Eventually we may want to stack the needed arguments
2591 * for each op. For now, we punt on the hard ones. */
2592 if (PL_op->op_type == OP_ENTERITER)
2593 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2594 CALL_FPTR(PL_op->op_ppaddr)(aTHX);
2602 if (!retop) retop = PL_main_start;
2604 PL_restartop = retop;
2605 PL_do_undump = TRUE;
2609 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2610 PL_do_undump = FALSE;
2626 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
2628 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
2631 PL_exit_flags |= PERL_EXIT_EXPECTED;
2633 PUSHs(&PL_sv_undef);
2641 const NV value = SvNVx(GvSV(cCOP->cop_gv));
2642 register I32 match = I_32(value);
2645 if (((NV)match) > value)
2646 --match; /* was fractional--truncate other way */
2648 match -= cCOP->uop.scop.scop_offset;
2651 else if (match > cCOP->uop.scop.scop_max)
2652 match = cCOP->uop.scop.scop_max;
2653 PL_op = cCOP->uop.scop.scop_next[match];
2663 PL_op = PL_op->op_next; /* can't assume anything */
2665 match = *(SvPVx_nolen_const(GvSV(cCOP->cop_gv))) & 255;
2666 match -= cCOP->uop.scop.scop_offset;
2669 else if (match > cCOP->uop.scop.scop_max)
2670 match = cCOP->uop.scop.scop_max;
2671 PL_op = cCOP->uop.scop.scop_next[match];
2680 S_save_lines(pTHX_ AV *array, SV *sv)
2682 const char *s = SvPVX_const(sv);
2683 const char *send = SvPVX_const(sv) + SvCUR(sv);
2686 while (s && s < send) {
2688 SV *tmpstr = NEWSV(85,0);
2690 sv_upgrade(tmpstr, SVt_PVMG);
2691 t = strchr(s, '\n');
2697 sv_setpvn(tmpstr, s, t - s);
2698 av_store(array, line++, tmpstr);
2704 S_docatch_body(pTHX)
2711 S_docatch(pTHX_ OP *o)
2714 OP * const oldop = PL_op;
2718 assert(CATCH_GET == TRUE);
2725 assert(cxstack_ix >= 0);
2726 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2727 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
2732 /* die caught by an inner eval - continue inner loop */
2734 /* NB XXX we rely on the old popped CxEVAL still being at the top
2735 * of the stack; the way die_where() currently works, this
2736 * assumption is valid. In theory The cur_top_env value should be
2737 * returned in another global, the way retop (aka PL_restartop)
2739 assert(CxTYPE(&cxstack[cxstack_ix+1]) == CXt_EVAL);
2742 && cxstack[cxstack_ix+1].blk_eval.cur_top_env == PL_top_env)
2744 PL_op = PL_restartop;
2761 Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
2762 /* sv Text to convert to OP tree. */
2763 /* startop op_free() this to undo. */
2764 /* code Short string id of the caller. */
2766 dVAR; dSP; /* Make POPBLOCK work. */
2769 I32 gimme = 0; /* SUSPECT - INITIALZE TO WHAT? NI-S */
2773 char tbuf[TYPE_DIGITS(long) + 12 + 10];
2774 char *tmpbuf = tbuf;
2777 CV* runcv = Nullcv; /* initialise to avoid compiler warnings */
2782 /* switch to eval mode */
2784 if (IN_PERL_COMPILETIME) {
2785 SAVECOPSTASH_FREE(&PL_compiling);
2786 CopSTASH_set(&PL_compiling, PL_curstash);
2788 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
2789 SV *sv = sv_newmortal();
2790 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
2791 code, (unsigned long)++PL_evalseq,
2792 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
2796 sprintf(tmpbuf, "_<(%.10s_eval %lu)", code, (unsigned long)++PL_evalseq);
2797 SAVECOPFILE_FREE(&PL_compiling);
2798 CopFILE_set(&PL_compiling, tmpbuf+2);
2799 SAVECOPLINE(&PL_compiling);
2800 CopLINE_set(&PL_compiling, 1);
2801 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2802 deleting the eval's FILEGV from the stash before gv_check() runs
2803 (i.e. before run-time proper). To work around the coredump that
2804 ensues, we always turn GvMULTI_on for any globals that were
2805 introduced within evals. See force_ident(). GSAR 96-10-12 */
2806 safestr = savepv(tmpbuf);
2807 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
2809 #ifdef OP_IN_REGISTER
2815 /* we get here either during compilation, or via pp_regcomp at runtime */
2816 runtime = IN_PERL_RUNTIME;
2818 runcv = find_runcv(NULL);
2821 PL_op->op_type = OP_ENTEREVAL;
2822 PL_op->op_flags = 0; /* Avoid uninit warning. */
2823 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
2824 PUSHEVAL(cx, 0, Nullgv);
2827 rop = doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq);
2829 rop = doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax);
2830 POPBLOCK(cx,PL_curpm);
2833 (*startop)->op_type = OP_NULL;
2834 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
2836 /* XXX DAPM do this properly one year */
2837 *padp = (AV*)SvREFCNT_inc(PL_comppad);
2839 if (IN_PERL_COMPILETIME)
2840 PL_compiling.op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
2841 #ifdef OP_IN_REGISTER
2849 =for apidoc find_runcv
2851 Locate the CV corresponding to the currently executing sub or eval.
2852 If db_seqp is non_null, skip CVs that are in the DB package and populate
2853 *db_seqp with the cop sequence number at the point that the DB:: code was
2854 entered. (allows debuggers to eval in the scope of the breakpoint rather
2855 than in in the scope of the debugger itself).
2861 Perl_find_runcv(pTHX_ U32 *db_seqp)
2866 *db_seqp = PL_curcop->cop_seq;
2867 for (si = PL_curstackinfo; si; si = si->si_prev) {
2869 for (ix = si->si_cxix; ix >= 0; ix--) {
2870 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
2871 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
2872 CV * const cv = cx->blk_sub.cv;
2873 /* skip DB:: code */
2874 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
2875 *db_seqp = cx->blk_oldcop->cop_seq;
2880 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
2888 /* Compile a require/do, an eval '', or a /(?{...})/.
2889 * In the last case, startop is non-null, and contains the address of
2890 * a pointer that should be set to the just-compiled code.
2891 * outside is the lexically enclosing CV (if any) that invoked us.
2894 /* With USE_5005THREADS, eval_owner must be held on entry to doeval */
2896 S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq)
2901 PL_in_eval = ((saveop && saveop->op_type == OP_REQUIRE)
2902 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
2907 SAVESPTR(PL_compcv);
2908 PL_compcv = (CV*)NEWSV(1104,0);
2909 sv_upgrade((SV *)PL_compcv, SVt_PVCV);
2910 CvEVAL_on(PL_compcv);
2911 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2912 cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
2914 CvOUTSIDE_SEQ(PL_compcv) = seq;
2915 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outside);
2917 /* set up a scratch pad */
2919 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE);
2922 SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
2924 /* make sure we compile in the right package */
2926 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
2927 SAVESPTR(PL_curstash);
2928 PL_curstash = CopSTASH(PL_curcop);
2930 SAVESPTR(PL_beginav);
2931 PL_beginav = newAV();
2932 SAVEFREESV(PL_beginav);
2933 SAVEI32(PL_error_count);
2935 /* try to compile it */
2937 PL_eval_root = Nullop;
2939 PL_curcop = &PL_compiling;
2940 PL_curcop->cop_arybase = 0;
2941 if (saveop && saveop->op_flags & OPf_SPECIAL)
2942 PL_in_eval |= EVAL_KEEPERR;
2944 sv_setpvn(ERRSV,"",0);
2945 if (yyparse() || PL_error_count || !PL_eval_root) {
2946 SV **newsp; /* Used by POPBLOCK. */
2947 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
2948 I32 optype = 0; /* Might be reset by POPEVAL. */
2952 op_free(PL_eval_root);
2953 PL_eval_root = Nullop;
2955 SP = PL_stack_base + POPMARK; /* pop original mark */
2957 POPBLOCK(cx,PL_curpm);
2962 if (optype == OP_REQUIRE) {
2963 const char* const msg = SvPVx_nolen_const(ERRSV);
2964 const SV * const nsv = cx->blk_eval.old_namesv;
2965 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
2967 DIE(aTHX_ "%sCompilation failed in require",
2968 *msg ? msg : "Unknown error\n");
2971 const char* msg = SvPVx_nolen_const(ERRSV);
2973 POPBLOCK(cx,PL_curpm);
2975 Perl_croak(aTHX_ "%sCompilation failed in regexp",
2976 (*msg ? msg : "Unknown error\n"));
2979 const char* msg = SvPVx_nolen_const(ERRSV);
2981 sv_setpv(ERRSV, "Compilation error");
2986 CopLINE_set(&PL_compiling, 0);
2988 *startop = PL_eval_root;
2990 SAVEFREEOP(PL_eval_root);
2992 /* Set the context for this new optree.
2993 * If the last op is an OP_REQUIRE, force scalar context.
2994 * Otherwise, propagate the context from the eval(). */
2995 if (PL_eval_root->op_type == OP_LEAVEEVAL
2996 && cUNOPx(PL_eval_root)->op_first->op_type == OP_LINESEQ
2997 && cLISTOPx(cUNOPx(PL_eval_root)->op_first)->op_last->op_type
2999 scalar(PL_eval_root);
3000 else if (gimme & G_VOID)
3001 scalarvoid(PL_eval_root);
3002 else if (gimme & G_ARRAY)
3005 scalar(PL_eval_root);
3007 DEBUG_x(dump_eval());
3009 /* Register with debugger: */
3010 if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
3011 CV *cv = get_cv("DB::postponed", FALSE);
3015 XPUSHs((SV*)CopFILEGV(&PL_compiling));
3017 call_sv((SV*)cv, G_DISCARD);
3021 /* compiled okay, so do it */
3023 CvDEPTH(PL_compcv) = 1;
3024 SP = PL_stack_base + POPMARK; /* pop original mark */
3025 PL_op = saveop; /* The caller may need it. */
3026 PL_lex_state = LEX_NOTPARSING; /* $^S needs this. */
3028 RETURNOP(PL_eval_start);
3032 S_doopen_pm(pTHX_ const char *name, const char *mode)
3034 #ifndef PERL_DISABLE_PMC
3035 const STRLEN namelen = strlen(name);
3038 if (namelen > 3 && strEQ(name + namelen - 3, ".pm")) {
3039 SV *pmcsv = Perl_newSVpvf(aTHX_ "%s%c", name, 'c');
3040 const char * const pmc = SvPV_nolen_const(pmcsv);
3043 if (PerlLIO_stat(pmc, &pmcstat) < 0) {
3044 fp = PerlIO_open(name, mode);
3047 if (PerlLIO_stat(name, &pmstat) < 0 ||
3048 pmstat.st_mtime < pmcstat.st_mtime)
3050 fp = PerlIO_open(pmc, mode);
3053 fp = PerlIO_open(name, mode);
3056 SvREFCNT_dec(pmcsv);
3059 fp = PerlIO_open(name, mode);
3063 return PerlIO_open(name, mode);
3064 #endif /* !PERL_DISABLE_PMC */
3070 register PERL_CONTEXT *cx;
3074 const char *tryname = Nullch;
3075 SV *namesv = Nullsv;
3077 const I32 gimme = GIMME_V;
3078 PerlIO *tryrsfp = 0;
3079 int filter_has_file = 0;
3080 GV *filter_child_proc = 0;
3081 SV *filter_state = 0;
3088 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3089 if ( SvVOK(sv) && ckWARN(WARN_PORTABLE) ) /* require v5.6.1 */
3090 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
3091 "v-string in use/require non-portable");
3093 sv = new_version(sv);
3094 if (!sv_derived_from(PL_patchlevel, "version"))
3095 (void *)upg_version(PL_patchlevel);
3096 if ( vcmp(sv,PL_patchlevel) > 0 )
3097 DIE(aTHX_ "Perl %"SVf" required--this is only %"SVf", stopped",
3098 vnormal(sv), vnormal(PL_patchlevel));
3102 name = SvPV_const(sv, len);
3103 if (!(name && len > 0 && *name))
3104 DIE(aTHX_ "Null filename used");
3105 TAINT_PROPER("require");
3106 if (PL_op->op_type == OP_REQUIRE &&
3107 (svp = hv_fetch(GvHVn(PL_incgv), name, len, 0))) {
3108 if (*svp != &PL_sv_undef)
3111 DIE(aTHX_ "Compilation failed in require");
3114 /* prepare to compile file */
3116 if (path_is_absolute(name)) {
3118 tryrsfp = doopen_pm(name,PERL_SCRIPT_MODE);
3120 #ifdef MACOS_TRADITIONAL
3124 MacPerl_CanonDir(name, newname, 1);
3125 if (path_is_absolute(newname)) {
3127 tryrsfp = doopen_pm(newname,PERL_SCRIPT_MODE);
3132 AV *ar = GvAVn(PL_incgv);
3136 if ((unixname = tounixspec(name, Nullch)) != Nullch)
3139 namesv = NEWSV(806, 0);
3140 for (i = 0; i <= AvFILL(ar); i++) {
3141 SV *dirsv = *av_fetch(ar, i, TRUE);
3147 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3148 && !sv_isobject(loader))
3150 loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
3153 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3154 PTR2UV(SvRV(dirsv)), name);
3155 tryname = SvPVX_const(namesv);
3166 if (sv_isobject(loader))
3167 count = call_method("INC", G_ARRAY);
3169 count = call_sv(loader, G_ARRAY);
3179 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
3183 if (SvTYPE(arg) == SVt_PVGV) {
3184 IO *io = GvIO((GV *)arg);
3189 tryrsfp = IoIFP(io);
3190 if (IoTYPE(io) == IoTYPE_PIPE) {
3191 /* reading from a child process doesn't
3192 nest -- when returning from reading
3193 the inner module, the outer one is
3194 unreadable (closed?) I've tried to
3195 save the gv to manage the lifespan of
3196 the pipe, but this didn't help. XXX */
3197 filter_child_proc = (GV *)arg;
3198 (void)SvREFCNT_inc(filter_child_proc);
3201 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3202 PerlIO_close(IoOFP(io));
3214 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3216 (void)SvREFCNT_inc(filter_sub);
3219 filter_state = SP[i];
3220 (void)SvREFCNT_inc(filter_state);
3224 tryrsfp = PerlIO_open("/dev/null",
3240 filter_has_file = 0;
3241 if (filter_child_proc) {
3242 SvREFCNT_dec(filter_child_proc);
3243 filter_child_proc = 0;
3246 SvREFCNT_dec(filter_state);
3250 SvREFCNT_dec(filter_sub);
3255 if (!path_is_absolute(name)
3256 #ifdef MACOS_TRADITIONAL
3257 /* We consider paths of the form :a:b ambiguous and interpret them first
3258 as global then as local
3260 || (*name == ':' && name[1] != ':' && strchr(name+2, ':'))
3263 const char *dir = SvPVx_nolen_const(dirsv);
3264 #ifdef MACOS_TRADITIONAL
3268 MacPerl_CanonDir(name, buf2, 1);
3269 Perl_sv_setpvf(aTHX_ namesv, "%s%s", MacPerl_CanonDir(dir, buf1, 0), buf2+(buf2[0] == ':'));
3273 if ((unixdir = tounixpath(dir, Nullch)) == Nullch)
3275 sv_setpv(namesv, unixdir);
3276 sv_catpv(namesv, unixname);
3279 if (PL_origfilename[0] &&
3280 PL_origfilename[1] == ':' &&
3281 !(dir[0] && dir[1] == ':'))
3282 Perl_sv_setpvf(aTHX_ namesv,
3287 Perl_sv_setpvf(aTHX_ namesv,
3291 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3295 TAINT_PROPER("require");
3296 tryname = SvPVX_const(namesv);
3297 tryrsfp = doopen_pm(tryname, PERL_SCRIPT_MODE);
3299 if (tryname[0] == '.' && tryname[1] == '/')
3308 SAVECOPFILE_FREE(&PL_compiling);
3309 CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
3310 SvREFCNT_dec(namesv);
3312 if (PL_op->op_type == OP_REQUIRE) {
3313 const char *msgstr = name;
3314 if (namesv) { /* did we lookup @INC? */
3315 SV *msg = sv_2mortal(newSVpv(msgstr,0));
3316 SV *dirmsgsv = NEWSV(0, 0);
3317 AV *ar = GvAVn(PL_incgv);
3319 sv_catpvn(msg, " in @INC", 8);
3320 if (instr(SvPVX_const(msg), ".h "))
3321 sv_catpv(msg, " (change .h to .ph maybe?)");
3322 if (instr(SvPVX_const(msg), ".ph "))
3323 sv_catpv(msg, " (did you run h2ph?)");
3324 sv_catpv(msg, " (@INC contains:");
3325 for (i = 0; i <= AvFILL(ar); i++) {
3326 const char *dir = SvPVx_nolen_const(*av_fetch(ar, i, TRUE));
3327 Perl_sv_setpvf(aTHX_ dirmsgsv, " %s", dir);
3328 sv_catsv(msg, dirmsgsv);
3330 sv_catpvn(msg, ")", 1);
3331 SvREFCNT_dec(dirmsgsv);
3332 msgstr = SvPV_nolen_const(msg);
3334 DIE(aTHX_ "Can't locate %s", msgstr);
3340 SETERRNO(0, SS_NORMAL);
3342 /* Assume success here to prevent recursive requirement. */
3344 /* Check whether a hook in @INC has already filled %INC */
3345 if (!hook_sv || !(svp = hv_fetch(GvHVn(PL_incgv), name, len, 0))) {
3346 (void)hv_store(GvHVn(PL_incgv), name, len,
3347 (hook_sv ? SvREFCNT_inc(hook_sv)
3348 : newSVpv(CopFILE(&PL_compiling), 0)),
3354 lex_start(sv_2mortal(newSVpvn("",0)));
3355 SAVEGENERICSV(PL_rsfp_filters);
3356 PL_rsfp_filters = Nullav;
3361 SAVESPTR(PL_compiling.cop_warnings);
3362 if (PL_dowarn & G_WARN_ALL_ON)
3363 PL_compiling.cop_warnings = pWARN_ALL ;
3364 else if (PL_dowarn & G_WARN_ALL_OFF)
3365 PL_compiling.cop_warnings = pWARN_NONE ;
3366 else if (PL_taint_warn)
3367 PL_compiling.cop_warnings = newSVpvn(WARN_TAINTstring, WARNsize);
3369 PL_compiling.cop_warnings = pWARN_STD ;
3370 SAVESPTR(PL_compiling.cop_io);
3371 PL_compiling.cop_io = Nullsv;
3373 if (filter_sub || filter_child_proc) {
3374 SV *datasv = filter_add(run_user_filter, Nullsv);
3375 IoLINES(datasv) = filter_has_file;
3376 IoFMT_GV(datasv) = (GV *)filter_child_proc;
3377 IoTOP_GV(datasv) = (GV *)filter_state;
3378 IoBOTTOM_GV(datasv) = (GV *)filter_sub;
3381 /* switch to eval mode */
3382 PUSHBLOCK(cx, CXt_EVAL, SP);
3383 PUSHEVAL(cx, name, Nullgv);
3384 cx->blk_eval.retop = PL_op->op_next;
3386 SAVECOPLINE(&PL_compiling);
3387 CopLINE_set(&PL_compiling, 0);
3391 /* Store and reset encoding. */
3392 encoding = PL_encoding;
3393 PL_encoding = Nullsv;
3395 op = DOCATCH(doeval(gimme, NULL, Nullcv, PL_curcop->cop_seq));
3397 /* Restore encoding. */
3398 PL_encoding = encoding;
3405 return pp_require();
3411 register PERL_CONTEXT *cx;
3413 const I32 gimme = GIMME_V, was = PL_sub_generation;
3414 char tbuf[TYPE_DIGITS(long) + 12];
3415 char *tmpbuf = tbuf;
3422 if (!SvPV_const(sv,len))
3424 TAINT_PROPER("eval");
3430 /* switch to eval mode */
3432 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
3433 SV *sv = sv_newmortal();
3434 Perl_sv_setpvf(aTHX_ sv, "_<(eval %lu)[%s:%"IVdf"]",
3435 (unsigned long)++PL_evalseq,
3436 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3440 sprintf(tmpbuf, "_<(eval %lu)", (unsigned long)++PL_evalseq);
3441 SAVECOPFILE_FREE(&PL_compiling);
3442 CopFILE_set(&PL_compiling, tmpbuf+2);
3443 SAVECOPLINE(&PL_compiling);
3444 CopLINE_set(&PL_compiling, 1);
3445 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3446 deleting the eval's FILEGV from the stash before gv_check() runs
3447 (i.e. before run-time proper). To work around the coredump that
3448 ensues, we always turn GvMULTI_on for any globals that were
3449 introduced within evals. See force_ident(). GSAR 96-10-12 */
3450 safestr = savepv(tmpbuf);
3451 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
3453 PL_hints = PL_op->op_targ;
3454 SAVESPTR(PL_compiling.cop_warnings);
3455 if (specialWARN(PL_curcop->cop_warnings))
3456 PL_compiling.cop_warnings = PL_curcop->cop_warnings;
3458 PL_compiling.cop_warnings = newSVsv(PL_curcop->cop_warnings);
3459 SAVEFREESV(PL_compiling.cop_warnings);
3461 SAVESPTR(PL_compiling.cop_io);
3462 if (specialCopIO(PL_curcop->cop_io))
3463 PL_compiling.cop_io = PL_curcop->cop_io;
3465 PL_compiling.cop_io = newSVsv(PL_curcop->cop_io);
3466 SAVEFREESV(PL_compiling.cop_io);
3468 /* special case: an eval '' executed within the DB package gets lexically
3469 * placed in the first non-DB CV rather than the current CV - this
3470 * allows the debugger to execute code, find lexicals etc, in the
3471 * scope of the code being debugged. Passing &seq gets find_runcv
3472 * to do the dirty work for us */
3473 runcv = find_runcv(&seq);
3475 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
3476 PUSHEVAL(cx, 0, Nullgv);
3477 cx->blk_eval.retop = PL_op->op_next;
3479 /* prepare to compile string */
3481 if (PERLDB_LINE && PL_curstash != PL_debstash)
3482 save_lines(CopFILEAV(&PL_compiling), PL_linestr);
3484 ret = doeval(gimme, NULL, runcv, seq);
3485 if (PERLDB_INTER && was != (I32)PL_sub_generation /* Some subs defined here. */
3486 && ret != PL_op->op_next) { /* Successive compilation. */
3487 strcpy(safestr, "_<(eval )"); /* Anything fake and short. */
3489 return DOCATCH(ret);
3499 register PERL_CONTEXT *cx;
3501 const U8 save_flags = PL_op -> op_flags;
3506 retop = cx->blk_eval.retop;
3509 if (gimme == G_VOID)
3511 else if (gimme == G_SCALAR) {
3514 if (SvFLAGS(TOPs) & SVs_TEMP)
3517 *MARK = sv_mortalcopy(TOPs);
3521 *MARK = &PL_sv_undef;
3526 /* in case LEAVE wipes old return values */
3527 for (mark = newsp + 1; mark <= SP; mark++) {
3528 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
3529 *mark = sv_mortalcopy(*mark);
3530 TAINT_NOT; /* Each item is independent */
3534 PL_curpm = newpm; /* Don't pop $1 et al till now */
3537 assert(CvDEPTH(PL_compcv) == 1);
3539 CvDEPTH(PL_compcv) = 0;
3542 if (optype == OP_REQUIRE &&
3543 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
3545 /* Unassume the success we assumed earlier. */
3546 SV * const nsv = cx->blk_eval.old_namesv;
3547 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
3548 retop = Perl_die(aTHX_ "%"SVf" did not return a true value", nsv);
3549 /* die_where() did LEAVE, or we won't be here */
3553 if (!(save_flags & OPf_SPECIAL))
3554 sv_setpvn(ERRSV,"",0);
3563 register PERL_CONTEXT *cx;
3564 const I32 gimme = GIMME_V;
3569 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), SP);
3571 cx->blk_eval.retop = cLOGOP->op_other->op_next;
3573 PL_in_eval = EVAL_INEVAL;
3574 sv_setpvn(ERRSV,"",0);
3576 return DOCATCH(PL_op->op_next);
3586 register PERL_CONTEXT *cx;
3593 if (gimme == G_VOID)
3595 else if (gimme == G_SCALAR) {
3598 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
3601 *MARK = sv_mortalcopy(TOPs);
3605 *MARK = &PL_sv_undef;
3610 /* in case LEAVE wipes old return values */
3611 for (mark = newsp + 1; mark <= SP; mark++) {
3612 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
3613 *mark = sv_mortalcopy(*mark);
3614 TAINT_NOT; /* Each item is independent */
3618 PL_curpm = newpm; /* Don't pop $1 et al till now */
3621 sv_setpvn(ERRSV,"",0);
3626 S_doparseform(pTHX_ SV *sv)
3629 register char *s = SvPV_force(sv, len);
3630 register char *send = s + len;
3631 register char *base = Nullch;
3632 register I32 skipspaces = 0;
3633 bool noblank = FALSE;
3634 bool repeat = FALSE;
3635 bool postspace = FALSE;
3641 bool unchopnum = FALSE;
3642 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
3645 Perl_croak(aTHX_ "Null picture in formline");
3647 /* estimate the buffer size needed */
3648 for (base = s; s <= send; s++) {
3649 if (*s == '\n' || *s == '@' || *s == '^')
3655 New(804, fops, maxops, U32);
3660 *fpc++ = FF_LINEMARK;
3661 noblank = repeat = FALSE;
3679 case ' ': case '\t':
3686 } /* else FALL THROUGH */
3694 *fpc++ = FF_LITERAL;
3702 *fpc++ = (U16)skipspaces;
3706 *fpc++ = FF_NEWLINE;
3710 arg = fpc - linepc + 1;
3717 *fpc++ = FF_LINEMARK;
3718 noblank = repeat = FALSE;
3727 ischop = s[-1] == '^';
3733 arg = (s - base) - 1;
3735 *fpc++ = FF_LITERAL;
3743 *fpc++ = 2; /* skip the @* or ^* */
3745 *fpc++ = FF_LINESNGL;
3748 *fpc++ = FF_LINEGLOB;
3750 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
3751 arg = ischop ? 512 : 0;
3756 const char * const f = ++s;
3759 arg |= 256 + (s - f);
3761 *fpc++ = s - base; /* fieldsize for FETCH */
3762 *fpc++ = FF_DECIMAL;
3764 unchopnum |= ! ischop;
3766 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
3767 arg = ischop ? 512 : 0;
3769 s++; /* skip the '0' first */
3773 const char * const f = ++s;
3776 arg |= 256 + (s - f);
3778 *fpc++ = s - base; /* fieldsize for FETCH */
3779 *fpc++ = FF_0DECIMAL;
3781 unchopnum |= ! ischop;
3785 bool ismore = FALSE;
3788 while (*++s == '>') ;
3789 prespace = FF_SPACE;
3791 else if (*s == '|') {
3792 while (*++s == '|') ;
3793 prespace = FF_HALFSPACE;
3798 while (*++s == '<') ;
3801 if (*s == '.' && s[1] == '.' && s[2] == '.') {
3805 *fpc++ = s - base; /* fieldsize for FETCH */
3807 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
3810 *fpc++ = (U16)prespace;
3824 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
3826 { /* need to jump to the next word */
3828 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
3829 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U32) + 4);
3830 s = SvPVX(sv) + SvCUR(sv) + z;
3832 Copy(fops, s, arg, U32);
3834 sv_magic(sv, Nullsv, PERL_MAGIC_fm, Nullch, 0);
3837 if (unchopnum && repeat)
3838 DIE(aTHX_ "Repeated format line will never terminate (~~ and @#)");
3844 S_num_overflow(NV value, I32 fldsize, I32 frcsize)
3846 /* Can value be printed in fldsize chars, using %*.*f ? */
3850 int intsize = fldsize - (value < 0 ? 1 : 0);
3857 while (intsize--) pwr *= 10.0;
3858 while (frcsize--) eps /= 10.0;
3861 if (value + eps >= pwr)
3864 if (value - eps <= -pwr)
3871 run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
3874 SV *datasv = FILTER_DATA(idx);
3875 const int filter_has_file = IoLINES(datasv);
3876 GV *filter_child_proc = (GV *)IoFMT_GV(datasv);
3877 SV *filter_state = (SV *)IoTOP_GV(datasv);
3878 SV *filter_sub = (SV *)IoBOTTOM_GV(datasv);
3881 /* I was having segfault trouble under Linux 2.2.5 after a
3882 parse error occured. (Had to hack around it with a test
3883 for PL_error_count == 0.) Solaris doesn't segfault --
3884 not sure where the trouble is yet. XXX */
3886 if (filter_has_file) {
3887 len = FILTER_READ(idx+1, buf_sv, maxlen);
3890 if (filter_sub && len >= 0) {
3901 PUSHs(sv_2mortal(newSViv(maxlen)));
3903 PUSHs(filter_state);
3906 count = call_sv(filter_sub, G_SCALAR);
3922 IoLINES(datasv) = 0;
3923 if (filter_child_proc) {
3924 SvREFCNT_dec(filter_child_proc);
3925 IoFMT_GV(datasv) = Nullgv;
3928 SvREFCNT_dec(filter_state);
3929 IoTOP_GV(datasv) = Nullgv;
3932 SvREFCNT_dec(filter_sub);
3933 IoBOTTOM_GV(datasv) = Nullgv;
3935 filter_del(run_user_filter);
3941 /* perhaps someone can come up with a better name for
3942 this? it is not really "absolute", per se ... */
3944 S_path_is_absolute(pTHX_ const char *name)
3946 if (PERL_FILE_IS_ABSOLUTE(name)
3947 #ifdef MACOS_TRADITIONAL
3950 || (*name == '.' && (name[1] == '/' ||
3951 (name[1] == '.' && name[2] == '/'))))
3962 * c-indentation-style: bsd
3964 * indent-tabs-mode: t
3967 * ex: set ts=8 sts=4 sw=4 noet: