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) {
65 /* XXXX Should store the old value to allow for tie/overload - and
66 restore in regcomp, where marked with XXXX. */
75 register PMOP *pm = (PMOP*)cLOGOP->op_other;
77 MAGIC *mg = Null(MAGIC*);
79 /* prevent recompiling under /o and ithreads. */
80 #if defined(USE_ITHREADS)
81 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
82 if (PL_op->op_flags & OPf_STACKED) {
91 if (PL_op->op_flags & OPf_STACKED) {
92 /* multiple args; concatentate them */
94 tmpstr = PAD_SV(ARGTARG);
95 sv_setpvn(tmpstr, "", 0);
96 while (++MARK <= SP) {
97 if (PL_amagic_generation) {
99 if ((SvAMAGIC(tmpstr) || SvAMAGIC(*MARK)) &&
100 (sv = amagic_call(tmpstr, *MARK, concat_amg, AMGf_assign)))
102 sv_setsv(tmpstr, sv);
106 sv_catsv(tmpstr, *MARK);
115 SV *sv = SvRV(tmpstr);
117 mg = mg_find(sv, PERL_MAGIC_qr);
120 regexp * const re = (regexp *)mg->mg_obj;
121 ReREFCNT_dec(PM_GETRE(pm));
122 PM_SETRE(pm, ReREFCNT_inc(re));
126 const char *t = SvPV_const(tmpstr, len);
128 /* Check against the last compiled regexp. */
129 if (!PM_GETRE(pm) || !PM_GETRE(pm)->precomp ||
130 PM_GETRE(pm)->prelen != (I32)len ||
131 memNE(PM_GETRE(pm)->precomp, t, len))
134 ReREFCNT_dec(PM_GETRE(pm));
135 PM_SETRE(pm, Null(REGEXP*)); /* crucial if regcomp aborts */
137 if (PL_op->op_flags & OPf_SPECIAL)
138 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
140 pm->op_pmflags = pm->op_pmpermflags; /* reset case sensitivity */
142 pm->op_pmdynflags |= PMdf_DYN_UTF8;
144 pm->op_pmdynflags &= ~PMdf_DYN_UTF8;
145 if (pm->op_pmdynflags & PMdf_UTF8)
146 t = (char*)bytes_to_utf8((U8*)t, &len);
148 PM_SETRE(pm, CALLREGCOMP(aTHX_ (char *)t, (char *)t + len, pm));
149 if (!DO_UTF8(tmpstr) && (pm->op_pmdynflags & PMdf_UTF8))
151 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
152 inside tie/overload accessors. */
156 #ifndef INCOMPLETE_TAINTS
159 pm->op_pmdynflags |= PMdf_TAINTED;
161 pm->op_pmdynflags &= ~PMdf_TAINTED;
165 if (!PM_GETRE(pm)->prelen && PL_curpm)
167 else if (strEQ("\\s+", PM_GETRE(pm)->precomp))
168 pm->op_pmflags |= PMf_WHITE;
170 pm->op_pmflags &= ~PMf_WHITE;
172 /* XXX runtime compiled output needs to move to the pad */
173 if (pm->op_pmflags & PMf_KEEP) {
174 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
175 #if !defined(USE_ITHREADS)
176 /* XXX can't change the optree at runtime either */
177 cLOGOP->op_first->op_next = PL_op->op_next;
186 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
187 register PMOP * const pm = (PMOP*) cLOGOP->op_other;
188 register SV * const dstr = cx->sb_dstr;
189 register char *s = cx->sb_s;
190 register char *m = cx->sb_m;
191 char *orig = cx->sb_orig;
192 register REGEXP * const rx = cx->sb_rx;
194 REGEXP *old = PM_GETRE(pm);
201 rxres_restore(&cx->sb_rxres, rx);
202 RX_MATCH_UTF8_set(rx, DO_UTF8(cx->sb_targ));
204 if (cx->sb_iters++) {
205 const I32 saviters = cx->sb_iters;
206 if (cx->sb_iters > cx->sb_maxiters)
207 DIE(aTHX_ "Substitution loop");
209 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
210 cx->sb_rxtainted |= 2;
211 sv_catsv(dstr, POPs);
214 if (cx->sb_once || !CALLREGEXEC(aTHX_ rx, s, cx->sb_strend, orig,
215 s == m, cx->sb_targ, NULL,
216 ((cx->sb_rflags & REXEC_COPY_STR)
217 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
218 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
220 SV * const targ = cx->sb_targ;
222 assert(cx->sb_strend >= s);
223 if(cx->sb_strend > s) {
224 if (DO_UTF8(dstr) && !SvUTF8(targ))
225 sv_catpvn_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
227 sv_catpvn(dstr, s, cx->sb_strend - s);
229 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
231 #ifdef PERL_OLD_COPY_ON_WRITE
233 sv_force_normal_flags(targ, SV_COW_DROP_PV);
239 SvPV_set(targ, SvPVX(dstr));
240 SvCUR_set(targ, SvCUR(dstr));
241 SvLEN_set(targ, SvLEN(dstr));
244 SvPV_set(dstr, (char*)0);
247 TAINT_IF(cx->sb_rxtainted & 1);
248 PUSHs(sv_2mortal(newSViv(saviters - 1)));
250 (void)SvPOK_only_UTF8(targ);
251 TAINT_IF(cx->sb_rxtainted);
255 LEAVE_SCOPE(cx->sb_oldsave);
258 RETURNOP(pm->op_next);
260 cx->sb_iters = saviters;
262 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
265 cx->sb_orig = orig = rx->subbeg;
267 cx->sb_strend = s + (cx->sb_strend - m);
269 cx->sb_m = m = rx->startp[0] + orig;
271 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
272 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
274 sv_catpvn(dstr, s, m-s);
276 cx->sb_s = rx->endp[0] + orig;
277 { /* Update the pos() information. */
278 SV * const sv = cx->sb_targ;
281 if (SvTYPE(sv) < SVt_PVMG)
282 SvUPGRADE(sv, SVt_PVMG);
283 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
284 sv_magic(sv, Nullsv, PERL_MAGIC_regex_global, Nullch, 0);
285 mg = mg_find(sv, PERL_MAGIC_regex_global);
293 (void)ReREFCNT_inc(rx);
294 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
295 rxres_save(&cx->sb_rxres, rx);
296 RETURNOP(pm->op_pmreplstart);
300 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
305 if (!p || p[1] < rx->nparens) {
306 #ifdef PERL_OLD_COPY_ON_WRITE
307 i = 7 + rx->nparens * 2;
309 i = 6 + rx->nparens * 2;
318 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? rx->subbeg : Nullch);
319 RX_MATCH_COPIED_off(rx);
321 #ifdef PERL_OLD_COPY_ON_WRITE
322 *p++ = PTR2UV(rx->saved_copy);
323 rx->saved_copy = Nullsv;
328 *p++ = PTR2UV(rx->subbeg);
329 *p++ = (UV)rx->sublen;
330 for (i = 0; i <= rx->nparens; ++i) {
331 *p++ = (UV)rx->startp[i];
332 *p++ = (UV)rx->endp[i];
337 Perl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
342 RX_MATCH_COPY_FREE(rx);
343 RX_MATCH_COPIED_set(rx, *p);
346 #ifdef PERL_OLD_COPY_ON_WRITE
348 SvREFCNT_dec (rx->saved_copy);
349 rx->saved_copy = INT2PTR(SV*,*p);
355 rx->subbeg = INT2PTR(char*,*p++);
356 rx->sublen = (I32)(*p++);
357 for (i = 0; i <= rx->nparens; ++i) {
358 rx->startp[i] = (I32)(*p++);
359 rx->endp[i] = (I32)(*p++);
364 Perl_rxres_free(pTHX_ void **rsp)
366 UV * const p = (UV*)*rsp;
370 void *tmp = INT2PTR(char*,*p);
373 Poison(*p, 1, sizeof(*p));
375 Safefree(INT2PTR(char*,*p));
377 #ifdef PERL_OLD_COPY_ON_WRITE
379 SvREFCNT_dec (INT2PTR(SV*,p[1]));
389 dSP; dMARK; dORIGMARK;
390 register SV * const tmpForm = *++MARK;
395 register SV *sv = Nullsv;
396 const char *item = Nullch;
400 bool chopspace = (strchr(PL_chopset, ' ') != Nullch);
401 const char *chophere = Nullch;
402 char *linemark = Nullch;
404 bool gotsome = FALSE;
406 const STRLEN fudge = SvPOK(tmpForm)
407 ? (SvCUR(tmpForm) * (IN_BYTES ? 1 : 3) + 1) : 0;
408 bool item_is_utf8 = FALSE;
409 bool targ_is_utf8 = FALSE;
415 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
416 if (SvREADONLY(tmpForm)) {
417 SvREADONLY_off(tmpForm);
418 parseres = doparseform(tmpForm);
419 SvREADONLY_on(tmpForm);
422 parseres = doparseform(tmpForm);
426 SvPV_force(PL_formtarget, len);
427 if (DO_UTF8(PL_formtarget))
429 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
431 f = SvPV_const(tmpForm, len);
432 /* need to jump to the next word */
433 fpc = (U32*)(f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN);
437 const char *name = "???";
440 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
441 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
442 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
443 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
444 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
446 case FF_CHECKNL: name = "CHECKNL"; break;
447 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
448 case FF_SPACE: name = "SPACE"; break;
449 case FF_HALFSPACE: name = "HALFSPACE"; break;
450 case FF_ITEM: name = "ITEM"; break;
451 case FF_CHOP: name = "CHOP"; break;
452 case FF_LINEGLOB: name = "LINEGLOB"; break;
453 case FF_NEWLINE: name = "NEWLINE"; break;
454 case FF_MORE: name = "MORE"; break;
455 case FF_LINEMARK: name = "LINEMARK"; break;
456 case FF_END: name = "END"; break;
457 case FF_0DECIMAL: name = "0DECIMAL"; break;
458 case FF_LINESNGL: name = "LINESNGL"; break;
461 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
463 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
474 if (targ_is_utf8 && !SvUTF8(tmpForm)) {
475 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
477 sv_catpvn_utf8_upgrade(PL_formtarget, f, arg, nsv);
478 t = SvEND(PL_formtarget);
481 if (!targ_is_utf8 && DO_UTF8(tmpForm)) {
482 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
484 sv_utf8_upgrade(PL_formtarget);
485 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
486 t = SvEND(PL_formtarget);
506 if (ckWARN(WARN_SYNTAX))
507 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
514 const char *s = item = SvPV_const(sv, len);
517 itemsize = sv_len_utf8(sv);
518 if (itemsize != (I32)len) {
520 if (itemsize > fieldsize) {
521 itemsize = fieldsize;
522 itembytes = itemsize;
523 sv_pos_u2b(sv, &itembytes, 0);
527 send = chophere = s + itembytes;
537 sv_pos_b2u(sv, &itemsize);
541 item_is_utf8 = FALSE;
542 if (itemsize > fieldsize)
543 itemsize = fieldsize;
544 send = chophere = s + itemsize;
558 const char *s = item = SvPV_const(sv, len);
561 itemsize = sv_len_utf8(sv);
562 if (itemsize != (I32)len) {
564 if (itemsize <= fieldsize) {
565 const char *send = chophere = s + itemsize;
578 itemsize = fieldsize;
579 itembytes = itemsize;
580 sv_pos_u2b(sv, &itembytes, 0);
581 send = chophere = s + itembytes;
582 while (s < send || (s == send && isSPACE(*s))) {
592 if (strchr(PL_chopset, *s))
597 itemsize = chophere - item;
598 sv_pos_b2u(sv, &itemsize);
604 item_is_utf8 = FALSE;
605 if (itemsize <= fieldsize) {
606 const char *const send = chophere = s + itemsize;
619 itemsize = fieldsize;
620 send = chophere = s + itemsize;
621 while (s < send || (s == send && isSPACE(*s))) {
631 if (strchr(PL_chopset, *s))
636 itemsize = chophere - item;
642 arg = fieldsize - itemsize;
651 arg = fieldsize - itemsize;
662 const char *s = item;
666 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
668 sv_utf8_upgrade(PL_formtarget);
669 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
670 t = SvEND(PL_formtarget);
674 if (UTF8_IS_CONTINUED(*s)) {
675 STRLEN skip = UTF8SKIP(s);
692 if ( !((*t++ = *s++) & ~31) )
698 if (targ_is_utf8 && !item_is_utf8) {
699 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
701 sv_catpvn_utf8_upgrade(PL_formtarget, s, arg, nsv);
702 for (; t < SvEND(PL_formtarget); t++) {
715 const int ch = *t++ = *s++;
718 if ( !((*t++ = *s++) & ~31) )
727 const char *s = chophere;
729 while (*s && isSPACE(*s))
745 const char *s = item = SvPV_const(sv, len);
747 if ((item_is_utf8 = DO_UTF8(sv)))
748 itemsize = sv_len_utf8(sv);
750 bool chopped = FALSE;
751 const char *const send = s + len;
753 chophere = s + itemsize;
769 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
771 SvUTF8_on(PL_formtarget);
773 SvCUR_set(sv, chophere - item);
774 sv_catsv(PL_formtarget, sv);
775 SvCUR_set(sv, itemsize);
777 sv_catsv(PL_formtarget, sv);
779 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) - 1);
780 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
781 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
790 #if defined(USE_LONG_DOUBLE)
791 fmt = (arg & 256) ? "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl;
793 fmt = (arg & 256) ? "%#0*.*f" : "%0*.*f";
798 #if defined(USE_LONG_DOUBLE)
799 fmt = (arg & 256) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl;
801 fmt = (arg & 256) ? "%#*.*f" : "%*.*f";
804 /* If the field is marked with ^ and the value is undefined,
806 if ((arg & 512) && !SvOK(sv)) {
814 /* overflow evidence */
815 if (num_overflow(value, fieldsize, arg)) {
821 /* Formats aren't yet marked for locales, so assume "yes". */
823 STORE_NUMERIC_STANDARD_SET_LOCAL();
824 sprintf(t, fmt, (int) fieldsize, (int) arg & 255, value);
825 RESTORE_NUMERIC_STANDARD();
832 while (t-- > linemark && *t == ' ') ;
840 if (arg) { /* repeat until fields exhausted? */
842 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
843 lines += FmLINES(PL_formtarget);
846 if (strnEQ(linemark, linemark - arg, arg))
847 DIE(aTHX_ "Runaway format");
850 SvUTF8_on(PL_formtarget);
851 FmLINES(PL_formtarget) = lines;
853 RETURNOP(cLISTOP->op_first);
864 const char *s = chophere;
865 const char *send = item + len;
867 while (*s && isSPACE(*s) && s < send)
872 arg = fieldsize - itemsize;
879 if (strnEQ(s1," ",3)) {
880 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
891 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
893 SvUTF8_on(PL_formtarget);
894 FmLINES(PL_formtarget) += lines;
906 if (PL_stack_base + *PL_markstack_ptr == SP) {
908 if (GIMME_V == G_SCALAR)
909 XPUSHs(sv_2mortal(newSViv(0)));
910 RETURNOP(PL_op->op_next->op_next);
912 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
913 pp_pushmark(); /* push dst */
914 pp_pushmark(); /* push src */
915 ENTER; /* enter outer scope */
918 if (PL_op->op_private & OPpGREP_LEX)
919 SAVESPTR(PAD_SVl(PL_op->op_targ));
922 ENTER; /* enter inner scope */
925 src = PL_stack_base[*PL_markstack_ptr];
927 if (PL_op->op_private & OPpGREP_LEX)
928 PAD_SVl(PL_op->op_targ) = src;
933 if (PL_op->op_type == OP_MAPSTART)
934 pp_pushmark(); /* push top */
935 return ((LOGOP*)PL_op->op_next)->op_other;
941 const I32 gimme = GIMME_V;
942 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
948 /* first, move source pointer to the next item in the source list */
949 ++PL_markstack_ptr[-1];
951 /* if there are new items, push them into the destination list */
952 if (items && gimme != G_VOID) {
953 /* might need to make room back there first */
954 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
955 /* XXX this implementation is very pessimal because the stack
956 * is repeatedly extended for every set of items. Is possible
957 * to do this without any stack extension or copying at all
958 * by maintaining a separate list over which the map iterates
959 * (like foreach does). --gsar */
961 /* everything in the stack after the destination list moves
962 * towards the end the stack by the amount of room needed */
963 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
965 /* items to shift up (accounting for the moved source pointer) */
966 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
968 /* This optimization is by Ben Tilly and it does
969 * things differently from what Sarathy (gsar)
970 * is describing. The downside of this optimization is
971 * that leaves "holes" (uninitialized and hopefully unused areas)
972 * to the Perl stack, but on the other hand this
973 * shouldn't be a problem. If Sarathy's idea gets
974 * implemented, this optimization should become
975 * irrelevant. --jhi */
977 shift = count; /* Avoid shifting too often --Ben Tilly */
982 PL_markstack_ptr[-1] += shift;
983 *PL_markstack_ptr += shift;
987 /* copy the new items down to the destination list */
988 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
989 if (gimme == G_ARRAY) {
991 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
994 /* scalar context: we don't care about which values map returns
995 * (we use undef here). And so we certainly don't want to do mortal
996 * copies of meaningless values. */
997 while (items-- > 0) {
999 *dst-- = &PL_sv_undef;
1003 LEAVE; /* exit inner scope */
1006 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
1008 (void)POPMARK; /* pop top */
1009 LEAVE; /* exit outer scope */
1010 (void)POPMARK; /* pop src */
1011 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1012 (void)POPMARK; /* pop dst */
1013 SP = PL_stack_base + POPMARK; /* pop original mark */
1014 if (gimme == G_SCALAR) {
1015 if (PL_op->op_private & OPpGREP_LEX) {
1016 SV* sv = sv_newmortal();
1017 sv_setiv(sv, items);
1025 else if (gimme == G_ARRAY)
1032 ENTER; /* enter inner scope */
1035 /* set $_ to the new source item */
1036 src = PL_stack_base[PL_markstack_ptr[-1]];
1038 if (PL_op->op_private & OPpGREP_LEX)
1039 PAD_SVl(PL_op->op_targ) = src;
1043 RETURNOP(cLOGOP->op_other);
1051 if (GIMME == G_ARRAY)
1053 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1054 return cLOGOP->op_other;
1063 if (GIMME == G_ARRAY) {
1064 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1068 SV * const targ = PAD_SV(PL_op->op_targ);
1071 if (PL_op->op_private & OPpFLIP_LINENUM) {
1072 if (GvIO(PL_last_in_gv)) {
1073 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1076 GV * const gv = gv_fetchpv(".", TRUE, SVt_PV);
1078 flip = SvIV(sv) == SvIV(GvSV(gv));
1084 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1085 if (PL_op->op_flags & OPf_SPECIAL) {
1093 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1096 sv_setpvn(TARG, "", 0);
1102 /* This code tries to decide if "$left .. $right" should use the
1103 magical string increment, or if the range is numeric (we make
1104 an exception for .."0" [#18165]). AMS 20021031. */
1106 #define RANGE_IS_NUMERIC(left,right) ( \
1107 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1108 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1109 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1110 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1111 && (!SvOK(right) || looks_like_number(right))))
1117 if (GIMME == G_ARRAY) {
1123 if (RANGE_IS_NUMERIC(left,right)) {
1126 if ((SvOK(left) && SvNV(left) < IV_MIN) ||
1127 (SvOK(right) && SvNV(right) > IV_MAX))
1128 DIE(aTHX_ "Range iterator outside integer range");
1139 SV * const sv = sv_2mortal(newSViv(i++));
1144 SV * const final = sv_mortalcopy(right);
1146 const char * const tmps = SvPV_const(final, len);
1148 SV *sv = sv_mortalcopy(left);
1149 SvPV_force_nolen(sv);
1150 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1152 if (strEQ(SvPVX_const(sv),tmps))
1154 sv = sv_2mortal(newSVsv(sv));
1161 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1165 if (PL_op->op_private & OPpFLIP_LINENUM) {
1166 if (GvIO(PL_last_in_gv)) {
1167 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1170 GV * const gv = gv_fetchpv(".", TRUE, SVt_PV);
1171 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1179 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1180 sv_catpvn(targ, "E0", 2);
1190 static const char * const context_name[] = {
1201 S_dopoptolabel(pTHX_ const char *label)
1205 for (i = cxstack_ix; i >= 0; i--) {
1206 register const PERL_CONTEXT * const cx = &cxstack[i];
1207 switch (CxTYPE(cx)) {
1213 if (ckWARN(WARN_EXITING))
1214 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1215 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1216 if (CxTYPE(cx) == CXt_NULL)
1220 if ( !cx->blk_loop.label || strNE(label, cx->blk_loop.label) ) {
1221 DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1222 (long)i, cx->blk_loop.label));
1225 DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1233 Perl_dowantarray(pTHX)
1235 const I32 gimme = block_gimme();
1236 return (gimme == G_VOID) ? G_SCALAR : gimme;
1240 Perl_block_gimme(pTHX)
1242 const I32 cxix = dopoptosub(cxstack_ix);
1246 switch (cxstack[cxix].blk_gimme) {
1254 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1261 Perl_is_lvalue_sub(pTHX)
1263 const I32 cxix = dopoptosub(cxstack_ix);
1264 assert(cxix >= 0); /* We should only be called from inside subs */
1266 if (cxstack[cxix].blk_sub.lval && CvLVALUE(cxstack[cxix].blk_sub.cv))
1267 return cxstack[cxix].blk_sub.lval;
1273 S_dopoptosub(pTHX_ I32 startingblock)
1275 return dopoptosub_at(cxstack, startingblock);
1279 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1282 for (i = startingblock; i >= 0; i--) {
1283 register const PERL_CONTEXT * const cx = &cxstk[i];
1284 switch (CxTYPE(cx)) {
1290 DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1298 S_dopoptoeval(pTHX_ I32 startingblock)
1301 for (i = startingblock; i >= 0; i--) {
1302 register const PERL_CONTEXT *cx = &cxstack[i];
1303 switch (CxTYPE(cx)) {
1307 DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1315 S_dopoptoloop(pTHX_ I32 startingblock)
1318 for (i = startingblock; i >= 0; i--) {
1319 register const PERL_CONTEXT * const cx = &cxstack[i];
1320 switch (CxTYPE(cx)) {
1326 if (ckWARN(WARN_EXITING))
1327 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1328 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1329 if ((CxTYPE(cx)) == CXt_NULL)
1333 DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1341 Perl_dounwind(pTHX_ I32 cxix)
1345 while (cxstack_ix > cxix) {
1347 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1348 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1349 (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1350 /* Note: we don't need to restore the base context info till the end. */
1351 switch (CxTYPE(cx)) {
1354 continue; /* not break */
1373 PERL_UNUSED_VAR(optype);
1377 Perl_qerror(pTHX_ SV *err)
1380 sv_catsv(ERRSV, err);
1382 sv_catsv(PL_errors, err);
1384 Perl_warn(aTHX_ "%"SVf, err);
1389 Perl_die_where(pTHX_ const char *message, STRLEN msglen)
1398 if (PL_in_eval & EVAL_KEEPERR) {
1399 static const char prefix[] = "\t(in cleanup) ";
1400 SV * const err = ERRSV;
1401 const char *e = Nullch;
1403 sv_setpvn(err,"",0);
1404 else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1406 e = SvPV_const(err, len);
1408 if (*e != *message || strNE(e,message))
1412 SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1413 sv_catpvn(err, prefix, sizeof(prefix)-1);
1414 sv_catpvn(err, message, msglen);
1415 if (ckWARN(WARN_MISC)) {
1416 const STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1417 Perl_warner(aTHX_ packWARN(WARN_MISC), SvPVX_const(err)+start);
1422 sv_setpvn(ERRSV, message, msglen);
1426 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1427 && PL_curstackinfo->si_prev)
1435 register PERL_CONTEXT *cx;
1438 if (cxix < cxstack_ix)
1441 POPBLOCK(cx,PL_curpm);
1442 if (CxTYPE(cx) != CXt_EVAL) {
1444 message = SvPVx_const(ERRSV, msglen);
1445 PerlIO_write(Perl_error_log, "panic: die ", 11);
1446 PerlIO_write(Perl_error_log, message, msglen);
1451 if (gimme == G_SCALAR)
1452 *++newsp = &PL_sv_undef;
1453 PL_stack_sp = newsp;
1457 /* LEAVE could clobber PL_curcop (see save_re_context())
1458 * XXX it might be better to find a way to avoid messing with
1459 * PL_curcop in save_re_context() instead, but this is a more
1460 * minimal fix --GSAR */
1461 PL_curcop = cx->blk_oldcop;
1463 if (optype == OP_REQUIRE) {
1464 const char* const msg = SvPVx_nolen_const(ERRSV);
1465 SV * const nsv = cx->blk_eval.old_namesv;
1466 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
1468 DIE(aTHX_ "%sCompilation failed in require",
1469 *msg ? msg : "Unknown error\n");
1471 assert(CxTYPE(cx) == CXt_EVAL);
1472 return cx->blk_eval.retop;
1476 message = SvPVx_const(ERRSV, msglen);
1478 write_to_stderr(message, msglen);
1487 if (SvTRUE(left) != SvTRUE(right))
1499 RETURNOP(cLOGOP->op_other);
1508 RETURNOP(cLOGOP->op_other);
1517 if (!sv || !SvANY(sv)) {
1518 RETURNOP(cLOGOP->op_other);
1521 switch (SvTYPE(sv)) {
1523 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
1527 if (HvARRAY(sv) || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
1531 if (CvROOT(sv) || CvXSUB(sv))
1540 RETURNOP(cLOGOP->op_other);
1546 register I32 cxix = dopoptosub(cxstack_ix);
1547 register const PERL_CONTEXT *cx;
1548 register const PERL_CONTEXT *ccstack = cxstack;
1549 const PERL_SI *top_si = PL_curstackinfo;
1551 const char *stashname;
1558 /* we may be in a higher stacklevel, so dig down deeper */
1559 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1560 top_si = top_si->si_prev;
1561 ccstack = top_si->si_cxstack;
1562 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1565 if (GIMME != G_ARRAY) {
1571 /* caller() should not report the automatic calls to &DB::sub */
1572 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1573 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1577 cxix = dopoptosub_at(ccstack, cxix - 1);
1580 cx = &ccstack[cxix];
1581 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1582 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1583 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1584 field below is defined for any cx. */
1585 /* caller() should not report the automatic calls to &DB::sub */
1586 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1587 cx = &ccstack[dbcxix];
1590 stashname = CopSTASHPV(cx->blk_oldcop);
1591 if (GIMME != G_ARRAY) {
1594 PUSHs(&PL_sv_undef);
1597 sv_setpv(TARG, stashname);
1606 PUSHs(&PL_sv_undef);
1608 PUSHs(sv_2mortal(newSVpv(stashname, 0)));
1609 PUSHs(sv_2mortal(newSVpv(OutCopFILE(cx->blk_oldcop), 0)));
1610 PUSHs(sv_2mortal(newSViv((I32)CopLINE(cx->blk_oldcop))));
1613 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1614 GV *cvgv = CvGV(ccstack[cxix].blk_sub.cv);
1615 /* So is ccstack[dbcxix]. */
1617 SV * const sv = NEWSV(49, 0);
1618 gv_efullname3(sv, cvgv, Nullch);
1619 PUSHs(sv_2mortal(sv));
1620 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1623 PUSHs(sv_2mortal(newSVpvn("(unknown)",9)));
1624 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1628 PUSHs(sv_2mortal(newSVpvn("(eval)",6)));
1629 PUSHs(sv_2mortal(newSViv(0)));
1631 gimme = (I32)cx->blk_gimme;
1632 if (gimme == G_VOID)
1633 PUSHs(&PL_sv_undef);
1635 PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1636 if (CxTYPE(cx) == CXt_EVAL) {
1638 if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1639 PUSHs(cx->blk_eval.cur_text);
1643 else if (cx->blk_eval.old_namesv) {
1644 PUSHs(sv_2mortal(newSVsv(cx->blk_eval.old_namesv)));
1647 /* eval BLOCK (try blocks have old_namesv == 0) */
1649 PUSHs(&PL_sv_undef);
1650 PUSHs(&PL_sv_undef);
1654 PUSHs(&PL_sv_undef);
1655 PUSHs(&PL_sv_undef);
1657 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs
1658 && CopSTASH_eq(PL_curcop, PL_debstash))
1660 AV * const ary = cx->blk_sub.argarray;
1661 const int off = AvARRAY(ary) - AvALLOC(ary);
1665 PL_dbargs = GvAV(gv_AVadd(tmpgv = gv_fetchpv("DB::args", TRUE,
1668 AvREAL_off(PL_dbargs); /* XXX should be REIFY (see av.h) */
1671 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1672 av_extend(PL_dbargs, AvFILLp(ary) + off);
1673 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1674 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1676 /* XXX only hints propagated via op_private are currently
1677 * visible (others are not easily accessible, since they
1678 * use the global PL_hints) */
1679 PUSHs(sv_2mortal(newSViv((I32)cx->blk_oldcop->op_private &
1680 HINT_PRIVATE_MASK)));
1683 SV * old_warnings = cx->blk_oldcop->cop_warnings ;
1685 if (old_warnings == pWARN_NONE ||
1686 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
1687 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1688 else if (old_warnings == pWARN_ALL ||
1689 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1690 /* Get the bit mask for $warnings::Bits{all}, because
1691 * it could have been extended by warnings::register */
1693 HV *bits = get_hv("warnings::Bits", FALSE);
1694 if (bits && (bits_all=hv_fetch(bits, "all", 3, FALSE))) {
1695 mask = newSVsv(*bits_all);
1698 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1702 mask = newSVsv(old_warnings);
1703 PUSHs(sv_2mortal(mask));
1717 sv_reset(tmps, CopSTASH(PL_curcop));
1722 /* like pp_nextstate, but used instead when the debugger is active */
1727 PL_curcop = (COP*)PL_op;
1728 TAINT_NOT; /* Each statement is presumed innocent */
1729 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1732 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1733 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1737 register PERL_CONTEXT *cx;
1738 const I32 gimme = G_ARRAY;
1745 DIE(aTHX_ "No DB::DB routine defined");
1747 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1748 /* don't do recursive DB::DB call */
1763 (void)(*CvXSUB(cv))(aTHX_ cv);
1770 PUSHBLOCK(cx, CXt_SUB, SP);
1772 cx->blk_sub.retop = PL_op->op_next;
1775 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), 1);
1776 RETURNOP(CvSTART(cv));
1786 register PERL_CONTEXT *cx;
1787 const I32 gimme = GIMME_V;
1789 U32 cxtype = CXt_LOOP;
1797 if (PL_op->op_targ) {
1798 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
1799 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
1800 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
1801 SVs_PADSTALE, SVs_PADSTALE);
1803 #ifndef USE_ITHREADS
1804 svp = &PAD_SVl(PL_op->op_targ); /* "my" variable */
1807 SAVEPADSV(PL_op->op_targ);
1808 iterdata = INT2PTR(void*, PL_op->op_targ);
1809 cxtype |= CXp_PADVAR;
1814 svp = &GvSV(gv); /* symbol table variable */
1815 SAVEGENERICSV(*svp);
1818 iterdata = (void*)gv;
1824 PUSHBLOCK(cx, cxtype, SP);
1826 PUSHLOOP(cx, iterdata, MARK);
1828 PUSHLOOP(cx, svp, MARK);
1830 if (PL_op->op_flags & OPf_STACKED) {
1831 cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1832 if (SvTYPE(cx->blk_loop.iterary) != SVt_PVAV) {
1834 SV *right = (SV*)cx->blk_loop.iterary;
1837 if (RANGE_IS_NUMERIC(sv,right)) {
1838 if ((SvOK(sv) && SvNV(sv) < IV_MIN) ||
1839 (SvOK(right) && SvNV(right) >= IV_MAX))
1840 DIE(aTHX_ "Range iterator outside integer range");
1841 cx->blk_loop.iterix = SvIV(sv);
1842 cx->blk_loop.itermax = SvIV(right);
1844 /* for correct -Dstv display */
1845 cx->blk_oldsp = sp - PL_stack_base;
1849 cx->blk_loop.iterlval = newSVsv(sv);
1850 (void) SvPV_force_nolen(cx->blk_loop.iterlval);
1851 (void) SvPV_nolen_const(right);
1854 else if (PL_op->op_private & OPpITER_REVERSED) {
1855 cx->blk_loop.itermax = -1;
1856 cx->blk_loop.iterix = AvFILL(cx->blk_loop.iterary);
1861 cx->blk_loop.iterary = PL_curstack;
1862 AvFILLp(PL_curstack) = SP - PL_stack_base;
1863 if (PL_op->op_private & OPpITER_REVERSED) {
1864 cx->blk_loop.itermax = MARK - PL_stack_base;
1865 cx->blk_loop.iterix = cx->blk_oldsp;
1868 cx->blk_loop.iterix = MARK - PL_stack_base;
1878 register PERL_CONTEXT *cx;
1879 const I32 gimme = GIMME_V;
1885 PUSHBLOCK(cx, CXt_LOOP, SP);
1886 PUSHLOOP(cx, 0, SP);
1894 register PERL_CONTEXT *cx;
1901 assert(CxTYPE(cx) == CXt_LOOP);
1903 newsp = PL_stack_base + cx->blk_loop.resetsp;
1906 if (gimme == G_VOID)
1908 else if (gimme == G_SCALAR) {
1910 *++newsp = sv_mortalcopy(*SP);
1912 *++newsp = &PL_sv_undef;
1916 *++newsp = sv_mortalcopy(*++mark);
1917 TAINT_NOT; /* Each item is independent */
1923 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
1924 PL_curpm = newpm; /* ... and pop $1 et al */
1936 register PERL_CONTEXT *cx;
1937 bool popsub2 = FALSE;
1938 bool clear_errsv = FALSE;
1946 cxix = dopoptosub(cxstack_ix);
1948 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
1949 * sort block, which is a CXt_NULL
1955 DIE(aTHX_ "Can't return outside a subroutine");
1957 if (cxix < cxstack_ix)
1960 if (CxMULTICALL(&cxstack[cxix]))
1964 switch (CxTYPE(cx)) {
1967 retop = cx->blk_sub.retop;
1968 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
1971 if (!(PL_in_eval & EVAL_KEEPERR))
1974 retop = cx->blk_eval.retop;
1978 if (optype == OP_REQUIRE &&
1979 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
1981 /* Unassume the success we assumed earlier. */
1982 SV * const nsv = cx->blk_eval.old_namesv;
1983 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
1984 DIE(aTHX_ "%"SVf" did not return a true value", nsv);
1989 retop = cx->blk_sub.retop;
1992 DIE(aTHX_ "panic: return");
1996 if (gimme == G_SCALAR) {
1999 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2001 *++newsp = SvREFCNT_inc(*SP);
2006 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
2008 *++newsp = sv_mortalcopy(sv);
2013 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
2016 *++newsp = sv_mortalcopy(*SP);
2019 *++newsp = &PL_sv_undef;
2021 else if (gimme == G_ARRAY) {
2022 while (++MARK <= SP) {
2023 *++newsp = (popsub2 && SvTEMP(*MARK))
2024 ? *MARK : sv_mortalcopy(*MARK);
2025 TAINT_NOT; /* Each item is independent */
2028 PL_stack_sp = newsp;
2031 /* Stack values are safe: */
2034 POPSUB(cx,sv); /* release CV and @_ ... */
2038 PL_curpm = newpm; /* ... and pop $1 et al */
2042 sv_setpvn(ERRSV,"",0);
2050 register PERL_CONTEXT *cx;
2061 if (PL_op->op_flags & OPf_SPECIAL) {
2062 cxix = dopoptoloop(cxstack_ix);
2064 DIE(aTHX_ "Can't \"last\" outside a loop block");
2067 cxix = dopoptolabel(cPVOP->op_pv);
2069 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
2071 if (cxix < cxstack_ix)
2075 cxstack_ix++; /* temporarily protect top context */
2077 switch (CxTYPE(cx)) {
2080 newsp = PL_stack_base + cx->blk_loop.resetsp;
2081 nextop = cx->blk_loop.last_op->op_next;
2085 nextop = cx->blk_sub.retop;
2089 nextop = cx->blk_eval.retop;
2093 nextop = cx->blk_sub.retop;
2096 DIE(aTHX_ "panic: last");
2100 if (gimme == G_SCALAR) {
2102 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
2103 ? *SP : sv_mortalcopy(*SP);
2105 *++newsp = &PL_sv_undef;
2107 else if (gimme == G_ARRAY) {
2108 while (++MARK <= SP) {
2109 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
2110 ? *MARK : sv_mortalcopy(*MARK);
2111 TAINT_NOT; /* Each item is independent */
2119 /* Stack values are safe: */
2122 POPLOOP(cx); /* release loop vars ... */
2126 POPSUB(cx,sv); /* release CV and @_ ... */
2129 PL_curpm = newpm; /* ... and pop $1 et al */
2132 PERL_UNUSED_VAR(optype);
2133 PERL_UNUSED_VAR(gimme);
2141 register PERL_CONTEXT *cx;
2144 if (PL_op->op_flags & OPf_SPECIAL) {
2145 cxix = dopoptoloop(cxstack_ix);
2147 DIE(aTHX_ "Can't \"next\" outside a loop block");
2150 cxix = dopoptolabel(cPVOP->op_pv);
2152 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
2154 if (cxix < cxstack_ix)
2157 /* clear off anything above the scope we're re-entering, but
2158 * save the rest until after a possible continue block */
2159 inner = PL_scopestack_ix;
2161 if (PL_scopestack_ix < inner)
2162 leave_scope(PL_scopestack[PL_scopestack_ix]);
2163 PL_curcop = cx->blk_oldcop;
2164 return cx->blk_loop.next_op;
2171 register PERL_CONTEXT *cx;
2175 if (PL_op->op_flags & OPf_SPECIAL) {
2176 cxix = dopoptoloop(cxstack_ix);
2178 DIE(aTHX_ "Can't \"redo\" outside a loop block");
2181 cxix = dopoptolabel(cPVOP->op_pv);
2183 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
2185 if (cxix < cxstack_ix)
2188 redo_op = cxstack[cxix].blk_loop.redo_op;
2189 if (redo_op->op_type == OP_ENTER) {
2190 /* pop one less context to avoid $x being freed in while (my $x..) */
2192 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2193 redo_op = redo_op->op_next;
2197 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2198 LEAVE_SCOPE(oldsave);
2200 PL_curcop = cx->blk_oldcop;
2205 S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
2208 static const char too_deep[] = "Target of goto is too deeply nested";
2211 Perl_croak(aTHX_ too_deep);
2212 if (o->op_type == OP_LEAVE ||
2213 o->op_type == OP_SCOPE ||
2214 o->op_type == OP_LEAVELOOP ||
2215 o->op_type == OP_LEAVESUB ||
2216 o->op_type == OP_LEAVETRY)
2218 *ops++ = cUNOPo->op_first;
2220 Perl_croak(aTHX_ too_deep);
2223 if (o->op_flags & OPf_KIDS) {
2225 /* First try all the kids at this level, since that's likeliest. */
2226 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2227 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2228 kCOP->cop_label && strEQ(kCOP->cop_label, label))
2231 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2232 if (kid == PL_lastgotoprobe)
2234 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2237 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2238 ops[-1]->op_type == OP_DBSTATE)
2243 if ((o = dofindlabel(kid, label, ops, oplimit)))
2256 register PERL_CONTEXT *cx;
2257 #define GOTO_DEPTH 64
2258 OP *enterops[GOTO_DEPTH];
2259 const char *label = 0;
2260 const bool do_dump = (PL_op->op_type == OP_DUMP);
2261 static const char must_have_label[] = "goto must have label";
2263 if (PL_op->op_flags & OPf_STACKED) {
2264 SV * const sv = POPs;
2266 /* This egregious kludge implements goto &subroutine */
2267 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2269 register PERL_CONTEXT *cx;
2270 CV* cv = (CV*)SvRV(sv);
2277 if (!CvROOT(cv) && !CvXSUB(cv)) {
2278 const GV * const gv = CvGV(cv);
2282 /* autoloaded stub? */
2283 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2285 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
2286 GvNAMELEN(gv), FALSE);
2287 if (autogv && (cv = GvCV(autogv)))
2289 tmpstr = sv_newmortal();
2290 gv_efullname3(tmpstr, gv, Nullch);
2291 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",tmpstr);
2293 DIE(aTHX_ "Goto undefined subroutine");
2296 /* First do some returnish stuff. */
2297 (void)SvREFCNT_inc(cv); /* avoid premature free during unwind */
2299 cxix = dopoptosub(cxstack_ix);
2301 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2302 if (cxix < cxstack_ix)
2306 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2307 if (CxTYPE(cx) == CXt_EVAL) {
2309 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2311 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2313 else if (CxMULTICALL(cx))
2314 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
2315 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs) {
2316 /* put @_ back onto stack */
2317 AV* av = cx->blk_sub.argarray;
2319 items = AvFILLp(av) + 1;
2320 EXTEND(SP, items+1); /* @_ could have been extended. */
2321 Copy(AvARRAY(av), SP + 1, items, SV*);
2322 SvREFCNT_dec(GvAV(PL_defgv));
2323 GvAV(PL_defgv) = cx->blk_sub.savearray;
2325 /* abandon @_ if it got reified */
2330 av_extend(av, items-1);
2332 PAD_SVl(0) = (SV*)(cx->blk_sub.argarray = av);
2335 else if (CvXSUB(cv)) { /* put GvAV(defgv) back onto stack */
2336 AV* const av = GvAV(PL_defgv);
2337 items = AvFILLp(av) + 1;
2338 EXTEND(SP, items+1); /* @_ could have been extended. */
2339 Copy(AvARRAY(av), SP + 1, items, SV*);
2343 if (CxTYPE(cx) == CXt_SUB &&
2344 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2345 SvREFCNT_dec(cx->blk_sub.cv);
2346 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2347 LEAVE_SCOPE(oldsave);
2349 /* Now do some callish stuff. */
2351 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2353 OP* retop = cx->blk_sub.retop;
2356 for (index=0; index<items; index++)
2357 sv_2mortal(SP[-index]);
2359 #ifdef PERL_XSUB_OLDSTYLE
2360 if (CvOLDSTYLE(cv)) {
2361 I32 (*fp3)(int,int,int);
2366 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2367 items = (*fp3)(CvXSUBANY(cv).any_i32,
2368 mark - PL_stack_base + 1,
2370 SP = PL_stack_base + items;
2373 #endif /* PERL_XSUB_OLDSTYLE */
2378 /* XS subs don't have a CxSUB, so pop it */
2379 POPBLOCK(cx, PL_curpm);
2380 /* Push a mark for the start of arglist */
2383 (void)(*CvXSUB(cv))(aTHX_ cv);
2384 /* Put these at the bottom since the vars are set but not used */
2385 PERL_UNUSED_VAR(newsp);
2386 PERL_UNUSED_VAR(gimme);
2392 AV* padlist = CvPADLIST(cv);
2393 if (CxTYPE(cx) == CXt_EVAL) {
2394 PL_in_eval = cx->blk_eval.old_in_eval;
2395 PL_eval_root = cx->blk_eval.old_eval_root;
2396 cx->cx_type = CXt_SUB;
2397 cx->blk_sub.hasargs = 0;
2399 cx->blk_sub.cv = cv;
2400 cx->blk_sub.olddepth = (U16)CvDEPTH(cv);
2403 if (CvDEPTH(cv) < 2)
2404 (void)SvREFCNT_inc(cv);
2406 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION))
2407 sub_crush_depth(cv);
2408 pad_push(padlist, CvDEPTH(cv));
2411 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2412 if (cx->blk_sub.hasargs)
2414 AV* av = (AV*)PAD_SVl(0);
2417 cx->blk_sub.savearray = GvAV(PL_defgv);
2418 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2419 CX_CURPAD_SAVE(cx->blk_sub);
2420 cx->blk_sub.argarray = av;
2422 if (items >= AvMAX(av) + 1) {
2424 if (AvARRAY(av) != ary) {
2425 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2426 SvPV_set(av, (char*)ary);
2428 if (items >= AvMAX(av) + 1) {
2429 AvMAX(av) = items - 1;
2430 Renew(ary,items+1,SV*);
2432 SvPV_set(av, (char*)ary);
2436 Copy(mark,AvARRAY(av),items,SV*);
2437 AvFILLp(av) = items - 1;
2438 assert(!AvREAL(av));
2440 /* transfer 'ownership' of refcnts to new @_ */
2450 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2452 * We do not care about using sv to call CV;
2453 * it's for informational purposes only.
2455 SV * const sv = GvSV(PL_DBsub);
2459 if (PERLDB_SUB_NN) {
2460 const int type = SvTYPE(sv);
2461 if (type < SVt_PVIV && type != SVt_IV)
2462 sv_upgrade(sv, SVt_PVIV);
2464 SvIV_set(sv, PTR2IV(cv)); /* Do it the quickest way */
2466 gv_efullname3(sv, CvGV(cv), Nullch);
2469 && (gotocv = get_cv("DB::goto", FALSE)) ) {
2470 PUSHMARK( PL_stack_sp );
2471 call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2475 RETURNOP(CvSTART(cv));
2479 label = SvPV_nolen_const(sv);
2480 if (!(do_dump || *label))
2481 DIE(aTHX_ must_have_label);
2484 else if (PL_op->op_flags & OPf_SPECIAL) {
2486 DIE(aTHX_ must_have_label);
2489 label = cPVOP->op_pv;
2491 if (label && *label) {
2493 bool leaving_eval = FALSE;
2494 bool in_block = FALSE;
2495 PERL_CONTEXT *last_eval_cx = 0;
2499 PL_lastgotoprobe = 0;
2501 for (ix = cxstack_ix; ix >= 0; ix--) {
2503 switch (CxTYPE(cx)) {
2505 leaving_eval = TRUE;
2506 if (!CxTRYBLOCK(cx)) {
2507 gotoprobe = (last_eval_cx ?
2508 last_eval_cx->blk_eval.old_eval_root :
2513 /* else fall through */
2515 gotoprobe = cx->blk_oldcop->op_sibling;
2521 gotoprobe = cx->blk_oldcop->op_sibling;
2524 gotoprobe = PL_main_root;
2527 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
2528 gotoprobe = CvROOT(cx->blk_sub.cv);
2534 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2537 DIE(aTHX_ "panic: goto");
2538 gotoprobe = PL_main_root;
2542 retop = dofindlabel(gotoprobe, label,
2543 enterops, enterops + GOTO_DEPTH);
2547 PL_lastgotoprobe = gotoprobe;
2550 DIE(aTHX_ "Can't find label %s", label);
2552 /* if we're leaving an eval, check before we pop any frames
2553 that we're not going to punt, otherwise the error
2556 if (leaving_eval && *enterops && enterops[1]) {
2558 for (i = 1; enterops[i]; i++)
2559 if (enterops[i]->op_type == OP_ENTERITER)
2560 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2563 /* pop unwanted frames */
2565 if (ix < cxstack_ix) {
2572 oldsave = PL_scopestack[PL_scopestack_ix];
2573 LEAVE_SCOPE(oldsave);
2576 /* push wanted frames */
2578 if (*enterops && enterops[1]) {
2580 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
2581 for (; enterops[ix]; ix++) {
2582 PL_op = enterops[ix];
2583 /* Eventually we may want to stack the needed arguments
2584 * for each op. For now, we punt on the hard ones. */
2585 if (PL_op->op_type == OP_ENTERITER)
2586 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2587 CALL_FPTR(PL_op->op_ppaddr)(aTHX);
2595 if (!retop) retop = PL_main_start;
2597 PL_restartop = retop;
2598 PL_do_undump = TRUE;
2602 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2603 PL_do_undump = FALSE;
2619 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
2621 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
2624 PL_exit_flags |= PERL_EXIT_EXPECTED;
2626 PUSHs(&PL_sv_undef);
2634 const NV value = SvNVx(GvSV(cCOP->cop_gv));
2635 register I32 match = I_32(value);
2638 if (((NV)match) > value)
2639 --match; /* was fractional--truncate other way */
2641 match -= cCOP->uop.scop.scop_offset;
2644 else if (match > cCOP->uop.scop.scop_max)
2645 match = cCOP->uop.scop.scop_max;
2646 PL_op = cCOP->uop.scop.scop_next[match];
2656 PL_op = PL_op->op_next; /* can't assume anything */
2658 match = *(SvPVx_nolen_const(GvSV(cCOP->cop_gv))) & 255;
2659 match -= cCOP->uop.scop.scop_offset;
2662 else if (match > cCOP->uop.scop.scop_max)
2663 match = cCOP->uop.scop.scop_max;
2664 PL_op = cCOP->uop.scop.scop_next[match];
2673 S_save_lines(pTHX_ AV *array, SV *sv)
2675 const char *s = SvPVX_const(sv);
2676 const char * const send = SvPVX_const(sv) + SvCUR(sv);
2679 while (s && s < send) {
2681 SV * const tmpstr = NEWSV(85,0);
2683 sv_upgrade(tmpstr, SVt_PVMG);
2684 t = strchr(s, '\n');
2690 sv_setpvn(tmpstr, s, t - s);
2691 av_store(array, line++, tmpstr);
2697 S_docatch_body(pTHX)
2704 S_docatch(pTHX_ OP *o)
2707 OP * const oldop = PL_op;
2711 assert(CATCH_GET == TRUE);
2718 assert(cxstack_ix >= 0);
2719 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2720 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
2725 /* die caught by an inner eval - continue inner loop */
2727 /* NB XXX we rely on the old popped CxEVAL still being at the top
2728 * of the stack; the way die_where() currently works, this
2729 * assumption is valid. In theory The cur_top_env value should be
2730 * returned in another global, the way retop (aka PL_restartop)
2732 assert(CxTYPE(&cxstack[cxstack_ix+1]) == CXt_EVAL);
2735 && cxstack[cxstack_ix+1].blk_eval.cur_top_env == PL_top_env)
2737 PL_op = PL_restartop;
2754 Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
2755 /* sv Text to convert to OP tree. */
2756 /* startop op_free() this to undo. */
2757 /* code Short string id of the caller. */
2759 dVAR; dSP; /* Make POPBLOCK work. */
2766 char tbuf[TYPE_DIGITS(long) + 12 + 10];
2767 char *tmpbuf = tbuf;
2770 CV* runcv = Nullcv; /* initialise to avoid compiler warnings */
2775 /* switch to eval mode */
2777 if (IN_PERL_COMPILETIME) {
2778 SAVECOPSTASH_FREE(&PL_compiling);
2779 CopSTASH_set(&PL_compiling, PL_curstash);
2781 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
2782 SV * const sv = sv_newmortal();
2783 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
2784 code, (unsigned long)++PL_evalseq,
2785 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
2789 sprintf(tmpbuf, "_<(%.10s_eval %lu)", code, (unsigned long)++PL_evalseq);
2790 SAVECOPFILE_FREE(&PL_compiling);
2791 CopFILE_set(&PL_compiling, tmpbuf+2);
2792 SAVECOPLINE(&PL_compiling);
2793 CopLINE_set(&PL_compiling, 1);
2794 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2795 deleting the eval's FILEGV from the stash before gv_check() runs
2796 (i.e. before run-time proper). To work around the coredump that
2797 ensues, we always turn GvMULTI_on for any globals that were
2798 introduced within evals. See force_ident(). GSAR 96-10-12 */
2799 safestr = savepv(tmpbuf);
2800 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
2802 #ifdef OP_IN_REGISTER
2808 /* we get here either during compilation, or via pp_regcomp at runtime */
2809 runtime = IN_PERL_RUNTIME;
2811 runcv = find_runcv(NULL);
2814 PL_op->op_type = OP_ENTEREVAL;
2815 PL_op->op_flags = 0; /* Avoid uninit warning. */
2816 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
2817 PUSHEVAL(cx, 0, Nullgv);
2820 rop = doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq);
2822 rop = doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax);
2823 POPBLOCK(cx,PL_curpm);
2826 (*startop)->op_type = OP_NULL;
2827 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
2829 /* XXX DAPM do this properly one year */
2830 *padp = (AV*)SvREFCNT_inc(PL_comppad);
2832 if (IN_PERL_COMPILETIME)
2833 PL_compiling.op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
2834 #ifdef OP_IN_REGISTER
2837 PERL_UNUSED_VAR(newsp);
2838 PERL_UNUSED_VAR(optype);
2845 =for apidoc find_runcv
2847 Locate the CV corresponding to the currently executing sub or eval.
2848 If db_seqp is non_null, skip CVs that are in the DB package and populate
2849 *db_seqp with the cop sequence number at the point that the DB:: code was
2850 entered. (allows debuggers to eval in the scope of the breakpoint rather
2851 than in the scope of the debugger itself).
2857 Perl_find_runcv(pTHX_ U32 *db_seqp)
2862 *db_seqp = PL_curcop->cop_seq;
2863 for (si = PL_curstackinfo; si; si = si->si_prev) {
2865 for (ix = si->si_cxix; ix >= 0; ix--) {
2866 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
2867 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
2868 CV * const cv = cx->blk_sub.cv;
2869 /* skip DB:: code */
2870 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
2871 *db_seqp = cx->blk_oldcop->cop_seq;
2876 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
2884 /* Compile a require/do, an eval '', or a /(?{...})/.
2885 * In the last case, startop is non-null, and contains the address of
2886 * a pointer that should be set to the just-compiled code.
2887 * outside is the lexically enclosing CV (if any) that invoked us.
2890 /* With USE_5005THREADS, eval_owner must be held on entry to doeval */
2892 S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq)
2895 OP * const saveop = PL_op;
2897 PL_in_eval = ((saveop && saveop->op_type == OP_REQUIRE)
2898 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
2903 SAVESPTR(PL_compcv);
2904 PL_compcv = (CV*)NEWSV(1104,0);
2905 sv_upgrade((SV *)PL_compcv, SVt_PVCV);
2906 CvEVAL_on(PL_compcv);
2907 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2908 cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
2910 CvOUTSIDE_SEQ(PL_compcv) = seq;
2911 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outside);
2913 /* set up a scratch pad */
2915 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE);
2918 SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
2920 /* make sure we compile in the right package */
2922 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
2923 SAVESPTR(PL_curstash);
2924 PL_curstash = CopSTASH(PL_curcop);
2926 SAVESPTR(PL_beginav);
2927 PL_beginav = newAV();
2928 SAVEFREESV(PL_beginav);
2929 SAVEI32(PL_error_count);
2931 /* try to compile it */
2933 PL_eval_root = Nullop;
2935 PL_curcop = &PL_compiling;
2936 PL_curcop->cop_arybase = 0;
2937 if (saveop && saveop->op_flags & OPf_SPECIAL)
2938 PL_in_eval |= EVAL_KEEPERR;
2940 sv_setpvn(ERRSV,"",0);
2941 if (yyparse() || PL_error_count || !PL_eval_root) {
2942 SV **newsp; /* Used by POPBLOCK. */
2943 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
2944 I32 optype = 0; /* Might be reset by POPEVAL. */
2949 op_free(PL_eval_root);
2950 PL_eval_root = Nullop;
2952 SP = PL_stack_base + POPMARK; /* pop original mark */
2954 POPBLOCK(cx,PL_curpm);
2960 msg = SvPVx_nolen_const(ERRSV);
2961 if (optype == OP_REQUIRE) {
2962 const SV * const nsv = cx->blk_eval.old_namesv;
2963 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
2965 DIE(aTHX_ "%sCompilation failed in require",
2966 *msg ? msg : "Unknown error\n");
2969 POPBLOCK(cx,PL_curpm);
2971 Perl_croak(aTHX_ "%sCompilation failed in regexp",
2972 (*msg ? msg : "Unknown error\n"));
2976 sv_setpv(ERRSV, "Compilation error");
2979 PERL_UNUSED_VAR(newsp);
2982 CopLINE_set(&PL_compiling, 0);
2984 *startop = PL_eval_root;
2986 SAVEFREEOP(PL_eval_root);
2988 /* Set the context for this new optree.
2989 * If the last op is an OP_REQUIRE, force scalar context.
2990 * Otherwise, propagate the context from the eval(). */
2991 if (PL_eval_root->op_type == OP_LEAVEEVAL
2992 && cUNOPx(PL_eval_root)->op_first->op_type == OP_LINESEQ
2993 && cLISTOPx(cUNOPx(PL_eval_root)->op_first)->op_last->op_type
2995 scalar(PL_eval_root);
2996 else if (gimme & G_VOID)
2997 scalarvoid(PL_eval_root);
2998 else if (gimme & G_ARRAY)
3001 scalar(PL_eval_root);
3003 DEBUG_x(dump_eval());
3005 /* Register with debugger: */
3006 if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
3007 CV * const cv = get_cv("DB::postponed", FALSE);
3011 XPUSHs((SV*)CopFILEGV(&PL_compiling));
3013 call_sv((SV*)cv, G_DISCARD);
3017 /* compiled okay, so do it */
3019 CvDEPTH(PL_compcv) = 1;
3020 SP = PL_stack_base + POPMARK; /* pop original mark */
3021 PL_op = saveop; /* The caller may need it. */
3022 PL_lex_state = LEX_NOTPARSING; /* $^S needs this. */
3024 RETURNOP(PL_eval_start);
3028 S_doopen_pm(pTHX_ const char *name, const char *mode)
3030 #ifndef PERL_DISABLE_PMC
3031 const STRLEN namelen = strlen(name);
3034 if (namelen > 3 && strEQ(name + namelen - 3, ".pm")) {
3035 SV * const pmcsv = Perl_newSVpvf(aTHX_ "%s%c", name, 'c');
3036 const char * const pmc = SvPV_nolen_const(pmcsv);
3038 if (PerlLIO_stat(pmc, &pmcstat) < 0) {
3039 fp = PerlIO_open(name, mode);
3043 if (PerlLIO_stat(name, &pmstat) < 0 ||
3044 pmstat.st_mtime < pmcstat.st_mtime)
3046 fp = PerlIO_open(pmc, mode);
3049 fp = PerlIO_open(name, mode);
3052 SvREFCNT_dec(pmcsv);
3055 fp = PerlIO_open(name, mode);
3059 return PerlIO_open(name, mode);
3060 #endif /* !PERL_DISABLE_PMC */
3066 register PERL_CONTEXT *cx;
3070 const char *tryname = Nullch;
3071 SV *namesv = Nullsv;
3072 const I32 gimme = GIMME_V;
3073 PerlIO *tryrsfp = 0;
3074 int filter_has_file = 0;
3075 GV *filter_child_proc = 0;
3076 SV *filter_state = 0;
3083 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3084 if ( SvVOK(sv) && ckWARN(WARN_PORTABLE) ) /* require v5.6.1 */
3085 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
3086 "v-string in use/require non-portable");
3088 sv = new_version(sv);
3089 if (!sv_derived_from(PL_patchlevel, "version"))
3090 (void *)upg_version(PL_patchlevel);
3091 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3092 if ( vcmp(sv,PL_patchlevel) < 0 )
3093 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
3094 vnormal(sv), vnormal(PL_patchlevel));
3097 if ( vcmp(sv,PL_patchlevel) > 0 )
3098 DIE(aTHX_ "Perl %"SVf" required--this is only %"SVf", stopped",
3099 vnormal(sv), vnormal(PL_patchlevel));
3104 name = SvPV_const(sv, len);
3105 if (!(name && len > 0 && *name))
3106 DIE(aTHX_ "Null filename used");
3107 TAINT_PROPER("require");
3108 if (PL_op->op_type == OP_REQUIRE) {
3109 SV ** const svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3111 if (*svp != &PL_sv_undef)
3114 DIE(aTHX_ "Compilation failed in require");
3118 /* prepare to compile file */
3120 if (path_is_absolute(name)) {
3122 tryrsfp = doopen_pm(name,PERL_SCRIPT_MODE);
3124 #ifdef MACOS_TRADITIONAL
3128 MacPerl_CanonDir(name, newname, 1);
3129 if (path_is_absolute(newname)) {
3131 tryrsfp = doopen_pm(newname,PERL_SCRIPT_MODE);
3136 AV * const ar = GvAVn(PL_incgv);
3140 if ((unixname = tounixspec(name, Nullch)) != Nullch)
3143 namesv = NEWSV(806, 0);
3144 for (i = 0; i <= AvFILL(ar); i++) {
3145 SV *dirsv = *av_fetch(ar, i, TRUE);
3151 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3152 && !sv_isobject(loader))
3154 loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
3157 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3158 PTR2UV(SvRV(dirsv)), name);
3159 tryname = SvPVX_const(namesv);
3170 if (sv_isobject(loader))
3171 count = call_method("INC", G_ARRAY);
3173 count = call_sv(loader, G_ARRAY);
3183 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
3187 if (SvTYPE(arg) == SVt_PVGV) {
3188 IO *io = GvIO((GV *)arg);
3193 tryrsfp = IoIFP(io);
3194 if (IoTYPE(io) == IoTYPE_PIPE) {
3195 /* reading from a child process doesn't
3196 nest -- when returning from reading
3197 the inner module, the outer one is
3198 unreadable (closed?) I've tried to
3199 save the gv to manage the lifespan of
3200 the pipe, but this didn't help. XXX */
3201 filter_child_proc = (GV *)arg;
3202 (void)SvREFCNT_inc(filter_child_proc);
3205 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3206 PerlIO_close(IoOFP(io));
3218 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3220 (void)SvREFCNT_inc(filter_sub);
3223 filter_state = SP[i];
3224 (void)SvREFCNT_inc(filter_state);
3228 tryrsfp = PerlIO_open("/dev/null",
3244 filter_has_file = 0;
3245 if (filter_child_proc) {
3246 SvREFCNT_dec(filter_child_proc);
3247 filter_child_proc = 0;
3250 SvREFCNT_dec(filter_state);
3254 SvREFCNT_dec(filter_sub);
3259 if (!path_is_absolute(name)
3260 #ifdef MACOS_TRADITIONAL
3261 /* We consider paths of the form :a:b ambiguous and interpret them first
3262 as global then as local
3264 || (*name == ':' && name[1] != ':' && strchr(name+2, ':'))
3267 const char *dir = SvPVx_nolen_const(dirsv);
3268 #ifdef MACOS_TRADITIONAL
3272 MacPerl_CanonDir(name, buf2, 1);
3273 Perl_sv_setpvf(aTHX_ namesv, "%s%s", MacPerl_CanonDir(dir, buf1, 0), buf2+(buf2[0] == ':'));
3277 if ((unixdir = tounixpath(dir, Nullch)) == Nullch)
3279 sv_setpv(namesv, unixdir);
3280 sv_catpv(namesv, unixname);
3282 # ifdef __SYMBIAN32__
3283 if (PL_origfilename[0] &&
3284 PL_origfilename[1] == ':' &&
3285 !(dir[0] && dir[1] == ':'))
3286 Perl_sv_setpvf(aTHX_ namesv,
3291 Perl_sv_setpvf(aTHX_ namesv,
3295 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3299 TAINT_PROPER("require");
3300 tryname = SvPVX_const(namesv);
3301 tryrsfp = doopen_pm(tryname, PERL_SCRIPT_MODE);
3303 if (tryname[0] == '.' && tryname[1] == '/')
3312 SAVECOPFILE_FREE(&PL_compiling);
3313 CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
3314 SvREFCNT_dec(namesv);
3316 if (PL_op->op_type == OP_REQUIRE) {
3317 const char *msgstr = name;
3318 if(errno == EMFILE) {
3319 SV * const msg = sv_2mortal(newSVpv(msgstr,0));
3320 sv_catpv(msg, ": ");
3321 sv_catpv(msg, Strerror(errno));
3322 msgstr = SvPV_nolen_const(msg);
3324 if (namesv) { /* did we lookup @INC? */
3325 SV * const msg = sv_2mortal(newSVpv(msgstr,0));
3326 SV * const dirmsgsv = NEWSV(0, 0);
3327 AV * const ar = GvAVn(PL_incgv);
3329 sv_catpvn(msg, " in @INC", 8);
3330 if (instr(SvPVX_const(msg), ".h "))
3331 sv_catpv(msg, " (change .h to .ph maybe?)");
3332 if (instr(SvPVX_const(msg), ".ph "))
3333 sv_catpv(msg, " (did you run h2ph?)");
3334 sv_catpv(msg, " (@INC contains:");
3335 for (i = 0; i <= AvFILL(ar); i++) {
3336 const char *dir = SvPVx_nolen_const(*av_fetch(ar, i, TRUE));
3337 Perl_sv_setpvf(aTHX_ dirmsgsv, " %s", dir);
3338 sv_catsv(msg, dirmsgsv);
3340 sv_catpvn(msg, ")", 1);
3341 SvREFCNT_dec(dirmsgsv);
3342 msgstr = SvPV_nolen_const(msg);
3345 DIE(aTHX_ "Can't locate %s", msgstr);
3351 SETERRNO(0, SS_NORMAL);
3353 /* Assume success here to prevent recursive requirement. */
3355 /* Check whether a hook in @INC has already filled %INC */
3357 (void)hv_store(GvHVn(PL_incgv), name, len, newSVpv(CopFILE(&PL_compiling),0),0);
3359 SV** const svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3361 (void)hv_store(GvHVn(PL_incgv), name, len, SvREFCNT_inc(hook_sv), 0 );
3366 lex_start(sv_2mortal(newSVpvn("",0)));
3367 SAVEGENERICSV(PL_rsfp_filters);
3368 PL_rsfp_filters = Nullav;
3373 SAVESPTR(PL_compiling.cop_warnings);
3374 if (PL_dowarn & G_WARN_ALL_ON)
3375 PL_compiling.cop_warnings = pWARN_ALL ;
3376 else if (PL_dowarn & G_WARN_ALL_OFF)
3377 PL_compiling.cop_warnings = pWARN_NONE ;
3378 else if (PL_taint_warn)
3379 PL_compiling.cop_warnings = newSVpvn(WARN_TAINTstring, WARNsize);
3381 PL_compiling.cop_warnings = pWARN_STD ;
3382 SAVESPTR(PL_compiling.cop_io);
3383 PL_compiling.cop_io = Nullsv;
3385 if (filter_sub || filter_child_proc) {
3386 SV * const datasv = filter_add(run_user_filter, Nullsv);
3387 IoLINES(datasv) = filter_has_file;
3388 IoFMT_GV(datasv) = (GV *)filter_child_proc;
3389 IoTOP_GV(datasv) = (GV *)filter_state;
3390 IoBOTTOM_GV(datasv) = (GV *)filter_sub;
3393 /* switch to eval mode */
3394 PUSHBLOCK(cx, CXt_EVAL, SP);
3395 PUSHEVAL(cx, name, Nullgv);
3396 cx->blk_eval.retop = PL_op->op_next;
3398 SAVECOPLINE(&PL_compiling);
3399 CopLINE_set(&PL_compiling, 0);
3403 /* Store and reset encoding. */
3404 encoding = PL_encoding;
3405 PL_encoding = Nullsv;
3407 op = DOCATCH(doeval(gimme, NULL, Nullcv, PL_curcop->cop_seq));
3409 /* Restore encoding. */
3410 PL_encoding = encoding;
3418 register PERL_CONTEXT *cx;
3420 const I32 gimme = GIMME_V;
3421 const I32 was = PL_sub_generation;
3422 char tbuf[TYPE_DIGITS(long) + 12];
3423 char *tmpbuf = tbuf;
3430 if (!SvPV_const(sv,len))
3432 TAINT_PROPER("eval");
3438 /* switch to eval mode */
3440 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
3441 SV * const sv = sv_newmortal();
3442 Perl_sv_setpvf(aTHX_ sv, "_<(eval %lu)[%s:%"IVdf"]",
3443 (unsigned long)++PL_evalseq,
3444 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3448 sprintf(tmpbuf, "_<(eval %lu)", (unsigned long)++PL_evalseq);
3449 SAVECOPFILE_FREE(&PL_compiling);
3450 CopFILE_set(&PL_compiling, tmpbuf+2);
3451 SAVECOPLINE(&PL_compiling);
3452 CopLINE_set(&PL_compiling, 1);
3453 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3454 deleting the eval's FILEGV from the stash before gv_check() runs
3455 (i.e. before run-time proper). To work around the coredump that
3456 ensues, we always turn GvMULTI_on for any globals that were
3457 introduced within evals. See force_ident(). GSAR 96-10-12 */
3458 safestr = savepv(tmpbuf);
3459 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
3461 PL_hints = PL_op->op_targ;
3462 SAVESPTR(PL_compiling.cop_warnings);
3463 if (specialWARN(PL_curcop->cop_warnings))
3464 PL_compiling.cop_warnings = PL_curcop->cop_warnings;
3466 PL_compiling.cop_warnings = newSVsv(PL_curcop->cop_warnings);
3467 SAVEFREESV(PL_compiling.cop_warnings);
3469 SAVESPTR(PL_compiling.cop_io);
3470 if (specialCopIO(PL_curcop->cop_io))
3471 PL_compiling.cop_io = PL_curcop->cop_io;
3473 PL_compiling.cop_io = newSVsv(PL_curcop->cop_io);
3474 SAVEFREESV(PL_compiling.cop_io);
3476 /* special case: an eval '' executed within the DB package gets lexically
3477 * placed in the first non-DB CV rather than the current CV - this
3478 * allows the debugger to execute code, find lexicals etc, in the
3479 * scope of the code being debugged. Passing &seq gets find_runcv
3480 * to do the dirty work for us */
3481 runcv = find_runcv(&seq);
3483 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
3484 PUSHEVAL(cx, 0, Nullgv);
3485 cx->blk_eval.retop = PL_op->op_next;
3487 /* prepare to compile string */
3489 if (PERLDB_LINE && PL_curstash != PL_debstash)
3490 save_lines(CopFILEAV(&PL_compiling), PL_linestr);
3492 ret = doeval(gimme, NULL, runcv, seq);
3493 if (PERLDB_INTER && was != (I32)PL_sub_generation /* Some subs defined here. */
3494 && ret != PL_op->op_next) { /* Successive compilation. */
3495 strcpy(safestr, "_<(eval )"); /* Anything fake and short. */
3497 return DOCATCH(ret);
3507 register PERL_CONTEXT *cx;
3509 const U8 save_flags = PL_op -> op_flags;
3514 retop = cx->blk_eval.retop;
3517 if (gimme == G_VOID)
3519 else if (gimme == G_SCALAR) {
3522 if (SvFLAGS(TOPs) & SVs_TEMP)
3525 *MARK = sv_mortalcopy(TOPs);
3529 *MARK = &PL_sv_undef;
3534 /* in case LEAVE wipes old return values */
3535 for (mark = newsp + 1; mark <= SP; mark++) {
3536 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
3537 *mark = sv_mortalcopy(*mark);
3538 TAINT_NOT; /* Each item is independent */
3542 PL_curpm = newpm; /* Don't pop $1 et al till now */
3545 assert(CvDEPTH(PL_compcv) == 1);
3547 CvDEPTH(PL_compcv) = 0;
3550 if (optype == OP_REQUIRE &&
3551 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
3553 /* Unassume the success we assumed earlier. */
3554 SV * const nsv = cx->blk_eval.old_namesv;
3555 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
3556 retop = Perl_die(aTHX_ "%"SVf" did not return a true value", nsv);
3557 /* die_where() did LEAVE, or we won't be here */
3561 if (!(save_flags & OPf_SPECIAL))
3562 sv_setpvn(ERRSV,"",0);
3571 register PERL_CONTEXT *cx;
3572 const I32 gimme = GIMME_V;
3577 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), SP);
3579 cx->blk_eval.retop = cLOGOP->op_other->op_next;
3581 PL_in_eval = EVAL_INEVAL;
3582 sv_setpvn(ERRSV,"",0);
3584 return DOCATCH(PL_op->op_next);
3594 register PERL_CONTEXT *cx;
3599 PERL_UNUSED_VAR(optype);
3602 if (gimme == G_VOID)
3604 else if (gimme == G_SCALAR) {
3607 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
3610 *MARK = sv_mortalcopy(TOPs);
3614 *MARK = &PL_sv_undef;
3619 /* in case LEAVE wipes old return values */
3620 for (mark = newsp + 1; mark <= SP; mark++) {
3621 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
3622 *mark = sv_mortalcopy(*mark);
3623 TAINT_NOT; /* Each item is independent */
3627 PL_curpm = newpm; /* Don't pop $1 et al till now */
3630 sv_setpvn(ERRSV,"",0);
3635 S_doparseform(pTHX_ SV *sv)
3638 register char *s = SvPV_force(sv, len);
3639 register char *send = s + len;
3640 register char *base = Nullch;
3641 register I32 skipspaces = 0;
3642 bool noblank = FALSE;
3643 bool repeat = FALSE;
3644 bool postspace = FALSE;
3650 bool unchopnum = FALSE;
3651 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
3654 Perl_croak(aTHX_ "Null picture in formline");
3656 /* estimate the buffer size needed */
3657 for (base = s; s <= send; s++) {
3658 if (*s == '\n' || *s == '@' || *s == '^')
3664 Newx(fops, maxops, U32);
3669 *fpc++ = FF_LINEMARK;
3670 noblank = repeat = FALSE;
3688 case ' ': case '\t':
3695 } /* else FALL THROUGH */
3703 *fpc++ = FF_LITERAL;
3711 *fpc++ = (U16)skipspaces;
3715 *fpc++ = FF_NEWLINE;
3719 arg = fpc - linepc + 1;
3726 *fpc++ = FF_LINEMARK;
3727 noblank = repeat = FALSE;
3736 ischop = s[-1] == '^';
3742 arg = (s - base) - 1;
3744 *fpc++ = FF_LITERAL;
3752 *fpc++ = 2; /* skip the @* or ^* */
3754 *fpc++ = FF_LINESNGL;
3757 *fpc++ = FF_LINEGLOB;
3759 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
3760 arg = ischop ? 512 : 0;
3765 const char * const f = ++s;
3768 arg |= 256 + (s - f);
3770 *fpc++ = s - base; /* fieldsize for FETCH */
3771 *fpc++ = FF_DECIMAL;
3773 unchopnum |= ! ischop;
3775 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
3776 arg = ischop ? 512 : 0;
3778 s++; /* skip the '0' first */
3782 const char * const f = ++s;
3785 arg |= 256 + (s - f);
3787 *fpc++ = s - base; /* fieldsize for FETCH */
3788 *fpc++ = FF_0DECIMAL;
3790 unchopnum |= ! ischop;
3794 bool ismore = FALSE;
3797 while (*++s == '>') ;
3798 prespace = FF_SPACE;
3800 else if (*s == '|') {
3801 while (*++s == '|') ;
3802 prespace = FF_HALFSPACE;
3807 while (*++s == '<') ;
3810 if (*s == '.' && s[1] == '.' && s[2] == '.') {
3814 *fpc++ = s - base; /* fieldsize for FETCH */
3816 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
3819 *fpc++ = (U16)prespace;
3833 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
3835 { /* need to jump to the next word */
3837 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
3838 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U32) + 4);
3839 s = SvPVX(sv) + SvCUR(sv) + z;
3841 Copy(fops, s, arg, U32);
3843 sv_magic(sv, Nullsv, PERL_MAGIC_fm, Nullch, 0);
3846 if (unchopnum && repeat)
3847 DIE(aTHX_ "Repeated format line will never terminate (~~ and @#)");
3853 S_num_overflow(NV value, I32 fldsize, I32 frcsize)
3855 /* Can value be printed in fldsize chars, using %*.*f ? */
3859 int intsize = fldsize - (value < 0 ? 1 : 0);
3866 while (intsize--) pwr *= 10.0;
3867 while (frcsize--) eps /= 10.0;
3870 if (value + eps >= pwr)
3873 if (value - eps <= -pwr)
3880 run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
3883 SV *datasv = FILTER_DATA(idx);
3884 const int filter_has_file = IoLINES(datasv);
3885 GV *filter_child_proc = (GV *)IoFMT_GV(datasv);
3886 SV *filter_state = (SV *)IoTOP_GV(datasv);
3887 SV *filter_sub = (SV *)IoBOTTOM_GV(datasv);
3890 /* I was having segfault trouble under Linux 2.2.5 after a
3891 parse error occured. (Had to hack around it with a test
3892 for PL_error_count == 0.) Solaris doesn't segfault --
3893 not sure where the trouble is yet. XXX */
3895 if (filter_has_file) {
3896 len = FILTER_READ(idx+1, buf_sv, maxlen);
3899 if (filter_sub && len >= 0) {
3910 PUSHs(sv_2mortal(newSViv(maxlen)));
3912 PUSHs(filter_state);
3915 count = call_sv(filter_sub, G_SCALAR);
3931 IoLINES(datasv) = 0;
3932 if (filter_child_proc) {
3933 SvREFCNT_dec(filter_child_proc);
3934 IoFMT_GV(datasv) = Nullgv;
3937 SvREFCNT_dec(filter_state);
3938 IoTOP_GV(datasv) = Nullgv;
3941 SvREFCNT_dec(filter_sub);
3942 IoBOTTOM_GV(datasv) = Nullgv;
3944 filter_del(run_user_filter);
3950 /* perhaps someone can come up with a better name for
3951 this? it is not really "absolute", per se ... */
3953 S_path_is_absolute(pTHX_ const char *name)
3955 if (PERL_FILE_IS_ABSOLUTE(name)
3956 #ifdef MACOS_TRADITIONAL
3959 || (*name == '.' && (name[1] == '/' ||
3960 (name[1] == '.' && name[2] == '/'))))
3971 * c-indentation-style: bsd
3973 * indent-tabs-mode: t
3976 * ex: set ts=8 sts=4 sw=4 noet: