3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 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 #define dopoptosub(plop) dopoptosub_at(cxstack, (plop))
50 cxix = dopoptosub(cxstack_ix);
54 switch (cxstack[cxix].blk_gimme) {
67 /* XXXX Should store the old value to allow for tie/overload - and
68 restore in regcomp, where marked with XXXX. */
78 register PMOP *pm = (PMOP*)cLOGOP->op_other;
82 /* prevent recompiling under /o and ithreads. */
83 #if defined(USE_ITHREADS)
84 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
85 if (PL_op->op_flags & OPf_STACKED) {
94 if (PL_op->op_flags & OPf_STACKED) {
95 /* multiple args; concatentate them */
97 tmpstr = PAD_SV(ARGTARG);
98 sv_setpvn(tmpstr, "", 0);
99 while (++MARK <= SP) {
100 if (PL_amagic_generation) {
102 if ((SvAMAGIC(tmpstr) || SvAMAGIC(*MARK)) &&
103 (sv = amagic_call(tmpstr, *MARK, concat_amg, AMGf_assign)))
105 sv_setsv(tmpstr, sv);
109 sv_catsv(tmpstr, *MARK);
118 SV * const sv = SvRV(tmpstr);
119 if (SvTYPE(sv) == SVt_REGEXP)
123 re = reg_temp_copy(re);
124 ReREFCNT_dec(PM_GETRE(pm));
129 const char *t = SvOK(tmpstr) ? SvPV_const(tmpstr, len) : "";
131 assert (re != (REGEXP*) &PL_sv_undef);
133 /* Check against the last compiled regexp. */
134 if (!re || !RX_PRECOMP(re) || RX_PRELEN(re) != len ||
135 memNE(RX_PRECOMP(re), t, len))
137 const regexp_engine *eng = re ? RX_ENGINE(re) : NULL;
138 U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME;
142 PM_SETRE(pm, (REGEXP*) &PL_sv_undef);
144 PM_SETRE(pm, NULL); /* crucial if regcomp aborts */
146 } else if (PL_curcop->cop_hints_hash) {
147 SV *ptr = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash, 0,
149 if (ptr && SvIOK(ptr) && SvIV(ptr))
150 eng = INT2PTR(regexp_engine*,SvIV(ptr));
153 if (PL_op->op_flags & OPf_SPECIAL)
154 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
156 if (DO_UTF8(tmpstr)) {
157 assert (SvUTF8(tmpstr));
158 } else if (SvUTF8(tmpstr)) {
159 /* Not doing UTF-8, despite what the SV says. Is this only if
160 we're trapped in use 'bytes'? */
161 /* Make a copy of the octet sequence, but without the flag on,
162 as the compiler now honours the SvUTF8 flag on tmpstr. */
164 const char *const p = SvPV(tmpstr, len);
165 tmpstr = newSVpvn_flags(p, len, SVs_TEMP);
169 PM_SETRE(pm, CALLREGCOMP_ENG(eng, tmpstr, pm_flags));
171 PM_SETRE(pm, CALLREGCOMP(tmpstr, pm_flags));
173 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
174 inside tie/overload accessors. */
180 #ifndef INCOMPLETE_TAINTS
183 RX_EXTFLAGS(re) |= RXf_TAINTED;
185 RX_EXTFLAGS(re) &= ~RXf_TAINTED;
189 if (!RX_PRELEN(PM_GETRE(pm)) && PL_curpm)
193 #if !defined(USE_ITHREADS)
194 /* can't change the optree at runtime either */
195 /* PMf_KEEP is handled differently under threads to avoid these problems */
196 if (pm->op_pmflags & PMf_KEEP) {
197 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
198 cLOGOP->op_first->op_next = PL_op->op_next;
208 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
209 register PMOP * const pm = (PMOP*) cLOGOP->op_other;
210 register SV * const dstr = cx->sb_dstr;
211 register char *s = cx->sb_s;
212 register char *m = cx->sb_m;
213 char *orig = cx->sb_orig;
214 register REGEXP * const rx = cx->sb_rx;
216 REGEXP *old = PM_GETRE(pm);
220 PM_SETRE(pm,ReREFCNT_inc(rx));
223 rxres_restore(&cx->sb_rxres, rx);
224 RX_MATCH_UTF8_set(rx, DO_UTF8(cx->sb_targ));
226 if (cx->sb_iters++) {
227 const I32 saviters = cx->sb_iters;
228 if (cx->sb_iters > cx->sb_maxiters)
229 DIE(aTHX_ "Substitution loop");
231 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
232 cx->sb_rxtainted |= 2;
233 sv_catsv(dstr, POPs);
236 if (CxONCE(cx) || !CALLREGEXEC(rx, s, cx->sb_strend, orig,
237 s == m, cx->sb_targ, NULL,
238 ((cx->sb_rflags & REXEC_COPY_STR)
239 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
240 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
242 SV * const targ = cx->sb_targ;
244 assert(cx->sb_strend >= s);
245 if(cx->sb_strend > s) {
246 if (DO_UTF8(dstr) && !SvUTF8(targ))
247 sv_catpvn_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
249 sv_catpvn(dstr, s, cx->sb_strend - s);
251 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
253 #ifdef PERL_OLD_COPY_ON_WRITE
255 sv_force_normal_flags(targ, SV_COW_DROP_PV);
261 SvPV_set(targ, SvPVX(dstr));
262 SvCUR_set(targ, SvCUR(dstr));
263 SvLEN_set(targ, SvLEN(dstr));
266 SvPV_set(dstr, NULL);
268 TAINT_IF(cx->sb_rxtainted & 1);
269 mPUSHi(saviters - 1);
271 (void)SvPOK_only_UTF8(targ);
272 TAINT_IF(cx->sb_rxtainted);
276 LEAVE_SCOPE(cx->sb_oldsave);
278 RETURNOP(pm->op_next);
280 cx->sb_iters = saviters;
282 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
285 cx->sb_orig = orig = RX_SUBBEG(rx);
287 cx->sb_strend = s + (cx->sb_strend - m);
289 cx->sb_m = m = RX_OFFS(rx)[0].start + orig;
291 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
292 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
294 sv_catpvn(dstr, s, m-s);
296 cx->sb_s = RX_OFFS(rx)[0].end + orig;
297 { /* Update the pos() information. */
298 SV * const sv = cx->sb_targ;
300 SvUPGRADE(sv, SVt_PVMG);
301 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
302 #ifdef PERL_OLD_COPY_ON_WRITE
304 sv_force_normal_flags(sv, 0);
306 mg = sv_magicext(sv, NULL, PERL_MAGIC_regex_global, &PL_vtbl_mglob,
309 mg->mg_len = m - orig;
312 (void)ReREFCNT_inc(rx);
313 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
314 rxres_save(&cx->sb_rxres, rx);
315 RETURNOP(pm->op_pmstashstartu.op_pmreplstart);
319 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
324 PERL_ARGS_ASSERT_RXRES_SAVE;
327 if (!p || p[1] < RX_NPARENS(rx)) {
328 #ifdef PERL_OLD_COPY_ON_WRITE
329 i = 7 + RX_NPARENS(rx) * 2;
331 i = 6 + RX_NPARENS(rx) * 2;
340 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? RX_SUBBEG(rx) : NULL);
341 RX_MATCH_COPIED_off(rx);
343 #ifdef PERL_OLD_COPY_ON_WRITE
344 *p++ = PTR2UV(RX_SAVED_COPY(rx));
345 RX_SAVED_COPY(rx) = NULL;
348 *p++ = RX_NPARENS(rx);
350 *p++ = PTR2UV(RX_SUBBEG(rx));
351 *p++ = (UV)RX_SUBLEN(rx);
352 for (i = 0; i <= RX_NPARENS(rx); ++i) {
353 *p++ = (UV)RX_OFFS(rx)[i].start;
354 *p++ = (UV)RX_OFFS(rx)[i].end;
359 Perl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
364 PERL_ARGS_ASSERT_RXRES_RESTORE;
367 RX_MATCH_COPY_FREE(rx);
368 RX_MATCH_COPIED_set(rx, *p);
371 #ifdef PERL_OLD_COPY_ON_WRITE
372 if (RX_SAVED_COPY(rx))
373 SvREFCNT_dec (RX_SAVED_COPY(rx));
374 RX_SAVED_COPY(rx) = INT2PTR(SV*,*p);
378 RX_NPARENS(rx) = *p++;
380 RX_SUBBEG(rx) = INT2PTR(char*,*p++);
381 RX_SUBLEN(rx) = (I32)(*p++);
382 for (i = 0; i <= RX_NPARENS(rx); ++i) {
383 RX_OFFS(rx)[i].start = (I32)(*p++);
384 RX_OFFS(rx)[i].end = (I32)(*p++);
389 Perl_rxres_free(pTHX_ void **rsp)
391 UV * const p = (UV*)*rsp;
393 PERL_ARGS_ASSERT_RXRES_FREE;
398 void *tmp = INT2PTR(char*,*p);
401 PoisonFree(*p, 1, sizeof(*p));
403 Safefree(INT2PTR(char*,*p));
405 #ifdef PERL_OLD_COPY_ON_WRITE
407 SvREFCNT_dec (INT2PTR(SV*,p[1]));
417 dVAR; dSP; dMARK; dORIGMARK;
418 register SV * const tmpForm = *++MARK;
423 register SV *sv = NULL;
424 const char *item = NULL;
428 bool chopspace = (strchr(PL_chopset, ' ') != NULL);
429 const char *chophere = NULL;
430 char *linemark = NULL;
432 bool gotsome = FALSE;
434 const STRLEN fudge = SvPOK(tmpForm)
435 ? (SvCUR(tmpForm) * (IN_BYTES ? 1 : 3) + 1) : 0;
436 bool item_is_utf8 = FALSE;
437 bool targ_is_utf8 = FALSE;
439 OP * parseres = NULL;
443 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
444 if (SvREADONLY(tmpForm)) {
445 SvREADONLY_off(tmpForm);
446 parseres = doparseform(tmpForm);
447 SvREADONLY_on(tmpForm);
450 parseres = doparseform(tmpForm);
454 SvPV_force(PL_formtarget, len);
455 if (DO_UTF8(PL_formtarget))
457 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
459 f = SvPV_const(tmpForm, len);
460 /* need to jump to the next word */
461 fpc = (U32*)(f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN);
465 const char *name = "???";
468 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
469 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
470 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
471 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
472 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
474 case FF_CHECKNL: name = "CHECKNL"; break;
475 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
476 case FF_SPACE: name = "SPACE"; break;
477 case FF_HALFSPACE: name = "HALFSPACE"; break;
478 case FF_ITEM: name = "ITEM"; break;
479 case FF_CHOP: name = "CHOP"; break;
480 case FF_LINEGLOB: name = "LINEGLOB"; break;
481 case FF_NEWLINE: name = "NEWLINE"; break;
482 case FF_MORE: name = "MORE"; break;
483 case FF_LINEMARK: name = "LINEMARK"; break;
484 case FF_END: name = "END"; break;
485 case FF_0DECIMAL: name = "0DECIMAL"; break;
486 case FF_LINESNGL: name = "LINESNGL"; break;
489 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
491 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
502 if (targ_is_utf8 && !SvUTF8(tmpForm)) {
503 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
505 sv_catpvn_utf8_upgrade(PL_formtarget, f, arg, nsv);
506 t = SvEND(PL_formtarget);
509 if (!targ_is_utf8 && DO_UTF8(tmpForm)) {
510 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
512 sv_utf8_upgrade(PL_formtarget);
513 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
514 t = SvEND(PL_formtarget);
534 if (ckWARN(WARN_SYNTAX))
535 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
542 const char *s = item = SvPV_const(sv, len);
545 itemsize = sv_len_utf8(sv);
546 if (itemsize != (I32)len) {
548 if (itemsize > fieldsize) {
549 itemsize = fieldsize;
550 itembytes = itemsize;
551 sv_pos_u2b(sv, &itembytes, 0);
555 send = chophere = s + itembytes;
565 sv_pos_b2u(sv, &itemsize);
569 item_is_utf8 = FALSE;
570 if (itemsize > fieldsize)
571 itemsize = fieldsize;
572 send = chophere = s + itemsize;
586 const char *s = item = SvPV_const(sv, len);
589 itemsize = sv_len_utf8(sv);
590 if (itemsize != (I32)len) {
592 if (itemsize <= fieldsize) {
593 const char *send = chophere = s + itemsize;
606 itemsize = fieldsize;
607 itembytes = itemsize;
608 sv_pos_u2b(sv, &itembytes, 0);
609 send = chophere = s + itembytes;
610 while (s < send || (s == send && isSPACE(*s))) {
620 if (strchr(PL_chopset, *s))
625 itemsize = chophere - item;
626 sv_pos_b2u(sv, &itemsize);
632 item_is_utf8 = FALSE;
633 if (itemsize <= fieldsize) {
634 const char *const send = chophere = s + itemsize;
647 itemsize = fieldsize;
648 send = chophere = s + itemsize;
649 while (s < send || (s == send && isSPACE(*s))) {
659 if (strchr(PL_chopset, *s))
664 itemsize = chophere - item;
670 arg = fieldsize - itemsize;
679 arg = fieldsize - itemsize;
690 const char *s = item;
694 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
696 sv_utf8_upgrade(PL_formtarget);
697 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
698 t = SvEND(PL_formtarget);
702 if (UTF8_IS_CONTINUED(*s)) {
703 STRLEN skip = UTF8SKIP(s);
720 if ( !((*t++ = *s++) & ~31) )
726 if (targ_is_utf8 && !item_is_utf8) {
727 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
729 sv_catpvn_utf8_upgrade(PL_formtarget, s, arg, nsv);
730 for (; t < SvEND(PL_formtarget); t++) {
743 const int ch = *t++ = *s++;
746 if ( !((*t++ = *s++) & ~31) )
755 const char *s = chophere;
773 const char *s = item = SvPV_const(sv, len);
775 if ((item_is_utf8 = DO_UTF8(sv)))
776 itemsize = sv_len_utf8(sv);
778 bool chopped = FALSE;
779 const char *const send = s + len;
781 chophere = s + itemsize;
797 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
799 SvUTF8_on(PL_formtarget);
801 SvCUR_set(sv, chophere - item);
802 sv_catsv(PL_formtarget, sv);
803 SvCUR_set(sv, itemsize);
805 sv_catsv(PL_formtarget, sv);
807 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) - 1);
808 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
809 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
818 #if defined(USE_LONG_DOUBLE)
821 "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl);
825 "%#0*.*f" : "%0*.*f");
830 #if defined(USE_LONG_DOUBLE)
832 ((arg & 256) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl);
835 ((arg & 256) ? "%#*.*f" : "%*.*f");
838 /* If the field is marked with ^ and the value is undefined,
840 if ((arg & 512) && !SvOK(sv)) {
848 /* overflow evidence */
849 if (num_overflow(value, fieldsize, arg)) {
855 /* Formats aren't yet marked for locales, so assume "yes". */
857 STORE_NUMERIC_STANDARD_SET_LOCAL();
858 my_snprintf(t, SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget)), fmt, (int) fieldsize, (int) arg & 255, value);
859 RESTORE_NUMERIC_STANDARD();
866 while (t-- > linemark && *t == ' ') ;
874 if (arg) { /* repeat until fields exhausted? */
876 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
877 lines += FmLINES(PL_formtarget);
880 if (strnEQ(linemark, linemark - arg, arg))
881 DIE(aTHX_ "Runaway format");
884 SvUTF8_on(PL_formtarget);
885 FmLINES(PL_formtarget) = lines;
887 RETURNOP(cLISTOP->op_first);
898 const char *s = chophere;
899 const char *send = item + len;
901 while (isSPACE(*s) && (s < send))
906 arg = fieldsize - itemsize;
913 if (strnEQ(s1," ",3)) {
914 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
925 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
927 SvUTF8_on(PL_formtarget);
928 FmLINES(PL_formtarget) += lines;
940 if (PL_stack_base + *PL_markstack_ptr == SP) {
942 if (GIMME_V == G_SCALAR)
944 RETURNOP(PL_op->op_next->op_next);
946 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
947 pp_pushmark(); /* push dst */
948 pp_pushmark(); /* push src */
949 ENTER; /* enter outer scope */
952 if (PL_op->op_private & OPpGREP_LEX)
953 SAVESPTR(PAD_SVl(PL_op->op_targ));
956 ENTER; /* enter inner scope */
959 src = PL_stack_base[*PL_markstack_ptr];
961 if (PL_op->op_private & OPpGREP_LEX)
962 PAD_SVl(PL_op->op_targ) = src;
967 if (PL_op->op_type == OP_MAPSTART)
968 pp_pushmark(); /* push top */
969 return ((LOGOP*)PL_op->op_next)->op_other;
975 const I32 gimme = GIMME_V;
976 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
982 /* first, move source pointer to the next item in the source list */
983 ++PL_markstack_ptr[-1];
985 /* if there are new items, push them into the destination list */
986 if (items && gimme != G_VOID) {
987 /* might need to make room back there first */
988 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
989 /* XXX this implementation is very pessimal because the stack
990 * is repeatedly extended for every set of items. Is possible
991 * to do this without any stack extension or copying at all
992 * by maintaining a separate list over which the map iterates
993 * (like foreach does). --gsar */
995 /* everything in the stack after the destination list moves
996 * towards the end the stack by the amount of room needed */
997 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
999 /* items to shift up (accounting for the moved source pointer) */
1000 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
1002 /* This optimization is by Ben Tilly and it does
1003 * things differently from what Sarathy (gsar)
1004 * is describing. The downside of this optimization is
1005 * that leaves "holes" (uninitialized and hopefully unused areas)
1006 * to the Perl stack, but on the other hand this
1007 * shouldn't be a problem. If Sarathy's idea gets
1008 * implemented, this optimization should become
1009 * irrelevant. --jhi */
1011 shift = count; /* Avoid shifting too often --Ben Tilly */
1015 dst = (SP += shift);
1016 PL_markstack_ptr[-1] += shift;
1017 *PL_markstack_ptr += shift;
1021 /* copy the new items down to the destination list */
1022 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
1023 if (gimme == G_ARRAY) {
1025 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
1028 /* scalar context: we don't care about which values map returns
1029 * (we use undef here). And so we certainly don't want to do mortal
1030 * copies of meaningless values. */
1031 while (items-- > 0) {
1033 *dst-- = &PL_sv_undef;
1037 LEAVE; /* exit inner scope */
1040 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
1042 (void)POPMARK; /* pop top */
1043 LEAVE; /* exit outer scope */
1044 (void)POPMARK; /* pop src */
1045 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1046 (void)POPMARK; /* pop dst */
1047 SP = PL_stack_base + POPMARK; /* pop original mark */
1048 if (gimme == G_SCALAR) {
1049 if (PL_op->op_private & OPpGREP_LEX) {
1050 SV* sv = sv_newmortal();
1051 sv_setiv(sv, items);
1059 else if (gimme == G_ARRAY)
1066 ENTER; /* enter inner scope */
1069 /* set $_ to the new source item */
1070 src = PL_stack_base[PL_markstack_ptr[-1]];
1072 if (PL_op->op_private & OPpGREP_LEX)
1073 PAD_SVl(PL_op->op_targ) = src;
1077 RETURNOP(cLOGOP->op_other);
1086 if (GIMME == G_ARRAY)
1088 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1089 return cLOGOP->op_other;
1099 if (GIMME == G_ARRAY) {
1100 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1104 SV * const targ = PAD_SV(PL_op->op_targ);
1107 if (PL_op->op_private & OPpFLIP_LINENUM) {
1108 if (GvIO(PL_last_in_gv)) {
1109 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1112 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1114 flip = SvIV(sv) == SvIV(GvSV(gv));
1120 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1121 if (PL_op->op_flags & OPf_SPECIAL) {
1129 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1132 sv_setpvn(TARG, "", 0);
1138 /* This code tries to decide if "$left .. $right" should use the
1139 magical string increment, or if the range is numeric (we make
1140 an exception for .."0" [#18165]). AMS 20021031. */
1142 #define RANGE_IS_NUMERIC(left,right) ( \
1143 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1144 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1145 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1146 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1147 && (!SvOK(right) || looks_like_number(right))))
1153 if (GIMME == G_ARRAY) {
1159 if (RANGE_IS_NUMERIC(left,right)) {
1162 if ((SvOK(left) && SvNV(left) < IV_MIN) ||
1163 (SvOK(right) && SvNV(right) > IV_MAX))
1164 DIE(aTHX_ "Range iterator outside integer range");
1175 SV * const sv = sv_2mortal(newSViv(i++));
1180 SV * const final = sv_mortalcopy(right);
1182 const char * const tmps = SvPV_const(final, len);
1184 SV *sv = sv_mortalcopy(left);
1185 SvPV_force_nolen(sv);
1186 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1188 if (strEQ(SvPVX_const(sv),tmps))
1190 sv = sv_2mortal(newSVsv(sv));
1197 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1201 if (PL_op->op_private & OPpFLIP_LINENUM) {
1202 if (GvIO(PL_last_in_gv)) {
1203 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1206 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1207 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1215 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1216 sv_catpvs(targ, "E0");
1226 static const char * const context_name[] = {
1229 NULL, /* CXt_BLOCK never actually needs "block" */
1231 NULL, /* CXt_LOOP_FOR never actually needs "loop" */
1232 NULL, /* CXt_LOOP_PLAIN never actually needs "loop" */
1233 NULL, /* CXt_LOOP_LAZYSV never actually needs "loop" */
1234 NULL, /* CXt_LOOP_LAZYIV never actually needs "loop" */
1242 S_dopoptolabel(pTHX_ const char *label)
1247 PERL_ARGS_ASSERT_DOPOPTOLABEL;
1249 for (i = cxstack_ix; i >= 0; i--) {
1250 register const PERL_CONTEXT * const cx = &cxstack[i];
1251 switch (CxTYPE(cx)) {
1259 if (ckWARN(WARN_EXITING))
1260 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1261 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1262 if (CxTYPE(cx) == CXt_NULL)
1265 case CXt_LOOP_LAZYIV:
1266 case CXt_LOOP_LAZYSV:
1268 case CXt_LOOP_PLAIN:
1269 if ( !CxLABEL(cx) || strNE(label, CxLABEL(cx)) ) {
1270 DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1271 (long)i, CxLABEL(cx)));
1274 DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1284 Perl_dowantarray(pTHX)
1287 const I32 gimme = block_gimme();
1288 return (gimme == G_VOID) ? G_SCALAR : gimme;
1292 Perl_block_gimme(pTHX)
1295 const I32 cxix = dopoptosub(cxstack_ix);
1299 switch (cxstack[cxix].blk_gimme) {
1307 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1314 Perl_is_lvalue_sub(pTHX)
1317 const I32 cxix = dopoptosub(cxstack_ix);
1318 assert(cxix >= 0); /* We should only be called from inside subs */
1320 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1321 return CxLVAL(cxstack + cxix);
1327 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1332 PERL_ARGS_ASSERT_DOPOPTOSUB_AT;
1334 for (i = startingblock; i >= 0; i--) {
1335 register const PERL_CONTEXT * const cx = &cxstk[i];
1336 switch (CxTYPE(cx)) {
1342 DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1350 S_dopoptoeval(pTHX_ I32 startingblock)
1354 for (i = startingblock; i >= 0; i--) {
1355 register const PERL_CONTEXT *cx = &cxstack[i];
1356 switch (CxTYPE(cx)) {
1360 DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1368 S_dopoptoloop(pTHX_ I32 startingblock)
1372 for (i = startingblock; i >= 0; i--) {
1373 register const PERL_CONTEXT * const cx = &cxstack[i];
1374 switch (CxTYPE(cx)) {
1380 if (ckWARN(WARN_EXITING))
1381 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1382 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1383 if ((CxTYPE(cx)) == CXt_NULL)
1386 case CXt_LOOP_LAZYIV:
1387 case CXt_LOOP_LAZYSV:
1389 case CXt_LOOP_PLAIN:
1390 DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1398 S_dopoptogiven(pTHX_ I32 startingblock)
1402 for (i = startingblock; i >= 0; i--) {
1403 register const PERL_CONTEXT *cx = &cxstack[i];
1404 switch (CxTYPE(cx)) {
1408 DEBUG_l( Perl_deb(aTHX_ "(Found given #%ld)\n", (long)i));
1410 case CXt_LOOP_PLAIN:
1411 assert(!CxFOREACHDEF(cx));
1413 case CXt_LOOP_LAZYIV:
1414 case CXt_LOOP_LAZYSV:
1416 if (CxFOREACHDEF(cx)) {
1417 DEBUG_l( Perl_deb(aTHX_ "(Found foreach #%ld)\n", (long)i));
1426 S_dopoptowhen(pTHX_ I32 startingblock)
1430 for (i = startingblock; i >= 0; i--) {
1431 register const PERL_CONTEXT *cx = &cxstack[i];
1432 switch (CxTYPE(cx)) {
1436 DEBUG_l( Perl_deb(aTHX_ "(Found when #%ld)\n", (long)i));
1444 Perl_dounwind(pTHX_ I32 cxix)
1449 while (cxstack_ix > cxix) {
1451 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1452 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1453 (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1454 /* Note: we don't need to restore the base context info till the end. */
1455 switch (CxTYPE(cx)) {
1458 continue; /* not break */
1466 case CXt_LOOP_LAZYIV:
1467 case CXt_LOOP_LAZYSV:
1469 case CXt_LOOP_PLAIN:
1480 PERL_UNUSED_VAR(optype);
1484 Perl_qerror(pTHX_ SV *err)
1488 PERL_ARGS_ASSERT_QERROR;
1491 sv_catsv(ERRSV, err);
1493 sv_catsv(PL_errors, err);
1495 Perl_warn(aTHX_ "%"SVf, SVfARG(err));
1497 ++PL_parser->error_count;
1501 Perl_die_where(pTHX_ const char *message, STRLEN msglen)
1510 if (PL_in_eval & EVAL_KEEPERR) {
1511 static const char prefix[] = "\t(in cleanup) ";
1512 SV * const err = ERRSV;
1513 const char *e = NULL;
1515 sv_setpvn(err,"",0);
1516 else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1518 e = SvPV_const(err, len);
1520 if (*e != *message || strNE(e,message))
1524 SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1525 sv_catpvn(err, prefix, sizeof(prefix)-1);
1526 sv_catpvn(err, message, msglen);
1527 if (ckWARN(WARN_MISC)) {
1528 const STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1529 Perl_warner(aTHX_ packWARN(WARN_MISC), SvPVX_const(err)+start);
1534 sv_setpvn(ERRSV, message, msglen);
1538 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1539 && PL_curstackinfo->si_prev)
1547 register PERL_CONTEXT *cx;
1550 if (cxix < cxstack_ix)
1553 POPBLOCK(cx,PL_curpm);
1554 if (CxTYPE(cx) != CXt_EVAL) {
1556 message = SvPVx_const(ERRSV, msglen);
1557 PerlIO_write(Perl_error_log, (const char *)"panic: die ", 11);
1558 PerlIO_write(Perl_error_log, message, msglen);
1563 if (gimme == G_SCALAR)
1564 *++newsp = &PL_sv_undef;
1565 PL_stack_sp = newsp;
1569 /* LEAVE could clobber PL_curcop (see save_re_context())
1570 * XXX it might be better to find a way to avoid messing with
1571 * PL_curcop in save_re_context() instead, but this is a more
1572 * minimal fix --GSAR */
1573 PL_curcop = cx->blk_oldcop;
1575 if (optype == OP_REQUIRE) {
1576 const char* const msg = SvPVx_nolen_const(ERRSV);
1577 SV * const nsv = cx->blk_eval.old_namesv;
1578 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
1580 DIE(aTHX_ "%sCompilation failed in require",
1581 *msg ? msg : "Unknown error\n");
1583 assert(CxTYPE(cx) == CXt_EVAL);
1584 return cx->blk_eval.retop;
1588 message = SvPVx_const(ERRSV, msglen);
1590 write_to_stderr(message, msglen);
1598 dVAR; dSP; dPOPTOPssrl;
1599 if (SvTRUE(left) != SvTRUE(right))
1609 register I32 cxix = dopoptosub(cxstack_ix);
1610 register const PERL_CONTEXT *cx;
1611 register const PERL_CONTEXT *ccstack = cxstack;
1612 const PERL_SI *top_si = PL_curstackinfo;
1614 const char *stashname;
1621 /* we may be in a higher stacklevel, so dig down deeper */
1622 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1623 top_si = top_si->si_prev;
1624 ccstack = top_si->si_cxstack;
1625 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1628 if (GIMME != G_ARRAY) {
1634 /* caller() should not report the automatic calls to &DB::sub */
1635 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1636 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1640 cxix = dopoptosub_at(ccstack, cxix - 1);
1643 cx = &ccstack[cxix];
1644 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1645 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1646 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1647 field below is defined for any cx. */
1648 /* caller() should not report the automatic calls to &DB::sub */
1649 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1650 cx = &ccstack[dbcxix];
1653 stashname = CopSTASHPV(cx->blk_oldcop);
1654 if (GIMME != G_ARRAY) {
1657 PUSHs(&PL_sv_undef);
1660 sv_setpv(TARG, stashname);
1669 PUSHs(&PL_sv_undef);
1671 mPUSHs(newSVpv(stashname, 0));
1672 mPUSHs(newSVpv(OutCopFILE(cx->blk_oldcop), 0));
1673 mPUSHi((I32)CopLINE(cx->blk_oldcop));
1676 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1677 GV * const cvgv = CvGV(ccstack[cxix].blk_sub.cv);
1678 /* So is ccstack[dbcxix]. */
1680 SV * const sv = newSV(0);
1681 gv_efullname3(sv, cvgv, NULL);
1683 PUSHs(boolSV(CxHASARGS(cx)));
1686 PUSHs(newSVpvs_flags("(unknown)", SVs_TEMP));
1687 PUSHs(boolSV(CxHASARGS(cx)));
1691 PUSHs(newSVpvs_flags("(eval)", SVs_TEMP));
1694 gimme = (I32)cx->blk_gimme;
1695 if (gimme == G_VOID)
1696 PUSHs(&PL_sv_undef);
1698 PUSHs(boolSV((gimme & G_WANT) == G_ARRAY));
1699 if (CxTYPE(cx) == CXt_EVAL) {
1701 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
1702 PUSHs(cx->blk_eval.cur_text);
1706 else if (cx->blk_eval.old_namesv) {
1707 mPUSHs(newSVsv(cx->blk_eval.old_namesv));
1710 /* eval BLOCK (try blocks have old_namesv == 0) */
1712 PUSHs(&PL_sv_undef);
1713 PUSHs(&PL_sv_undef);
1717 PUSHs(&PL_sv_undef);
1718 PUSHs(&PL_sv_undef);
1720 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)
1721 && CopSTASH_eq(PL_curcop, PL_debstash))
1723 AV * const ary = cx->blk_sub.argarray;
1724 const int off = AvARRAY(ary) - AvALLOC(ary);
1727 GV* const tmpgv = gv_fetchpvs("DB::args", GV_ADD, SVt_PVAV);
1728 PL_dbargs = GvAV(gv_AVadd(tmpgv));
1730 AvREAL_off(PL_dbargs); /* XXX should be REIFY (see av.h) */
1733 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1734 av_extend(PL_dbargs, AvFILLp(ary) + off);
1735 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1736 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1738 /* XXX only hints propagated via op_private are currently
1739 * visible (others are not easily accessible, since they
1740 * use the global PL_hints) */
1741 mPUSHi(CopHINTS_get(cx->blk_oldcop));
1744 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
1746 if (old_warnings == pWARN_NONE ||
1747 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
1748 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1749 else if (old_warnings == pWARN_ALL ||
1750 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1751 /* Get the bit mask for $warnings::Bits{all}, because
1752 * it could have been extended by warnings::register */
1754 HV * const bits = get_hv("warnings::Bits", FALSE);
1755 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
1756 mask = newSVsv(*bits_all);
1759 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1763 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
1767 PUSHs(cx->blk_oldcop->cop_hints_hash ?
1768 sv_2mortal(newRV_noinc(
1769 (SV*)Perl_refcounted_he_chain_2hv(aTHX_
1770 cx->blk_oldcop->cop_hints_hash)))
1779 const char * const tmps = (MAXARG < 1) ? (const char *)"" : POPpconstx;
1780 sv_reset(tmps, CopSTASH(PL_curcop));
1785 /* like pp_nextstate, but used instead when the debugger is active */
1790 PL_curcop = (COP*)PL_op;
1791 TAINT_NOT; /* Each statement is presumed innocent */
1792 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1795 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1796 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1799 register PERL_CONTEXT *cx;
1800 const I32 gimme = G_ARRAY;
1802 GV * const gv = PL_DBgv;
1803 register CV * const cv = GvCV(gv);
1806 DIE(aTHX_ "No DB::DB routine defined");
1808 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1809 /* don't do recursive DB::DB call */
1824 (void)(*CvXSUB(cv))(aTHX_ cv);
1831 PUSHBLOCK(cx, CXt_SUB, SP);
1833 cx->blk_sub.retop = PL_op->op_next;
1836 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), 1);
1837 RETURNOP(CvSTART(cv));
1847 register PERL_CONTEXT *cx;
1848 const I32 gimme = GIMME_V;
1850 U8 cxtype = CXt_LOOP_FOR;
1858 if (PL_op->op_targ) {
1859 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
1860 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
1861 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
1862 SVs_PADSTALE, SVs_PADSTALE);
1864 SAVEPADSVANDMORTALIZE(PL_op->op_targ);
1865 #ifndef USE_ITHREADS
1866 svp = &PAD_SVl(PL_op->op_targ); /* "my" variable */
1872 GV * const gv = (GV*)POPs;
1873 svp = &GvSV(gv); /* symbol table variable */
1874 SAVEGENERICSV(*svp);
1877 iterdata = (PAD*)gv;
1881 if (PL_op->op_private & OPpITER_DEF)
1882 cxtype |= CXp_FOR_DEF;
1886 PUSHBLOCK(cx, cxtype, SP);
1888 PUSHLOOP_FOR(cx, iterdata, MARK, PL_op->op_targ);
1890 PUSHLOOP_FOR(cx, svp, MARK, 0);
1892 if (PL_op->op_flags & OPf_STACKED) {
1893 SV *maybe_ary = POPs;
1894 if (SvTYPE(maybe_ary) != SVt_PVAV) {
1896 SV * const right = maybe_ary;
1899 if (RANGE_IS_NUMERIC(sv,right)) {
1900 cx->cx_type &= ~CXTYPEMASK;
1901 cx->cx_type |= CXt_LOOP_LAZYIV;
1902 /* Make sure that no-one re-orders cop.h and breaks our
1904 assert(CxTYPE(cx) == CXt_LOOP_LAZYIV);
1905 #ifdef NV_PRESERVES_UV
1906 if ((SvOK(sv) && ((SvNV(sv) < (NV)IV_MIN) ||
1907 (SvNV(sv) > (NV)IV_MAX)))
1909 (SvOK(right) && ((SvNV(right) > (NV)IV_MAX) ||
1910 (SvNV(right) < (NV)IV_MIN))))
1912 if ((SvOK(sv) && ((SvNV(sv) <= (NV)IV_MIN)
1915 ((SvUV(sv) > (UV)IV_MAX) ||
1916 (SvNV(sv) > (NV)UV_MAX)))))
1918 (SvOK(right) && ((SvNV(right) <= (NV)IV_MIN)
1920 ((SvNV(right) > 0) &&
1921 ((SvUV(right) > (UV)IV_MAX) ||
1922 (SvNV(right) > (NV)UV_MAX))))))
1924 DIE(aTHX_ "Range iterator outside integer range");
1925 cx->blk_loop.state_u.lazyiv.cur = SvIV(sv);
1926 cx->blk_loop.state_u.lazyiv.end = SvIV(right);
1928 /* for correct -Dstv display */
1929 cx->blk_oldsp = sp - PL_stack_base;
1933 cx->cx_type &= ~CXTYPEMASK;
1934 cx->cx_type |= CXt_LOOP_LAZYSV;
1935 /* Make sure that no-one re-orders cop.h and breaks our
1937 assert(CxTYPE(cx) == CXt_LOOP_LAZYSV);
1938 cx->blk_loop.state_u.lazysv.cur = newSVsv(sv);
1939 cx->blk_loop.state_u.lazysv.end = right;
1940 SvREFCNT_inc(right);
1941 (void) SvPV_force_nolen(cx->blk_loop.state_u.lazysv.cur);
1942 /* This will do the upgrade to SVt_PV, and warn if the value
1943 is uninitialised. */
1944 (void) SvPV_nolen_const(right);
1945 /* Doing this avoids a check every time in pp_iter in pp_hot.c
1946 to replace !SvOK() with a pointer to "". */
1948 SvREFCNT_dec(right);
1949 cx->blk_loop.state_u.lazysv.end = &PL_sv_no;
1953 else /* SvTYPE(maybe_ary) == SVt_PVAV */ {
1954 cx->blk_loop.state_u.ary.ary = (AV*)maybe_ary;
1955 SvREFCNT_inc(maybe_ary);
1956 cx->blk_loop.state_u.ary.ix =
1957 (PL_op->op_private & OPpITER_REVERSED) ?
1958 AvFILL(cx->blk_loop.state_u.ary.ary) + 1 :
1962 else { /* iterating over items on the stack */
1963 cx->blk_loop.state_u.ary.ary = NULL; /* means to use the stack */
1964 if (PL_op->op_private & OPpITER_REVERSED) {
1965 cx->blk_loop.state_u.ary.ix = cx->blk_oldsp + 1;
1968 cx->blk_loop.state_u.ary.ix = MARK - PL_stack_base;
1978 register PERL_CONTEXT *cx;
1979 const I32 gimme = GIMME_V;
1985 PUSHBLOCK(cx, CXt_LOOP_PLAIN, SP);
1986 PUSHLOOP_PLAIN(cx, SP);
1994 register PERL_CONTEXT *cx;
2001 assert(CxTYPE_is_LOOP(cx));
2003 newsp = PL_stack_base + cx->blk_loop.resetsp;
2006 if (gimme == G_VOID)
2008 else if (gimme == G_SCALAR) {
2010 *++newsp = sv_mortalcopy(*SP);
2012 *++newsp = &PL_sv_undef;
2016 *++newsp = sv_mortalcopy(*++mark);
2017 TAINT_NOT; /* Each item is independent */
2023 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
2024 PL_curpm = newpm; /* ... and pop $1 et al */
2035 register PERL_CONTEXT *cx;
2036 bool popsub2 = FALSE;
2037 bool clear_errsv = FALSE;
2045 const I32 cxix = dopoptosub(cxstack_ix);
2048 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
2049 * sort block, which is a CXt_NULL
2052 PL_stack_base[1] = *PL_stack_sp;
2053 PL_stack_sp = PL_stack_base + 1;
2057 DIE(aTHX_ "Can't return outside a subroutine");
2059 if (cxix < cxstack_ix)
2062 if (CxMULTICALL(&cxstack[cxix])) {
2063 gimme = cxstack[cxix].blk_gimme;
2064 if (gimme == G_VOID)
2065 PL_stack_sp = PL_stack_base;
2066 else if (gimme == G_SCALAR) {
2067 PL_stack_base[1] = *PL_stack_sp;
2068 PL_stack_sp = PL_stack_base + 1;
2074 switch (CxTYPE(cx)) {
2077 retop = cx->blk_sub.retop;
2078 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
2081 if (!(PL_in_eval & EVAL_KEEPERR))
2084 retop = cx->blk_eval.retop;
2088 if (optype == OP_REQUIRE &&
2089 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
2091 /* Unassume the success we assumed earlier. */
2092 SV * const nsv = cx->blk_eval.old_namesv;
2093 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
2094 DIE(aTHX_ "%"SVf" did not return a true value", SVfARG(nsv));
2099 retop = cx->blk_sub.retop;
2102 DIE(aTHX_ "panic: return");
2106 if (gimme == G_SCALAR) {
2109 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2111 *++newsp = SvREFCNT_inc(*SP);
2116 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
2118 *++newsp = sv_mortalcopy(sv);
2123 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
2126 *++newsp = sv_mortalcopy(*SP);
2129 *++newsp = &PL_sv_undef;
2131 else if (gimme == G_ARRAY) {
2132 while (++MARK <= SP) {
2133 *++newsp = (popsub2 && SvTEMP(*MARK))
2134 ? *MARK : sv_mortalcopy(*MARK);
2135 TAINT_NOT; /* Each item is independent */
2138 PL_stack_sp = newsp;
2141 /* Stack values are safe: */
2144 POPSUB(cx,sv); /* release CV and @_ ... */
2148 PL_curpm = newpm; /* ... and pop $1 et al */
2161 register PERL_CONTEXT *cx;
2172 if (PL_op->op_flags & OPf_SPECIAL) {
2173 cxix = dopoptoloop(cxstack_ix);
2175 DIE(aTHX_ "Can't \"last\" outside a loop block");
2178 cxix = dopoptolabel(cPVOP->op_pv);
2180 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
2182 if (cxix < cxstack_ix)
2186 cxstack_ix++; /* temporarily protect top context */
2188 switch (CxTYPE(cx)) {
2189 case CXt_LOOP_LAZYIV:
2190 case CXt_LOOP_LAZYSV:
2192 case CXt_LOOP_PLAIN:
2194 newsp = PL_stack_base + cx->blk_loop.resetsp;
2195 nextop = cx->blk_loop.my_op->op_lastop->op_next;
2199 nextop = cx->blk_sub.retop;
2203 nextop = cx->blk_eval.retop;
2207 nextop = cx->blk_sub.retop;
2210 DIE(aTHX_ "panic: last");
2214 if (gimme == G_SCALAR) {
2216 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
2217 ? *SP : sv_mortalcopy(*SP);
2219 *++newsp = &PL_sv_undef;
2221 else if (gimme == G_ARRAY) {
2222 while (++MARK <= SP) {
2223 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
2224 ? *MARK : sv_mortalcopy(*MARK);
2225 TAINT_NOT; /* Each item is independent */
2233 /* Stack values are safe: */
2235 case CXt_LOOP_LAZYIV:
2236 case CXt_LOOP_PLAIN:
2237 case CXt_LOOP_LAZYSV:
2239 POPLOOP(cx); /* release loop vars ... */
2243 POPSUB(cx,sv); /* release CV and @_ ... */
2246 PL_curpm = newpm; /* ... and pop $1 et al */
2249 PERL_UNUSED_VAR(optype);
2250 PERL_UNUSED_VAR(gimme);
2258 register PERL_CONTEXT *cx;
2261 if (PL_op->op_flags & OPf_SPECIAL) {
2262 cxix = dopoptoloop(cxstack_ix);
2264 DIE(aTHX_ "Can't \"next\" outside a loop block");
2267 cxix = dopoptolabel(cPVOP->op_pv);
2269 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
2271 if (cxix < cxstack_ix)
2274 /* clear off anything above the scope we're re-entering, but
2275 * save the rest until after a possible continue block */
2276 inner = PL_scopestack_ix;
2278 if (PL_scopestack_ix < inner)
2279 leave_scope(PL_scopestack[PL_scopestack_ix]);
2280 PL_curcop = cx->blk_oldcop;
2281 return CX_LOOP_NEXTOP_GET(cx);
2288 register PERL_CONTEXT *cx;
2292 if (PL_op->op_flags & OPf_SPECIAL) {
2293 cxix = dopoptoloop(cxstack_ix);
2295 DIE(aTHX_ "Can't \"redo\" outside a loop block");
2298 cxix = dopoptolabel(cPVOP->op_pv);
2300 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
2302 if (cxix < cxstack_ix)
2305 redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
2306 if (redo_op->op_type == OP_ENTER) {
2307 /* pop one less context to avoid $x being freed in while (my $x..) */
2309 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2310 redo_op = redo_op->op_next;
2314 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2315 LEAVE_SCOPE(oldsave);
2317 PL_curcop = cx->blk_oldcop;
2322 S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
2326 static const char too_deep[] = "Target of goto is too deeply nested";
2328 PERL_ARGS_ASSERT_DOFINDLABEL;
2331 Perl_croak(aTHX_ too_deep);
2332 if (o->op_type == OP_LEAVE ||
2333 o->op_type == OP_SCOPE ||
2334 o->op_type == OP_LEAVELOOP ||
2335 o->op_type == OP_LEAVESUB ||
2336 o->op_type == OP_LEAVETRY)
2338 *ops++ = cUNOPo->op_first;
2340 Perl_croak(aTHX_ too_deep);
2343 if (o->op_flags & OPf_KIDS) {
2345 /* First try all the kids at this level, since that's likeliest. */
2346 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2347 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2348 CopLABEL(kCOP) && strEQ(CopLABEL(kCOP), label))
2351 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2352 if (kid == PL_lastgotoprobe)
2354 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2357 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2358 ops[-1]->op_type == OP_DBSTATE)
2363 if ((o = dofindlabel(kid, label, ops, oplimit)))
2376 register PERL_CONTEXT *cx;
2377 #define GOTO_DEPTH 64
2378 OP *enterops[GOTO_DEPTH];
2379 const char *label = NULL;
2380 const bool do_dump = (PL_op->op_type == OP_DUMP);
2381 static const char must_have_label[] = "goto must have label";
2383 if (PL_op->op_flags & OPf_STACKED) {
2384 SV * const sv = POPs;
2386 /* This egregious kludge implements goto &subroutine */
2387 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2389 register PERL_CONTEXT *cx;
2390 CV* cv = (CV*)SvRV(sv);
2397 if (!CvROOT(cv) && !CvXSUB(cv)) {
2398 const GV * const gv = CvGV(cv);
2402 /* autoloaded stub? */
2403 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2405 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
2406 GvNAMELEN(gv), FALSE);
2407 if (autogv && (cv = GvCV(autogv)))
2409 tmpstr = sv_newmortal();
2410 gv_efullname3(tmpstr, gv, NULL);
2411 DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr));
2413 DIE(aTHX_ "Goto undefined subroutine");
2416 /* First do some returnish stuff. */
2417 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
2419 cxix = dopoptosub(cxstack_ix);
2421 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2422 if (cxix < cxstack_ix)
2426 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2427 if (CxTYPE(cx) == CXt_EVAL) {
2429 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2431 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2433 else if (CxMULTICALL(cx))
2434 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
2435 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
2436 /* put @_ back onto stack */
2437 AV* av = cx->blk_sub.argarray;
2439 items = AvFILLp(av) + 1;
2440 EXTEND(SP, items+1); /* @_ could have been extended. */
2441 Copy(AvARRAY(av), SP + 1, items, SV*);
2442 SvREFCNT_dec(GvAV(PL_defgv));
2443 GvAV(PL_defgv) = cx->blk_sub.savearray;
2445 /* abandon @_ if it got reified */
2450 av_extend(av, items-1);
2452 PAD_SVl(0) = (SV*)(cx->blk_sub.argarray = av);
2455 else if (CvISXSUB(cv)) { /* put GvAV(defgv) back onto stack */
2456 AV* const av = GvAV(PL_defgv);
2457 items = AvFILLp(av) + 1;
2458 EXTEND(SP, items+1); /* @_ could have been extended. */
2459 Copy(AvARRAY(av), SP + 1, items, SV*);
2463 if (CxTYPE(cx) == CXt_SUB &&
2464 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2465 SvREFCNT_dec(cx->blk_sub.cv);
2466 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2467 LEAVE_SCOPE(oldsave);
2469 /* Now do some callish stuff. */
2471 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2473 OP* const retop = cx->blk_sub.retop;
2478 for (index=0; index<items; index++)
2479 sv_2mortal(SP[-index]);
2482 /* XS subs don't have a CxSUB, so pop it */
2483 POPBLOCK(cx, PL_curpm);
2484 /* Push a mark for the start of arglist */
2487 (void)(*CvXSUB(cv))(aTHX_ cv);
2492 AV* const padlist = CvPADLIST(cv);
2493 if (CxTYPE(cx) == CXt_EVAL) {
2494 PL_in_eval = CxOLD_IN_EVAL(cx);
2495 PL_eval_root = cx->blk_eval.old_eval_root;
2496 cx->cx_type = CXt_SUB;
2498 cx->blk_sub.cv = cv;
2499 cx->blk_sub.olddepth = CvDEPTH(cv);
2502 if (CvDEPTH(cv) < 2)
2503 SvREFCNT_inc_simple_void_NN(cv);
2505 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION))
2506 sub_crush_depth(cv);
2507 pad_push(padlist, CvDEPTH(cv));
2510 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2513 AV* const av = (AV*)PAD_SVl(0);
2515 cx->blk_sub.savearray = GvAV(PL_defgv);
2516 GvAV(PL_defgv) = (AV*)SvREFCNT_inc_simple(av);
2517 CX_CURPAD_SAVE(cx->blk_sub);
2518 cx->blk_sub.argarray = av;
2520 if (items >= AvMAX(av) + 1) {
2521 SV **ary = AvALLOC(av);
2522 if (AvARRAY(av) != ary) {
2523 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2526 if (items >= AvMAX(av) + 1) {
2527 AvMAX(av) = items - 1;
2528 Renew(ary,items+1,SV*);
2534 Copy(mark,AvARRAY(av),items,SV*);
2535 AvFILLp(av) = items - 1;
2536 assert(!AvREAL(av));
2538 /* transfer 'ownership' of refcnts to new @_ */
2548 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2549 Perl_get_db_sub(aTHX_ NULL, cv);
2551 CV * const gotocv = get_cv("DB::goto", FALSE);
2553 PUSHMARK( PL_stack_sp );
2554 call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2559 RETURNOP(CvSTART(cv));
2563 label = SvPV_nolen_const(sv);
2564 if (!(do_dump || *label))
2565 DIE(aTHX_ must_have_label);
2568 else if (PL_op->op_flags & OPf_SPECIAL) {
2570 DIE(aTHX_ must_have_label);
2573 label = cPVOP->op_pv;
2575 if (label && *label) {
2576 OP *gotoprobe = NULL;
2577 bool leaving_eval = FALSE;
2578 bool in_block = FALSE;
2579 PERL_CONTEXT *last_eval_cx = NULL;
2583 PL_lastgotoprobe = NULL;
2585 for (ix = cxstack_ix; ix >= 0; ix--) {
2587 switch (CxTYPE(cx)) {
2589 leaving_eval = TRUE;
2590 if (!CxTRYBLOCK(cx)) {
2591 gotoprobe = (last_eval_cx ?
2592 last_eval_cx->blk_eval.old_eval_root :
2597 /* else fall through */
2598 case CXt_LOOP_LAZYIV:
2599 case CXt_LOOP_LAZYSV:
2601 case CXt_LOOP_PLAIN:
2602 gotoprobe = cx->blk_oldcop->op_sibling;
2608 gotoprobe = cx->blk_oldcop->op_sibling;
2611 gotoprobe = PL_main_root;
2614 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
2615 gotoprobe = CvROOT(cx->blk_sub.cv);
2621 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2624 DIE(aTHX_ "panic: goto");
2625 gotoprobe = PL_main_root;
2629 retop = dofindlabel(gotoprobe, label,
2630 enterops, enterops + GOTO_DEPTH);
2634 PL_lastgotoprobe = gotoprobe;
2637 DIE(aTHX_ "Can't find label %s", label);
2639 /* if we're leaving an eval, check before we pop any frames
2640 that we're not going to punt, otherwise the error
2643 if (leaving_eval && *enterops && enterops[1]) {
2645 for (i = 1; enterops[i]; i++)
2646 if (enterops[i]->op_type == OP_ENTERITER)
2647 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2650 /* pop unwanted frames */
2652 if (ix < cxstack_ix) {
2659 oldsave = PL_scopestack[PL_scopestack_ix];
2660 LEAVE_SCOPE(oldsave);
2663 /* push wanted frames */
2665 if (*enterops && enterops[1]) {
2666 OP * const oldop = PL_op;
2667 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
2668 for (; enterops[ix]; ix++) {
2669 PL_op = enterops[ix];
2670 /* Eventually we may want to stack the needed arguments
2671 * for each op. For now, we punt on the hard ones. */
2672 if (PL_op->op_type == OP_ENTERITER)
2673 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2674 CALL_FPTR(PL_op->op_ppaddr)(aTHX);
2682 if (!retop) retop = PL_main_start;
2684 PL_restartop = retop;
2685 PL_do_undump = TRUE;
2689 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2690 PL_do_undump = FALSE;
2707 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
2709 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
2712 PL_exit_flags |= PERL_EXIT_EXPECTED;
2714 /* KLUDGE: disable exit 0 in BEGIN blocks when we're just compiling */
2715 if (anum || !(PL_minus_c && PL_madskills))
2720 PUSHs(&PL_sv_undef);
2727 S_save_lines(pTHX_ AV *array, SV *sv)
2729 const char *s = SvPVX_const(sv);
2730 const char * const send = SvPVX_const(sv) + SvCUR(sv);
2733 PERL_ARGS_ASSERT_SAVE_LINES;
2735 while (s && s < send) {
2737 SV * const tmpstr = newSV_type(SVt_PVMG);
2739 t = strchr(s, '\n');
2745 sv_setpvn(tmpstr, s, t - s);
2746 av_store(array, line++, tmpstr);
2752 S_docatch(pTHX_ OP *o)
2756 OP * const oldop = PL_op;
2760 assert(CATCH_GET == TRUE);
2767 assert(cxstack_ix >= 0);
2768 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2769 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
2774 /* die caught by an inner eval - continue inner loop */
2776 /* NB XXX we rely on the old popped CxEVAL still being at the top
2777 * of the stack; the way die_where() currently works, this
2778 * assumption is valid. In theory The cur_top_env value should be
2779 * returned in another global, the way retop (aka PL_restartop)
2781 assert(CxTYPE(&cxstack[cxstack_ix+1]) == CXt_EVAL);
2784 && cxstack[cxstack_ix+1].blk_eval.cur_top_env == PL_top_env)
2786 PL_op = PL_restartop;
2803 Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
2804 /* sv Text to convert to OP tree. */
2805 /* startop op_free() this to undo. */
2806 /* code Short string id of the caller. */
2808 /* FIXME - how much of this code is common with pp_entereval? */
2809 dVAR; dSP; /* Make POPBLOCK work. */
2815 char tbuf[TYPE_DIGITS(long) + 12 + 10];
2816 char *tmpbuf = tbuf;
2819 CV* runcv = NULL; /* initialise to avoid compiler warnings */
2822 PERL_ARGS_ASSERT_SV_COMPILE_2OP;
2825 lex_start(sv, NULL, FALSE);
2827 /* switch to eval mode */
2829 if (IN_PERL_COMPILETIME) {
2830 SAVECOPSTASH_FREE(&PL_compiling);
2831 CopSTASH_set(&PL_compiling, PL_curstash);
2833 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
2834 SV * const sv = sv_newmortal();
2835 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
2836 code, (unsigned long)++PL_evalseq,
2837 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
2842 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(%.10s_eval %lu)", code,
2843 (unsigned long)++PL_evalseq);
2844 SAVECOPFILE_FREE(&PL_compiling);
2845 CopFILE_set(&PL_compiling, tmpbuf+2);
2846 SAVECOPLINE(&PL_compiling);
2847 CopLINE_set(&PL_compiling, 1);
2848 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2849 deleting the eval's FILEGV from the stash before gv_check() runs
2850 (i.e. before run-time proper). To work around the coredump that
2851 ensues, we always turn GvMULTI_on for any globals that were
2852 introduced within evals. See force_ident(). GSAR 96-10-12 */
2853 safestr = savepvn(tmpbuf, len);
2854 SAVEDELETE(PL_defstash, safestr, len);
2856 #ifdef OP_IN_REGISTER
2862 /* we get here either during compilation, or via pp_regcomp at runtime */
2863 runtime = IN_PERL_RUNTIME;
2865 runcv = find_runcv(NULL);
2868 PL_op->op_type = OP_ENTEREVAL;
2869 PL_op->op_flags = 0; /* Avoid uninit warning. */
2870 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
2874 (void) doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq);
2876 (void) doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax);
2877 POPBLOCK(cx,PL_curpm);
2880 (*startop)->op_type = OP_NULL;
2881 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
2883 /* XXX DAPM do this properly one year */
2884 *padp = (AV*)SvREFCNT_inc_simple(PL_comppad);
2886 if (IN_PERL_COMPILETIME)
2887 CopHINTS_set(&PL_compiling, PL_hints);
2888 #ifdef OP_IN_REGISTER
2891 PERL_UNUSED_VAR(newsp);
2892 PERL_UNUSED_VAR(optype);
2894 return PL_eval_start;
2899 =for apidoc find_runcv
2901 Locate the CV corresponding to the currently executing sub or eval.
2902 If db_seqp is non_null, skip CVs that are in the DB package and populate
2903 *db_seqp with the cop sequence number at the point that the DB:: code was
2904 entered. (allows debuggers to eval in the scope of the breakpoint rather
2905 than in the scope of the debugger itself).
2911 Perl_find_runcv(pTHX_ U32 *db_seqp)
2917 *db_seqp = PL_curcop->cop_seq;
2918 for (si = PL_curstackinfo; si; si = si->si_prev) {
2920 for (ix = si->si_cxix; ix >= 0; ix--) {
2921 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
2922 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
2923 CV * const cv = cx->blk_sub.cv;
2924 /* skip DB:: code */
2925 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
2926 *db_seqp = cx->blk_oldcop->cop_seq;
2931 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
2939 /* Compile a require/do, an eval '', or a /(?{...})/.
2940 * In the last case, startop is non-null, and contains the address of
2941 * a pointer that should be set to the just-compiled code.
2942 * outside is the lexically enclosing CV (if any) that invoked us.
2943 * Returns a bool indicating whether the compile was successful; if so,
2944 * PL_eval_start contains the first op of the compiled ocde; otherwise,
2945 * pushes undef (also croaks if startop != NULL).
2949 S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq)
2952 OP * const saveop = PL_op;
2954 PL_in_eval = ((saveop && saveop->op_type == OP_REQUIRE)
2955 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
2960 SAVESPTR(PL_compcv);
2961 PL_compcv = (CV*)newSV_type(SVt_PVCV);
2962 CvEVAL_on(PL_compcv);
2963 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2964 cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
2966 CvOUTSIDE_SEQ(PL_compcv) = seq;
2967 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc_simple(outside);
2969 /* set up a scratch pad */
2971 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE);
2972 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
2976 SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
2978 /* make sure we compile in the right package */
2980 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
2981 SAVESPTR(PL_curstash);
2982 PL_curstash = CopSTASH(PL_curcop);
2984 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
2985 SAVESPTR(PL_beginav);
2986 PL_beginav = newAV();
2987 SAVEFREESV(PL_beginav);
2988 SAVESPTR(PL_unitcheckav);
2989 PL_unitcheckav = newAV();
2990 SAVEFREESV(PL_unitcheckav);
2993 SAVEBOOL(PL_madskills);
2997 /* try to compile it */
2999 PL_eval_root = NULL;
3000 PL_curcop = &PL_compiling;
3001 CopARYBASE_set(PL_curcop, 0);
3002 if (saveop && (saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
3003 PL_in_eval |= EVAL_KEEPERR;
3007 if (yyparse() || PL_parser->error_count || !PL_eval_root) {
3008 SV **newsp; /* Used by POPBLOCK. */
3009 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
3010 I32 optype = 0; /* Might be reset by POPEVAL. */
3015 op_free(PL_eval_root);
3016 PL_eval_root = NULL;
3018 SP = PL_stack_base + POPMARK; /* pop original mark */
3020 POPBLOCK(cx,PL_curpm);
3026 msg = SvPVx_nolen_const(ERRSV);
3027 if (optype == OP_REQUIRE) {
3028 const SV * const nsv = cx->blk_eval.old_namesv;
3029 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
3031 Perl_croak(aTHX_ "%sCompilation failed in require",
3032 *msg ? msg : "Unknown error\n");
3035 POPBLOCK(cx,PL_curpm);
3037 Perl_croak(aTHX_ "%sCompilation failed in regexp",
3038 (*msg ? msg : "Unknown error\n"));
3042 sv_setpvs(ERRSV, "Compilation error");
3045 PERL_UNUSED_VAR(newsp);
3046 PUSHs(&PL_sv_undef);
3050 CopLINE_set(&PL_compiling, 0);
3052 *startop = PL_eval_root;
3054 SAVEFREEOP(PL_eval_root);
3056 /* Set the context for this new optree.
3057 * If the last op is an OP_REQUIRE, force scalar context.
3058 * Otherwise, propagate the context from the eval(). */
3059 if (PL_eval_root->op_type == OP_LEAVEEVAL
3060 && cUNOPx(PL_eval_root)->op_first->op_type == OP_LINESEQ
3061 && cLISTOPx(cUNOPx(PL_eval_root)->op_first)->op_last->op_type
3063 scalar(PL_eval_root);
3064 else if ((gimme & G_WANT) == G_VOID)
3065 scalarvoid(PL_eval_root);
3066 else if ((gimme & G_WANT) == G_ARRAY)
3069 scalar(PL_eval_root);
3071 DEBUG_x(dump_eval());
3073 /* Register with debugger: */
3074 if (PERLDB_INTER && saveop && saveop->op_type == OP_REQUIRE) {
3075 CV * const cv = get_cv("DB::postponed", FALSE);
3079 XPUSHs((SV*)CopFILEGV(&PL_compiling));
3081 call_sv((SV*)cv, G_DISCARD);
3086 call_list(PL_scopestack_ix, PL_unitcheckav);
3088 /* compiled okay, so do it */
3090 CvDEPTH(PL_compcv) = 1;
3091 SP = PL_stack_base + POPMARK; /* pop original mark */
3092 PL_op = saveop; /* The caller may need it. */
3093 PL_parser->lex_state = LEX_NOTPARSING; /* $^S needs this. */
3100 S_check_type_and_open(pTHX_ const char *name)
3103 const int st_rc = PerlLIO_stat(name, &st);
3105 PERL_ARGS_ASSERT_CHECK_TYPE_AND_OPEN;
3107 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
3111 return PerlIO_open(name, PERL_SCRIPT_MODE);
3114 #ifndef PERL_DISABLE_PMC
3116 S_doopen_pm(pTHX_ const char *name, const STRLEN namelen)
3120 PERL_ARGS_ASSERT_DOOPEN_PM;
3122 if (namelen > 3 && memEQs(name + namelen - 3, 3, ".pm")) {
3123 SV *const pmcsv = newSV(namelen + 2);
3124 char *const pmc = SvPVX(pmcsv);
3127 memcpy(pmc, name, namelen);
3129 pmc[namelen + 1] = '\0';
3131 if (PerlLIO_stat(pmc, &pmcstat) < 0) {
3132 fp = check_type_and_open(name);
3135 fp = check_type_and_open(pmc);
3137 SvREFCNT_dec(pmcsv);
3140 fp = check_type_and_open(name);
3145 # define doopen_pm(name, namelen) check_type_and_open(name)
3146 #endif /* !PERL_DISABLE_PMC */
3151 register PERL_CONTEXT *cx;
3158 int vms_unixname = 0;
3160 const char *tryname = NULL;
3162 const I32 gimme = GIMME_V;
3163 int filter_has_file = 0;
3164 PerlIO *tryrsfp = NULL;
3165 SV *filter_cache = NULL;
3166 SV *filter_state = NULL;
3167 SV *filter_sub = NULL;
3173 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3174 sv = new_version(sv);
3175 if (!sv_derived_from(PL_patchlevel, "version"))
3176 upg_version(PL_patchlevel, TRUE);
3177 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3178 if ( vcmp(sv,PL_patchlevel) <= 0 )
3179 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
3180 SVfARG(vnormal(sv)), SVfARG(vnormal(PL_patchlevel)));
3183 if ( vcmp(sv,PL_patchlevel) > 0 ) {
3186 SV * const req = SvRV(sv);
3187 SV * const pv = *hv_fetchs((HV*)req, "original", FALSE);
3189 /* get the left hand term */
3190 lav = (AV *)SvRV(*hv_fetchs((HV*)req, "version", FALSE));
3192 first = SvIV(*av_fetch(lav,0,0));
3193 if ( first > (int)PERL_REVISION /* probably 'use 6.0' */
3194 || hv_exists((HV*)req, "qv", 2 ) /* qv style */
3195 || av_len(lav) > 1 /* FP with > 3 digits */
3196 || strstr(SvPVX(pv),".0") /* FP with leading 0 */
3198 DIE(aTHX_ "Perl %"SVf" required--this is only "
3199 "%"SVf", stopped", SVfARG(vnormal(req)),
3200 SVfARG(vnormal(PL_patchlevel)));
3202 else { /* probably 'use 5.10' or 'use 5.8' */
3203 SV * hintsv = newSV(0);
3207 second = SvIV(*av_fetch(lav,1,0));
3209 second /= second >= 600 ? 100 : 10;
3210 hintsv = Perl_newSVpvf(aTHX_ "v%d.%d.%d",
3211 (int)first, (int)second,0);
3212 upg_version(hintsv, TRUE);
3214 DIE(aTHX_ "Perl %"SVf" required (did you mean %"SVf"?)"
3215 "--this is only %"SVf", stopped",
3216 SVfARG(vnormal(req)),
3217 SVfARG(vnormal(hintsv)),
3218 SVfARG(vnormal(PL_patchlevel)));
3223 /* We do this only with use, not require. */
3225 /* If we request a version >= 5.9.5, load feature.pm with the
3226 * feature bundle that corresponds to the required version. */
3227 vcmp(sv, sv_2mortal(upg_version(newSVnv(5.009005), FALSE))) >= 0) {
3228 SV *const importsv = vnormal(sv);
3229 *SvPVX_mutable(importsv) = ':';
3231 Perl_load_module(aTHX_ 0, newSVpvs("feature"), NULL, importsv, NULL);
3237 name = SvPV_const(sv, len);
3238 if (!(name && len > 0 && *name))
3239 DIE(aTHX_ "Null filename used");
3240 TAINT_PROPER("require");
3244 /* The key in the %ENV hash is in the syntax of file passed as the argument
3245 * usually this is in UNIX format, but sometimes in VMS format, which
3246 * can result in a module being pulled in more than once.
3247 * To prevent this, the key must be stored in UNIX format if the VMS
3248 * name can be translated to UNIX.
3250 if ((unixname = tounixspec(name, NULL)) != NULL) {
3251 unixlen = strlen(unixname);
3257 /* if not VMS or VMS name can not be translated to UNIX, pass it
3260 unixname = (char *) name;
3263 if (PL_op->op_type == OP_REQUIRE) {
3264 SV * const * const svp = hv_fetch(GvHVn(PL_incgv),
3265 unixname, unixlen, 0);
3267 if (*svp != &PL_sv_undef)
3270 DIE(aTHX_ "Attempt to reload %s aborted.\n"
3271 "Compilation failed in require", unixname);
3275 /* prepare to compile file */
3277 if (path_is_absolute(name)) {
3279 tryrsfp = doopen_pm(name, len);
3281 #ifdef MACOS_TRADITIONAL
3285 MacPerl_CanonDir(name, newname, 1);
3286 if (path_is_absolute(newname)) {
3288 tryrsfp = doopen_pm(newname, strlen(newname));
3293 AV * const ar = GvAVn(PL_incgv);
3299 namesv = newSV_type(SVt_PV);
3300 for (i = 0; i <= AvFILL(ar); i++) {
3301 SV * const dirsv = *av_fetch(ar, i, TRUE);
3303 if (SvTIED_mg((SV*)ar, PERL_MAGIC_tied))
3310 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3311 && !sv_isobject(loader))
3313 loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
3316 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3317 PTR2UV(SvRV(dirsv)), name);
3318 tryname = SvPVX_const(namesv);
3329 if (sv_isobject(loader))
3330 count = call_method("INC", G_ARRAY);
3332 count = call_sv(loader, G_ARRAY);
3335 /* Adjust file name if the hook has set an %INC entry */
3336 svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3338 tryname = SvPVX_const(*svp);
3347 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3348 && !isGV_with_GP(SvRV(arg))) {
3349 filter_cache = SvRV(arg);
3350 SvREFCNT_inc_simple_void_NN(filter_cache);
3357 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
3361 if (SvTYPE(arg) == SVt_PVGV) {
3362 IO * const io = GvIO((GV *)arg);
3367 tryrsfp = IoIFP(io);
3368 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3369 PerlIO_close(IoOFP(io));
3380 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3382 SvREFCNT_inc_simple_void_NN(filter_sub);
3385 filter_state = SP[i];
3386 SvREFCNT_inc_simple_void(filter_state);
3390 if (!tryrsfp && (filter_cache || filter_sub)) {
3391 tryrsfp = PerlIO_open(BIT_BUCKET,
3406 filter_has_file = 0;
3408 SvREFCNT_dec(filter_cache);
3409 filter_cache = NULL;
3412 SvREFCNT_dec(filter_state);
3413 filter_state = NULL;
3416 SvREFCNT_dec(filter_sub);
3421 if (!path_is_absolute(name)
3422 #ifdef MACOS_TRADITIONAL
3423 /* We consider paths of the form :a:b ambiguous and interpret them first
3424 as global then as local
3426 || (*name == ':' && name[1] != ':' && strchr(name+2, ':'))
3433 dir = SvPV_const(dirsv, dirlen);
3439 #ifdef MACOS_TRADITIONAL
3443 MacPerl_CanonDir(name, buf2, 1);
3444 Perl_sv_setpvf(aTHX_ namesv, "%s%s", MacPerl_CanonDir(dir, buf1, 0), buf2+(buf2[0] == ':'));
3448 if ((unixdir = tounixpath(dir, NULL)) == NULL)
3450 sv_setpv(namesv, unixdir);
3451 sv_catpv(namesv, unixname);
3453 # ifdef __SYMBIAN32__
3454 if (PL_origfilename[0] &&
3455 PL_origfilename[1] == ':' &&
3456 !(dir[0] && dir[1] == ':'))
3457 Perl_sv_setpvf(aTHX_ namesv,
3462 Perl_sv_setpvf(aTHX_ namesv,
3466 /* The equivalent of
3467 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3468 but without the need to parse the format string, or
3469 call strlen on either pointer, and with the correct
3470 allocation up front. */
3472 char *tmp = SvGROW(namesv, dirlen + len + 2);
3474 memcpy(tmp, dir, dirlen);
3477 /* name came from an SV, so it will have a '\0' at the
3478 end that we can copy as part of this memcpy(). */
3479 memcpy(tmp, name, len + 1);
3481 SvCUR_set(namesv, dirlen + len + 1);
3483 /* Don't even actually have to turn SvPOK_on() as we
3484 access it directly with SvPVX() below. */
3489 TAINT_PROPER("require");
3490 tryname = SvPVX_const(namesv);
3491 tryrsfp = doopen_pm(tryname, SvCUR(namesv));
3493 if (tryname[0] == '.' && tryname[1] == '/')
3497 else if (errno == EMFILE)
3498 /* no point in trying other paths if out of handles */
3505 SAVECOPFILE_FREE(&PL_compiling);
3506 CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
3507 SvREFCNT_dec(namesv);
3509 if (PL_op->op_type == OP_REQUIRE) {
3510 const char *msgstr = name;
3511 if(errno == EMFILE) {
3513 = sv_2mortal(Perl_newSVpvf(aTHX_ "%s: %s", msgstr,
3515 msgstr = SvPV_nolen_const(msg);
3517 if (namesv) { /* did we lookup @INC? */
3518 AV * const ar = GvAVn(PL_incgv);
3520 SV * const msg = sv_2mortal(Perl_newSVpvf(aTHX_
3521 "%s in @INC%s%s (@INC contains:",
3523 (instr(msgstr, ".h ")
3524 ? " (change .h to .ph maybe?)" : ""),
3525 (instr(msgstr, ".ph ")
3526 ? " (did you run h2ph?)" : "")
3529 for (i = 0; i <= AvFILL(ar); i++) {
3530 sv_catpvs(msg, " ");
3531 sv_catsv(msg, *av_fetch(ar, i, TRUE));
3533 sv_catpvs(msg, ")");
3534 msgstr = SvPV_nolen_const(msg);
3537 DIE(aTHX_ "Can't locate %s", msgstr);
3543 SETERRNO(0, SS_NORMAL);
3545 /* Assume success here to prevent recursive requirement. */
3546 /* name is never assigned to again, so len is still strlen(name) */
3547 /* Check whether a hook in @INC has already filled %INC */
3549 (void)hv_store(GvHVn(PL_incgv),
3550 unixname, unixlen, newSVpv(CopFILE(&PL_compiling),0),0);
3552 SV** const svp = hv_fetch(GvHVn(PL_incgv), unixname, unixlen, 0);
3554 (void)hv_store(GvHVn(PL_incgv),
3555 unixname, unixlen, SvREFCNT_inc_simple(hook_sv), 0 );
3560 lex_start(NULL, tryrsfp, TRUE);
3564 if (PL_compiling.cop_hints_hash) {
3565 Perl_refcounted_he_free(aTHX_ PL_compiling.cop_hints_hash);
3566 PL_compiling.cop_hints_hash = NULL;
3569 SAVECOMPILEWARNINGS();
3570 if (PL_dowarn & G_WARN_ALL_ON)
3571 PL_compiling.cop_warnings = pWARN_ALL ;
3572 else if (PL_dowarn & G_WARN_ALL_OFF)
3573 PL_compiling.cop_warnings = pWARN_NONE ;
3575 PL_compiling.cop_warnings = pWARN_STD ;
3577 if (filter_sub || filter_cache) {
3578 SV * const datasv = filter_add(S_run_user_filter, NULL);
3579 IoLINES(datasv) = filter_has_file;
3580 IoTOP_GV(datasv) = (GV *)filter_state;
3581 IoBOTTOM_GV(datasv) = (GV *)filter_sub;
3582 IoFMT_GV(datasv) = (GV *)filter_cache;
3585 /* switch to eval mode */
3586 PUSHBLOCK(cx, CXt_EVAL, SP);
3588 cx->blk_eval.retop = PL_op->op_next;
3590 SAVECOPLINE(&PL_compiling);
3591 CopLINE_set(&PL_compiling, 0);
3595 /* Store and reset encoding. */
3596 encoding = PL_encoding;
3599 if (doeval(gimme, NULL, NULL, PL_curcop->cop_seq))
3600 op = DOCATCH(PL_eval_start);
3602 op = PL_op->op_next;
3604 /* Restore encoding. */
3605 PL_encoding = encoding;
3610 /* This is a op added to hold the hints hash for
3611 pp_entereval. The hash can be modified by the code
3612 being eval'ed, so we return a copy instead. */
3618 mXPUSHs((SV*)Perl_hv_copy_hints_hv(aTHX_ (HV*)cSVOP_sv));
3626 register PERL_CONTEXT *cx;
3628 const I32 gimme = GIMME_V;
3629 const I32 was = PL_sub_generation;
3630 char tbuf[TYPE_DIGITS(long) + 12];
3631 char *tmpbuf = tbuf;
3637 HV *saved_hh = NULL;
3638 const char * const fakestr = "_<(eval )";
3639 const int fakelen = 9 + 1;
3641 if (PL_op->op_private & OPpEVAL_HAS_HH) {
3642 saved_hh = (HV*) SvREFCNT_inc(POPs);
3646 TAINT_IF(SvTAINTED(sv));
3647 TAINT_PROPER("eval");
3650 lex_start(sv, NULL, FALSE);
3653 /* switch to eval mode */
3655 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
3656 SV * const temp_sv = sv_newmortal();
3657 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
3658 (unsigned long)++PL_evalseq,
3659 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3660 tmpbuf = SvPVX(temp_sv);
3661 len = SvCUR(temp_sv);
3664 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
3665 SAVECOPFILE_FREE(&PL_compiling);
3666 CopFILE_set(&PL_compiling, tmpbuf+2);
3667 SAVECOPLINE(&PL_compiling);
3668 CopLINE_set(&PL_compiling, 1);
3669 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3670 deleting the eval's FILEGV from the stash before gv_check() runs
3671 (i.e. before run-time proper). To work around the coredump that
3672 ensues, we always turn GvMULTI_on for any globals that were
3673 introduced within evals. See force_ident(). GSAR 96-10-12 */
3674 safestr = savepvn(tmpbuf, len);
3675 SAVEDELETE(PL_defstash, safestr, len);
3677 PL_hints = PL_op->op_targ;
3679 GvHV(PL_hintgv) = saved_hh;
3680 SAVECOMPILEWARNINGS();
3681 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
3682 if (PL_compiling.cop_hints_hash) {
3683 Perl_refcounted_he_free(aTHX_ PL_compiling.cop_hints_hash);
3685 PL_compiling.cop_hints_hash = PL_curcop->cop_hints_hash;
3686 if (PL_compiling.cop_hints_hash) {
3688 PL_compiling.cop_hints_hash->refcounted_he_refcnt++;
3689 HINTS_REFCNT_UNLOCK;
3691 /* special case: an eval '' executed within the DB package gets lexically
3692 * placed in the first non-DB CV rather than the current CV - this
3693 * allows the debugger to execute code, find lexicals etc, in the
3694 * scope of the code being debugged. Passing &seq gets find_runcv
3695 * to do the dirty work for us */
3696 runcv = find_runcv(&seq);
3698 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
3700 cx->blk_eval.retop = PL_op->op_next;
3702 /* prepare to compile string */
3704 if (PERLDB_LINE && PL_curstash != PL_debstash)
3705 save_lines(CopFILEAV(&PL_compiling), PL_parser->linestr);
3707 ok = doeval(gimme, NULL, runcv, seq);
3708 if (PERLDB_INTER && was != (I32)PL_sub_generation /* Some subs defined here. */
3710 /* Copy in anything fake and short. */
3711 my_strlcpy(safestr, fakestr, fakelen);
3713 return ok ? DOCATCH(PL_eval_start) : PL_op->op_next;
3723 register PERL_CONTEXT *cx;
3725 const U8 save_flags = PL_op -> op_flags;
3730 retop = cx->blk_eval.retop;
3733 if (gimme == G_VOID)
3735 else if (gimme == G_SCALAR) {
3738 if (SvFLAGS(TOPs) & SVs_TEMP)
3741 *MARK = sv_mortalcopy(TOPs);
3745 *MARK = &PL_sv_undef;
3750 /* in case LEAVE wipes old return values */
3751 for (mark = newsp + 1; mark <= SP; mark++) {
3752 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
3753 *mark = sv_mortalcopy(*mark);
3754 TAINT_NOT; /* Each item is independent */
3758 PL_curpm = newpm; /* Don't pop $1 et al till now */
3761 assert(CvDEPTH(PL_compcv) == 1);
3763 CvDEPTH(PL_compcv) = 0;
3766 if (optype == OP_REQUIRE &&
3767 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
3769 /* Unassume the success we assumed earlier. */
3770 SV * const nsv = cx->blk_eval.old_namesv;
3771 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
3772 retop = Perl_die(aTHX_ "%"SVf" did not return a true value", SVfARG(nsv));
3773 /* die_where() did LEAVE, or we won't be here */
3777 if (!(save_flags & OPf_SPECIAL)) {
3785 /* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
3786 close to the related Perl_create_eval_scope. */
3788 Perl_delete_eval_scope(pTHX)
3793 register PERL_CONTEXT *cx;
3800 PERL_UNUSED_VAR(newsp);
3801 PERL_UNUSED_VAR(gimme);
3802 PERL_UNUSED_VAR(optype);
3805 /* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
3806 also needed by Perl_fold_constants. */
3808 Perl_create_eval_scope(pTHX_ U32 flags)
3811 const I32 gimme = GIMME_V;
3816 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), PL_stack_sp);
3819 PL_in_eval = EVAL_INEVAL;
3820 if (flags & G_KEEPERR)
3821 PL_in_eval |= EVAL_KEEPERR;
3825 if (flags & G_FAKINGEVAL) {
3826 PL_eval_root = PL_op; /* Only needed so that goto works right. */
3834 PERL_CONTEXT * const cx = create_eval_scope(0);
3835 cx->blk_eval.retop = cLOGOP->op_other->op_next;
3836 return DOCATCH(PL_op->op_next);
3845 register PERL_CONTEXT *cx;
3850 PERL_UNUSED_VAR(optype);
3853 if (gimme == G_VOID)
3855 else if (gimme == G_SCALAR) {
3859 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
3862 *MARK = sv_mortalcopy(TOPs);
3866 *MARK = &PL_sv_undef;
3871 /* in case LEAVE wipes old return values */
3873 for (mark = newsp + 1; mark <= SP; mark++) {
3874 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
3875 *mark = sv_mortalcopy(*mark);
3876 TAINT_NOT; /* Each item is independent */
3880 PL_curpm = newpm; /* Don't pop $1 et al till now */
3890 register PERL_CONTEXT *cx;
3891 const I32 gimme = GIMME_V;
3896 if (PL_op->op_targ == 0) {
3897 SV ** const defsv_p = &GvSV(PL_defgv);
3898 *defsv_p = newSVsv(POPs);
3899 SAVECLEARSV(*defsv_p);
3902 sv_setsv(PAD_SV(PL_op->op_targ), POPs);
3904 PUSHBLOCK(cx, CXt_GIVEN, SP);
3913 register PERL_CONTEXT *cx;
3917 PERL_UNUSED_CONTEXT;
3920 assert(CxTYPE(cx) == CXt_GIVEN);
3925 PL_curpm = newpm; /* pop $1 et al */
3932 /* Helper routines used by pp_smartmatch */
3934 S_make_matcher(pTHX_ REGEXP *re)
3937 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
3939 PERL_ARGS_ASSERT_MAKE_MATCHER;
3941 PM_SETRE(matcher, ReREFCNT_inc(re));
3943 SAVEFREEOP((OP *) matcher);
3950 S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
3955 PERL_ARGS_ASSERT_MATCHER_MATCHES_SV;
3957 PL_op = (OP *) matcher;
3962 return (SvTRUEx(POPs));
3966 S_destroy_matcher(pTHX_ PMOP *matcher)
3970 PERL_ARGS_ASSERT_DESTROY_MATCHER;
3971 PERL_UNUSED_ARG(matcher);
3977 /* Do a smart match */
3980 return do_smartmatch(NULL, NULL);
3983 /* This version of do_smartmatch() implements the
3984 * table of smart matches that is found in perlsyn.
3987 S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other)
3992 SV *e = TOPs; /* e is for 'expression' */
3993 SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */
3994 SV *This, *Other; /* 'This' (and Other to match) to play with C++ */
3995 REGEXP *this_regex, *other_regex;
3997 # define NOT_EMPTY_PROTO(cv) (!SvPOK(cv) || SvCUR(cv) == 0)
3999 # define SM_REF(type) ( \
4000 (SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_##type) && (Other = e)) \
4001 || (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_##type) && (Other = d)))
4003 # define SM_CV_NEP /* Find a code ref without an empty prototype */ \
4004 ((SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_PVCV) \
4005 && NOT_EMPTY_PROTO(This) && (Other = e)) \
4006 || (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_PVCV) \
4007 && NOT_EMPTY_PROTO(This) && (Other = d)))
4009 # define SM_REGEX ( \
4010 (SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_REGEXP) \
4011 && (this_regex = (REGEXP*) This) \
4014 (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_REGEXP) \
4015 && (this_regex = (REGEXP*) This) \
4019 # define SM_OBJECT ( \
4020 (sv_isobject(d) && (SvTYPE(SvRV(d)) != SVt_REGEXP)) \
4022 (sv_isobject(e) && (SvTYPE(SvRV(e)) != SVt_REGEXP)) ) \
4024 # define SM_OTHER_REF(type) \
4025 (SvROK(Other) && SvTYPE(SvRV(Other)) == SVt_##type)
4027 # define SM_OTHER_REGEX (SvROK(Other) \
4028 && (SvTYPE(SvRV(Other)) == SVt_REGEXP) \
4029 && (other_regex = (REGEXP*) SvRV(Other)))
4032 # define SM_SEEN_THIS(sv) hv_exists_ent(seen_this, \
4033 sv_2mortal(newSViv(PTR2IV(sv))), 0)
4035 # define SM_SEEN_OTHER(sv) hv_exists_ent(seen_other, \
4036 sv_2mortal(newSViv(PTR2IV(sv))), 0)
4038 tryAMAGICbinSET(smart, 0);
4040 SP -= 2; /* Pop the values */
4042 /* Take care only to invoke mg_get() once for each argument.
4043 * Currently we do this by copying the SV if it's magical. */
4046 d = sv_mortalcopy(d);
4053 e = sv_mortalcopy(e);
4056 Perl_croak(aTHX_ "Smart matching a non-overloaded object breaks encapsulation");
4061 if ( SM_OTHER_REF(PVCV) && NOT_EMPTY_PROTO(SvRV(Other)) )
4063 if (This == SvRV(Other))
4074 c = call_sv(This, G_SCALAR);
4078 else if (SvTEMP(TOPs))
4079 SvREFCNT_inc_void(TOPs);
4084 else if (SM_REF(PVHV)) {
4085 if (SM_OTHER_REF(PVHV)) {
4086 /* Check that the key-sets are identical */
4088 HV *other_hv = (HV *) SvRV(Other);
4090 bool other_tied = FALSE;
4091 U32 this_key_count = 0,
4092 other_key_count = 0;
4094 /* Tied hashes don't know how many keys they have. */
4095 if (SvTIED_mg(This, PERL_MAGIC_tied)) {
4098 else if (SvTIED_mg((SV *) other_hv, PERL_MAGIC_tied)) {
4099 HV * const temp = other_hv;
4100 other_hv = (HV *) This;
4104 if (SvTIED_mg((SV *) other_hv, PERL_MAGIC_tied))
4107 if (!tied && HvUSEDKEYS((HV *) This) != HvUSEDKEYS(other_hv))
4110 /* The hashes have the same number of keys, so it suffices
4111 to check that one is a subset of the other. */
4112 (void) hv_iterinit((HV *) This);
4113 while ( (he = hv_iternext((HV *) This)) ) {
4115 char * const key = hv_iterkey(he, &key_len);
4119 if(!hv_exists(other_hv, key, key_len)) {
4120 (void) hv_iterinit((HV *) This); /* reset iterator */
4126 (void) hv_iterinit(other_hv);
4127 while ( hv_iternext(other_hv) )
4131 other_key_count = HvUSEDKEYS(other_hv);
4133 if (this_key_count != other_key_count)
4138 else if (SM_OTHER_REF(PVAV)) {
4139 AV * const other_av = (AV *) SvRV(Other);
4140 const I32 other_len = av_len(other_av) + 1;
4143 for (i = 0; i < other_len; ++i) {
4144 SV ** const svp = av_fetch(other_av, i, FALSE);
4148 if (svp) { /* ??? When can this not happen? */
4149 key = SvPV(*svp, key_len);
4150 if (hv_exists((HV *) This, key, key_len))
4156 else if (SM_OTHER_REGEX) {
4157 PMOP * const matcher = make_matcher(other_regex);
4160 (void) hv_iterinit((HV *) This);
4161 while ( (he = hv_iternext((HV *) This)) ) {
4162 if (matcher_matches_sv(matcher, hv_iterkeysv(he))) {
4163 (void) hv_iterinit((HV *) This);
4164 destroy_matcher(matcher);
4168 destroy_matcher(matcher);
4172 if (hv_exists_ent((HV *) This, Other, 0))
4178 else if (SM_REF(PVAV)) {
4179 if (SM_OTHER_REF(PVAV)) {
4180 AV *other_av = (AV *) SvRV(Other);
4181 if (av_len((AV *) This) != av_len(other_av))
4185 const I32 other_len = av_len(other_av);
4187 if (NULL == seen_this) {
4188 seen_this = newHV();
4189 (void) sv_2mortal((SV *) seen_this);
4191 if (NULL == seen_other) {
4192 seen_this = newHV();
4193 (void) sv_2mortal((SV *) seen_other);
4195 for(i = 0; i <= other_len; ++i) {
4196 SV * const * const this_elem = av_fetch((AV *)This, i, FALSE);
4197 SV * const * const other_elem = av_fetch(other_av, i, FALSE);
4199 if (!this_elem || !other_elem) {
4200 if (this_elem || other_elem)
4203 else if (SM_SEEN_THIS(*this_elem)
4204 || SM_SEEN_OTHER(*other_elem))
4206 if (*this_elem != *other_elem)
4210 (void)hv_store_ent(seen_this,
4211 sv_2mortal(newSViv(PTR2IV(*this_elem))),
4213 (void)hv_store_ent(seen_other,
4214 sv_2mortal(newSViv(PTR2IV(*other_elem))),
4220 (void) do_smartmatch(seen_this, seen_other);
4230 else if (SM_OTHER_REGEX) {
4231 PMOP * const matcher = make_matcher(other_regex);
4232 const I32 this_len = av_len((AV *) This);
4235 for(i = 0; i <= this_len; ++i) {
4236 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4237 if (svp && matcher_matches_sv(matcher, *svp)) {
4238 destroy_matcher(matcher);
4242 destroy_matcher(matcher);
4245 else if (SvIOK(Other) || SvNOK(Other)) {
4248 for(i = 0; i <= AvFILL((AV *) This); ++i) {
4249 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4256 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4266 else if (SvPOK(Other)) {
4267 const I32 this_len = av_len((AV *) This);
4270 for(i = 0; i <= this_len; ++i) {
4271 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4286 else if (!SvOK(d) || !SvOK(e)) {
4287 if (!SvOK(d) && !SvOK(e))
4292 else if (SM_REGEX) {
4293 PMOP * const matcher = make_matcher(this_regex);
4296 PUSHs(matcher_matches_sv(matcher, Other)
4299 destroy_matcher(matcher);
4302 else if (SM_REF(PVCV)) {
4304 /* This must be a null-prototyped sub, because we
4305 already checked for the other kind. */
4311 c = call_sv(This, G_SCALAR);
4314 PUSHs(&PL_sv_undef);
4315 else if (SvTEMP(TOPs))
4316 SvREFCNT_inc_void(TOPs);
4318 if (SM_OTHER_REF(PVCV)) {
4319 /* This one has to be null-proto'd too.
4320 Call both of 'em, and compare the results */
4322 c = call_sv(SvRV(Other), G_SCALAR);
4325 PUSHs(&PL_sv_undef);
4326 else if (SvTEMP(TOPs))
4327 SvREFCNT_inc_void(TOPs);
4338 else if ( ((SvIOK(d) || SvNOK(d)) && (This = d) && (Other = e))
4339 || ((SvIOK(e) || SvNOK(e)) && (This = e) && (Other = d)) )
4341 if (SvPOK(Other) && !looks_like_number(Other)) {
4342 /* String comparison */
4347 /* Otherwise, numeric comparison */
4350 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4361 /* As a last resort, use string comparison */
4370 register PERL_CONTEXT *cx;
4371 const I32 gimme = GIMME_V;
4373 /* This is essentially an optimization: if the match
4374 fails, we don't want to push a context and then
4375 pop it again right away, so we skip straight
4376 to the op that follows the leavewhen.
4378 if ((0 == (PL_op->op_flags & OPf_SPECIAL)) && !SvTRUEx(POPs))
4379 return cLOGOP->op_other->op_next;
4384 PUSHBLOCK(cx, CXt_WHEN, SP);
4393 register PERL_CONTEXT *cx;
4399 assert(CxTYPE(cx) == CXt_WHEN);
4404 PL_curpm = newpm; /* pop $1 et al */
4414 register PERL_CONTEXT *cx;
4417 cxix = dopoptowhen(cxstack_ix);
4419 DIE(aTHX_ "Can't \"continue\" outside a when block");
4420 if (cxix < cxstack_ix)
4423 /* clear off anything above the scope we're re-entering */
4424 inner = PL_scopestack_ix;
4426 if (PL_scopestack_ix < inner)
4427 leave_scope(PL_scopestack[PL_scopestack_ix]);
4428 PL_curcop = cx->blk_oldcop;
4429 return cx->blk_givwhen.leave_op;
4436 register PERL_CONTEXT *cx;
4439 cxix = dopoptogiven(cxstack_ix);
4441 if (PL_op->op_flags & OPf_SPECIAL)
4442 DIE(aTHX_ "Can't use when() outside a topicalizer");
4444 DIE(aTHX_ "Can't \"break\" outside a given block");
4446 if (CxFOREACH(&cxstack[cxix]) && (0 == (PL_op->op_flags & OPf_SPECIAL)))
4447 DIE(aTHX_ "Can't \"break\" in a loop topicalizer");
4449 if (cxix < cxstack_ix)
4452 /* clear off anything above the scope we're re-entering */
4453 inner = PL_scopestack_ix;
4455 if (PL_scopestack_ix < inner)
4456 leave_scope(PL_scopestack[PL_scopestack_ix]);
4457 PL_curcop = cx->blk_oldcop;
4460 return CX_LOOP_NEXTOP_GET(cx);
4462 return cx->blk_givwhen.leave_op;
4466 S_doparseform(pTHX_ SV *sv)
4469 register char *s = SvPV_force(sv, len);
4470 register char * const send = s + len;
4471 register char *base = NULL;
4472 register I32 skipspaces = 0;
4473 bool noblank = FALSE;
4474 bool repeat = FALSE;
4475 bool postspace = FALSE;
4481 bool unchopnum = FALSE;
4482 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
4484 PERL_ARGS_ASSERT_DOPARSEFORM;
4487 Perl_croak(aTHX_ "Null picture in formline");
4489 /* estimate the buffer size needed */
4490 for (base = s; s <= send; s++) {
4491 if (*s == '\n' || *s == '@' || *s == '^')
4497 Newx(fops, maxops, U32);
4502 *fpc++ = FF_LINEMARK;
4503 noblank = repeat = FALSE;
4521 case ' ': case '\t':
4528 } /* else FALL THROUGH */
4536 *fpc++ = FF_LITERAL;
4544 *fpc++ = (U16)skipspaces;
4548 *fpc++ = FF_NEWLINE;
4552 arg = fpc - linepc + 1;
4559 *fpc++ = FF_LINEMARK;
4560 noblank = repeat = FALSE;
4569 ischop = s[-1] == '^';
4575 arg = (s - base) - 1;
4577 *fpc++ = FF_LITERAL;
4585 *fpc++ = 2; /* skip the @* or ^* */
4587 *fpc++ = FF_LINESNGL;
4590 *fpc++ = FF_LINEGLOB;
4592 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
4593 arg = ischop ? 512 : 0;
4598 const char * const f = ++s;
4601 arg |= 256 + (s - f);
4603 *fpc++ = s - base; /* fieldsize for FETCH */
4604 *fpc++ = FF_DECIMAL;
4606 unchopnum |= ! ischop;
4608 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
4609 arg = ischop ? 512 : 0;
4611 s++; /* skip the '0' first */
4615 const char * const f = ++s;
4618 arg |= 256 + (s - f);
4620 *fpc++ = s - base; /* fieldsize for FETCH */
4621 *fpc++ = FF_0DECIMAL;
4623 unchopnum |= ! ischop;
4627 bool ismore = FALSE;
4630 while (*++s == '>') ;
4631 prespace = FF_SPACE;
4633 else if (*s == '|') {
4634 while (*++s == '|') ;
4635 prespace = FF_HALFSPACE;
4640 while (*++s == '<') ;
4643 if (*s == '.' && s[1] == '.' && s[2] == '.') {
4647 *fpc++ = s - base; /* fieldsize for FETCH */
4649 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
4652 *fpc++ = (U16)prespace;
4666 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
4668 { /* need to jump to the next word */
4670 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
4671 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U32) + 4);
4672 s = SvPVX(sv) + SvCUR(sv) + z;
4674 Copy(fops, s, arg, U32);
4676 sv_magic(sv, NULL, PERL_MAGIC_fm, NULL, 0);
4679 if (unchopnum && repeat)
4680 DIE(aTHX_ "Repeated format line will never terminate (~~ and @#)");
4686 S_num_overflow(NV value, I32 fldsize, I32 frcsize)
4688 /* Can value be printed in fldsize chars, using %*.*f ? */
4692 int intsize = fldsize - (value < 0 ? 1 : 0);
4699 while (intsize--) pwr *= 10.0;
4700 while (frcsize--) eps /= 10.0;
4703 if (value + eps >= pwr)
4706 if (value - eps <= -pwr)
4713 S_run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
4716 SV * const datasv = FILTER_DATA(idx);
4717 const int filter_has_file = IoLINES(datasv);
4718 SV * const filter_state = (SV *)IoTOP_GV(datasv);
4719 SV * const filter_sub = (SV *)IoBOTTOM_GV(datasv);
4723 const char *got_p = NULL;
4724 const char *prune_from = NULL;
4725 bool read_from_cache = FALSE;
4728 PERL_ARGS_ASSERT_RUN_USER_FILTER;
4730 assert(maxlen >= 0);
4733 /* I was having segfault trouble under Linux 2.2.5 after a
4734 parse error occured. (Had to hack around it with a test
4735 for PL_parser->error_count == 0.) Solaris doesn't segfault --
4736 not sure where the trouble is yet. XXX */
4738 if (IoFMT_GV(datasv)) {
4739 SV *const cache = (SV *)IoFMT_GV(datasv);
4742 const char *cache_p = SvPV(cache, cache_len);
4746 /* Running in block mode and we have some cached data already.
4748 if (cache_len >= umaxlen) {
4749 /* In fact, so much data we don't even need to call
4754 const char *const first_nl =
4755 (const char *)memchr(cache_p, '\n', cache_len);
4757 take = first_nl + 1 - cache_p;
4761 sv_catpvn(buf_sv, cache_p, take);
4762 sv_chop(cache, cache_p + take);
4763 /* Definately not EOF */
4767 sv_catsv(buf_sv, cache);
4769 umaxlen -= cache_len;
4772 read_from_cache = TRUE;
4776 /* Filter API says that the filter appends to the contents of the buffer.
4777 Usually the buffer is "", so the details don't matter. But if it's not,
4778 then clearly what it contains is already filtered by this filter, so we
4779 don't want to pass it in a second time.
4780 I'm going to use a mortal in case the upstream filter croaks. */
4781 upstream = ((SvOK(buf_sv) && sv_len(buf_sv)) || SvGMAGICAL(buf_sv))
4782 ? sv_newmortal() : buf_sv;
4783 SvUPGRADE(upstream, SVt_PV);
4785 if (filter_has_file) {
4786 status = FILTER_READ(idx+1, upstream, 0);
4789 if (filter_sub && status >= 0) {
4802 PUSHs(filter_state);
4805 count = call_sv(filter_sub, G_SCALAR);
4820 if(SvOK(upstream)) {
4821 got_p = SvPV(upstream, got_len);
4823 if (got_len > umaxlen) {
4824 prune_from = got_p + umaxlen;
4827 const char *const first_nl =
4828 (const char *)memchr(got_p, '\n', got_len);
4829 if (first_nl && first_nl + 1 < got_p + got_len) {
4830 /* There's a second line here... */
4831 prune_from = first_nl + 1;
4836 /* Oh. Too long. Stuff some in our cache. */
4837 STRLEN cached_len = got_p + got_len - prune_from;
4838 SV *cache = (SV *)IoFMT_GV(datasv);
4841 IoFMT_GV(datasv) = (GV*) (cache = newSV(got_len - umaxlen));
4842 } else if (SvOK(cache)) {
4843 /* Cache should be empty. */
4844 assert(!SvCUR(cache));
4847 sv_setpvn(cache, prune_from, cached_len);
4848 /* If you ask for block mode, you may well split UTF-8 characters.
4849 "If it breaks, you get to keep both parts"
4850 (Your code is broken if you don't put them back together again
4851 before something notices.) */
4852 if (SvUTF8(upstream)) {
4855 SvCUR_set(upstream, got_len - cached_len);
4856 /* Can't yet be EOF */
4861 /* If they are at EOF but buf_sv has something in it, then they may never
4862 have touched the SV upstream, so it may be undefined. If we naively
4863 concatenate it then we get a warning about use of uninitialised value.
4865 if (upstream != buf_sv && (SvOK(upstream) || SvGMAGICAL(upstream))) {
4866 sv_catsv(buf_sv, upstream);
4870 IoLINES(datasv) = 0;
4871 SvREFCNT_dec(IoFMT_GV(datasv));
4873 SvREFCNT_dec(filter_state);
4874 IoTOP_GV(datasv) = NULL;
4877 SvREFCNT_dec(filter_sub);
4878 IoBOTTOM_GV(datasv) = NULL;
4880 filter_del(S_run_user_filter);
4882 if (status == 0 && read_from_cache) {
4883 /* If we read some data from the cache (and by getting here it implies
4884 that we emptied the cache) then we aren't yet at EOF, and mustn't
4885 report that to our caller. */
4891 /* perhaps someone can come up with a better name for
4892 this? it is not really "absolute", per se ... */
4894 S_path_is_absolute(const char *name)
4896 PERL_ARGS_ASSERT_PATH_IS_ABSOLUTE;
4898 if (PERL_FILE_IS_ABSOLUTE(name)
4899 #ifdef MACOS_TRADITIONAL
4902 || (*name == '.' && (name[1] == '/' ||
4903 (name[1] == '.' && name[2] == '/')))
4915 * c-indentation-style: bsd
4917 * indent-tabs-mode: t
4920 * ex: set ts=8 sts=4 sw=4 noet: