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))
46 const PERL_CONTEXT *cx;
49 if (PL_op->op_private & OPpOFFBYONE) {
50 if (!(cx = caller_cx(1,NULL))) RETPUSHUNDEF;
53 cxix = dopoptosub(cxstack_ix);
59 switch (cx->blk_gimme) {
80 PMOP *pm = (PMOP*)cLOGOP->op_other;
85 const regexp_engine *eng;
86 bool is_bare_re= FALSE;
88 if (PL_op->op_flags & OPf_STACKED) {
98 /* prevent recompiling under /o and ithreads. */
99 #if defined(USE_ITHREADS)
100 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
107 assert (re != (REGEXP*) &PL_sv_undef);
108 eng = re ? RX_ENGINE(re) : current_re_engine();
111 In the below logic: these are basically the same - check if this regcomp is part of a split.
113 (PL_op->op_pmflags & PMf_split )
114 (PL_op->op_next->op_type == OP_PUSHRE)
116 We could add a new mask for this and copy the PMf_split, if we did
117 some bit definition fiddling first.
119 For now we leave this
122 new_re = (eng->op_comp
124 : &Perl_re_op_compile
125 )(aTHX_ args, nargs, pm->op_code_list, eng, re,
127 (pm->op_pmflags & RXf_PMf_FLAGCOPYMASK),
129 (PL_op->op_flags & OPf_SPECIAL ? PMf_USE_RE_EVAL : 0));
131 if (pm->op_pmflags & PMf_HAS_CV)
132 ReANY(new_re)->qr_anoncv
133 = (CV*) SvREFCNT_inc(PAD_SV(PL_op->op_targ));
137 /* The match's LHS's get-magic might need to access this op's regexp
138 (e.g. $' =~ /$re/ while foo; see bug 70764). So we must call
139 get-magic now before we replace the regexp. Hopefully this hack can
140 be replaced with the approach described at
141 http://www.nntp.perl.org/group/perl.perl5.porters/2007/03/msg122415.html
143 if (pm->op_type == OP_MATCH) {
145 const bool was_tainted = TAINT_get;
146 if (pm->op_flags & OPf_STACKED)
148 else if (pm->op_private & OPpTARGET_MY)
149 lhs = PAD_SV(pm->op_targ);
152 /* Restore the previous value of PL_tainted (which may have been
153 modified by get-magic), to avoid incorrectly setting the
154 RXf_TAINTED flag with RX_TAINT_on further down. */
155 TAINT_set(was_tainted);
157 PERL_UNUSED_VAR(was_tainted);
160 tmp = reg_temp_copy(NULL, new_re);
161 ReREFCNT_dec(new_re);
167 PM_SETRE(pm, new_re);
171 if (TAINTING_get && TAINT_get) {
172 SvTAINTED_on((SV*)new_re);
176 #if !defined(USE_ITHREADS)
177 /* can't change the optree at runtime either */
178 /* PMf_KEEP is handled differently under threads to avoid these problems */
179 if (!RX_PRELEN(PM_GETRE(pm)) && PL_curpm)
181 if (pm->op_pmflags & PMf_KEEP) {
182 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
183 cLOGOP->op_first->op_next = PL_op->op_next;
196 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
197 PMOP * const pm = (PMOP*) cLOGOP->op_other;
198 SV * const dstr = cx->sb_dstr;
201 char *orig = cx->sb_orig;
202 REGEXP * const rx = cx->sb_rx;
204 REGEXP *old = PM_GETRE(pm);
211 PM_SETRE(pm,ReREFCNT_inc(rx));
214 rxres_restore(&cx->sb_rxres, rx);
216 if (cx->sb_iters++) {
217 const I32 saviters = cx->sb_iters;
218 if (cx->sb_iters > cx->sb_maxiters)
219 DIE(aTHX_ "Substitution loop");
221 SvGETMAGIC(TOPs); /* possibly clear taint on $1 etc: #67962 */
223 /* See "how taint works" above pp_subst() */
225 cx->sb_rxtainted |= SUBST_TAINT_REPL;
226 sv_catsv_nomg(dstr, POPs);
227 if (CxONCE(cx) || s < orig ||
228 !CALLREGEXEC(rx, s, cx->sb_strend, orig,
229 (s == m), cx->sb_targ, NULL,
230 (REXEC_IGNOREPOS|REXEC_NOT_FIRST|REXEC_FAIL_ON_UNDERFLOW)))
232 SV *targ = cx->sb_targ;
234 assert(cx->sb_strend >= s);
235 if(cx->sb_strend > s) {
236 if (DO_UTF8(dstr) && !SvUTF8(targ))
237 sv_catpvn_nomg_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
239 sv_catpvn_nomg(dstr, s, cx->sb_strend - s);
241 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
242 cx->sb_rxtainted |= SUBST_TAINT_PAT;
244 if (pm->op_pmflags & PMf_NONDESTRUCT) {
246 /* From here on down we're using the copy, and leaving the
247 original untouched. */
251 SV_CHECK_THINKFIRST_COW_DROP(targ);
252 if (isGV(targ)) Perl_croak_no_modify();
254 SvPV_set(targ, SvPVX(dstr));
255 SvCUR_set(targ, SvCUR(dstr));
256 SvLEN_set(targ, SvLEN(dstr));
259 SvPV_set(dstr, NULL);
262 mPUSHi(saviters - 1);
264 (void)SvPOK_only_UTF8(targ);
267 /* update the taint state of various various variables in
268 * preparation for final exit.
269 * See "how taint works" above pp_subst() */
271 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
272 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
273 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
275 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
277 if (!(cx->sb_rxtainted & SUBST_TAINT_BOOLRET)
278 && (cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT))
280 SvTAINTED_on(TOPs); /* taint return value */
281 /* needed for mg_set below */
283 cBOOL(cx->sb_rxtainted &
284 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL))
288 /* PL_tainted must be correctly set for this mg_set */
291 LEAVE_SCOPE(cx->sb_oldsave);
294 RETURNOP(pm->op_next);
295 assert(0); /* 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;
319 if (!(mg = mg_find_mglob(sv))) {
320 mg = sv_magicext_mglob(sv);
323 MgBYTEPOS_set(mg, sv, SvPVX(dstr), m - orig);
326 (void)ReREFCNT_inc(rx);
327 /* update the taint state of various various variables in preparation
328 * for calling the code block.
329 * See "how taint works" above pp_subst() */
331 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
332 cx->sb_rxtainted |= SUBST_TAINT_PAT;
334 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
335 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
336 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
338 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
340 if (cx->sb_iters > 1 && (cx->sb_rxtainted &
341 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL)))
342 SvTAINTED_on((pm->op_pmflags & PMf_NONDESTRUCT)
343 ? cx->sb_dstr : cx->sb_targ);
346 rxres_save(&cx->sb_rxres, rx);
348 RETURNOP(pm->op_pmstashstartu.op_pmreplstart);
352 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
357 PERL_ARGS_ASSERT_RXRES_SAVE;
360 if (!p || p[1] < RX_NPARENS(rx)) {
362 i = 7 + (RX_NPARENS(rx)+1) * 2;
364 i = 6 + (RX_NPARENS(rx)+1) * 2;
373 /* what (if anything) to free on croak */
374 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? RX_SUBBEG(rx) : NULL);
375 RX_MATCH_COPIED_off(rx);
376 *p++ = RX_NPARENS(rx);
379 *p++ = PTR2UV(RX_SAVED_COPY(rx));
380 RX_SAVED_COPY(rx) = NULL;
383 *p++ = PTR2UV(RX_SUBBEG(rx));
384 *p++ = (UV)RX_SUBLEN(rx);
385 *p++ = (UV)RX_SUBOFFSET(rx);
386 *p++ = (UV)RX_SUBCOFFSET(rx);
387 for (i = 0; i <= RX_NPARENS(rx); ++i) {
388 *p++ = (UV)RX_OFFS(rx)[i].start;
389 *p++ = (UV)RX_OFFS(rx)[i].end;
394 S_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
399 PERL_ARGS_ASSERT_RXRES_RESTORE;
402 RX_MATCH_COPY_FREE(rx);
403 RX_MATCH_COPIED_set(rx, *p);
405 RX_NPARENS(rx) = *p++;
408 if (RX_SAVED_COPY(rx))
409 SvREFCNT_dec (RX_SAVED_COPY(rx));
410 RX_SAVED_COPY(rx) = INT2PTR(SV*,*p);
414 RX_SUBBEG(rx) = INT2PTR(char*,*p++);
415 RX_SUBLEN(rx) = (I32)(*p++);
416 RX_SUBOFFSET(rx) = (I32)*p++;
417 RX_SUBCOFFSET(rx) = (I32)*p++;
418 for (i = 0; i <= RX_NPARENS(rx); ++i) {
419 RX_OFFS(rx)[i].start = (I32)(*p++);
420 RX_OFFS(rx)[i].end = (I32)(*p++);
425 S_rxres_free(pTHX_ void **rsp)
427 UV * const p = (UV*)*rsp;
429 PERL_ARGS_ASSERT_RXRES_FREE;
433 void *tmp = INT2PTR(char*,*p);
436 U32 i = 9 + p[1] * 2;
438 U32 i = 8 + p[1] * 2;
443 SvREFCNT_dec (INT2PTR(SV*,p[2]));
446 PoisonFree(p, i, sizeof(UV));
455 #define FORM_NUM_BLANK (1<<30)
456 #define FORM_NUM_POINT (1<<29)
460 dVAR; dSP; dMARK; dORIGMARK;
461 SV * const tmpForm = *++MARK;
462 SV *formsv; /* contains text of original format */
463 U32 *fpc; /* format ops program counter */
464 char *t; /* current append position in target string */
465 const char *f; /* current position in format string */
467 SV *sv = NULL; /* current item */
468 const char *item = NULL;/* string value of current item */
469 I32 itemsize = 0; /* length of current item, possibly truncated */
470 I32 fieldsize = 0; /* width of current field */
471 I32 lines = 0; /* number of lines that have been output */
472 bool chopspace = (strchr(PL_chopset, ' ') != NULL); /* does $: have space */
473 const char *chophere = NULL; /* where to chop current item */
474 STRLEN linemark = 0; /* pos of start of line in output */
476 bool gotsome = FALSE; /* seen at least one non-blank item on this line */
478 STRLEN linemax; /* estimate of output size in bytes */
479 bool item_is_utf8 = FALSE;
480 bool targ_is_utf8 = FALSE;
483 U8 *source; /* source of bytes to append */
484 STRLEN to_copy; /* how may bytes to append */
485 char trans; /* what chars to translate */
487 mg = doparseform(tmpForm);
489 fpc = (U32*)mg->mg_ptr;
490 /* the actual string the format was compiled from.
491 * with overload etc, this may not match tmpForm */
495 SvPV_force(PL_formtarget, len);
496 if (SvTAINTED(tmpForm) || SvTAINTED(formsv))
497 SvTAINTED_on(PL_formtarget);
498 if (DO_UTF8(PL_formtarget))
500 linemax = (SvCUR(formsv) * (IN_BYTES ? 1 : 3) + 1);
501 t = SvGROW(PL_formtarget, len + linemax + 1);
502 /* XXX from now onwards, SvCUR(PL_formtarget) is invalid */
504 f = SvPV_const(formsv, len);
508 const char *name = "???";
511 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
512 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
513 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
514 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
515 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
517 case FF_CHECKNL: name = "CHECKNL"; break;
518 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
519 case FF_SPACE: name = "SPACE"; break;
520 case FF_HALFSPACE: name = "HALFSPACE"; break;
521 case FF_ITEM: name = "ITEM"; break;
522 case FF_CHOP: name = "CHOP"; break;
523 case FF_LINEGLOB: name = "LINEGLOB"; break;
524 case FF_NEWLINE: name = "NEWLINE"; break;
525 case FF_MORE: name = "MORE"; break;
526 case FF_LINEMARK: name = "LINEMARK"; break;
527 case FF_END: name = "END"; break;
528 case FF_0DECIMAL: name = "0DECIMAL"; break;
529 case FF_LINESNGL: name = "LINESNGL"; break;
532 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
534 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
538 linemark = t - SvPVX(PL_formtarget);
548 item_is_utf8 = targ_is_utf8 ? !!DO_UTF8(formsv) : !!SvUTF8(formsv);
564 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
567 SvTAINTED_on(PL_formtarget);
573 const char *s = item = SvPV_const(sv, len);
576 itemsize = sv_len_utf8(sv);
577 if (itemsize != (I32)len) {
579 if (itemsize > fieldsize) {
580 itemsize = fieldsize;
581 itembytes = itemsize;
582 sv_pos_u2b(sv, &itembytes, 0);
586 send = chophere = s + itembytes;
596 sv_pos_b2u(sv, &itemsize);
600 item_is_utf8 = FALSE;
601 if (itemsize > fieldsize)
602 itemsize = fieldsize;
603 send = chophere = s + itemsize;
617 const char *s = item = SvPV_const(sv, len);
620 itemsize = sv_len_utf8(sv);
621 if (itemsize != (I32)len) {
623 if (itemsize <= fieldsize) {
624 const char *send = chophere = s + itemsize;
638 itemsize = fieldsize;
639 itembytes = itemsize;
640 sv_pos_u2b(sv, &itembytes, 0);
641 send = chophere = s + itembytes;
642 while (s < send || (s == send && isSPACE(*s))) {
652 if (strchr(PL_chopset, *s))
657 itemsize = chophere - item;
658 sv_pos_b2u(sv, &itemsize);
664 item_is_utf8 = FALSE;
665 if (itemsize <= fieldsize) {
666 const char *const send = chophere = s + itemsize;
680 itemsize = fieldsize;
681 send = chophere = s + itemsize;
682 while (s < send || (s == send && isSPACE(*s))) {
692 if (strchr(PL_chopset, *s))
697 itemsize = chophere - item;
703 arg = fieldsize - itemsize;
712 arg = fieldsize - itemsize;
726 /* convert to_copy from chars to bytes */
730 to_copy = s - source;
736 const char *s = chophere;
750 const bool oneline = fpc[-1] == FF_LINESNGL;
751 const char *s = item = SvPV_const(sv, len);
752 const char *const send = s + len;
754 item_is_utf8 = DO_UTF8(sv);
765 to_copy = s - SvPVX_const(sv) - 1;
779 /* append to_copy bytes from source to PL_formstring.
780 * item_is_utf8 implies source is utf8.
781 * if trans, translate certain characters during the copy */
786 SvCUR_set(PL_formtarget,
787 t - SvPVX_const(PL_formtarget));
789 if (targ_is_utf8 && !item_is_utf8) {
790 source = tmp = bytes_to_utf8(source, &to_copy);
792 if (item_is_utf8 && !targ_is_utf8) {
794 /* Upgrade targ to UTF8, and then we reduce it to
795 a problem we have a simple solution for.
796 Don't need get magic. */
797 sv_utf8_upgrade_nomg(PL_formtarget);
799 /* re-calculate linemark */
800 s = (U8*)SvPVX(PL_formtarget);
801 /* the bytes we initially allocated to append the
802 * whole line may have been gobbled up during the
803 * upgrade, so allocate a whole new line's worth
808 linemark = s - (U8*)SvPVX(PL_formtarget);
810 /* Easy. They agree. */
811 assert (item_is_utf8 == targ_is_utf8);
814 /* @* and ^* are the only things that can exceed
815 * the linemax, so grow by the output size, plus
816 * a whole new form's worth in case of any further
818 grow = linemax + to_copy;
820 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + grow + 1);
821 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
823 Copy(source, t, to_copy, char);
825 /* blank out ~ or control chars, depending on trans.
826 * works on bytes not chars, so relies on not
827 * matching utf8 continuation bytes */
829 U8 *send = s + to_copy;
832 if (trans == '~' ? (ch == '~') : isCNTRL(ch))
839 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) + to_copy);
847 #if defined(USE_LONG_DOUBLE)
849 ((arg & FORM_NUM_POINT) ?
850 "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl);
853 ((arg & FORM_NUM_POINT) ?
854 "%#0*.*f" : "%0*.*f");
859 #if defined(USE_LONG_DOUBLE)
861 ((arg & FORM_NUM_POINT) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl);
864 ((arg & FORM_NUM_POINT) ? "%#*.*f" : "%*.*f");
867 /* If the field is marked with ^ and the value is undefined,
869 if ((arg & FORM_NUM_BLANK) && !SvOK(sv)) {
877 /* overflow evidence */
878 if (num_overflow(value, fieldsize, arg)) {
884 /* Formats aren't yet marked for locales, so assume "yes". */
886 STORE_NUMERIC_STANDARD_SET_LOCAL();
887 arg &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
888 my_snprintf(t, SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget)), fmt, (int) fieldsize, (int) arg, value);
889 RESTORE_NUMERIC_STANDARD();
896 while (t-- > (SvPVX(PL_formtarget) + linemark) && *t == ' ') ;
904 if (arg) { /* repeat until fields exhausted? */
910 t = SvPVX(PL_formtarget) + linemark;
917 const char *s = chophere;
918 const char *send = item + len;
920 while (isSPACE(*s) && (s < send))
925 arg = fieldsize - itemsize;
932 if (strnEQ(s1," ",3)) {
933 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
944 assert(t < SvPVX_const(PL_formtarget) + SvLEN(PL_formtarget));
946 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
948 SvUTF8_on(PL_formtarget);
949 FmLINES(PL_formtarget) += lines;
951 if (fpc[-1] == FF_BLANK)
952 RETURNOP(cLISTOP->op_first);
964 if (PL_stack_base + *PL_markstack_ptr == SP) {
966 if (GIMME_V == G_SCALAR)
968 RETURNOP(PL_op->op_next->op_next);
970 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
971 Perl_pp_pushmark(aTHX); /* push dst */
972 Perl_pp_pushmark(aTHX); /* push src */
973 ENTER_with_name("grep"); /* enter outer scope */
976 if (PL_op->op_private & OPpGREP_LEX)
977 SAVESPTR(PAD_SVl(PL_op->op_targ));
980 ENTER_with_name("grep_item"); /* enter inner scope */
983 src = PL_stack_base[*PL_markstack_ptr];
984 if (SvPADTMP(src) && !IS_PADGV(src)) {
985 src = PL_stack_base[*PL_markstack_ptr] = sv_mortalcopy(src);
989 if (PL_op->op_private & OPpGREP_LEX)
990 PAD_SVl(PL_op->op_targ) = src;
995 if (PL_op->op_type == OP_MAPSTART)
996 Perl_pp_pushmark(aTHX); /* push top */
997 return ((LOGOP*)PL_op->op_next)->op_other;
1003 const I32 gimme = GIMME_V;
1004 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
1010 /* first, move source pointer to the next item in the source list */
1011 ++PL_markstack_ptr[-1];
1013 /* if there are new items, push them into the destination list */
1014 if (items && gimme != G_VOID) {
1015 /* might need to make room back there first */
1016 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
1017 /* XXX this implementation is very pessimal because the stack
1018 * is repeatedly extended for every set of items. Is possible
1019 * to do this without any stack extension or copying at all
1020 * by maintaining a separate list over which the map iterates
1021 * (like foreach does). --gsar */
1023 /* everything in the stack after the destination list moves
1024 * towards the end the stack by the amount of room needed */
1025 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
1027 /* items to shift up (accounting for the moved source pointer) */
1028 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
1030 /* This optimization is by Ben Tilly and it does
1031 * things differently from what Sarathy (gsar)
1032 * is describing. The downside of this optimization is
1033 * that leaves "holes" (uninitialized and hopefully unused areas)
1034 * to the Perl stack, but on the other hand this
1035 * shouldn't be a problem. If Sarathy's idea gets
1036 * implemented, this optimization should become
1037 * irrelevant. --jhi */
1039 shift = count; /* Avoid shifting too often --Ben Tilly */
1043 dst = (SP += shift);
1044 PL_markstack_ptr[-1] += shift;
1045 *PL_markstack_ptr += shift;
1049 /* copy the new items down to the destination list */
1050 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
1051 if (gimme == G_ARRAY) {
1052 /* add returned items to the collection (making mortal copies
1053 * if necessary), then clear the current temps stack frame
1054 * *except* for those items. We do this splicing the items
1055 * into the start of the tmps frame (so some items may be on
1056 * the tmps stack twice), then moving PL_tmps_floor above
1057 * them, then freeing the frame. That way, the only tmps that
1058 * accumulate over iterations are the return values for map.
1059 * We have to do to this way so that everything gets correctly
1060 * freed if we die during the map.
1064 /* make space for the slice */
1065 EXTEND_MORTAL(items);
1066 tmpsbase = PL_tmps_floor + 1;
1067 Move(PL_tmps_stack + tmpsbase,
1068 PL_tmps_stack + tmpsbase + items,
1069 PL_tmps_ix - PL_tmps_floor,
1071 PL_tmps_ix += items;
1076 sv = sv_mortalcopy(sv);
1078 PL_tmps_stack[tmpsbase++] = SvREFCNT_inc_simple(sv);
1080 /* clear the stack frame except for the items */
1081 PL_tmps_floor += items;
1083 /* FREETMPS may have cleared the TEMP flag on some of the items */
1086 SvTEMP_on(PL_tmps_stack[--tmpsbase]);
1089 /* scalar context: we don't care about which values map returns
1090 * (we use undef here). And so we certainly don't want to do mortal
1091 * copies of meaningless values. */
1092 while (items-- > 0) {
1094 *dst-- = &PL_sv_undef;
1102 LEAVE_with_name("grep_item"); /* exit inner scope */
1105 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
1107 (void)POPMARK; /* pop top */
1108 LEAVE_with_name("grep"); /* exit outer scope */
1109 (void)POPMARK; /* pop src */
1110 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1111 (void)POPMARK; /* pop dst */
1112 SP = PL_stack_base + POPMARK; /* pop original mark */
1113 if (gimme == G_SCALAR) {
1114 if (PL_op->op_private & OPpGREP_LEX) {
1115 SV* sv = sv_newmortal();
1116 sv_setiv(sv, items);
1124 else if (gimme == G_ARRAY)
1131 ENTER_with_name("grep_item"); /* enter inner scope */
1134 /* set $_ to the new source item */
1135 src = PL_stack_base[PL_markstack_ptr[-1]];
1136 if (SvPADTMP(src) && !IS_PADGV(src)) src = sv_mortalcopy(src);
1138 if (PL_op->op_private & OPpGREP_LEX)
1139 PAD_SVl(PL_op->op_targ) = src;
1143 RETURNOP(cLOGOP->op_other);
1152 if (GIMME == G_ARRAY)
1154 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1155 return cLOGOP->op_other;
1165 if (GIMME == G_ARRAY) {
1166 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1170 SV * const targ = PAD_SV(PL_op->op_targ);
1173 if (PL_op->op_private & OPpFLIP_LINENUM) {
1174 if (GvIO(PL_last_in_gv)) {
1175 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1178 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1180 flip = SvIV(sv) == SvIV(GvSV(gv));
1186 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1187 if (PL_op->op_flags & OPf_SPECIAL) {
1195 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1198 sv_setpvs(TARG, "");
1204 /* This code tries to decide if "$left .. $right" should use the
1205 magical string increment, or if the range is numeric (we make
1206 an exception for .."0" [#18165]). AMS 20021031. */
1208 #define RANGE_IS_NUMERIC(left,right) ( \
1209 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1210 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1211 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1212 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1213 && (!SvOK(right) || looks_like_number(right))))
1219 if (GIMME == G_ARRAY) {
1225 if (RANGE_IS_NUMERIC(left,right)) {
1228 if ((SvOK(left) && !SvIOK(left) && SvNV_nomg(left) < IV_MIN) ||
1229 (SvOK(right) && (SvIOK(right)
1230 ? SvIsUV(right) && SvUV(right) > IV_MAX
1231 : SvNV_nomg(right) > IV_MAX)))
1232 DIE(aTHX_ "Range iterator outside integer range");
1233 i = SvIV_nomg(left);
1234 max = SvIV_nomg(right);
1237 if (j > SSize_t_MAX)
1238 Perl_croak(aTHX_ "Out of memory during list extend");
1245 SV * const sv = sv_2mortal(newSViv(i++));
1251 const char * const lpv = SvPV_nomg_const(left, llen);
1252 const char * const tmps = SvPV_nomg_const(right, len);
1254 SV *sv = newSVpvn_flags(lpv, llen, SvUTF8(left)|SVs_TEMP);
1255 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1257 if (strEQ(SvPVX_const(sv),tmps))
1259 sv = sv_2mortal(newSVsv(sv));
1266 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1270 if (PL_op->op_private & OPpFLIP_LINENUM) {
1271 if (GvIO(PL_last_in_gv)) {
1272 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1275 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1276 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1284 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1285 sv_catpvs(targ, "E0");
1295 static const char * const context_name[] = {
1297 NULL, /* CXt_WHEN never actually needs "block" */
1298 NULL, /* CXt_BLOCK never actually needs "block" */
1299 NULL, /* CXt_GIVEN never actually needs "block" */
1300 NULL, /* CXt_LOOP_FOR never actually needs "loop" */
1301 NULL, /* CXt_LOOP_PLAIN never actually needs "loop" */
1302 NULL, /* CXt_LOOP_LAZYSV never actually needs "loop" */
1303 NULL, /* CXt_LOOP_LAZYIV never actually needs "loop" */
1311 S_dopoptolabel(pTHX_ const char *label, STRLEN len, U32 flags)
1316 PERL_ARGS_ASSERT_DOPOPTOLABEL;
1318 for (i = cxstack_ix; i >= 0; i--) {
1319 const PERL_CONTEXT * const cx = &cxstack[i];
1320 switch (CxTYPE(cx)) {
1326 /* diag_listed_as: Exiting subroutine via %s */
1327 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1328 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1329 if (CxTYPE(cx) == CXt_NULL)
1332 case CXt_LOOP_LAZYIV:
1333 case CXt_LOOP_LAZYSV:
1335 case CXt_LOOP_PLAIN:
1337 STRLEN cx_label_len = 0;
1338 U32 cx_label_flags = 0;
1339 const char *cx_label = CxLABEL_len_flags(cx, &cx_label_len, &cx_label_flags);
1341 ( (cx_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ?
1344 (const U8*)cx_label, cx_label_len,
1345 (const U8*)label, len) == 0)
1347 (const U8*)label, len,
1348 (const U8*)cx_label, cx_label_len) == 0)
1349 : (len == cx_label_len && ((cx_label == label)
1350 || memEQ(cx_label, label, len))) )) {
1351 DEBUG_l(Perl_deb(aTHX_ "(poptolabel(): skipping label at cx=%ld %s)\n",
1352 (long)i, cx_label));
1355 DEBUG_l( Perl_deb(aTHX_ "(poptolabel(): found label at cx=%ld %s)\n", (long)i, label));
1366 Perl_dowantarray(pTHX)
1369 const I32 gimme = block_gimme();
1370 return (gimme == G_VOID) ? G_SCALAR : gimme;
1374 Perl_block_gimme(pTHX)
1377 const I32 cxix = dopoptosub(cxstack_ix);
1381 switch (cxstack[cxix].blk_gimme) {
1389 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1390 assert(0); /* NOTREACHED */
1396 Perl_is_lvalue_sub(pTHX)
1399 const I32 cxix = dopoptosub(cxstack_ix);
1400 assert(cxix >= 0); /* We should only be called from inside subs */
1402 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1403 return CxLVAL(cxstack + cxix);
1408 /* only used by PUSHSUB */
1410 Perl_was_lvalue_sub(pTHX)
1413 const I32 cxix = dopoptosub(cxstack_ix-1);
1414 assert(cxix >= 0); /* We should only be called from inside subs */
1416 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1417 return CxLVAL(cxstack + cxix);
1423 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1428 PERL_ARGS_ASSERT_DOPOPTOSUB_AT;
1430 for (i = startingblock; i >= 0; i--) {
1431 const PERL_CONTEXT * const cx = &cxstk[i];
1432 switch (CxTYPE(cx)) {
1436 /* in sub foo { /(?{...})/ }, foo ends up on the CX stack
1437 * twice; the first for the normal foo() call, and the second
1438 * for a faked up re-entry into the sub to execute the
1439 * code block. Hide this faked entry from the world. */
1440 if (cx->cx_type & CXp_SUB_RE_FAKE)
1444 DEBUG_l( Perl_deb(aTHX_ "(dopoptosub_at(): found sub at cx=%ld)\n", (long)i));
1452 S_dopoptoeval(pTHX_ I32 startingblock)
1456 for (i = startingblock; i >= 0; i--) {
1457 const PERL_CONTEXT *cx = &cxstack[i];
1458 switch (CxTYPE(cx)) {
1462 DEBUG_l( Perl_deb(aTHX_ "(dopoptoeval(): found eval at cx=%ld)\n", (long)i));
1470 S_dopoptoloop(pTHX_ I32 startingblock)
1474 for (i = startingblock; i >= 0; i--) {
1475 const PERL_CONTEXT * const cx = &cxstack[i];
1476 switch (CxTYPE(cx)) {
1482 /* diag_listed_as: Exiting subroutine via %s */
1483 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1484 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1485 if ((CxTYPE(cx)) == CXt_NULL)
1488 case CXt_LOOP_LAZYIV:
1489 case CXt_LOOP_LAZYSV:
1491 case CXt_LOOP_PLAIN:
1492 DEBUG_l( Perl_deb(aTHX_ "(dopoptoloop(): found loop at cx=%ld)\n", (long)i));
1500 S_dopoptogiven(pTHX_ I32 startingblock)
1504 for (i = startingblock; i >= 0; i--) {
1505 const PERL_CONTEXT *cx = &cxstack[i];
1506 switch (CxTYPE(cx)) {
1510 DEBUG_l( Perl_deb(aTHX_ "(dopoptogiven(): found given at cx=%ld)\n", (long)i));
1512 case CXt_LOOP_PLAIN:
1513 assert(!CxFOREACHDEF(cx));
1515 case CXt_LOOP_LAZYIV:
1516 case CXt_LOOP_LAZYSV:
1518 if (CxFOREACHDEF(cx)) {
1519 DEBUG_l( Perl_deb(aTHX_ "(dopoptogiven(): found foreach at cx=%ld)\n", (long)i));
1528 S_dopoptowhen(pTHX_ I32 startingblock)
1532 for (i = startingblock; i >= 0; i--) {
1533 const PERL_CONTEXT *cx = &cxstack[i];
1534 switch (CxTYPE(cx)) {
1538 DEBUG_l( Perl_deb(aTHX_ "(dopoptowhen(): found when at cx=%ld)\n", (long)i));
1546 Perl_dounwind(pTHX_ I32 cxix)
1551 if (!PL_curstackinfo) /* can happen if die during thread cloning */
1554 while (cxstack_ix > cxix) {
1556 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1557 DEBUG_CX("UNWIND"); \
1558 /* Note: we don't need to restore the base context info till the end. */
1559 switch (CxTYPE(cx)) {
1562 continue; /* not break */
1570 case CXt_LOOP_LAZYIV:
1571 case CXt_LOOP_LAZYSV:
1573 case CXt_LOOP_PLAIN:
1584 PERL_UNUSED_VAR(optype);
1588 Perl_qerror(pTHX_ SV *err)
1592 PERL_ARGS_ASSERT_QERROR;
1595 if (PL_in_eval & EVAL_KEEPERR) {
1596 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1600 sv_catsv(ERRSV, err);
1603 sv_catsv(PL_errors, err);
1605 Perl_warn(aTHX_ "%"SVf, SVfARG(err));
1607 ++PL_parser->error_count;
1611 Perl_die_unwind(pTHX_ SV *msv)
1614 SV *exceptsv = sv_mortalcopy(msv);
1615 U8 in_eval = PL_in_eval;
1616 PERL_ARGS_ASSERT_DIE_UNWIND;
1623 * Historically, perl used to set ERRSV ($@) early in the die
1624 * process and rely on it not getting clobbered during unwinding.
1625 * That sucked, because it was liable to get clobbered, so the
1626 * setting of ERRSV used to emit the exception from eval{} has
1627 * been moved to much later, after unwinding (see just before
1628 * JMPENV_JUMP below). However, some modules were relying on the
1629 * early setting, by examining $@ during unwinding to use it as
1630 * a flag indicating whether the current unwinding was caused by
1631 * an exception. It was never a reliable flag for that purpose,
1632 * being totally open to false positives even without actual
1633 * clobberage, but was useful enough for production code to
1634 * semantically rely on it.
1636 * We'd like to have a proper introspective interface that
1637 * explicitly describes the reason for whatever unwinding
1638 * operations are currently in progress, so that those modules
1639 * work reliably and $@ isn't further overloaded. But we don't
1640 * have one yet. In its absence, as a stopgap measure, ERRSV is
1641 * now *additionally* set here, before unwinding, to serve as the
1642 * (unreliable) flag that it used to.
1644 * This behaviour is temporary, and should be removed when a
1645 * proper way to detect exceptional unwinding has been developed.
1646 * As of 2010-12, the authors of modules relying on the hack
1647 * are aware of the issue, because the modules failed on
1648 * perls 5.13.{1..7} which had late setting of $@ without this
1649 * early-setting hack.
1651 if (!(in_eval & EVAL_KEEPERR)) {
1652 SvTEMP_off(exceptsv);
1653 sv_setsv(ERRSV, exceptsv);
1656 if (in_eval & EVAL_KEEPERR) {
1657 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1661 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1662 && PL_curstackinfo->si_prev)
1674 JMPENV *restartjmpenv;
1677 if (cxix < cxstack_ix)
1680 POPBLOCK(cx,PL_curpm);
1681 if (CxTYPE(cx) != CXt_EVAL) {
1683 const char* message = SvPVx_const(exceptsv, msglen);
1684 PerlIO_write(Perl_error_log, (const char *)"panic: die ", 11);
1685 PerlIO_write(Perl_error_log, message, msglen);
1689 namesv = cx->blk_eval.old_namesv;
1690 oldcop = cx->blk_oldcop;
1691 restartjmpenv = cx->blk_eval.cur_top_env;
1692 restartop = cx->blk_eval.retop;
1694 if (gimme == G_SCALAR)
1695 *++newsp = &PL_sv_undef;
1696 PL_stack_sp = newsp;
1700 /* LEAVE could clobber PL_curcop (see save_re_context())
1701 * XXX it might be better to find a way to avoid messing with
1702 * PL_curcop in save_re_context() instead, but this is a more
1703 * minimal fix --GSAR */
1706 if (optype == OP_REQUIRE) {
1707 (void)hv_store(GvHVn(PL_incgv),
1708 SvPVX_const(namesv),
1709 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
1711 /* note that unlike pp_entereval, pp_require isn't
1712 * supposed to trap errors. So now that we've popped the
1713 * EVAL that pp_require pushed, and processed the error
1714 * message, rethrow the error */
1715 Perl_croak(aTHX_ "%"SVf"Compilation failed in require",
1716 SVfARG(exceptsv ? exceptsv : newSVpvs_flags("Unknown error\n",
1719 if (!(in_eval & EVAL_KEEPERR))
1720 sv_setsv(ERRSV, exceptsv);
1721 PL_restartjmpenv = restartjmpenv;
1722 PL_restartop = restartop;
1724 assert(0); /* NOTREACHED */
1728 write_to_stderr(exceptsv);
1730 assert(0); /* NOTREACHED */
1735 dVAR; dSP; dPOPTOPssrl;
1736 if (SvTRUE(left) != SvTRUE(right))
1743 =for apidoc caller_cx
1745 The XSUB-writer's equivalent of L<caller()|perlfunc/caller>. The
1746 returned C<PERL_CONTEXT> structure can be interrogated to find all the
1747 information returned to Perl by C<caller>. Note that XSUBs don't get a
1748 stack frame, so C<caller_cx(0, NULL)> will return information for the
1749 immediately-surrounding Perl code.
1751 This function skips over the automatic calls to C<&DB::sub> made on the
1752 behalf of the debugger. If the stack frame requested was a sub called by
1753 C<DB::sub>, the return value will be the frame for the call to
1754 C<DB::sub>, since that has the correct line number/etc. for the call
1755 site. If I<dbcxp> is non-C<NULL>, it will be set to a pointer to the
1756 frame for the sub call itself.
1761 const PERL_CONTEXT *
1762 Perl_caller_cx(pTHX_ I32 count, const PERL_CONTEXT **dbcxp)
1764 I32 cxix = dopoptosub(cxstack_ix);
1765 const PERL_CONTEXT *cx;
1766 const PERL_CONTEXT *ccstack = cxstack;
1767 const PERL_SI *top_si = PL_curstackinfo;
1770 /* we may be in a higher stacklevel, so dig down deeper */
1771 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1772 top_si = top_si->si_prev;
1773 ccstack = top_si->si_cxstack;
1774 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1778 /* caller() should not report the automatic calls to &DB::sub */
1779 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1780 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1784 cxix = dopoptosub_at(ccstack, cxix - 1);
1787 cx = &ccstack[cxix];
1788 if (dbcxp) *dbcxp = cx;
1790 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1791 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1792 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1793 field below is defined for any cx. */
1794 /* caller() should not report the automatic calls to &DB::sub */
1795 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1796 cx = &ccstack[dbcxix];
1806 const PERL_CONTEXT *cx;
1807 const PERL_CONTEXT *dbcx;
1809 const HEK *stash_hek;
1811 bool has_arg = MAXARG && TOPs;
1820 cx = caller_cx(count + !!(PL_op->op_private & OPpOFFBYONE), &dbcx);
1822 if (GIMME != G_ARRAY) {
1830 assert(CopSTASH(cx->blk_oldcop));
1831 stash_hek = SvTYPE(CopSTASH(cx->blk_oldcop)) == SVt_PVHV
1832 ? HvNAME_HEK((HV*)CopSTASH(cx->blk_oldcop))
1834 if (GIMME != G_ARRAY) {
1837 PUSHs(&PL_sv_undef);
1840 sv_sethek(TARG, stash_hek);
1849 PUSHs(&PL_sv_undef);
1852 sv_sethek(TARG, stash_hek);
1855 mPUSHs(newSVpv(OutCopFILE(cx->blk_oldcop), 0));
1856 lcop = closest_cop(cx->blk_oldcop, cx->blk_oldcop->op_sibling,
1857 cx->blk_sub.retop, TRUE);
1859 lcop = cx->blk_oldcop;
1860 mPUSHi((I32)CopLINE(lcop));
1863 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1864 GV * const cvgv = CvGV(dbcx->blk_sub.cv);
1865 /* So is ccstack[dbcxix]. */
1866 if (cvgv && isGV(cvgv)) {
1867 SV * const sv = newSV(0);
1868 gv_efullname3(sv, cvgv, NULL);
1870 PUSHs(boolSV(CxHASARGS(cx)));
1873 PUSHs(newSVpvs_flags("(unknown)", SVs_TEMP));
1874 PUSHs(boolSV(CxHASARGS(cx)));
1878 PUSHs(newSVpvs_flags("(eval)", SVs_TEMP));
1881 gimme = (I32)cx->blk_gimme;
1882 if (gimme == G_VOID)
1883 PUSHs(&PL_sv_undef);
1885 PUSHs(boolSV((gimme & G_WANT) == G_ARRAY));
1886 if (CxTYPE(cx) == CXt_EVAL) {
1888 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
1889 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
1890 SvCUR(cx->blk_eval.cur_text)-2,
1891 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
1895 else if (cx->blk_eval.old_namesv) {
1896 mPUSHs(newSVsv(cx->blk_eval.old_namesv));
1899 /* eval BLOCK (try blocks have old_namesv == 0) */
1901 PUSHs(&PL_sv_undef);
1902 PUSHs(&PL_sv_undef);
1906 PUSHs(&PL_sv_undef);
1907 PUSHs(&PL_sv_undef);
1909 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)
1910 && CopSTASH_eq(PL_curcop, PL_debstash))
1912 AV * const ary = cx->blk_sub.argarray;
1913 const SSize_t off = AvARRAY(ary) - AvALLOC(ary);
1915 Perl_init_dbargs(aTHX);
1917 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1918 av_extend(PL_dbargs, AvFILLp(ary) + off);
1919 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1920 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1922 mPUSHi(CopHINTS_get(cx->blk_oldcop));
1925 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
1927 if (old_warnings == pWARN_NONE)
1928 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1929 else if (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0)
1930 mask = &PL_sv_undef ;
1931 else if (old_warnings == pWARN_ALL ||
1932 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1933 /* Get the bit mask for $warnings::Bits{all}, because
1934 * it could have been extended by warnings::register */
1936 HV * const bits = get_hv("warnings::Bits", 0);
1937 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
1938 mask = newSVsv(*bits_all);
1941 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1945 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
1949 PUSHs(cx->blk_oldcop->cop_hints_hash ?
1950 sv_2mortal(newRV_noinc(MUTABLE_SV(cop_hints_2hv(cx->blk_oldcop, 0))))
1961 if (MAXARG < 1 || (!TOPs && !POPs))
1962 tmps = NULL, len = 0;
1964 tmps = SvPVx_const(POPs, len);
1965 sv_resetpvn(tmps, len, CopSTASH(PL_curcop));
1970 /* 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 + cxstack[cxstack_ix].blk_oldsp;
1982 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1983 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1987 const I32 gimme = G_ARRAY;
1989 GV * const gv = PL_DBgv;
1992 if (gv && isGV_with_GP(gv))
1995 if (!cv || (!CvROOT(cv) && !CvXSUB(cv)))
1996 DIE(aTHX_ "No DB::DB routine defined");
1998 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1999 /* don't do recursive DB::DB call */
2013 (void)(*CvXSUB(cv))(aTHX_ cv);
2019 PUSHBLOCK(cx, CXt_SUB, SP);
2021 cx->blk_sub.retop = PL_op->op_next;
2023 if (CvDEPTH(cv) >= 2) {
2024 PERL_STACK_OVERFLOW_CHECK();
2025 pad_push(CvPADLIST(cv), CvDEPTH(cv));
2028 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), CvDEPTH(cv));
2029 RETURNOP(CvSTART(cv));
2036 /* SVs on the stack that have any of the flags passed in are left as is.
2037 Other SVs are protected via the mortals stack if lvalue is true, and
2038 copied otherwise. */
2041 S_adjust_stack_on_leave(pTHX_ SV **newsp, SV **sp, SV **mark, I32 gimme,
2042 U32 flags, bool lvalue)
2045 PERL_ARGS_ASSERT_ADJUST_STACK_ON_LEAVE;
2047 if (flags & SVs_PADTMP) {
2048 flags &= ~SVs_PADTMP;
2051 if (gimme == G_SCALAR) {
2053 *++newsp = ((SvFLAGS(*SP) & flags) || (padtmp && SvPADTMP(*SP)))
2056 ? sv_2mortal(SvREFCNT_inc_simple_NN(*SP))
2057 : sv_mortalcopy(*SP);
2059 /* MEXTEND() only updates MARK, so reuse it instead of newsp. */
2062 *++MARK = &PL_sv_undef;
2066 else if (gimme == G_ARRAY) {
2067 /* in case LEAVE wipes old return values */
2068 while (++MARK <= SP) {
2069 if ((SvFLAGS(*MARK) & flags) || (padtmp && SvPADTMP(*MARK)))
2073 ? sv_2mortal(SvREFCNT_inc_simple_NN(*MARK))
2074 : sv_mortalcopy(*MARK);
2075 TAINT_NOT; /* Each item is independent */
2078 /* When this function was called with MARK == newsp, we reach this
2079 * point with SP == newsp. */
2089 I32 gimme = GIMME_V;
2091 ENTER_with_name("block");
2094 PUSHBLOCK(cx, CXt_BLOCK, SP);
2107 if (PL_op->op_flags & OPf_SPECIAL) {
2108 cx = &cxstack[cxstack_ix];
2109 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
2114 gimme = OP_GIMME(PL_op, (cxstack_ix >= 0) ? gimme : G_SCALAR);
2117 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP,
2118 PL_op->op_private & OPpLVALUE);
2119 PL_curpm = newpm; /* Don't pop $1 et al till now */
2121 LEAVE_with_name("block");
2130 const I32 gimme = GIMME_V;
2131 void *itervar; /* location of the iteration variable */
2132 U8 cxtype = CXt_LOOP_FOR;
2134 ENTER_with_name("loop1");
2137 if (PL_op->op_targ) { /* "my" variable */
2138 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
2139 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
2140 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
2141 SVs_PADSTALE, SVs_PADSTALE);
2143 SAVEPADSVANDMORTALIZE(PL_op->op_targ);
2145 itervar = PL_comppad;
2147 itervar = &PAD_SVl(PL_op->op_targ);
2150 else { /* symbol table variable */
2151 GV * const gv = MUTABLE_GV(POPs);
2152 SV** svp = &GvSV(gv);
2153 save_pushptrptr(gv, SvREFCNT_inc(*svp), SAVEt_GVSV);
2155 itervar = (void *)gv;
2158 if (PL_op->op_private & OPpITER_DEF)
2159 cxtype |= CXp_FOR_DEF;
2161 ENTER_with_name("loop2");
2163 PUSHBLOCK(cx, cxtype, SP);
2164 PUSHLOOP_FOR(cx, itervar, MARK);
2165 if (PL_op->op_flags & OPf_STACKED) {
2166 SV *maybe_ary = POPs;
2167 if (SvTYPE(maybe_ary) != SVt_PVAV) {
2169 SV * const right = maybe_ary;
2172 if (RANGE_IS_NUMERIC(sv,right)) {
2173 cx->cx_type &= ~CXTYPEMASK;
2174 cx->cx_type |= CXt_LOOP_LAZYIV;
2175 /* Make sure that no-one re-orders cop.h and breaks our
2177 assert(CxTYPE(cx) == CXt_LOOP_LAZYIV);
2178 #ifdef NV_PRESERVES_UV
2179 if ((SvOK(sv) && ((SvNV_nomg(sv) < (NV)IV_MIN) ||
2180 (SvNV_nomg(sv) > (NV)IV_MAX)))
2182 (SvOK(right) && ((SvNV_nomg(right) > (NV)IV_MAX) ||
2183 (SvNV_nomg(right) < (NV)IV_MIN))))
2185 if ((SvOK(sv) && ((SvNV_nomg(sv) <= (NV)IV_MIN)
2187 ((SvNV_nomg(sv) > 0) &&
2188 ((SvUV_nomg(sv) > (UV)IV_MAX) ||
2189 (SvNV_nomg(sv) > (NV)UV_MAX)))))
2191 (SvOK(right) && ((SvNV_nomg(right) <= (NV)IV_MIN)
2193 ((SvNV_nomg(right) > 0) &&
2194 ((SvUV_nomg(right) > (UV)IV_MAX) ||
2195 (SvNV_nomg(right) > (NV)UV_MAX))
2198 DIE(aTHX_ "Range iterator outside integer range");
2199 cx->blk_loop.state_u.lazyiv.cur = SvIV_nomg(sv);
2200 cx->blk_loop.state_u.lazyiv.end = SvIV_nomg(right);
2202 /* for correct -Dstv display */
2203 cx->blk_oldsp = sp - PL_stack_base;
2207 cx->cx_type &= ~CXTYPEMASK;
2208 cx->cx_type |= CXt_LOOP_LAZYSV;
2209 /* Make sure that no-one re-orders cop.h and breaks our
2211 assert(CxTYPE(cx) == CXt_LOOP_LAZYSV);
2212 cx->blk_loop.state_u.lazysv.cur = newSVsv(sv);
2213 cx->blk_loop.state_u.lazysv.end = right;
2214 SvREFCNT_inc(right);
2215 (void) SvPV_force_nolen(cx->blk_loop.state_u.lazysv.cur);
2216 /* This will do the upgrade to SVt_PV, and warn if the value
2217 is uninitialised. */
2218 (void) SvPV_nolen_const(right);
2219 /* Doing this avoids a check every time in pp_iter in pp_hot.c
2220 to replace !SvOK() with a pointer to "". */
2222 SvREFCNT_dec(right);
2223 cx->blk_loop.state_u.lazysv.end = &PL_sv_no;
2227 else /* SvTYPE(maybe_ary) == SVt_PVAV */ {
2228 cx->blk_loop.state_u.ary.ary = MUTABLE_AV(maybe_ary);
2229 SvREFCNT_inc(maybe_ary);
2230 cx->blk_loop.state_u.ary.ix =
2231 (PL_op->op_private & OPpITER_REVERSED) ?
2232 AvFILL(cx->blk_loop.state_u.ary.ary) + 1 :
2236 else { /* iterating over items on the stack */
2237 cx->blk_loop.state_u.ary.ary = NULL; /* means to use the stack */
2238 if (PL_op->op_private & OPpITER_REVERSED) {
2239 cx->blk_loop.state_u.ary.ix = cx->blk_oldsp + 1;
2242 cx->blk_loop.state_u.ary.ix = MARK - PL_stack_base;
2253 const I32 gimme = GIMME_V;
2255 ENTER_with_name("loop1");
2257 ENTER_with_name("loop2");
2259 PUSHBLOCK(cx, CXt_LOOP_PLAIN, SP);
2260 PUSHLOOP_PLAIN(cx, SP);
2275 assert(CxTYPE_is_LOOP(cx));
2277 newsp = PL_stack_base + cx->blk_loop.resetsp;
2280 SP = adjust_stack_on_leave(newsp, SP, MARK, gimme, 0,
2281 PL_op->op_private & OPpLVALUE);
2284 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
2285 PL_curpm = newpm; /* ... and pop $1 et al */
2287 LEAVE_with_name("loop2");
2288 LEAVE_with_name("loop1");
2294 S_return_lvalues(pTHX_ SV **mark, SV **sp, SV **newsp, I32 gimme,
2295 PERL_CONTEXT *cx, PMOP *newpm)
2297 const bool ref = !!(CxLVAL(cx) & OPpENTERSUB_INARGS);
2298 if (gimme == G_SCALAR) {
2299 if (CxLVAL(cx) && !ref) { /* Leave it as it is if we can. */
2301 const char *what = NULL;
2303 assert(MARK+1 == SP);
2304 if ((SvPADTMP(TOPs) ||
2305 (SvFLAGS(TOPs) & (SVf_READONLY | SVf_FAKE))
2308 !SvSMAGICAL(TOPs)) {
2310 SvREADONLY(TOPs) ? (TOPs == &PL_sv_undef) ? "undef"
2311 : "a readonly value" : "a temporary";
2316 /* sub:lvalue{} will take us here. */
2325 "Can't return %s from lvalue subroutine", what
2330 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2331 if (!SvPADTMP(*SP)) {
2332 *++newsp = SvREFCNT_inc(*SP);
2337 /* FREETMPS could clobber it */
2338 SV *sv = SvREFCNT_inc(*SP);
2340 *++newsp = sv_mortalcopy(sv);
2347 ? sv_mortalcopy(*SP)
2349 ? sv_2mortal(SvREFCNT_inc_simple_NN(*SP))
2354 *++newsp = &PL_sv_undef;
2356 if (CxLVAL(cx) & OPpDEREF) {
2359 TOPs = vivify_ref(TOPs, CxLVAL(cx) & OPpDEREF);
2363 else if (gimme == G_ARRAY) {
2364 assert (!(CxLVAL(cx) & OPpDEREF));
2365 if (ref || !CxLVAL(cx))
2366 while (++MARK <= SP)
2368 SvFLAGS(*MARK) & SVs_PADTMP
2369 ? sv_mortalcopy(*MARK)
2372 : sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
2373 else while (++MARK <= SP) {
2374 if (*MARK != &PL_sv_undef
2376 || (SvFLAGS(*MARK) & (SVf_READONLY|SVf_FAKE))
2381 /* Might be flattened array after $#array = */
2388 /* diag_listed_as: Can't return %s from lvalue subroutine */
2390 "Can't return a %s from lvalue subroutine",
2391 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2397 : sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
2400 PL_stack_sp = newsp;
2407 bool popsub2 = FALSE;
2408 bool clear_errsv = FALSE;
2418 const I32 cxix = dopoptosub(cxstack_ix);
2421 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
2422 * sort block, which is a CXt_NULL
2425 PL_stack_base[1] = *PL_stack_sp;
2426 PL_stack_sp = PL_stack_base + 1;
2430 DIE(aTHX_ "Can't return outside a subroutine");
2432 if (cxix < cxstack_ix)
2435 if (CxMULTICALL(&cxstack[cxix])) {
2436 gimme = cxstack[cxix].blk_gimme;
2437 if (gimme == G_VOID)
2438 PL_stack_sp = PL_stack_base;
2439 else if (gimme == G_SCALAR) {
2440 PL_stack_base[1] = *PL_stack_sp;
2441 PL_stack_sp = PL_stack_base + 1;
2447 switch (CxTYPE(cx)) {
2450 lval = !!CvLVALUE(cx->blk_sub.cv);
2451 retop = cx->blk_sub.retop;
2452 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
2455 if (!(PL_in_eval & EVAL_KEEPERR))
2458 namesv = cx->blk_eval.old_namesv;
2459 retop = cx->blk_eval.retop;
2462 if (optype == OP_REQUIRE &&
2463 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
2465 /* Unassume the success we assumed earlier. */
2466 (void)hv_delete(GvHVn(PL_incgv),
2467 SvPVX_const(namesv),
2468 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
2470 DIE(aTHX_ "%"SVf" did not return a true value", SVfARG(namesv));
2474 retop = cx->blk_sub.retop;
2478 DIE(aTHX_ "panic: return, type=%u", (unsigned) CxTYPE(cx));
2482 if (lval) S_return_lvalues(aTHX_ MARK, SP, newsp, gimme, cx, newpm);
2484 if (gimme == G_SCALAR) {
2487 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2488 if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
2489 && !SvMAGICAL(TOPs)) {
2490 *++newsp = SvREFCNT_inc(*SP);
2495 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
2497 *++newsp = sv_mortalcopy(sv);
2501 else if (SvTEMP(*SP) && SvREFCNT(*SP) == 1
2502 && !SvMAGICAL(*SP)) {
2506 *++newsp = sv_mortalcopy(*SP);
2509 *++newsp = sv_mortalcopy(*SP);
2512 *++newsp = &PL_sv_undef;
2514 else if (gimme == G_ARRAY) {
2515 while (++MARK <= SP) {
2516 *++newsp = popsub2 && SvTEMP(*MARK) && SvREFCNT(*MARK) == 1
2517 && !SvGMAGICAL(*MARK)
2518 ? *MARK : sv_mortalcopy(*MARK);
2519 TAINT_NOT; /* Each item is independent */
2522 PL_stack_sp = newsp;
2526 /* Stack values are safe: */
2529 POPSUB(cx,sv); /* release CV and @_ ... */
2533 PL_curpm = newpm; /* ... and pop $1 et al */
2542 /* This duplicates parts of pp_leavesub, so that it can share code with
2553 if (CxMULTICALL(&cxstack[cxstack_ix]))
2557 cxstack_ix++; /* temporarily protect top context */
2561 S_return_lvalues(aTHX_ newsp, SP, newsp, gimme, cx, newpm);
2564 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2566 PL_curpm = newpm; /* ... and pop $1 et al */
2569 return cx->blk_sub.retop;
2573 S_unwind_loop(pTHX_ const char * const opname)
2577 if (PL_op->op_flags & OPf_SPECIAL) {
2578 cxix = dopoptoloop(cxstack_ix);
2580 /* diag_listed_as: Can't "last" outside a loop block */
2581 Perl_croak(aTHX_ "Can't \"%s\" outside a loop block", opname);
2586 const char * const label =
2587 PL_op->op_flags & OPf_STACKED
2588 ? SvPV(TOPs,label_len)
2589 : (label_len = strlen(cPVOP->op_pv), cPVOP->op_pv);
2590 const U32 label_flags =
2591 PL_op->op_flags & OPf_STACKED
2593 : (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0;
2595 cxix = dopoptolabel(label, label_len, label_flags);
2597 /* diag_listed_as: Label not found for "last %s" */
2598 Perl_croak(aTHX_ "Label not found for \"%s %"SVf"\"",
2600 SVfARG(PL_op->op_flags & OPf_STACKED
2601 && !SvGMAGICAL(TOPp1s)
2603 : newSVpvn_flags(label,
2605 label_flags | SVs_TEMP)));
2607 if (cxix < cxstack_ix)
2624 S_unwind_loop(aTHX_ "last");
2627 cxstack_ix++; /* temporarily protect top context */
2628 switch (CxTYPE(cx)) {
2629 case CXt_LOOP_LAZYIV:
2630 case CXt_LOOP_LAZYSV:
2632 case CXt_LOOP_PLAIN:
2634 newsp = PL_stack_base + cx->blk_loop.resetsp;
2635 nextop = cx->blk_loop.my_op->op_lastop->op_next;
2639 nextop = cx->blk_sub.retop;
2643 nextop = cx->blk_eval.retop;
2647 nextop = cx->blk_sub.retop;
2650 DIE(aTHX_ "panic: last, type=%u", (unsigned) CxTYPE(cx));
2654 PL_stack_sp = newsp;
2658 /* Stack values are safe: */
2660 case CXt_LOOP_LAZYIV:
2661 case CXt_LOOP_PLAIN:
2662 case CXt_LOOP_LAZYSV:
2664 POPLOOP(cx); /* release loop vars ... */
2668 POPSUB(cx,sv); /* release CV and @_ ... */
2671 PL_curpm = newpm; /* ... and pop $1 et al */
2674 PERL_UNUSED_VAR(optype);
2675 PERL_UNUSED_VAR(gimme);
2683 const I32 inner = PL_scopestack_ix;
2685 S_unwind_loop(aTHX_ "next");
2687 /* clear off anything above the scope we're re-entering, but
2688 * save the rest until after a possible continue block */
2690 if (PL_scopestack_ix < inner)
2691 leave_scope(PL_scopestack[PL_scopestack_ix]);
2692 PL_curcop = cx->blk_oldcop;
2694 return (cx)->blk_loop.my_op->op_nextop;
2700 const I32 cxix = S_unwind_loop(aTHX_ "redo");
2703 OP* redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
2705 if (redo_op->op_type == OP_ENTER) {
2706 /* pop one less context to avoid $x being freed in while (my $x..) */
2708 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2709 redo_op = redo_op->op_next;
2713 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2714 LEAVE_SCOPE(oldsave);
2716 PL_curcop = cx->blk_oldcop;
2722 S_dofindlabel(pTHX_ OP *o, const char *label, STRLEN len, U32 flags, OP **opstack, OP **oplimit)
2726 static const char* const too_deep = "Target of goto is too deeply nested";
2728 PERL_ARGS_ASSERT_DOFINDLABEL;
2731 Perl_croak(aTHX_ "%s", too_deep);
2732 if (o->op_type == OP_LEAVE ||
2733 o->op_type == OP_SCOPE ||
2734 o->op_type == OP_LEAVELOOP ||
2735 o->op_type == OP_LEAVESUB ||
2736 o->op_type == OP_LEAVETRY)
2738 *ops++ = cUNOPo->op_first;
2740 Perl_croak(aTHX_ "%s", too_deep);
2743 if (o->op_flags & OPf_KIDS) {
2745 /* First try all the kids at this level, since that's likeliest. */
2746 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2747 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2748 STRLEN kid_label_len;
2749 U32 kid_label_flags;
2750 const char *kid_label = CopLABEL_len_flags(kCOP,
2751 &kid_label_len, &kid_label_flags);
2753 ( (kid_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ?
2756 (const U8*)kid_label, kid_label_len,
2757 (const U8*)label, len) == 0)
2759 (const U8*)label, len,
2760 (const U8*)kid_label, kid_label_len) == 0)
2761 : ( len == kid_label_len && ((kid_label == label)
2762 || memEQ(kid_label, label, len)))))
2766 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2767 if (kid == PL_lastgotoprobe)
2769 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2772 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2773 ops[-1]->op_type == OP_DBSTATE)
2778 if ((o = dofindlabel(kid, label, len, flags, ops, oplimit)))
2786 PP(pp_goto) /* also pp_dump */
2792 #define GOTO_DEPTH 64
2793 OP *enterops[GOTO_DEPTH];
2794 const char *label = NULL;
2795 STRLEN label_len = 0;
2796 U32 label_flags = 0;
2797 const bool do_dump = (PL_op->op_type == OP_DUMP);
2798 static const char* const must_have_label = "goto must have label";
2800 if (PL_op->op_flags & OPf_STACKED) {
2801 /* goto EXPR or goto &foo */
2803 SV * const sv = POPs;
2806 /* This egregious kludge implements goto &subroutine */
2807 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2810 CV *cv = MUTABLE_CV(SvRV(sv));
2811 AV *arg = GvAV(PL_defgv);
2815 if (!CvROOT(cv) && !CvXSUB(cv)) {
2816 const GV * const gv = CvGV(cv);
2820 /* autoloaded stub? */
2821 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2823 autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv),
2825 GvNAMEUTF8(gv) ? SVf_UTF8 : 0);
2826 if (autogv && (cv = GvCV(autogv)))
2828 tmpstr = sv_newmortal();
2829 gv_efullname3(tmpstr, gv, NULL);
2830 DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr));
2832 DIE(aTHX_ "Goto undefined subroutine");
2835 /* First do some returnish stuff. */
2836 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
2838 cxix = dopoptosub(cxstack_ix);
2839 if (cxix < cxstack_ix) {
2842 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2848 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2849 if (CxTYPE(cx) == CXt_EVAL) {
2852 /* diag_listed_as: Can't goto subroutine from an eval-%s */
2853 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2855 /* diag_listed_as: Can't goto subroutine from an eval-%s */
2856 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2858 else if (CxMULTICALL(cx))
2861 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
2863 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
2864 AV* av = cx->blk_sub.argarray;
2866 /* abandon the original @_ if it got reified or if it is
2867 the same as the current @_ */
2868 if (AvREAL(av) || av == arg) {
2872 PAD_SVl(0) = MUTABLE_SV(cx->blk_sub.argarray = av);
2874 else CLEAR_ARGARRAY(av);
2876 /* We donate this refcount later to the callee’s pad. */
2877 SvREFCNT_inc_simple_void(arg);
2878 if (CxTYPE(cx) == CXt_SUB &&
2879 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2880 SvREFCNT_dec(cx->blk_sub.cv);
2881 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2882 LEAVE_SCOPE(oldsave);
2884 /* A destructor called during LEAVE_SCOPE could have undefined
2885 * our precious cv. See bug #99850. */
2886 if (!CvROOT(cv) && !CvXSUB(cv)) {
2887 const GV * const gv = CvGV(cv);
2890 SV * const tmpstr = sv_newmortal();
2891 gv_efullname3(tmpstr, gv, NULL);
2892 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",
2895 DIE(aTHX_ "Goto undefined subroutine");
2898 /* Now do some callish stuff. */
2900 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2902 OP* const retop = cx->blk_sub.retop;
2905 const SSize_t items = arg ? AvFILL(arg) + 1 : 0;
2906 const bool m = arg ? cBOOL(SvRMAGICAL(arg)) : 0;
2909 PERL_UNUSED_VAR(newsp);
2910 PERL_UNUSED_VAR(gimme);
2912 /* put GvAV(defgv) back onto stack */
2914 EXTEND(SP, items+1); /* @_ could have been extended. */
2919 bool r = cBOOL(AvREAL(arg));
2920 for (index=0; index<items; index++)
2924 SV ** const svp = av_fetch(arg, index, 0);
2925 sv = svp ? *svp : NULL;
2927 else sv = AvARRAY(arg)[index];
2929 ? r ? SvREFCNT_inc_NN(sv_2mortal(sv)) : sv
2930 : sv_2mortal(newSVavdefelem(arg, index, 1));
2935 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
2936 /* Restore old @_ */
2937 arg = GvAV(PL_defgv);
2938 GvAV(PL_defgv) = cx->blk_sub.savearray;
2942 /* XS subs don't have a CxSUB, so pop it */
2943 POPBLOCK(cx, PL_curpm);
2944 /* Push a mark for the start of arglist */
2947 (void)(*CvXSUB(cv))(aTHX_ cv);
2953 PADLIST * const padlist = CvPADLIST(cv);
2954 cx->blk_sub.cv = cv;
2955 cx->blk_sub.olddepth = CvDEPTH(cv);
2958 if (CvDEPTH(cv) < 2)
2959 SvREFCNT_inc_simple_void_NN(cv);
2961 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION))
2962 sub_crush_depth(cv);
2963 pad_push(padlist, CvDEPTH(cv));
2965 PL_curcop = cx->blk_oldcop;
2967 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2970 CX_CURPAD_SAVE(cx->blk_sub);
2972 /* cx->blk_sub.argarray has no reference count, so we
2973 need something to hang on to our argument array so
2974 that cx->blk_sub.argarray does not end up pointing
2975 to freed memory as the result of undef *_. So put
2976 it in the callee’s pad, donating our refer-
2978 SvREFCNT_dec(PAD_SVl(0));
2979 PAD_SVl(0) = (SV *)(cx->blk_sub.argarray = arg);
2981 /* GvAV(PL_defgv) might have been modified on scope
2982 exit, so restore it. */
2983 if (arg != GvAV(PL_defgv)) {
2984 AV * const av = GvAV(PL_defgv);
2985 GvAV(PL_defgv) = (AV *)SvREFCNT_inc_simple(arg);
2989 else SvREFCNT_dec(arg);
2990 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2991 Perl_get_db_sub(aTHX_ NULL, cv);
2993 CV * const gotocv = get_cvs("DB::goto", 0);
2995 PUSHMARK( PL_stack_sp );
2996 call_sv(MUTABLE_SV(gotocv), G_SCALAR | G_NODEBUG);
3002 RETURNOP(CvSTART(cv));
3007 label = SvPV_nomg_const(sv, label_len);
3008 label_flags = SvUTF8(sv);
3011 else if (!(PL_op->op_flags & OPf_SPECIAL)) {
3012 /* goto LABEL or dump LABEL */
3013 label = cPVOP->op_pv;
3014 label_flags = (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0;
3015 label_len = strlen(label);
3017 if (!(do_dump || label_len)) DIE(aTHX_ "%s", must_have_label);
3022 OP *gotoprobe = NULL;
3023 bool leaving_eval = FALSE;
3024 bool in_block = FALSE;
3025 PERL_CONTEXT *last_eval_cx = NULL;
3029 PL_lastgotoprobe = NULL;
3031 for (ix = cxstack_ix; ix >= 0; ix--) {
3033 switch (CxTYPE(cx)) {
3035 leaving_eval = TRUE;
3036 if (!CxTRYBLOCK(cx)) {
3037 gotoprobe = (last_eval_cx ?
3038 last_eval_cx->blk_eval.old_eval_root :
3043 /* else fall through */
3044 case CXt_LOOP_LAZYIV:
3045 case CXt_LOOP_LAZYSV:
3047 case CXt_LOOP_PLAIN:
3050 gotoprobe = cx->blk_oldcop->op_sibling;
3056 gotoprobe = cx->blk_oldcop->op_sibling;
3059 gotoprobe = PL_main_root;
3062 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
3063 gotoprobe = CvROOT(cx->blk_sub.cv);
3069 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
3072 DIE(aTHX_ "panic: goto, type=%u, ix=%ld",
3073 CxTYPE(cx), (long) ix);
3074 gotoprobe = PL_main_root;
3078 retop = dofindlabel(gotoprobe, label, label_len, label_flags,
3079 enterops, enterops + GOTO_DEPTH);
3082 if (gotoprobe->op_sibling &&
3083 gotoprobe->op_sibling->op_type == OP_UNSTACK &&
3084 gotoprobe->op_sibling->op_sibling) {
3085 retop = dofindlabel(gotoprobe->op_sibling->op_sibling,
3086 label, label_len, label_flags, enterops,
3087 enterops + GOTO_DEPTH);
3092 PL_lastgotoprobe = gotoprobe;
3095 DIE(aTHX_ "Can't find label %"UTF8f,
3096 UTF8fARG(label_flags, label_len, label));
3098 /* if we're leaving an eval, check before we pop any frames
3099 that we're not going to punt, otherwise the error
3102 if (leaving_eval && *enterops && enterops[1]) {
3104 for (i = 1; enterops[i]; i++)
3105 if (enterops[i]->op_type == OP_ENTERITER)
3106 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
3109 if (*enterops && enterops[1]) {
3110 I32 i = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3112 deprecate("\"goto\" to jump into a construct");
3115 /* pop unwanted frames */
3117 if (ix < cxstack_ix) {
3124 oldsave = PL_scopestack[PL_scopestack_ix];
3125 LEAVE_SCOPE(oldsave);
3128 /* push wanted frames */
3130 if (*enterops && enterops[1]) {
3131 OP * const oldop = PL_op;
3132 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3133 for (; enterops[ix]; ix++) {
3134 PL_op = enterops[ix];
3135 /* Eventually we may want to stack the needed arguments
3136 * for each op. For now, we punt on the hard ones. */
3137 if (PL_op->op_type == OP_ENTERITER)
3138 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
3139 PL_op->op_ppaddr(aTHX);
3147 if (!retop) retop = PL_main_start;
3149 PL_restartop = retop;
3150 PL_do_undump = TRUE;
3154 PL_restartop = 0; /* hmm, must be GNU unexec().. */
3155 PL_do_undump = FALSE;
3171 anum = 0; (void)POPs;
3176 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
3178 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
3181 PL_exit_flags |= PERL_EXIT_EXPECTED;
3183 /* KLUDGE: disable exit 0 in BEGIN blocks when we're just compiling */
3184 if (anum || !(PL_minus_c && PL_madskills))
3189 PUSHs(&PL_sv_undef);
3196 S_save_lines(pTHX_ AV *array, SV *sv)
3198 const char *s = SvPVX_const(sv);
3199 const char * const send = SvPVX_const(sv) + SvCUR(sv);
3202 PERL_ARGS_ASSERT_SAVE_LINES;
3204 while (s && s < send) {
3206 SV * const tmpstr = newSV_type(SVt_PVMG);
3208 t = (const char *)memchr(s, '\n', send - s);
3214 sv_setpvn(tmpstr, s, t - s);
3215 av_store(array, line++, tmpstr);
3223 Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context.
3225 0 is used as continue inside eval,
3227 3 is used for a die caught by an inner eval - continue inner loop
3229 See cop.h: je_mustcatch, when set at any runlevel to TRUE, means eval ops must
3230 establish a local jmpenv to handle exception traps.
3235 S_docatch(pTHX_ OP *o)
3239 OP * const oldop = PL_op;
3243 assert(CATCH_GET == TRUE);
3250 assert(cxstack_ix >= 0);
3251 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3252 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
3257 /* die caught by an inner eval - continue inner loop */
3258 if (PL_restartop && PL_restartjmpenv == PL_top_env) {
3259 PL_restartjmpenv = NULL;
3260 PL_op = PL_restartop;
3269 assert(0); /* NOTREACHED */
3278 =for apidoc find_runcv
3280 Locate the CV corresponding to the currently executing sub or eval.
3281 If db_seqp is non_null, skip CVs that are in the DB package and populate
3282 *db_seqp with the cop sequence number at the point that the DB:: code was
3283 entered. (allows debuggers to eval in the scope of the breakpoint rather
3284 than in the scope of the debugger itself).
3290 Perl_find_runcv(pTHX_ U32 *db_seqp)
3292 return Perl_find_runcv_where(aTHX_ 0, 0, db_seqp);
3295 /* If this becomes part of the API, it might need a better name. */
3297 Perl_find_runcv_where(pTHX_ U8 cond, IV arg, U32 *db_seqp)
3305 PL_curcop == &PL_compiling
3307 : PL_curcop->cop_seq;
3309 for (si = PL_curstackinfo; si; si = si->si_prev) {
3311 for (ix = si->si_cxix; ix >= 0; ix--) {
3312 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
3314 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
3315 cv = cx->blk_sub.cv;
3316 /* skip DB:: code */
3317 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
3318 *db_seqp = cx->blk_oldcop->cop_seq;
3321 if (cx->cx_type & CXp_SUB_RE)
3324 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
3325 cv = cx->blk_eval.cv;
3328 case FIND_RUNCV_padid_eq:
3330 || PadlistNAMES(CvPADLIST(cv)) != INT2PTR(PADNAMELIST *, arg))
3333 case FIND_RUNCV_level_eq:
3334 if (level++ != arg) continue;
3342 return cond == FIND_RUNCV_padid_eq ? NULL : PL_main_cv;
3346 /* Run yyparse() in a setjmp wrapper. Returns:
3347 * 0: yyparse() successful
3348 * 1: yyparse() failed
3352 S_try_yyparse(pTHX_ int gramtype)
3357 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3361 ret = yyparse(gramtype) ? 1 : 0;
3368 assert(0); /* NOTREACHED */
3375 /* Compile a require/do or an eval ''.
3377 * outside is the lexically enclosing CV (if any) that invoked us.
3378 * seq is the current COP scope value.
3379 * hh is the saved hints hash, if any.
3381 * Returns a bool indicating whether the compile was successful; if so,
3382 * PL_eval_start contains the first op of the compiled code; otherwise,
3385 * This function is called from two places: pp_require and pp_entereval.
3386 * These can be distinguished by whether PL_op is entereval.
3390 S_doeval(pTHX_ int gimme, CV* outside, U32 seq, HV *hh)
3393 OP * const saveop = PL_op;
3394 bool clear_hints = saveop->op_type != OP_ENTEREVAL;
3395 COP * const oldcurcop = PL_curcop;
3396 bool in_require = (saveop->op_type == OP_REQUIRE);
3400 PL_in_eval = (in_require
3401 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
3403 ((PL_op->op_private & OPpEVAL_RE_REPARSING)
3404 ? EVAL_RE_REPARSING : 0)));
3408 evalcv = MUTABLE_CV(newSV_type(SVt_PVCV));
3410 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3411 cxstack[cxstack_ix].blk_eval.cv = evalcv;
3412 cxstack[cxstack_ix].blk_gimme = gimme;
3414 CvOUTSIDE_SEQ(evalcv) = seq;
3415 CvOUTSIDE(evalcv) = MUTABLE_CV(SvREFCNT_inc_simple(outside));
3417 /* set up a scratch pad */
3419 CvPADLIST(evalcv) = pad_new(padnew_SAVE);
3420 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
3424 SAVEMORTALIZESV(evalcv); /* must remain until end of current statement */
3426 /* make sure we compile in the right package */
3428 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
3429 SAVEGENERICSV(PL_curstash);
3430 PL_curstash = (HV *)CopSTASH(PL_curcop);
3431 if (SvTYPE(PL_curstash) != SVt_PVHV) PL_curstash = NULL;
3432 else SvREFCNT_inc_simple_void(PL_curstash);
3434 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
3435 SAVESPTR(PL_beginav);
3436 PL_beginav = newAV();
3437 SAVEFREESV(PL_beginav);
3438 SAVESPTR(PL_unitcheckav);
3439 PL_unitcheckav = newAV();
3440 SAVEFREESV(PL_unitcheckav);
3443 SAVEBOOL(PL_madskills);
3447 ENTER_with_name("evalcomp");
3448 SAVESPTR(PL_compcv);
3451 /* try to compile it */
3453 PL_eval_root = NULL;
3454 PL_curcop = &PL_compiling;
3455 if ((saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
3456 PL_in_eval |= EVAL_KEEPERR;
3463 hv_clear(GvHV(PL_hintgv));
3466 PL_hints = saveop->op_private & OPpEVAL_COPHH
3467 ? oldcurcop->cop_hints : saveop->op_targ;
3469 /* making 'use re eval' not be in scope when compiling the
3470 * qr/mabye_has_runtime_code_block/ ensures that we don't get
3471 * infinite recursion when S_has_runtime_code() gives a false
3472 * positive: the second time round, HINT_RE_EVAL isn't set so we
3473 * don't bother calling S_has_runtime_code() */
3474 if (PL_in_eval & EVAL_RE_REPARSING)
3475 PL_hints &= ~HINT_RE_EVAL;
3478 /* SAVEHINTS created a new HV in PL_hintgv, which we need to GC */
3479 SvREFCNT_dec(GvHV(PL_hintgv));
3480 GvHV(PL_hintgv) = hh;
3483 SAVECOMPILEWARNINGS();
3485 if (PL_dowarn & G_WARN_ALL_ON)
3486 PL_compiling.cop_warnings = pWARN_ALL ;
3487 else if (PL_dowarn & G_WARN_ALL_OFF)
3488 PL_compiling.cop_warnings = pWARN_NONE ;
3490 PL_compiling.cop_warnings = pWARN_STD ;
3493 PL_compiling.cop_warnings =
3494 DUP_WARNINGS(oldcurcop->cop_warnings);
3495 cophh_free(CopHINTHASH_get(&PL_compiling));
3496 if (Perl_cop_fetch_label(aTHX_ oldcurcop, NULL, NULL)) {
3497 /* The label, if present, is the first entry on the chain. So rather
3498 than writing a blank label in front of it (which involves an
3499 allocation), just use the next entry in the chain. */
3500 PL_compiling.cop_hints_hash
3501 = cophh_copy(oldcurcop->cop_hints_hash->refcounted_he_next);
3502 /* Check the assumption that this removed the label. */
3503 assert(Perl_cop_fetch_label(aTHX_ &PL_compiling, NULL, NULL) == NULL);
3506 PL_compiling.cop_hints_hash = cophh_copy(oldcurcop->cop_hints_hash);
3509 CALL_BLOCK_HOOKS(bhk_eval, saveop);
3511 /* note that yyparse() may raise an exception, e.g. C<BEGIN{die}>,
3512 * so honour CATCH_GET and trap it here if necessary */
3514 yystatus = (!in_require && CATCH_GET) ? S_try_yyparse(aTHX_ GRAMPROG) : yyparse(GRAMPROG);
3516 if (yystatus || PL_parser->error_count || !PL_eval_root) {
3517 SV **newsp; /* Used by POPBLOCK. */
3519 I32 optype; /* Used by POPEVAL. */
3525 PERL_UNUSED_VAR(newsp);
3526 PERL_UNUSED_VAR(optype);
3528 /* note that if yystatus == 3, then the EVAL CX block has already
3529 * been popped, and various vars restored */
3531 if (yystatus != 3) {
3533 op_free(PL_eval_root);
3534 PL_eval_root = NULL;
3536 SP = PL_stack_base + POPMARK; /* pop original mark */
3537 POPBLOCK(cx,PL_curpm);
3539 namesv = cx->blk_eval.old_namesv;
3540 /* POPBLOCK renders LEAVE_with_name("evalcomp") unnecessary. */
3541 LEAVE_with_name("eval"); /* pp_entereval knows about this LEAVE. */
3547 /* If cx is still NULL, it means that we didn't go in the
3548 * POPEVAL branch. */
3549 cx = &cxstack[cxstack_ix];
3550 assert(CxTYPE(cx) == CXt_EVAL);
3551 namesv = cx->blk_eval.old_namesv;
3553 (void)hv_store(GvHVn(PL_incgv),
3554 SvPVX_const(namesv),
3555 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
3557 Perl_croak(aTHX_ "%"SVf"Compilation failed in require",
3560 : newSVpvs_flags("Unknown error\n", SVs_TEMP)));
3563 if (!*(SvPV_nolen_const(errsv))) {
3564 sv_setpvs(errsv, "Compilation error");
3567 if (gimme != G_ARRAY) PUSHs(&PL_sv_undef);
3572 LEAVE_with_name("evalcomp");
3574 CopLINE_set(&PL_compiling, 0);
3575 SAVEFREEOP(PL_eval_root);
3576 cv_forget_slab(evalcv);
3578 DEBUG_x(dump_eval());
3580 /* Register with debugger: */
3581 if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
3582 CV * const cv = get_cvs("DB::postponed", 0);
3586 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3588 call_sv(MUTABLE_SV(cv), G_DISCARD);
3592 if (PL_unitcheckav) {
3593 OP *es = PL_eval_start;
3594 call_list(PL_scopestack_ix, PL_unitcheckav);
3598 /* compiled okay, so do it */
3600 CvDEPTH(evalcv) = 1;
3601 SP = PL_stack_base + POPMARK; /* pop original mark */
3602 PL_op = saveop; /* The caller may need it. */
3603 PL_parser->lex_state = LEX_NOTPARSING; /* $^S needs this. */
3610 S_check_type_and_open(pTHX_ SV *name)
3614 const char *p = SvPV_const(name, len);
3617 PERL_ARGS_ASSERT_CHECK_TYPE_AND_OPEN;
3619 /* checking here captures a reasonable error message when
3620 * PERL_DISABLE_PMC is true, but when PMC checks are enabled, the
3621 * user gets a confusing message about looking for the .pmc file
3622 * rather than for the .pm file.
3623 * This check prevents a \0 in @INC causing problems.
3625 if (!IS_SAFE_PATHNAME(p, len, "require"))
3628 st_rc = PerlLIO_stat(p, &st);
3630 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
3634 #if !defined(PERLIO_IS_STDIO) && !defined(USE_SFIO)
3635 return PerlIO_openn(aTHX_ ":", PERL_SCRIPT_MODE, -1, 0, 0, NULL, 1, &name);
3637 return PerlIO_open(p, PERL_SCRIPT_MODE);
3641 #ifndef PERL_DISABLE_PMC
3643 S_doopen_pm(pTHX_ SV *name)
3646 const char *p = SvPV_const(name, namelen);
3648 PERL_ARGS_ASSERT_DOOPEN_PM;
3650 /* check the name before trying for the .pmc name to avoid the
3651 * warning referring to the .pmc which the user probably doesn't
3652 * know or care about
3654 if (!IS_SAFE_PATHNAME(p, namelen, "require"))
3657 if (namelen > 3 && memEQs(p + namelen - 3, 3, ".pm")) {
3658 SV *const pmcsv = sv_newmortal();
3661 SvSetSV_nosteal(pmcsv,name);
3662 sv_catpvn(pmcsv, "c", 1);
3664 if (PerlLIO_stat(SvPV_nolen_const(pmcsv), &pmcstat) >= 0)
3665 return check_type_and_open(pmcsv);
3667 return check_type_and_open(name);
3670 # define doopen_pm(name) check_type_and_open(name)
3671 #endif /* !PERL_DISABLE_PMC */
3673 /* require doesn't search for absolute names, or when the name is
3674 explicity relative the current directory */
3675 PERL_STATIC_INLINE bool
3676 S_path_is_searchable(const char *name)
3678 PERL_ARGS_ASSERT_PATH_IS_SEARCHABLE;
3680 if (PERL_FILE_IS_ABSOLUTE(name)
3682 || (*name == '.' && ((name[1] == '/' ||
3683 (name[1] == '.' && name[2] == '/'))
3684 || (name[1] == '\\' ||
3685 ( name[1] == '.' && name[2] == '\\')))
3688 || (*name == '.' && (name[1] == '/' ||
3689 (name[1] == '.' && name[2] == '/')))
3709 int vms_unixname = 0;
3714 const char *tryname = NULL;
3716 const I32 gimme = GIMME_V;
3717 int filter_has_file = 0;
3718 PerlIO *tryrsfp = NULL;
3719 SV *filter_cache = NULL;
3720 SV *filter_state = NULL;
3721 SV *filter_sub = NULL;
3726 bool path_searchable;
3729 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3730 sv = sv_2mortal(new_version(sv));
3731 if (!Perl_sv_derived_from_pvn(aTHX_ PL_patchlevel, STR_WITH_LEN("version"), 0))
3732 upg_version(PL_patchlevel, TRUE);
3733 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3734 if ( vcmp(sv,PL_patchlevel) <= 0 )
3735 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
3736 SVfARG(sv_2mortal(vnormal(sv))),
3737 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3741 if ( vcmp(sv,PL_patchlevel) > 0 ) {
3744 SV * const req = SvRV(sv);
3745 SV * const pv = *hv_fetchs(MUTABLE_HV(req), "original", FALSE);
3747 /* get the left hand term */
3748 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(req), "version", FALSE)));
3750 first = SvIV(*av_fetch(lav,0,0));
3751 if ( first > (int)PERL_REVISION /* probably 'use 6.0' */
3752 || hv_exists(MUTABLE_HV(req), "qv", 2 ) /* qv style */
3753 || av_len(lav) > 1 /* FP with > 3 digits */
3754 || strstr(SvPVX(pv),".0") /* FP with leading 0 */
3756 DIE(aTHX_ "Perl %"SVf" required--this is only "
3758 SVfARG(sv_2mortal(vnormal(req))),
3759 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3762 else { /* probably 'use 5.10' or 'use 5.8' */
3767 second = SvIV(*av_fetch(lav,1,0));
3769 second /= second >= 600 ? 100 : 10;
3770 hintsv = Perl_newSVpvf(aTHX_ "v%d.%d.0",
3771 (int)first, (int)second);
3772 upg_version(hintsv, TRUE);
3774 DIE(aTHX_ "Perl %"SVf" required (did you mean %"SVf"?)"
3775 "--this is only %"SVf", stopped",
3776 SVfARG(sv_2mortal(vnormal(req))),
3777 SVfARG(sv_2mortal(vnormal(sv_2mortal(hintsv)))),
3778 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3786 name = SvPV_const(sv, len);
3787 if (!(name && len > 0 && *name))
3788 DIE(aTHX_ "Null filename used");
3789 if (!IS_SAFE_PATHNAME(name, len, "require")) {
3790 DIE(aTHX_ "Can't locate %s: %s",
3791 pv_escape(newSVpvs_flags("",SVs_TEMP),SvPVX(sv),SvCUR(sv),
3792 SvCUR(sv)*2,NULL, SvUTF8(sv)?PERL_PV_ESCAPE_UNI:0),
3795 TAINT_PROPER("require");
3797 path_searchable = path_is_searchable(name);
3800 /* The key in the %ENV hash is in the syntax of file passed as the argument
3801 * usually this is in UNIX format, but sometimes in VMS format, which
3802 * can result in a module being pulled in more than once.
3803 * To prevent this, the key must be stored in UNIX format if the VMS
3804 * name can be translated to UNIX.
3807 if ((unixnamebuf = SvPVX(sv_2mortal(newSVpv("", VMS_MAXRSS-1))))
3808 && (unixname = tounixspec(name, unixnamebuf)) != NULL) {
3809 unixlen = strlen(unixname);
3815 /* if not VMS or VMS name can not be translated to UNIX, pass it
3818 unixname = (char *) name;
3821 if (PL_op->op_type == OP_REQUIRE) {
3822 SV * const * const svp = hv_fetch(GvHVn(PL_incgv),
3823 unixname, unixlen, 0);
3825 if (*svp != &PL_sv_undef)
3828 DIE(aTHX_ "Attempt to reload %s aborted.\n"
3829 "Compilation failed in require", unixname);
3833 LOADING_FILE_PROBE(unixname);
3835 /* prepare to compile file */
3837 if (!path_searchable) {
3838 /* At this point, name is SvPVX(sv) */
3840 tryrsfp = doopen_pm(sv);
3842 if (!tryrsfp && !(errno == EACCES && !path_searchable)) {
3843 AV * const ar = GvAVn(PL_incgv);
3849 namesv = newSV_type(SVt_PV);
3850 for (i = 0; i <= AvFILL(ar); i++) {
3851 SV * const dirsv = *av_fetch(ar, i, TRUE);
3853 if (SvTIED_mg((const SV *)ar, PERL_MAGIC_tied))
3860 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3861 && !sv_isobject(loader))
3863 loader = *av_fetch(MUTABLE_AV(SvRV(loader)), 0, TRUE);
3866 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3867 PTR2UV(SvRV(dirsv)), name);
3868 tryname = SvPVX_const(namesv);
3871 ENTER_with_name("call_INC");
3879 if (sv_isobject(loader))
3880 count = call_method("INC", G_ARRAY);
3882 count = call_sv(loader, G_ARRAY);
3892 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3893 && !isGV_with_GP(SvRV(arg))) {
3894 filter_cache = SvRV(arg);
3901 if (SvROK(arg) && isGV_with_GP(SvRV(arg))) {
3905 if (isGV_with_GP(arg)) {
3906 IO * const io = GvIO((const GV *)arg);
3911 tryrsfp = IoIFP(io);
3912 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3913 PerlIO_close(IoOFP(io));
3924 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3926 SvREFCNT_inc_simple_void_NN(filter_sub);
3929 filter_state = SP[i];
3930 SvREFCNT_inc_simple_void(filter_state);
3934 if (!tryrsfp && (filter_cache || filter_sub)) {
3935 tryrsfp = PerlIO_open(BIT_BUCKET,
3941 /* FREETMPS may free our filter_cache */
3942 SvREFCNT_inc_simple_void(filter_cache);
3946 LEAVE_with_name("call_INC");
3948 /* Now re-mortalize it. */
3949 sv_2mortal(filter_cache);
3951 /* Adjust file name if the hook has set an %INC entry.
3952 This needs to happen after the FREETMPS above. */
3953 svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3955 tryname = SvPV_nolen_const(*svp);
3962 filter_has_file = 0;
3963 filter_cache = NULL;
3965 SvREFCNT_dec(filter_state);
3966 filter_state = NULL;
3969 SvREFCNT_dec(filter_sub);
3974 if (path_searchable) {
3979 dir = SvPV_const(dirsv, dirlen);
3985 if (!IS_SAFE_SYSCALL(dir, dirlen, "@INC entry", "require"))
3988 if (((unixdirbuf = SvPVX(sv_2mortal(newSVpv("", VMS_MAXRSS-1)))) == NULL)
3989 || ((unixdir = tounixpath(dir, unixdirbuf)) == NULL))
3991 sv_setpv(namesv, unixdir);
3992 sv_catpv(namesv, unixname);
3994 # ifdef __SYMBIAN32__
3995 if (PL_origfilename[0] &&
3996 PL_origfilename[1] == ':' &&
3997 !(dir[0] && dir[1] == ':'))
3998 Perl_sv_setpvf(aTHX_ namesv,
4003 Perl_sv_setpvf(aTHX_ namesv,
4007 /* The equivalent of
4008 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
4009 but without the need to parse the format string, or
4010 call strlen on either pointer, and with the correct
4011 allocation up front. */
4013 char *tmp = SvGROW(namesv, dirlen + len + 2);
4015 memcpy(tmp, dir, dirlen);
4018 /* Avoid '<dir>//<file>' */
4019 if (!dirlen || *(tmp-1) != '/') {
4023 /* name came from an SV, so it will have a '\0' at the
4024 end that we can copy as part of this memcpy(). */
4025 memcpy(tmp, name, len + 1);
4027 SvCUR_set(namesv, dirlen + len + 1);
4032 TAINT_PROPER("require");
4033 tryname = SvPVX_const(namesv);
4034 tryrsfp = doopen_pm(namesv);
4036 if (tryname[0] == '.' && tryname[1] == '/') {
4038 while (*++tryname == '/') {}
4042 else if (errno == EMFILE || errno == EACCES) {
4043 /* no point in trying other paths if out of handles;
4044 * on the other hand, if we couldn't open one of the
4045 * files, then going on with the search could lead to
4046 * unexpected results; see perl #113422
4055 saved_errno = errno; /* sv_2mortal can realloc things */
4058 if (PL_op->op_type == OP_REQUIRE) {
4059 if(saved_errno == EMFILE || saved_errno == EACCES) {
4060 /* diag_listed_as: Can't locate %s */
4061 DIE(aTHX_ "Can't locate %s: %s", name, Strerror(saved_errno));
4063 if (namesv) { /* did we lookup @INC? */
4064 AV * const ar = GvAVn(PL_incgv);
4066 SV *const msg = newSVpvs_flags("", SVs_TEMP);
4067 SV *const inc = newSVpvs_flags("", SVs_TEMP);
4068 for (i = 0; i <= AvFILL(ar); i++) {
4069 sv_catpvs(inc, " ");
4070 sv_catsv(inc, *av_fetch(ar, i, TRUE));
4072 if (len >= 4 && memEQ(name + len - 3, ".pm", 4)) {
4073 const char *c, *e = name + len - 3;
4074 sv_catpv(msg, " (you may need to install the ");
4075 for (c = name; c < e; c++) {
4077 sv_catpvn(msg, "::", 2);
4080 sv_catpvn(msg, c, 1);
4083 sv_catpv(msg, " module)");
4085 else if (len >= 2 && memEQ(name + len - 2, ".h", 3)) {
4086 sv_catpv(msg, " (change .h to .ph maybe?) (did you run h2ph?)");
4088 else if (len >= 3 && memEQ(name + len - 3, ".ph", 4)) {
4089 sv_catpv(msg, " (did you run h2ph?)");
4092 /* diag_listed_as: Can't locate %s */
4094 "Can't locate %s in @INC%" SVf " (@INC contains:%" SVf ")",
4098 DIE(aTHX_ "Can't locate %s", name);
4105 SETERRNO(0, SS_NORMAL);
4107 /* Assume success here to prevent recursive requirement. */
4108 /* name is never assigned to again, so len is still strlen(name) */
4109 /* Check whether a hook in @INC has already filled %INC */
4111 (void)hv_store(GvHVn(PL_incgv),
4112 unixname, unixlen, newSVpv(tryname,0),0);
4114 SV** const svp = hv_fetch(GvHVn(PL_incgv), unixname, unixlen, 0);
4116 (void)hv_store(GvHVn(PL_incgv),
4117 unixname, unixlen, SvREFCNT_inc_simple(hook_sv), 0 );
4120 ENTER_with_name("eval");
4122 SAVECOPFILE_FREE(&PL_compiling);
4123 CopFILE_set(&PL_compiling, tryname);
4124 lex_start(NULL, tryrsfp, 0);
4126 if (filter_sub || filter_cache) {
4127 /* We can use the SvPV of the filter PVIO itself as our cache, rather
4128 than hanging another SV from it. In turn, filter_add() optionally
4129 takes the SV to use as the filter (or creates a new SV if passed
4130 NULL), so simply pass in whatever value filter_cache has. */
4131 SV * const fc = filter_cache ? newSV(0) : NULL;
4133 if (fc) sv_copypv(fc, filter_cache);
4134 datasv = filter_add(S_run_user_filter, fc);
4135 IoLINES(datasv) = filter_has_file;
4136 IoTOP_GV(datasv) = MUTABLE_GV(filter_state);
4137 IoBOTTOM_GV(datasv) = MUTABLE_GV(filter_sub);
4140 /* switch to eval mode */
4141 PUSHBLOCK(cx, CXt_EVAL, SP);
4143 cx->blk_eval.retop = PL_op->op_next;
4145 SAVECOPLINE(&PL_compiling);
4146 CopLINE_set(&PL_compiling, 0);
4150 /* Store and reset encoding. */
4151 encoding = PL_encoding;
4154 if (doeval(gimme, NULL, PL_curcop->cop_seq, NULL))
4155 op = DOCATCH(PL_eval_start);
4157 op = PL_op->op_next;
4159 /* Restore encoding. */
4160 PL_encoding = encoding;
4162 LOADED_FILE_PROBE(unixname);
4167 /* This is a op added to hold the hints hash for
4168 pp_entereval. The hash can be modified by the code
4169 being eval'ed, so we return a copy instead. */
4175 mXPUSHs(MUTABLE_SV(hv_copy_hints_hv(MUTABLE_HV(cSVOP_sv))));
4185 const I32 gimme = GIMME_V;
4186 const U32 was = PL_breakable_sub_gen;
4187 char tbuf[TYPE_DIGITS(long) + 12];
4188 bool saved_delete = FALSE;
4189 char *tmpbuf = tbuf;
4192 U32 seq, lex_flags = 0;
4193 HV *saved_hh = NULL;
4194 const bool bytes = PL_op->op_private & OPpEVAL_BYTES;
4196 if (PL_op->op_private & OPpEVAL_HAS_HH) {
4197 saved_hh = MUTABLE_HV(SvREFCNT_inc(POPs));
4199 else if (PL_hints & HINT_LOCALIZE_HH || (
4200 PL_op->op_private & OPpEVAL_COPHH
4201 && PL_curcop->cop_hints & HINT_LOCALIZE_HH
4203 saved_hh = cop_hints_2hv(PL_curcop, 0);
4204 hv_magic(saved_hh, NULL, PERL_MAGIC_hints);
4208 /* make sure we've got a plain PV (no overload etc) before testing
4209 * for taint. Making a copy here is probably overkill, but better
4210 * safe than sorry */
4212 const char * const p = SvPV_const(sv, len);
4214 sv = newSVpvn_flags(p, len, SVs_TEMP | SvUTF8(sv));
4215 lex_flags |= LEX_START_COPIED;
4217 if (bytes && SvUTF8(sv))
4218 SvPVbyte_force(sv, len);
4220 else if (bytes && SvUTF8(sv)) {
4221 /* Don't modify someone else's scalar */
4224 (void)sv_2mortal(sv);
4225 SvPVbyte_force(sv,len);
4226 lex_flags |= LEX_START_COPIED;
4229 TAINT_IF(SvTAINTED(sv));
4230 TAINT_PROPER("eval");
4232 ENTER_with_name("eval");
4233 lex_start(sv, NULL, lex_flags | (PL_op->op_private & OPpEVAL_UNICODE
4234 ? LEX_IGNORE_UTF8_HINTS
4235 : bytes ? LEX_EVALBYTES : LEX_START_SAME_FILTER
4240 /* switch to eval mode */
4242 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
4243 SV * const temp_sv = sv_newmortal();
4244 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
4245 (unsigned long)++PL_evalseq,
4246 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4247 tmpbuf = SvPVX(temp_sv);
4248 len = SvCUR(temp_sv);
4251 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
4252 SAVECOPFILE_FREE(&PL_compiling);
4253 CopFILE_set(&PL_compiling, tmpbuf+2);
4254 SAVECOPLINE(&PL_compiling);
4255 CopLINE_set(&PL_compiling, 1);
4256 /* special case: an eval '' executed within the DB package gets lexically
4257 * placed in the first non-DB CV rather than the current CV - this
4258 * allows the debugger to execute code, find lexicals etc, in the
4259 * scope of the code being debugged. Passing &seq gets find_runcv
4260 * to do the dirty work for us */
4261 runcv = find_runcv(&seq);
4263 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
4265 cx->blk_eval.retop = PL_op->op_next;
4267 /* prepare to compile string */
4269 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash)
4270 save_lines(CopFILEAV(&PL_compiling), PL_parser->linestr);
4272 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
4273 deleting the eval's FILEGV from the stash before gv_check() runs
4274 (i.e. before run-time proper). To work around the coredump that
4275 ensues, we always turn GvMULTI_on for any globals that were
4276 introduced within evals. See force_ident(). GSAR 96-10-12 */
4277 char *const safestr = savepvn(tmpbuf, len);
4278 SAVEDELETE(PL_defstash, safestr, len);
4279 saved_delete = TRUE;
4284 if (doeval(gimme, runcv, seq, saved_hh)) {
4285 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4286 ? (PERLDB_LINE || PERLDB_SAVESRC)
4287 : PERLDB_SAVESRC_NOSUBS) {
4288 /* Retain the filegv we created. */
4289 } else if (!saved_delete) {
4290 char *const safestr = savepvn(tmpbuf, len);
4291 SAVEDELETE(PL_defstash, safestr, len);
4293 return DOCATCH(PL_eval_start);
4295 /* We have already left the scope set up earlier thanks to the LEAVE
4297 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4298 ? (PERLDB_LINE || PERLDB_SAVESRC)
4299 : PERLDB_SAVESRC_INVALID) {
4300 /* Retain the filegv we created. */
4301 } else if (!saved_delete) {
4302 (void)hv_delete(PL_defstash, tmpbuf, len, G_DISCARD);
4304 return PL_op->op_next;
4316 const U8 save_flags = PL_op -> op_flags;
4324 namesv = cx->blk_eval.old_namesv;
4325 retop = cx->blk_eval.retop;
4326 evalcv = cx->blk_eval.cv;
4329 SP = adjust_stack_on_leave((gimme == G_VOID) ? SP : newsp, SP, newsp,
4330 gimme, SVs_TEMP, FALSE);
4331 PL_curpm = newpm; /* Don't pop $1 et al till now */
4334 assert(CvDEPTH(evalcv) == 1);
4336 CvDEPTH(evalcv) = 0;
4338 if (optype == OP_REQUIRE &&
4339 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
4341 /* Unassume the success we assumed earlier. */
4342 (void)hv_delete(GvHVn(PL_incgv),
4343 SvPVX_const(namesv),
4344 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
4346 retop = Perl_die(aTHX_ "%"SVf" did not return a true value",
4348 /* die_unwind() did LEAVE, or we won't be here */
4351 LEAVE_with_name("eval");
4352 if (!(save_flags & OPf_SPECIAL)) {
4360 /* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
4361 close to the related Perl_create_eval_scope. */
4363 Perl_delete_eval_scope(pTHX)
4374 LEAVE_with_name("eval_scope");
4375 PERL_UNUSED_VAR(newsp);
4376 PERL_UNUSED_VAR(gimme);
4377 PERL_UNUSED_VAR(optype);
4380 /* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
4381 also needed by Perl_fold_constants. */
4383 Perl_create_eval_scope(pTHX_ U32 flags)
4386 const I32 gimme = GIMME_V;
4388 ENTER_with_name("eval_scope");
4391 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), PL_stack_sp);
4394 PL_in_eval = EVAL_INEVAL;
4395 if (flags & G_KEEPERR)
4396 PL_in_eval |= EVAL_KEEPERR;
4399 if (flags & G_FAKINGEVAL) {
4400 PL_eval_root = PL_op; /* Only needed so that goto works right. */
4408 PERL_CONTEXT * const cx = create_eval_scope(0);
4409 cx->blk_eval.retop = cLOGOP->op_other->op_next;
4410 return DOCATCH(PL_op->op_next);
4425 PERL_UNUSED_VAR(optype);
4428 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme,
4429 SVs_PADTMP|SVs_TEMP, FALSE);
4430 PL_curpm = newpm; /* Don't pop $1 et al till now */
4432 LEAVE_with_name("eval_scope");
4441 const I32 gimme = GIMME_V;
4443 ENTER_with_name("given");
4446 if (PL_op->op_targ) {
4447 SAVEPADSVANDMORTALIZE(PL_op->op_targ);
4448 SvREFCNT_dec(PAD_SVl(PL_op->op_targ));
4449 PAD_SVl(PL_op->op_targ) = SvREFCNT_inc_NN(POPs);
4456 PUSHBLOCK(cx, CXt_GIVEN, SP);
4469 PERL_UNUSED_CONTEXT;
4472 assert(CxTYPE(cx) == CXt_GIVEN);
4475 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme,
4476 SVs_PADTMP|SVs_TEMP, FALSE);
4477 PL_curpm = newpm; /* Don't pop $1 et al till now */
4479 LEAVE_with_name("given");
4483 /* Helper routines used by pp_smartmatch */
4485 S_make_matcher(pTHX_ REGEXP *re)
4488 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
4490 PERL_ARGS_ASSERT_MAKE_MATCHER;
4492 PM_SETRE(matcher, ReREFCNT_inc(re));
4494 SAVEFREEOP((OP *) matcher);
4495 ENTER_with_name("matcher"); SAVETMPS;
4501 S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
4506 PERL_ARGS_ASSERT_MATCHER_MATCHES_SV;
4508 PL_op = (OP *) matcher;
4511 (void) Perl_pp_match(aTHX);
4513 return (SvTRUEx(POPs));
4517 S_destroy_matcher(pTHX_ PMOP *matcher)
4521 PERL_ARGS_ASSERT_DESTROY_MATCHER;
4522 PERL_UNUSED_ARG(matcher);
4525 LEAVE_with_name("matcher");
4528 /* Do a smart match */
4531 DEBUG_M(Perl_deb(aTHX_ "Starting smart match resolution\n"));
4532 return do_smartmatch(NULL, NULL, 0);
4535 /* This version of do_smartmatch() implements the
4536 * table of smart matches that is found in perlsyn.
4539 S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other, const bool copied)
4544 bool object_on_left = FALSE;
4545 SV *e = TOPs; /* e is for 'expression' */
4546 SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */
4548 /* Take care only to invoke mg_get() once for each argument.
4549 * Currently we do this by copying the SV if it's magical. */
4551 if (!copied && SvGMAGICAL(d))
4552 d = sv_mortalcopy(d);
4559 e = sv_mortalcopy(e);
4561 /* First of all, handle overload magic of the rightmost argument */
4564 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n"));
4565 DEBUG_M(Perl_deb(aTHX_ " attempting overload\n"));
4567 tmpsv = amagic_call(d, e, smart_amg, AMGf_noleft);
4574 DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; continuing...\n"));
4577 SP -= 2; /* Pop the values */
4582 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-undef\n"));
4589 if (sv_isobject(e) && (SvTYPE(SvRV(e)) != SVt_REGEXP)) {
4590 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n"));
4591 Perl_croak(aTHX_ "Smart matching a non-overloaded object breaks encapsulation");
4593 if (sv_isobject(d) && (SvTYPE(SvRV(d)) != SVt_REGEXP))
4594 object_on_left = TRUE;
4597 if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVCV) {
4599 if (object_on_left) {
4600 goto sm_any_sub; /* Treat objects like scalars */
4602 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4603 /* Test sub truth for each key */
4605 bool andedresults = TRUE;
4606 HV *hv = (HV*) SvRV(d);
4607 I32 numkeys = hv_iterinit(hv);
4608 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-CodeRef\n"));
4611 while ( (he = hv_iternext(hv)) ) {
4612 DEBUG_M(Perl_deb(aTHX_ " testing hash key...\n"));
4613 ENTER_with_name("smartmatch_hash_key_test");
4616 PUSHs(hv_iterkeysv(he));
4618 c = call_sv(e, G_SCALAR);
4621 andedresults = FALSE;
4623 andedresults = SvTRUEx(POPs) && andedresults;
4625 LEAVE_with_name("smartmatch_hash_key_test");
4632 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4633 /* Test sub truth for each element */
4635 bool andedresults = TRUE;
4636 AV *av = (AV*) SvRV(d);
4637 const I32 len = av_len(av);
4638 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-CodeRef\n"));
4641 for (i = 0; i <= len; ++i) {
4642 SV * const * const svp = av_fetch(av, i, FALSE);
4643 DEBUG_M(Perl_deb(aTHX_ " testing array element...\n"));
4644 ENTER_with_name("smartmatch_array_elem_test");
4650 c = call_sv(e, G_SCALAR);
4653 andedresults = FALSE;
4655 andedresults = SvTRUEx(POPs) && andedresults;
4657 LEAVE_with_name("smartmatch_array_elem_test");
4666 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-CodeRef\n"));
4667 ENTER_with_name("smartmatch_coderef");
4672 c = call_sv(e, G_SCALAR);
4676 else if (SvTEMP(TOPs))
4677 SvREFCNT_inc_void(TOPs);
4679 LEAVE_with_name("smartmatch_coderef");
4684 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVHV) {
4685 if (object_on_left) {
4686 goto sm_any_hash; /* Treat objects like scalars */
4688 else if (!SvOK(d)) {
4689 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash ($a undef)\n"));
4692 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4693 /* Check that the key-sets are identical */
4695 HV *other_hv = MUTABLE_HV(SvRV(d));
4697 bool other_tied = FALSE;
4698 U32 this_key_count = 0,
4699 other_key_count = 0;
4700 HV *hv = MUTABLE_HV(SvRV(e));
4702 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Hash\n"));
4703 /* Tied hashes don't know how many keys they have. */
4704 if (SvTIED_mg((SV*)hv, PERL_MAGIC_tied)) {
4707 else if (SvTIED_mg((const SV *)other_hv, PERL_MAGIC_tied)) {
4708 HV * const temp = other_hv;
4713 if (SvTIED_mg((const SV *)other_hv, PERL_MAGIC_tied))
4716 if (!tied && HvUSEDKEYS((const HV *) hv) != HvUSEDKEYS(other_hv))
4719 /* The hashes have the same number of keys, so it suffices
4720 to check that one is a subset of the other. */
4721 (void) hv_iterinit(hv);
4722 while ( (he = hv_iternext(hv)) ) {
4723 SV *key = hv_iterkeysv(he);
4725 DEBUG_M(Perl_deb(aTHX_ " comparing hash key...\n"));
4728 if(!hv_exists_ent(other_hv, key, 0)) {
4729 (void) hv_iterinit(hv); /* reset iterator */
4735 (void) hv_iterinit(other_hv);
4736 while ( hv_iternext(other_hv) )
4740 other_key_count = HvUSEDKEYS(other_hv);
4742 if (this_key_count != other_key_count)
4747 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4748 AV * const other_av = MUTABLE_AV(SvRV(d));
4749 const SSize_t other_len = av_len(other_av) + 1;
4751 HV *hv = MUTABLE_HV(SvRV(e));
4753 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Hash\n"));
4754 for (i = 0; i < other_len; ++i) {
4755 SV ** const svp = av_fetch(other_av, i, FALSE);
4756 DEBUG_M(Perl_deb(aTHX_ " checking for key existence...\n"));
4757 if (svp) { /* ??? When can this not happen? */
4758 if (hv_exists_ent(hv, *svp, 0))
4764 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) {
4765 DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Hash\n"));
4768 PMOP * const matcher = make_matcher((REGEXP*) SvRV(d));
4770 HV *hv = MUTABLE_HV(SvRV(e));
4772 (void) hv_iterinit(hv);
4773 while ( (he = hv_iternext(hv)) ) {
4774 DEBUG_M(Perl_deb(aTHX_ " testing key against pattern...\n"));
4775 if (matcher_matches_sv(matcher, hv_iterkeysv(he))) {
4776 (void) hv_iterinit(hv);
4777 destroy_matcher(matcher);
4781 destroy_matcher(matcher);
4787 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash\n"));
4788 if (hv_exists_ent(MUTABLE_HV(SvRV(e)), d, 0))
4795 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVAV) {
4796 if (object_on_left) {
4797 goto sm_any_array; /* Treat objects like scalars */
4799 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4800 AV * const other_av = MUTABLE_AV(SvRV(e));
4801 const SSize_t other_len = av_len(other_av) + 1;
4804 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Array\n"));
4805 for (i = 0; i < other_len; ++i) {
4806 SV ** const svp = av_fetch(other_av, i, FALSE);
4808 DEBUG_M(Perl_deb(aTHX_ " testing for key existence...\n"));
4809 if (svp) { /* ??? When can this not happen? */
4810 if (hv_exists_ent(MUTABLE_HV(SvRV(d)), *svp, 0))
4816 if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4817 AV *other_av = MUTABLE_AV(SvRV(d));
4818 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Array\n"));
4819 if (av_len(MUTABLE_AV(SvRV(e))) != av_len(other_av))
4823 const SSize_t other_len = av_len(other_av);
4825 if (NULL == seen_this) {
4826 seen_this = newHV();
4827 (void) sv_2mortal(MUTABLE_SV(seen_this));
4829 if (NULL == seen_other) {
4830 seen_other = newHV();
4831 (void) sv_2mortal(MUTABLE_SV(seen_other));
4833 for(i = 0; i <= other_len; ++i) {
4834 SV * const * const this_elem = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4835 SV * const * const other_elem = av_fetch(other_av, i, FALSE);
4837 if (!this_elem || !other_elem) {
4838 if ((this_elem && SvOK(*this_elem))
4839 || (other_elem && SvOK(*other_elem)))
4842 else if (hv_exists_ent(seen_this,
4843 sv_2mortal(newSViv(PTR2IV(*this_elem))), 0) ||
4844 hv_exists_ent(seen_other,
4845 sv_2mortal(newSViv(PTR2IV(*other_elem))), 0))
4847 if (*this_elem != *other_elem)
4851 (void)hv_store_ent(seen_this,
4852 sv_2mortal(newSViv(PTR2IV(*this_elem))),
4854 (void)hv_store_ent(seen_other,
4855 sv_2mortal(newSViv(PTR2IV(*other_elem))),
4861 DEBUG_M(Perl_deb(aTHX_ " recursively comparing array element...\n"));
4862 (void) do_smartmatch(seen_this, seen_other, 0);
4864 DEBUG_M(Perl_deb(aTHX_ " recursion finished\n"));
4873 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) {
4874 DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Array\n"));
4877 PMOP * const matcher = make_matcher((REGEXP*) SvRV(d));
4878 const SSize_t this_len = av_len(MUTABLE_AV(SvRV(e)));
4881 for(i = 0; i <= this_len; ++i) {
4882 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4883 DEBUG_M(Perl_deb(aTHX_ " testing element against pattern...\n"));
4884 if (svp && matcher_matches_sv(matcher, *svp)) {
4885 destroy_matcher(matcher);
4889 destroy_matcher(matcher);
4893 else if (!SvOK(d)) {
4894 /* undef ~~ array */
4895 const SSize_t this_len = av_len(MUTABLE_AV(SvRV(e)));
4898 DEBUG_M(Perl_deb(aTHX_ " applying rule Undef-Array\n"));
4899 for (i = 0; i <= this_len; ++i) {
4900 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4901 DEBUG_M(Perl_deb(aTHX_ " testing for undef element...\n"));
4902 if (!svp || !SvOK(*svp))
4911 const SSize_t this_len = av_len(MUTABLE_AV(SvRV(e)));
4913 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Array\n"));
4914 for (i = 0; i <= this_len; ++i) {
4915 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4922 /* infinite recursion isn't supposed to happen here */
4923 DEBUG_M(Perl_deb(aTHX_ " recursively testing array element...\n"));
4924 (void) do_smartmatch(NULL, NULL, 1);
4926 DEBUG_M(Perl_deb(aTHX_ " recursion finished\n"));
4935 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_REGEXP) {
4936 if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4937 SV *t = d; d = e; e = t;
4938 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Regex\n"));
4941 else if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4942 SV *t = d; d = e; e = t;
4943 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Regex\n"));
4944 goto sm_regex_array;
4947 PMOP * const matcher = make_matcher((REGEXP*) SvRV(e));
4949 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Regex\n"));
4951 PUSHs(matcher_matches_sv(matcher, d)
4954 destroy_matcher(matcher);
4959 /* See if there is overload magic on left */
4960 else if (object_on_left && SvAMAGIC(d)) {
4962 DEBUG_M(Perl_deb(aTHX_ " applying rule Object-Any\n"));
4963 DEBUG_M(Perl_deb(aTHX_ " attempting overload\n"));
4966 tmpsv = amagic_call(d, e, smart_amg, AMGf_noright);
4974 DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; falling back...\n"));
4977 else if (!SvOK(d)) {
4978 /* undef ~~ scalar ; we already know that the scalar is SvOK */
4979 DEBUG_M(Perl_deb(aTHX_ " applying rule undef-Any\n"));
4984 if (SvNIOK(e) || (SvPOK(e) && looks_like_number(e) && SvNIOK(d))) {
4985 DEBUG_M(if (SvNIOK(e))
4986 Perl_deb(aTHX_ " applying rule Any-Num\n");
4988 Perl_deb(aTHX_ " applying rule Num-numish\n");
4990 /* numeric comparison */
4993 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4994 (void) Perl_pp_i_eq(aTHX);
4996 (void) Perl_pp_eq(aTHX);
5004 /* As a last resort, use string comparison */
5005 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Any\n"));
5008 return Perl_pp_seq(aTHX);
5015 const I32 gimme = GIMME_V;
5017 /* This is essentially an optimization: if the match
5018 fails, we don't want to push a context and then
5019 pop it again right away, so we skip straight
5020 to the op that follows the leavewhen.
5021 RETURNOP calls PUTBACK which restores the stack pointer after the POPs.
5023 if ((0 == (PL_op->op_flags & OPf_SPECIAL)) && !SvTRUEx(POPs))
5024 RETURNOP(cLOGOP->op_other->op_next);
5026 ENTER_with_name("when");
5029 PUSHBLOCK(cx, CXt_WHEN, SP);
5044 cxix = dopoptogiven(cxstack_ix);
5046 /* diag_listed_as: Can't "when" outside a topicalizer */
5047 DIE(aTHX_ "Can't \"%s\" outside a topicalizer",
5048 PL_op->op_flags & OPf_SPECIAL ? "default" : "when");
5051 assert(CxTYPE(cx) == CXt_WHEN);
5054 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme,
5055 SVs_PADTMP|SVs_TEMP, FALSE);
5056 PL_curpm = newpm; /* pop $1 et al */
5058 LEAVE_with_name("when");
5060 if (cxix < cxstack_ix)
5063 cx = &cxstack[cxix];
5065 if (CxFOREACH(cx)) {
5066 /* clear off anything above the scope we're re-entering */
5067 I32 inner = PL_scopestack_ix;
5070 if (PL_scopestack_ix < inner)
5071 leave_scope(PL_scopestack[PL_scopestack_ix]);
5072 PL_curcop = cx->blk_oldcop;
5075 return cx->blk_loop.my_op->op_nextop;
5079 RETURNOP(cx->blk_givwhen.leave_op);
5092 PERL_UNUSED_VAR(gimme);
5094 cxix = dopoptowhen(cxstack_ix);
5096 DIE(aTHX_ "Can't \"continue\" outside a when block");
5098 if (cxix < cxstack_ix)
5102 assert(CxTYPE(cx) == CXt_WHEN);
5105 PL_curpm = newpm; /* pop $1 et al */
5107 LEAVE_with_name("when");
5108 RETURNOP(cx->blk_givwhen.leave_op->op_next);
5117 cxix = dopoptogiven(cxstack_ix);
5119 DIE(aTHX_ "Can't \"break\" outside a given block");
5121 cx = &cxstack[cxix];
5123 DIE(aTHX_ "Can't \"break\" in a loop topicalizer");
5125 if (cxix < cxstack_ix)
5128 /* Restore the sp at the time we entered the given block */
5131 return cx->blk_givwhen.leave_op;
5135 S_doparseform(pTHX_ SV *sv)
5138 char *s = SvPV(sv, len);
5140 char *base = NULL; /* start of current field */
5141 I32 skipspaces = 0; /* number of contiguous spaces seen */
5142 bool noblank = FALSE; /* ~ or ~~ seen on this line */
5143 bool repeat = FALSE; /* ~~ seen on this line */
5144 bool postspace = FALSE; /* a text field may need right padding */
5147 U32 *linepc = NULL; /* position of last FF_LINEMARK */
5149 bool ischop; /* it's a ^ rather than a @ */
5150 bool unchopnum = FALSE; /* at least one @ (i.e. non-chop) num field seen */
5151 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
5155 PERL_ARGS_ASSERT_DOPARSEFORM;
5158 Perl_croak(aTHX_ "Null picture in formline");
5160 if (SvTYPE(sv) >= SVt_PVMG) {
5161 /* This might, of course, still return NULL. */
5162 mg = mg_find(sv, PERL_MAGIC_fm);
5164 sv_upgrade(sv, SVt_PVMG);
5168 /* still the same as previously-compiled string? */
5169 SV *old = mg->mg_obj;
5170 if ( !(!!SvUTF8(old) ^ !!SvUTF8(sv))
5171 && len == SvCUR(old)
5172 && strnEQ(SvPVX(old), SvPVX(sv), len)
5174 DEBUG_f(PerlIO_printf(Perl_debug_log,"Re-using compiled format\n"));
5178 DEBUG_f(PerlIO_printf(Perl_debug_log, "Re-compiling format\n"));
5179 Safefree(mg->mg_ptr);
5185 DEBUG_f(PerlIO_printf(Perl_debug_log, "Compiling format\n"));
5186 mg = sv_magicext(sv, NULL, PERL_MAGIC_fm, &PL_vtbl_fm, NULL, 0);
5189 sv_copy = newSVpvn_utf8(s, len, SvUTF8(sv));
5190 s = SvPV(sv_copy, len); /* work on the copy, not the original */
5194 /* estimate the buffer size needed */
5195 for (base = s; s <= send; s++) {
5196 if (*s == '\n' || *s == '@' || *s == '^')
5202 Newx(fops, maxops, U32);
5207 *fpc++ = FF_LINEMARK;
5208 noblank = repeat = FALSE;
5226 case ' ': case '\t':
5233 } /* else FALL THROUGH */
5241 *fpc++ = FF_LITERAL;
5249 *fpc++ = (U32)skipspaces;
5253 *fpc++ = FF_NEWLINE;
5257 arg = fpc - linepc + 1;
5264 *fpc++ = FF_LINEMARK;
5265 noblank = repeat = FALSE;
5274 ischop = s[-1] == '^';
5280 arg = (s - base) - 1;
5282 *fpc++ = FF_LITERAL;
5288 if (*s == '*') { /* @* or ^* */
5290 *fpc++ = 2; /* skip the @* or ^* */
5292 *fpc++ = FF_LINESNGL;
5295 *fpc++ = FF_LINEGLOB;
5297 else if (*s == '#' || (*s == '.' && s[1] == '#')) { /* @###, ^### */
5298 arg = ischop ? FORM_NUM_BLANK : 0;
5303 const char * const f = ++s;
5306 arg |= FORM_NUM_POINT + (s - f);
5308 *fpc++ = s - base; /* fieldsize for FETCH */
5309 *fpc++ = FF_DECIMAL;
5311 unchopnum |= ! ischop;
5313 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
5314 arg = ischop ? FORM_NUM_BLANK : 0;
5316 s++; /* skip the '0' first */
5320 const char * const f = ++s;
5323 arg |= FORM_NUM_POINT + (s - f);
5325 *fpc++ = s - base; /* fieldsize for FETCH */
5326 *fpc++ = FF_0DECIMAL;
5328 unchopnum |= ! ischop;
5330 else { /* text field */
5332 bool ismore = FALSE;
5335 while (*++s == '>') ;
5336 prespace = FF_SPACE;
5338 else if (*s == '|') {
5339 while (*++s == '|') ;
5340 prespace = FF_HALFSPACE;
5345 while (*++s == '<') ;
5348 if (*s == '.' && s[1] == '.' && s[2] == '.') {
5352 *fpc++ = s - base; /* fieldsize for FETCH */
5354 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
5357 *fpc++ = (U32)prespace; /* add SPACE or HALFSPACE */
5371 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
5374 mg->mg_ptr = (char *) fops;
5375 mg->mg_len = arg * sizeof(U32);
5376 mg->mg_obj = sv_copy;
5377 mg->mg_flags |= MGf_REFCOUNTED;
5379 if (unchopnum && repeat)
5380 Perl_die(aTHX_ "Repeated format line will never terminate (~~ and @#)");
5387 S_num_overflow(NV value, I32 fldsize, I32 frcsize)
5389 /* Can value be printed in fldsize chars, using %*.*f ? */
5393 int intsize = fldsize - (value < 0 ? 1 : 0);
5395 if (frcsize & FORM_NUM_POINT)
5397 frcsize &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
5400 while (intsize--) pwr *= 10.0;
5401 while (frcsize--) eps /= 10.0;
5404 if (value + eps >= pwr)
5407 if (value - eps <= -pwr)
5414 S_run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
5417 SV * const datasv = FILTER_DATA(idx);
5418 const int filter_has_file = IoLINES(datasv);
5419 SV * const filter_state = MUTABLE_SV(IoTOP_GV(datasv));
5420 SV * const filter_sub = MUTABLE_SV(IoBOTTOM_GV(datasv));
5425 char *prune_from = NULL;
5426 bool read_from_cache = FALSE;
5430 PERL_ARGS_ASSERT_RUN_USER_FILTER;
5432 assert(maxlen >= 0);
5435 /* I was having segfault trouble under Linux 2.2.5 after a
5436 parse error occured. (Had to hack around it with a test
5437 for PL_parser->error_count == 0.) Solaris doesn't segfault --
5438 not sure where the trouble is yet. XXX */
5441 SV *const cache = datasv;
5444 const char *cache_p = SvPV(cache, cache_len);
5448 /* Running in block mode and we have some cached data already.
5450 if (cache_len >= umaxlen) {
5451 /* In fact, so much data we don't even need to call
5456 const char *const first_nl =
5457 (const char *)memchr(cache_p, '\n', cache_len);
5459 take = first_nl + 1 - cache_p;
5463 sv_catpvn(buf_sv, cache_p, take);
5464 sv_chop(cache, cache_p + take);
5465 /* Definitely not EOF */
5469 sv_catsv(buf_sv, cache);
5471 umaxlen -= cache_len;
5474 read_from_cache = TRUE;
5478 /* Filter API says that the filter appends to the contents of the buffer.
5479 Usually the buffer is "", so the details don't matter. But if it's not,
5480 then clearly what it contains is already filtered by this filter, so we
5481 don't want to pass it in a second time.
5482 I'm going to use a mortal in case the upstream filter croaks. */
5483 upstream = ((SvOK(buf_sv) && sv_len(buf_sv)) || SvGMAGICAL(buf_sv))
5484 ? sv_newmortal() : buf_sv;
5485 SvUPGRADE(upstream, SVt_PV);
5487 if (filter_has_file) {
5488 status = FILTER_READ(idx+1, upstream, 0);
5491 if (filter_sub && status >= 0) {
5495 ENTER_with_name("call_filter_sub");
5500 DEFSV_set(upstream);
5504 PUSHs(filter_state);
5507 count = call_sv(filter_sub, G_SCALAR|G_EVAL);
5517 SV * const errsv = ERRSV;
5518 if (SvTRUE_NN(errsv))
5519 err = newSVsv(errsv);
5525 LEAVE_with_name("call_filter_sub");
5528 if (SvGMAGICAL(upstream)) {
5530 if (upstream == buf_sv) mg_free(buf_sv);
5532 if (SvIsCOW(upstream)) sv_force_normal(upstream);
5533 if(!err && SvOK(upstream)) {
5534 got_p = SvPV_nomg(upstream, got_len);
5536 if (got_len > umaxlen) {
5537 prune_from = got_p + umaxlen;
5540 char *const first_nl = (char *)memchr(got_p, '\n', got_len);
5541 if (first_nl && first_nl + 1 < got_p + got_len) {
5542 /* There's a second line here... */
5543 prune_from = first_nl + 1;
5547 if (!err && prune_from) {
5548 /* Oh. Too long. Stuff some in our cache. */
5549 STRLEN cached_len = got_p + got_len - prune_from;
5550 SV *const cache = datasv;
5553 /* Cache should be empty. */
5554 assert(!SvCUR(cache));
5557 sv_setpvn(cache, prune_from, cached_len);
5558 /* If you ask for block mode, you may well split UTF-8 characters.
5559 "If it breaks, you get to keep both parts"
5560 (Your code is broken if you don't put them back together again
5561 before something notices.) */
5562 if (SvUTF8(upstream)) {
5565 if (SvPOK(upstream)) SvCUR_set(upstream, got_len - cached_len);
5567 /* Cannot just use sv_setpvn, as that could free the buffer
5568 before we have a chance to assign it. */
5569 sv_usepvn(upstream, savepvn(got_p, got_len - cached_len),
5570 got_len - cached_len);
5572 /* Can't yet be EOF */
5577 /* If they are at EOF but buf_sv has something in it, then they may never
5578 have touched the SV upstream, so it may be undefined. If we naively
5579 concatenate it then we get a warning about use of uninitialised value.
5581 if (!err && upstream != buf_sv &&
5583 sv_catsv_nomg(buf_sv, upstream);
5585 else if (SvOK(upstream)) (void)SvPV_force_nolen(buf_sv);
5588 IoLINES(datasv) = 0;
5590 SvREFCNT_dec(filter_state);
5591 IoTOP_GV(datasv) = NULL;
5594 SvREFCNT_dec(filter_sub);
5595 IoBOTTOM_GV(datasv) = NULL;
5597 filter_del(S_run_user_filter);
5603 if (status == 0 && read_from_cache) {
5604 /* If we read some data from the cache (and by getting here it implies
5605 that we emptied the cache) then we aren't yet at EOF, and mustn't
5606 report that to our caller. */
5614 * c-indentation-style: bsd
5616 * indent-tabs-mode: nil
5619 * ex: set ts=8 sts=4 sw=4 et: