3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 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.
19 * [Bilbo on p.35 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
22 /* This file contains control-oriented pp ("push/pop") functions that
23 * execute the opcodes that make up a perl program. A typical pp function
24 * expects to find its arguments on the stack, and usually pushes its
25 * results onto the stack, hence the 'pp' terminology. Each OP structure
26 * contains a pointer to the relevant pp_foo() function.
28 * Control-oriented means things like pp_enteriter() and pp_next(), which
29 * alter the flow of control of the program.
34 #define PERL_IN_PP_CTL_C
37 #define DOCATCH(o) ((CATCH_GET == TRUE) ? docatch(o) : (o))
39 #define dopoptosub(plop) dopoptosub_at(cxstack, (plop))
45 const PERL_CONTEXT *cx;
48 if (PL_op->op_private & OPpOFFBYONE) {
49 if (!(cx = caller_cx(1,NULL))) RETPUSHUNDEF;
52 cxix = dopoptosub(cxstack_ix);
58 switch (cx->blk_gimme) {
77 PMOP *pm = (PMOP*)cLOGOP->op_other;
82 const regexp_engine *eng;
83 bool is_bare_re= FALSE;
85 if (PL_op->op_flags & OPf_STACKED) {
95 /* prevent recompiling under /o and ithreads. */
96 #if defined(USE_ITHREADS)
97 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
104 assert (re != (REGEXP*) &PL_sv_undef);
105 eng = re ? RX_ENGINE(re) : current_re_engine();
108 In the below logic: these are basically the same - check if this regcomp is part of a split.
110 (PL_op->op_pmflags & PMf_split )
111 (PL_op->op_next->op_type == OP_PUSHRE)
113 We could add a new mask for this and copy the PMf_split, if we did
114 some bit definition fiddling first.
116 For now we leave this
119 new_re = (eng->op_comp
121 : &Perl_re_op_compile
122 )(aTHX_ args, nargs, pm->op_code_list, eng, re,
124 (pm->op_pmflags & RXf_PMf_FLAGCOPYMASK),
126 (PL_op->op_flags & OPf_SPECIAL ? PMf_USE_RE_EVAL : 0));
128 if (pm->op_pmflags & PMf_HAS_CV)
129 ReANY(new_re)->qr_anoncv
130 = (CV*) SvREFCNT_inc(PAD_SV(PL_op->op_targ));
134 /* The match's LHS's get-magic might need to access this op's regexp
135 (e.g. $' =~ /$re/ while foo; see bug 70764). So we must call
136 get-magic now before we replace the regexp. Hopefully this hack can
137 be replaced with the approach described at
138 http://www.nntp.perl.org/group/perl.perl5.porters/2007/03/msg122415.html
140 if (pm->op_type == OP_MATCH) {
142 const bool was_tainted = TAINT_get;
143 if (pm->op_flags & OPf_STACKED)
145 else if (pm->op_targ)
146 lhs = PAD_SV(pm->op_targ);
149 /* Restore the previous value of PL_tainted (which may have been
150 modified by get-magic), to avoid incorrectly setting the
151 RXf_TAINTED flag with RX_TAINT_on further down. */
152 TAINT_set(was_tainted);
153 #ifdef NO_TAINT_SUPPORT
154 PERL_UNUSED_VAR(was_tainted);
157 tmp = reg_temp_copy(NULL, new_re);
158 ReREFCNT_dec(new_re);
164 PM_SETRE(pm, new_re);
168 assert(TAINTING_get || !TAINT_get);
170 SvTAINTED_on((SV*)new_re);
174 #if !defined(USE_ITHREADS)
175 /* can't change the optree at runtime either */
176 /* PMf_KEEP is handled differently under threads to avoid these problems */
177 if (!RX_PRELEN(PM_GETRE(pm)) && PL_curpm)
179 if (pm->op_pmflags & PMf_KEEP) {
180 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
181 cLOGOP->op_first->op_next = PL_op->op_next;
193 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
194 PMOP * const pm = (PMOP*) cLOGOP->op_other;
195 SV * const dstr = cx->sb_dstr;
198 char *orig = cx->sb_orig;
199 REGEXP * const rx = cx->sb_rx;
201 REGEXP *old = PM_GETRE(pm);
208 PM_SETRE(pm,ReREFCNT_inc(rx));
211 rxres_restore(&cx->sb_rxres, rx);
213 if (cx->sb_iters++) {
214 const SSize_t saviters = cx->sb_iters;
215 if (cx->sb_iters > cx->sb_maxiters)
216 DIE(aTHX_ "Substitution loop");
218 SvGETMAGIC(TOPs); /* possibly clear taint on $1 etc: #67962 */
220 /* See "how taint works" above pp_subst() */
222 cx->sb_rxtainted |= SUBST_TAINT_REPL;
223 sv_catsv_nomg(dstr, POPs);
224 if (CxONCE(cx) || s < orig ||
225 !CALLREGEXEC(rx, s, cx->sb_strend, orig,
226 (s == m), cx->sb_targ, NULL,
227 (REXEC_IGNOREPOS|REXEC_NOT_FIRST|REXEC_FAIL_ON_UNDERFLOW)))
229 SV *targ = cx->sb_targ;
231 assert(cx->sb_strend >= s);
232 if(cx->sb_strend > s) {
233 if (DO_UTF8(dstr) && !SvUTF8(targ))
234 sv_catpvn_nomg_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
236 sv_catpvn_nomg(dstr, s, cx->sb_strend - s);
238 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
239 cx->sb_rxtainted |= SUBST_TAINT_PAT;
241 if (pm->op_pmflags & PMf_NONDESTRUCT) {
243 /* From here on down we're using the copy, and leaving the
244 original untouched. */
248 SV_CHECK_THINKFIRST_COW_DROP(targ);
249 if (isGV(targ)) Perl_croak_no_modify();
251 SvPV_set(targ, SvPVX(dstr));
252 SvCUR_set(targ, SvCUR(dstr));
253 SvLEN_set(targ, SvLEN(dstr));
256 SvPV_set(dstr, NULL);
259 mPUSHi(saviters - 1);
261 (void)SvPOK_only_UTF8(targ);
264 /* update the taint state of various various variables in
265 * preparation for final exit.
266 * See "how taint works" above pp_subst() */
268 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
269 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
270 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
272 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
274 if (!(cx->sb_rxtainted & SUBST_TAINT_BOOLRET)
275 && (cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT))
277 SvTAINTED_on(TOPs); /* taint return value */
278 /* needed for mg_set below */
280 cBOOL(cx->sb_rxtainted &
281 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL))
285 /* PL_tainted must be correctly set for this mg_set */
288 LEAVE_SCOPE(cx->sb_oldsave);
291 RETURNOP(pm->op_next);
292 NOT_REACHED; /* NOTREACHED */
294 cx->sb_iters = saviters;
296 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
299 assert(!RX_SUBOFFSET(rx));
300 cx->sb_orig = orig = RX_SUBBEG(rx);
302 cx->sb_strend = s + (cx->sb_strend - m);
304 cx->sb_m = m = RX_OFFS(rx)[0].start + orig;
306 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
307 sv_catpvn_nomg_utf8_upgrade(dstr, s, m - s, nsv);
309 sv_catpvn_nomg(dstr, s, m-s);
311 cx->sb_s = RX_OFFS(rx)[0].end + orig;
312 { /* Update the pos() information. */
314 = (pm->op_pmflags & PMf_NONDESTRUCT) ? cx->sb_dstr : cx->sb_targ;
317 /* the string being matched against may no longer be a string,
318 * e.g. $_=0; s/.../$_++/ge */
321 SvPV_force_nomg_nolen(sv);
323 if (!(mg = mg_find_mglob(sv))) {
324 mg = sv_magicext_mglob(sv);
326 MgBYTEPOS_set(mg, sv, SvPVX(sv), m - orig);
329 (void)ReREFCNT_inc(rx);
330 /* update the taint state of various various variables in preparation
331 * for calling the code block.
332 * See "how taint works" above pp_subst() */
334 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
335 cx->sb_rxtainted |= SUBST_TAINT_PAT;
337 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
338 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
339 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
341 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
343 if (cx->sb_iters > 1 && (cx->sb_rxtainted &
344 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL)))
345 SvTAINTED_on((pm->op_pmflags & PMf_NONDESTRUCT)
346 ? cx->sb_dstr : cx->sb_targ);
349 rxres_save(&cx->sb_rxres, rx);
351 RETURNOP(pm->op_pmstashstartu.op_pmreplstart);
355 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
360 PERL_ARGS_ASSERT_RXRES_SAVE;
363 if (!p || p[1] < RX_NPARENS(rx)) {
365 i = 7 + (RX_NPARENS(rx)+1) * 2;
367 i = 6 + (RX_NPARENS(rx)+1) * 2;
376 /* what (if anything) to free on croak */
377 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? RX_SUBBEG(rx) : NULL);
378 RX_MATCH_COPIED_off(rx);
379 *p++ = RX_NPARENS(rx);
382 *p++ = PTR2UV(RX_SAVED_COPY(rx));
383 RX_SAVED_COPY(rx) = NULL;
386 *p++ = PTR2UV(RX_SUBBEG(rx));
387 *p++ = (UV)RX_SUBLEN(rx);
388 *p++ = (UV)RX_SUBOFFSET(rx);
389 *p++ = (UV)RX_SUBCOFFSET(rx);
390 for (i = 0; i <= RX_NPARENS(rx); ++i) {
391 *p++ = (UV)RX_OFFS(rx)[i].start;
392 *p++ = (UV)RX_OFFS(rx)[i].end;
397 S_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
402 PERL_ARGS_ASSERT_RXRES_RESTORE;
405 RX_MATCH_COPY_FREE(rx);
406 RX_MATCH_COPIED_set(rx, *p);
408 RX_NPARENS(rx) = *p++;
411 if (RX_SAVED_COPY(rx))
412 SvREFCNT_dec (RX_SAVED_COPY(rx));
413 RX_SAVED_COPY(rx) = INT2PTR(SV*,*p);
417 RX_SUBBEG(rx) = INT2PTR(char*,*p++);
418 RX_SUBLEN(rx) = (I32)(*p++);
419 RX_SUBOFFSET(rx) = (I32)*p++;
420 RX_SUBCOFFSET(rx) = (I32)*p++;
421 for (i = 0; i <= RX_NPARENS(rx); ++i) {
422 RX_OFFS(rx)[i].start = (I32)(*p++);
423 RX_OFFS(rx)[i].end = (I32)(*p++);
428 S_rxres_free(pTHX_ void **rsp)
430 UV * const p = (UV*)*rsp;
432 PERL_ARGS_ASSERT_RXRES_FREE;
436 void *tmp = INT2PTR(char*,*p);
439 U32 i = 9 + p[1] * 2;
441 U32 i = 8 + p[1] * 2;
446 SvREFCNT_dec (INT2PTR(SV*,p[2]));
449 PoisonFree(p, i, sizeof(UV));
458 #define FORM_NUM_BLANK (1<<30)
459 #define FORM_NUM_POINT (1<<29)
463 dSP; dMARK; dORIGMARK;
464 SV * const tmpForm = *++MARK;
465 SV *formsv; /* contains text of original format */
466 U32 *fpc; /* format ops program counter */
467 char *t; /* current append position in target string */
468 const char *f; /* current position in format string */
470 SV *sv = NULL; /* current item */
471 const char *item = NULL;/* string value of current item */
472 I32 itemsize = 0; /* length (chars) of item, possibly truncated */
473 I32 itembytes = 0; /* as itemsize, but length in bytes */
474 I32 fieldsize = 0; /* width of current field */
475 I32 lines = 0; /* number of lines that have been output */
476 bool chopspace = (strchr(PL_chopset, ' ') != NULL); /* does $: have space */
477 const char *chophere = NULL; /* where to chop current item */
478 STRLEN linemark = 0; /* pos of start of line in output */
480 bool gotsome = FALSE; /* seen at least one non-blank item on this line */
481 STRLEN len; /* length of current sv */
482 STRLEN linemax; /* estimate of output size in bytes */
483 bool item_is_utf8 = FALSE;
484 bool targ_is_utf8 = FALSE;
487 U8 *source; /* source of bytes to append */
488 STRLEN to_copy; /* how may bytes to append */
489 char trans; /* what chars to translate */
491 mg = doparseform(tmpForm);
493 fpc = (U32*)mg->mg_ptr;
494 /* the actual string the format was compiled from.
495 * with overload etc, this may not match tmpForm */
499 SvPV_force(PL_formtarget, len);
500 if (SvTAINTED(tmpForm) || SvTAINTED(formsv))
501 SvTAINTED_on(PL_formtarget);
502 if (DO_UTF8(PL_formtarget))
504 linemax = (SvCUR(formsv) * (IN_BYTES ? 1 : 3) + 1);
505 t = SvGROW(PL_formtarget, len + linemax + 1);
506 /* XXX from now onwards, SvCUR(PL_formtarget) is invalid */
508 f = SvPV_const(formsv, len);
512 const char *name = "???";
515 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
516 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
517 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
518 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
519 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
521 case FF_CHECKNL: name = "CHECKNL"; break;
522 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
523 case FF_SPACE: name = "SPACE"; break;
524 case FF_HALFSPACE: name = "HALFSPACE"; break;
525 case FF_ITEM: name = "ITEM"; break;
526 case FF_CHOP: name = "CHOP"; break;
527 case FF_LINEGLOB: name = "LINEGLOB"; break;
528 case FF_NEWLINE: name = "NEWLINE"; break;
529 case FF_MORE: name = "MORE"; break;
530 case FF_LINEMARK: name = "LINEMARK"; break;
531 case FF_END: name = "END"; break;
532 case FF_0DECIMAL: name = "0DECIMAL"; break;
533 case FF_LINESNGL: name = "LINESNGL"; break;
536 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
538 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
541 case FF_LINEMARK: /* start (or end) of a line */
542 linemark = t - SvPVX(PL_formtarget);
547 case FF_LITERAL: /* append <arg> literal chars */
552 item_is_utf8 = targ_is_utf8 ? !!DO_UTF8(formsv) : !!SvUTF8(formsv);
555 case FF_SKIP: /* skip <arg> chars in format */
559 case FF_FETCH: /* get next item and set field size to <arg> */
568 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
571 SvTAINTED_on(PL_formtarget);
574 case FF_CHECKNL: /* find max len of item (up to \n) that fits field */
576 const char *s = item = SvPV_const(sv, len);
577 const char *send = s + len;
580 item_is_utf8 = DO_UTF8(sv);
592 if (itemsize == fieldsize)
595 itembytes = s - item;
600 case FF_CHECKCHOP: /* like CHECKNL, but up to highest split point */
602 const char *s = item = SvPV_const(sv, len);
603 const char *send = s + len;
607 item_is_utf8 = DO_UTF8(sv);
609 /* look for a legal split position */
617 /* provisional split point */
621 /* we delay testing fieldsize until after we've
622 * processed the possible split char directly
623 * following the last field char; so if fieldsize=3
624 * and item="a b cdef", we consume "a b", not "a".
625 * Ditto further down.
627 if (size == fieldsize)
631 if (strchr(PL_chopset, *s)) {
632 /* provisional split point */
633 /* for a non-space split char, we include
634 * the split char; hence the '+1' */
638 if (size == fieldsize)
650 if (!chophere || s == send) {
654 itembytes = chophere - item;
659 case FF_SPACE: /* append padding space (diff of field, item size) */
660 arg = fieldsize - itemsize;
668 case FF_HALFSPACE: /* like FF_SPACE, but only append half as many */
669 arg = fieldsize - itemsize;
678 case FF_ITEM: /* append a text item, while blanking ctrl chars */
684 case FF_CHOP: /* (for ^*) chop the current item */
685 if (sv != &PL_sv_no) {
686 const char *s = chophere;
694 /* tied, overloaded or similar strangeness.
695 * Do it the hard way */
696 sv_setpvn(sv, s, len - (s-item));
701 case FF_LINESNGL: /* process ^* */
705 case FF_LINEGLOB: /* process @* */
707 const bool oneline = fpc[-1] == FF_LINESNGL;
708 const char *s = item = SvPV_const(sv, len);
709 const char *const send = s + len;
711 item_is_utf8 = DO_UTF8(sv);
722 to_copy = s - item - 1;
736 /* append to_copy bytes from source to PL_formstring.
737 * item_is_utf8 implies source is utf8.
738 * if trans, translate certain characters during the copy */
743 SvCUR_set(PL_formtarget,
744 t - SvPVX_const(PL_formtarget));
746 if (targ_is_utf8 && !item_is_utf8) {
747 source = tmp = bytes_to_utf8(source, &to_copy);
749 if (item_is_utf8 && !targ_is_utf8) {
751 /* Upgrade targ to UTF8, and then we reduce it to
752 a problem we have a simple solution for.
753 Don't need get magic. */
754 sv_utf8_upgrade_nomg(PL_formtarget);
756 /* re-calculate linemark */
757 s = (U8*)SvPVX(PL_formtarget);
758 /* the bytes we initially allocated to append the
759 * whole line may have been gobbled up during the
760 * upgrade, so allocate a whole new line's worth
765 linemark = s - (U8*)SvPVX(PL_formtarget);
767 /* Easy. They agree. */
768 assert (item_is_utf8 == targ_is_utf8);
771 /* @* and ^* are the only things that can exceed
772 * the linemax, so grow by the output size, plus
773 * a whole new form's worth in case of any further
775 grow = linemax + to_copy;
777 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + grow + 1);
778 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
780 Copy(source, t, to_copy, char);
782 /* blank out ~ or control chars, depending on trans.
783 * works on bytes not chars, so relies on not
784 * matching utf8 continuation bytes */
786 U8 *send = s + to_copy;
789 if (trans == '~' ? (ch == '~') : isCNTRL(ch))
796 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) + to_copy);
802 case FF_0DECIMAL: /* like FF_DECIMAL but for 0### */
805 ((arg & FORM_NUM_POINT) ? "%#0*.*" NVff : "%0*.*" NVff);
808 case FF_DECIMAL: /* do @##, ^##, where <arg>=(precision|flags) */
811 ((arg & FORM_NUM_POINT) ? "%#*.*" NVff : "%*.*" NVff);
813 /* If the field is marked with ^ and the value is undefined,
815 if ((arg & FORM_NUM_BLANK) && !SvOK(sv)) {
823 /* overflow evidence */
824 if (num_overflow(value, fieldsize, arg)) {
830 /* Formats aren't yet marked for locales, so assume "yes". */
832 Size_t max = SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget));
834 DECLARATION_FOR_LC_NUMERIC_MANIPULATION;
835 STORE_LC_NUMERIC_SET_TO_NEEDED();
836 arg &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
839 const char* qfmt = quadmath_format_single(fmt);
842 Perl_croak_nocontext("panic: quadmath invalid format \"%s\"", fmt);
843 len = quadmath_snprintf(t, max, qfmt, (int) fieldsize, (int) arg, value);
845 Perl_croak_nocontext("panic: quadmath_snprintf failed, format \"%s\"", qfmt);
850 /* we generate fmt ourselves so it is safe */
851 GCC_DIAG_IGNORE(-Wformat-nonliteral);
852 len = my_snprintf(t, max, fmt, (int) fieldsize, (int) arg, value);
855 PERL_MY_SNPRINTF_POST_GUARD(len, max);
856 RESTORE_LC_NUMERIC();
861 case FF_NEWLINE: /* delete trailing spaces, then append \n */
863 while (t-- > (SvPVX(PL_formtarget) + linemark) && *t == ' ') ;
868 case FF_BLANK: /* for arg==0: do '~'; for arg>0 : do '~~' */
871 if (arg) { /* repeat until fields exhausted? */
877 t = SvPVX(PL_formtarget) + linemark;
882 case FF_MORE: /* replace long end of string with '...' */
884 const char *s = chophere;
885 const char *send = item + len;
887 while (isSPACE(*s) && (s < send))
892 arg = fieldsize - itemsize;
899 if (strnEQ(s1," ",3)) {
900 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
910 case FF_END: /* tidy up, then return */
912 assert(t < SvPVX_const(PL_formtarget) + SvLEN(PL_formtarget));
914 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
916 SvUTF8_on(PL_formtarget);
917 FmLINES(PL_formtarget) += lines;
919 if (fpc[-1] == FF_BLANK)
920 RETURNOP(cLISTOP->op_first);
932 if (PL_stack_base + TOPMARK == SP) {
934 if (GIMME_V == G_SCALAR)
936 RETURNOP(PL_op->op_next->op_next);
938 PL_stack_sp = PL_stack_base + TOPMARK + 1;
939 Perl_pp_pushmark(aTHX); /* push dst */
940 Perl_pp_pushmark(aTHX); /* push src */
941 ENTER_with_name("grep"); /* enter outer scope */
945 ENTER_with_name("grep_item"); /* enter inner scope */
948 src = PL_stack_base[TOPMARK];
950 src = PL_stack_base[TOPMARK] = sv_mortalcopy(src);
957 if (PL_op->op_type == OP_MAPSTART)
958 Perl_pp_pushmark(aTHX); /* push top */
959 return ((LOGOP*)PL_op->op_next)->op_other;
965 const I32 gimme = GIMME_V;
966 I32 items = (SP - PL_stack_base) - TOPMARK; /* how many new items */
972 /* first, move source pointer to the next item in the source list */
973 ++PL_markstack_ptr[-1];
975 /* if there are new items, push them into the destination list */
976 if (items && gimme != G_VOID) {
977 /* might need to make room back there first */
978 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
979 /* XXX this implementation is very pessimal because the stack
980 * is repeatedly extended for every set of items. Is possible
981 * to do this without any stack extension or copying at all
982 * by maintaining a separate list over which the map iterates
983 * (like foreach does). --gsar */
985 /* everything in the stack after the destination list moves
986 * towards the end the stack by the amount of room needed */
987 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
989 /* items to shift up (accounting for the moved source pointer) */
990 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
992 /* This optimization is by Ben Tilly and it does
993 * things differently from what Sarathy (gsar)
994 * is describing. The downside of this optimization is
995 * that leaves "holes" (uninitialized and hopefully unused areas)
996 * to the Perl stack, but on the other hand this
997 * shouldn't be a problem. If Sarathy's idea gets
998 * implemented, this optimization should become
999 * irrelevant. --jhi */
1001 shift = count; /* Avoid shifting too often --Ben Tilly */
1005 dst = (SP += shift);
1006 PL_markstack_ptr[-1] += shift;
1007 *PL_markstack_ptr += shift;
1011 /* copy the new items down to the destination list */
1012 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
1013 if (gimme == G_ARRAY) {
1014 /* add returned items to the collection (making mortal copies
1015 * if necessary), then clear the current temps stack frame
1016 * *except* for those items. We do this splicing the items
1017 * into the start of the tmps frame (so some items may be on
1018 * the tmps stack twice), then moving PL_tmps_floor above
1019 * them, then freeing the frame. That way, the only tmps that
1020 * accumulate over iterations are the return values for map.
1021 * We have to do to this way so that everything gets correctly
1022 * freed if we die during the map.
1026 /* make space for the slice */
1027 EXTEND_MORTAL(items);
1028 tmpsbase = PL_tmps_floor + 1;
1029 Move(PL_tmps_stack + tmpsbase,
1030 PL_tmps_stack + tmpsbase + items,
1031 PL_tmps_ix - PL_tmps_floor,
1033 PL_tmps_ix += items;
1038 sv = sv_mortalcopy(sv);
1040 PL_tmps_stack[tmpsbase++] = SvREFCNT_inc_simple(sv);
1042 /* clear the stack frame except for the items */
1043 PL_tmps_floor += items;
1045 /* FREETMPS may have cleared the TEMP flag on some of the items */
1048 SvTEMP_on(PL_tmps_stack[--tmpsbase]);
1051 /* scalar context: we don't care about which values map returns
1052 * (we use undef here). And so we certainly don't want to do mortal
1053 * copies of meaningless values. */
1054 while (items-- > 0) {
1056 *dst-- = &PL_sv_undef;
1064 LEAVE_with_name("grep_item"); /* exit inner scope */
1067 if (PL_markstack_ptr[-1] > TOPMARK) {
1069 (void)POPMARK; /* pop top */
1070 LEAVE_with_name("grep"); /* exit outer scope */
1071 (void)POPMARK; /* pop src */
1072 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1073 (void)POPMARK; /* pop dst */
1074 SP = PL_stack_base + POPMARK; /* pop original mark */
1075 if (gimme == G_SCALAR) {
1079 else if (gimme == G_ARRAY)
1086 ENTER_with_name("grep_item"); /* enter inner scope */
1089 /* set $_ to the new source item */
1090 src = PL_stack_base[PL_markstack_ptr[-1]];
1091 if (SvPADTMP(src)) {
1092 src = sv_mortalcopy(src);
1097 RETURNOP(cLOGOP->op_other);
1105 if (GIMME_V == G_ARRAY)
1107 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1108 return cLOGOP->op_other;
1117 if (GIMME_V == G_ARRAY) {
1118 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1122 SV * const targ = PAD_SV(PL_op->op_targ);
1125 if (PL_op->op_private & OPpFLIP_LINENUM) {
1126 if (GvIO(PL_last_in_gv)) {
1127 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1130 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1132 flip = SvIV(sv) == SvIV(GvSV(gv));
1138 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1139 if (PL_op->op_flags & OPf_SPECIAL) {
1147 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1150 sv_setpvs(TARG, "");
1156 /* This code tries to decide if "$left .. $right" should use the
1157 magical string increment, or if the range is numeric (we make
1158 an exception for .."0" [#18165]). AMS 20021031. */
1160 #define RANGE_IS_NUMERIC(left,right) ( \
1161 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1162 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1163 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1164 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1165 && (!SvOK(right) || looks_like_number(right))))
1171 if (GIMME_V == G_ARRAY) {
1177 if (RANGE_IS_NUMERIC(left,right)) {
1179 if ((SvOK(left) && !SvIOK(left) && SvNV_nomg(left) < IV_MIN) ||
1180 (SvOK(right) && (SvIOK(right)
1181 ? SvIsUV(right) && SvUV(right) > IV_MAX
1182 : SvNV_nomg(right) > IV_MAX)))
1183 DIE(aTHX_ "Range iterator outside integer range");
1184 i = SvIV_nomg(left);
1185 j = SvIV_nomg(right);
1187 /* Dance carefully around signed max. */
1188 bool overflow = (i <= 0 && j > SSize_t_MAX + i - 1);
1191 /* The wraparound of signed integers is undefined
1192 * behavior, but here we aim for count >=1, and
1193 * negative count is just wrong. */
1195 #if IVSIZE > Size_t_size
1202 Perl_croak(aTHX_ "Out of memory during list extend");
1209 SV * const sv = sv_2mortal(newSViv(i));
1211 if (n) /* avoid incrementing above IV_MAX */
1217 const char * const lpv = SvPV_nomg_const(left, llen);
1218 const char * const tmps = SvPV_nomg_const(right, len);
1220 SV *sv = newSVpvn_flags(lpv, llen, SvUTF8(left)|SVs_TEMP);
1221 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1223 if (strEQ(SvPVX_const(sv),tmps))
1225 sv = sv_2mortal(newSVsv(sv));
1232 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1236 if (PL_op->op_private & OPpFLIP_LINENUM) {
1237 if (GvIO(PL_last_in_gv)) {
1238 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1241 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1242 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1250 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1251 sv_catpvs(targ, "E0");
1261 static const char * const context_name[] = {
1263 NULL, /* CXt_WHEN never actually needs "block" */
1264 NULL, /* CXt_BLOCK never actually needs "block" */
1265 NULL, /* CXt_GIVEN never actually needs "block" */
1266 NULL, /* CXt_LOOP_FOR never actually needs "loop" */
1267 NULL, /* CXt_LOOP_PLAIN never actually needs "loop" */
1268 NULL, /* CXt_LOOP_LAZYSV never actually needs "loop" */
1269 NULL, /* CXt_LOOP_LAZYIV never actually needs "loop" */
1277 S_dopoptolabel(pTHX_ const char *label, STRLEN len, U32 flags)
1281 PERL_ARGS_ASSERT_DOPOPTOLABEL;
1283 for (i = cxstack_ix; i >= 0; i--) {
1284 const PERL_CONTEXT * const cx = &cxstack[i];
1285 switch (CxTYPE(cx)) {
1291 /* diag_listed_as: Exiting subroutine via %s */
1292 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1293 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1294 if (CxTYPE(cx) == CXt_NULL)
1297 case CXt_LOOP_LAZYIV:
1298 case CXt_LOOP_LAZYSV:
1300 case CXt_LOOP_PLAIN:
1302 STRLEN cx_label_len = 0;
1303 U32 cx_label_flags = 0;
1304 const char *cx_label = CxLABEL_len_flags(cx, &cx_label_len, &cx_label_flags);
1306 ( (cx_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ?
1309 (const U8*)cx_label, cx_label_len,
1310 (const U8*)label, len) == 0)
1312 (const U8*)label, len,
1313 (const U8*)cx_label, cx_label_len) == 0)
1314 : (len == cx_label_len && ((cx_label == label)
1315 || memEQ(cx_label, label, len))) )) {
1316 DEBUG_l(Perl_deb(aTHX_ "(poptolabel(): skipping label at cx=%ld %s)\n",
1317 (long)i, cx_label));
1320 DEBUG_l( Perl_deb(aTHX_ "(poptolabel(): found label at cx=%ld %s)\n", (long)i, label));
1331 Perl_dowantarray(pTHX)
1333 const I32 gimme = block_gimme();
1334 return (gimme == G_VOID) ? G_SCALAR : gimme;
1338 Perl_block_gimme(pTHX)
1340 const I32 cxix = dopoptosub(cxstack_ix);
1345 gimme = (cxstack[cxix].blk_gimme & G_WANT);
1347 Perl_croak(aTHX_ "panic: bad gimme: %d\n", gimme);
1353 Perl_is_lvalue_sub(pTHX)
1355 const I32 cxix = dopoptosub(cxstack_ix);
1356 assert(cxix >= 0); /* We should only be called from inside subs */
1358 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1359 return CxLVAL(cxstack + cxix);
1364 /* only used by PUSHSUB */
1366 Perl_was_lvalue_sub(pTHX)
1368 const I32 cxix = dopoptosub(cxstack_ix-1);
1369 assert(cxix >= 0); /* We should only be called from inside subs */
1371 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1372 return CxLVAL(cxstack + cxix);
1378 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1382 PERL_ARGS_ASSERT_DOPOPTOSUB_AT;
1384 PERL_UNUSED_CONTEXT;
1387 for (i = startingblock; i >= 0; i--) {
1388 const PERL_CONTEXT * const cx = &cxstk[i];
1389 switch (CxTYPE(cx)) {
1393 /* in sub foo { /(?{...})/ }, foo ends up on the CX stack
1394 * twice; the first for the normal foo() call, and the second
1395 * for a faked up re-entry into the sub to execute the
1396 * code block. Hide this faked entry from the world. */
1397 if (cx->cx_type & CXp_SUB_RE_FAKE)
1402 DEBUG_l( Perl_deb(aTHX_ "(dopoptosub_at(): found sub at cx=%ld)\n", (long)i));
1410 S_dopoptoeval(pTHX_ I32 startingblock)
1413 for (i = startingblock; i >= 0; i--) {
1414 const PERL_CONTEXT *cx = &cxstack[i];
1415 switch (CxTYPE(cx)) {
1419 DEBUG_l( Perl_deb(aTHX_ "(dopoptoeval(): found eval at cx=%ld)\n", (long)i));
1427 S_dopoptoloop(pTHX_ I32 startingblock)
1430 for (i = startingblock; i >= 0; i--) {
1431 const PERL_CONTEXT * const cx = &cxstack[i];
1432 switch (CxTYPE(cx)) {
1438 /* diag_listed_as: Exiting subroutine via %s */
1439 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1440 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1441 if ((CxTYPE(cx)) == CXt_NULL)
1444 case CXt_LOOP_LAZYIV:
1445 case CXt_LOOP_LAZYSV:
1447 case CXt_LOOP_PLAIN:
1448 DEBUG_l( Perl_deb(aTHX_ "(dopoptoloop(): found loop at cx=%ld)\n", (long)i));
1455 /* find the next GIVEN or FOR loop context block */
1458 S_dopoptogivenfor(pTHX_ I32 startingblock)
1461 for (i = startingblock; i >= 0; i--) {
1462 const PERL_CONTEXT *cx = &cxstack[i];
1463 switch (CxTYPE(cx)) {
1467 DEBUG_l( Perl_deb(aTHX_ "(dopoptogivenfor(): found given at cx=%ld)\n", (long)i));
1469 case CXt_LOOP_PLAIN:
1470 assert(!CxFOREACHDEF(cx));
1472 case CXt_LOOP_LAZYIV:
1473 case CXt_LOOP_LAZYSV:
1475 if (CxFOREACHDEF(cx)) {
1476 DEBUG_l( Perl_deb(aTHX_ "(dopoptogivenfor(): found foreach at cx=%ld)\n", (long)i));
1485 S_dopoptowhen(pTHX_ I32 startingblock)
1488 for (i = startingblock; i >= 0; i--) {
1489 const PERL_CONTEXT *cx = &cxstack[i];
1490 switch (CxTYPE(cx)) {
1494 DEBUG_l( Perl_deb(aTHX_ "(dopoptowhen(): found when at cx=%ld)\n", (long)i));
1502 Perl_dounwind(pTHX_ I32 cxix)
1506 if (!PL_curstackinfo) /* can happen if die during thread cloning */
1509 while (cxstack_ix > cxix) {
1510 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1511 DEBUG_CX("UNWIND"); \
1512 /* Note: we don't need to restore the base context info till the end. */
1513 switch (CxTYPE(cx)) {
1516 continue; /* not break */
1526 case CXt_LOOP_LAZYIV:
1527 case CXt_LOOP_LAZYSV:
1529 case CXt_LOOP_PLAIN:
1546 PERL_UNUSED_VAR(optype);
1550 Perl_qerror(pTHX_ SV *err)
1552 PERL_ARGS_ASSERT_QERROR;
1555 if (PL_in_eval & EVAL_KEEPERR) {
1556 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1560 sv_catsv(ERRSV, err);
1563 sv_catsv(PL_errors, err);
1565 Perl_warn(aTHX_ "%"SVf, SVfARG(err));
1567 ++PL_parser->error_count;
1571 Perl_die_unwind(pTHX_ SV *msv)
1573 SV *exceptsv = sv_mortalcopy(msv);
1574 U8 in_eval = PL_in_eval;
1575 PERL_ARGS_ASSERT_DIE_UNWIND;
1581 * Historically, perl used to set ERRSV ($@) early in the die
1582 * process and rely on it not getting clobbered during unwinding.
1583 * That sucked, because it was liable to get clobbered, so the
1584 * setting of ERRSV used to emit the exception from eval{} has
1585 * been moved to much later, after unwinding (see just before
1586 * JMPENV_JUMP below). However, some modules were relying on the
1587 * early setting, by examining $@ during unwinding to use it as
1588 * a flag indicating whether the current unwinding was caused by
1589 * an exception. It was never a reliable flag for that purpose,
1590 * being totally open to false positives even without actual
1591 * clobberage, but was useful enough for production code to
1592 * semantically rely on it.
1594 * We'd like to have a proper introspective interface that
1595 * explicitly describes the reason for whatever unwinding
1596 * operations are currently in progress, so that those modules
1597 * work reliably and $@ isn't further overloaded. But we don't
1598 * have one yet. In its absence, as a stopgap measure, ERRSV is
1599 * now *additionally* set here, before unwinding, to serve as the
1600 * (unreliable) flag that it used to.
1602 * This behaviour is temporary, and should be removed when a
1603 * proper way to detect exceptional unwinding has been developed.
1604 * As of 2010-12, the authors of modules relying on the hack
1605 * are aware of the issue, because the modules failed on
1606 * perls 5.13.{1..7} which had late setting of $@ without this
1607 * early-setting hack.
1609 if (!(in_eval & EVAL_KEEPERR)) {
1610 SvTEMP_off(exceptsv);
1611 sv_setsv(ERRSV, exceptsv);
1614 if (in_eval & EVAL_KEEPERR) {
1615 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1619 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1620 && PL_curstackinfo->si_prev)
1635 JMPENV *restartjmpenv;
1638 if (cxix < cxstack_ix)
1641 cx = &cxstack[cxstack_ix];
1642 assert(CxTYPE(cx) == CXt_EVAL);
1643 newsp = PL_stack_base + cx->blk_oldsp;
1644 gimme = cx->blk_gimme;
1646 if (gimme == G_SCALAR)
1647 *++newsp = &PL_sv_undef;
1648 PL_stack_sp = newsp;
1651 if (CxTYPE(cx) != CXt_EVAL) {
1653 const char* message = SvPVx_const(exceptsv, msglen);
1654 PerlIO_write(Perl_error_log, (const char *)"panic: die ", 11);
1655 PerlIO_write(Perl_error_log, message, msglen);
1660 POPBLOCK(cx,PL_curpm);
1662 namesv = cx->blk_eval.old_namesv;
1664 oldcop = cx->blk_oldcop;
1666 restartjmpenv = cx->blk_eval.cur_top_env;
1667 restartop = cx->blk_eval.retop;
1669 if (optype == OP_REQUIRE) {
1670 assert (PL_curcop == oldcop);
1671 (void)hv_store(GvHVn(PL_incgv),
1672 SvPVX_const(namesv),
1673 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
1675 /* note that unlike pp_entereval, pp_require isn't
1676 * supposed to trap errors. So now that we've popped the
1677 * EVAL that pp_require pushed, and processed the error
1678 * message, rethrow the error */
1679 Perl_croak(aTHX_ "%"SVf"Compilation failed in require",
1680 SVfARG(exceptsv ? exceptsv : newSVpvs_flags("Unknown error\n",
1683 if (!(in_eval & EVAL_KEEPERR))
1684 sv_setsv(ERRSV, exceptsv);
1685 PL_restartjmpenv = restartjmpenv;
1686 PL_restartop = restartop;
1688 NOT_REACHED; /* NOTREACHED */
1692 write_to_stderr(exceptsv);
1694 NOT_REACHED; /* NOTREACHED */
1700 if (SvTRUE(left) != SvTRUE(right))
1708 =head1 CV Manipulation Functions
1710 =for apidoc caller_cx
1712 The XSUB-writer's equivalent of L<caller()|perlfunc/caller>. The
1713 returned C<PERL_CONTEXT> structure can be interrogated to find all the
1714 information returned to Perl by C<caller>. Note that XSUBs don't get a
1715 stack frame, so C<caller_cx(0, NULL)> will return information for the
1716 immediately-surrounding Perl code.
1718 This function skips over the automatic calls to C<&DB::sub> made on the
1719 behalf of the debugger. If the stack frame requested was a sub called by
1720 C<DB::sub>, the return value will be the frame for the call to
1721 C<DB::sub>, since that has the correct line number/etc. for the call
1722 site. If I<dbcxp> is non-C<NULL>, it will be set to a pointer to the
1723 frame for the sub call itself.
1728 const PERL_CONTEXT *
1729 Perl_caller_cx(pTHX_ I32 count, const PERL_CONTEXT **dbcxp)
1731 I32 cxix = dopoptosub(cxstack_ix);
1732 const PERL_CONTEXT *cx;
1733 const PERL_CONTEXT *ccstack = cxstack;
1734 const PERL_SI *top_si = PL_curstackinfo;
1737 /* we may be in a higher stacklevel, so dig down deeper */
1738 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1739 top_si = top_si->si_prev;
1740 ccstack = top_si->si_cxstack;
1741 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1745 /* caller() should not report the automatic calls to &DB::sub */
1746 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1747 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1751 cxix = dopoptosub_at(ccstack, cxix - 1);
1754 cx = &ccstack[cxix];
1755 if (dbcxp) *dbcxp = cx;
1757 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1758 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1759 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1760 field below is defined for any cx. */
1761 /* caller() should not report the automatic calls to &DB::sub */
1762 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1763 cx = &ccstack[dbcxix];
1772 const PERL_CONTEXT *cx;
1773 const PERL_CONTEXT *dbcx;
1774 I32 gimme = GIMME_V;
1775 const HEK *stash_hek;
1777 bool has_arg = MAXARG && TOPs;
1786 cx = caller_cx(count + !!(PL_op->op_private & OPpOFFBYONE), &dbcx);
1788 if (gimme != G_ARRAY) {
1796 assert(CopSTASH(cx->blk_oldcop));
1797 stash_hek = SvTYPE(CopSTASH(cx->blk_oldcop)) == SVt_PVHV
1798 ? HvNAME_HEK((HV*)CopSTASH(cx->blk_oldcop))
1800 if (gimme != G_ARRAY) {
1803 PUSHs(&PL_sv_undef);
1806 sv_sethek(TARG, stash_hek);
1815 PUSHs(&PL_sv_undef);
1818 sv_sethek(TARG, stash_hek);
1821 mPUSHs(newSVpv(OutCopFILE(cx->blk_oldcop), 0));
1822 lcop = closest_cop(cx->blk_oldcop, OpSIBLING(cx->blk_oldcop),
1823 cx->blk_sub.retop, TRUE);
1825 lcop = cx->blk_oldcop;
1826 mPUSHu(CopLINE(lcop));
1829 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1830 /* So is ccstack[dbcxix]. */
1831 if (CvHASGV(dbcx->blk_sub.cv)) {
1832 PUSHs(cv_name(dbcx->blk_sub.cv, 0, 0));
1833 PUSHs(boolSV(CxHASARGS(cx)));
1836 PUSHs(newSVpvs_flags("(unknown)", SVs_TEMP));
1837 PUSHs(boolSV(CxHASARGS(cx)));
1841 PUSHs(newSVpvs_flags("(eval)", SVs_TEMP));
1844 gimme = (I32)cx->blk_gimme;
1845 if (gimme == G_VOID)
1846 PUSHs(&PL_sv_undef);
1848 PUSHs(boolSV((gimme & G_WANT) == G_ARRAY));
1849 if (CxTYPE(cx) == CXt_EVAL) {
1851 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
1852 SV *cur_text = cx->blk_eval.cur_text;
1853 if (SvCUR(cur_text) >= 2) {
1854 PUSHs(newSVpvn_flags(SvPVX(cur_text), SvCUR(cur_text)-2,
1855 SvUTF8(cur_text)|SVs_TEMP));
1858 /* I think this is will always be "", but be sure */
1859 PUSHs(sv_2mortal(newSVsv(cur_text)));
1865 else if (cx->blk_eval.old_namesv) {
1866 mPUSHs(newSVsv(cx->blk_eval.old_namesv));
1869 /* eval BLOCK (try blocks have old_namesv == 0) */
1871 PUSHs(&PL_sv_undef);
1872 PUSHs(&PL_sv_undef);
1876 PUSHs(&PL_sv_undef);
1877 PUSHs(&PL_sv_undef);
1879 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)
1880 && CopSTASH_eq(PL_curcop, PL_debstash))
1882 /* slot 0 of the pad contains the original @_ */
1883 AV * const ary = MUTABLE_AV(AvARRAY(MUTABLE_AV(
1884 PadlistARRAY(CvPADLIST(cx->blk_sub.cv))[
1885 cx->blk_sub.olddepth+1]))[0]);
1886 const SSize_t off = AvARRAY(ary) - AvALLOC(ary);
1888 Perl_init_dbargs(aTHX);
1890 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1891 av_extend(PL_dbargs, AvFILLp(ary) + off);
1892 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1893 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1895 mPUSHi(CopHINTS_get(cx->blk_oldcop));
1898 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
1900 if (old_warnings == pWARN_NONE)
1901 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1902 else if (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0)
1903 mask = &PL_sv_undef ;
1904 else if (old_warnings == pWARN_ALL ||
1905 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1906 /* Get the bit mask for $warnings::Bits{all}, because
1907 * it could have been extended by warnings::register */
1909 HV * const bits = get_hv("warnings::Bits", 0);
1910 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
1911 mask = newSVsv(*bits_all);
1914 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1918 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
1922 PUSHs(cx->blk_oldcop->cop_hints_hash ?
1923 sv_2mortal(newRV_noinc(MUTABLE_SV(cop_hints_2hv(cx->blk_oldcop, 0))))
1933 if (MAXARG < 1 || (!TOPs && !POPs))
1934 tmps = NULL, len = 0;
1936 tmps = SvPVx_const(POPs, len);
1937 sv_resetpvn(tmps, len, CopSTASH(PL_curcop));
1942 /* like pp_nextstate, but used instead when the debugger is active */
1946 PL_curcop = (COP*)PL_op;
1947 TAINT_NOT; /* Each statement is presumed innocent */
1948 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1953 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1954 || PL_DBsingle_iv || PL_DBsignal_iv || PL_DBtrace_iv)
1958 const I32 gimme = G_ARRAY;
1959 GV * const gv = PL_DBgv;
1962 if (gv && isGV_with_GP(gv))
1965 if (!cv || (!CvROOT(cv) && !CvXSUB(cv)))
1966 DIE(aTHX_ "No DB::DB routine defined");
1968 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1969 /* don't do recursive DB::DB call */
1979 (void)(*CvXSUB(cv))(aTHX_ cv);
1986 PUSHBLOCK(cx, CXt_SUB, SP);
1988 cx->blk_sub.retop = PL_op->op_next;
1989 cx->cx_u.cx_blk.blku_old_savestack_ix = PL_savestack_ix;
1995 if (CvDEPTH(cv) >= 2) {
1996 PERL_STACK_OVERFLOW_CHECK();
1997 pad_push(CvPADLIST(cv), CvDEPTH(cv));
1999 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), CvDEPTH(cv));
2000 RETURNOP(CvSTART(cv));
2007 /* S_leave_common: Common code that many functions in this file use on
2010 Process the return args on the stack in the range (mark+1..PL_stack_sp)
2011 based on context, with any final args starting at newsp+1.
2012 Args are mortal copied (or mortalied if lvalue) unless its safe to use
2013 as-is, based on whether it has the specified flags. Note that most
2014 callers specify flags as (SVs_PADTMP|SVs_TEMP), while leaveeval skips
2015 SVs_PADTMP since its optree gets immediately freed, freeing its padtmps
2018 Also, taintedness is cleared.
2022 S_leave_common(pTHX_ SV **newsp, SV **mark, I32 gimme,
2023 U32 flags, bool lvalue)
2026 PERL_ARGS_ASSERT_LEAVE_COMMON;
2029 if (gimme == G_SCALAR) {
2031 *++newsp = (SvFLAGS(*SP) & flags)
2034 ? sv_2mortal(SvREFCNT_inc_simple_NN(*SP))
2035 : sv_mortalcopy(*SP);
2038 *++newsp = &PL_sv_undef;
2041 else if (gimme == G_ARRAY) {
2042 /* in case LEAVE wipes old return values */
2043 while (++MARK <= SP) {
2044 if (SvFLAGS(*MARK) & flags)
2048 ? sv_2mortal(SvREFCNT_inc_simple_NN(*MARK))
2049 : sv_mortalcopy(*MARK);
2050 TAINT_NOT; /* Each item is independent */
2053 /* When this function was called with MARK == newsp, we reach this
2054 * point with SP == newsp. */
2057 PL_stack_sp = newsp;
2065 I32 gimme = GIMME_V;
2067 PUSHBLOCK(cx, CXt_BLOCK, SP);
2080 cx = &cxstack[cxstack_ix];
2081 assert(CxTYPE(cx) == CXt_BLOCK);
2083 if (PL_op->op_flags & OPf_SPECIAL)
2084 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
2086 newsp = PL_stack_base + cx->blk_oldsp;
2087 gimme = cx->blk_gimme;
2089 if (gimme == G_VOID)
2090 PL_stack_sp = newsp;
2092 leave_common(newsp, newsp, gimme, SVs_PADTMP|SVs_TEMP,
2093 PL_op->op_private & OPpLVALUE);
2097 PL_curpm = newpm; /* Don't pop $1 et al till now */
2104 S_outside_integer(pTHX_ SV *sv)
2107 const NV nv = SvNV_nomg(sv);
2108 if (Perl_isinfnan(nv))
2110 #ifdef NV_PRESERVES_UV
2111 if (nv < (NV)IV_MIN || nv > (NV)IV_MAX)
2114 if (nv <= (NV)IV_MIN)
2117 ((nv > (NV)UV_MAX ||
2118 SvUV_nomg(sv) > (UV)IV_MAX)))
2129 const I32 gimme = GIMME_V;
2130 void *itervarp; /* GV or pad slot of the iteration variable */
2131 SV *itersave; /* the old var in the iterator var slot */
2132 U8 cxtype = CXt_LOOP_FOR;
2134 if (PL_op->op_targ) { /* "my" variable */
2135 itervarp = &PAD_SVl(PL_op->op_targ);
2136 itersave = *(SV**)itervarp;
2138 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
2139 /* the SV currently in the pad slot is never live during
2140 * iteration (the slot is always aliased to one of the items)
2141 * so it's always stale */
2142 SvPADSTALE_on(itersave);
2144 SvREFCNT_inc_simple_void_NN(itersave);
2145 cxtype |= CXp_FOR_PAD;
2148 SV * const sv = POPs;
2149 itervarp = (void *)sv;
2150 if (LIKELY(isGV(sv))) { /* symbol table variable */
2151 SV** svp = &GvSV(sv);
2153 if (LIKELY(itersave))
2154 SvREFCNT_inc_simple_void_NN(itersave);
2157 cxtype |= CXp_FOR_GV;
2159 else { /* LV ref: for \$foo (...) */
2160 assert(SvTYPE(sv) == SVt_PVMG);
2161 assert(SvMAGIC(sv));
2162 assert(SvMAGIC(sv)->mg_type == PERL_MAGIC_lvref);
2164 cxtype |= CXp_FOR_LVREF;
2168 if (PL_op->op_private & OPpITER_DEF)
2169 cxtype |= CXp_FOR_DEF;
2171 PUSHBLOCK(cx, cxtype, SP);
2172 PUSHLOOP_FOR(cx, itervarp, itersave, MARK);
2173 if (PL_op->op_flags & OPf_STACKED) {
2174 SV *maybe_ary = POPs;
2175 if (SvTYPE(maybe_ary) != SVt_PVAV) {
2177 SV * const right = maybe_ary;
2178 if (UNLIKELY(cxtype & CXp_FOR_LVREF))
2179 DIE(aTHX_ "Assigned value is not a reference");
2182 if (RANGE_IS_NUMERIC(sv,right)) {
2183 cx->cx_type &= ~CXTYPEMASK;
2184 cx->cx_type |= CXt_LOOP_LAZYIV;
2185 /* Make sure that no-one re-orders cop.h and breaks our
2187 assert(CxTYPE(cx) == CXt_LOOP_LAZYIV);
2188 if (S_outside_integer(aTHX_ sv) ||
2189 S_outside_integer(aTHX_ right))
2190 DIE(aTHX_ "Range iterator outside integer range");
2191 cx->blk_loop.state_u.lazyiv.cur = SvIV_nomg(sv);
2192 cx->blk_loop.state_u.lazyiv.end = SvIV_nomg(right);
2194 /* for correct -Dstv display */
2195 cx->blk_oldsp = sp - PL_stack_base;
2199 cx->cx_type &= ~CXTYPEMASK;
2200 cx->cx_type |= CXt_LOOP_LAZYSV;
2201 /* Make sure that no-one re-orders cop.h and breaks our
2203 assert(CxTYPE(cx) == CXt_LOOP_LAZYSV);
2204 cx->blk_loop.state_u.lazysv.cur = newSVsv(sv);
2205 cx->blk_loop.state_u.lazysv.end = right;
2206 SvREFCNT_inc(right);
2207 (void) SvPV_force_nolen(cx->blk_loop.state_u.lazysv.cur);
2208 /* This will do the upgrade to SVt_PV, and warn if the value
2209 is uninitialised. */
2210 (void) SvPV_nolen_const(right);
2211 /* Doing this avoids a check every time in pp_iter in pp_hot.c
2212 to replace !SvOK() with a pointer to "". */
2214 SvREFCNT_dec(right);
2215 cx->blk_loop.state_u.lazysv.end = &PL_sv_no;
2219 else /* SvTYPE(maybe_ary) == SVt_PVAV */ {
2220 cx->blk_loop.state_u.ary.ary = MUTABLE_AV(maybe_ary);
2221 SvREFCNT_inc(maybe_ary);
2222 cx->blk_loop.state_u.ary.ix =
2223 (PL_op->op_private & OPpITER_REVERSED) ?
2224 AvFILL(cx->blk_loop.state_u.ary.ary) + 1 :
2228 else { /* iterating over items on the stack */
2229 cx->blk_loop.state_u.ary.ary = NULL; /* means to use the stack */
2230 if (PL_op->op_private & OPpITER_REVERSED) {
2231 cx->blk_loop.state_u.ary.ix = cx->blk_oldsp + 1;
2234 cx->blk_loop.state_u.ary.ix = MARK - PL_stack_base;
2245 const I32 gimme = GIMME_V;
2247 PUSHBLOCK(cx, CXt_LOOP_PLAIN, SP);
2248 PUSHLOOP_PLAIN(cx, SP);
2261 cx = &cxstack[cxstack_ix];
2262 assert(CxTYPE_is_LOOP(cx));
2263 mark = PL_stack_base + cx->blk_oldsp;
2264 newsp = PL_stack_base + cx->blk_loop.resetsp;
2265 gimme = cx->blk_gimme;
2267 if (gimme == G_VOID)
2268 PL_stack_sp = newsp;
2270 leave_common(newsp, MARK, gimme, SVs_PADTMP|SVs_TEMP,
2271 PL_op->op_private & OPpLVALUE);
2273 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
2275 PL_curpm = newpm; /* ... and pop $1 et al */
2282 /* This duplicates most of pp_leavesub, but with additional code to handle
2283 * return args in lvalue context. It was forked from pp_leavesub to
2284 * avoid slowing down that function any further.
2286 * Any changes made to this function may need to be copied to pp_leavesub
2299 const char *what = NULL;
2301 cx = &cxstack[cxstack_ix];
2302 assert(CxTYPE(cx) == CXt_SUB);
2304 if (CxMULTICALL(cx)) {
2305 /* entry zero of a stack is always PL_sv_undef, which
2306 * simplifies converting a '()' return into undef in scalar context */
2307 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef);
2311 newsp = PL_stack_base + cx->blk_oldsp;
2312 gimme = cx->blk_gimme;
2317 ref = !!(CxLVAL(cx) & OPpENTERSUB_INARGS);
2318 if (gimme == G_SCALAR) {
2319 if (CxLVAL(cx) && !ref) { /* Leave it as it is if we can. */
2321 if ((SvPADTMP(TOPs) || SvREADONLY(TOPs)) &&
2322 !SvSMAGICAL(TOPs)) {
2324 SvREADONLY(TOPs) ? (TOPs == &PL_sv_undef) ? "undef"
2325 : "a readonly value" : "a temporary";
2330 /* sub:lvalue{} will take us here. */
2336 PL_curpm = cx->blk_oldpm;
2338 "Can't return %s from lvalue subroutine", what
2343 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2344 if (!SvPADTMP(*SP)) {
2345 *MARK = SvREFCNT_inc(*SP);
2350 /* FREETMPS could clobber it */
2351 SV *sv = SvREFCNT_inc(*SP);
2353 *MARK = sv_mortalcopy(sv);
2360 ? sv_mortalcopy(*SP)
2362 ? sv_2mortal(SvREFCNT_inc_simple_NN(*SP))
2367 *MARK = &PL_sv_undef;
2371 if (CxLVAL(cx) & OPpDEREF) {
2374 TOPs = vivify_ref(TOPs, CxLVAL(cx) & OPpDEREF);
2378 else if (gimme == G_ARRAY) {
2379 assert (!(CxLVAL(cx) & OPpDEREF));
2380 if (ref || !CxLVAL(cx))
2381 for (; MARK <= SP; MARK++)
2383 SvFLAGS(*MARK) & SVs_PADTMP
2384 ? sv_mortalcopy(*MARK)
2387 : sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
2388 else for (; MARK <= SP; MARK++) {
2389 if (*MARK != &PL_sv_undef
2390 && (SvPADTMP(*MARK) || SvREADONLY(*MARK))
2392 /* Might be flattened array after $#array = */
2393 what = SvREADONLY(*MARK)
2394 ? "a readonly value" : "a temporary";
2397 else if (!SvTEMP(*MARK))
2398 *MARK = sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
2403 POPSUB(cx); /* Stack values are safe: release CV and @_ ... */
2405 PL_curpm = newpm; /* ... and pop $1 et al */
2408 return cx->blk_sub.retop;
2416 const I32 cxix = dopoptosub(cxstack_ix);
2418 assert(cxstack_ix >= 0);
2419 if (cxix < cxstack_ix) {
2421 if (!CxMULTICALL(cxstack))
2422 DIE(aTHX_ "Can't return outside a subroutine");
2423 /* We must be in a sort block, which is a CXt_NULL not a
2424 * CXt_SUB. Handle specially. */
2425 if (cxstack_ix > 0) {
2426 /* See comment below about context popping. Since we know
2427 * we're scalar and not lvalue, we can preserve the return
2428 * value in a simpler fashion than there. */
2430 assert(cxstack[0].blk_gimme == G_SCALAR);
2431 if ( (sp != PL_stack_base)
2432 && !(SvFLAGS(sv) & (SVs_TEMP|SVs_PADTMP))
2434 *SP = sv_mortalcopy(sv);
2437 /* caller responsible for popping cxstack[0] */
2441 /* There are contexts that need popping. Doing this may free the
2442 * return value(s), so preserve them first, e.g. popping the plain
2443 * loop here would free $x:
2444 * sub f { { my $x = 1; return $x } }
2445 * We may also need to shift the args down; for example,
2446 * for (1,2) { return 3,4 }
2447 * leaves 1,2,3,4 on the stack. Both these actions can be done by
2448 * leave_common(). By calling it with lvalue=TRUE, we just bump
2449 * the ref count and mortalise the args that need it. The "scan
2450 * the args and maybe copy them" process will be repeated by
2451 * whoever we tail-call (e.g. pp_leaveeval), where any copying etc
2452 * will be done. That is to say, in this code path two scans of
2453 * the args will be done; the first just shifts and preserves; the
2454 * second is the "real" arg processing, based on the type of
2457 cx = &cxstack[cxix];
2459 leave_common(PL_stack_base + cx->blk_oldsp, MARK,
2460 cx->blk_gimme, SVs_TEMP|SVs_PADTMP, TRUE);
2465 /* Like in the branch above, we need to handle any extra junk on
2466 * the stack. But because we're not also popping extra contexts, we
2467 * don't have to worry about prematurely freeing args. So we just
2468 * need to do the bare minimum to handle junk, and leave the main
2469 * arg processing in the function we tail call, e.g. pp_leavesub.
2470 * In list context we have to splice out the junk; in scalar
2471 * context we can leave as-is (pp_leavesub will later return the
2472 * top stack element). But for an empty arg list, e.g.
2473 * for (1,2) { return }
2474 * we need to set sp = oldsp so that pp_leavesub knows to push
2475 * &PL_sv_undef onto the stack.
2478 cx = &cxstack[cxix];
2479 oldsp = PL_stack_base + cx->blk_oldsp;
2480 if (oldsp != MARK) {
2481 SSize_t nargs = SP - MARK;
2483 if (cx->blk_gimme == G_ARRAY) {
2484 /* shift return args to base of call stack frame */
2485 Move(MARK + 1, oldsp + 1, nargs, SV*);
2486 PL_stack_sp = oldsp + nargs;
2490 PL_stack_sp = oldsp;
2494 /* fall through to a normal exit */
2495 switch (CxTYPE(cx)) {
2497 return CxTRYBLOCK(cx)
2498 ? Perl_pp_leavetry(aTHX)
2499 : Perl_pp_leaveeval(aTHX);
2501 return CvLVALUE(cx->blk_sub.cv)
2502 ? Perl_pp_leavesublv(aTHX)
2503 : Perl_pp_leavesub(aTHX);
2505 return Perl_pp_leavewrite(aTHX);
2507 DIE(aTHX_ "panic: return, type=%u", (unsigned) CxTYPE(cx));
2513 S_unwind_loop(pTHX_ const char * const opname)
2516 if (PL_op->op_flags & OPf_SPECIAL) {
2517 cxix = dopoptoloop(cxstack_ix);
2519 /* diag_listed_as: Can't "last" outside a loop block */
2520 Perl_croak(aTHX_ "Can't \"%s\" outside a loop block", opname);
2525 const char * const label =
2526 PL_op->op_flags & OPf_STACKED
2527 ? SvPV(TOPs,label_len)
2528 : (label_len = strlen(cPVOP->op_pv), cPVOP->op_pv);
2529 const U32 label_flags =
2530 PL_op->op_flags & OPf_STACKED
2532 : (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0;
2534 cxix = dopoptolabel(label, label_len, label_flags);
2536 /* diag_listed_as: Label not found for "last %s" */
2537 Perl_croak(aTHX_ "Label not found for \"%s %"SVf"\"",
2539 SVfARG(PL_op->op_flags & OPf_STACKED
2540 && !SvGMAGICAL(TOPp1s)
2542 : newSVpvn_flags(label,
2544 label_flags | SVs_TEMP)));
2546 if (cxix < cxstack_ix)
2556 S_unwind_loop(aTHX_ "last");
2558 cx = &cxstack[cxstack_ix];
2561 CxTYPE(cx) == CXt_LOOP_LAZYIV
2562 || CxTYPE(cx) == CXt_LOOP_LAZYSV
2563 || CxTYPE(cx) == CXt_LOOP_FOR
2564 || CxTYPE(cx) == CXt_LOOP_PLAIN
2566 PL_stack_sp = PL_stack_base + cx->blk_loop.resetsp;
2570 /* Stack values are safe: */
2571 POPLOOP(cx); /* release loop vars ... */
2573 PL_curpm = newpm; /* ... and pop $1 et al */
2576 return cx->blk_loop.my_op->op_lastop->op_next;
2583 S_unwind_loop(aTHX_ "next");
2586 PL_curcop = cx->blk_oldcop;
2588 return (cx)->blk_loop.my_op->op_nextop;
2593 const I32 cxix = S_unwind_loop(aTHX_ "redo");
2595 OP* redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
2597 if (redo_op->op_type == OP_ENTER) {
2598 /* pop one less context to avoid $x being freed in while (my $x..) */
2600 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2601 redo_op = redo_op->op_next;
2607 PL_curcop = cx->blk_oldcop;
2613 S_dofindlabel(pTHX_ OP *o, const char *label, STRLEN len, U32 flags, OP **opstack, OP **oplimit)
2616 static const char* const too_deep = "Target of goto is too deeply nested";
2618 PERL_ARGS_ASSERT_DOFINDLABEL;
2621 Perl_croak(aTHX_ "%s", too_deep);
2622 if (o->op_type == OP_LEAVE ||
2623 o->op_type == OP_SCOPE ||
2624 o->op_type == OP_LEAVELOOP ||
2625 o->op_type == OP_LEAVESUB ||
2626 o->op_type == OP_LEAVETRY)
2628 *ops++ = cUNOPo->op_first;
2630 Perl_croak(aTHX_ "%s", too_deep);
2633 if (o->op_flags & OPf_KIDS) {
2635 /* First try all the kids at this level, since that's likeliest. */
2636 for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) {
2637 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2638 STRLEN kid_label_len;
2639 U32 kid_label_flags;
2640 const char *kid_label = CopLABEL_len_flags(kCOP,
2641 &kid_label_len, &kid_label_flags);
2643 ( (kid_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ?
2646 (const U8*)kid_label, kid_label_len,
2647 (const U8*)label, len) == 0)
2649 (const U8*)label, len,
2650 (const U8*)kid_label, kid_label_len) == 0)
2651 : ( len == kid_label_len && ((kid_label == label)
2652 || memEQ(kid_label, label, len)))))
2656 for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) {
2657 if (kid == PL_lastgotoprobe)
2659 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2662 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2663 ops[-1]->op_type == OP_DBSTATE)
2668 if ((o = dofindlabel(kid, label, len, flags, ops, oplimit)))
2677 /* also used for: pp_dump() */
2685 #define GOTO_DEPTH 64
2686 OP *enterops[GOTO_DEPTH];
2687 const char *label = NULL;
2688 STRLEN label_len = 0;
2689 U32 label_flags = 0;
2690 const bool do_dump = (PL_op->op_type == OP_DUMP);
2691 static const char* const must_have_label = "goto must have label";
2693 if (PL_op->op_flags & OPf_STACKED) {
2694 /* goto EXPR or goto &foo */
2696 SV * const sv = POPs;
2699 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2700 /* This egregious kludge implements goto &subroutine */
2703 CV *cv = MUTABLE_CV(SvRV(sv));
2704 AV *arg = GvAV(PL_defgv);
2706 while (!CvROOT(cv) && !CvXSUB(cv)) {
2707 const GV * const gv = CvGV(cv);
2711 /* autoloaded stub? */
2712 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2714 autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv),
2716 GvNAMEUTF8(gv) ? SVf_UTF8 : 0);
2717 if (autogv && (cv = GvCV(autogv)))
2719 tmpstr = sv_newmortal();
2720 gv_efullname3(tmpstr, gv, NULL);
2721 DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr));
2723 DIE(aTHX_ "Goto undefined subroutine");
2726 cxix = dopoptosub(cxstack_ix);
2728 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2730 cx = &cxstack[cxix];
2731 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2732 if (CxTYPE(cx) == CXt_EVAL) {
2734 /* diag_listed_as: Can't goto subroutine from an eval-%s */
2735 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2737 /* diag_listed_as: Can't goto subroutine from an eval-%s */
2738 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2740 else if (CxMULTICALL(cx))
2741 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
2743 /* First do some returnish stuff. */
2745 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
2747 if (cxix < cxstack_ix) {
2753 /* partial unrolled POPSUB(): */
2755 /* protect @_ during save stack unwind. */
2757 SvREFCNT_inc_NN(sv_2mortal(MUTABLE_SV(arg)));
2759 assert(PL_scopestack_ix == cx->blk_oldscopesp);
2762 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
2763 AV* av = MUTABLE_AV(PAD_SVl(0));
2764 assert(AvARRAY(MUTABLE_AV(
2765 PadlistARRAY(CvPADLIST(cx->blk_sub.cv))[
2766 CvDEPTH(cx->blk_sub.cv)])) == PL_curpad);
2768 /* we are going to donate the current @_ from the old sub
2769 * to the new sub. This first part of the donation puts a
2770 * new empty AV in the pad[0] slot of the old sub,
2771 * unless pad[0] and @_ differ (e.g. if the old sub did
2772 * local *_ = []); in which case clear the old pad[0]
2773 * array in the usual way */
2774 if (av == arg || AvREAL(av))
2775 clear_defarray(av, av == arg);
2776 else CLEAR_ARGARRAY(av);
2779 /* don't restore PL_comppad here. It won't be needed if the
2780 * sub we're going to is non-XS, but restoring it early then
2781 * croaking (e.g. the "Goto undefined subroutine" below)
2782 * means the CX block gets processed again in dounwind,
2783 * but this time with the wrong PL_comppad */
2785 /* A destructor called during LEAVE_SCOPE could have undefined
2786 * our precious cv. See bug #99850. */
2787 if (!CvROOT(cv) && !CvXSUB(cv)) {
2788 const GV * const gv = CvGV(cv);
2790 SV * const tmpstr = sv_newmortal();
2791 gv_efullname3(tmpstr, gv, NULL);
2792 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",
2795 DIE(aTHX_ "Goto undefined subroutine");
2798 if (CxTYPE(cx) == CXt_SUB) {
2799 CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth;
2800 SvREFCNT_dec_NN(cx->blk_sub.cv);
2803 /* Now do some callish stuff. */
2805 const SSize_t items = arg ? AvFILL(arg) + 1 : 0;
2806 const bool m = arg ? cBOOL(SvRMAGICAL(arg)) : 0;
2811 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2813 /* put GvAV(defgv) back onto stack */
2815 EXTEND(SP, items+1); /* @_ could have been extended. */
2820 bool r = cBOOL(AvREAL(arg));
2821 for (index=0; index<items; index++)
2825 SV ** const svp = av_fetch(arg, index, 0);
2826 sv = svp ? *svp : NULL;
2828 else sv = AvARRAY(arg)[index];
2830 ? r ? SvREFCNT_inc_NN(sv_2mortal(sv)) : sv
2831 : sv_2mortal(newSVavdefelem(arg, index, 1));
2835 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
2836 /* Restore old @_ */
2840 retop = cx->blk_sub.retop;
2841 PL_comppad = cx->blk_sub.prevcomppad;
2842 PL_curpad = LIKELY(PL_comppad) ? AvARRAY(PL_comppad) : NULL;
2844 /* XS subs don't have a CXt_SUB, so pop it;
2845 * this is a POPBLOCK(), less all the stuff we already did
2846 * for TOPBLOCK() earlier */
2847 PL_curcop = cx->blk_oldcop;
2850 /* Push a mark for the start of arglist */
2853 (void)(*CvXSUB(cv))(aTHX_ cv);
2858 PADLIST * const padlist = CvPADLIST(cv);
2860 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2862 /* partial unrolled PUSHSUB(): */
2864 cx->blk_sub.cv = cv;
2865 cx->blk_sub.olddepth = CvDEPTH(cv);
2868 SvREFCNT_inc_simple_void_NN(cv);
2869 if (CvDEPTH(cv) > 1) {
2870 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION))
2871 sub_crush_depth(cv);
2872 pad_push(padlist, CvDEPTH(cv));
2874 PL_curcop = cx->blk_oldcop;
2875 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2878 /* second half of donating @_ from the old sub to the
2879 * new sub: abandon the original pad[0] AV in the
2880 * new sub, and replace it with the donated @_.
2881 * pad[0] takes ownership of the extra refcount
2882 * we gave arg earlier */
2884 SvREFCNT_dec(PAD_SVl(0));
2885 PAD_SVl(0) = (SV *)arg;
2886 SvREFCNT_inc_simple_void_NN(arg);
2889 /* GvAV(PL_defgv) might have been modified on scope
2890 exit, so point it at arg again. */
2891 if (arg != GvAV(PL_defgv)) {
2892 AV * const av = GvAV(PL_defgv);
2893 GvAV(PL_defgv) = (AV *)SvREFCNT_inc_simple(arg);
2898 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2899 Perl_get_db_sub(aTHX_ NULL, cv);
2901 CV * const gotocv = get_cvs("DB::goto", 0);
2903 PUSHMARK( PL_stack_sp );
2904 call_sv(MUTABLE_SV(gotocv), G_SCALAR | G_NODEBUG);
2909 retop = CvSTART(cv);
2910 goto putback_return;
2915 label = SvPV_nomg_const(sv, label_len);
2916 label_flags = SvUTF8(sv);
2919 else if (!(PL_op->op_flags & OPf_SPECIAL)) {
2920 /* goto LABEL or dump LABEL */
2921 label = cPVOP->op_pv;
2922 label_flags = (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0;
2923 label_len = strlen(label);
2925 if (!(do_dump || label_len)) DIE(aTHX_ "%s", must_have_label);
2930 OP *gotoprobe = NULL;
2931 bool leaving_eval = FALSE;
2932 bool in_block = FALSE;
2933 PERL_CONTEXT *last_eval_cx = NULL;
2937 PL_lastgotoprobe = NULL;
2939 for (ix = cxstack_ix; ix >= 0; ix--) {
2941 switch (CxTYPE(cx)) {
2943 leaving_eval = TRUE;
2944 if (!CxTRYBLOCK(cx)) {
2945 gotoprobe = (last_eval_cx ?
2946 last_eval_cx->blk_eval.old_eval_root :
2951 /* else fall through */
2952 case CXt_LOOP_LAZYIV:
2953 case CXt_LOOP_LAZYSV:
2955 case CXt_LOOP_PLAIN:
2958 gotoprobe = OpSIBLING(cx->blk_oldcop);
2964 gotoprobe = OpSIBLING(cx->blk_oldcop);
2967 gotoprobe = PL_main_root;
2970 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
2971 gotoprobe = CvROOT(cx->blk_sub.cv);
2977 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2980 DIE(aTHX_ "panic: goto, type=%u, ix=%ld",
2981 CxTYPE(cx), (long) ix);
2982 gotoprobe = PL_main_root;
2988 retop = dofindlabel(gotoprobe, label, label_len, label_flags,
2989 enterops, enterops + GOTO_DEPTH);
2992 if ( (sibl1 = OpSIBLING(gotoprobe)) &&
2993 sibl1->op_type == OP_UNSTACK &&
2994 (sibl2 = OpSIBLING(sibl1)))
2996 retop = dofindlabel(sibl2,
2997 label, label_len, label_flags, enterops,
2998 enterops + GOTO_DEPTH);
3003 PL_lastgotoprobe = gotoprobe;
3006 DIE(aTHX_ "Can't find label %"UTF8f,
3007 UTF8fARG(label_flags, label_len, label));
3009 /* if we're leaving an eval, check before we pop any frames
3010 that we're not going to punt, otherwise the error
3013 if (leaving_eval && *enterops && enterops[1]) {
3015 for (i = 1; enterops[i]; i++)
3016 if (enterops[i]->op_type == OP_ENTERITER)
3017 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
3020 if (*enterops && enterops[1]) {
3021 I32 i = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3023 deprecate("\"goto\" to jump into a construct");
3026 /* pop unwanted frames */
3028 if (ix < cxstack_ix) {
3030 DIE(aTHX_ "panic: docatch: illegal ix=%ld", (long)ix);
3035 /* push wanted frames */
3037 if (*enterops && enterops[1]) {
3038 OP * const oldop = PL_op;
3039 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3040 for (; enterops[ix]; ix++) {
3041 PL_op = enterops[ix];
3042 /* Eventually we may want to stack the needed arguments
3043 * for each op. For now, we punt on the hard ones. */
3044 if (PL_op->op_type == OP_ENTERITER)
3045 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
3046 PL_op->op_ppaddr(aTHX);
3054 if (!retop) retop = PL_main_start;
3056 PL_restartop = retop;
3057 PL_do_undump = TRUE;
3061 PL_restartop = 0; /* hmm, must be GNU unexec().. */
3062 PL_do_undump = FALSE;
3080 anum = 0; (void)POPs;
3086 && SvTRUE(cop_hints_fetch_pvs(PL_curcop, "vmsish_exit", 0)))
3089 VMSISH_HUSHED || (PL_curcop->op_private & OPpHUSH_VMSISH);
3092 PL_exit_flags |= PERL_EXIT_EXPECTED;
3094 PUSHs(&PL_sv_undef);
3101 S_save_lines(pTHX_ AV *array, SV *sv)
3103 const char *s = SvPVX_const(sv);
3104 const char * const send = SvPVX_const(sv) + SvCUR(sv);
3107 PERL_ARGS_ASSERT_SAVE_LINES;
3109 while (s && s < send) {
3111 SV * const tmpstr = newSV_type(SVt_PVMG);
3113 t = (const char *)memchr(s, '\n', send - s);
3119 sv_setpvn(tmpstr, s, t - s);
3120 av_store(array, line++, tmpstr);
3128 Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context.
3130 0 is used as continue inside eval,
3132 3 is used for a die caught by an inner eval - continue inner loop
3134 See F<cop.h>: je_mustcatch, when set at any runlevel to TRUE, means eval ops must
3135 establish a local jmpenv to handle exception traps.
3140 S_docatch(pTHX_ OP *o)
3143 OP * const oldop = PL_op;
3147 assert(CATCH_GET == TRUE);
3154 assert(cxstack_ix >= 0);
3155 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3156 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
3161 /* die caught by an inner eval - continue inner loop */
3162 if (PL_restartop && PL_restartjmpenv == PL_top_env) {
3163 PL_restartjmpenv = NULL;
3164 PL_op = PL_restartop;
3173 NOT_REACHED; /* NOTREACHED */
3182 =for apidoc find_runcv
3184 Locate the CV corresponding to the currently executing sub or eval.
3185 If C<db_seqp> is non_null, skip CVs that are in the DB package and populate
3186 C<*db_seqp> with the cop sequence number at the point that the DB:: code was
3187 entered. (This allows debuggers to eval in the scope of the breakpoint
3188 rather than in the scope of the debugger itself.)
3194 Perl_find_runcv(pTHX_ U32 *db_seqp)
3196 return Perl_find_runcv_where(aTHX_ 0, 0, db_seqp);
3199 /* If this becomes part of the API, it might need a better name. */
3201 Perl_find_runcv_where(pTHX_ U8 cond, IV arg, U32 *db_seqp)
3208 PL_curcop == &PL_compiling
3210 : PL_curcop->cop_seq;
3212 for (si = PL_curstackinfo; si; si = si->si_prev) {
3214 for (ix = si->si_cxix; ix >= 0; ix--) {
3215 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
3217 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
3218 cv = cx->blk_sub.cv;
3219 /* skip DB:: code */
3220 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
3221 *db_seqp = cx->blk_oldcop->cop_seq;
3224 if (cx->cx_type & CXp_SUB_RE)
3227 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
3228 cv = cx->blk_eval.cv;
3231 case FIND_RUNCV_padid_eq:
3233 || CvPADLIST(cv)->xpadl_id != (U32)arg)
3236 case FIND_RUNCV_level_eq:
3237 if (level++ != arg) continue;
3245 return cond == FIND_RUNCV_padid_eq ? NULL : PL_main_cv;
3249 /* Run yyparse() in a setjmp wrapper. Returns:
3250 * 0: yyparse() successful
3251 * 1: yyparse() failed
3255 S_try_yyparse(pTHX_ int gramtype)
3260 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3264 ret = yyparse(gramtype) ? 1 : 0;
3271 NOT_REACHED; /* NOTREACHED */
3278 /* Compile a require/do or an eval ''.
3280 * outside is the lexically enclosing CV (if any) that invoked us.
3281 * seq is the current COP scope value.
3282 * hh is the saved hints hash, if any.
3284 * Returns a bool indicating whether the compile was successful; if so,
3285 * PL_eval_start contains the first op of the compiled code; otherwise,
3288 * This function is called from two places: pp_require and pp_entereval.
3289 * These can be distinguished by whether PL_op is entereval.
3293 S_doeval(pTHX_ int gimme, CV* outside, U32 seq, HV *hh)
3296 OP * const saveop = PL_op;
3297 bool clear_hints = saveop->op_type != OP_ENTEREVAL;
3298 COP * const oldcurcop = PL_curcop;
3299 bool in_require = (saveop->op_type == OP_REQUIRE);
3303 PL_in_eval = (in_require
3304 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
3306 ((PL_op->op_private & OPpEVAL_RE_REPARSING)
3307 ? EVAL_RE_REPARSING : 0)));
3311 evalcv = MUTABLE_CV(newSV_type(SVt_PVCV));
3313 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3314 cxstack[cxstack_ix].blk_eval.cv = evalcv;
3315 cxstack[cxstack_ix].blk_gimme = gimme;
3317 CvOUTSIDE_SEQ(evalcv) = seq;
3318 CvOUTSIDE(evalcv) = MUTABLE_CV(SvREFCNT_inc_simple(outside));
3320 /* set up a scratch pad */
3322 CvPADLIST_set(evalcv, pad_new(padnew_SAVE));
3323 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
3326 SAVEMORTALIZESV(evalcv); /* must remain until end of current statement */
3328 /* make sure we compile in the right package */
3330 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
3331 SAVEGENERICSV(PL_curstash);
3332 PL_curstash = (HV *)CopSTASH(PL_curcop);
3333 if (SvTYPE(PL_curstash) != SVt_PVHV) PL_curstash = NULL;
3334 else SvREFCNT_inc_simple_void(PL_curstash);
3336 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
3337 SAVESPTR(PL_beginav);
3338 PL_beginav = newAV();
3339 SAVEFREESV(PL_beginav);
3340 SAVESPTR(PL_unitcheckav);
3341 PL_unitcheckav = newAV();
3342 SAVEFREESV(PL_unitcheckav);
3345 ENTER_with_name("evalcomp");
3346 SAVESPTR(PL_compcv);
3349 /* try to compile it */
3351 PL_eval_root = NULL;
3352 PL_curcop = &PL_compiling;
3353 if ((saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
3354 PL_in_eval |= EVAL_KEEPERR;
3361 hv_clear(GvHV(PL_hintgv));
3364 PL_hints = saveop->op_private & OPpEVAL_COPHH
3365 ? oldcurcop->cop_hints : saveop->op_targ;
3367 /* making 'use re eval' not be in scope when compiling the
3368 * qr/mabye_has_runtime_code_block/ ensures that we don't get
3369 * infinite recursion when S_has_runtime_code() gives a false
3370 * positive: the second time round, HINT_RE_EVAL isn't set so we
3371 * don't bother calling S_has_runtime_code() */
3372 if (PL_in_eval & EVAL_RE_REPARSING)
3373 PL_hints &= ~HINT_RE_EVAL;
3376 /* SAVEHINTS created a new HV in PL_hintgv, which we need to GC */
3377 SvREFCNT_dec(GvHV(PL_hintgv));
3378 GvHV(PL_hintgv) = hh;
3381 SAVECOMPILEWARNINGS();
3383 if (PL_dowarn & G_WARN_ALL_ON)
3384 PL_compiling.cop_warnings = pWARN_ALL ;
3385 else if (PL_dowarn & G_WARN_ALL_OFF)
3386 PL_compiling.cop_warnings = pWARN_NONE ;
3388 PL_compiling.cop_warnings = pWARN_STD ;
3391 PL_compiling.cop_warnings =
3392 DUP_WARNINGS(oldcurcop->cop_warnings);
3393 cophh_free(CopHINTHASH_get(&PL_compiling));
3394 if (Perl_cop_fetch_label(aTHX_ oldcurcop, NULL, NULL)) {
3395 /* The label, if present, is the first entry on the chain. So rather
3396 than writing a blank label in front of it (which involves an
3397 allocation), just use the next entry in the chain. */
3398 PL_compiling.cop_hints_hash
3399 = cophh_copy(oldcurcop->cop_hints_hash->refcounted_he_next);
3400 /* Check the assumption that this removed the label. */
3401 assert(Perl_cop_fetch_label(aTHX_ &PL_compiling, NULL, NULL) == NULL);
3404 PL_compiling.cop_hints_hash = cophh_copy(oldcurcop->cop_hints_hash);
3407 CALL_BLOCK_HOOKS(bhk_eval, saveop);
3409 /* note that yyparse() may raise an exception, e.g. C<BEGIN{die}>,
3410 * so honour CATCH_GET and trap it here if necessary */
3412 yystatus = (!in_require && CATCH_GET) ? S_try_yyparse(aTHX_ GRAMPROG) : yyparse(GRAMPROG);
3414 if (yystatus || PL_parser->error_count || !PL_eval_root) {
3416 I32 optype; /* Used by POPEVAL. */
3422 PERL_UNUSED_VAR(optype);
3424 /* note that if yystatus == 3, then the EVAL CX block has already
3425 * been popped, and various vars restored */
3427 if (yystatus != 3) {
3429 op_free(PL_eval_root);
3430 PL_eval_root = NULL;
3432 SP = PL_stack_base + POPMARK; /* pop original mark */
3433 cx = &cxstack[cxstack_ix];
3435 POPBLOCK(cx,PL_curpm);
3437 namesv = cx->blk_eval.old_namesv;
3443 /* If cx is still NULL, it means that we didn't go in the
3444 * POPEVAL branch. */
3445 cx = &cxstack[cxstack_ix];
3446 assert(CxTYPE(cx) == CXt_EVAL);
3447 namesv = cx->blk_eval.old_namesv;
3449 (void)hv_store(GvHVn(PL_incgv),
3450 SvPVX_const(namesv),
3451 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
3453 Perl_croak(aTHX_ "%"SVf"Compilation failed in require",
3456 : newSVpvs_flags("Unknown error\n", SVs_TEMP)));
3459 if (!*(SvPV_nolen_const(errsv))) {
3460 sv_setpvs(errsv, "Compilation error");
3463 if (gimme != G_ARRAY) PUSHs(&PL_sv_undef);
3468 LEAVE_with_name("evalcomp");
3470 CopLINE_set(&PL_compiling, 0);
3471 SAVEFREEOP(PL_eval_root);
3472 cv_forget_slab(evalcv);
3474 DEBUG_x(dump_eval());
3476 /* Register with debugger: */
3477 if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
3478 CV * const cv = get_cvs("DB::postponed", 0);
3482 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3484 call_sv(MUTABLE_SV(cv), G_DISCARD);
3488 if (PL_unitcheckav) {
3489 OP *es = PL_eval_start;
3490 call_list(PL_scopestack_ix, PL_unitcheckav);
3494 /* compiled okay, so do it */
3496 CvDEPTH(evalcv) = 1;
3497 SP = PL_stack_base + POPMARK; /* pop original mark */
3498 PL_op = saveop; /* The caller may need it. */
3499 PL_parser->lex_state = LEX_NOTPARSING; /* $^S needs this. */
3506 S_check_type_and_open(pTHX_ SV *name)
3511 const char *p = SvPV_const(name, len);
3514 PERL_ARGS_ASSERT_CHECK_TYPE_AND_OPEN;
3516 /* checking here captures a reasonable error message when
3517 * PERL_DISABLE_PMC is true, but when PMC checks are enabled, the
3518 * user gets a confusing message about looking for the .pmc file
3519 * rather than for the .pm file so do the check in S_doopen_pm when
3520 * PMC is on instead of here. S_doopen_pm calls this func.
3521 * This check prevents a \0 in @INC causing problems.
3523 #ifdef PERL_DISABLE_PMC
3524 if (!IS_SAFE_PATHNAME(p, len, "require"))
3528 /* on Win32 stat is expensive (it does an open() and close() twice and
3529 a couple other IO calls), the open will fail with a dir on its own with
3530 errno EACCES, so only do a stat to separate a dir from a real EACCES
3531 caused by user perms */
3533 /* we use the value of errno later to see how stat() or open() failed.
3534 * We don't want it set if the stat succeeded but we still failed,
3535 * such as if the name exists, but is a directory */
3538 st_rc = PerlLIO_stat(p, &st);
3540 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
3545 retio = PerlIO_openn(aTHX_ ":", PERL_SCRIPT_MODE, -1, 0, 0, NULL, 1, &name);
3547 /* EACCES stops the INC search early in pp_require to implement
3548 feature RT #113422 */
3549 if(!retio && errno == EACCES) { /* exists but probably a directory */
3551 st_rc = PerlLIO_stat(p, &st);
3553 if(S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode))
3564 #ifndef PERL_DISABLE_PMC
3566 S_doopen_pm(pTHX_ SV *name)
3569 const char *p = SvPV_const(name, namelen);
3571 PERL_ARGS_ASSERT_DOOPEN_PM;
3573 /* check the name before trying for the .pmc name to avoid the
3574 * warning referring to the .pmc which the user probably doesn't
3575 * know or care about
3577 if (!IS_SAFE_PATHNAME(p, namelen, "require"))
3580 if (namelen > 3 && memEQs(p + namelen - 3, 3, ".pm")) {
3581 SV *const pmcsv = sv_newmortal();
3584 SvSetSV_nosteal(pmcsv,name);
3585 sv_catpvs(pmcsv, "c");
3587 pmcio = check_type_and_open(pmcsv);
3591 return check_type_and_open(name);
3594 # define doopen_pm(name) check_type_and_open(name)
3595 #endif /* !PERL_DISABLE_PMC */
3597 /* require doesn't search for absolute names, or when the name is
3598 explicitly relative the current directory */
3599 PERL_STATIC_INLINE bool
3600 S_path_is_searchable(const char *name)
3602 PERL_ARGS_ASSERT_PATH_IS_SEARCHABLE;
3604 if (PERL_FILE_IS_ABSOLUTE(name)
3606 || (*name == '.' && ((name[1] == '/' ||
3607 (name[1] == '.' && name[2] == '/'))
3608 || (name[1] == '\\' ||
3609 ( name[1] == '.' && name[2] == '\\')))
3612 || (*name == '.' && (name[1] == '/' ||
3613 (name[1] == '.' && name[2] == '/')))
3624 /* also used for: pp_dofile() */
3636 int vms_unixname = 0;
3639 const char *tryname = NULL;
3641 const I32 gimme = GIMME_V;
3642 int filter_has_file = 0;
3643 PerlIO *tryrsfp = NULL;
3644 SV *filter_cache = NULL;
3645 SV *filter_state = NULL;
3646 SV *filter_sub = NULL;
3650 bool path_searchable;
3651 I32 old_savestack_ix;
3655 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3656 sv = sv_2mortal(new_version(sv));
3657 if (!Perl_sv_derived_from_pvn(aTHX_ PL_patchlevel, STR_WITH_LEN("version"), 0))
3658 upg_version(PL_patchlevel, TRUE);
3659 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3660 if ( vcmp(sv,PL_patchlevel) <= 0 )
3661 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
3662 SVfARG(sv_2mortal(vnormal(sv))),
3663 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3667 if ( vcmp(sv,PL_patchlevel) > 0 ) {
3670 SV * const req = SvRV(sv);
3671 SV * const pv = *hv_fetchs(MUTABLE_HV(req), "original", FALSE);
3673 /* get the left hand term */
3674 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(req), "version", FALSE)));
3676 first = SvIV(*av_fetch(lav,0,0));
3677 if ( first > (int)PERL_REVISION /* probably 'use 6.0' */
3678 || hv_exists(MUTABLE_HV(req), "qv", 2 ) /* qv style */
3679 || av_tindex(lav) > 1 /* FP with > 3 digits */
3680 || strstr(SvPVX(pv),".0") /* FP with leading 0 */
3682 DIE(aTHX_ "Perl %"SVf" required--this is only "
3684 SVfARG(sv_2mortal(vnormal(req))),
3685 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3688 else { /* probably 'use 5.10' or 'use 5.8' */
3692 if (av_tindex(lav)>=1)
3693 second = SvIV(*av_fetch(lav,1,0));
3695 second /= second >= 600 ? 100 : 10;
3696 hintsv = Perl_newSVpvf(aTHX_ "v%d.%d.0",
3697 (int)first, (int)second);
3698 upg_version(hintsv, TRUE);
3700 DIE(aTHX_ "Perl %"SVf" required (did you mean %"SVf"?)"
3701 "--this is only %"SVf", stopped",
3702 SVfARG(sv_2mortal(vnormal(req))),
3703 SVfARG(sv_2mortal(vnormal(sv_2mortal(hintsv)))),
3704 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3713 DIE(aTHX_ "Missing or undefined argument to require");
3714 name = SvPV_nomg_const(sv, len);
3715 if (!(name && len > 0 && *name))
3716 DIE(aTHX_ "Missing or undefined argument to require");
3718 if (!IS_SAFE_PATHNAME(name, len, "require")) {
3719 DIE(aTHX_ "Can't locate %s: %s",
3720 pv_escape(newSVpvs_flags("",SVs_TEMP),SvPVX(sv),SvCUR(sv),
3721 SvCUR(sv)*2,NULL, SvUTF8(sv)?PERL_PV_ESCAPE_UNI:0),
3724 TAINT_PROPER("require");
3726 path_searchable = path_is_searchable(name);
3729 /* The key in the %ENV hash is in the syntax of file passed as the argument
3730 * usually this is in UNIX format, but sometimes in VMS format, which
3731 * can result in a module being pulled in more than once.
3732 * To prevent this, the key must be stored in UNIX format if the VMS
3733 * name can be translated to UNIX.
3737 tounixspec(name, SvPVX(sv_2mortal(newSVpv("", VMS_MAXRSS-1)))))
3739 unixlen = strlen(unixname);
3745 /* if not VMS or VMS name can not be translated to UNIX, pass it
3748 unixname = (char *) name;
3751 if (PL_op->op_type == OP_REQUIRE) {
3752 SV * const * const svp = hv_fetch(GvHVn(PL_incgv),
3753 unixname, unixlen, 0);
3755 if (*svp != &PL_sv_undef)
3758 DIE(aTHX_ "Attempt to reload %s aborted.\n"
3759 "Compilation failed in require", unixname);
3763 LOADING_FILE_PROBE(unixname);
3765 /* prepare to compile file */
3767 if (!path_searchable) {
3768 /* At this point, name is SvPVX(sv) */
3770 tryrsfp = doopen_pm(sv);
3772 if (!tryrsfp && !(errno == EACCES && !path_searchable)) {
3773 AV * const ar = GvAVn(PL_incgv);
3780 namesv = newSV_type(SVt_PV);
3781 for (i = 0; i <= AvFILL(ar); i++) {
3782 SV * const dirsv = *av_fetch(ar, i, TRUE);
3790 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3791 && !SvOBJECT(SvRV(loader)))
3793 loader = *av_fetch(MUTABLE_AV(SvRV(loader)), 0, TRUE);
3797 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3798 PTR2UV(SvRV(dirsv)), name);
3799 tryname = SvPVX_const(namesv);
3802 if (SvPADTMP(nsv)) {
3803 nsv = sv_newmortal();
3804 SvSetSV_nosteal(nsv,sv);
3807 ENTER_with_name("call_INC");
3815 if (SvGMAGICAL(loader)) {
3816 SV *l = sv_newmortal();
3817 sv_setsv_nomg(l, loader);
3820 if (sv_isobject(loader))
3821 count = call_method("INC", G_ARRAY);
3823 count = call_sv(loader, G_ARRAY);
3833 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3834 && !isGV_with_GP(SvRV(arg))) {
3835 filter_cache = SvRV(arg);
3842 if (SvROK(arg) && isGV_with_GP(SvRV(arg))) {
3846 if (isGV_with_GP(arg)) {
3847 IO * const io = GvIO((const GV *)arg);
3852 tryrsfp = IoIFP(io);
3853 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3854 PerlIO_close(IoOFP(io));
3865 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3867 SvREFCNT_inc_simple_void_NN(filter_sub);
3870 filter_state = SP[i];
3871 SvREFCNT_inc_simple_void(filter_state);
3875 if (!tryrsfp && (filter_cache || filter_sub)) {
3876 tryrsfp = PerlIO_open(BIT_BUCKET,
3882 /* FREETMPS may free our filter_cache */
3883 SvREFCNT_inc_simple_void(filter_cache);
3887 LEAVE_with_name("call_INC");
3889 /* Now re-mortalize it. */
3890 sv_2mortal(filter_cache);
3892 /* Adjust file name if the hook has set an %INC entry.
3893 This needs to happen after the FREETMPS above. */
3894 svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3896 tryname = SvPV_nolen_const(*svp);
3903 filter_has_file = 0;
3904 filter_cache = NULL;
3906 SvREFCNT_dec_NN(filter_state);
3907 filter_state = NULL;
3910 SvREFCNT_dec_NN(filter_sub);
3915 if (path_searchable) {
3920 dir = SvPV_nomg_const(dirsv, dirlen);
3926 if (!IS_SAFE_SYSCALL(dir, dirlen, "@INC entry", "require"))
3930 tounixpath(dir, SvPVX(sv_2mortal(newSVpv("", VMS_MAXRSS-1)))))
3933 sv_setpv(namesv, unixdir);
3934 sv_catpv(namesv, unixname);
3936 # ifdef __SYMBIAN32__
3937 if (PL_origfilename[0] &&
3938 PL_origfilename[1] == ':' &&
3939 !(dir[0] && dir[1] == ':'))
3940 Perl_sv_setpvf(aTHX_ namesv,
3945 Perl_sv_setpvf(aTHX_ namesv,
3949 /* The equivalent of
3950 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3951 but without the need to parse the format string, or
3952 call strlen on either pointer, and with the correct
3953 allocation up front. */
3955 char *tmp = SvGROW(namesv, dirlen + len + 2);
3957 memcpy(tmp, dir, dirlen);
3960 /* Avoid '<dir>//<file>' */
3961 if (!dirlen || *(tmp-1) != '/') {
3964 /* So SvCUR_set reports the correct length below */
3968 /* name came from an SV, so it will have a '\0' at the
3969 end that we can copy as part of this memcpy(). */
3970 memcpy(tmp, name, len + 1);
3972 SvCUR_set(namesv, dirlen + len + 1);
3977 TAINT_PROPER("require");
3978 tryname = SvPVX_const(namesv);
3979 tryrsfp = doopen_pm(namesv);
3981 if (tryname[0] == '.' && tryname[1] == '/') {
3983 while (*++tryname == '/') {}
3987 else if (errno == EMFILE || errno == EACCES) {
3988 /* no point in trying other paths if out of handles;
3989 * on the other hand, if we couldn't open one of the
3990 * files, then going on with the search could lead to
3991 * unexpected results; see perl #113422
4000 saved_errno = errno; /* sv_2mortal can realloc things */
4003 if (PL_op->op_type == OP_REQUIRE) {
4004 if(saved_errno == EMFILE || saved_errno == EACCES) {
4005 /* diag_listed_as: Can't locate %s */
4006 DIE(aTHX_ "Can't locate %s: %s: %s",
4007 name, tryname, Strerror(saved_errno));
4009 if (namesv) { /* did we lookup @INC? */
4010 AV * const ar = GvAVn(PL_incgv);
4012 SV *const msg = newSVpvs_flags("", SVs_TEMP);
4013 SV *const inc = newSVpvs_flags("", SVs_TEMP);
4014 for (i = 0; i <= AvFILL(ar); i++) {
4015 sv_catpvs(inc, " ");
4016 sv_catsv(inc, *av_fetch(ar, i, TRUE));
4018 if (len >= 4 && memEQ(name + len - 3, ".pm", 4)) {
4019 const char *c, *e = name + len - 3;
4020 sv_catpv(msg, " (you may need to install the ");
4021 for (c = name; c < e; c++) {
4023 sv_catpvs(msg, "::");
4026 sv_catpvn(msg, c, 1);
4029 sv_catpv(msg, " module)");
4031 else if (len >= 2 && memEQ(name + len - 2, ".h", 3)) {
4032 sv_catpv(msg, " (change .h to .ph maybe?) (did you run h2ph?)");
4034 else if (len >= 3 && memEQ(name + len - 3, ".ph", 4)) {
4035 sv_catpv(msg, " (did you run h2ph?)");
4038 /* diag_listed_as: Can't locate %s */
4040 "Can't locate %s in @INC%" SVf " (@INC contains:%" SVf ")",
4044 DIE(aTHX_ "Can't locate %s", name);
4051 SETERRNO(0, SS_NORMAL);
4053 /* Assume success here to prevent recursive requirement. */
4054 /* name is never assigned to again, so len is still strlen(name) */
4055 /* Check whether a hook in @INC has already filled %INC */
4057 (void)hv_store(GvHVn(PL_incgv),
4058 unixname, unixlen, newSVpv(tryname,0),0);
4060 SV** const svp = hv_fetch(GvHVn(PL_incgv), unixname, unixlen, 0);
4062 (void)hv_store(GvHVn(PL_incgv),
4063 unixname, unixlen, SvREFCNT_inc_simple(hook_sv), 0 );
4066 old_savestack_ix = PL_savestack_ix;
4067 SAVECOPFILE_FREE(&PL_compiling);
4068 CopFILE_set(&PL_compiling, tryname);
4069 lex_start(NULL, tryrsfp, 0);
4071 if (filter_sub || filter_cache) {
4072 /* We can use the SvPV of the filter PVIO itself as our cache, rather
4073 than hanging another SV from it. In turn, filter_add() optionally
4074 takes the SV to use as the filter (or creates a new SV if passed
4075 NULL), so simply pass in whatever value filter_cache has. */
4076 SV * const fc = filter_cache ? newSV(0) : NULL;
4078 if (fc) sv_copypv(fc, filter_cache);
4079 datasv = filter_add(S_run_user_filter, fc);
4080 IoLINES(datasv) = filter_has_file;
4081 IoTOP_GV(datasv) = MUTABLE_GV(filter_state);
4082 IoBOTTOM_GV(datasv) = MUTABLE_GV(filter_sub);
4085 /* switch to eval mode */
4086 PUSHBLOCK(cx, CXt_EVAL, SP);
4088 cx->cx_u.cx_blk.blku_old_savestack_ix = old_savestack_ix;
4089 cx->blk_eval.retop = PL_op->op_next;
4091 SAVECOPLINE(&PL_compiling);
4092 CopLINE_set(&PL_compiling, 0);
4096 if (doeval(gimme, NULL, PL_curcop->cop_seq, NULL))
4097 op = DOCATCH(PL_eval_start);
4099 op = PL_op->op_next;
4101 LOADED_FILE_PROBE(unixname);
4106 /* This is a op added to hold the hints hash for
4107 pp_entereval. The hash can be modified by the code
4108 being eval'ed, so we return a copy instead. */
4113 mXPUSHs(MUTABLE_SV(hv_copy_hints_hv(MUTABLE_HV(cSVOP_sv))));
4123 const I32 gimme = GIMME_V;
4124 const U32 was = PL_breakable_sub_gen;
4125 char tbuf[TYPE_DIGITS(long) + 12];
4126 bool saved_delete = FALSE;
4127 char *tmpbuf = tbuf;
4130 U32 seq, lex_flags = 0;
4131 HV *saved_hh = NULL;
4132 const bool bytes = PL_op->op_private & OPpEVAL_BYTES;
4133 I32 old_savestack_ix;
4135 if (PL_op->op_private & OPpEVAL_HAS_HH) {
4136 saved_hh = MUTABLE_HV(SvREFCNT_inc(POPs));
4138 else if (PL_hints & HINT_LOCALIZE_HH || (
4139 PL_op->op_private & OPpEVAL_COPHH
4140 && PL_curcop->cop_hints & HINT_LOCALIZE_HH
4142 saved_hh = cop_hints_2hv(PL_curcop, 0);
4143 hv_magic(saved_hh, NULL, PERL_MAGIC_hints);
4147 /* make sure we've got a plain PV (no overload etc) before testing
4148 * for taint. Making a copy here is probably overkill, but better
4149 * safe than sorry */
4151 const char * const p = SvPV_const(sv, len);
4153 sv = newSVpvn_flags(p, len, SVs_TEMP | SvUTF8(sv));
4154 lex_flags |= LEX_START_COPIED;
4156 if (bytes && SvUTF8(sv))
4157 SvPVbyte_force(sv, len);
4159 else if (bytes && SvUTF8(sv)) {
4160 /* Don't modify someone else's scalar */
4163 (void)sv_2mortal(sv);
4164 SvPVbyte_force(sv,len);
4165 lex_flags |= LEX_START_COPIED;
4168 TAINT_IF(SvTAINTED(sv));
4169 TAINT_PROPER("eval");
4171 old_savestack_ix = PL_savestack_ix;
4173 lex_start(sv, NULL, lex_flags | (PL_op->op_private & OPpEVAL_UNICODE
4174 ? LEX_IGNORE_UTF8_HINTS
4175 : bytes ? LEX_EVALBYTES : LEX_START_SAME_FILTER
4179 /* switch to eval mode */
4181 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
4182 SV * const temp_sv = sv_newmortal();
4183 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
4184 (unsigned long)++PL_evalseq,
4185 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4186 tmpbuf = SvPVX(temp_sv);
4187 len = SvCUR(temp_sv);
4190 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
4191 SAVECOPFILE_FREE(&PL_compiling);
4192 CopFILE_set(&PL_compiling, tmpbuf+2);
4193 SAVECOPLINE(&PL_compiling);
4194 CopLINE_set(&PL_compiling, 1);
4195 /* special case: an eval '' executed within the DB package gets lexically
4196 * placed in the first non-DB CV rather than the current CV - this
4197 * allows the debugger to execute code, find lexicals etc, in the
4198 * scope of the code being debugged. Passing &seq gets find_runcv
4199 * to do the dirty work for us */
4200 runcv = find_runcv(&seq);
4202 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
4204 cx->cx_u.cx_blk.blku_old_savestack_ix = old_savestack_ix;
4205 cx->blk_eval.retop = PL_op->op_next;
4207 /* prepare to compile string */
4209 if (PERLDB_LINE_OR_SAVESRC && PL_curstash != PL_debstash)
4210 save_lines(CopFILEAV(&PL_compiling), PL_parser->linestr);
4212 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
4213 deleting the eval's FILEGV from the stash before gv_check() runs
4214 (i.e. before run-time proper). To work around the coredump that
4215 ensues, we always turn GvMULTI_on for any globals that were
4216 introduced within evals. See force_ident(). GSAR 96-10-12 */
4217 char *const safestr = savepvn(tmpbuf, len);
4218 SAVEDELETE(PL_defstash, safestr, len);
4219 saved_delete = TRUE;
4224 if (doeval(gimme, runcv, seq, saved_hh)) {
4225 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4226 ? PERLDB_LINE_OR_SAVESRC
4227 : PERLDB_SAVESRC_NOSUBS) {
4228 /* Retain the filegv we created. */
4229 } else if (!saved_delete) {
4230 char *const safestr = savepvn(tmpbuf, len);
4231 SAVEDELETE(PL_defstash, safestr, len);
4233 return DOCATCH(PL_eval_start);
4235 /* We have already left the scope set up earlier thanks to the LEAVE
4237 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4238 ? PERLDB_LINE_OR_SAVESRC
4239 : PERLDB_SAVESRC_INVALID) {
4240 /* Retain the filegv we created. */
4241 } else if (!saved_delete) {
4242 (void)hv_delete(PL_defstash, tmpbuf, len, G_DISCARD);
4244 return PL_op->op_next;
4259 /* grab this value before POPEVAL restores old PL_in_eval */
4260 bool keep = cBOOL(PL_in_eval & EVAL_KEEPERR);
4264 cx = &cxstack[cxstack_ix];
4265 assert(CxTYPE(cx) == CXt_EVAL);
4266 newsp = PL_stack_base + cx->blk_oldsp;
4267 gimme = cx->blk_gimme;
4269 if (gimme != G_VOID) {
4271 leave_common(newsp, newsp, gimme, SVs_TEMP, FALSE);
4274 /* the POPEVAL does a leavescope, which frees the optree associated
4275 * with eval, which if it frees the nextstate associated with
4276 * PL_curcop, sets PL_curcop to NULL. Which can mess up freeing a
4277 * regex when running under 'use re Debug' because it needs PL_curcop
4278 * to get the current hints. So restore it early.
4280 PL_curcop = cx->blk_oldcop;
4283 PL_curpm = newpm; /* Don't pop $1 et al till now */
4285 namesv = cx->blk_eval.old_namesv;
4286 retop = cx->blk_eval.retop;
4287 evalcv = cx->blk_eval.cv;
4291 assert(CvDEPTH(evalcv) == 1);
4293 CvDEPTH(evalcv) = 0;
4295 if (optype == OP_REQUIRE &&
4296 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
4298 /* Unassume the success we assumed earlier. */
4299 (void)hv_delete(GvHVn(PL_incgv),
4300 SvPVX_const(namesv),
4301 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
4303 Perl_die(aTHX_ "%"SVf" did not return a true value", SVfARG(namesv));
4304 NOT_REACHED; /* NOTREACHED */
4305 /* die_unwind() did LEAVE, or we won't be here */
4315 /* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
4316 close to the related Perl_create_eval_scope. */
4318 Perl_delete_eval_scope(pTHX)
4324 cx = &cxstack[cxstack_ix];
4329 PERL_UNUSED_VAR(optype);
4332 /* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
4333 also needed by Perl_fold_constants. */
4335 Perl_create_eval_scope(pTHX_ U32 flags)
4338 const I32 gimme = GIMME_V;
4340 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), PL_stack_sp);
4342 cx->cx_u.cx_blk.blku_old_savestack_ix = PL_savestack_ix;
4344 PL_in_eval = EVAL_INEVAL;
4345 if (flags & G_KEEPERR)
4346 PL_in_eval |= EVAL_KEEPERR;
4349 if (flags & G_FAKINGEVAL) {
4350 PL_eval_root = PL_op; /* Only needed so that goto works right. */
4357 PERL_CONTEXT * const cx = create_eval_scope(0);
4358 cx->blk_eval.retop = cLOGOP->op_other->op_next;
4359 return DOCATCH(PL_op->op_next);
4373 cx = &cxstack[cxstack_ix];
4374 assert(CxTYPE(cx) == CXt_EVAL);
4375 newsp = PL_stack_base + cx->blk_oldsp;
4376 gimme = cx->blk_gimme;
4378 if (gimme == G_VOID)
4379 PL_stack_sp = newsp;
4381 leave_common(newsp, newsp, gimme, SVs_PADTMP|SVs_TEMP, FALSE);
4385 retop = cx->blk_eval.retop;
4386 PERL_UNUSED_VAR(optype);
4388 PL_curpm = newpm; /* Don't pop $1 et al till now */
4398 const I32 gimme = GIMME_V;
4402 assert(!PL_op->op_targ); /* used to be set for lexical $_ */
4403 GvSV(PL_defgv) = SvREFCNT_inc(newsv);
4405 PUSHBLOCK(cx, CXt_GIVEN, SP);
4406 PUSHGIVEN(cx, origsv);
4417 PERL_UNUSED_CONTEXT;
4419 cx = &cxstack[cxstack_ix];
4420 assert(CxTYPE(cx) == CXt_GIVEN);
4421 newsp = PL_stack_base + cx->blk_oldsp;
4422 gimme = cx->blk_gimme;
4424 if (gimme == G_VOID)
4425 PL_stack_sp = newsp;
4427 leave_common(newsp, newsp, gimme, SVs_PADTMP|SVs_TEMP, FALSE);
4430 PL_curpm = newpm; /* Don't pop $1 et al till now */
4436 /* Helper routines used by pp_smartmatch */
4438 S_make_matcher(pTHX_ REGEXP *re)
4440 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
4442 PERL_ARGS_ASSERT_MAKE_MATCHER;
4444 PM_SETRE(matcher, ReREFCNT_inc(re));
4446 SAVEFREEOP((OP *) matcher);
4447 ENTER_with_name("matcher"); SAVETMPS;
4453 S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
4458 PERL_ARGS_ASSERT_MATCHER_MATCHES_SV;
4460 PL_op = (OP *) matcher;
4463 (void) Perl_pp_match(aTHX);
4465 result = SvTRUEx(POPs);
4472 S_destroy_matcher(pTHX_ PMOP *matcher)
4474 PERL_ARGS_ASSERT_DESTROY_MATCHER;
4475 PERL_UNUSED_ARG(matcher);
4478 LEAVE_with_name("matcher");
4481 /* Do a smart match */