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 = CX_CUR();
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 */
294 RETURNOP(pm->op_next);
295 NOT_REACHED; /* NOTREACHED */
297 cx->sb_iters = saviters;
299 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
302 assert(!RX_SUBOFFSET(rx));
303 cx->sb_orig = orig = RX_SUBBEG(rx);
305 cx->sb_strend = s + (cx->sb_strend - m);
307 cx->sb_m = m = RX_OFFS(rx)[0].start + orig;
309 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
310 sv_catpvn_nomg_utf8_upgrade(dstr, s, m - s, nsv);
312 sv_catpvn_nomg(dstr, s, m-s);
314 cx->sb_s = RX_OFFS(rx)[0].end + orig;
315 { /* Update the pos() information. */
317 = (pm->op_pmflags & PMf_NONDESTRUCT) ? cx->sb_dstr : cx->sb_targ;
320 /* the string being matched against may no longer be a string,
321 * e.g. $_=0; s/.../$_++/ge */
324 SvPV_force_nomg_nolen(sv);
326 if (!(mg = mg_find_mglob(sv))) {
327 mg = sv_magicext_mglob(sv);
329 MgBYTEPOS_set(mg, sv, SvPVX(sv), m - orig);
332 (void)ReREFCNT_inc(rx);
333 /* update the taint state of various various variables in preparation
334 * for calling the code block.
335 * See "how taint works" above pp_subst() */
337 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
338 cx->sb_rxtainted |= SUBST_TAINT_PAT;
340 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
341 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
342 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
344 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
346 if (cx->sb_iters > 1 && (cx->sb_rxtainted &
347 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL)))
348 SvTAINTED_on((pm->op_pmflags & PMf_NONDESTRUCT)
349 ? cx->sb_dstr : cx->sb_targ);
352 rxres_save(&cx->sb_rxres, rx);
354 RETURNOP(pm->op_pmstashstartu.op_pmreplstart);
358 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
363 PERL_ARGS_ASSERT_RXRES_SAVE;
366 if (!p || p[1] < RX_NPARENS(rx)) {
368 i = 7 + (RX_NPARENS(rx)+1) * 2;
370 i = 6 + (RX_NPARENS(rx)+1) * 2;
379 /* what (if anything) to free on croak */
380 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? RX_SUBBEG(rx) : NULL);
381 RX_MATCH_COPIED_off(rx);
382 *p++ = RX_NPARENS(rx);
385 *p++ = PTR2UV(RX_SAVED_COPY(rx));
386 RX_SAVED_COPY(rx) = NULL;
389 *p++ = PTR2UV(RX_SUBBEG(rx));
390 *p++ = (UV)RX_SUBLEN(rx);
391 *p++ = (UV)RX_SUBOFFSET(rx);
392 *p++ = (UV)RX_SUBCOFFSET(rx);
393 for (i = 0; i <= RX_NPARENS(rx); ++i) {
394 *p++ = (UV)RX_OFFS(rx)[i].start;
395 *p++ = (UV)RX_OFFS(rx)[i].end;
400 S_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
405 PERL_ARGS_ASSERT_RXRES_RESTORE;
408 RX_MATCH_COPY_FREE(rx);
409 RX_MATCH_COPIED_set(rx, *p);
411 RX_NPARENS(rx) = *p++;
414 if (RX_SAVED_COPY(rx))
415 SvREFCNT_dec (RX_SAVED_COPY(rx));
416 RX_SAVED_COPY(rx) = INT2PTR(SV*,*p);
420 RX_SUBBEG(rx) = INT2PTR(char*,*p++);
421 RX_SUBLEN(rx) = (I32)(*p++);
422 RX_SUBOFFSET(rx) = (I32)*p++;
423 RX_SUBCOFFSET(rx) = (I32)*p++;
424 for (i = 0; i <= RX_NPARENS(rx); ++i) {
425 RX_OFFS(rx)[i].start = (I32)(*p++);
426 RX_OFFS(rx)[i].end = (I32)(*p++);
431 S_rxres_free(pTHX_ void **rsp)
433 UV * const p = (UV*)*rsp;
435 PERL_ARGS_ASSERT_RXRES_FREE;
439 void *tmp = INT2PTR(char*,*p);
442 U32 i = 9 + p[1] * 2;
444 U32 i = 8 + p[1] * 2;
449 SvREFCNT_dec (INT2PTR(SV*,p[2]));
452 PoisonFree(p, i, sizeof(UV));
461 #define FORM_NUM_BLANK (1<<30)
462 #define FORM_NUM_POINT (1<<29)
466 dSP; dMARK; dORIGMARK;
467 SV * const tmpForm = *++MARK;
468 SV *formsv; /* contains text of original format */
469 U32 *fpc; /* format ops program counter */
470 char *t; /* current append position in target string */
471 const char *f; /* current position in format string */
473 SV *sv = NULL; /* current item */
474 const char *item = NULL;/* string value of current item */
475 I32 itemsize = 0; /* length (chars) of item, possibly truncated */
476 I32 itembytes = 0; /* as itemsize, but length in bytes */
477 I32 fieldsize = 0; /* width of current field */
478 I32 lines = 0; /* number of lines that have been output */
479 bool chopspace = (strchr(PL_chopset, ' ') != NULL); /* does $: have space */
480 const char *chophere = NULL; /* where to chop current item */
481 STRLEN linemark = 0; /* pos of start of line in output */
483 bool gotsome = FALSE; /* seen at least one non-blank item on this line */
484 STRLEN len; /* length of current sv */
485 STRLEN linemax; /* estimate of output size in bytes */
486 bool item_is_utf8 = FALSE;
487 bool targ_is_utf8 = FALSE;
490 U8 *source; /* source of bytes to append */
491 STRLEN to_copy; /* how may bytes to append */
492 char trans; /* what chars to translate */
494 mg = doparseform(tmpForm);
496 fpc = (U32*)mg->mg_ptr;
497 /* the actual string the format was compiled from.
498 * with overload etc, this may not match tmpForm */
502 SvPV_force(PL_formtarget, len);
503 if (SvTAINTED(tmpForm) || SvTAINTED(formsv))
504 SvTAINTED_on(PL_formtarget);
505 if (DO_UTF8(PL_formtarget))
507 linemax = (SvCUR(formsv) * (IN_BYTES ? 1 : 3) + 1);
508 t = SvGROW(PL_formtarget, len + linemax + 1);
509 /* XXX from now onwards, SvCUR(PL_formtarget) is invalid */
511 f = SvPV_const(formsv, len);
515 const char *name = "???";
518 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
519 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
520 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
521 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
522 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
524 case FF_CHECKNL: name = "CHECKNL"; break;
525 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
526 case FF_SPACE: name = "SPACE"; break;
527 case FF_HALFSPACE: name = "HALFSPACE"; break;
528 case FF_ITEM: name = "ITEM"; break;
529 case FF_CHOP: name = "CHOP"; break;
530 case FF_LINEGLOB: name = "LINEGLOB"; break;
531 case FF_NEWLINE: name = "NEWLINE"; break;
532 case FF_MORE: name = "MORE"; break;
533 case FF_LINEMARK: name = "LINEMARK"; break;
534 case FF_END: name = "END"; break;
535 case FF_0DECIMAL: name = "0DECIMAL"; break;
536 case FF_LINESNGL: name = "LINESNGL"; break;
539 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
541 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
544 case FF_LINEMARK: /* start (or end) of a line */
545 linemark = t - SvPVX(PL_formtarget);
550 case FF_LITERAL: /* append <arg> literal chars */
555 item_is_utf8 = targ_is_utf8 ? !!DO_UTF8(formsv) : !!SvUTF8(formsv);
558 case FF_SKIP: /* skip <arg> chars in format */
562 case FF_FETCH: /* get next item and set field size to <arg> */
571 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
574 SvTAINTED_on(PL_formtarget);
577 case FF_CHECKNL: /* find max len of item (up to \n) that fits field */
579 const char *s = item = SvPV_const(sv, len);
580 const char *send = s + len;
583 item_is_utf8 = DO_UTF8(sv);
595 if (itemsize == fieldsize)
598 itembytes = s - item;
603 case FF_CHECKCHOP: /* like CHECKNL, but up to highest split point */
605 const char *s = item = SvPV_const(sv, len);
606 const char *send = s + len;
610 item_is_utf8 = DO_UTF8(sv);
612 /* look for a legal split position */
620 /* provisional split point */
624 /* we delay testing fieldsize until after we've
625 * processed the possible split char directly
626 * following the last field char; so if fieldsize=3
627 * and item="a b cdef", we consume "a b", not "a".
628 * Ditto further down.
630 if (size == fieldsize)
634 if (strchr(PL_chopset, *s)) {
635 /* provisional split point */
636 /* for a non-space split char, we include
637 * the split char; hence the '+1' */
641 if (size == fieldsize)
653 if (!chophere || s == send) {
657 itembytes = chophere - item;
662 case FF_SPACE: /* append padding space (diff of field, item size) */
663 arg = fieldsize - itemsize;
671 case FF_HALFSPACE: /* like FF_SPACE, but only append half as many */
672 arg = fieldsize - itemsize;
681 case FF_ITEM: /* append a text item, while blanking ctrl chars */
687 case FF_CHOP: /* (for ^*) chop the current item */
688 if (sv != &PL_sv_no) {
689 const char *s = chophere;
697 /* tied, overloaded or similar strangeness.
698 * Do it the hard way */
699 sv_setpvn(sv, s, len - (s-item));
704 case FF_LINESNGL: /* process ^* */
708 case FF_LINEGLOB: /* process @* */
710 const bool oneline = fpc[-1] == FF_LINESNGL;
711 const char *s = item = SvPV_const(sv, len);
712 const char *const send = s + len;
714 item_is_utf8 = DO_UTF8(sv);
725 to_copy = s - item - 1;
739 /* append to_copy bytes from source to PL_formstring.
740 * item_is_utf8 implies source is utf8.
741 * if trans, translate certain characters during the copy */
746 SvCUR_set(PL_formtarget,
747 t - SvPVX_const(PL_formtarget));
749 if (targ_is_utf8 && !item_is_utf8) {
750 source = tmp = bytes_to_utf8(source, &to_copy);
752 if (item_is_utf8 && !targ_is_utf8) {
754 /* Upgrade targ to UTF8, and then we reduce it to
755 a problem we have a simple solution for.
756 Don't need get magic. */
757 sv_utf8_upgrade_nomg(PL_formtarget);
759 /* re-calculate linemark */
760 s = (U8*)SvPVX(PL_formtarget);
761 /* the bytes we initially allocated to append the
762 * whole line may have been gobbled up during the
763 * upgrade, so allocate a whole new line's worth
768 linemark = s - (U8*)SvPVX(PL_formtarget);
770 /* Easy. They agree. */
771 assert (item_is_utf8 == targ_is_utf8);
774 /* @* and ^* are the only things that can exceed
775 * the linemax, so grow by the output size, plus
776 * a whole new form's worth in case of any further
778 grow = linemax + to_copy;
780 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + grow + 1);
781 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
783 Copy(source, t, to_copy, char);
785 /* blank out ~ or control chars, depending on trans.
786 * works on bytes not chars, so relies on not
787 * matching utf8 continuation bytes */
789 U8 *send = s + to_copy;
792 if (trans == '~' ? (ch == '~') : isCNTRL(ch))
799 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) + to_copy);
805 case FF_0DECIMAL: /* like FF_DECIMAL but for 0### */
808 ((arg & FORM_NUM_POINT) ? "%#0*.*" NVff : "%0*.*" NVff);
811 case FF_DECIMAL: /* do @##, ^##, where <arg>=(precision|flags) */
814 ((arg & FORM_NUM_POINT) ? "%#*.*" NVff : "%*.*" NVff);
816 /* If the field is marked with ^ and the value is undefined,
818 if ((arg & FORM_NUM_BLANK) && !SvOK(sv)) {
826 /* overflow evidence */
827 if (num_overflow(value, fieldsize, arg)) {
833 /* Formats aren't yet marked for locales, so assume "yes". */
835 Size_t max = SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget));
837 DECLARATION_FOR_LC_NUMERIC_MANIPULATION;
838 STORE_LC_NUMERIC_SET_TO_NEEDED();
839 arg &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
842 const char* qfmt = quadmath_format_single(fmt);
845 Perl_croak_nocontext("panic: quadmath invalid format \"%s\"", fmt);
846 len = quadmath_snprintf(t, max, qfmt, (int) fieldsize, (int) arg, value);
848 Perl_croak_nocontext("panic: quadmath_snprintf failed, format \"%s\"", qfmt);
853 /* we generate fmt ourselves so it is safe */
854 GCC_DIAG_IGNORE(-Wformat-nonliteral);
855 len = my_snprintf(t, max, fmt, (int) fieldsize, (int) arg, value);
858 PERL_MY_SNPRINTF_POST_GUARD(len, max);
859 RESTORE_LC_NUMERIC();
864 case FF_NEWLINE: /* delete trailing spaces, then append \n */
866 while (t-- > (SvPVX(PL_formtarget) + linemark) && *t == ' ') ;
871 case FF_BLANK: /* for arg==0: do '~'; for arg>0 : do '~~' */
874 if (arg) { /* repeat until fields exhausted? */
880 t = SvPVX(PL_formtarget) + linemark;
885 case FF_MORE: /* replace long end of string with '...' */
887 const char *s = chophere;
888 const char *send = item + len;
890 while (isSPACE(*s) && (s < send))
895 arg = fieldsize - itemsize;
902 if (strnEQ(s1," ",3)) {
903 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
913 case FF_END: /* tidy up, then return */
915 assert(t < SvPVX_const(PL_formtarget) + SvLEN(PL_formtarget));
917 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
919 SvUTF8_on(PL_formtarget);
920 FmLINES(PL_formtarget) += lines;
922 if (fpc[-1] == FF_BLANK)
923 RETURNOP(cLISTOP->op_first);
935 if (PL_stack_base + TOPMARK == SP) {
937 if (GIMME_V == G_SCALAR)
939 RETURNOP(PL_op->op_next->op_next);
941 PL_stack_sp = PL_stack_base + TOPMARK + 1;
942 Perl_pp_pushmark(aTHX); /* push dst */
943 Perl_pp_pushmark(aTHX); /* push src */
944 ENTER_with_name("grep"); /* enter outer scope */
948 ENTER_with_name("grep_item"); /* enter inner scope */
951 src = PL_stack_base[TOPMARK];
953 src = PL_stack_base[TOPMARK] = sv_mortalcopy(src);
960 if (PL_op->op_type == OP_MAPSTART)
961 Perl_pp_pushmark(aTHX); /* push top */
962 return ((LOGOP*)PL_op->op_next)->op_other;
968 const U8 gimme = GIMME_V;
969 I32 items = (SP - PL_stack_base) - TOPMARK; /* how many new items */
975 /* first, move source pointer to the next item in the source list */
976 ++PL_markstack_ptr[-1];
978 /* if there are new items, push them into the destination list */
979 if (items && gimme != G_VOID) {
980 /* might need to make room back there first */
981 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
982 /* XXX this implementation is very pessimal because the stack
983 * is repeatedly extended for every set of items. Is possible
984 * to do this without any stack extension or copying at all
985 * by maintaining a separate list over which the map iterates
986 * (like foreach does). --gsar */
988 /* everything in the stack after the destination list moves
989 * towards the end the stack by the amount of room needed */
990 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
992 /* items to shift up (accounting for the moved source pointer) */
993 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
995 /* This optimization is by Ben Tilly and it does
996 * things differently from what Sarathy (gsar)
997 * is describing. The downside of this optimization is
998 * that leaves "holes" (uninitialized and hopefully unused areas)
999 * to the Perl stack, but on the other hand this
1000 * shouldn't be a problem. If Sarathy's idea gets
1001 * implemented, this optimization should become
1002 * irrelevant. --jhi */
1004 shift = count; /* Avoid shifting too often --Ben Tilly */
1008 dst = (SP += shift);
1009 PL_markstack_ptr[-1] += shift;
1010 *PL_markstack_ptr += shift;
1014 /* copy the new items down to the destination list */
1015 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
1016 if (gimme == G_ARRAY) {
1017 /* add returned items to the collection (making mortal copies
1018 * if necessary), then clear the current temps stack frame
1019 * *except* for those items. We do this splicing the items
1020 * into the start of the tmps frame (so some items may be on
1021 * the tmps stack twice), then moving PL_tmps_floor above
1022 * them, then freeing the frame. That way, the only tmps that
1023 * accumulate over iterations are the return values for map.
1024 * We have to do to this way so that everything gets correctly
1025 * freed if we die during the map.
1029 /* make space for the slice */
1030 EXTEND_MORTAL(items);
1031 tmpsbase = PL_tmps_floor + 1;
1032 Move(PL_tmps_stack + tmpsbase,
1033 PL_tmps_stack + tmpsbase + items,
1034 PL_tmps_ix - PL_tmps_floor,
1036 PL_tmps_ix += items;
1041 sv = sv_mortalcopy(sv);
1043 PL_tmps_stack[tmpsbase++] = SvREFCNT_inc_simple(sv);
1045 /* clear the stack frame except for the items */
1046 PL_tmps_floor += items;
1048 /* FREETMPS may have cleared the TEMP flag on some of the items */
1051 SvTEMP_on(PL_tmps_stack[--tmpsbase]);
1054 /* scalar context: we don't care about which values map returns
1055 * (we use undef here). And so we certainly don't want to do mortal
1056 * copies of meaningless values. */
1057 while (items-- > 0) {
1059 *dst-- = &PL_sv_undef;
1067 LEAVE_with_name("grep_item"); /* exit inner scope */
1070 if (PL_markstack_ptr[-1] > TOPMARK) {
1072 (void)POPMARK; /* pop top */
1073 LEAVE_with_name("grep"); /* exit outer scope */
1074 (void)POPMARK; /* pop src */
1075 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1076 (void)POPMARK; /* pop dst */
1077 SP = PL_stack_base + POPMARK; /* pop original mark */
1078 if (gimme == G_SCALAR) {
1082 else if (gimme == G_ARRAY)
1089 ENTER_with_name("grep_item"); /* enter inner scope */
1092 /* set $_ to the new source item */
1093 src = PL_stack_base[PL_markstack_ptr[-1]];
1094 if (SvPADTMP(src)) {
1095 src = sv_mortalcopy(src);
1100 RETURNOP(cLOGOP->op_other);
1108 if (GIMME_V == G_ARRAY)
1110 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1111 return cLOGOP->op_other;
1120 if (GIMME_V == G_ARRAY) {
1121 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1125 SV * const targ = PAD_SV(PL_op->op_targ);
1128 if (PL_op->op_private & OPpFLIP_LINENUM) {
1129 if (GvIO(PL_last_in_gv)) {
1130 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1133 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1135 flip = SvIV(sv) == SvIV(GvSV(gv));
1141 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1142 if (PL_op->op_flags & OPf_SPECIAL) {
1150 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1153 sv_setpvs(TARG, "");
1159 /* This code tries to decide if "$left .. $right" should use the
1160 magical string increment, or if the range is numeric (we make
1161 an exception for .."0" [#18165]). AMS 20021031. */
1163 #define RANGE_IS_NUMERIC(left,right) ( \
1164 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1165 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1166 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1167 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1168 && (!SvOK(right) || looks_like_number(right))))
1174 if (GIMME_V == G_ARRAY) {
1180 if (RANGE_IS_NUMERIC(left,right)) {
1182 if ((SvOK(left) && !SvIOK(left) && SvNV_nomg(left) < IV_MIN) ||
1183 (SvOK(right) && (SvIOK(right)
1184 ? SvIsUV(right) && SvUV(right) > IV_MAX
1185 : SvNV_nomg(right) > IV_MAX)))
1186 DIE(aTHX_ "Range iterator outside integer range");
1187 i = SvIV_nomg(left);
1188 j = SvIV_nomg(right);
1190 /* Dance carefully around signed max. */
1191 bool overflow = (i <= 0 && j > SSize_t_MAX + i - 1);
1194 /* The wraparound of signed integers is undefined
1195 * behavior, but here we aim for count >=1, and
1196 * negative count is just wrong. */
1198 #if IVSIZE > Size_t_size
1205 Perl_croak(aTHX_ "Out of memory during list extend");
1212 SV * const sv = sv_2mortal(newSViv(i));
1214 if (n) /* avoid incrementing above IV_MAX */
1220 const char * const lpv = SvPV_nomg_const(left, llen);
1221 const char * const tmps = SvPV_nomg_const(right, len);
1223 SV *sv = newSVpvn_flags(lpv, llen, SvUTF8(left)|SVs_TEMP);
1224 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1226 if (strEQ(SvPVX_const(sv),tmps))
1228 sv = sv_2mortal(newSVsv(sv));
1235 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1239 if (PL_op->op_private & OPpFLIP_LINENUM) {
1240 if (GvIO(PL_last_in_gv)) {
1241 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1244 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1245 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1253 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1254 sv_catpvs(targ, "E0");
1264 static const char * const context_name[] = {
1266 NULL, /* CXt_WHEN never actually needs "block" */
1267 NULL, /* CXt_BLOCK never actually needs "block" */
1268 NULL, /* CXt_GIVEN never actually needs "block" */
1269 NULL, /* CXt_LOOP_PLAIN never actually needs "loop" */
1270 NULL, /* CXt_LOOP_LAZYIV never actually needs "loop" */
1271 NULL, /* CXt_LOOP_LAZYSV never actually needs "loop" */
1272 NULL, /* CXt_LOOP_LIST never actually needs "loop" */
1273 NULL, /* CXt_LOOP_ARY never actually needs "loop" */
1281 S_dopoptolabel(pTHX_ const char *label, STRLEN len, U32 flags)
1285 PERL_ARGS_ASSERT_DOPOPTOLABEL;
1287 for (i = cxstack_ix; i >= 0; i--) {
1288 const PERL_CONTEXT * const cx = &cxstack[i];
1289 switch (CxTYPE(cx)) {
1295 /* diag_listed_as: Exiting subroutine via %s */
1296 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1297 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1298 if (CxTYPE(cx) == CXt_NULL) /* sort BLOCK */
1301 case CXt_LOOP_PLAIN:
1302 case CXt_LOOP_LAZYIV:
1303 case CXt_LOOP_LAZYSV:
1307 STRLEN cx_label_len = 0;
1308 U32 cx_label_flags = 0;
1309 const char *cx_label = CxLABEL_len_flags(cx, &cx_label_len, &cx_label_flags);
1311 ( (cx_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ?
1314 (const U8*)cx_label, cx_label_len,
1315 (const U8*)label, len) == 0)
1317 (const U8*)label, len,
1318 (const U8*)cx_label, cx_label_len) == 0)
1319 : (len == cx_label_len && ((cx_label == label)
1320 || memEQ(cx_label, label, len))) )) {
1321 DEBUG_l(Perl_deb(aTHX_ "(poptolabel(): skipping label at cx=%ld %s)\n",
1322 (long)i, cx_label));
1325 DEBUG_l( Perl_deb(aTHX_ "(poptolabel(): found label at cx=%ld %s)\n", (long)i, label));
1336 Perl_dowantarray(pTHX)
1338 const U8 gimme = block_gimme();
1339 return (gimme == G_VOID) ? G_SCALAR : gimme;
1343 Perl_block_gimme(pTHX)
1345 const I32 cxix = dopoptosub(cxstack_ix);
1350 gimme = (cxstack[cxix].blk_gimme & G_WANT);
1352 Perl_croak(aTHX_ "panic: bad gimme: %d\n", gimme);
1358 Perl_is_lvalue_sub(pTHX)
1360 const I32 cxix = dopoptosub(cxstack_ix);
1361 assert(cxix >= 0); /* We should only be called from inside subs */
1363 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1364 return CxLVAL(cxstack + cxix);
1369 /* only used by cx_pushsub() */
1371 Perl_was_lvalue_sub(pTHX)
1373 const I32 cxix = dopoptosub(cxstack_ix-1);
1374 assert(cxix >= 0); /* We should only be called from inside subs */
1376 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1377 return CxLVAL(cxstack + cxix);
1383 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1387 PERL_ARGS_ASSERT_DOPOPTOSUB_AT;
1389 PERL_UNUSED_CONTEXT;
1392 for (i = startingblock; i >= 0; i--) {
1393 const PERL_CONTEXT * const cx = &cxstk[i];
1394 switch (CxTYPE(cx)) {
1398 /* in sub foo { /(?{...})/ }, foo ends up on the CX stack
1399 * twice; the first for the normal foo() call, and the second
1400 * for a faked up re-entry into the sub to execute the
1401 * code block. Hide this faked entry from the world. */
1402 if (cx->cx_type & CXp_SUB_RE_FAKE)
1407 DEBUG_l( Perl_deb(aTHX_ "(dopoptosub_at(): found sub at cx=%ld)\n", (long)i));
1415 S_dopoptoeval(pTHX_ I32 startingblock)
1418 for (i = startingblock; i >= 0; i--) {
1419 const PERL_CONTEXT *cx = &cxstack[i];
1420 switch (CxTYPE(cx)) {
1424 DEBUG_l( Perl_deb(aTHX_ "(dopoptoeval(): found eval at cx=%ld)\n", (long)i));
1432 S_dopoptoloop(pTHX_ I32 startingblock)
1435 for (i = startingblock; i >= 0; i--) {
1436 const PERL_CONTEXT * const cx = &cxstack[i];
1437 switch (CxTYPE(cx)) {
1443 /* diag_listed_as: Exiting subroutine via %s */
1444 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1445 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1446 if ((CxTYPE(cx)) == CXt_NULL) /* sort BLOCK */
1449 case CXt_LOOP_PLAIN:
1450 case CXt_LOOP_LAZYIV:
1451 case CXt_LOOP_LAZYSV:
1454 DEBUG_l( Perl_deb(aTHX_ "(dopoptoloop(): found loop at cx=%ld)\n", (long)i));
1461 /* find the next GIVEN or FOR (with implicit $_) loop context block */
1464 S_dopoptogivenfor(pTHX_ I32 startingblock)
1467 for (i = startingblock; i >= 0; i--) {
1468 const PERL_CONTEXT *cx = &cxstack[i];
1469 switch (CxTYPE(cx)) {
1473 DEBUG_l( Perl_deb(aTHX_ "(dopoptogivenfor(): found given at cx=%ld)\n", (long)i));
1475 case CXt_LOOP_PLAIN:
1476 assert(!(cx->cx_type & CXp_FOR_DEF));
1478 case CXt_LOOP_LAZYIV:
1479 case CXt_LOOP_LAZYSV:
1482 if (cx->cx_type & CXp_FOR_DEF) {
1483 DEBUG_l( Perl_deb(aTHX_ "(dopoptogivenfor(): found foreach at cx=%ld)\n", (long)i));
1492 S_dopoptowhen(pTHX_ I32 startingblock)
1495 for (i = startingblock; i >= 0; i--) {
1496 const PERL_CONTEXT *cx = &cxstack[i];
1497 switch (CxTYPE(cx)) {
1501 DEBUG_l( Perl_deb(aTHX_ "(dopoptowhen(): found when at cx=%ld)\n", (long)i));
1508 /* dounwind(): pop all contexts above (but not including) cxix.
1509 * Note that it clears the savestack frame associated with each popped
1510 * context entry, but doesn't free any temps.
1511 * It does a cx_popblock() of the last frame that it pops, and leaves
1512 * cxstack_ix equal to cxix.
1516 Perl_dounwind(pTHX_ I32 cxix)
1518 if (!PL_curstackinfo) /* can happen if die during thread cloning */
1521 while (cxstack_ix > cxix) {
1522 PERL_CONTEXT *cx = CX_CUR();
1524 CX_DEBUG(cx, "UNWIND");
1525 /* Note: we don't need to restore the base context info till the end. */
1529 switch (CxTYPE(cx)) {
1539 case CXt_LOOP_PLAIN:
1540 case CXt_LOOP_LAZYIV:
1541 case CXt_LOOP_LAZYSV:
1554 /* these two don't have a POPFOO() */
1560 if (cxstack_ix == cxix + 1) {
1569 Perl_qerror(pTHX_ SV *err)
1571 PERL_ARGS_ASSERT_QERROR;
1574 if (PL_in_eval & EVAL_KEEPERR) {
1575 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1579 sv_catsv(ERRSV, err);
1582 sv_catsv(PL_errors, err);
1584 Perl_warn(aTHX_ "%"SVf, SVfARG(err));
1586 ++PL_parser->error_count;
1591 /* undef or delete the $INC{namesv} entry, then croak.
1592 * require0 indicates that the require didn't return a true value */
1595 S_undo_inc_then_croak(pTHX_ SV *namesv, SV *err, bool require0)
1598 HV *inc_hv = GvHVn(PL_incgv);
1599 I32 klen = SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv);
1600 const char *key = SvPVX_const(namesv);
1603 (void)hv_delete(inc_hv, key, klen, G_DISCARD);
1604 fmt = "%"SVf" did not return a true value";
1608 (void)hv_store(inc_hv, key, klen, &PL_sv_undef, 0);
1609 fmt = "%"SVf"Compilation failed in require";
1610 err = err ? err : newSVpvs_flags("Unknown error\n", SVs_TEMP);
1613 Perl_croak(aTHX_ fmt, SVfARG(err));
1618 Perl_die_unwind(pTHX_ SV *msv)
1620 SV *exceptsv = sv_mortalcopy(msv);
1621 U8 in_eval = PL_in_eval;
1622 PERL_ARGS_ASSERT_DIE_UNWIND;
1628 * Historically, perl used to set ERRSV ($@) early in the die
1629 * process and rely on it not getting clobbered during unwinding.
1630 * That sucked, because it was liable to get clobbered, so the
1631 * setting of ERRSV used to emit the exception from eval{} has
1632 * been moved to much later, after unwinding (see just before
1633 * JMPENV_JUMP below). However, some modules were relying on the
1634 * early setting, by examining $@ during unwinding to use it as
1635 * a flag indicating whether the current unwinding was caused by
1636 * an exception. It was never a reliable flag for that purpose,
1637 * being totally open to false positives even without actual
1638 * clobberage, but was useful enough for production code to
1639 * semantically rely on it.
1641 * We'd like to have a proper introspective interface that
1642 * explicitly describes the reason for whatever unwinding
1643 * operations are currently in progress, so that those modules
1644 * work reliably and $@ isn't further overloaded. But we don't
1645 * have one yet. In its absence, as a stopgap measure, ERRSV is
1646 * now *additionally* set here, before unwinding, to serve as the
1647 * (unreliable) flag that it used to.
1649 * This behaviour is temporary, and should be removed when a
1650 * proper way to detect exceptional unwinding has been developed.
1651 * As of 2010-12, the authors of modules relying on the hack
1652 * are aware of the issue, because the modules failed on
1653 * perls 5.13.{1..7} which had late setting of $@ without this
1654 * early-setting hack.
1656 if (!(in_eval & EVAL_KEEPERR)) {
1657 SvTEMP_off(exceptsv);
1658 sv_setsv(ERRSV, exceptsv);
1661 if (in_eval & EVAL_KEEPERR) {
1662 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1666 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1667 && PL_curstackinfo->si_prev)
1678 JMPENV *restartjmpenv;
1681 if (cxix < cxstack_ix)
1685 assert(CxTYPE(cx) == CXt_EVAL);
1687 /* return false to the caller of eval */
1688 oldsp = PL_stack_base + cx->blk_oldsp;
1689 gimme = cx->blk_gimme;
1690 if (gimme == G_SCALAR)
1691 *++oldsp = &PL_sv_undef;
1692 PL_stack_sp = oldsp;
1697 restartjmpenv = cx->blk_eval.cur_top_env;
1698 restartop = cx->blk_eval.retop;
1699 if (CxOLD_OP_TYPE(cx) == OP_REQUIRE)
1700 namesv = cx->blk_eval.old_namesv;
1704 /* note that unlike pp_entereval, pp_require isn't
1705 * supposed to trap errors. So now that we've popped the
1706 * EVAL that pp_require pushed, process the error message
1707 * and rethrow the error */
1708 S_undo_inc_then_croak(aTHX_ namesv, exceptsv, FALSE);
1709 NOT_REACHED; /* NOTREACHED */
1712 if (!(in_eval & EVAL_KEEPERR))
1713 sv_setsv(ERRSV, exceptsv);
1714 PL_restartjmpenv = restartjmpenv;
1715 PL_restartop = restartop;
1717 NOT_REACHED; /* NOTREACHED */
1721 write_to_stderr(exceptsv);
1723 NOT_REACHED; /* NOTREACHED */
1729 if (SvTRUE(left) != SvTRUE(right))
1737 =head1 CV Manipulation Functions
1739 =for apidoc caller_cx
1741 The XSUB-writer's equivalent of L<caller()|perlfunc/caller>. The
1742 returned C<PERL_CONTEXT> structure can be interrogated to find all the
1743 information returned to Perl by C<caller>. Note that XSUBs don't get a
1744 stack frame, so C<caller_cx(0, NULL)> will return information for the
1745 immediately-surrounding Perl code.
1747 This function skips over the automatic calls to C<&DB::sub> made on the
1748 behalf of the debugger. If the stack frame requested was a sub called by
1749 C<DB::sub>, the return value will be the frame for the call to
1750 C<DB::sub>, since that has the correct line number/etc. for the call
1751 site. If I<dbcxp> is non-C<NULL>, it will be set to a pointer to the
1752 frame for the sub call itself.
1757 const PERL_CONTEXT *
1758 Perl_caller_cx(pTHX_ I32 count, const PERL_CONTEXT **dbcxp)
1760 I32 cxix = dopoptosub(cxstack_ix);
1761 const PERL_CONTEXT *cx;
1762 const PERL_CONTEXT *ccstack = cxstack;
1763 const PERL_SI *top_si = PL_curstackinfo;
1766 /* we may be in a higher stacklevel, so dig down deeper */
1767 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1768 top_si = top_si->si_prev;
1769 ccstack = top_si->si_cxstack;
1770 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1774 /* caller() should not report the automatic calls to &DB::sub */
1775 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1776 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1780 cxix = dopoptosub_at(ccstack, cxix - 1);
1783 cx = &ccstack[cxix];
1784 if (dbcxp) *dbcxp = cx;
1786 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1787 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1788 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1789 field below is defined for any cx. */
1790 /* caller() should not report the automatic calls to &DB::sub */
1791 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1792 cx = &ccstack[dbcxix];
1801 const PERL_CONTEXT *cx;
1802 const PERL_CONTEXT *dbcx;
1804 const HEK *stash_hek;
1806 bool has_arg = MAXARG && TOPs;
1815 cx = caller_cx(count + !!(PL_op->op_private & OPpOFFBYONE), &dbcx);
1817 if (gimme != G_ARRAY) {
1824 CX_DEBUG(cx, "CALLER");
1825 assert(CopSTASH(cx->blk_oldcop));
1826 stash_hek = SvTYPE(CopSTASH(cx->blk_oldcop)) == SVt_PVHV
1827 ? HvNAME_HEK((HV*)CopSTASH(cx->blk_oldcop))
1829 if (gimme != G_ARRAY) {
1832 PUSHs(&PL_sv_undef);
1835 sv_sethek(TARG, stash_hek);
1844 PUSHs(&PL_sv_undef);
1847 sv_sethek(TARG, stash_hek);
1850 mPUSHs(newSVpv(OutCopFILE(cx->blk_oldcop), 0));
1851 lcop = closest_cop(cx->blk_oldcop, OpSIBLING(cx->blk_oldcop),
1852 cx->blk_sub.retop, TRUE);
1854 lcop = cx->blk_oldcop;
1855 mPUSHu(CopLINE(lcop));
1858 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1859 /* So is ccstack[dbcxix]. */
1860 if (CvHASGV(dbcx->blk_sub.cv)) {
1861 PUSHs(cv_name(dbcx->blk_sub.cv, 0, 0));
1862 PUSHs(boolSV(CxHASARGS(cx)));
1865 PUSHs(newSVpvs_flags("(unknown)", SVs_TEMP));
1866 PUSHs(boolSV(CxHASARGS(cx)));
1870 PUSHs(newSVpvs_flags("(eval)", SVs_TEMP));
1873 gimme = cx->blk_gimme;
1874 if (gimme == G_VOID)
1875 PUSHs(&PL_sv_undef);
1877 PUSHs(boolSV((gimme & G_WANT) == G_ARRAY));
1878 if (CxTYPE(cx) == CXt_EVAL) {
1880 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
1881 SV *cur_text = cx->blk_eval.cur_text;
1882 if (SvCUR(cur_text) >= 2) {
1883 PUSHs(newSVpvn_flags(SvPVX(cur_text), SvCUR(cur_text)-2,
1884 SvUTF8(cur_text)|SVs_TEMP));
1887 /* I think this is will always be "", but be sure */
1888 PUSHs(sv_2mortal(newSVsv(cur_text)));
1894 else if (cx->blk_eval.old_namesv) {
1895 mPUSHs(newSVsv(cx->blk_eval.old_namesv));
1898 /* eval BLOCK (try blocks have old_namesv == 0) */
1900 PUSHs(&PL_sv_undef);
1901 PUSHs(&PL_sv_undef);
1905 PUSHs(&PL_sv_undef);
1906 PUSHs(&PL_sv_undef);
1908 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)
1909 && CopSTASH_eq(PL_curcop, PL_debstash))
1911 /* slot 0 of the pad contains the original @_ */
1912 AV * const ary = MUTABLE_AV(AvARRAY(MUTABLE_AV(
1913 PadlistARRAY(CvPADLIST(cx->blk_sub.cv))[
1914 cx->blk_sub.olddepth+1]))[0]);
1915 const SSize_t off = AvARRAY(ary) - AvALLOC(ary);
1917 Perl_init_dbargs(aTHX);
1919 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1920 av_extend(PL_dbargs, AvFILLp(ary) + off);
1921 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1922 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1924 mPUSHi(CopHINTS_get(cx->blk_oldcop));
1927 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
1929 if (old_warnings == pWARN_NONE)
1930 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1931 else if (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0)
1932 mask = &PL_sv_undef ;
1933 else if (old_warnings == pWARN_ALL ||
1934 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1935 /* Get the bit mask for $warnings::Bits{all}, because
1936 * it could have been extended by warnings::register */
1938 HV * const bits = get_hv("warnings::Bits", 0);
1939 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
1940 mask = newSVsv(*bits_all);
1943 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1947 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
1951 PUSHs(cx->blk_oldcop->cop_hints_hash ?
1952 sv_2mortal(newRV_noinc(MUTABLE_SV(cop_hints_2hv(cx->blk_oldcop, 0))))
1962 if (MAXARG < 1 || (!TOPs && !POPs))
1963 tmps = NULL, len = 0;
1965 tmps = SvPVx_const(POPs, len);
1966 sv_resetpvn(tmps, len, CopSTASH(PL_curcop));
1971 /* like pp_nextstate, but used instead when the debugger is active */
1975 PL_curcop = (COP*)PL_op;
1976 TAINT_NOT; /* Each statement is presumed innocent */
1977 PL_stack_sp = PL_stack_base + CX_CUR()->blk_oldsp;
1982 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1983 || PL_DBsingle_iv || PL_DBsignal_iv || PL_DBtrace_iv)
1987 const U8 gimme = G_ARRAY;
1988 GV * const gv = PL_DBgv;
1991 if (gv && isGV_with_GP(gv))
1994 if (!cv || (!CvROOT(cv) && !CvXSUB(cv)))
1995 DIE(aTHX_ "No DB::DB routine defined");
1997 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1998 /* don't do recursive DB::DB call */
2008 (void)(*CvXSUB(cv))(aTHX_ cv);
2014 cx = cx_pushblock(CXt_SUB, gimme, SP, PL_savestack_ix);
2015 cx_pushsub(cx, cv, PL_op->op_next, 0);
2016 /* OP_DBSTATE's op_private holds hint bits rather than
2017 * the lvalue-ish flags seen in OP_ENTERSUB. So cancel
2018 * any CxLVAL() flags that have now been mis-calculated */
2025 if (CvDEPTH(cv) >= 2)
2026 pad_push(CvPADLIST(cv), CvDEPTH(cv));
2027 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), CvDEPTH(cv));
2028 RETURNOP(CvSTART(cv));
2040 (void)cx_pushblock(CXt_BLOCK, gimme, PL_stack_sp, PL_savestack_ix);
2052 assert(CxTYPE(cx) == CXt_BLOCK);
2054 if (PL_op->op_flags & OPf_SPECIAL)
2055 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
2057 oldsp = PL_stack_base + cx->blk_oldsp;
2058 gimme = cx->blk_gimme;
2060 if (gimme == G_VOID)
2061 PL_stack_sp = oldsp;
2063 leave_adjust_stacks(oldsp, oldsp, gimme,
2064 PL_op->op_private & OPpLVALUE ? 3 : 1);
2074 S_outside_integer(pTHX_ SV *sv)
2077 const NV nv = SvNV_nomg(sv);
2078 if (Perl_isinfnan(nv))
2080 #ifdef NV_PRESERVES_UV
2081 if (nv < (NV)IV_MIN || nv > (NV)IV_MAX)
2084 if (nv <= (NV)IV_MIN)
2087 ((nv > (NV)UV_MAX ||
2088 SvUV_nomg(sv) > (UV)IV_MAX)))
2099 const U8 gimme = GIMME_V;
2100 void *itervarp; /* GV or pad slot of the iteration variable */
2101 SV *itersave; /* the old var in the iterator var slot */
2104 if (PL_op->op_targ) { /* "my" variable */
2105 itervarp = &PAD_SVl(PL_op->op_targ);
2106 itersave = *(SV**)itervarp;
2108 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
2109 /* the SV currently in the pad slot is never live during
2110 * iteration (the slot is always aliased to one of the items)
2111 * so it's always stale */
2112 SvPADSTALE_on(itersave);
2114 SvREFCNT_inc_simple_void_NN(itersave);
2115 cxflags = CXp_FOR_PAD;
2118 SV * const sv = POPs;
2119 itervarp = (void *)sv;
2120 if (LIKELY(isGV(sv))) { /* symbol table variable */
2121 itersave = GvSV(sv);
2122 SvREFCNT_inc_simple_void(itersave);
2123 cxflags = CXp_FOR_GV;
2124 if (PL_op->op_private & OPpITER_DEF)
2125 cxflags |= CXp_FOR_DEF;
2127 else { /* LV ref: for \$foo (...) */
2128 assert(SvTYPE(sv) == SVt_PVMG);
2129 assert(SvMAGIC(sv));
2130 assert(SvMAGIC(sv)->mg_type == PERL_MAGIC_lvref);
2132 cxflags = CXp_FOR_LVREF;
2135 /* OPpITER_DEF (implicit $_) should only occur with a GV iter var */
2136 assert((cxflags & CXp_FOR_GV) || !(PL_op->op_private & OPpITER_DEF));
2138 /* Note that this context is initially set as CXt_NULL. Further on
2139 * down it's changed to one of the CXt_LOOP_*. Before it's changed,
2140 * there mustn't be anything in the blk_loop substruct that requires
2141 * freeing or undoing, in case we die in the meantime. And vice-versa.
2143 cx = cx_pushblock(cxflags, gimme, MARK, PL_savestack_ix);
2144 cx_pushloop_for(cx, itervarp, itersave);
2146 if (PL_op->op_flags & OPf_STACKED) {
2147 /* OPf_STACKED implies either a single array: for(@), with a
2148 * single AV on the stack, or a range: for (1..5), with 1 and 5 on
2150 SV *maybe_ary = POPs;
2151 if (SvTYPE(maybe_ary) != SVt_PVAV) {
2154 SV * const right = maybe_ary;
2155 if (UNLIKELY(cxflags & CXp_FOR_LVREF))
2156 DIE(aTHX_ "Assigned value is not a reference");
2159 if (RANGE_IS_NUMERIC(sv,right)) {
2160 cx->cx_type |= CXt_LOOP_LAZYIV;
2161 if (S_outside_integer(aTHX_ sv) ||
2162 S_outside_integer(aTHX_ right))
2163 DIE(aTHX_ "Range iterator outside integer range");
2164 cx->blk_loop.state_u.lazyiv.cur = SvIV_nomg(sv);
2165 cx->blk_loop.state_u.lazyiv.end = SvIV_nomg(right);
2168 cx->cx_type |= CXt_LOOP_LAZYSV;
2169 cx->blk_loop.state_u.lazysv.cur = newSVsv(sv);
2170 cx->blk_loop.state_u.lazysv.end = right;
2171 SvREFCNT_inc_simple_void_NN(right);
2172 (void) SvPV_force_nolen(cx->blk_loop.state_u.lazysv.cur);
2173 /* This will do the upgrade to SVt_PV, and warn if the value
2174 is uninitialised. */
2175 (void) SvPV_nolen_const(right);
2176 /* Doing this avoids a check every time in pp_iter in pp_hot.c
2177 to replace !SvOK() with a pointer to "". */
2179 SvREFCNT_dec(right);
2180 cx->blk_loop.state_u.lazysv.end = &PL_sv_no;
2184 else /* SvTYPE(maybe_ary) == SVt_PVAV */ {
2185 /* for (@array) {} */
2186 cx->cx_type |= CXt_LOOP_ARY;
2187 cx->blk_loop.state_u.ary.ary = MUTABLE_AV(maybe_ary);
2188 SvREFCNT_inc_simple_void_NN(maybe_ary);
2189 cx->blk_loop.state_u.ary.ix =
2190 (PL_op->op_private & OPpITER_REVERSED) ?
2191 AvFILL(cx->blk_loop.state_u.ary.ary) + 1 :
2194 /* EXTEND(SP, 1) not needed in this branch because we just did POPs */
2196 else { /* iterating over items on the stack */
2197 cx->cx_type |= CXt_LOOP_LIST;
2198 cx->blk_oldsp = SP - PL_stack_base;
2199 cx->blk_loop.state_u.stack.basesp = MARK - PL_stack_base;
2200 cx->blk_loop.state_u.stack.ix =
2201 (PL_op->op_private & OPpITER_REVERSED)
2203 : cx->blk_loop.state_u.stack.basesp;
2204 /* pre-extend stack so pp_iter doesn't have to check every time
2205 * it pushes yes/no */
2215 const U8 gimme = GIMME_V;
2217 cx = cx_pushblock(CXt_LOOP_PLAIN, gimme, PL_stack_sp, PL_savestack_ix);
2218 cx_pushloop_plain(cx);
2231 assert(CxTYPE_is_LOOP(cx));
2232 mark = PL_stack_base + cx->blk_oldsp;
2233 oldsp = CxTYPE(cx) == CXt_LOOP_LIST
2234 ? PL_stack_base + cx->blk_loop.state_u.stack.basesp
2236 gimme = cx->blk_gimme;
2238 if (gimme == G_VOID)
2239 PL_stack_sp = oldsp;
2241 leave_adjust_stacks(MARK, oldsp, gimme,
2242 PL_op->op_private & OPpLVALUE ? 3 : 1);
2245 cx_poploop(cx); /* Stack values are safe: release loop vars ... */
2253 /* This duplicates most of pp_leavesub, but with additional code to handle
2254 * return args in lvalue context. It was forked from pp_leavesub to
2255 * avoid slowing down that function any further.
2257 * Any changes made to this function may need to be copied to pp_leavesub
2269 assert(CxTYPE(cx) == CXt_SUB);
2271 if (CxMULTICALL(cx)) {
2272 /* entry zero of a stack is always PL_sv_undef, which
2273 * simplifies converting a '()' return into undef in scalar context */
2274 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef);
2278 gimme = cx->blk_gimme;
2279 oldsp = PL_stack_base + cx->blk_oldsp; /* last arg of previous frame */
2281 if (gimme == G_VOID)
2282 PL_stack_sp = oldsp;
2284 U8 lval = CxLVAL(cx);
2285 bool is_lval = (lval && !(lval & OPpENTERSUB_INARGS));
2286 const char *what = NULL;
2288 if (gimme == G_SCALAR) {
2290 /* check for bad return arg */
2291 if (oldsp < PL_stack_sp) {
2292 SV *sv = *PL_stack_sp;
2293 if ((SvPADTMP(sv) || SvREADONLY(sv))) {
2295 SvREADONLY(sv) ? (sv == &PL_sv_undef) ? "undef"
2296 : "a readonly value" : "a temporary";
2301 /* sub:lvalue{} will take us here. */
2306 "Can't return %s from lvalue subroutine", what);
2310 leave_adjust_stacks(oldsp, oldsp, gimme, is_lval ? 3 : 2);
2312 if (lval & OPpDEREF) {
2313 /* lval_sub()->{...} and similar */
2317 TOPs = vivify_ref(TOPs, CxLVAL(cx) & OPpDEREF);
2323 assert(gimme == G_ARRAY);
2324 assert (!(lval & OPpDEREF));
2327 /* scan for bad return args */
2329 for (p = PL_stack_sp; p > oldsp; p--) {
2331 /* the PL_sv_undef exception is to allow things like
2332 * this to work, where PL_sv_undef acts as 'skip'
2333 * placeholder on the LHS of list assigns:
2334 * sub foo :lvalue { undef }
2335 * ($a, undef, foo(), $b) = 1..4;
2337 if (sv != &PL_sv_undef && (SvPADTMP(sv) || SvREADONLY(sv)))
2339 /* Might be flattened array after $#array = */
2340 what = SvREADONLY(sv)
2341 ? "a readonly value" : "a temporary";
2347 leave_adjust_stacks(oldsp, oldsp, gimme, is_lval ? 3 : 2);
2352 cx_popsub(cx); /* Stack values are safe: release CV and @_ ... */
2354 retop = cx->blk_sub.retop;
2365 const I32 cxix = dopoptosub(cxstack_ix);
2367 assert(cxstack_ix >= 0);
2368 if (cxix < cxstack_ix) {
2370 if (!( PL_curstackinfo->si_type == PERLSI_SORT
2371 || ( PL_curstackinfo->si_type == PERLSI_MULTICALL
2372 && (cxstack[0].cx_type & CXp_SUB_RE_FAKE))
2375 DIE(aTHX_ "Can't return outside a subroutine");
2377 * a sort block, which is a CXt_NULL not a CXt_SUB;
2378 * or a /(?{...})/ block.
2379 * Handle specially. */
2380 assert(CxTYPE(&cxstack[0]) == CXt_NULL
2381 || ( CxTYPE(&cxstack[0]) == CXt_SUB
2382 && (cxstack[0].cx_type & CXp_SUB_RE_FAKE)));
2383 if (cxstack_ix > 0) {
2384 /* See comment below about context popping. Since we know
2385 * we're scalar and not lvalue, we can preserve the return
2386 * value in a simpler fashion than there. */
2388 assert(cxstack[0].blk_gimme == G_SCALAR);
2389 if ( (sp != PL_stack_base)
2390 && !(SvFLAGS(sv) & (SVs_TEMP|SVs_PADTMP))
2392 *SP = sv_mortalcopy(sv);
2395 /* caller responsible for popping cxstack[0] */
2399 /* There are contexts that need popping. Doing this may free the
2400 * return value(s), so preserve them first, e.g. popping the plain
2401 * loop here would free $x:
2402 * sub f { { my $x = 1; return $x } }
2403 * We may also need to shift the args down; for example,
2404 * for (1,2) { return 3,4 }
2405 * leaves 1,2,3,4 on the stack. Both these actions can be done by
2406 * leave_adjust_stacks(). By calling it with and lvalue "pass
2407 * all" action, we just bump the ref count and mortalise the args
2408 * that need it, do a FREETMPS. The "scan the args and maybe copy
2409 * them" process will be repeated by whoever we tail-call (e.g.
2410 * pp_leaveeval), where any copying etc will be done. That is to
2411 * say, in this code path two scans of the args will be done; the
2412 * first just shifts and preserves; the second is the "real" arg
2413 * processing, based on the type of return.
2415 cx = &cxstack[cxix];
2417 if (cx->blk_gimme != G_VOID)
2418 leave_adjust_stacks(MARK, PL_stack_base + cx->blk_oldsp,
2420 CxTYPE(cx) == CXt_SUB && CvLVALUE(cx->blk_sub.cv)
2424 cx = &cxstack[cxix]; /* CX stack may have been realloced */
2427 /* Like in the branch above, we need to handle any extra junk on
2428 * the stack. But because we're not also popping extra contexts, we
2429 * don't have to worry about prematurely freeing args. So we just
2430 * need to do the bare minimum to handle junk, and leave the main
2431 * arg processing in the function we tail call, e.g. pp_leavesub.
2432 * In list context we have to splice out the junk; in scalar
2433 * context we can leave as-is (pp_leavesub will later return the
2434 * top stack element). But for an empty arg list, e.g.
2435 * for (1,2) { return }
2436 * we need to set sp = oldsp so that pp_leavesub knows to push
2437 * &PL_sv_undef onto the stack.
2440 cx = &cxstack[cxix];
2441 oldsp = PL_stack_base + cx->blk_oldsp;
2442 if (oldsp != MARK) {
2443 SSize_t nargs = SP - MARK;
2445 if (cx->blk_gimme == G_ARRAY) {
2446 /* shift return args to base of call stack frame */
2447 Move(MARK + 1, oldsp + 1, nargs, SV*);
2448 PL_stack_sp = oldsp + nargs;
2452 PL_stack_sp = oldsp;
2456 /* fall through to a normal exit */
2457 switch (CxTYPE(cx)) {
2459 return CxTRYBLOCK(cx)
2460 ? Perl_pp_leavetry(aTHX)
2461 : Perl_pp_leaveeval(aTHX);
2463 return CvLVALUE(cx->blk_sub.cv)
2464 ? Perl_pp_leavesublv(aTHX)
2465 : Perl_pp_leavesub(aTHX);
2467 return Perl_pp_leavewrite(aTHX);
2469 DIE(aTHX_ "panic: return, type=%u", (unsigned) CxTYPE(cx));
2473 /* find the enclosing loop or labelled loop and dounwind() back to it. */
2475 static PERL_CONTEXT *
2479 if (PL_op->op_flags & OPf_SPECIAL) {
2480 cxix = dopoptoloop(cxstack_ix);
2482 /* diag_listed_as: Can't "last" outside a loop block */
2483 Perl_croak(aTHX_ "Can't \"%s\" outside a loop block",
2489 const char * const label =
2490 PL_op->op_flags & OPf_STACKED
2491 ? SvPV(TOPs,label_len)
2492 : (label_len = strlen(cPVOP->op_pv), cPVOP->op_pv);
2493 const U32 label_flags =
2494 PL_op->op_flags & OPf_STACKED
2496 : (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0;
2498 cxix = dopoptolabel(label, label_len, label_flags);
2500 /* diag_listed_as: Label not found for "last %s" */
2501 Perl_croak(aTHX_ "Label not found for \"%s %"SVf"\"",
2503 SVfARG(PL_op->op_flags & OPf_STACKED
2504 && !SvGMAGICAL(TOPp1s)
2506 : newSVpvn_flags(label,
2508 label_flags | SVs_TEMP)));
2510 if (cxix < cxstack_ix)
2512 return &cxstack[cxix];
2521 cx = S_unwind_loop(aTHX);
2523 assert(CxTYPE_is_LOOP(cx));
2524 PL_stack_sp = PL_stack_base
2525 + (CxTYPE(cx) == CXt_LOOP_LIST
2526 ? cx->blk_loop.state_u.stack.basesp
2532 /* Stack values are safe: */
2534 cx_poploop(cx); /* release loop vars ... */
2536 nextop = cx->blk_loop.my_op->op_lastop->op_next;
2546 /* if not a bare 'next' in the main scope, search for it */
2548 if (!((PL_op->op_flags & OPf_SPECIAL) && CxTYPE_is_LOOP(cx)))
2549 cx = S_unwind_loop(aTHX);
2552 PL_curcop = cx->blk_oldcop;
2554 return (cx)->blk_loop.my_op->op_nextop;
2559 PERL_CONTEXT *cx = S_unwind_loop(aTHX);
2560 OP* redo_op = cx->blk_loop.my_op->op_redoop;
2562 if (redo_op->op_type == OP_ENTER) {
2563 /* pop one less context to avoid $x being freed in while (my $x..) */
2566 assert(CxTYPE(cx) == CXt_BLOCK);
2567 redo_op = redo_op->op_next;
2573 PL_curcop = cx->blk_oldcop;
2579 S_dofindlabel(pTHX_ OP *o, const char *label, STRLEN len, U32 flags, OP **opstack, OP **oplimit)
2582 static const char* const too_deep = "Target of goto is too deeply nested";
2584 PERL_ARGS_ASSERT_DOFINDLABEL;
2587 Perl_croak(aTHX_ "%s", too_deep);
2588 if (o->op_type == OP_LEAVE ||
2589 o->op_type == OP_SCOPE ||
2590 o->op_type == OP_LEAVELOOP ||
2591 o->op_type == OP_LEAVESUB ||
2592 o->op_type == OP_LEAVETRY)
2594 *ops++ = cUNOPo->op_first;
2596 Perl_croak(aTHX_ "%s", too_deep);
2599 if (o->op_flags & OPf_KIDS) {
2601 /* First try all the kids at this level, since that's likeliest. */
2602 for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) {
2603 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2604 STRLEN kid_label_len;
2605 U32 kid_label_flags;
2606 const char *kid_label = CopLABEL_len_flags(kCOP,
2607 &kid_label_len, &kid_label_flags);
2609 ( (kid_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ?
2612 (const U8*)kid_label, kid_label_len,
2613 (const U8*)label, len) == 0)
2615 (const U8*)label, len,
2616 (const U8*)kid_label, kid_label_len) == 0)
2617 : ( len == kid_label_len && ((kid_label == label)
2618 || memEQ(kid_label, label, len)))))
2622 for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) {
2623 if (kid == PL_lastgotoprobe)
2625 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2628 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2629 ops[-1]->op_type == OP_DBSTATE)
2634 if ((o = dofindlabel(kid, label, len, flags, ops, oplimit)))
2643 /* also used for: pp_dump() */
2651 #define GOTO_DEPTH 64
2652 OP *enterops[GOTO_DEPTH];
2653 const char *label = NULL;
2654 STRLEN label_len = 0;
2655 U32 label_flags = 0;
2656 const bool do_dump = (PL_op->op_type == OP_DUMP);
2657 static const char* const must_have_label = "goto must have label";
2659 if (PL_op->op_flags & OPf_STACKED) {
2660 /* goto EXPR or goto &foo */
2662 SV * const sv = POPs;
2665 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2666 /* This egregious kludge implements goto &subroutine */
2669 CV *cv = MUTABLE_CV(SvRV(sv));
2670 AV *arg = GvAV(PL_defgv);
2672 while (!CvROOT(cv) && !CvXSUB(cv)) {
2673 const GV * const gv = CvGV(cv);
2677 /* autoloaded stub? */
2678 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2680 autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv),
2682 GvNAMEUTF8(gv) ? SVf_UTF8 : 0);
2683 if (autogv && (cv = GvCV(autogv)))
2685 tmpstr = sv_newmortal();
2686 gv_efullname3(tmpstr, gv, NULL);
2687 DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr));
2689 DIE(aTHX_ "Goto undefined subroutine");
2692 cxix = dopoptosub(cxstack_ix);
2694 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2696 cx = &cxstack[cxix];
2697 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2698 if (CxTYPE(cx) == CXt_EVAL) {
2700 /* diag_listed_as: Can't goto subroutine from an eval-%s */
2701 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2703 /* diag_listed_as: Can't goto subroutine from an eval-%s */
2704 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2706 else if (CxMULTICALL(cx))
2707 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
2709 /* First do some returnish stuff. */
2711 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
2713 if (cxix < cxstack_ix) {
2720 /* protect @_ during save stack unwind. */
2722 SvREFCNT_inc_NN(sv_2mortal(MUTABLE_SV(arg)));
2724 assert(PL_scopestack_ix == cx->blk_oldscopesp);
2727 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
2728 /* this is part of cx_popsub_args() */
2729 AV* av = MUTABLE_AV(PAD_SVl(0));
2730 assert(AvARRAY(MUTABLE_AV(
2731 PadlistARRAY(CvPADLIST(cx->blk_sub.cv))[
2732 CvDEPTH(cx->blk_sub.cv)])) == PL_curpad);
2734 /* we are going to donate the current @_ from the old sub
2735 * to the new sub. This first part of the donation puts a
2736 * new empty AV in the pad[0] slot of the old sub,
2737 * unless pad[0] and @_ differ (e.g. if the old sub did
2738 * local *_ = []); in which case clear the old pad[0]
2739 * array in the usual way */
2740 if (av == arg || AvREAL(av))
2741 clear_defarray(av, av == arg);
2742 else CLEAR_ARGARRAY(av);
2745 /* don't restore PL_comppad here. It won't be needed if the
2746 * sub we're going to is non-XS, but restoring it early then
2747 * croaking (e.g. the "Goto undefined subroutine" below)
2748 * means the CX block gets processed again in dounwind,
2749 * but this time with the wrong PL_comppad */
2751 /* A destructor called during LEAVE_SCOPE could have undefined
2752 * our precious cv. See bug #99850. */
2753 if (!CvROOT(cv) && !CvXSUB(cv)) {
2754 const GV * const gv = CvGV(cv);
2756 SV * const tmpstr = sv_newmortal();
2757 gv_efullname3(tmpstr, gv, NULL);
2758 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",
2761 DIE(aTHX_ "Goto undefined subroutine");
2764 if (CxTYPE(cx) == CXt_SUB) {
2765 CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth;
2766 SvREFCNT_dec_NN(cx->blk_sub.cv);
2769 /* Now do some callish stuff. */
2771 const SSize_t items = arg ? AvFILL(arg) + 1 : 0;
2772 const bool m = arg ? cBOOL(SvRMAGICAL(arg)) : 0;
2777 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2779 /* put GvAV(defgv) back onto stack */
2781 EXTEND(SP, items+1); /* @_ could have been extended. */
2786 bool r = cBOOL(AvREAL(arg));
2787 for (index=0; index<items; index++)
2791 SV ** const svp = av_fetch(arg, index, 0);
2792 sv = svp ? *svp : NULL;
2794 else sv = AvARRAY(arg)[index];
2796 ? r ? SvREFCNT_inc_NN(sv_2mortal(sv)) : sv
2797 : sv_2mortal(newSVavdefelem(arg, index, 1));
2801 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
2802 /* Restore old @_ */
2803 CX_POP_SAVEARRAY(cx);
2806 retop = cx->blk_sub.retop;
2807 PL_comppad = cx->blk_sub.prevcomppad;
2808 PL_curpad = LIKELY(PL_comppad) ? AvARRAY(PL_comppad) : NULL;
2810 /* XS subs don't have a CXt_SUB, so pop it;
2811 * this is a cx_popblock(), less all the stuff we already did
2812 * for cx_topblock() earlier */
2813 PL_curcop = cx->blk_oldcop;
2816 /* Push a mark for the start of arglist */
2819 (void)(*CvXSUB(cv))(aTHX_ cv);
2824 PADLIST * const padlist = CvPADLIST(cv);
2826 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2828 /* partial unrolled cx_pushsub(): */
2830 cx->blk_sub.cv = cv;
2831 cx->blk_sub.olddepth = CvDEPTH(cv);
2834 SvREFCNT_inc_simple_void_NN(cv);
2835 if (CvDEPTH(cv) > 1) {
2836 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION))
2837 sub_crush_depth(cv);
2838 pad_push(padlist, CvDEPTH(cv));
2840 PL_curcop = cx->blk_oldcop;
2841 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2844 /* second half of donating @_ from the old sub to the
2845 * new sub: abandon the original pad[0] AV in the
2846 * new sub, and replace it with the donated @_.
2847 * pad[0] takes ownership of the extra refcount
2848 * we gave arg earlier */
2850 SvREFCNT_dec(PAD_SVl(0));
2851 PAD_SVl(0) = (SV *)arg;
2852 SvREFCNT_inc_simple_void_NN(arg);
2855 /* GvAV(PL_defgv) might have been modified on scope
2856 exit, so point it at arg again. */
2857 if (arg != GvAV(PL_defgv)) {
2858 AV * const av = GvAV(PL_defgv);
2859 GvAV(PL_defgv) = (AV *)SvREFCNT_inc_simple(arg);
2864 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2865 Perl_get_db_sub(aTHX_ NULL, cv);
2867 CV * const gotocv = get_cvs("DB::goto", 0);
2869 PUSHMARK( PL_stack_sp );
2870 call_sv(MUTABLE_SV(gotocv), G_SCALAR | G_NODEBUG);
2875 retop = CvSTART(cv);
2876 goto putback_return;
2881 label = SvPV_nomg_const(sv, label_len);
2882 label_flags = SvUTF8(sv);
2885 else if (!(PL_op->op_flags & OPf_SPECIAL)) {
2886 /* goto LABEL or dump LABEL */
2887 label = cPVOP->op_pv;
2888 label_flags = (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0;
2889 label_len = strlen(label);
2891 if (!(do_dump || label_len)) DIE(aTHX_ "%s", must_have_label);
2896 OP *gotoprobe = NULL;
2897 bool leaving_eval = FALSE;
2898 bool in_block = FALSE;
2899 PERL_CONTEXT *last_eval_cx = NULL;
2903 PL_lastgotoprobe = NULL;
2905 for (ix = cxstack_ix; ix >= 0; ix--) {
2907 switch (CxTYPE(cx)) {
2909 leaving_eval = TRUE;
2910 if (!CxTRYBLOCK(cx)) {
2911 gotoprobe = (last_eval_cx ?
2912 last_eval_cx->blk_eval.old_eval_root :
2917 /* else fall through */
2918 case CXt_LOOP_PLAIN:
2919 case CXt_LOOP_LAZYIV:
2920 case CXt_LOOP_LAZYSV:
2925 gotoprobe = OpSIBLING(cx->blk_oldcop);
2931 gotoprobe = OpSIBLING(cx->blk_oldcop);
2934 gotoprobe = PL_main_root;
2937 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
2938 gotoprobe = CvROOT(cx->blk_sub.cv);
2944 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2947 DIE(aTHX_ "panic: goto, type=%u, ix=%ld",
2948 CxTYPE(cx), (long) ix);
2949 gotoprobe = PL_main_root;
2955 retop = dofindlabel(gotoprobe, label, label_len, label_flags,
2956 enterops, enterops + GOTO_DEPTH);
2959 if ( (sibl1 = OpSIBLING(gotoprobe)) &&
2960 sibl1->op_type == OP_UNSTACK &&
2961 (sibl2 = OpSIBLING(sibl1)))
2963 retop = dofindlabel(sibl2,
2964 label, label_len, label_flags, enterops,
2965 enterops + GOTO_DEPTH);
2970 PL_lastgotoprobe = gotoprobe;
2973 DIE(aTHX_ "Can't find label %"UTF8f,
2974 UTF8fARG(label_flags, label_len, label));
2976 /* if we're leaving an eval, check before we pop any frames
2977 that we're not going to punt, otherwise the error
2980 if (leaving_eval && *enterops && enterops[1]) {
2982 for (i = 1; enterops[i]; i++)
2983 if (enterops[i]->op_type == OP_ENTERITER)
2984 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2987 if (*enterops && enterops[1]) {
2988 I32 i = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
2990 deprecate("\"goto\" to jump into a construct");
2993 /* pop unwanted frames */
2995 if (ix < cxstack_ix) {
2997 DIE(aTHX_ "panic: docatch: illegal ix=%ld", (long)ix);
3003 /* push wanted frames */
3005 if (*enterops && enterops[1]) {
3006 OP * const oldop = PL_op;
3007 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3008 for (; enterops[ix]; ix++) {
3009 PL_op = enterops[ix];
3010 /* Eventually we may want to stack the needed arguments
3011 * for each op. For now, we punt on the hard ones. */
3012 if (PL_op->op_type == OP_ENTERITER)
3013 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
3014 PL_op->op_ppaddr(aTHX);
3022 if (!retop) retop = PL_main_start;
3024 PL_restartop = retop;
3025 PL_do_undump = TRUE;
3029 PL_restartop = 0; /* hmm, must be GNU unexec().. */
3030 PL_do_undump = FALSE;
3048 anum = 0; (void)POPs;
3054 && SvTRUE(cop_hints_fetch_pvs(PL_curcop, "vmsish_exit", 0)))
3057 VMSISH_HUSHED || (PL_curcop->op_private & OPpHUSH_VMSISH);
3060 PL_exit_flags |= PERL_EXIT_EXPECTED;
3062 PUSHs(&PL_sv_undef);
3069 S_save_lines(pTHX_ AV *array, SV *sv)
3071 const char *s = SvPVX_const(sv);
3072 const char * const send = SvPVX_const(sv) + SvCUR(sv);
3075 PERL_ARGS_ASSERT_SAVE_LINES;
3077 while (s && s < send) {
3079 SV * const tmpstr = newSV_type(SVt_PVMG);
3081 t = (const char *)memchr(s, '\n', send - s);
3087 sv_setpvn(tmpstr, s, t - s);
3088 av_store(array, line++, tmpstr);
3096 Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context.
3098 0 is used as continue inside eval,
3100 3 is used for a die caught by an inner eval - continue inner loop
3102 See F<cop.h>: je_mustcatch, when set at any runlevel to TRUE, means eval ops must
3103 establish a local jmpenv to handle exception traps.
3108 S_docatch(pTHX_ OP *o)
3111 OP * const oldop = PL_op;
3115 assert(CATCH_GET == TRUE);
3122 assert(cxstack_ix >= 0);
3123 assert(CxTYPE(CX_CUR()) == CXt_EVAL);
3124 CX_CUR()->blk_eval.cur_top_env = PL_top_env;
3129 /* die caught by an inner eval - continue inner loop */
3130 if (PL_restartop && PL_restartjmpenv == PL_top_env) {
3131 PL_restartjmpenv = NULL;
3132 PL_op = PL_restartop;
3141 NOT_REACHED; /* NOTREACHED */
3150 =for apidoc find_runcv
3152 Locate the CV corresponding to the currently executing sub or eval.
3153 If C<db_seqp> is non_null, skip CVs that are in the DB package and populate
3154 C<*db_seqp> with the cop sequence number at the point that the DB:: code was
3155 entered. (This allows debuggers to eval in the scope of the breakpoint
3156 rather than in the scope of the debugger itself.)
3162 Perl_find_runcv(pTHX_ U32 *db_seqp)
3164 return Perl_find_runcv_where(aTHX_ 0, 0, db_seqp);
3167 /* If this becomes part of the API, it might need a better name. */
3169 Perl_find_runcv_where(pTHX_ U8 cond, IV arg, U32 *db_seqp)
3176 PL_curcop == &PL_compiling
3178 : PL_curcop->cop_seq;
3180 for (si = PL_curstackinfo; si; si = si->si_prev) {
3182 for (ix = si->si_cxix; ix >= 0; ix--) {
3183 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
3185 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
3186 cv = cx->blk_sub.cv;
3187 /* skip DB:: code */
3188 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
3189 *db_seqp = cx->blk_oldcop->cop_seq;
3192 if (cx->cx_type & CXp_SUB_RE)
3195 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
3196 cv = cx->blk_eval.cv;
3199 case FIND_RUNCV_padid_eq:
3201 || CvPADLIST(cv)->xpadl_id != (U32)arg)
3204 case FIND_RUNCV_level_eq:
3205 if (level++ != arg) continue;
3213 return cond == FIND_RUNCV_padid_eq ? NULL : PL_main_cv;
3217 /* Run yyparse() in a setjmp wrapper. Returns:
3218 * 0: yyparse() successful
3219 * 1: yyparse() failed
3223 S_try_yyparse(pTHX_ int gramtype)
3228 assert(CxTYPE(CX_CUR()) == CXt_EVAL);
3232 ret = yyparse(gramtype) ? 1 : 0;
3239 NOT_REACHED; /* NOTREACHED */
3246 /* Compile a require/do or an eval ''.
3248 * outside is the lexically enclosing CV (if any) that invoked us.
3249 * seq is the current COP scope value.
3250 * hh is the saved hints hash, if any.
3252 * Returns a bool indicating whether the compile was successful; if so,
3253 * PL_eval_start contains the first op of the compiled code; otherwise,
3256 * This function is called from two places: pp_require and pp_entereval.
3257 * These can be distinguished by whether PL_op is entereval.
3261 S_doeval_compile(pTHX_ U8 gimme, CV* outside, U32 seq, HV *hh)
3264 OP * const saveop = PL_op;
3265 bool clear_hints = saveop->op_type != OP_ENTEREVAL;
3266 COP * const oldcurcop = PL_curcop;
3267 bool in_require = (saveop->op_type == OP_REQUIRE);
3271 PL_in_eval = (in_require
3272 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
3274 ((PL_op->op_private & OPpEVAL_RE_REPARSING)
3275 ? EVAL_RE_REPARSING : 0)));
3279 evalcv = MUTABLE_CV(newSV_type(SVt_PVCV));
3281 assert(CxTYPE(CX_CUR()) == CXt_EVAL);
3282 CX_CUR()->blk_eval.cv = evalcv;
3283 CX_CUR()->blk_gimme = gimme;
3285 CvOUTSIDE_SEQ(evalcv) = seq;
3286 CvOUTSIDE(evalcv) = MUTABLE_CV(SvREFCNT_inc_simple(outside));
3288 /* set up a scratch pad */
3290 CvPADLIST_set(evalcv, pad_new(padnew_SAVE));
3291 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
3294 SAVEMORTALIZESV(evalcv); /* must remain until end of current statement */
3296 /* make sure we compile in the right package */
3298 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
3299 SAVEGENERICSV(PL_curstash);
3300 PL_curstash = (HV *)CopSTASH(PL_curcop);
3301 if (SvTYPE(PL_curstash) != SVt_PVHV) PL_curstash = NULL;
3302 else SvREFCNT_inc_simple_void(PL_curstash);
3304 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
3305 SAVESPTR(PL_beginav);
3306 PL_beginav = newAV();
3307 SAVEFREESV(PL_beginav);
3308 SAVESPTR(PL_unitcheckav);
3309 PL_unitcheckav = newAV();
3310 SAVEFREESV(PL_unitcheckav);
3313 ENTER_with_name("evalcomp");
3314 SAVESPTR(PL_compcv);
3317 /* try to compile it */
3319 PL_eval_root = NULL;
3320 PL_curcop = &PL_compiling;
3321 if ((saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
3322 PL_in_eval |= EVAL_KEEPERR;
3329 hv_clear(GvHV(PL_hintgv));
3332 PL_hints = saveop->op_private & OPpEVAL_COPHH
3333 ? oldcurcop->cop_hints : saveop->op_targ;
3335 /* making 'use re eval' not be in scope when compiling the
3336 * qr/mabye_has_runtime_code_block/ ensures that we don't get
3337 * infinite recursion when S_has_runtime_code() gives a false
3338 * positive: the second time round, HINT_RE_EVAL isn't set so we
3339 * don't bother calling S_has_runtime_code() */
3340 if (PL_in_eval & EVAL_RE_REPARSING)
3341 PL_hints &= ~HINT_RE_EVAL;
3344 /* SAVEHINTS created a new HV in PL_hintgv, which we need to GC */
3345 SvREFCNT_dec(GvHV(PL_hintgv));
3346 GvHV(PL_hintgv) = hh;
3349 SAVECOMPILEWARNINGS();
3351 if (PL_dowarn & G_WARN_ALL_ON)
3352 PL_compiling.cop_warnings = pWARN_ALL ;
3353 else if (PL_dowarn & G_WARN_ALL_OFF)
3354 PL_compiling.cop_warnings = pWARN_NONE ;
3356 PL_compiling.cop_warnings = pWARN_STD ;
3359 PL_compiling.cop_warnings =
3360 DUP_WARNINGS(oldcurcop->cop_warnings);
3361 cophh_free(CopHINTHASH_get(&PL_compiling));
3362 if (Perl_cop_fetch_label(aTHX_ oldcurcop, NULL, NULL)) {
3363 /* The label, if present, is the first entry on the chain. So rather
3364 than writing a blank label in front of it (which involves an
3365 allocation), just use the next entry in the chain. */
3366 PL_compiling.cop_hints_hash
3367 = cophh_copy(oldcurcop->cop_hints_hash->refcounted_he_next);
3368 /* Check the assumption that this removed the label. */
3369 assert(Perl_cop_fetch_label(aTHX_ &PL_compiling, NULL, NULL) == NULL);
3372 PL_compiling.cop_hints_hash = cophh_copy(oldcurcop->cop_hints_hash);
3375 CALL_BLOCK_HOOKS(bhk_eval, saveop);
3377 /* note that yyparse() may raise an exception, e.g. C<BEGIN{die}>,
3378 * so honour CATCH_GET and trap it here if necessary */
3381 /* compile the code */
3382 yystatus = (!in_require && CATCH_GET) ? S_try_yyparse(aTHX_ GRAMPROG) : yyparse(GRAMPROG);
3384 if (yystatus || PL_parser->error_count || !PL_eval_root) {
3385 SV *namesv = NULL; /* initialise to avoid compiler warning */
3390 /* note that if yystatus == 3, then the require/eval died during
3391 * compilation, so the EVAL CX block has already been popped, and
3392 * various vars restored */
3393 if (yystatus != 3) {
3395 op_free(PL_eval_root);
3396 PL_eval_root = NULL;
3398 SP = PL_stack_base + POPMARK; /* pop original mark */
3404 namesv = cx->blk_eval.old_namesv;
3410 if (yystatus == 3) {
3412 assert(CxTYPE(cx) == CXt_EVAL);
3413 namesv = cx->blk_eval.old_namesv;
3415 S_undo_inc_then_croak(aTHX_ namesv, errsv, FALSE);
3416 NOT_REACHED; /* NOTREACHED */
3419 if (!*(SvPV_nolen_const(errsv)))
3420 sv_setpvs(errsv, "Compilation error");
3422 if (gimme != G_ARRAY) PUSHs(&PL_sv_undef);
3427 /* Compilation successful. Now clean up */
3429 LEAVE_with_name("evalcomp");
3431 CopLINE_set(&PL_compiling, 0);
3432 SAVEFREEOP(PL_eval_root);
3433 cv_forget_slab(evalcv);
3435 DEBUG_x(dump_eval());
3437 /* Register with debugger: */
3438 if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
3439 CV * const cv = get_cvs("DB::postponed", 0);
3443 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3445 call_sv(MUTABLE_SV(cv), G_DISCARD);
3449 if (PL_unitcheckav) {
3450 OP *es = PL_eval_start;
3451 call_list(PL_scopestack_ix, PL_unitcheckav);
3455 CvDEPTH(evalcv) = 1;
3456 SP = PL_stack_base + POPMARK; /* pop original mark */
3457 PL_op = saveop; /* The caller may need it. */
3458 PL_parser->lex_state = LEX_NOTPARSING; /* $^S needs this. */
3466 S_check_type_and_open(pTHX_ SV *name)
3471 const char *p = SvPV_const(name, len);
3474 PERL_ARGS_ASSERT_CHECK_TYPE_AND_OPEN;
3476 /* checking here captures a reasonable error message when
3477 * PERL_DISABLE_PMC is true, but when PMC checks are enabled, the
3478 * user gets a confusing message about looking for the .pmc file
3479 * rather than for the .pm file so do the check in S_doopen_pm when
3480 * PMC is on instead of here. S_doopen_pm calls this func.
3481 * This check prevents a \0 in @INC causing problems.
3483 #ifdef PERL_DISABLE_PMC
3484 if (!IS_SAFE_PATHNAME(p, len, "require"))
3488 /* on Win32 stat is expensive (it does an open() and close() twice and
3489 a couple other IO calls), the open will fail with a dir on its own with
3490 errno EACCES, so only do a stat to separate a dir from a real EACCES
3491 caused by user perms */
3493 /* we use the value of errno later to see how stat() or open() failed.
3494 * We don't want it set if the stat succeeded but we still failed,
3495 * such as if the name exists, but is a directory */
3498 st_rc = PerlLIO_stat(p, &st);
3500 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
3505 retio = PerlIO_openn(aTHX_ ":", PERL_SCRIPT_MODE, -1, 0, 0, NULL, 1, &name);
3507 /* EACCES stops the INC search early in pp_require to implement
3508 feature RT #113422 */
3509 if(!retio && errno == EACCES) { /* exists but probably a directory */
3511 st_rc = PerlLIO_stat(p, &st);
3513 if(S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode))
3524 #ifndef PERL_DISABLE_PMC
3526 S_doopen_pm(pTHX_ SV *name)
3529 const char *p = SvPV_const(name, namelen);
3531 PERL_ARGS_ASSERT_DOOPEN_PM;
3533 /* check the name before trying for the .pmc name to avoid the
3534 * warning referring to the .pmc which the user probably doesn't
3535 * know or care about
3537 if (!IS_SAFE_PATHNAME(p, namelen, "require"))
3540 if (namelen > 3 && memEQs(p + namelen - 3, 3, ".pm")) {
3541 SV *const pmcsv = sv_newmortal();
3544 SvSetSV_nosteal(pmcsv,name);
3545 sv_catpvs(pmcsv, "c");
3547 pmcio = check_type_and_open(pmcsv);
3551 return check_type_and_open(name);
3554 # define doopen_pm(name) check_type_and_open(name)
3555 #endif /* !PERL_DISABLE_PMC */
3557 /* require doesn't search for absolute names, or when the name is
3558 explicitly relative the current directory */
3559 PERL_STATIC_INLINE bool
3560 S_path_is_searchable(const char *name)
3562 PERL_ARGS_ASSERT_PATH_IS_SEARCHABLE;
3564 if (PERL_FILE_IS_ABSOLUTE(name)
3566 || (*name == '.' && ((name[1] == '/' ||
3567 (name[1] == '.' && name[2] == '/'))
3568 || (name[1] == '\\' ||
3569 ( name[1] == '.' && name[2] == '\\')))
3572 || (*name == '.' && (name[1] == '/' ||
3573 (name[1] == '.' && name[2] == '/')))
3584 /* also used for: pp_dofile() */
3596 int vms_unixname = 0;
3599 const char *tryname = NULL;
3601 const U8 gimme = GIMME_V;
3602 int filter_has_file = 0;
3603 PerlIO *tryrsfp = NULL;
3604 SV *filter_cache = NULL;
3605 SV *filter_state = NULL;
3606 SV *filter_sub = NULL;
3610 bool path_searchable;
3611 I32 old_savestack_ix;
3615 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3616 sv = sv_2mortal(new_version(sv));
3617 if (!Perl_sv_derived_from_pvn(aTHX_ PL_patchlevel, STR_WITH_LEN("version"), 0))
3618 upg_version(PL_patchlevel, TRUE);
3619 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3620 if ( vcmp(sv,PL_patchlevel) <= 0 )
3621 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
3622 SVfARG(sv_2mortal(vnormal(sv))),
3623 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3627 if ( vcmp(sv,PL_patchlevel) > 0 ) {
3630 SV * const req = SvRV(sv);
3631 SV * const pv = *hv_fetchs(MUTABLE_HV(req), "original", FALSE);
3633 /* get the left hand term */
3634 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(req), "version", FALSE)));
3636 first = SvIV(*av_fetch(lav,0,0));
3637 if ( first > (int)PERL_REVISION /* probably 'use 6.0' */
3638 || hv_exists(MUTABLE_HV(req), "qv", 2 ) /* qv style */
3639 || av_tindex(lav) > 1 /* FP with > 3 digits */
3640 || strstr(SvPVX(pv),".0") /* FP with leading 0 */
3642 DIE(aTHX_ "Perl %"SVf" required--this is only "
3644 SVfARG(sv_2mortal(vnormal(req))),
3645 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3648 else { /* probably 'use 5.10' or 'use 5.8' */
3652 if (av_tindex(lav)>=1)
3653 second = SvIV(*av_fetch(lav,1,0));
3655 second /= second >= 600 ? 100 : 10;
3656 hintsv = Perl_newSVpvf(aTHX_ "v%d.%d.0",
3657 (int)first, (int)second);
3658 upg_version(hintsv, TRUE);
3660 DIE(aTHX_ "Perl %"SVf" required (did you mean %"SVf"?)"
3661 "--this is only %"SVf", stopped",
3662 SVfARG(sv_2mortal(vnormal(req))),
3663 SVfARG(sv_2mortal(vnormal(sv_2mortal(hintsv)))),
3664 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3673 DIE(aTHX_ "Missing or undefined argument to require");
3674 name = SvPV_nomg_const(sv, len);
3675 if (!(name && len > 0 && *name))
3676 DIE(aTHX_ "Missing or undefined argument to require");
3678 if (!IS_SAFE_PATHNAME(name, len, "require")) {
3679 DIE(aTHX_ "Can't locate %s: %s",
3680 pv_escape(newSVpvs_flags("",SVs_TEMP),SvPVX(sv),SvCUR(sv),
3681 SvCUR(sv)*2,NULL, SvUTF8(sv)?PERL_PV_ESCAPE_UNI:0),
3684 TAINT_PROPER("require");
3686 path_searchable = path_is_searchable(name);
3689 /* The key in the %ENV hash is in the syntax of file passed as the argument
3690 * usually this is in UNIX format, but sometimes in VMS format, which
3691 * can result in a module being pulled in more than once.
3692 * To prevent this, the key must be stored in UNIX format if the VMS
3693 * name can be translated to UNIX.
3697 tounixspec(name, SvPVX(sv_2mortal(newSVpv("", VMS_MAXRSS-1)))))
3699 unixlen = strlen(unixname);
3705 /* if not VMS or VMS name can not be translated to UNIX, pass it
3708 unixname = (char *) name;
3711 if (PL_op->op_type == OP_REQUIRE) {
3712 SV * const * const svp = hv_fetch(GvHVn(PL_incgv),
3713 unixname, unixlen, 0);
3715 if (*svp != &PL_sv_undef)
3718 DIE(aTHX_ "Attempt to reload %s aborted.\n"
3719 "Compilation failed in require", unixname);
3723 LOADING_FILE_PROBE(unixname);
3725 /* prepare to compile file */
3727 if (!path_searchable) {
3728 /* At this point, name is SvPVX(sv) */
3730 tryrsfp = doopen_pm(sv);
3732 if (!tryrsfp && !(errno == EACCES && !path_searchable)) {
3733 AV * const ar = GvAVn(PL_incgv);
3740 namesv = newSV_type(SVt_PV);
3741 for (i = 0; i <= AvFILL(ar); i++) {
3742 SV * const dirsv = *av_fetch(ar, i, TRUE);
3750 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3751 && !SvOBJECT(SvRV(loader)))
3753 loader = *av_fetch(MUTABLE_AV(SvRV(loader)), 0, TRUE);
3757 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3758 PTR2UV(SvRV(dirsv)), name);
3759 tryname = SvPVX_const(namesv);
3762 if (SvPADTMP(nsv)) {
3763 nsv = sv_newmortal();
3764 SvSetSV_nosteal(nsv,sv);
3767 ENTER_with_name("call_INC");
3775 if (SvGMAGICAL(loader)) {
3776 SV *l = sv_newmortal();
3777 sv_setsv_nomg(l, loader);
3780 if (sv_isobject(loader))
3781 count = call_method("INC", G_ARRAY);
3783 count = call_sv(loader, G_ARRAY);
3793 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3794 && !isGV_with_GP(SvRV(arg))) {
3795 filter_cache = SvRV(arg);
3802 if (SvROK(arg) && isGV_with_GP(SvRV(arg))) {
3806 if (isGV_with_GP(arg)) {
3807 IO * const io = GvIO((const GV *)arg);
3812 tryrsfp = IoIFP(io);
3813 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3814 PerlIO_close(IoOFP(io));
3825 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3827 SvREFCNT_inc_simple_void_NN(filter_sub);
3830 filter_state = SP[i];
3831 SvREFCNT_inc_simple_void(filter_state);
3835 if (!tryrsfp && (filter_cache || filter_sub)) {
3836 tryrsfp = PerlIO_open(BIT_BUCKET,
3842 /* FREETMPS may free our filter_cache */
3843 SvREFCNT_inc_simple_void(filter_cache);
3847 LEAVE_with_name("call_INC");
3849 /* Now re-mortalize it. */
3850 sv_2mortal(filter_cache);
3852 /* Adjust file name if the hook has set an %INC entry.
3853 This needs to happen after the FREETMPS above. */
3854 svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3856 tryname = SvPV_nolen_const(*svp);
3863 filter_has_file = 0;
3864 filter_cache = NULL;
3866 SvREFCNT_dec_NN(filter_state);
3867 filter_state = NULL;
3870 SvREFCNT_dec_NN(filter_sub);
3875 if (path_searchable) {
3880 dir = SvPV_nomg_const(dirsv, dirlen);
3886 if (!IS_SAFE_SYSCALL(dir, dirlen, "@INC entry", "require"))
3890 tounixpath(dir, SvPVX(sv_2mortal(newSVpv("", VMS_MAXRSS-1)))))
3893 sv_setpv(namesv, unixdir);
3894 sv_catpv(namesv, unixname);
3896 # ifdef __SYMBIAN32__
3897 if (PL_origfilename[0] &&
3898 PL_origfilename[1] == ':' &&
3899 !(dir[0] && dir[1] == ':'))
3900 Perl_sv_setpvf(aTHX_ namesv,
3905 Perl_sv_setpvf(aTHX_ namesv,
3909 /* The equivalent of
3910 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3911 but without the need to parse the format string, or
3912 call strlen on either pointer, and with the correct
3913 allocation up front. */
3915 char *tmp = SvGROW(namesv, dirlen + len + 2);
3917 memcpy(tmp, dir, dirlen);
3920 /* Avoid '<dir>//<file>' */
3921 if (!dirlen || *(tmp-1) != '/') {
3924 /* So SvCUR_set reports the correct length below */
3928 /* name came from an SV, so it will have a '\0' at the
3929 end that we can copy as part of this memcpy(). */
3930 memcpy(tmp, name, len + 1);
3932 SvCUR_set(namesv, dirlen + len + 1);
3937 TAINT_PROPER("require");
3938 tryname = SvPVX_const(namesv);
3939 tryrsfp = doopen_pm(namesv);
3941 if (tryname[0] == '.' && tryname[1] == '/') {
3943 while (*++tryname == '/') {}
3947 else if (errno == EMFILE || errno == EACCES) {
3948 /* no point in trying other paths if out of handles;
3949 * on the other hand, if we couldn't open one of the
3950 * files, then going on with the search could lead to
3951 * unexpected results; see perl #113422
3960 saved_errno = errno; /* sv_2mortal can realloc things */
3963 if (PL_op->op_type == OP_REQUIRE) {
3964 if(saved_errno == EMFILE || saved_errno == EACCES) {
3965 /* diag_listed_as: Can't locate %s */
3966 DIE(aTHX_ "Can't locate %s: %s: %s",
3967 name, tryname, Strerror(saved_errno));
3969 if (namesv) { /* did we lookup @INC? */
3970 AV * const ar = GvAVn(PL_incgv);
3972 SV *const msg = newSVpvs_flags("", SVs_TEMP);
3973 SV *const inc = newSVpvs_flags("", SVs_TEMP);
3974 for (i = 0; i <= AvFILL(ar); i++) {
3975 sv_catpvs(inc, " ");
3976 sv_catsv(inc, *av_fetch(ar, i, TRUE));
3978 if (len >= 4 && memEQ(name + len - 3, ".pm", 4)) {
3979 const char *c, *e = name + len - 3;
3980 sv_catpv(msg, " (you may need to install the ");
3981 for (c = name; c < e; c++) {
3983 sv_catpvs(msg, "::");
3986 sv_catpvn(msg, c, 1);
3989 sv_catpv(msg, " module)");
3991 else if (len >= 2 && memEQ(name + len - 2, ".h", 3)) {
3992 sv_catpv(msg, " (change .h to .ph maybe?) (did you run h2ph?)");
3994 else if (len >= 3 && memEQ(name + len - 3, ".ph", 4)) {
3995 sv_catpv(msg, " (did you run h2ph?)");
3998 /* diag_listed_as: Can't locate %s */
4000 "Can't locate %s in @INC%" SVf " (@INC contains:%" SVf ")",
4004 DIE(aTHX_ "Can't locate %s", name);
4011 SETERRNO(0, SS_NORMAL);
4013 /* Assume success here to prevent recursive requirement. */
4014 /* name is never assigned to again, so len is still strlen(name) */
4015 /* Check whether a hook in @INC has already filled %INC */
4017 (void)hv_store(GvHVn(PL_incgv),
4018 unixname, unixlen, newSVpv(tryname,0),0);
4020 SV** const svp = hv_fetch(GvHVn(PL_incgv), unixname, unixlen, 0);
4022 (void)hv_store(GvHVn(PL_incgv),
4023 unixname, unixlen, SvREFCNT_inc_simple(hook_sv), 0 );
4026 old_savestack_ix = PL_savestack_ix;
4027 SAVECOPFILE_FREE(&PL_compiling);
4028 CopFILE_set(&PL_compiling, tryname);
4029 lex_start(NULL, tryrsfp, 0);
4031 if (filter_sub || filter_cache) {
4032 /* We can use the SvPV of the filter PVIO itself as our cache, rather
4033 than hanging another SV from it. In turn, filter_add() optionally
4034 takes the SV to use as the filter (or creates a new SV if passed
4035 NULL), so simply pass in whatever value filter_cache has. */
4036 SV * const fc = filter_cache ? newSV(0) : NULL;
4038 if (fc) sv_copypv(fc, filter_cache);
4039 datasv = filter_add(S_run_user_filter, fc);
4040 IoLINES(datasv) = filter_has_file;
4041 IoTOP_GV(datasv) = MUTABLE_GV(filter_state);
4042 IoBOTTOM_GV(datasv) = MUTABLE_GV(filter_sub);
4045 /* switch to eval mode */
4046 cx = cx_pushblock(CXt_EVAL, gimme, SP, old_savestack_ix);
4047 cx_pusheval(cx, PL_op->op_next, newSVpv(name, 0));
4049 SAVECOPLINE(&PL_compiling);
4050 CopLINE_set(&PL_compiling, 0);
4054 if (doeval_compile(gimme, NULL, PL_curcop->cop_seq, NULL))
4055 op = DOCATCH(PL_eval_start);
4057 op = PL_op->op_next;
4059 LOADED_FILE_PROBE(unixname);
4064 /* This is a op added to hold the hints hash for
4065 pp_entereval. The hash can be modified by the code
4066 being eval'ed, so we return a copy instead. */
4071 mXPUSHs(MUTABLE_SV(hv_copy_hints_hv(MUTABLE_HV(cSVOP_sv))));
4081 const U8 gimme = GIMME_V;
4082 const U32 was = PL_breakable_sub_gen;
4083 char tbuf[TYPE_DIGITS(long) + 12];
4084 bool saved_delete = FALSE;
4085 char *tmpbuf = tbuf;
4088 U32 seq, lex_flags = 0;
4089 HV *saved_hh = NULL;
4090 const bool bytes = PL_op->op_private & OPpEVAL_BYTES;
4091 I32 old_savestack_ix;
4093 if (PL_op->op_private & OPpEVAL_HAS_HH) {
4094 saved_hh = MUTABLE_HV(SvREFCNT_inc(POPs));
4096 else if (PL_hints & HINT_LOCALIZE_HH || (
4097 PL_op->op_private & OPpEVAL_COPHH
4098 && PL_curcop->cop_hints & HINT_LOCALIZE_HH
4100 saved_hh = cop_hints_2hv(PL_curcop, 0);
4101 hv_magic(saved_hh, NULL, PERL_MAGIC_hints);
4105 /* make sure we've got a plain PV (no overload etc) before testing
4106 * for taint. Making a copy here is probably overkill, but better
4107 * safe than sorry */
4109 const char * const p = SvPV_const(sv, len);
4111 sv = newSVpvn_flags(p, len, SVs_TEMP | SvUTF8(sv));
4112 lex_flags |= LEX_START_COPIED;
4114 if (bytes && SvUTF8(sv))
4115 SvPVbyte_force(sv, len);
4117 else if (bytes && SvUTF8(sv)) {
4118 /* Don't modify someone else's scalar */
4121 (void)sv_2mortal(sv);
4122 SvPVbyte_force(sv,len);
4123 lex_flags |= LEX_START_COPIED;
4126 TAINT_IF(SvTAINTED(sv));
4127 TAINT_PROPER("eval");
4129 old_savestack_ix = PL_savestack_ix;
4131 lex_start(sv, NULL, lex_flags | (PL_op->op_private & OPpEVAL_UNICODE
4132 ? LEX_IGNORE_UTF8_HINTS
4133 : bytes ? LEX_EVALBYTES : LEX_START_SAME_FILTER
4137 /* switch to eval mode */
4139 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
4140 SV * const temp_sv = sv_newmortal();
4141 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
4142 (unsigned long)++PL_evalseq,
4143 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4144 tmpbuf = SvPVX(temp_sv);
4145 len = SvCUR(temp_sv);
4148 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
4149 SAVECOPFILE_FREE(&PL_compiling);
4150 CopFILE_set(&PL_compiling, tmpbuf+2);
4151 SAVECOPLINE(&PL_compiling);
4152 CopLINE_set(&PL_compiling, 1);
4153 /* special case: an eval '' executed within the DB package gets lexically
4154 * placed in the first non-DB CV rather than the current CV - this
4155 * allows the debugger to execute code, find lexicals etc, in the
4156 * scope of the code being debugged. Passing &seq gets find_runcv
4157 * to do the dirty work for us */
4158 runcv = find_runcv(&seq);
4160 cx = cx_pushblock((CXt_EVAL|CXp_REAL), gimme, SP, old_savestack_ix);
4161 cx_pusheval(cx, PL_op->op_next, NULL);
4163 /* prepare to compile string */
4165 if (PERLDB_LINE_OR_SAVESRC && PL_curstash != PL_debstash)
4166 save_lines(CopFILEAV(&PL_compiling), PL_parser->linestr);
4168 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
4169 deleting the eval's FILEGV from the stash before gv_check() runs
4170 (i.e. before run-time proper). To work around the coredump that
4171 ensues, we always turn GvMULTI_on for any globals that were
4172 introduced within evals. See force_ident(). GSAR 96-10-12 */
4173 char *const safestr = savepvn(tmpbuf, len);
4174 SAVEDELETE(PL_defstash, safestr, len);
4175 saved_delete = TRUE;
4180 if (doeval_compile(gimme, runcv, seq, saved_hh)) {
4181 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4182 ? PERLDB_LINE_OR_SAVESRC
4183 : PERLDB_SAVESRC_NOSUBS) {
4184 /* Retain the filegv we created. */
4185 } else if (!saved_delete) {
4186 char *const safestr = savepvn(tmpbuf, len);
4187 SAVEDELETE(PL_defstash, safestr, len);
4189 return DOCATCH(PL_eval_start);
4191 /* We have already left the scope set up earlier thanks to the LEAVE
4192 in doeval_compile(). */
4193 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4194 ? PERLDB_LINE_OR_SAVESRC
4195 : PERLDB_SAVESRC_INVALID) {
4196 /* Retain the filegv we created. */
4197 } else if (!saved_delete) {
4198 (void)hv_delete(PL_defstash, tmpbuf, len, G_DISCARD);
4200 return PL_op->op_next;
4212 /* grab this value before cx_popeval restores old PL_in_eval */
4213 bool keep = cBOOL(PL_in_eval & EVAL_KEEPERR);
4218 assert(CxTYPE(cx) == CXt_EVAL);
4220 oldsp = PL_stack_base + cx->blk_oldsp;
4221 gimme = cx->blk_gimme;
4223 /* did require return a false value? */
4224 if ( CxOLD_OP_TYPE(cx) == OP_REQUIRE
4225 && !(gimme == G_SCALAR
4226 ? SvTRUE(*PL_stack_sp)
4227 : PL_stack_sp > oldsp)
4229 namesv = cx->blk_eval.old_namesv;
4231 if (gimme == G_VOID)
4232 PL_stack_sp = oldsp;
4234 leave_adjust_stacks(oldsp, oldsp, gimme, 0);
4236 /* the cx_popeval does a leavescope, which frees the optree associated
4237 * with eval, which if it frees the nextstate associated with
4238 * PL_curcop, sets PL_curcop to NULL. Which can mess up freeing a
4239 * regex when running under 'use re Debug' because it needs PL_curcop
4240 * to get the current hints. So restore it early.
4242 PL_curcop = cx->blk_oldcop;
4247 retop = cx->blk_eval.retop;
4248 evalcv = cx->blk_eval.cv;
4252 assert(CvDEPTH(evalcv) == 1);
4254 CvDEPTH(evalcv) = 0;
4256 if (namesv) { /* require returned false */
4257 /* Unassume the success we assumed earlier. */
4258 S_undo_inc_then_croak(aTHX_ namesv, NULL, TRUE);
4259 NOT_REACHED; /* NOTREACHED */
4268 /* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
4269 close to the related Perl_create_eval_scope. */
4271 Perl_delete_eval_scope(pTHX)
4282 /* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
4283 also needed by Perl_fold_constants. */
4285 Perl_create_eval_scope(pTHX_ OP *retop, U32 flags)
4288 const U8 gimme = GIMME_V;
4290 cx = cx_pushblock((CXt_EVAL|CXp_TRYBLOCK), gimme,
4291 PL_stack_sp, PL_savestack_ix);
4292 cx_pusheval(cx, retop, NULL);
4294 PL_in_eval = EVAL_INEVAL;
4295 if (flags & G_KEEPERR)
4296 PL_in_eval |= EVAL_KEEPERR;
4299 if (flags & G_FAKINGEVAL) {
4300 PL_eval_root = PL_op; /* Only needed so that goto works right. */
4306 create_eval_scope(cLOGOP->op_other->op_next, 0);
4307 return DOCATCH(PL_op->op_next);
4320 assert(CxTYPE(cx) == CXt_EVAL);
4321 oldsp = PL_stack_base + cx->blk_oldsp;
4322 gimme = cx->blk_gimme;
4324 if (gimme == G_VOID)
4325 PL_stack_sp = oldsp;
4327 leave_adjust_stacks(oldsp, oldsp, gimme, 1);
4331 retop = cx->blk_eval.retop;
4342 const U8 gimme = GIMME_V;
4346 assert(!PL_op->op_targ); /* used to be set for lexical $_ */
4347 GvSV(PL_defgv) = SvREFCNT_inc(newsv);
4349 cx = cx_pushblock(CXt_GIVEN, gimme, SP, PL_savestack_ix);
4350 cx_pushgiven(cx, origsv);
4360 PERL_UNUSED_CONTEXT;
4363 assert(CxTYPE(cx) == CXt_GIVEN);
4364 oldsp = PL_stack_base + cx->blk_oldsp;
4365 gimme = cx->blk_gimme;
4367 if (gimme == G_VOID)
4368 PL_stack_sp = oldsp;
4370 leave_adjust_stacks(oldsp, oldsp, gimme, 1);
4380 /* Helper routines used by pp_smartmatch */
4382 S_make_matcher(pTHX_ REGEXP *re)
4384 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
4386 PERL_ARGS_ASSERT_MAKE_MATCHER;
4388 PM_SETRE(matcher, ReREFCNT_inc(re));
4390 SAVEFREEOP((OP *) matcher);
4391 ENTER_with_name("matcher"); SAVETMPS;
4397 S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
4402 PERL_ARGS_ASSERT_MATCHER_MATCHES_SV;
4404 PL_op = (OP *) matcher;
4407 (void) Perl_pp_match(aTHX);
4409 result = SvTRUEx(POPs);
4416 S_destroy_matcher(pTHX_ PMOP *matcher)
4418 PERL_ARGS_ASSERT_DESTROY_MATCHER;
4419 PERL_UNUSED_ARG(matcher);
4422 LEAVE_with_name("matcher");
4425 /* Do a smart match */
4428 DEBUG_M(Perl_deb(aTHX_ "Starting smart match resolution\n"));
4429 return do_smartmatch(NULL, NULL, 0);
4432 /* This version of do_smartmatch() implements the
4433 * table of smart matches that is found in perlsyn.
4436 S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other, const bool copied)
4440 bool object_on_left = FALSE;
4441 SV *e = TOPs; /* e is for 'expression' */
4442 SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */
4444 /* Take care only to invoke mg_get() once for each argument.
4445 * Currently we do this by copying the SV if it's magical. */
4447 if (!copied && SvGMAGICAL(d))
4448 d = sv_mortalcopy(d);
4455 e = sv_mortalcopy(e);
4457 /* First of all, handle overload magic of the rightmost argument */
4460 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n"));
4461 DEBUG_M(Perl_deb(aTHX_ " attempting overload\n"));
4463 tmpsv = amagic_call(d, e, smart_amg, AMGf_noleft);
4470 DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; continuing...\n"));
4473 SP -= 2; /* Pop the values */
4478 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-undef\n"));
4485 if (SvROK(e) && SvOBJECT(SvRV(e)) && (SvTYPE(SvRV(e)) != SVt_REGEXP)) {
4486 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n"));
4487 Perl_croak(aTHX_ "Smart matching a non-overloaded object breaks encapsulation");
4489 if (SvROK(d) && SvOBJECT(SvRV(d)) && (SvTYPE(SvRV(d)) != SVt_REGEXP))
4490 object_on_left = TRUE;
4493 if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVCV) {
4495 if (object_on_left) {
4496 goto sm_any_sub; /* Treat objects like scalars */
4498 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4499 /* Test sub truth for each key */
4501 bool andedresults = TRUE;
4502 HV *hv = (HV*) SvRV(d);
4503 I32 numkeys = hv_iterinit(hv);
4504 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-CodeRef\n"));
4507 while ( (he = hv_iternext(hv)) ) {
4508 DEBUG_M(Perl_deb(aTHX_ " testing hash key...\n"));
4509 ENTER_with_name("smartmatch_hash_key_test");
4512 PUSHs(hv_iterkeysv(he));
4514 c = call_sv(e, G_SCALAR);
4517 andedresults = FALSE;
4519 andedresults = SvTRUEx(POPs) && andedresults;
4521 LEAVE_with_name("smartmatch_hash_key_test");
4528 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4529 /* Test sub truth for each element */
4531 bool andedresults = TRUE;
4532 AV *av = (AV*) SvRV(d);
4533 const I32 len = av_tindex(av);
4534 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-CodeRef\n"));
4537 for (i = 0; i <= len; ++i) {
4538 SV * const * const svp = av_fetch(av, i, FALSE);
4539 DEBUG_M(Perl_deb(aTHX_ " testing array element...\n"));
4540 ENTER_with_name("smartmatch_array_elem_test");
4546 c = call_sv(e, G_SCALAR);
4549 andedresults = FALSE;
4551 andedresults = SvTRUEx(POPs) && andedresults;
4553 LEAVE_with_name("smartmatch_array_elem_test");
4562 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-CodeRef\n"));
4563 ENTER_with_name("smartmatch_coderef");
4568 c = call_sv(e, G_SCALAR);
4572 else if (SvTEMP(TOPs))
4573 SvREFCNT_inc_void(TOPs);
4575 LEAVE_with_name("smartmatch_coderef");
4580 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVHV) {
4581 if (object_on_left) {
4582 goto sm_any_hash; /* Treat objects like scalars */
4584 else if (!SvOK(d)) {
4585 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash ($a undef)\n"));
4588 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4589 /* Check that the key-sets are identical */
4591 HV *other_hv = MUTABLE_HV(SvRV(d));
4594 U32 this_key_count = 0,
4595 other_key_count = 0;
4596 HV *hv = MUTABLE_HV(SvRV(e));
4598 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Hash\n"));
4599 /* Tied hashes don't know how many keys they have. */
4600 tied = cBOOL(SvTIED_mg((SV*)hv, PERL_MAGIC_tied));
4601 other_tied = cBOOL(SvTIED_mg((const SV *)other_hv, PERL_MAGIC_tied));
4605 HV * const temp = other_hv;
4611 else if(HvUSEDKEYS((const HV *) hv) != HvUSEDKEYS(other_hv))
4615 /* The hashes have the same number of keys, so it suffices
4616 to check that one is a subset of the other. */
4617 (void) hv_iterinit(hv);
4618 while ( (he = hv_iternext(hv)) ) {
4619 SV *key = hv_iterkeysv(he);
4621 DEBUG_M(Perl_deb(aTHX_ " comparing hash key...\n"));
4624 if(!hv_exists_ent(other_hv, key, 0)) {
4625 (void) hv_iterinit(hv); /* reset iterator */
4631 (void) hv_iterinit(other_hv);
4632 while ( hv_iternext(other_hv) )
4636 other_key_count = HvUSEDKEYS(other_hv);
4638 if (this_key_count != other_key_count)
4643 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4644 AV * const other_av = MUTABLE_AV(SvRV(d));
4645 const SSize_t other_len = av_tindex(other_av) + 1;
4647 HV *hv = MUTABLE_HV(SvRV(e));
4649 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Hash\n"));
4650 for (i = 0; i < other_len; ++i) {
4651 SV ** const svp = av_fetch(other_av, i, FALSE);
4652 DEBUG_M(Perl_deb(aTHX_ " checking for key existence...\n"));
4653 if (svp) { /* ??? When can this not happen? */
4654 if (hv_exists_ent(hv, *svp, 0))
4660 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) {
4661 DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Hash\n"));
4664 PMOP * const matcher = make_matcher((REGEXP*) SvRV(d));
4666 HV *hv = MUTABLE_HV(SvRV(e));
4668 (void) hv_iterinit(hv);
4669 while ( (he = hv_iternext(hv)) ) {
4670 DEBUG_M(Perl_deb(aTHX_ " testing key against pattern...\n"));
4672 if (matcher_matches_sv(matcher, hv_iterkeysv(he))) {
4674 (void) hv_iterinit(hv);
4675 destroy_matcher(matcher);
4680 destroy_matcher(matcher);
4686 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash\n"));
4687 if (hv_exists_ent(MUTABLE_HV(SvRV(e)), d, 0))
4694 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVAV) {
4695 if (object_on_left) {
4696 goto sm_any_array; /* Treat objects like scalars */
4698 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4699 AV * const other_av = MUTABLE_AV(SvRV(e));
4700 const SSize_t other_len = av_tindex(other_av) + 1;
4703 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Array\n"));
4704 for (i = 0; i < other_len; ++i) {
4705 SV ** const svp = av_fetch(other_av, i, FALSE);
4707 DEBUG_M(Perl_deb(aTHX_ " testing for key existence...\n"));
4708 if (svp) { /* ??? When can this not happen? */
4709 if (hv_exists_ent(MUTABLE_HV(SvRV(d)), *svp, 0))
4715 if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4716 AV *other_av = MUTABLE_AV(SvRV(d));
4717 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Array\n"));
4718 if (av_tindex(MUTABLE_AV(SvRV(e))) != av_tindex(other_av))
4722 const SSize_t other_len = av_tindex(other_av);
4724 if (NULL == seen_this) {
4725 seen_this = newHV();
4726 (void) sv_2mortal(MUTABLE_SV(seen_this));
4728 if (NULL == seen_other) {
4729 seen_other = newHV();
4730 (void) sv_2mortal(MUTABLE_SV(seen_other));
4732 for(i = 0; i <= other_len; ++i) {
4733 SV * const * const this_elem = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4734 SV * const * const other_elem = av_fetch(other_av, i, FALSE);
4736 if (!this_elem || !other_elem) {
4737 if ((this_elem && SvOK(*this_elem))
4738 || (other_elem && SvOK(*other_elem)))
4741 else if (hv_exists_ent(seen_this,
4742 sv_2mortal(newSViv(PTR2IV(*this_elem))), 0) ||
4743 hv_exists_ent(seen_other,
4744 sv_2mortal(newSViv(PTR2IV(*other_elem))), 0))
4746 if (*this_elem != *other_elem)
4750 (void)hv_store_ent(seen_this,
4751 sv_2mortal(newSViv(PTR2IV(*this_elem))),
4753 (void)hv_store_ent(seen_other,
4754 sv_2mortal(newSViv(PTR2IV(*other_elem))),
4760 DEBUG_M(Perl_deb(aTHX_ " recursively comparing array element...\n"));
4761 (void) do_smartmatch(seen_this, seen_other, 0);
4763 DEBUG_M(Perl_deb(aTHX_ " recursion finished\n"));
4772 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) {
4773 DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Array\n"));
4776 PMOP * const matcher = make_matcher((REGEXP*) SvRV(d));
4777 const SSize_t this_len = av_tindex(MUTABLE_AV(SvRV(e)));
4780 for(i = 0; i <= this_len; ++i) {
4781 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4782 DEBUG_M(Perl_deb(aTHX_ " testing element against pattern...\n"));
4784 if (svp && matcher_matches_sv(matcher, *svp)) {
4786 destroy_matcher(matcher);
4791 destroy_matcher(matcher);
4795 else if (!SvOK(d)) {
4796 /* undef ~~ array */
4797 const SSize_t this_len = av_tindex(MUTABLE_AV(SvRV(e)));
4800 DEBUG_M(Perl_deb(aTHX_ " applying rule Undef-Array\n"));
4801 for (i = 0; i <= this_len; ++i) {
4802 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4803 DEBUG_M(Perl_deb(aTHX_ " testing for undef element...\n"));
4804 if (!svp || !SvOK(*svp))
4813 const SSize_t this_len = av_tindex(MUTABLE_AV(SvRV(e)));
4815 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Array\n"));
4816 for (i = 0; i <= this_len; ++i) {
4817 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4824 /* infinite recursion isn't supposed to happen here */
4825 DEBUG_M(Perl_deb(aTHX_ " recursively testing array element...\n"));
4826 (void) do_smartmatch(NULL, NULL, 1);
4828 DEBUG_M(Perl_deb(aTHX_ " recursion finished\n"));
4837 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_REGEXP) {
4838 if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4839 SV *t = d; d = e; e = t;
4840 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Regex\n"));
4843 else if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4844 SV *t = d; d = e; e = t;
4845 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Regex\n"));
4846 goto sm_regex_array;
4849 PMOP * const matcher = make_matcher((REGEXP*) SvRV(e));
4852 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Regex\n"));
4854 result = matcher_matches_sv(matcher, d);
4856 PUSHs(result ? &PL_sv_yes : &PL_sv_no);
4857 destroy_matcher(matcher);
4862 /* See if there is overload magic on left */
4863 else if (object_on_left && SvAMAGIC(d)) {
4865 DEBUG_M(Perl_deb(aTHX_ " applying rule Object-Any\n"));
4866 DEBUG_M(Perl_deb(aTHX_ " attempting overload\n"));
4869 tmpsv = amagic_call(d, e, smart_amg, AMGf_noright);
4877 DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; falling back...\n"));
4880 else if (!SvOK(d)) {
4881 /* undef ~~ scalar ; we already know that the scalar is SvOK */
4882 DEBUG_M(Perl_deb(aTHX_ " applying rule undef-Any\n"));
4887 if (SvNIOK(e) || (SvPOK(e) && looks_like_number(e) && SvNIOK(d))) {
4888 DEBUG_M(if (SvNIOK(e))
4889 Perl_deb(aTHX_ " applying rule Any-Num\n");
4891 Perl_deb(aTHX_ " applying rule Num-numish\n");
4893 /* numeric comparison */
4896 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4897 (void) Perl_pp_i_eq(aTHX);
4899 (void) Perl_pp_eq(aTHX);
4907 /* As a last resort, use string comparison */
4908 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Any\n"));
4911 return Perl_pp_seq(aTHX);
4918 const U8 gimme = GIMME_V;
4920 /* This is essentially an optimization: if the match
4921 fails, we don't want to push a context and then
4922 pop it again right away, so we skip straight
4923 to the op that follows the leavewhen.
4924 RETURNOP calls PUTBACK which restores the stack pointer after the POPs.
4926 if (!(PL_op->op_flags & OPf_SPECIAL) && !SvTRUEx(POPs))
4927 RETURNOP(cLOGOP->op_other->op_next);
4929 cx = cx_pushblock(CXt_WHEN, gimme, SP, PL_savestack_ix);
4943 assert(CxTYPE(cx) == CXt_WHEN);
4944 gimme = cx->blk_gimme;
4946 cxix = dopoptogivenfor(cxstack_ix);
4948 /* diag_listed_as: Can't "when" outside a topicalizer */
4949 DIE(aTHX_ "Can't \"%s\" outside a topicalizer",
4950 PL_op->op_flags & OPf_SPECIAL ? "default" : "when");
4952 oldsp = PL_stack_base + cx->blk_oldsp;
4953 if (gimme == G_VOID)
4954 PL_stack_sp = oldsp;
4956 leave_adjust_stacks(oldsp, oldsp, gimme, 1);
4958 /* pop the WHEN, BLOCK and anything else before the GIVEN/FOR */
4959 assert(cxix < cxstack_ix);
4962 cx = &cxstack[cxix];
4964 if (CxFOREACH(cx)) {
4965 /* emulate pp_next. Note that any stack(s) cleanup will be
4966 * done by the pp_unstack which op_nextop should point to */
4969 PL_curcop = cx->blk_oldcop;
4970 return cx->blk_loop.my_op->op_nextop;
4974 assert(cx->blk_givwhen.leave_op->op_type == OP_LEAVEGIVEN);
4975 return cx->blk_givwhen.leave_op;
4985 cxix = dopoptowhen(cxstack_ix);
4987 DIE(aTHX_ "Can't \"continue\" outside a when block");
4989 if (cxix < cxstack_ix)
4993 assert(CxTYPE(cx) == CXt_WHEN);
4994 PL_stack_sp = PL_stack_base + cx->blk_oldsp;
4998 nextop = cx->blk_givwhen.leave_op->op_next;
5009 cxix = dopoptogivenfor(cxstack_ix);
5011 DIE(aTHX_ "Can't \"break\" outside a given block");
5013 cx = &cxstack[cxix];
5015 DIE(aTHX_ "Can't \"break\" in a loop topicalizer");
5017 if (cxix < cxstack_ix)
5020 /* Restore the sp at the time we entered the given block */
5022 PL_stack_sp = PL_stack_base + cx->blk_oldsp;
5024 return cx->blk_givwhen.leave_op;
5028 S_doparseform(pTHX_ SV *sv)
5031 char *s = SvPV(sv, len);
5033 char *base = NULL; /* start of current field */
5034 I32 skipspaces = 0; /* number of contiguous spaces seen */
5035 bool noblank = FALSE; /* ~ or ~~ seen on this line */
5036 bool repeat = FALSE; /* ~~ seen on this line */
5037 bool postspace = FALSE; /* a text field may need right padding */
5040 U32 *linepc = NULL; /* position of last FF_LINEMARK */
5042 bool ischop; /* it's a ^ rather than a @ */
5043 bool unchopnum = FALSE; /* at least one @ (i.e. non-chop) num field seen */
5044 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
5048 PERL_ARGS_ASSERT_DOPARSEFORM;
5051 Perl_croak(aTHX_ "Null picture in formline");
5053 if (SvTYPE(sv) >= SVt_PVMG) {
5054 /* This might, of course, still return NULL. */
5055 mg = mg_find(sv, PERL_MAGIC_fm);
5057 sv_upgrade(sv, SVt_PVMG);
5061 /* still the same as previously-compiled string? */
5062 SV *old = mg->mg_obj;
5063 if ( !(!!SvUTF8(old) ^ !!SvUTF8(sv))
5064 && len == SvCUR(old)
5065 && strnEQ(SvPVX(old), SvPVX(sv), len)
5067 DEBUG_f(PerlIO_printf(Perl_debug_log,"Re-using compiled format\n"));
5071 DEBUG_f(PerlIO_printf(Perl_debug_log, "Re-compiling format\n"));
5072 Safefree(mg->mg_ptr);
5078 DEBUG_f(PerlIO_printf(Perl_debug_log, "Compiling format\n"));
5079 mg = sv_magicext(sv, NULL, PERL_MAGIC_fm, &PL_vtbl_fm, NULL, 0);
5082 sv_copy = newSVpvn_utf8(s, len, SvUTF8(sv));
5083 s = SvPV(sv_copy, len); /* work on the copy, not the original */
5087 /* estimate the buffer size needed */
5088 for (base = s; s <= send; s++) {
5089 if (*s == '\n' || *s == '@' || *s == '^')
5095 Newx(fops, maxops, U32);
5100 *fpc++ = FF_LINEMARK;
5101 noblank = repeat = FALSE;
5119 case ' ': case '\t':
5126 } /* else FALL THROUGH */
5134 *fpc++ = FF_LITERAL;
5142 *fpc++ = (U32)skipspaces;
5146 *fpc++ = FF_NEWLINE;
5150 arg = fpc - linepc + 1;
5157 *fpc++ = FF_LINEMARK;
5158 noblank = repeat = FALSE;
5167 ischop = s[-1] == '^';
5173 arg = (s - base) - 1;
5175 *fpc++ = FF_LITERAL;
5181 if (*s == '*') { /* @* or ^* */
5183 *fpc++ = 2; /* skip the @* or ^* */
5185 *fpc++ = FF_LINESNGL;
5188 *fpc++ = FF_LINEGLOB;
5190 else if (*s == '#' || (*s == '.' && s[1] == '#')) { /* @###, ^### */
5191 arg = ischop ? FORM_NUM_BLANK : 0;
5196 const char * const f = ++s;
5199 arg |= FORM_NUM_POINT + (s - f);
5201 *fpc++ = s - base; /* fieldsize for FETCH */
5202 *fpc++ = FF_DECIMAL;
5204 unchopnum |= ! ischop;
5206 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
5207 arg = ischop ? FORM_NUM_BLANK : 0;
5209 s++; /* skip the '0' first */
5213 const char * const f = ++s;
5216 arg |= FORM_NUM_POINT + (s - f);
5218 *fpc++ = s - base; /* fieldsize for FETCH */
5219 *fpc++ = FF_0DECIMAL;
5221 unchopnum |= ! ischop;
5223 else { /* text field */
5225 bool ismore = FALSE;
5228 while (*++s == '>') ;
5229 prespace = FF_SPACE;
5231 else if (*s == '|') {
5232 while (*++s == '|') ;
5233 prespace = FF_HALFSPACE;
5238 while (*++s == '<') ;
5241 if (*s == '.' && s[1] == '.' && s[2] == '.') {
5245 *fpc++ = s - base; /* fieldsize for FETCH */
5247 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
5250 *fpc++ = (U32)prespace; /* add SPACE or HALFSPACE */
5264 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
5267 mg->mg_ptr = (char *) fops;
5268 mg->mg_len = arg * sizeof(U32);
5269 mg->mg_obj = sv_copy;
5270 mg->mg_flags |= MGf_REFCOUNTED;
5272 if (unchopnum && repeat)
5273 Perl_die(aTHX_ "Repeated format line will never terminate (~~ and @#)");
5280 S_num_overflow(NV value, I32 fldsize, I32 frcsize)
5282 /* Can value be printed in fldsize chars, using %*.*f ? */
5286 int intsize = fldsize - (value < 0 ? 1 : 0);
5288 if (frcsize & FORM_NUM_POINT)
5290 frcsize &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
5293 while (intsize--) pwr *= 10.0;
5294 while (frcsize--) eps /= 10.0;
5297 if (value + eps >= pwr)
5300 if (value - eps <= -pwr)
5307 S_run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
5309 SV * const datasv = FILTER_DATA(idx);
5310 const int filter_has_file = IoLINES(datasv);
5311 SV * const filter_state = MUTABLE_SV(IoTOP_GV(datasv));
5312 SV * const filter_sub = MUTABLE_SV(IoBOTTOM_GV(datasv));
5317 char *prune_from = NULL;
5318 bool read_from_cache = FALSE;
5322 PERL_ARGS_ASSERT_RUN_USER_FILTER;
5324 assert(maxlen >= 0);
5327 /* I was having segfault trouble under Linux 2.2.5 after a
5328 parse error occurred. (Had to hack around it with a test
5329 for PL_parser->error_count == 0.) Solaris doesn't segfault --
5330 not sure where the trouble is yet. XXX */
5333 SV *const cache = datasv;
5336 const char *cache_p = SvPV(cache, cache_len);
5340 /* Running in block mode and we have some cached data already.
5342 if (cache_len >= umaxlen) {
5343 /* In fact, so much data we don't even need to call
5348 const char *const first_nl =
5349 (const char *)memchr(cache_p, '\n', cache_len);
5351 take = first_nl + 1 - cache_p;
5355 sv_catpvn(buf_sv, cache_p, take);
5356 sv_chop(cache, cache_p + take);
5357 /* Definitely not EOF */
5361 sv_catsv(buf_sv, cache);
5363 umaxlen -= cache_len;
5366 read_from_cache = TRUE;
5370 /* Filter API says that the filter appends to the contents of the buffer.
5371 Usually the buffer is "", so the details don't matter. But if it's not,
5372 then clearly what it contains is already filtered by this filter, so we
5373 don't want to pass it in a second time.
5374 I'm going to use a mortal in case the upstream filter croaks. */
5375 upstream = ((SvOK(buf_sv) && sv_len(buf_sv)) || SvGMAGICAL(buf_sv))
5376 ? sv_newmortal() : buf_sv;
5377 SvUPGRADE(upstream, SVt_PV);
5379 if (filter_has_file) {
5380 status = FILTER_READ(idx+1, upstream, 0);
5383 if (filter_sub && status >= 0) {
5387 ENTER_with_name("call_filter_sub");
5392 DEFSV_set(upstream);
5396 PUSHs(filter_state);
5399 count = call_sv(filter_sub, G_SCALAR|G_EVAL);
5409 SV * const errsv = ERRSV;
5410 if (SvTRUE_NN(errsv))
5411 err = newSVsv(errsv);
5417 LEAVE_with_name("call_filter_sub");
5420 if (SvGMAGICAL(upstream)) {
5422 if (upstream == buf_sv) mg_free(buf_sv);
5424 if (SvIsCOW(upstream)) sv_force_normal(upstream);
5425 if(!err && SvOK(upstream)) {
5426 got_p = SvPV_nomg(upstream, got_len);
5428 if (got_len > umaxlen) {
5429 prune_from = got_p + umaxlen;
5432 char *const first_nl = (char *)memchr(got_p, '\n', got_len);
5433 if (first_nl && first_nl + 1 < got_p + got_len) {
5434 /* There's a second line here... */
5435 prune_from = first_nl + 1;
5439 if (!err && prune_from) {
5440 /* Oh. Too long. Stuff some in our cache. */
5441 STRLEN cached_len = got_p + got_len - prune_from;
5442 SV *const cache = datasv;
5445 /* Cache should be empty. */
5446 assert(!SvCUR(cache));
5449 sv_setpvn(cache, prune_from, cached_len);
5450 /* If you ask for block mode, you may well split UTF-8 characters.
5451 "If it breaks, you get to keep both parts"
5452 (Your code is broken if you don't put them back together again
5453 before something notices.) */
5454 if (SvUTF8(upstream)) {
5457 if (SvPOK(upstream)) SvCUR_set(upstream, got_len - cached_len);
5459 /* Cannot just use sv_setpvn, as that could free the buffer
5460 before we have a chance to assign it. */
5461 sv_usepvn(upstream, savepvn(got_p, got_len - cached_len),
5462 got_len - cached_len);
5464 /* Can't yet be EOF */
5469 /* If they are at EOF but buf_sv has something in it, then they may never
5470 have touched the SV upstream, so it may be undefined. If we naively
5471 concatenate it then we get a warning about use of uninitialised value.
5473 if (!err && upstream != buf_sv &&
5475 sv_catsv_nomg(buf_sv, upstream);
5477 else if (SvOK(upstream)) (void)SvPV_force_nolen(buf_sv);
5480 IoLINES(datasv) = 0;
5482 SvREFCNT_dec(filter_state);
5483 IoTOP_GV(datasv) = NULL;
5486 SvREFCNT_dec(filter_sub);
5487 IoBOTTOM_GV(datasv) = NULL;
5489 filter_del(S_run_user_filter);
5495 if (status == 0 && read_from_cache) {
5496 /* If we read some data from the cache (and by getting here it implies
5497 that we emptied the cache) then we aren't yet at EOF, and mustn't
5498 report that to our caller. */
5505 * ex: set ts=8 sts=4 sw=4 et: