This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
fix other pod versions that had become out of date, and add reminder comments
[perl5.git] / pp_ctl.c
CommitLineData
a0d0e21e
LW
1/* pp_ctl.c
2 *
1129b882
NC
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
a0d0e21e
LW
5 *
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.
8 *
9 */
10
11/*
4ac71550
TC
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.
18 *
19 * [Bilbo on p.35 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
a0d0e21e
LW
20 */
21
166f8a29
DM
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.
27 *
28 * Control-oriented means things like pp_enteriter() and pp_next(), which
29 * alter the flow of control of the program.
30 */
31
32
a0d0e21e 33#include "EXTERN.h"
864dbfa3 34#define PERL_IN_PP_CTL_C
a0d0e21e
LW
35#include "perl.h"
36
d7e3f70f
Z
37#define RUN_PP_CATCHABLY(thispp) \
38 STMT_START { if (CATCH_GET) return docatch(thispp); } STMT_END
1e422769 39
94fcd414
NC
40#define dopoptosub(plop) dopoptosub_at(cxstack, (plop))
41
a0d0e21e
LW
42PP(pp_wantarray)
43{
39644a26 44 dSP;
a0d0e21e 45 I32 cxix;
93f0bc49 46 const PERL_CONTEXT *cx;
a0d0e21e
LW
47 EXTEND(SP, 1);
48
93f0bc49
FC
49 if (PL_op->op_private & OPpOFFBYONE) {
50 if (!(cx = caller_cx(1,NULL))) RETPUSHUNDEF;
51 }
52 else {
53 cxix = dopoptosub(cxstack_ix);
54 if (cxix < 0)
a0d0e21e 55 RETPUSHUNDEF;
93f0bc49
FC
56 cx = &cxstack[cxix];
57 }
a0d0e21e 58
93f0bc49 59 switch (cx->blk_gimme) {
54310121 60 case G_ARRAY:
a0d0e21e 61 RETPUSHYES;
54310121 62 case G_SCALAR:
a0d0e21e 63 RETPUSHNO;
54310121
PP
64 default:
65 RETPUSHUNDEF;
66 }
a0d0e21e
LW
67}
68
2cd61cdb
IZ
69PP(pp_regcreset)
70{
0b4182de 71 TAINT_NOT;
2cd61cdb
IZ
72 return NORMAL;
73}
74
b3eb6a9b
GS
75PP(pp_regcomp)
76{
39644a26 77 dSP;
eb578fdb 78 PMOP *pm = (PMOP*)cLOGOP->op_other;
9f141731 79 SV **args;
df787a7b 80 int nargs;
84679df5 81 REGEXP *re = NULL;
9f141731
DM
82 REGEXP *new_re;
83 const regexp_engine *eng;
dbc200c5 84 bool is_bare_re= FALSE;
bfed75c6 85
df787a7b
DM
86 if (PL_op->op_flags & OPf_STACKED) {
87 dMARK;
88 nargs = SP - MARK;
89 args = ++MARK;
90 }
91 else {
92 nargs = 1;
93 args = SP;
94 }
95
4b5a0d1c 96 /* prevent recompiling under /o and ithreads. */
3db8f154 97#if defined(USE_ITHREADS)
131b3ad0 98 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
df787a7b 99 SP = args-1;
131b3ad0
DM
100 RETURN;
101 }
513629ba 102#endif
d4b87e75 103
9f141731
DM
104 re = PM_GETRE(pm);
105 assert (re != (REGEXP*) &PL_sv_undef);
106 eng = re ? RX_ENGINE(re) : current_re_engine();
107
3c13cae6
DM
108 new_re = (eng->op_comp
109 ? eng->op_comp
110 : &Perl_re_op_compile
111 )(aTHX_ args, nargs, pm->op_code_list, eng, re,
346d3070 112 &is_bare_re,
dbc200c5 113 (pm->op_pmflags & RXf_PMf_FLAGCOPYMASK),
a5ae69f0
DM
114 pm->op_pmflags |
115 (PL_op->op_flags & OPf_SPECIAL ? PMf_USE_RE_EVAL : 0));
dbc200c5 116
346d3070 117 if (pm->op_pmflags & PMf_HAS_CV)
8d919b0a 118 ReANY(new_re)->qr_anoncv
9fe3265f 119 = (CV*) SvREFCNT_inc(PAD_SV(PL_op->op_targ));
9f141731
DM
120
121 if (is_bare_re) {
122 REGEXP *tmp;
123 /* The match's LHS's get-magic might need to access this op's regexp
124 (e.g. $' =~ /$re/ while foo; see bug 70764). So we must call
125 get-magic now before we replace the regexp. Hopefully this hack can
126 be replaced with the approach described at
127 http://www.nntp.perl.org/group/perl.perl5.porters/2007/03/msg122415.html
128 some day. */
129 if (pm->op_type == OP_MATCH) {
130 SV *lhs;
284167a5 131 const bool was_tainted = TAINT_get;
9f141731
DM
132 if (pm->op_flags & OPf_STACKED)
133 lhs = args[-1];
6ffceeb7 134 else if (pm->op_targ)
9f141731
DM
135 lhs = PAD_SV(pm->op_targ);
136 else lhs = DEFSV;
137 SvGETMAGIC(lhs);
138 /* Restore the previous value of PL_tainted (which may have been
139 modified by get-magic), to avoid incorrectly setting the
284167a5
SM
140 RXf_TAINTED flag with RX_TAINT_on further down. */
141 TAINT_set(was_tainted);
dc6d7f5c 142#ifdef NO_TAINT_SUPPORT
9a9b5ec9
DM
143 PERL_UNUSED_VAR(was_tainted);
144#endif
df787a7b 145 }
9f141731
DM
146 tmp = reg_temp_copy(NULL, new_re);
147 ReREFCNT_dec(new_re);
148 new_re = tmp;
df787a7b 149 }
dbc200c5 150
9f141731
DM
151 if (re != new_re) {
152 ReREFCNT_dec(re);
153 PM_SETRE(pm, new_re);
c277df42 154 }
d4b87e75 155
dbc200c5 156
d48c660d
DM
157 assert(TAINTING_get || !TAINT_get);
158 if (TAINT_get) {
9f141731 159 SvTAINTED_on((SV*)new_re);
284167a5 160 RX_TAINT_on(new_re);
72311751 161 }
72311751 162
5585e758
YO
163 /* handle the empty pattern */
164 if (!RX_PRELEN(PM_GETRE(pm)) && PL_curpm) {
165 if (PL_curpm == PL_reg_curpm) {
3cb4cde3
TC
166 if (PL_curpm_under && PL_curpm_under == PL_reg_curpm) {
167 Perl_croak(aTHX_ "Infinite recursion via empty pattern");
5585e758 168 }
5585e758
YO
169 }
170 }
171
c737faaf
YO
172#if !defined(USE_ITHREADS)
173 /* can't change the optree at runtime either */
174 /* PMf_KEEP is handled differently under threads to avoid these problems */
a0d0e21e 175 if (pm->op_pmflags & PMf_KEEP) {
533c011a 176 cLOGOP->op_first->op_next = PL_op->op_next;
a0d0e21e 177 }
c737faaf 178#endif
9f141731 179
df787a7b 180 SP = args-1;
a0d0e21e
LW
181 RETURN;
182}
183
9f141731 184
a0d0e21e
LW
185PP(pp_substcont)
186{
39644a26 187 dSP;
4ebe6e95 188 PERL_CONTEXT *cx = CX_CUR();
eb578fdb
KW
189 PMOP * const pm = (PMOP*) cLOGOP->op_other;
190 SV * const dstr = cx->sb_dstr;
191 char *s = cx->sb_s;
192 char *m = cx->sb_m;
a0d0e21e 193 char *orig = cx->sb_orig;
eb578fdb 194 REGEXP * const rx = cx->sb_rx;
c445ea15 195 SV *nsv = NULL;
988e6e7e 196 REGEXP *old = PM_GETRE(pm);
f410a211
NC
197
198 PERL_ASYNC_CHECK();
199
988e6e7e 200 if(old != rx) {
bfed75c6 201 if(old)
988e6e7e 202 ReREFCNT_dec(old);
d6106309 203 PM_SETRE(pm,ReREFCNT_inc(rx));
d8f2cf8a
AB
204 }
205
d9f97599 206 rxres_restore(&cx->sb_rxres, rx);
c90c0ff4 207
a0d0e21e 208 if (cx->sb_iters++) {
3c6ef0a5 209 const SSize_t saviters = cx->sb_iters;
a0d0e21e 210 if (cx->sb_iters > cx->sb_maxiters)
cea2e8a9 211 DIE(aTHX_ "Substitution loop");
a0d0e21e 212
447ee134
DM
213 SvGETMAGIC(TOPs); /* possibly clear taint on $1 etc: #67962 */
214
ef07e810 215 /* See "how taint works" above pp_subst() */
20be6587
DM
216 if (SvTAINTED(TOPs))
217 cx->sb_rxtainted |= SUBST_TAINT_REPL;
447ee134 218 sv_catsv_nomg(dstr, POPs);
2c296965 219 if (CxONCE(cx) || s < orig ||
03c83e26
DM
220 !CALLREGEXEC(rx, s, cx->sb_strend, orig,
221 (s == m), cx->sb_targ, NULL,
d5e7783a 222 (REXEC_IGNOREPOS|REXEC_NOT_FIRST|REXEC_FAIL_ON_UNDERFLOW)))
a0d0e21e 223 {
8ca8a454 224 SV *targ = cx->sb_targ;
748a9306 225
078c425b
JH
226 assert(cx->sb_strend >= s);
227 if(cx->sb_strend > s) {
228 if (DO_UTF8(dstr) && !SvUTF8(targ))
4bac9ae4 229 sv_catpvn_nomg_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
078c425b 230 else
4bac9ae4 231 sv_catpvn_nomg(dstr, s, cx->sb_strend - s);
078c425b 232 }
20be6587
DM
233 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
234 cx->sb_rxtainted |= SUBST_TAINT_PAT;
9212bbba 235
8ca8a454
NC
236 if (pm->op_pmflags & PMf_NONDESTRUCT) {
237 PUSHs(dstr);
238 /* From here on down we're using the copy, and leaving the
239 original untouched. */
240 targ = dstr;
241 }
242 else {
9e0ea7f3
FC
243 SV_CHECK_THINKFIRST_COW_DROP(targ);
244 if (isGV(targ)) Perl_croak_no_modify();
245 SvPV_free(targ);
8ca8a454
NC
246 SvPV_set(targ, SvPVX(dstr));
247 SvCUR_set(targ, SvCUR(dstr));
248 SvLEN_set(targ, SvLEN(dstr));
249 if (DO_UTF8(dstr))
250 SvUTF8_on(targ);
251 SvPV_set(dstr, NULL);
252
52c47e16 253 PL_tainted = 0;
4f4d7508 254 mPUSHi(saviters - 1);
48c036b1 255
8ca8a454
NC
256 (void)SvPOK_only_UTF8(targ);
257 }
5cd24f17 258
20be6587 259 /* update the taint state of various various variables in
ef07e810
DM
260 * preparation for final exit.
261 * See "how taint works" above pp_subst() */
284167a5 262 if (TAINTING_get) {
20be6587
DM
263 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
264 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
265 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
266 )
267 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
268
269 if (!(cx->sb_rxtainted & SUBST_TAINT_BOOLRET)
270 && (cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT))
271 )
272 SvTAINTED_on(TOPs); /* taint return value */
273 /* needed for mg_set below */
284167a5
SM
274 TAINT_set(
275 cBOOL(cx->sb_rxtainted &
276 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL))
277 );
20be6587
DM
278 SvTAINT(TARG);
279 }
280 /* PL_tainted must be correctly set for this mg_set */
281 SvSETMAGIC(TARG);
282 TAINT_NOT;
80d88db0 283
8e7e33ef 284 CX_LEAVE_SCOPE(cx);
b405d38b 285 CX_POPSUBST(cx);
5da525e9 286 CX_POP(cx);
80d88db0 287
47c9d59f 288 PERL_ASYNC_CHECK();
a0d0e21e 289 RETURNOP(pm->op_next);
e5964223 290 NOT_REACHED; /* NOTREACHED */
a0d0e21e 291 }
8e5e9ebe 292 cx->sb_iters = saviters;
a0d0e21e 293 }
07bc277f 294 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
a0d0e21e
LW
295 m = s;
296 s = orig;
6502e081 297 assert(!RX_SUBOFFSET(rx));
07bc277f 298 cx->sb_orig = orig = RX_SUBBEG(rx);
a0d0e21e
LW
299 s = orig + (m - s);
300 cx->sb_strend = s + (cx->sb_strend - m);
301 }
07bc277f 302 cx->sb_m = m = RX_OFFS(rx)[0].start + orig;
db79b45b 303 if (m > s) {
bfed75c6 304 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
4bac9ae4 305 sv_catpvn_nomg_utf8_upgrade(dstr, s, m - s, nsv);
db79b45b 306 else
4bac9ae4 307 sv_catpvn_nomg(dstr, s, m-s);
db79b45b 308 }
07bc277f 309 cx->sb_s = RX_OFFS(rx)[0].end + orig;
084916e3 310 { /* Update the pos() information. */
8ca8a454
NC
311 SV * const sv
312 = (pm->op_pmflags & PMf_NONDESTRUCT) ? cx->sb_dstr : cx->sb_targ;
084916e3 313 MAGIC *mg;
a911bb25
DM
314
315 /* the string being matched against may no longer be a string,
316 * e.g. $_=0; s/.../$_++/ge */
317
318 if (!SvPOK(sv))
319 SvPV_force_nomg_nolen(sv);
320
96c2a8ff
FC
321 if (!(mg = mg_find_mglob(sv))) {
322 mg = sv_magicext_mglob(sv);
084916e3 323 }
cda67c99 324 MgBYTEPOS_set(mg, sv, SvPVX(sv), m - orig);
084916e3 325 }
988e6e7e 326 if (old != rx)
d6106309 327 (void)ReREFCNT_inc(rx);
20be6587 328 /* update the taint state of various various variables in preparation
ef07e810
DM
329 * for calling the code block.
330 * See "how taint works" above pp_subst() */
284167a5 331 if (TAINTING_get) {
20be6587
DM
332 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
333 cx->sb_rxtainted |= SUBST_TAINT_PAT;
334
335 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
336 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
337 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
338 )
339 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
340
341 if (cx->sb_iters > 1 && (cx->sb_rxtainted &
342 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL)))
8ca8a454
NC
343 SvTAINTED_on((pm->op_pmflags & PMf_NONDESTRUCT)
344 ? cx->sb_dstr : cx->sb_targ);
20be6587
DM
345 TAINT_NOT;
346 }
d9f97599 347 rxres_save(&cx->sb_rxres, rx);
af9838cc 348 PL_curpm = pm;
29f2e912 349 RETURNOP(pm->op_pmstashstartu.op_pmreplstart);
a0d0e21e
LW
350}
351
c90c0ff4 352void
864dbfa3 353Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
c90c0ff4
PP
354{
355 UV *p = (UV*)*rsp;
356 U32 i;
7918f24d
NC
357
358 PERL_ARGS_ASSERT_RXRES_SAVE;
96a5add6 359 PERL_UNUSED_CONTEXT;
c90c0ff4 360
07bc277f 361 if (!p || p[1] < RX_NPARENS(rx)) {
db2c6cb3 362#ifdef PERL_ANY_COW
6502e081 363 i = 7 + (RX_NPARENS(rx)+1) * 2;
ed252734 364#else
6502e081 365 i = 6 + (RX_NPARENS(rx)+1) * 2;
ed252734 366#endif
c90c0ff4 367 if (!p)
a02a5408 368 Newx(p, i, UV);
c90c0ff4
PP
369 else
370 Renew(p, i, UV);
371 *rsp = (void*)p;
372 }
373
5eabab15
DM
374 /* what (if anything) to free on croak */
375 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? RX_SUBBEG(rx) : NULL);
cf93c79d 376 RX_MATCH_COPIED_off(rx);
6c31ff74 377 *p++ = RX_NPARENS(rx);
c90c0ff4 378
db2c6cb3 379#ifdef PERL_ANY_COW
bdd9a1b1
NC
380 *p++ = PTR2UV(RX_SAVED_COPY(rx));
381 RX_SAVED_COPY(rx) = NULL;
ed252734
NC
382#endif
383
07bc277f
NC
384 *p++ = PTR2UV(RX_SUBBEG(rx));
385 *p++ = (UV)RX_SUBLEN(rx);
6502e081
DM
386 *p++ = (UV)RX_SUBOFFSET(rx);
387 *p++ = (UV)RX_SUBCOFFSET(rx);
07bc277f
NC
388 for (i = 0; i <= RX_NPARENS(rx); ++i) {
389 *p++ = (UV)RX_OFFS(rx)[i].start;
390 *p++ = (UV)RX_OFFS(rx)[i].end;
c90c0ff4
PP
391 }
392}
393
9c105995
NC
394static void
395S_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
c90c0ff4
PP
396{
397 UV *p = (UV*)*rsp;
398 U32 i;
7918f24d
NC
399
400 PERL_ARGS_ASSERT_RXRES_RESTORE;
96a5add6 401 PERL_UNUSED_CONTEXT;
c90c0ff4 402
ed252734 403 RX_MATCH_COPY_FREE(rx);
cf93c79d 404 RX_MATCH_COPIED_set(rx, *p);
c90c0ff4 405 *p++ = 0;
6c31ff74 406 RX_NPARENS(rx) = *p++;
c90c0ff4 407
db2c6cb3 408#ifdef PERL_ANY_COW
bdd9a1b1
NC
409 if (RX_SAVED_COPY(rx))
410 SvREFCNT_dec (RX_SAVED_COPY(rx));
411 RX_SAVED_COPY(rx) = INT2PTR(SV*,*p);
ed252734
NC
412 *p++ = 0;
413#endif
414
07bc277f
NC
415 RX_SUBBEG(rx) = INT2PTR(char*,*p++);
416 RX_SUBLEN(rx) = (I32)(*p++);
6502e081
DM
417 RX_SUBOFFSET(rx) = (I32)*p++;
418 RX_SUBCOFFSET(rx) = (I32)*p++;
07bc277f
NC
419 for (i = 0; i <= RX_NPARENS(rx); ++i) {
420 RX_OFFS(rx)[i].start = (I32)(*p++);
421 RX_OFFS(rx)[i].end = (I32)(*p++);
c90c0ff4
PP
422 }
423}
424
9c105995
NC
425static void
426S_rxres_free(pTHX_ void **rsp)
c90c0ff4 427{
44f8325f 428 UV * const p = (UV*)*rsp;
7918f24d
NC
429
430 PERL_ARGS_ASSERT_RXRES_FREE;
96a5add6 431 PERL_UNUSED_CONTEXT;
c90c0ff4
PP
432
433 if (p) {
94010e71 434 void *tmp = INT2PTR(char*,*p);
6c31ff74 435#ifdef PERL_POISON
db2c6cb3 436#ifdef PERL_ANY_COW
6c31ff74 437 U32 i = 9 + p[1] * 2;
94010e71 438#else
6c31ff74 439 U32 i = 8 + p[1] * 2;
94010e71 440#endif
6c31ff74
NC
441#endif
442
db2c6cb3 443#ifdef PERL_ANY_COW
6c31ff74 444 SvREFCNT_dec (INT2PTR(SV*,p[2]));
ed252734 445#endif
6c31ff74
NC
446#ifdef PERL_POISON
447 PoisonFree(p, i, sizeof(UV));
448#endif
449
450 Safefree(tmp);
c90c0ff4 451 Safefree(p);
4608196e 452 *rsp = NULL;
c90c0ff4
PP
453 }
454}
455
a701009a
DM
456#define FORM_NUM_BLANK (1<<30)
457#define FORM_NUM_POINT (1<<29)
458
a0d0e21e
LW
459PP(pp_formline)
460{
20b7effb 461 dSP; dMARK; dORIGMARK;
eb578fdb 462 SV * const tmpForm = *++MARK;
086b26f3 463 SV *formsv; /* contains text of original format */
eb578fdb
KW
464 U32 *fpc; /* format ops program counter */
465 char *t; /* current append position in target string */
086b26f3 466 const char *f; /* current position in format string */
eb578fdb
KW
467 I32 arg;
468 SV *sv = NULL; /* current item */
086b26f3 469 const char *item = NULL;/* string value of current item */
9b4bdfd4
DM
470 I32 itemsize = 0; /* length (chars) of item, possibly truncated */
471 I32 itembytes = 0; /* as itemsize, but length in bytes */
086b26f3
DM
472 I32 fieldsize = 0; /* width of current field */
473 I32 lines = 0; /* number of lines that have been output */
474 bool chopspace = (strchr(PL_chopset, ' ') != NULL); /* does $: have space */
475 const char *chophere = NULL; /* where to chop current item */
f5ada144 476 STRLEN linemark = 0; /* pos of start of line in output */
65202027 477 NV value;
086b26f3 478 bool gotsome = FALSE; /* seen at least one non-blank item on this line */
9b4bdfd4 479 STRLEN len; /* length of current sv */
732f08da 480 STRLEN linemax; /* estimate of output size in bytes */
1bd51a4c
IH
481 bool item_is_utf8 = FALSE;
482 bool targ_is_utf8 = FALSE;
bd7084a6 483 const char *fmt;
74e0ddf7 484 MAGIC *mg = NULL;
4ff700b9
DM
485 U8 *source; /* source of bytes to append */
486 STRLEN to_copy; /* how may bytes to append */
ea60cfe8 487 char trans; /* what chars to translate */
92ff660b 488 bool copied_form = FALSE; /* have we duplicated the form? */
74e0ddf7 489
3808a683 490 mg = doparseform(tmpForm);
a0d0e21e 491
74e0ddf7 492 fpc = (U32*)mg->mg_ptr;
3808a683
DM
493 /* the actual string the format was compiled from.
494 * with overload etc, this may not match tmpForm */
495 formsv = mg->mg_obj;
496
74e0ddf7 497
3280af22 498 SvPV_force(PL_formtarget, len);
3808a683 499 if (SvTAINTED(tmpForm) || SvTAINTED(formsv))
125b9982 500 SvTAINTED_on(PL_formtarget);
1bd51a4c
IH
501 if (DO_UTF8(PL_formtarget))
502 targ_is_utf8 = TRUE;
732f08da
DM
503 /* this is an initial estimate of how much output buffer space
504 * to allocate. It may be exceeded later */
505 linemax = (SvCUR(formsv) * (IN_BYTES ? 1 : 3) + 1);
506 t = SvGROW(PL_formtarget, len + linemax + 1);
26e935cf 507 /* XXX from now onwards, SvCUR(PL_formtarget) is invalid */
a0d0e21e 508 t += len;
3808a683 509 f = SvPV_const(formsv, len);
a0d0e21e
LW
510
511 for (;;) {
512 DEBUG_f( {
bfed75c6 513 const char *name = "???";
a0d0e21e
LW
514 arg = -1;
515 switch (*fpc) {
516 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
517 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
518 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
519 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
520 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
521
522 case FF_CHECKNL: name = "CHECKNL"; break;
523 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
524 case FF_SPACE: name = "SPACE"; break;
525 case FF_HALFSPACE: name = "HALFSPACE"; break;
526 case FF_ITEM: name = "ITEM"; break;
527 case FF_CHOP: name = "CHOP"; break;
528 case FF_LINEGLOB: name = "LINEGLOB"; break;
529 case FF_NEWLINE: name = "NEWLINE"; break;
530 case FF_MORE: name = "MORE"; break;
531 case FF_LINEMARK: name = "LINEMARK"; break;
532 case FF_END: name = "END"; break;
bfed75c6 533 case FF_0DECIMAL: name = "0DECIMAL"; break;
a1b95068 534 case FF_LINESNGL: name = "LINESNGL"; break;
a0d0e21e
LW
535 }
536 if (arg >= 0)
bf49b057 537 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
a0d0e21e 538 else
bf49b057 539 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
5f80b19c 540 } );
a0d0e21e 541 switch (*fpc++) {
4a73dc0b 542 case FF_LINEMARK: /* start (or end) of a line */
f5ada144 543 linemark = t - SvPVX(PL_formtarget);
a0d0e21e
LW
544 lines++;
545 gotsome = FALSE;
546 break;
547
4a73dc0b 548 case FF_LITERAL: /* append <arg> literal chars */
ea60cfe8
DM
549 to_copy = *fpc++;
550 source = (U8 *)f;
551 f += to_copy;
552 trans = '~';
75645721 553 item_is_utf8 = targ_is_utf8 ? !!DO_UTF8(formsv) : !!SvUTF8(formsv);
ea60cfe8 554 goto append;
a0d0e21e 555
4a73dc0b 556 case FF_SKIP: /* skip <arg> chars in format */
a0d0e21e
LW
557 f += *fpc++;
558 break;
559
4a73dc0b 560 case FF_FETCH: /* get next item and set field size to <arg> */
a0d0e21e
LW
561 arg = *fpc++;
562 f += arg;
563 fieldsize = arg;
564
565 if (MARK < SP)
566 sv = *++MARK;
567 else {
3280af22 568 sv = &PL_sv_no;
a2a5de95 569 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
a0d0e21e 570 }
125b9982
NT
571 if (SvTAINTED(sv))
572 SvTAINTED_on(PL_formtarget);
a0d0e21e
LW
573 break;
574
4a73dc0b 575 case FF_CHECKNL: /* find max len of item (up to \n) that fits field */
5a34cab7 576 {
5a34cab7 577 const char *s = item = SvPV_const(sv, len);
9b4bdfd4
DM
578 const char *send = s + len;
579
580 itemsize = 0;
581 item_is_utf8 = DO_UTF8(sv);
582 while (s < send) {
583 if (!isCNTRL(*s))
584 gotsome = TRUE;
585 else if (*s == '\n')
586 break;
587
588 if (item_is_utf8)
589 s += UTF8SKIP(s);
590 else
591 s++;
592 itemsize++;
593 if (itemsize == fieldsize)
594 break;
595 }
596 itembytes = s - item;
62db6ea5 597 chophere = s;
5a34cab7 598 break;
a0ed51b3 599 }
a0d0e21e 600
4a73dc0b 601 case FF_CHECKCHOP: /* like CHECKNL, but up to highest split point */
5a34cab7
NC
602 {
603 const char *s = item = SvPV_const(sv, len);
9b4bdfd4
DM
604 const char *send = s + len;
605 I32 size = 0;
606
607 chophere = NULL;
608 item_is_utf8 = DO_UTF8(sv);
609 while (s < send) {
610 /* look for a legal split position */
611 if (isSPACE(*s)) {
612 if (*s == '\r') {
613 chophere = s;
614 itemsize = size;
615 break;
616 }
617 if (chopspace) {
618 /* provisional split point */
619 chophere = s;
620 itemsize = size;
621 }
622 /* we delay testing fieldsize until after we've
623 * processed the possible split char directly
624 * following the last field char; so if fieldsize=3
625 * and item="a b cdef", we consume "a b", not "a".
626 * Ditto further down.
627 */
628 if (size == fieldsize)
629 break;
630 }
631 else {
632 if (strchr(PL_chopset, *s)) {
633 /* provisional split point */
634 /* for a non-space split char, we include
635 * the split char; hence the '+1' */
636 chophere = s + 1;
637 itemsize = size;
638 }
639 if (size == fieldsize)
640 break;
641 if (!isCNTRL(*s))
642 gotsome = TRUE;
643 }
644
645 if (item_is_utf8)
646 s += UTF8SKIP(s);
647 else
077dbbf3 648 s++;
9b4bdfd4
DM
649 size++;
650 }
651 if (!chophere || s == send) {
652 chophere = s;
653 itemsize = size;
654 }
655 itembytes = chophere - item;
656
5a34cab7 657 break;
a0d0e21e 658 }
a0d0e21e 659
4a73dc0b 660 case FF_SPACE: /* append padding space (diff of field, item size) */
a0d0e21e
LW
661 arg = fieldsize - itemsize;
662 if (arg) {
663 fieldsize -= arg;
664 while (arg-- > 0)
665 *t++ = ' ';
666 }
667 break;
668
4a73dc0b 669 case FF_HALFSPACE: /* like FF_SPACE, but only append half as many */
a0d0e21e
LW
670 arg = fieldsize - itemsize;
671 if (arg) {
672 arg /= 2;
673 fieldsize -= arg;
674 while (arg-- > 0)
675 *t++ = ' ';
676 }
677 break;
678
4a73dc0b 679 case FF_ITEM: /* append a text item, while blanking ctrl chars */
9b4bdfd4 680 to_copy = itembytes;
8aa7beb6
DM
681 source = (U8 *)item;
682 trans = 1;
8aa7beb6 683 goto append;
a0d0e21e 684
4a73dc0b 685 case FF_CHOP: /* (for ^*) chop the current item */
fb9282c3 686 if (sv != &PL_sv_no) {
5a34cab7 687 const char *s = chophere;
86191aed
TC
688 if (!copied_form &&
689 ((sv == tmpForm || SvSMAGICAL(sv))
690 || (SvGMAGICAL(tmpForm) && !sv_only_taint_gmagic(tmpForm))) ) {
691 /* sv and tmpForm are either the same SV, or magic might allow modification
692 of tmpForm when sv is modified, so copy */
693 SV *newformsv = sv_mortalcopy(formsv);
694 U32 *new_compiled;
695
696 f = SvPV_nolen(newformsv) + (f - SvPV_nolen(formsv));
697 Newx(new_compiled, mg->mg_len / sizeof(U32), U32);
698 memcpy(new_compiled, mg->mg_ptr, mg->mg_len);
699 SAVEFREEPV(new_compiled);
700 fpc = new_compiled + (fpc - (U32*)mg->mg_ptr);
701 formsv = newformsv;
702
92ff660b 703 copied_form = TRUE;
86191aed 704 }
5a34cab7 705 if (chopspace) {
af68e756 706 while (isSPACE(*s))
5a34cab7
NC
707 s++;
708 }
9b4bdfd4
DM
709 if (SvPOKp(sv))
710 sv_chop(sv,s);
711 else
712 /* tied, overloaded or similar strangeness.
713 * Do it the hard way */
714 sv_setpvn(sv, s, len - (s-item));
5a34cab7
NC
715 SvSETMAGIC(sv);
716 break;
a0d0e21e 717 }
2165bd23 718 /* FALLTHROUGH */
a0d0e21e 719
4a73dc0b 720 case FF_LINESNGL: /* process ^* */
a1b95068 721 chopspace = 0;
c67159e1 722 /* FALLTHROUGH */
4a73dc0b
DM
723
724 case FF_LINEGLOB: /* process @* */
5a34cab7 725 {
e32383e2 726 const bool oneline = fpc[-1] == FF_LINESNGL;
5a34cab7 727 const char *s = item = SvPV_const(sv, len);
7440a75b 728 const char *const send = s + len;
7440a75b 729
f3f2f1a3 730 item_is_utf8 = DO_UTF8(sv);
fb9282c3 731 chophere = s + len;
a1137ee5 732 if (!len)
7440a75b 733 break;
ea60cfe8 734 trans = 0;
0d21cefe 735 gotsome = TRUE;
4ff700b9
DM
736 source = (U8 *) s;
737 to_copy = len;
0d21cefe
DM
738 while (s < send) {
739 if (*s++ == '\n') {
740 if (oneline) {
9b4bdfd4 741 to_copy = s - item - 1;
0d21cefe
DM
742 chophere = s;
743 break;
744 } else {
745 if (s == send) {
0d21cefe
DM
746 to_copy--;
747 } else
748 lines++;
1bd51a4c 749 }
a0d0e21e 750 }
0d21cefe 751 }
a2c0032b
DM
752 }
753
ea60cfe8
DM
754 append:
755 /* append to_copy bytes from source to PL_formstring.
756 * item_is_utf8 implies source is utf8.
757 * if trans, translate certain characters during the copy */
a2c0032b
DM
758 {
759 U8 *tmp = NULL;
732f08da 760 STRLEN grow = 0;
0325ce87 761
732f08da
DM
762 SvCUR_set(PL_formtarget,
763 t - SvPVX_const(PL_formtarget));
0325ce87 764
0d21cefe
DM
765 if (targ_is_utf8 && !item_is_utf8) {
766 source = tmp = bytes_to_utf8(source, &to_copy);
732f08da 767 grow = to_copy;
0d21cefe
DM
768 } else {
769 if (item_is_utf8 && !targ_is_utf8) {
f5ada144 770 U8 *s;
0d21cefe 771 /* Upgrade targ to UTF8, and then we reduce it to
0325ce87
DM
772 a problem we have a simple solution for.
773 Don't need get magic. */
0d21cefe 774 sv_utf8_upgrade_nomg(PL_formtarget);
0325ce87 775 targ_is_utf8 = TRUE;
f5ada144
DM
776 /* re-calculate linemark */
777 s = (U8*)SvPVX(PL_formtarget);
732f08da
DM
778 /* the bytes we initially allocated to append the
779 * whole line may have been gobbled up during the
780 * upgrade, so allocate a whole new line's worth
781 * for safety */
782 grow = linemax;
f5ada144
DM
783 while (linemark--)
784 s += UTF8SKIP(s);
785 linemark = s - (U8*)SvPVX(PL_formtarget);
e8e72d41 786 }
0d21cefe
DM
787 /* Easy. They agree. */
788 assert (item_is_utf8 == targ_is_utf8);
789 }
732f08da
DM
790 if (!trans)
791 /* @* and ^* are the only things that can exceed
792 * the linemax, so grow by the output size, plus
793 * a whole new form's worth in case of any further
794 * output */
795 grow = linemax + to_copy;
796 if (grow)
797 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + grow + 1);
798 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
0d21cefe
DM
799
800 Copy(source, t, to_copy, char);
ea60cfe8 801 if (trans) {
8aa7beb6
DM
802 /* blank out ~ or control chars, depending on trans.
803 * works on bytes not chars, so relies on not
804 * matching utf8 continuation bytes */
ea60cfe8
DM
805 U8 *s = (U8*)t;
806 U8 *send = s + to_copy;
807 while (s < send) {
8aa7beb6 808 const int ch = *s;
077dbbf3 809 if (trans == '~' ? (ch == '~') : isCNTRL(ch))
ea60cfe8
DM
810 *s = ' ';
811 s++;
812 }
813 }
814
0d21cefe 815 t += to_copy;
732f08da 816 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) + to_copy);
a1137ee5 817 if (tmp)
0d21cefe 818 Safefree(tmp);
5a34cab7 819 break;
a0d0e21e 820 }
a0d0e21e 821
4a73dc0b 822 case FF_0DECIMAL: /* like FF_DECIMAL but for 0### */
a0d0e21e 823 arg = *fpc++;
bd7084a6 824 fmt = (const char *)
a029fa42 825 ((arg & FORM_NUM_POINT) ? "%#0*.*" NVff : "%0*.*" NVff);
bd7084a6 826 goto ff_dec;
5d37acd6 827
bd7084a6
DM
828 case FF_DECIMAL: /* do @##, ^##, where <arg>=(precision|flags) */
829 arg = *fpc++;
bd7084a6 830 fmt = (const char *)
a029fa42 831 ((arg & FORM_NUM_POINT) ? "%#*.*" NVff : "%*.*" NVff);
bd7084a6 832 ff_dec:
784707d5
JP
833 /* If the field is marked with ^ and the value is undefined,
834 blank it out. */
a701009a 835 if ((arg & FORM_NUM_BLANK) && !SvOK(sv)) {
784707d5
JP
836 arg = fieldsize;
837 while (arg--)
838 *t++ = ' ';
839 break;
840 }
841 gotsome = TRUE;
842 value = SvNV(sv);
a1b95068 843 /* overflow evidence */
bfed75c6 844 if (num_overflow(value, fieldsize, arg)) {
a1b95068
LW
845 arg = fieldsize;
846 while (arg--)
847 *t++ = '#';
848 break;
849 }
784707d5
JP
850 /* Formats aren't yet marked for locales, so assume "yes". */
851 {
e8549682
JH
852 Size_t max = SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget));
853 int len;
67d796ae
KW
854 DECLARATION_FOR_LC_NUMERIC_MANIPULATION;
855 STORE_LC_NUMERIC_SET_TO_NEEDED();
51f14a05 856 arg &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
a4eca1d4
JH
857#ifdef USE_QUADMATH
858 {
859 const char* qfmt = quadmath_format_single(fmt);
860 int len;
861 if (!qfmt)
862 Perl_croak_nocontext("panic: quadmath invalid format \"%s\"", fmt);
863 len = quadmath_snprintf(t, max, qfmt, (int) fieldsize, (int) arg, value);
864 if (len == -1)
865 Perl_croak_nocontext("panic: quadmath_snprintf failed, format \"%s\"", qfmt);
866 if (qfmt != fmt)
867 Safefree(fmt);
868 }
869#else
b587c0e8
DM
870 /* we generate fmt ourselves so it is safe */
871 GCC_DIAG_IGNORE(-Wformat-nonliteral);
e8549682 872 len = my_snprintf(t, max, fmt, (int) fieldsize, (int) arg, value);
b587c0e8 873 GCC_DIAG_RESTORE;
a4eca1d4
JH
874#endif
875 PERL_MY_SNPRINTF_POST_GUARD(len, max);
a2287a13 876 RESTORE_LC_NUMERIC();
784707d5
JP
877 }
878 t += fieldsize;
879 break;
a1b95068 880
4a73dc0b 881 case FF_NEWLINE: /* delete trailing spaces, then append \n */
a0d0e21e 882 f++;
732f08da 883 while (t-- > (SvPVX(PL_formtarget) + linemark) && *t == ' ') ;
a0d0e21e
LW
884 t++;
885 *t++ = '\n';
886 break;
887
4a73dc0b 888 case FF_BLANK: /* for arg==0: do '~'; for arg>0 : do '~~' */
a0d0e21e
LW
889 arg = *fpc++;
890 if (gotsome) {
891 if (arg) { /* repeat until fields exhausted? */
11f9eeaf
DM
892 fpc--;
893 goto end;
a0d0e21e
LW
894 }
895 }
896 else {
f5ada144 897 t = SvPVX(PL_formtarget) + linemark;
a0d0e21e
LW
898 lines--;
899 }
900 break;
901
4a73dc0b 902 case FF_MORE: /* replace long end of string with '...' */
5a34cab7
NC
903 {
904 const char *s = chophere;
905 const char *send = item + len;
906 if (chopspace) {
af68e756 907 while (isSPACE(*s) && (s < send))
5a34cab7 908 s++;
a0d0e21e 909 }
5a34cab7
NC
910 if (s < send) {
911 char *s1;
912 arg = fieldsize - itemsize;
913 if (arg) {
914 fieldsize -= arg;
915 while (arg-- > 0)
916 *t++ = ' ';
917 }
918 s1 = t - 3;
f55ac4a4 919 if (strBEGINs(s1," ")) {
5a34cab7
NC
920 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
921 s1--;
922 }
923 *s1++ = '.';
924 *s1++ = '.';
925 *s1++ = '.';
a0d0e21e 926 }
5a34cab7 927 break;
a0d0e21e 928 }
4a73dc0b
DM
929
930 case FF_END: /* tidy up, then return */
11f9eeaf 931 end:
bf2bec63 932 assert(t < SvPVX_const(PL_formtarget) + SvLEN(PL_formtarget));
a0d0e21e 933 *t = '\0';
b15aece3 934 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
1bd51a4c
IH
935 if (targ_is_utf8)
936 SvUTF8_on(PL_formtarget);
3280af22 937 FmLINES(PL_formtarget) += lines;
a0d0e21e 938 SP = ORIGMARK;
11f9eeaf
DM
939 if (fpc[-1] == FF_BLANK)
940 RETURNOP(cLISTOP->op_first);
941 else
942 RETPUSHYES;
a0d0e21e
LW
943 }
944 }
945}
946
10088f56 947/* also used for: pp_mapstart() */
a0d0e21e
LW
948PP(pp_grepstart)
949{
20b7effb 950 dSP;
a0d0e21e
LW
951 SV *src;
952
6cae08a8 953 if (PL_stack_base + TOPMARK == SP) {
a0d0e21e 954 (void)POPMARK;
54310121 955 if (GIMME_V == G_SCALAR)
725c44f9 956 XPUSHs(&PL_sv_zero);
533c011a 957 RETURNOP(PL_op->op_next->op_next);
a0d0e21e 958 }
6cae08a8 959 PL_stack_sp = PL_stack_base + TOPMARK + 1;
897d3989
NC
960 Perl_pp_pushmark(aTHX); /* push dst */
961 Perl_pp_pushmark(aTHX); /* push src */
d343c3ef 962 ENTER_with_name("grep"); /* enter outer scope */
a0d0e21e
LW
963
964 SAVETMPS;
ffd49c98 965 SAVE_DEFSV;
d343c3ef 966 ENTER_with_name("grep_item"); /* enter inner scope */
7766f137 967 SAVEVPTR(PL_curpm);
a0d0e21e 968
6cae08a8 969 src = PL_stack_base[TOPMARK];
60779a30 970 if (SvPADTMP(src)) {
6cae08a8 971 src = PL_stack_base[TOPMARK] = sv_mortalcopy(src);
a0ed822e
FC
972 PL_tmps_floor++;
973 }
a0d0e21e 974 SvTEMP_off(src);
ffd49c98 975 DEFSV_set(src);
a0d0e21e
LW
976
977 PUTBACK;
533c011a 978 if (PL_op->op_type == OP_MAPSTART)
897d3989 979 Perl_pp_pushmark(aTHX); /* push top */
533c011a 980 return ((LOGOP*)PL_op->op_next)->op_other;
a0d0e21e
LW
981}
982
a0d0e21e
LW
983PP(pp_mapwhile)
984{
20b7effb 985 dSP;
1c23e2bd 986 const U8 gimme = GIMME_V;
6cae08a8 987 I32 items = (SP - PL_stack_base) - TOPMARK; /* how many new items */
a0d0e21e
LW
988 I32 count;
989 I32 shift;
990 SV** src;
ac27b0f5 991 SV** dst;
a0d0e21e 992
544f3153 993 /* first, move source pointer to the next item in the source list */
3280af22 994 ++PL_markstack_ptr[-1];
544f3153
GS
995
996 /* if there are new items, push them into the destination list */
4c90a460 997 if (items && gimme != G_VOID) {
544f3153
GS
998 /* might need to make room back there first */
999 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
1000 /* XXX this implementation is very pessimal because the stack
1001 * is repeatedly extended for every set of items. Is possible
1002 * to do this without any stack extension or copying at all
1003 * by maintaining a separate list over which the map iterates
18ef8bea 1004 * (like foreach does). --gsar */
544f3153
GS
1005
1006 /* everything in the stack after the destination list moves
1007 * towards the end the stack by the amount of room needed */
1008 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
1009
1010 /* items to shift up (accounting for the moved source pointer) */
1011 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
18ef8bea
BT
1012
1013 /* This optimization is by Ben Tilly and it does
1014 * things differently from what Sarathy (gsar)
1015 * is describing. The downside of this optimization is
1016 * that leaves "holes" (uninitialized and hopefully unused areas)
1017 * to the Perl stack, but on the other hand this
1018 * shouldn't be a problem. If Sarathy's idea gets
1019 * implemented, this optimization should become
1020 * irrelevant. --jhi */
1021 if (shift < count)
1022 shift = count; /* Avoid shifting too often --Ben Tilly */
bfed75c6 1023
924508f0
GS
1024 EXTEND(SP,shift);
1025 src = SP;
1026 dst = (SP += shift);
3280af22
NIS
1027 PL_markstack_ptr[-1] += shift;
1028 *PL_markstack_ptr += shift;
544f3153 1029 while (count--)
a0d0e21e
LW
1030 *dst-- = *src--;
1031 }
544f3153 1032 /* copy the new items down to the destination list */
ac27b0f5 1033 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
22023b26 1034 if (gimme == G_ARRAY) {
b2a2a901
DM
1035 /* add returned items to the collection (making mortal copies
1036 * if necessary), then clear the current temps stack frame
1037 * *except* for those items. We do this splicing the items
1038 * into the start of the tmps frame (so some items may be on
59d53fd6 1039 * the tmps stack twice), then moving PL_tmps_floor above
b2a2a901
DM
1040 * them, then freeing the frame. That way, the only tmps that
1041 * accumulate over iterations are the return values for map.
1042 * We have to do to this way so that everything gets correctly
1043 * freed if we die during the map.
1044 */
1045 I32 tmpsbase;
1046 I32 i = items;
1047 /* make space for the slice */
1048 EXTEND_MORTAL(items);
1049 tmpsbase = PL_tmps_floor + 1;
1050 Move(PL_tmps_stack + tmpsbase,
1051 PL_tmps_stack + tmpsbase + items,
1052 PL_tmps_ix - PL_tmps_floor,
1053 SV*);
1054 PL_tmps_ix += items;
1055
1056 while (i-- > 0) {
1057 SV *sv = POPs;
1058 if (!SvTEMP(sv))
1059 sv = sv_mortalcopy(sv);
1060 *dst-- = sv;
1061 PL_tmps_stack[tmpsbase++] = SvREFCNT_inc_simple(sv);
1062 }
1063 /* clear the stack frame except for the items */
1064 PL_tmps_floor += items;
1065 FREETMPS;
1066 /* FREETMPS may have cleared the TEMP flag on some of the items */
1067 i = items;
1068 while (i-- > 0)
1069 SvTEMP_on(PL_tmps_stack[--tmpsbase]);
22023b26 1070 }
bfed75c6 1071 else {
22023b26
TP
1072 /* scalar context: we don't care about which values map returns
1073 * (we use undef here). And so we certainly don't want to do mortal
1074 * copies of meaningless values. */
1075 while (items-- > 0) {
b988aa42 1076 (void)POPs;
22023b26
TP
1077 *dst-- = &PL_sv_undef;
1078 }
b2a2a901 1079 FREETMPS;
22023b26 1080 }
a0d0e21e 1081 }
b2a2a901
DM
1082 else {
1083 FREETMPS;
1084 }
d343c3ef 1085 LEAVE_with_name("grep_item"); /* exit inner scope */
a0d0e21e
LW
1086
1087 /* All done yet? */
6cae08a8 1088 if (PL_markstack_ptr[-1] > TOPMARK) {
a0d0e21e
LW
1089
1090 (void)POPMARK; /* pop top */
d343c3ef 1091 LEAVE_with_name("grep"); /* exit outer scope */
a0d0e21e 1092 (void)POPMARK; /* pop src */
3280af22 1093 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
a0d0e21e 1094 (void)POPMARK; /* pop dst */
3280af22 1095 SP = PL_stack_base + POPMARK; /* pop original mark */
54310121 1096 if (gimme == G_SCALAR) {
7cc47870
RGS
1097 dTARGET;
1098 XPUSHi(items);
a0d0e21e 1099 }
54310121
PP
1100 else if (gimme == G_ARRAY)
1101 SP += items;
a0d0e21e
LW
1102 RETURN;
1103 }
1104 else {
1105 SV *src;
1106
d343c3ef 1107 ENTER_with_name("grep_item"); /* enter inner scope */
7766f137 1108 SAVEVPTR(PL_curpm);
a0d0e21e 1109
544f3153 1110 /* set $_ to the new source item */
3280af22 1111 src = PL_stack_base[PL_markstack_ptr[-1]];
60779a30 1112 if (SvPADTMP(src)) {
60779a30
DM
1113 src = sv_mortalcopy(src);
1114 }
a0d0e21e 1115 SvTEMP_off(src);
ffd49c98 1116 DEFSV_set(src);
a0d0e21e
LW
1117
1118 RETURNOP(cLOGOP->op_other);
1119 }
1120}
1121
a0d0e21e
LW
1122/* Range stuff. */
1123
1124PP(pp_range)
1125{
f4c975aa 1126 dTARG;
82334630 1127 if (GIMME_V == G_ARRAY)
1a67a97c 1128 return NORMAL;
f4c975aa
DM
1129 GETTARGET;
1130 if (SvTRUE_NN(targ))
1a67a97c 1131 return cLOGOP->op_other;
538573f7 1132 else
1a67a97c 1133 return NORMAL;
a0d0e21e
LW
1134}
1135
1136PP(pp_flip)
1137{
39644a26 1138 dSP;
a0d0e21e 1139
82334630 1140 if (GIMME_V == G_ARRAY) {
1a67a97c 1141 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
a0d0e21e
LW
1142 }
1143 else {
1144 dTOPss;
44f8325f 1145 SV * const targ = PAD_SV(PL_op->op_targ);
bfed75c6 1146 int flip = 0;
790090df 1147
bfed75c6 1148 if (PL_op->op_private & OPpFLIP_LINENUM) {
4e3399f9
YST
1149 if (GvIO(PL_last_in_gv)) {
1150 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1151 }
1152 else {
fafc274c 1153 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
44f8325f
AL
1154 if (gv && GvSV(gv))
1155 flip = SvIV(sv) == SvIV(GvSV(gv));
4e3399f9 1156 }
bfed75c6 1157 } else {
f4c975aa 1158 flip = SvTRUE_NN(sv);
bfed75c6
AL
1159 }
1160 if (flip) {
a0d0e21e 1161 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
533c011a 1162 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e 1163 sv_setiv(targ, 1);
3e3baf6d 1164 SETs(targ);
a0d0e21e
LW
1165 RETURN;
1166 }
1167 else {
1168 sv_setiv(targ, 0);
924508f0 1169 SP--;
1a67a97c 1170 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
a0d0e21e
LW
1171 }
1172 }
9aa3b533 1173 SvPVCLEAR(TARG);
a0d0e21e
LW
1174 SETs(targ);
1175 RETURN;
1176 }
1177}
1178
8e9bbdb9
RGS
1179/* This code tries to decide if "$left .. $right" should use the
1180 magical string increment, or if the range is numeric (we make
1181 an exception for .."0" [#18165]). AMS 20021031. */
1182
1183#define RANGE_IS_NUMERIC(left,right) ( \
b0e74086
RGS
1184 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1185 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
e0ab1c0e 1186 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
b15aece3 1187 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
e0ab1c0e 1188 && (!SvOK(right) || looks_like_number(right))))
8e9bbdb9 1189
a0d0e21e
LW
1190PP(pp_flop)
1191{
20b7effb 1192 dSP;
a0d0e21e 1193
82334630 1194 if (GIMME_V == G_ARRAY) {
a0d0e21e 1195 dPOPPOPssrl;
86cb7173 1196
5b295bef
RD
1197 SvGETMAGIC(left);
1198 SvGETMAGIC(right);
a0d0e21e 1199
8e9bbdb9 1200 if (RANGE_IS_NUMERIC(left,right)) {
b262c4c9 1201 IV i, j, n;
4d91eccc
FC
1202 if ((SvOK(left) && !SvIOK(left) && SvNV_nomg(left) < IV_MIN) ||
1203 (SvOK(right) && (SvIOK(right)
1204 ? SvIsUV(right) && SvUV(right) > IV_MAX
1205 : SvNV_nomg(right) > IV_MAX)))
d470f89e 1206 DIE(aTHX_ "Range iterator outside integer range");
f52e41ad 1207 i = SvIV_nomg(left);
b262c4c9
JH
1208 j = SvIV_nomg(right);
1209 if (j >= i) {
1210 /* Dance carefully around signed max. */
1211 bool overflow = (i <= 0 && j > SSize_t_MAX + i - 1);
1212 if (!overflow) {
1213 n = j - i + 1;
1214 /* The wraparound of signed integers is undefined
1215 * behavior, but here we aim for count >=1, and
1216 * negative count is just wrong. */
a1e27170
TC
1217 if (n < 1
1218#if IVSIZE > Size_t_size
1219 || n > SSize_t_MAX
1220#endif
1221 )
b262c4c9
JH
1222 overflow = TRUE;
1223 }
1224 if (overflow)
1225 Perl_croak(aTHX_ "Out of memory during list extend");
1226 EXTEND_MORTAL(n);
1227 EXTEND(SP, n);
bbce6d69 1228 }
c1ab3db2 1229 else
b262c4c9
JH
1230 n = 0;
1231 while (n--) {
fc01cab4 1232 SV * const sv = sv_2mortal(newSViv(i));
a0d0e21e 1233 PUSHs(sv);
fc01cab4
DM
1234 if (n) /* avoid incrementing above IV_MAX */
1235 i++;
a0d0e21e
LW
1236 }
1237 }
1238 else {
3c323193
FC
1239 STRLEN len, llen;
1240 const char * const lpv = SvPV_nomg_const(left, llen);
f52e41ad 1241 const char * const tmps = SvPV_nomg_const(right, len);
a0d0e21e 1242
3c323193 1243 SV *sv = newSVpvn_flags(lpv, llen, SvUTF8(left)|SVs_TEMP);
d6c970c7
AC
1244 if (DO_UTF8(right) && IN_UNI_8_BIT)
1245 len = sv_len_utf8_nomg(right);
89ea2908 1246 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
a0d0e21e 1247 XPUSHs(sv);
b15aece3 1248 if (strEQ(SvPVX_const(sv),tmps))
89ea2908 1249 break;
a0d0e21e
LW
1250 sv = sv_2mortal(newSVsv(sv));
1251 sv_inc(sv);
1252 }
a0d0e21e
LW
1253 }
1254 }
1255 else {
1256 dTOPss;
901017d6 1257 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
4e3399f9 1258 int flop = 0;
a0d0e21e 1259 sv_inc(targ);
4e3399f9
YST
1260
1261 if (PL_op->op_private & OPpFLIP_LINENUM) {
1262 if (GvIO(PL_last_in_gv)) {
1263 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1264 }
1265 else {
fafc274c 1266 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
4e3399f9
YST
1267 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1268 }
1269 }
1270 else {
f4c975aa 1271 flop = SvTRUE_NN(sv);
4e3399f9
YST
1272 }
1273
1274 if (flop) {
a0d0e21e 1275 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
396482e1 1276 sv_catpvs(targ, "E0");
a0d0e21e
LW
1277 }
1278 SETs(targ);
1279 }
1280
1281 RETURN;
1282}
1283
1284/* Control. */
1285
27da23d5 1286static const char * const context_name[] = {
515afda2 1287 "pseudo-block",
f31522f3 1288 NULL, /* CXt_WHEN never actually needs "block" */
76753e7f 1289 NULL, /* CXt_BLOCK never actually needs "block" */
f31522f3 1290 NULL, /* CXt_GIVEN never actually needs "block" */
76753e7f 1291 NULL, /* CXt_LOOP_PLAIN never actually needs "loop" */
76753e7f 1292 NULL, /* CXt_LOOP_LAZYIV never actually needs "loop" */
93661e56
DM
1293 NULL, /* CXt_LOOP_LAZYSV never actually needs "loop" */
1294 NULL, /* CXt_LOOP_LIST never actually needs "loop" */
1295 NULL, /* CXt_LOOP_ARY never actually needs "loop" */
515afda2 1296 "subroutine",
76753e7f 1297 "format",
515afda2 1298 "eval",
515afda2 1299 "substitution",
515afda2
NC
1300};
1301
76e3520e 1302STATIC I32
5db1eb8d 1303S_dopoptolabel(pTHX_ const char *label, STRLEN len, U32 flags)
a0d0e21e 1304{
eb578fdb 1305 I32 i;
a0d0e21e 1306
7918f24d
NC
1307 PERL_ARGS_ASSERT_DOPOPTOLABEL;
1308
a0d0e21e 1309 for (i = cxstack_ix; i >= 0; i--) {
eb578fdb 1310 const PERL_CONTEXT * const cx = &cxstack[i];
6b35e009 1311 switch (CxTYPE(cx)) {
a0d0e21e 1312 case CXt_SUBST:
a0d0e21e 1313 case CXt_SUB:
7766f137 1314 case CXt_FORMAT:
a0d0e21e 1315 case CXt_EVAL:
0a753a76 1316 case CXt_NULL:
dcbac5bb 1317 /* diag_listed_as: Exiting subroutine via %s */
a2a5de95
NC
1318 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1319 context_name[CxTYPE(cx)], OP_NAME(PL_op));
79646418 1320 if (CxTYPE(cx) == CXt_NULL) /* sort BLOCK */
515afda2
NC
1321 return -1;
1322 break;
93661e56 1323 case CXt_LOOP_PLAIN:
c6fdafd0 1324 case CXt_LOOP_LAZYIV:
d01136d6 1325 case CXt_LOOP_LAZYSV:
93661e56
DM
1326 case CXt_LOOP_LIST:
1327 case CXt_LOOP_ARY:
7e8f1eac 1328 {
5db1eb8d
BF
1329 STRLEN cx_label_len = 0;
1330 U32 cx_label_flags = 0;
1331 const char *cx_label = CxLABEL_len_flags(cx, &cx_label_len, &cx_label_flags);
1332 if (!cx_label || !(
1333 ( (cx_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ?
1334 (flags & SVf_UTF8)
1335 ? (bytes_cmp_utf8(
1336 (const U8*)cx_label, cx_label_len,
1337 (const U8*)label, len) == 0)
1338 : (bytes_cmp_utf8(
1339 (const U8*)label, len,
1340 (const U8*)cx_label, cx_label_len) == 0)
eade7155
BF
1341 : (len == cx_label_len && ((cx_label == label)
1342 || memEQ(cx_label, label, len))) )) {
1c98cc53 1343 DEBUG_l(Perl_deb(aTHX_ "(poptolabel(): skipping label at cx=%ld %s)\n",
7e8f1eac 1344 (long)i, cx_label));
a0d0e21e
LW
1345 continue;
1346 }
1c98cc53 1347 DEBUG_l( Perl_deb(aTHX_ "(poptolabel(): found label at cx=%ld %s)\n", (long)i, label));
a0d0e21e 1348 return i;
7e8f1eac 1349 }
a0d0e21e
LW
1350 }
1351 }
1352 return i;
1353}
1354
0d863452
RH
1355
1356
1c23e2bd 1357U8
864dbfa3 1358Perl_dowantarray(pTHX)
e50aee73 1359{
1c23e2bd 1360 const U8 gimme = block_gimme();
54310121
PP
1361 return (gimme == G_VOID) ? G_SCALAR : gimme;
1362}
1363
1c23e2bd 1364U8
864dbfa3 1365Perl_block_gimme(pTHX)
54310121 1366{
06b5626a 1367 const I32 cxix = dopoptosub(cxstack_ix);
a05700a8 1368 U8 gimme;
e50aee73 1369 if (cxix < 0)
46fc3d4c 1370 return G_VOID;
e50aee73 1371
a05700a8
DM
1372 gimme = (cxstack[cxix].blk_gimme & G_WANT);
1373 if (!gimme)
1374 Perl_croak(aTHX_ "panic: bad gimme: %d\n", gimme);
1375 return gimme;
e50aee73
AD
1376}
1377
a05700a8 1378
78f9721b
SM
1379I32
1380Perl_is_lvalue_sub(pTHX)
1381{
06b5626a 1382 const I32 cxix = dopoptosub(cxstack_ix);
78f9721b
SM
1383 assert(cxix >= 0); /* We should only be called from inside subs */
1384
bafb2adc
NC
1385 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1386 return CxLVAL(cxstack + cxix);
78f9721b
SM
1387 else
1388 return 0;
1389}
1390
a73d8813 1391/* only used by cx_pushsub() */
777d9014
FC
1392I32
1393Perl_was_lvalue_sub(pTHX)
1394{
777d9014
FC
1395 const I32 cxix = dopoptosub(cxstack_ix-1);
1396 assert(cxix >= 0); /* We should only be called from inside subs */
1397
1398 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1399 return CxLVAL(cxstack + cxix);
1400 else
1401 return 0;
1402}
1403
76e3520e 1404STATIC I32
901017d6 1405S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
2c375eb9 1406{
a0d0e21e 1407 I32 i;
7918f24d
NC
1408
1409 PERL_ARGS_ASSERT_DOPOPTOSUB_AT;
81611534
JH
1410#ifndef DEBUGGING
1411 PERL_UNUSED_CONTEXT;
1412#endif
7918f24d 1413
a0d0e21e 1414 for (i = startingblock; i >= 0; i--) {
eb578fdb 1415 const PERL_CONTEXT * const cx = &cxstk[i];
6b35e009 1416 switch (CxTYPE(cx)) {
a0d0e21e
LW
1417 default:
1418 continue;
a0d0e21e 1419 case CXt_SUB:
5fbe8311
DM
1420 /* in sub foo { /(?{...})/ }, foo ends up on the CX stack
1421 * twice; the first for the normal foo() call, and the second
1422 * for a faked up re-entry into the sub to execute the
1423 * code block. Hide this faked entry from the world. */
1424 if (cx->cx_type & CXp_SUB_RE_FAKE)
1425 continue;
c67159e1 1426 /* FALLTHROUGH */
5fbe8311 1427 case CXt_EVAL:
7766f137 1428 case CXt_FORMAT:
1c98cc53 1429 DEBUG_l( Perl_deb(aTHX_ "(dopoptosub_at(): found sub at cx=%ld)\n", (long)i));
a0d0e21e
LW
1430 return i;
1431 }
1432 }
1433 return i;
1434}
1435
76e3520e 1436STATIC I32
cea2e8a9 1437S_dopoptoeval(pTHX_ I32 startingblock)
a0d0e21e
LW
1438{
1439 I32 i;
a0d0e21e 1440 for (i = startingblock; i >= 0; i--) {
eb578fdb 1441 const PERL_CONTEXT *cx = &cxstack[i];
6b35e009 1442 switch (CxTYPE(cx)) {
a0d0e21e
LW
1443 default:
1444 continue;
1445 case CXt_EVAL:
1c98cc53 1446 DEBUG_l( Perl_deb(aTHX_ "(dopoptoeval(): found eval at cx=%ld)\n", (long)i));
a0d0e21e
LW
1447 return i;
1448 }
1449 }
1450 return i;
1451}
1452
76e3520e 1453STATIC I32
cea2e8a9 1454S_dopoptoloop(pTHX_ I32 startingblock)
a0d0e21e
LW
1455{
1456 I32 i;
a0d0e21e 1457 for (i = startingblock; i >= 0; i--) {
eb578fdb 1458 const PERL_CONTEXT * const cx = &cxstack[i];
6b35e009 1459 switch (CxTYPE(cx)) {
a0d0e21e 1460 case CXt_SUBST:
a0d0e21e 1461 case CXt_SUB:
7766f137 1462 case CXt_FORMAT:
a0d0e21e 1463 case CXt_EVAL:
0a753a76 1464 case CXt_NULL:
dcbac5bb 1465 /* diag_listed_as: Exiting subroutine via %s */
a2a5de95
NC
1466 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1467 context_name[CxTYPE(cx)], OP_NAME(PL_op));
79646418 1468 if ((CxTYPE(cx)) == CXt_NULL) /* sort BLOCK */
515afda2
NC
1469 return -1;
1470 break;
93661e56 1471 case CXt_LOOP_PLAIN:
c6fdafd0 1472 case CXt_LOOP_LAZYIV:
d01136d6 1473 case CXt_LOOP_LAZYSV:
93661e56
DM
1474 case CXt_LOOP_LIST:
1475 case CXt_LOOP_ARY:
1c98cc53 1476 DEBUG_l( Perl_deb(aTHX_ "(dopoptoloop(): found loop at cx=%ld)\n", (long)i));
a0d0e21e
LW
1477 return i;
1478 }
1479 }
1480 return i;
1481}
1482
28e0cf42 1483/* find the next GIVEN or FOR (with implicit $_) loop context block */
97f2561e 1484
0d863452 1485STATIC I32
97f2561e 1486S_dopoptogivenfor(pTHX_ I32 startingblock)
0d863452
RH
1487{
1488 I32 i;
1489 for (i = startingblock; i >= 0; i--) {
eb578fdb 1490 const PERL_CONTEXT *cx = &cxstack[i];
0d863452
RH
1491 switch (CxTYPE(cx)) {
1492 default:
1493 continue;
1494 case CXt_GIVEN:
97f2561e 1495 DEBUG_l( Perl_deb(aTHX_ "(dopoptogivenfor(): found given at cx=%ld)\n", (long)i));
0d863452 1496 return i;
3b719c58 1497 case CXt_LOOP_PLAIN:
93661e56 1498 assert(!(cx->cx_type & CXp_FOR_DEF));
3b719c58 1499 break;
c6fdafd0 1500 case CXt_LOOP_LAZYIV:
d01136d6 1501 case CXt_LOOP_LAZYSV:
93661e56
DM
1502 case CXt_LOOP_LIST:
1503 case CXt_LOOP_ARY:
1504 if (cx->cx_type & CXp_FOR_DEF) {
97f2561e 1505 DEBUG_l( Perl_deb(aTHX_ "(dopoptogivenfor(): found foreach at cx=%ld)\n", (long)i));
0d863452
RH
1506 return i;
1507 }
1508 }
1509 }
1510 return i;
1511}
1512
1513STATIC I32
1514S_dopoptowhen(pTHX_ I32 startingblock)
1515{
1516 I32 i;
1517 for (i = startingblock; i >= 0; i--) {
eb578fdb 1518 const PERL_CONTEXT *cx = &cxstack[i];
0d863452
RH
1519 switch (CxTYPE(cx)) {
1520 default:
1521 continue;
1522 case CXt_WHEN:
1c98cc53 1523 DEBUG_l( Perl_deb(aTHX_ "(dopoptowhen(): found when at cx=%ld)\n", (long)i));
0d863452
RH
1524 return i;
1525 }
1526 }
1527 return i;
1528}
1529
abaf5d5a 1530/* dounwind(): pop all contexts above (but not including) cxix.
fc6e609e
DM
1531 * Note that it clears the savestack frame associated with each popped
1532 * context entry, but doesn't free any temps.
ed8ff0f3 1533 * It does a cx_popblock() of the last frame that it pops, and leaves
fc6e609e 1534 * cxstack_ix equal to cxix.
abaf5d5a
DM
1535 */
1536
a0d0e21e 1537void
864dbfa3 1538Perl_dounwind(pTHX_ I32 cxix)
a0d0e21e 1539{
f144f1e3
DM
1540 if (!PL_curstackinfo) /* can happen if die during thread cloning */
1541 return;
1542
a0d0e21e 1543 while (cxstack_ix > cxix) {
4ebe6e95 1544 PERL_CONTEXT *cx = CX_CUR();
5e691bc6
DM
1545
1546 CX_DEBUG(cx, "UNWIND");
a0d0e21e 1547 /* Note: we don't need to restore the base context info till the end. */
76d10131
DM
1548
1549 CX_LEAVE_SCOPE(cx);
1550
6b35e009 1551 switch (CxTYPE(cx)) {
c90c0ff4 1552 case CXt_SUBST:
b405d38b 1553 CX_POPSUBST(cx);
7332835e
DM
1554 /* CXt_SUBST is not a block context type, so skip the
1555 * cx_popblock(cx) below */
1556 if (cxstack_ix == cxix + 1) {
1557 cxstack_ix--;
1558 return;
1559 }
80d88db0 1560 break;
a0d0e21e 1561 case CXt_SUB:
a73d8813 1562 cx_popsub(cx);
a0d0e21e
LW
1563 break;
1564 case CXt_EVAL:
13febba5 1565 cx_popeval(cx);
03e489bc 1566 break;
93661e56 1567 case CXt_LOOP_PLAIN:
c6fdafd0 1568 case CXt_LOOP_LAZYIV:
d01136d6 1569 case CXt_LOOP_LAZYSV:
93661e56
DM
1570 case CXt_LOOP_LIST:
1571 case CXt_LOOP_ARY:
d1b6bf72 1572 cx_poploop(cx);
a0d0e21e 1573 break;
b95eccd3 1574 case CXt_WHEN:
2a7b7c61 1575 cx_popwhen(cx);
b95eccd3
DM
1576 break;
1577 case CXt_GIVEN:
2a7b7c61 1578 cx_popgiven(cx);
b95eccd3 1579 break;
f217cb3d 1580 case CXt_BLOCK:
0a753a76 1581 case CXt_NULL:
f217cb3d 1582 /* these two don't have a POPFOO() */
a0d0e21e 1583 break;
7766f137 1584 case CXt_FORMAT:
6a7d52cc 1585 cx_popformat(cx);
7766f137 1586 break;
a0d0e21e 1587 }
fc6e609e 1588 if (cxstack_ix == cxix + 1) {
ed8ff0f3 1589 cx_popblock(cx);
fc6e609e 1590 }
c90c0ff4 1591 cxstack_ix--;
a0d0e21e 1592 }
fc6e609e 1593
a0d0e21e
LW
1594}
1595
5a844595
GS
1596void
1597Perl_qerror(pTHX_ SV *err)
1598{
7918f24d
NC
1599 PERL_ARGS_ASSERT_QERROR;
1600
6b2fb389
DM
1601 if (PL_in_eval) {
1602 if (PL_in_eval & EVAL_KEEPERR) {
147e3846 1603 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %" SVf,
ecad31f0 1604 SVfARG(err));
6b2fb389
DM
1605 }
1606 else
1607 sv_catsv(ERRSV, err);
1608 }
5a844595
GS
1609 else if (PL_errors)
1610 sv_catsv(PL_errors, err);
1611 else
147e3846 1612 Perl_warn(aTHX_ "%" SVf, SVfARG(err));
13765c85
DM
1613 if (PL_parser)
1614 ++PL_parser->error_count;
5a844595
GS
1615}
1616
d308a779
DM
1617
1618
06a7bc17
DM
1619/* pop a CXt_EVAL context and in addition, if it was a require then
1620 * based on action:
1621 * 0: do nothing extra;
1622 * 1: undef $INC{$name}; croak "$name did not return a true value";
1623 * 2: delete $INC{$name}; croak "$errsv: Compilation failed in require"
1624 */
d308a779 1625
8a1fd305 1626static void
06a7bc17 1627S_pop_eval_context_maybe_croak(pTHX_ PERL_CONTEXT *cx, SV *errsv, int action)
d308a779 1628{
51787acf 1629 SV *namesv = NULL; /* init to avoid dumb compiler warning */
06a7bc17
DM
1630 bool do_croak;
1631
1632 CX_LEAVE_SCOPE(cx);
1633 do_croak = action && (CxOLD_OP_TYPE(cx) == OP_REQUIRE);
2a1e0dfe
DM
1634 if (do_croak) {
1635 /* keep namesv alive after cx_popeval() */
1636 namesv = cx->blk_eval.old_namesv;
1637 cx->blk_eval.old_namesv = NULL;
1638 sv_2mortal(namesv);
1639 }
06a7bc17
DM
1640 cx_popeval(cx);
1641 cx_popblock(cx);
1642 CX_POP(cx);
1643
1644 if (do_croak) {
1645 const char *fmt;
1646 HV *inc_hv = GvHVn(PL_incgv);
1647 I32 klen = SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv);
1648 const char *key = SvPVX_const(namesv);
d308a779 1649
06a7bc17
DM
1650 if (action == 1) {
1651 (void)hv_delete(inc_hv, key, klen, G_DISCARD);
147e3846 1652 fmt = "%" SVf " did not return a true value";
06a7bc17
DM
1653 errsv = namesv;
1654 }
1655 else {
1656 (void)hv_store(inc_hv, key, klen, &PL_sv_undef, 0);
147e3846 1657 fmt = "%" SVf "Compilation failed in require";
06a7bc17
DM
1658 if (!errsv)
1659 errsv = newSVpvs_flags("Unknown error\n", SVs_TEMP);
1660 }
1661
1662 Perl_croak(aTHX_ fmt, SVfARG(errsv));
1663 }
d308a779
DM
1664}
1665
1666
8c86f023
DM
1667/* die_unwind(): this is the final destination for the various croak()
1668 * functions. If we're in an eval, unwind the context and other stacks
1669 * back to the top-most CXt_EVAL and set $@ to msv; otherwise print msv
1670 * to STDERR and initiate an exit. Note that if the CXt_EVAL popped back
1671 * to is a require the exception will be rethrown, as requires don't
1672 * actually trap exceptions.
1673 */
06a7bc17 1674
bb4c52e0 1675void
c5df3096 1676Perl_die_unwind(pTHX_ SV *msv)
a0d0e21e 1677{
8c86f023 1678 SV *exceptsv = msv;
96d9b9cd 1679 U8 in_eval = PL_in_eval;
c5df3096 1680 PERL_ARGS_ASSERT_DIE_UNWIND;
87582a92 1681
96d9b9cd 1682 if (in_eval) {
a0d0e21e 1683 I32 cxix;
a0d0e21e 1684
b66d79a6
DM
1685 /* We need to keep this SV alive through all the stack unwinding
1686 * and FREETMPSing below, while ensuing that it doesn't leak
1687 * if we call out to something which then dies (e.g. sub STORE{die}
1688 * when unlocalising a tied var). So we do a dance with
1689 * mortalising and SAVEFREEing.
1690 */
1691 sv_2mortal(SvREFCNT_inc_simple_NN(exceptsv));
8c86f023 1692
22a30693
Z
1693 /*
1694 * Historically, perl used to set ERRSV ($@) early in the die
1695 * process and rely on it not getting clobbered during unwinding.
1696 * That sucked, because it was liable to get clobbered, so the
1697 * setting of ERRSV used to emit the exception from eval{} has
1698 * been moved to much later, after unwinding (see just before
1699 * JMPENV_JUMP below). However, some modules were relying on the
1700 * early setting, by examining $@ during unwinding to use it as
1701 * a flag indicating whether the current unwinding was caused by
1702 * an exception. It was never a reliable flag for that purpose,
1703 * being totally open to false positives even without actual
1704 * clobberage, but was useful enough for production code to
1705 * semantically rely on it.
1706 *
1707 * We'd like to have a proper introspective interface that
1708 * explicitly describes the reason for whatever unwinding
1709 * operations are currently in progress, so that those modules
1710 * work reliably and $@ isn't further overloaded. But we don't
1711 * have one yet. In its absence, as a stopgap measure, ERRSV is
1712 * now *additionally* set here, before unwinding, to serve as the
1713 * (unreliable) flag that it used to.
1714 *
1715 * This behaviour is temporary, and should be removed when a
1716 * proper way to detect exceptional unwinding has been developed.
1717 * As of 2010-12, the authors of modules relying on the hack
1718 * are aware of the issue, because the modules failed on
1719 * perls 5.13.{1..7} which had late setting of $@ without this
1720 * early-setting hack.
1721 */
8c86f023
DM
1722 if (!(in_eval & EVAL_KEEPERR))
1723 sv_setsv_flags(ERRSV, exceptsv,
1724 (SV_GMAGIC|SV_DO_COW_SVSETSV|SV_NOSTEAL));
22a30693 1725
fc941f37 1726 if (in_eval & EVAL_KEEPERR) {
147e3846 1727 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %" SVf,
fc941f37
Z
1728 SVfARG(exceptsv));
1729 }
1730
5a844595
GS
1731 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1732 && PL_curstackinfo->si_prev)
1733 {
bac4b2ad 1734 dounwind(-1);
d3acc0f7 1735 POPSTACK;
bac4b2ad 1736 }
e336de0d 1737
a0d0e21e 1738 if (cxix >= 0) {
eb578fdb 1739 PERL_CONTEXT *cx;
f5ddd604 1740 SV **oldsp;
1c23e2bd 1741 U8 gimme;
8f89e5a9
Z
1742 JMPENV *restartjmpenv;
1743 OP *restartop;
a0d0e21e
LW
1744
1745 if (cxix < cxstack_ix)
1746 dounwind(cxix);
1747
4ebe6e95 1748 cx = CX_CUR();
f7d0774b 1749 assert(CxTYPE(cx) == CXt_EVAL);
e17c1e7c
DM
1750
1751 /* return false to the caller of eval */
f5ddd604 1752 oldsp = PL_stack_base + cx->blk_oldsp;
f7d0774b 1753 gimme = cx->blk_gimme;
f7d0774b 1754 if (gimme == G_SCALAR)
f5ddd604
DM
1755 *++oldsp = &PL_sv_undef;
1756 PL_stack_sp = oldsp;
f7d0774b 1757
7d140242
DM
1758 restartjmpenv = cx->blk_eval.cur_top_env;
1759 restartop = cx->blk_eval.retop;
b66d79a6
DM
1760
1761 /* We need a FREETMPS here to avoid late-called destructors
1762 * clobbering $@ *after* we set it below, e.g.
1763 * sub DESTROY { eval { die "X" } }
1764 * eval { my $x = bless []; die $x = 0, "Y" };
1765 * is($@, "Y")
1766 * Here the clearing of the $x ref mortalises the anon array,
1767 * which needs to be freed *before* $& is set to "Y",
1768 * otherwise it gets overwritten with "X".
1769 *
1770 * However, the FREETMPS will clobber exceptsv, so preserve it
1771 * on the savestack for now.
1772 */
1773 SAVEFREESV(SvREFCNT_inc_simple_NN(exceptsv));
1774 FREETMPS;
1775 /* now we're about to pop the savestack, so re-mortalise it */
1776 sv_2mortal(SvREFCNT_inc_simple_NN(exceptsv));
1777
06a7bc17
DM
1778 /* Note that unlike pp_entereval, pp_require isn't supposed to
1779 * trap errors. So if we're a require, after we pop the
1780 * CXt_EVAL that pp_require pushed, rethrow the error with
1781 * croak(exceptsv). This is all handled by the call below when
1782 * action == 2.
1783 */
1784 S_pop_eval_context_maybe_croak(aTHX_ cx, exceptsv, 2);
a0d0e21e 1785
fc941f37 1786 if (!(in_eval & EVAL_KEEPERR))
96d9b9cd 1787 sv_setsv(ERRSV, exceptsv);
8f89e5a9
Z
1788 PL_restartjmpenv = restartjmpenv;
1789 PL_restartop = restartop;
bb4c52e0 1790 JMPENV_JUMP(3);
e5964223 1791 NOT_REACHED; /* NOTREACHED */
a0d0e21e
LW
1792 }
1793 }
87582a92 1794
96d9b9cd 1795 write_to_stderr(exceptsv);
f86702cc 1796 my_failure_exit();
e5964223 1797 NOT_REACHED; /* NOTREACHED */
a0d0e21e
LW
1798}
1799
1800PP(pp_xor)
1801{
20b7effb 1802 dSP; dPOPTOPssrl;
f4c975aa 1803 if (SvTRUE_NN(left) != SvTRUE_NN(right))
a0d0e21e
LW
1804 RETSETYES;
1805 else
1806 RETSETNO;
1807}
1808
8dff4fc5 1809/*
dcccc8ff
KW
1810
1811=head1 CV Manipulation Functions
1812
8dff4fc5
BM
1813=for apidoc caller_cx
1814
72d33970 1815The XSUB-writer's equivalent of L<caller()|perlfunc/caller>. The
8dff4fc5 1816returned C<PERL_CONTEXT> structure can be interrogated to find all the
72d33970 1817information returned to Perl by C<caller>. Note that XSUBs don't get a
8dff4fc5
BM
1818stack frame, so C<caller_cx(0, NULL)> will return information for the
1819immediately-surrounding Perl code.
1820
1821This function skips over the automatic calls to C<&DB::sub> made on the
72d33970 1822behalf of the debugger. If the stack frame requested was a sub called by
8dff4fc5
BM
1823C<DB::sub>, the return value will be the frame for the call to
1824C<DB::sub>, since that has the correct line number/etc. for the call
72d33970 1825site. If I<dbcxp> is non-C<NULL>, it will be set to a pointer to the
8dff4fc5
BM
1826frame for the sub call itself.
1827
1828=cut
1829*/
1830
1831const PERL_CONTEXT *
1832Perl_caller_cx(pTHX_ I32 count, const PERL_CONTEXT **dbcxp)
a0d0e21e 1833{
eb578fdb
KW
1834 I32 cxix = dopoptosub(cxstack_ix);
1835 const PERL_CONTEXT *cx;
1836 const PERL_CONTEXT *ccstack = cxstack;
901017d6 1837 const PERL_SI *top_si = PL_curstackinfo;
27d41816 1838
a0d0e21e 1839 for (;;) {
2c375eb9
GS
1840 /* we may be in a higher stacklevel, so dig down deeper */
1841 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1842 top_si = top_si->si_prev;
1843 ccstack = top_si->si_cxstack;
1844 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1845 }
8dff4fc5
BM
1846 if (cxix < 0)
1847 return NULL;
f2a7f298 1848 /* caller() should not report the automatic calls to &DB::sub */
1849 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
3280af22 1850 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
a0d0e21e
LW
1851 count++;
1852 if (!count--)
1853 break;
2c375eb9 1854 cxix = dopoptosub_at(ccstack, cxix - 1);
a0d0e21e 1855 }
2c375eb9
GS
1856
1857 cx = &ccstack[cxix];
8dff4fc5
BM
1858 if (dbcxp) *dbcxp = cx;
1859
7766f137 1860 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
f54cb97a 1861 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
2c375eb9 1862 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
06a5b730 1863 field below is defined for any cx. */
f2a7f298 1864 /* caller() should not report the automatic calls to &DB::sub */
1865 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
2c375eb9 1866 cx = &ccstack[dbcxix];
06a5b730
PP
1867 }
1868
8dff4fc5
BM
1869 return cx;
1870}
1871
1872PP(pp_caller)
1873{
8dff4fc5 1874 dSP;
eb578fdb 1875 const PERL_CONTEXT *cx;
8dff4fc5 1876 const PERL_CONTEXT *dbcx;
1c23e2bd 1877 U8 gimme = GIMME_V;
d527ce7c 1878 const HEK *stash_hek;
8dff4fc5 1879 I32 count = 0;
ce0b554b 1880 bool has_arg = MAXARG && TOPs;
25502127 1881 const COP *lcop;
8dff4fc5 1882
ce0b554b
FC
1883 if (MAXARG) {
1884 if (has_arg)
8dff4fc5 1885 count = POPi;
ce0b554b
FC
1886 else (void)POPs;
1887 }
8dff4fc5 1888
ce0b554b 1889 cx = caller_cx(count + !!(PL_op->op_private & OPpOFFBYONE), &dbcx);
8dff4fc5 1890 if (!cx) {
48ebc325 1891 if (gimme != G_ARRAY) {
8dff4fc5
BM
1892 EXTEND(SP, 1);
1893 RETPUSHUNDEF;
1894 }
1895 RETURN;
1896 }
1897
5e691bc6 1898 CX_DEBUG(cx, "CALLER");
d0279c7c 1899 assert(CopSTASH(cx->blk_oldcop));
e7886211
FC
1900 stash_hek = SvTYPE(CopSTASH(cx->blk_oldcop)) == SVt_PVHV
1901 ? HvNAME_HEK((HV*)CopSTASH(cx->blk_oldcop))
1902 : NULL;
48ebc325 1903 if (gimme != G_ARRAY) {
27d41816 1904 EXTEND(SP, 1);
d527ce7c 1905 if (!stash_hek)
3280af22 1906 PUSHs(&PL_sv_undef);
49d8d3a1
MB
1907 else {
1908 dTARGET;
d527ce7c 1909 sv_sethek(TARG, stash_hek);
49d8d3a1
MB
1910 PUSHs(TARG);
1911 }
a0d0e21e
LW
1912 RETURN;
1913 }
a0d0e21e 1914
b3ca2e83 1915 EXTEND(SP, 11);
27d41816 1916
d527ce7c 1917 if (!stash_hek)
3280af22 1918 PUSHs(&PL_sv_undef);
d527ce7c
BF
1919 else {
1920 dTARGET;
1921 sv_sethek(TARG, stash_hek);
1922 PUSHTARG;
1923 }
6e449a3a 1924 mPUSHs(newSVpv(OutCopFILE(cx->blk_oldcop), 0));
e6dae479 1925 lcop = closest_cop(cx->blk_oldcop, OpSIBLING(cx->blk_oldcop),
25502127
FC
1926 cx->blk_sub.retop, TRUE);
1927 if (!lcop)
1928 lcop = cx->blk_oldcop;
e9e9e546 1929 mPUSHu(CopLINE(lcop));
ce0b554b 1930 if (!has_arg)
a0d0e21e 1931 RETURN;
7766f137
GS
1932 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1933 /* So is ccstack[dbcxix]. */
a5f47741 1934 if (CvHASGV(dbcx->blk_sub.cv)) {
ecf05a58 1935 PUSHs(cv_name(dbcx->blk_sub.cv, 0, 0));
bf38a478 1936 PUSHs(boolSV(CxHASARGS(cx)));
07b8c804
RGS
1937 }
1938 else {
84bafc02 1939 PUSHs(newSVpvs_flags("(unknown)", SVs_TEMP));
bf38a478 1940 PUSHs(boolSV(CxHASARGS(cx)));
07b8c804 1941 }
a0d0e21e
LW
1942 }
1943 else {
84bafc02 1944 PUSHs(newSVpvs_flags("(eval)", SVs_TEMP));
725c44f9 1945 PUSHs(&PL_sv_zero);
a0d0e21e 1946 }
1c23e2bd 1947 gimme = cx->blk_gimme;
54310121 1948 if (gimme == G_VOID)
3280af22 1949 PUSHs(&PL_sv_undef);
54310121 1950 else
98625aca 1951 PUSHs(boolSV((gimme & G_WANT) == G_ARRAY));
6b35e009 1952 if (CxTYPE(cx) == CXt_EVAL) {
811a4de9 1953 /* eval STRING */
85a64632 1954 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
78beb4ca
TC
1955 SV *cur_text = cx->blk_eval.cur_text;
1956 if (SvCUR(cur_text) >= 2) {
1957 PUSHs(newSVpvn_flags(SvPVX(cur_text), SvCUR(cur_text)-2,
1958 SvUTF8(cur_text)|SVs_TEMP));
1959 }
1960 else {
1961 /* I think this is will always be "", but be sure */
1962 PUSHs(sv_2mortal(newSVsv(cur_text)));
1963 }
1964
3280af22 1965 PUSHs(&PL_sv_no);
0f79a09d 1966 }
811a4de9 1967 /* require */
0f79a09d 1968 else if (cx->blk_eval.old_namesv) {
6e449a3a 1969 mPUSHs(newSVsv(cx->blk_eval.old_namesv));
3280af22 1970 PUSHs(&PL_sv_yes);
06a5b730 1971 }
811a4de9
GS
1972 /* eval BLOCK (try blocks have old_namesv == 0) */
1973 else {
1974 PUSHs(&PL_sv_undef);
1975 PUSHs(&PL_sv_undef);
1976 }
4633a7c4 1977 }
a682de96
GS
1978 else {
1979 PUSHs(&PL_sv_undef);
1980 PUSHs(&PL_sv_undef);
1981 }
bafb2adc 1982 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)
ed094faf 1983 && CopSTASH_eq(PL_curcop, PL_debstash))
4633a7c4 1984 {
9513529b
DM
1985 /* slot 0 of the pad contains the original @_ */
1986 AV * const ary = MUTABLE_AV(AvARRAY(MUTABLE_AV(
1987 PadlistARRAY(CvPADLIST(cx->blk_sub.cv))[
1988 cx->blk_sub.olddepth+1]))[0]);
c70927a6 1989 const SSize_t off = AvARRAY(ary) - AvALLOC(ary);
a0d0e21e 1990
e1a80902 1991 Perl_init_dbargs(aTHX);
a0d0e21e 1992
3280af22
NIS
1993 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1994 av_extend(PL_dbargs, AvFILLp(ary) + off);
f14cf363
TC
1995 if (AvFILLp(ary) + 1 + off)
1996 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
3280af22 1997 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
a0d0e21e 1998 }
6e449a3a 1999 mPUSHi(CopHINTS_get(cx->blk_oldcop));
e476b1b5
GS
2000 {
2001 SV * mask ;
72dc9ed5 2002 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
114bafba 2003
f07626ad 2004 if (old_warnings == pWARN_NONE)
e476b1b5 2005 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
f07626ad
FC
2006 else if (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0)
2007 mask = &PL_sv_undef ;
ac27b0f5 2008 else if (old_warnings == pWARN_ALL ||
75b6c4ca 2009 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
006c1a1d 2010 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
75b6c4ca 2011 }
e476b1b5 2012 else
72dc9ed5 2013 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
6e449a3a 2014 mPUSHs(mask);
e476b1b5 2015 }
b3ca2e83 2016
c28fe1ec 2017 PUSHs(cx->blk_oldcop->cop_hints_hash ?
20439bc7 2018 sv_2mortal(newRV_noinc(MUTABLE_SV(cop_hints_2hv(cx->blk_oldcop, 0))))
b3ca2e83 2019 : &PL_sv_undef);
a0d0e21e
LW
2020 RETURN;
2021}
2022
a0d0e21e
LW
2023PP(pp_reset)
2024{
39644a26 2025 dSP;
ca826051
FC
2026 const char * tmps;
2027 STRLEN len = 0;
2372d073
DM
2028 if (MAXARG < 1 || (!TOPs && !POPs)) {
2029 EXTEND(SP, 1);
ca826051 2030 tmps = NULL, len = 0;
2372d073 2031 }
ca826051
FC
2032 else
2033 tmps = SvPVx_const(POPs, len);
2034 sv_resetpvn(tmps, len, CopSTASH(PL_curcop));
3280af22 2035 PUSHs(&PL_sv_yes);
a0d0e21e
LW
2036 RETURN;
2037}
2038
dd2155a4
DM
2039/* like pp_nextstate, but used instead when the debugger is active */
2040
a0d0e21e
LW
2041PP(pp_dbstate)
2042{
533c011a 2043 PL_curcop = (COP*)PL_op;
a0d0e21e 2044 TAINT_NOT; /* Each statement is presumed innocent */
4ebe6e95 2045 PL_stack_sp = PL_stack_base + CX_CUR()->blk_oldsp;
a0d0e21e
LW
2046 FREETMPS;
2047
f410a211
NC
2048 PERL_ASYNC_CHECK();
2049
88df5f01 2050 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
a6d69523 2051 || PL_DBsingle_iv || PL_DBsignal_iv || PL_DBtrace_iv)
a0d0e21e 2052 {
39644a26 2053 dSP;
eb578fdb 2054 PERL_CONTEXT *cx;
1c23e2bd 2055 const U8 gimme = G_ARRAY;
0bd48802 2056 GV * const gv = PL_DBgv;
432d4561
JL
2057 CV * cv = NULL;
2058
2059 if (gv && isGV_with_GP(gv))
2060 cv = GvCV(gv);
a0d0e21e 2061
c2cb6f77 2062 if (!cv || (!CvROOT(cv) && !CvXSUB(cv)))
cea2e8a9 2063 DIE(aTHX_ "No DB::DB routine defined");
a0d0e21e 2064
aea4f609
DM
2065 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
2066 /* don't do recursive DB::DB call */
a0d0e21e 2067 return NORMAL;
748a9306 2068
aed2304a 2069 if (CvISXSUB(cv)) {
8ae997c5
DM
2070 ENTER;
2071 SAVEI32(PL_debug);
2072 PL_debug = 0;
2073 SAVESTACK_POS();
8a44b450 2074 SAVETMPS;
c127bd3a
SF
2075 PUSHMARK(SP);
2076 (void)(*CvXSUB(cv))(aTHX_ cv);
c127bd3a 2077 FREETMPS;
a57c6685 2078 LEAVE;
c127bd3a
SF
2079 return NORMAL;
2080 }
2081 else {
ed8ff0f3 2082 cx = cx_pushblock(CXt_SUB, gimme, SP, PL_savestack_ix);
a73d8813
DM
2083 cx_pushsub(cx, cv, PL_op->op_next, 0);
2084 /* OP_DBSTATE's op_private holds hint bits rather than
2085 * the lvalue-ish flags seen in OP_ENTERSUB. So cancel
2086 * any CxLVAL() flags that have now been mis-calculated */
2087 cx->blk_u16 = 0;
8ae997c5
DM
2088
2089 SAVEI32(PL_debug);
2090 PL_debug = 0;
2091 SAVESTACK_POS();
c127bd3a 2092 CvDEPTH(cv)++;
d2af2719 2093 if (CvDEPTH(cv) >= 2)
9d976ff5 2094 pad_push(CvPADLIST(cv), CvDEPTH(cv));
9d976ff5 2095 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), CvDEPTH(cv));
c127bd3a
SF
2096 RETURNOP(CvSTART(cv));
2097 }
a0d0e21e
LW
2098 }
2099 else
2100 return NORMAL;
2101}
2102
0663a8f8 2103
2b9a6457
VP
2104PP(pp_enter)
2105{
1c23e2bd 2106 U8 gimme = GIMME_V;
2b9a6457 2107
d4ce7588
DM
2108 (void)cx_pushblock(CXt_BLOCK, gimme, PL_stack_sp, PL_savestack_ix);
2109 return NORMAL;
2b9a6457
VP
2110}
2111
d4ce7588 2112
2b9a6457
VP
2113PP(pp_leave)
2114{
eb578fdb 2115 PERL_CONTEXT *cx;
f5ddd604 2116 SV **oldsp;
1c23e2bd 2117 U8 gimme;
2b9a6457 2118
4ebe6e95 2119 cx = CX_CUR();
61d3b95a 2120 assert(CxTYPE(cx) == CXt_BLOCK);
4df352a8
DM
2121
2122 if (PL_op->op_flags & OPf_SPECIAL)
c349b9a0
DM
2123 /* fake block should preserve $1 et al; e.g. /(...)/ while ...; */
2124 cx->blk_oldpm = PL_curpm;
4df352a8 2125
f5ddd604 2126 oldsp = PL_stack_base + cx->blk_oldsp;
61d3b95a 2127 gimme = cx->blk_gimme;
2b9a6457 2128
0663a8f8 2129 if (gimme == G_VOID)
f5ddd604 2130 PL_stack_sp = oldsp;
0663a8f8 2131 else
f5ddd604 2132 leave_adjust_stacks(oldsp, oldsp, gimme,
75bc488d 2133 PL_op->op_private & OPpLVALUE ? 3 : 1);
67f63db7 2134
2f450c1b 2135 CX_LEAVE_SCOPE(cx);
ed8ff0f3 2136 cx_popblock(cx);
5da525e9 2137 CX_POP(cx);
2b9a6457 2138
0663a8f8 2139 return NORMAL;
2b9a6457
VP
2140}
2141
eaa9f768
JH
2142static bool
2143S_outside_integer(pTHX_ SV *sv)
2144{
2145 if (SvOK(sv)) {
2146 const NV nv = SvNV_nomg(sv);
415b66b2
JH
2147 if (Perl_isinfnan(nv))
2148 return TRUE;
eaa9f768
JH
2149#ifdef NV_PRESERVES_UV
2150 if (nv < (NV)IV_MIN || nv > (NV)IV_MAX)
2151 return TRUE;
2152#else
2153 if (nv <= (NV)IV_MIN)
2154 return TRUE;
2155 if ((nv > 0) &&
2156 ((nv > (NV)UV_MAX ||
2157 SvUV_nomg(sv) > (UV)IV_MAX)))
2158 return TRUE;
2159#endif
2160 }
2161 return FALSE;
2162}
2163
a0d0e21e
LW
2164PP(pp_enteriter)
2165{
20b7effb 2166 dSP; dMARK;
eb578fdb 2167 PERL_CONTEXT *cx;
1c23e2bd 2168 const U8 gimme = GIMME_V;
4ad63d70 2169 void *itervarp; /* GV or pad slot of the iteration variable */
f0bb9bf7 2170 SV *itersave; /* the old var in the iterator var slot */
93661e56 2171 U8 cxflags = 0;
a0d0e21e 2172
aafca525 2173 if (PL_op->op_targ) { /* "my" variable */
4ad63d70
DM
2174 itervarp = &PAD_SVl(PL_op->op_targ);
2175 itersave = *(SV**)itervarp;
2176 assert(itersave);
aafca525 2177 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
fdb8b82b
DM
2178 /* the SV currently in the pad slot is never live during
2179 * iteration (the slot is always aliased to one of the items)
2180 * so it's always stale */
4ad63d70 2181 SvPADSTALE_on(itersave);
14f338dc 2182 }
4ad63d70 2183 SvREFCNT_inc_simple_void_NN(itersave);
93661e56 2184 cxflags = CXp_FOR_PAD;
54b9620d 2185 }
d39c26a6
FC
2186 else {
2187 SV * const sv = POPs;
4ad63d70 2188 itervarp = (void *)sv;
d4e2b4d6 2189 if (LIKELY(isGV(sv))) { /* symbol table variable */
6d3ca00e
DM
2190 itersave = GvSV(sv);
2191 SvREFCNT_inc_simple_void(itersave);
93661e56 2192 cxflags = CXp_FOR_GV;
28e0cf42
DM
2193 if (PL_op->op_private & OPpITER_DEF)
2194 cxflags |= CXp_FOR_DEF;
d4e2b4d6
DM
2195 }
2196 else { /* LV ref: for \$foo (...) */
2197 assert(SvTYPE(sv) == SVt_PVMG);
2198 assert(SvMAGIC(sv));
2199 assert(SvMAGIC(sv)->mg_type == PERL_MAGIC_lvref);
2200 itersave = NULL;
93661e56 2201 cxflags = CXp_FOR_LVREF;
d4e2b4d6 2202 }
d39c26a6 2203 }
28e0cf42
DM
2204 /* OPpITER_DEF (implicit $_) should only occur with a GV iter var */
2205 assert((cxflags & CXp_FOR_GV) || !(PL_op->op_private & OPpITER_DEF));
0d863452 2206
75fbe096
DM
2207 /* Note that this context is initially set as CXt_NULL. Further on
2208 * down it's changed to one of the CXt_LOOP_*. Before it's changed,
2209 * there mustn't be anything in the blk_loop substruct that requires
2210 * freeing or undoing, in case we die in the meantime. And vice-versa.
2211 */
ed8ff0f3 2212 cx = cx_pushblock(cxflags, gimme, MARK, PL_savestack_ix);
d1b6bf72 2213 cx_pushloop_for(cx, itervarp, itersave);
2c49879e 2214
533c011a 2215 if (PL_op->op_flags & OPf_STACKED) {
2c49879e
DM
2216 /* OPf_STACKED implies either a single array: for(@), with a
2217 * single AV on the stack, or a range: for (1..5), with 1 and 5 on
2218 * the stack */
d01136d6
BS
2219 SV *maybe_ary = POPs;
2220 if (SvTYPE(maybe_ary) != SVt_PVAV) {
2c49879e 2221 /* range */
89ea2908 2222 dPOPss;
d01136d6 2223 SV * const right = maybe_ary;
93661e56 2224 if (UNLIKELY(cxflags & CXp_FOR_LVREF))
d39c26a6 2225 DIE(aTHX_ "Assigned value is not a reference");
984a4bea
RD
2226 SvGETMAGIC(sv);
2227 SvGETMAGIC(right);
4fe3f0fa 2228 if (RANGE_IS_NUMERIC(sv,right)) {
c6fdafd0 2229 cx->cx_type |= CXt_LOOP_LAZYIV;
eaa9f768
JH
2230 if (S_outside_integer(aTHX_ sv) ||
2231 S_outside_integer(aTHX_ right))
076d9a11 2232 DIE(aTHX_ "Range iterator outside integer range");
f52e41ad
FC
2233 cx->blk_loop.state_u.lazyiv.cur = SvIV_nomg(sv);
2234 cx->blk_loop.state_u.lazyiv.end = SvIV_nomg(right);
89ea2908 2235 }
3f63a782 2236 else {
d01136d6 2237 cx->cx_type |= CXt_LOOP_LAZYSV;
d01136d6
BS
2238 cx->blk_loop.state_u.lazysv.cur = newSVsv(sv);
2239 cx->blk_loop.state_u.lazysv.end = right;
2c49879e 2240 SvREFCNT_inc_simple_void_NN(right);
d01136d6 2241 (void) SvPV_force_nolen(cx->blk_loop.state_u.lazysv.cur);
267cc4a8
NC
2242 /* This will do the upgrade to SVt_PV, and warn if the value
2243 is uninitialised. */
10516c54 2244 (void) SvPV_nolen_const(right);
267cc4a8
NC
2245 /* Doing this avoids a check every time in pp_iter in pp_hot.c
2246 to replace !SvOK() with a pointer to "". */
2247 if (!SvOK(right)) {
2248 SvREFCNT_dec(right);
d01136d6 2249 cx->blk_loop.state_u.lazysv.end = &PL_sv_no;
267cc4a8 2250 }
3f63a782 2251 }
89ea2908 2252 }
d01136d6 2253 else /* SvTYPE(maybe_ary) == SVt_PVAV */ {
2c49879e 2254 /* for (@array) {} */
93661e56 2255 cx->cx_type |= CXt_LOOP_ARY;
502c6561 2256 cx->blk_loop.state_u.ary.ary = MUTABLE_AV(maybe_ary);
2c49879e 2257 SvREFCNT_inc_simple_void_NN(maybe_ary);
d01136d6
BS
2258 cx->blk_loop.state_u.ary.ix =
2259 (PL_op->op_private & OPpITER_REVERSED) ?
2260 AvFILL(cx->blk_loop.state_u.ary.ary) + 1 :
2261 -1;
ef3e5ea9 2262 }
8a1f10dd 2263 /* EXTEND(SP, 1) not needed in this branch because we just did POPs */
89ea2908 2264 }
d01136d6 2265 else { /* iterating over items on the stack */
93661e56 2266 cx->cx_type |= CXt_LOOP_LIST;
1bef65a2 2267 cx->blk_oldsp = SP - PL_stack_base;
93661e56
DM
2268 cx->blk_loop.state_u.stack.basesp = MARK - PL_stack_base;
2269 cx->blk_loop.state_u.stack.ix =
2270 (PL_op->op_private & OPpITER_REVERSED)
2271 ? cx->blk_oldsp + 1
2272 : cx->blk_loop.state_u.stack.basesp;
8a1f10dd
DM
2273 /* pre-extend stack so pp_iter doesn't have to check every time
2274 * it pushes yes/no */
2275 EXTEND(SP, 1);
4633a7c4 2276 }
a0d0e21e
LW
2277
2278 RETURN;
2279}
2280
2281PP(pp_enterloop)
2282{
eb578fdb 2283 PERL_CONTEXT *cx;
1c23e2bd 2284 const U8 gimme = GIMME_V;
a0d0e21e 2285
d4ce7588 2286 cx = cx_pushblock(CXt_LOOP_PLAIN, gimme, PL_stack_sp, PL_savestack_ix);
d1b6bf72 2287 cx_pushloop_plain(cx);
d4ce7588 2288 return NORMAL;
a0d0e21e
LW
2289}
2290
d4ce7588 2291
a0d0e21e
LW
2292PP(pp_leaveloop)
2293{
eb578fdb 2294 PERL_CONTEXT *cx;
1c23e2bd 2295 U8 gimme;
032736ab 2296 SV **base;
f5ddd604 2297 SV **oldsp;
a0d0e21e 2298
4ebe6e95 2299 cx = CX_CUR();
3b719c58 2300 assert(CxTYPE_is_LOOP(cx));
032736ab
DM
2301 oldsp = PL_stack_base + cx->blk_oldsp;
2302 base = CxTYPE(cx) == CXt_LOOP_LIST
1bef65a2 2303 ? PL_stack_base + cx->blk_loop.state_u.stack.basesp
032736ab 2304 : oldsp;
61d3b95a 2305 gimme = cx->blk_gimme;
f86702cc 2306
0663a8f8 2307 if (gimme == G_VOID)
032736ab 2308 PL_stack_sp = base;
0663a8f8 2309 else
032736ab 2310 leave_adjust_stacks(oldsp, base, gimme,
75bc488d 2311 PL_op->op_private & OPpLVALUE ? 3 : 1);
f86702cc 2312
2f450c1b 2313 CX_LEAVE_SCOPE(cx);
d1b6bf72 2314 cx_poploop(cx); /* Stack values are safe: release loop vars ... */
ed8ff0f3 2315 cx_popblock(cx);
5da525e9 2316 CX_POP(cx);
f86702cc 2317
f86702cc 2318 return NORMAL;
a0d0e21e
LW
2319}
2320
31ccb4f5
DM
2321
2322/* This duplicates most of pp_leavesub, but with additional code to handle
2323 * return args in lvalue context. It was forked from pp_leavesub to
2324 * avoid slowing down that function any further.
2325 *
2326 * Any changes made to this function may need to be copied to pp_leavesub
2327 * and vice-versa.
c349b9a0
DM
2328 *
2329 * also tail-called by pp_return
57486a97
DM
2330 */
2331
31ccb4f5 2332PP(pp_leavesublv)
3bdf583b 2333{
1c23e2bd 2334 U8 gimme;
57486a97 2335 PERL_CONTEXT *cx;
799da9d7 2336 SV **oldsp;
5da525e9 2337 OP *retop;
57486a97 2338
4ebe6e95 2339 cx = CX_CUR();
61d3b95a
DM
2340 assert(CxTYPE(cx) == CXt_SUB);
2341
2342 if (CxMULTICALL(cx)) {
1f0ba93b
DM
2343 /* entry zero of a stack is always PL_sv_undef, which
2344 * simplifies converting a '()' return into undef in scalar context */
2345 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef);
85ecf147 2346 return 0;
1f0ba93b 2347 }
85ecf147 2348
61d3b95a 2349 gimme = cx->blk_gimme;
799da9d7 2350 oldsp = PL_stack_base + cx->blk_oldsp; /* last arg of previous frame */
57486a97 2351
799da9d7
DM
2352 if (gimme == G_VOID)
2353 PL_stack_sp = oldsp;
2354 else {
2355 U8 lval = CxLVAL(cx);
2356 bool is_lval = (lval && !(lval & OPpENTERSUB_INARGS));
2357 const char *what = NULL;
2358
2359 if (gimme == G_SCALAR) {
2360 if (is_lval) {
2361 /* check for bad return arg */
2362 if (oldsp < PL_stack_sp) {
2363 SV *sv = *PL_stack_sp;
2364 if ((SvPADTMP(sv) || SvREADONLY(sv))) {
2365 what =
2366 SvREADONLY(sv) ? (sv == &PL_sv_undef) ? "undef"
2367 : "a readonly value" : "a temporary";
2368 }
2369 else goto ok;
2370 }
2371 else {
2372 /* sub:lvalue{} will take us here. */
2373 what = "undef";
2374 }
2375 croak:
2376 Perl_croak(aTHX_
2377 "Can't return %s from lvalue subroutine", what);
2378 }
57486a97 2379
799da9d7 2380 ok:
e02ce34b 2381 leave_adjust_stacks(oldsp, oldsp, gimme, is_lval ? 3 : 2);
e80c4acf 2382
799da9d7
DM
2383 if (lval & OPpDEREF) {
2384 /* lval_sub()->{...} and similar */
2385 dSP;
2386 SvGETMAGIC(TOPs);
2387 if (!SvOK(TOPs)) {
2388 TOPs = vivify_ref(TOPs, CxLVAL(cx) & OPpDEREF);
2389 }
2390 PUTBACK;
2391 }
2392 }
2393 else {
2394 assert(gimme == G_ARRAY);
2395 assert (!(lval & OPpDEREF));
2396
2397 if (is_lval) {
2398 /* scan for bad return args */
2399 SV **p;
2400 for (p = PL_stack_sp; p > oldsp; p--) {
2401 SV *sv = *p;
2402 /* the PL_sv_undef exception is to allow things like
2403 * this to work, where PL_sv_undef acts as 'skip'
2404 * placeholder on the LHS of list assigns:
2405 * sub foo :lvalue { undef }
2406 * ($a, undef, foo(), $b) = 1..4;
2407 */
2408 if (sv != &PL_sv_undef && (SvPADTMP(sv) || SvREADONLY(sv)))
2409 {
2410 /* Might be flattened array after $#array = */
2411 what = SvREADONLY(sv)
2412 ? "a readonly value" : "a temporary";
2413 goto croak;
2414 }
2415 }
2416 }
2417
e02ce34b 2418 leave_adjust_stacks(oldsp, oldsp, gimme, is_lval ? 3 : 2);
799da9d7 2419 }
3bdf583b 2420 }
57486a97 2421
2f450c1b 2422 CX_LEAVE_SCOPE(cx);
a73d8813 2423 cx_popsub(cx); /* Stack values are safe: release CV and @_ ... */
ed8ff0f3 2424 cx_popblock(cx);
5da525e9
DM
2425 retop = cx->blk_sub.retop;
2426 CX_POP(cx);
57486a97 2427
5da525e9 2428 return retop;
3bdf583b
FC
2429}
2430
57486a97 2431
a0d0e21e
LW
2432PP(pp_return)
2433{
20b7effb 2434 dSP; dMARK;
eb578fdb 2435 PERL_CONTEXT *cx;
0bd48802
AL
2436 const I32 cxix = dopoptosub(cxstack_ix);
2437
d40dc6b1
DM
2438 assert(cxstack_ix >= 0);
2439 if (cxix < cxstack_ix) {
2440 if (cxix < 0) {
79646418
DM
2441 if (!( PL_curstackinfo->si_type == PERLSI_SORT
2442 || ( PL_curstackinfo->si_type == PERLSI_MULTICALL
2443 && (cxstack[0].cx_type & CXp_SUB_RE_FAKE))
2444 )
2445 )
3089a108 2446 DIE(aTHX_ "Can't return outside a subroutine");
79646418
DM
2447 /* We must be in:
2448 * a sort block, which is a CXt_NULL not a CXt_SUB;
2449 * or a /(?{...})/ block.
2450 * Handle specially. */
2451 assert(CxTYPE(&cxstack[0]) == CXt_NULL
2452 || ( CxTYPE(&cxstack[0]) == CXt_SUB
2453 && (cxstack[0].cx_type & CXp_SUB_RE_FAKE)));
3089a108
DM
2454 if (cxstack_ix > 0) {
2455 /* See comment below about context popping. Since we know
2456 * we're scalar and not lvalue, we can preserve the return
2457 * value in a simpler fashion than there. */
2458 SV *sv = *SP;
d40dc6b1 2459 assert(cxstack[0].blk_gimme == G_SCALAR);
3089a108
DM
2460 if ( (sp != PL_stack_base)
2461 && !(SvFLAGS(sv) & (SVs_TEMP|SVs_PADTMP))
2462 )
2463 *SP = sv_mortalcopy(sv);
2464 dounwind(0);
d40dc6b1 2465 }
3089a108
DM
2466 /* caller responsible for popping cxstack[0] */
2467 return 0;
d40dc6b1 2468 }
3089a108
DM
2469
2470 /* There are contexts that need popping. Doing this may free the
c349b9a0 2471 * return value(s), so preserve them first: e.g. popping the plain
3089a108
DM
2472 * loop here would free $x:
2473 * sub f { { my $x = 1; return $x } }
2474 * We may also need to shift the args down; for example,
2475 * for (1,2) { return 3,4 }
c349b9a0
DM
2476 * leaves 1,2,3,4 on the stack. Both these actions will be done by
2477 * leave_adjust_stacks(), along with freeing any temps. Note that
2478 * whoever we tail-call (e.g. pp_leaveeval) will also call
2479 * leave_adjust_stacks(); however, the second call is likely to
2480 * just see a bunch of SvTEMPs with a ref count of 1, and so just
2481 * pass them through, rather than copying them again. So this
2482 * isn't as inefficient as it sounds.
3089a108
DM
2483 */
2484 cx = &cxstack[cxix];
3089a108 2485 PUTBACK;
e02ce34b
DM
2486 if (cx->blk_gimme != G_VOID)
2487 leave_adjust_stacks(MARK, PL_stack_base + cx->blk_oldsp,
fc6e609e
DM
2488 cx->blk_gimme,
2489 CxTYPE(cx) == CXt_SUB && CvLVALUE(cx->blk_sub.cv)
2490 ? 3 : 0);
0663a8f8 2491 SPAGAIN;
a0d0e21e 2492 dounwind(cxix);
42831ce4 2493 cx = &cxstack[cxix]; /* CX stack may have been realloced */
d40dc6b1 2494 }
3089a108
DM
2495 else {
2496 /* Like in the branch above, we need to handle any extra junk on
2497 * the stack. But because we're not also popping extra contexts, we
2498 * don't have to worry about prematurely freeing args. So we just
2499 * need to do the bare minimum to handle junk, and leave the main
2500 * arg processing in the function we tail call, e.g. pp_leavesub.
2501 * In list context we have to splice out the junk; in scalar
2502 * context we can leave as-is (pp_leavesub will later return the
2503 * top stack element). But for an empty arg list, e.g.
2504 * for (1,2) { return }
2505 * we need to set sp = oldsp so that pp_leavesub knows to push
2506 * &PL_sv_undef onto the stack.
2507 */
3ebe7c5a
DM
2508 SV **oldsp;
2509 cx = &cxstack[cxix];
2510 oldsp = PL_stack_base + cx->blk_oldsp;
2511 if (oldsp != MARK) {
2512 SSize_t nargs = SP - MARK;
2513 if (nargs) {
2514 if (cx->blk_gimme == G_ARRAY) {
2515 /* shift return args to base of call stack frame */
2516 Move(MARK + 1, oldsp + 1, nargs, SV*);
2517 PL_stack_sp = oldsp + nargs;
2518 }
6228a1e1 2519 }
3ebe7c5a
DM
2520 else
2521 PL_stack_sp = oldsp;
13929c4c 2522 }
3089a108 2523 }
617a4f41
DM
2524
2525 /* fall through to a normal exit */
2526 switch (CxTYPE(cx)) {
2527 case CXt_EVAL:
2528 return CxTRYBLOCK(cx)
2529 ? Perl_pp_leavetry(aTHX)
2530 : Perl_pp_leaveeval(aTHX);
2531 case CXt_SUB:
13929c4c 2532 return CvLVALUE(cx->blk_sub.cv)
31ccb4f5 2533 ? Perl_pp_leavesublv(aTHX)
13929c4c 2534 : Perl_pp_leavesub(aTHX);
7766f137 2535 case CXt_FORMAT:
617a4f41 2536 return Perl_pp_leavewrite(aTHX);
a0d0e21e 2537 default:
5637ef5b 2538 DIE(aTHX_ "panic: return, type=%u", (unsigned) CxTYPE(cx));
a0d0e21e 2539 }
a0d0e21e
LW
2540}
2541
42b5eca0 2542/* find the enclosing loop or labelled loop and dounwind() back to it. */
4f443c3d 2543
31705cda 2544static PERL_CONTEXT *
42b5eca0 2545S_unwind_loop(pTHX)
a0d0e21e 2546{
a0d0e21e 2547 I32 cxix;
1f039d60
FC
2548 if (PL_op->op_flags & OPf_SPECIAL) {
2549 cxix = dopoptoloop(cxstack_ix);
2550 if (cxix < 0)
2551 /* diag_listed_as: Can't "last" outside a loop block */
42b5eca0
DM
2552 Perl_croak(aTHX_ "Can't \"%s\" outside a loop block",
2553 OP_NAME(PL_op));
1f039d60
FC
2554 }
2555 else {
2556 dSP;
2557 STRLEN label_len;
2558 const char * const label =
2559 PL_op->op_flags & OPf_STACKED
2560 ? SvPV(TOPs,label_len)
2561 : (label_len = strlen(cPVOP->op_pv), cPVOP->op_pv);
2562 const U32 label_flags =
2563 PL_op->op_flags & OPf_STACKED
2564 ? SvUTF8(POPs)
2565 : (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0;
2566 PUTBACK;
2567 cxix = dopoptolabel(label, label_len, label_flags);
2568 if (cxix < 0)
2569 /* diag_listed_as: Label not found for "last %s" */
147e3846 2570 Perl_croak(aTHX_ "Label not found for \"%s %" SVf "\"",
42b5eca0 2571 OP_NAME(PL_op),
1f039d60
FC
2572 SVfARG(PL_op->op_flags & OPf_STACKED
2573 && !SvGMAGICAL(TOPp1s)
2574 ? TOPp1s
2575 : newSVpvn_flags(label,
2576 label_len,
2577 label_flags | SVs_TEMP)));
2578 }
2579 if (cxix < cxstack_ix)
2580 dounwind(cxix);
dc7f00ca 2581 return &cxstack[cxix];
1f039d60
FC
2582}
2583
dc7f00ca 2584
1f039d60
FC
2585PP(pp_last)
2586{
eb578fdb 2587 PERL_CONTEXT *cx;
5da525e9 2588 OP* nextop;
9d4ba2ae 2589
42b5eca0 2590 cx = S_unwind_loop(aTHX);
4df352a8 2591
93661e56 2592 assert(CxTYPE_is_LOOP(cx));
1bef65a2
DM
2593 PL_stack_sp = PL_stack_base
2594 + (CxTYPE(cx) == CXt_LOOP_LIST
2595 ? cx->blk_loop.state_u.stack.basesp
2596 : cx->blk_oldsp
2597 );
a0d0e21e 2598
a1f49e72 2599 TAINT_NOT;
f86702cc
PP
2600
2601 /* Stack values are safe: */
2f450c1b 2602 CX_LEAVE_SCOPE(cx);
d1b6bf72 2603 cx_poploop(cx); /* release loop vars ... */
ed8ff0f3 2604 cx_popblock(cx);
5da525e9
DM
2605 nextop = cx->blk_loop.my_op->op_lastop->op_next;
2606 CX_POP(cx);
a0d0e21e 2607
5da525e9 2608 return nextop;
a0d0e21e
LW
2609}
2610
2611PP(pp_next)
2612{
eb578fdb 2613 PERL_CONTEXT *cx;
a0d0e21e 2614
cd97dc8d
DM
2615 /* if not a bare 'next' in the main scope, search for it */
2616 cx = CX_CUR();
2617 if (!((PL_op->op_flags & OPf_SPECIAL) && CxTYPE_is_LOOP(cx)))
2618 cx = S_unwind_loop(aTHX);
a0d0e21e 2619
ed8ff0f3 2620 cx_topblock(cx);
3a1b2b9e 2621 PL_curcop = cx->blk_oldcop;
47c9d59f 2622 PERL_ASYNC_CHECK();
d57ce4df 2623 return (cx)->blk_loop.my_op->op_nextop;
a0d0e21e
LW
2624}
2625
2626PP(pp_redo)
2627{
42b5eca0 2628 PERL_CONTEXT *cx = S_unwind_loop(aTHX);
dc7f00ca 2629 OP* redo_op = cx->blk_loop.my_op->op_redoop;
a0d0e21e 2630
a034e688
DM
2631 if (redo_op->op_type == OP_ENTER) {
2632 /* pop one less context to avoid $x being freed in while (my $x..) */
2633 cxstack_ix++;
dc7f00ca
DM
2634 cx = CX_CUR();
2635 assert(CxTYPE(cx) == CXt_BLOCK);
a034e688
DM
2636 redo_op = redo_op->op_next;
2637 }
2638
936c78b5 2639 FREETMPS;
ef588991 2640 CX_LEAVE_SCOPE(cx);
ed8ff0f3 2641 cx_topblock(cx);
3a1b2b9e 2642 PL_curcop = cx->blk_oldcop;
47c9d59f 2643 PERL_ASYNC_CHECK();
a034e688 2644 return redo_op;
a0d0e21e
LW
2645}
2646
0824fdcb 2647STATIC OP *
5db1eb8d 2648S_dofindlabel(pTHX_ OP *o, const char *label, STRLEN len, U32 flags, OP **opstack, OP **oplimit)
a0d0e21e 2649{
a0d0e21e 2650 OP **ops = opstack;
a1894d81 2651 static const char* const too_deep = "Target of goto is too deeply nested";
a0d0e21e 2652
7918f24d
NC
2653 PERL_ARGS_ASSERT_DOFINDLABEL;
2654
fc36a67e 2655 if (ops >= oplimit)
0157ef98 2656 Perl_croak(aTHX_ "%s", too_deep);
11343788
MB
2657 if (o->op_type == OP_LEAVE ||
2658 o->op_type == OP_SCOPE ||
2659 o->op_type == OP_LEAVELOOP ||
33d34e4c 2660 o->op_type == OP_LEAVESUB ||
11343788 2661 o->op_type == OP_LEAVETRY)
fc36a67e 2662 {
5dc0d613 2663 *ops++ = cUNOPo->op_first;
fc36a67e 2664 if (ops >= oplimit)
0157ef98 2665 Perl_croak(aTHX_ "%s", too_deep);
fc36a67e 2666 }
c4aa4e48 2667 *ops = 0;
11343788 2668 if (o->op_flags & OPf_KIDS) {
aec46f14 2669 OP *kid;
a0d0e21e 2670 /* First try all the kids at this level, since that's likeliest. */
e6dae479 2671 for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) {
7e8f1eac 2672 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
5db1eb8d
BF
2673 STRLEN kid_label_len;
2674 U32 kid_label_flags;
2675 const char *kid_label = CopLABEL_len_flags(kCOP,
2676 &kid_label_len, &kid_label_flags);
2677 if (kid_label && (
2678 ( (kid_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ?
2679 (flags & SVf_UTF8)
2680 ? (bytes_cmp_utf8(
2681 (const U8*)kid_label, kid_label_len,
2682 (const U8*)label, len) == 0)
2683 : (bytes_cmp_utf8(
2684 (const U8*)label, len,
2685 (const U8*)kid_label, kid_label_len) == 0)
eade7155
BF
2686 : ( len == kid_label_len && ((kid_label == label)
2687 || memEQ(kid_label, label, len)))))
7e8f1eac
AD
2688 return kid;
2689 }
a0d0e21e 2690 }
e6dae479 2691 for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) {
3280af22 2692 if (kid == PL_lastgotoprobe)
a0d0e21e 2693 continue;
ed8d0fe2
SM
2694 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2695 if (ops == opstack)
2696 *ops++ = kid;
2697 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2698 ops[-1]->op_type == OP_DBSTATE)
2699 ops[-1] = kid;
2700 else
2701 *ops++ = kid;
2702 }
5db1eb8d 2703 if ((o = dofindlabel(kid, label, len, flags, ops, oplimit)))
11343788 2704 return o;
a0d0e21e
LW
2705 }
2706 }
c4aa4e48 2707 *ops = 0;
a0d0e21e
LW
2708 return 0;
2709}
2710
b1c05ba5
DM
2711
2712/* also used for: pp_dump() */
2713
2714PP(pp_goto)
a0d0e21e 2715{
27da23d5 2716 dVAR; dSP;
cbbf8932 2717 OP *retop = NULL;
a0d0e21e 2718 I32 ix;
eb578fdb 2719 PERL_CONTEXT *cx;
fc36a67e
PP
2720#define GOTO_DEPTH 64
2721 OP *enterops[GOTO_DEPTH];
cbbf8932 2722 const char *label = NULL;
5db1eb8d
BF
2723 STRLEN label_len = 0;
2724 U32 label_flags = 0;
bfed75c6 2725 const bool do_dump = (PL_op->op_type == OP_DUMP);
a1894d81 2726 static const char* const must_have_label = "goto must have label";
a0d0e21e 2727
533c011a 2728 if (PL_op->op_flags & OPf_STACKED) {
7d1d69cb
DM
2729 /* goto EXPR or goto &foo */
2730
9d4ba2ae 2731 SV * const sv = POPs;
55b37f1c 2732 SvGETMAGIC(sv);
a0d0e21e 2733
a0d0e21e 2734 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
0fa3d31d 2735 /* This egregious kludge implements goto &subroutine */
a0d0e21e 2736 I32 cxix;
eb578fdb 2737 PERL_CONTEXT *cx;
ea726b52 2738 CV *cv = MUTABLE_CV(SvRV(sv));
049bd5ff 2739 AV *arg = GvAV(PL_defgv);
a0d0e21e 2740
5d52e310 2741 while (!CvROOT(cv) && !CvXSUB(cv)) {
7fc63493 2742 const GV * const gv = CvGV(cv);
e8f7dd13 2743 if (gv) {
7fc63493 2744 GV *autogv;
e8f7dd13
GS
2745 SV *tmpstr;
2746 /* autoloaded stub? */
2747 if (cv != GvCV(gv) && (cv = GvCV(gv)))
5d52e310 2748 continue;
c271df94
BF
2749 autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv),
2750 GvNAMELEN(gv),
2751 GvNAMEUTF8(gv) ? SVf_UTF8 : 0);
e8f7dd13 2752 if (autogv && (cv = GvCV(autogv)))
5d52e310 2753 continue;
e8f7dd13 2754 tmpstr = sv_newmortal();
c445ea15 2755 gv_efullname3(tmpstr, gv, NULL);
147e3846 2756 DIE(aTHX_ "Goto undefined subroutine &%" SVf, SVfARG(tmpstr));
4aa0a1f7 2757 }
cea2e8a9 2758 DIE(aTHX_ "Goto undefined subroutine");
4aa0a1f7
AD
2759 }
2760
a0d0e21e 2761 cxix = dopoptosub(cxstack_ix);
d338c0c2
DM
2762 if (cxix < 0) {
2763 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
8da3792e 2764 }
d338c0c2 2765 cx = &cxstack[cxix];
564abe23 2766 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2d43a17f 2767 if (CxTYPE(cx) == CXt_EVAL) {
c74ace89 2768 if (CxREALEVAL(cx))
00455a92 2769 /* diag_listed_as: Can't goto subroutine from an eval-%s */
c74ace89
DM
2770 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2771 else
00455a92 2772 /* diag_listed_as: Can't goto subroutine from an eval-%s */
c74ace89 2773 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2d43a17f 2774 }
9850bf21
RH
2775 else if (CxMULTICALL(cx))
2776 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
d338c0c2
DM
2777
2778 /* First do some returnish stuff. */
2779
2780 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
2781 FREETMPS;
2782 if (cxix < cxstack_ix) {
2783 dounwind(cxix);
2784 }
7e637ba4 2785 cx = CX_CUR();
ed8ff0f3 2786 cx_topblock(cx);
d338c0c2 2787 SPAGAIN;
39de75fd 2788
8ae997c5
DM
2789 /* protect @_ during save stack unwind. */
2790 if (arg)
2791 SvREFCNT_inc_NN(sv_2mortal(MUTABLE_SV(arg)));
2792
2793 assert(PL_scopestack_ix == cx->blk_oldscopesp);
dfe0f39b 2794 CX_LEAVE_SCOPE(cx);
8ae997c5 2795
bafb2adc 2796 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
a73d8813 2797 /* this is part of cx_popsub_args() */
9513529b 2798 AV* av = MUTABLE_AV(PAD_SVl(0));
e2657e18
DM
2799 assert(AvARRAY(MUTABLE_AV(
2800 PadlistARRAY(CvPADLIST(cx->blk_sub.cv))[
2801 CvDEPTH(cx->blk_sub.cv)])) == PL_curpad);
2802
f72bdec3
DM
2803 /* we are going to donate the current @_ from the old sub
2804 * to the new sub. This first part of the donation puts a
2805 * new empty AV in the pad[0] slot of the old sub,
2806 * unless pad[0] and @_ differ (e.g. if the old sub did
2807 * local *_ = []); in which case clear the old pad[0]
2808 * array in the usual way */
95b2f486
DM
2809 if (av == arg || AvREAL(av))
2810 clear_defarray(av, av == arg);
049bd5ff 2811 else CLEAR_ARGARRAY(av);
a0d0e21e 2812 }
88c11d84 2813
b1e25d05
DM
2814 /* don't restore PL_comppad here. It won't be needed if the
2815 * sub we're going to is non-XS, but restoring it early then
2816 * croaking (e.g. the "Goto undefined subroutine" below)
2817 * means the CX block gets processed again in dounwind,
2818 * but this time with the wrong PL_comppad */
88c11d84 2819
1d59c038
FC
2820 /* A destructor called during LEAVE_SCOPE could have undefined
2821 * our precious cv. See bug #99850. */
2822 if (!CvROOT(cv) && !CvXSUB(cv)) {
2823 const GV * const gv = CvGV(cv);
2824 if (gv) {
2825 SV * const tmpstr = sv_newmortal();
2826 gv_efullname3(tmpstr, gv, NULL);
147e3846 2827 DIE(aTHX_ "Goto undefined subroutine &%" SVf,
1d59c038
FC
2828 SVfARG(tmpstr));
2829 }
2830 DIE(aTHX_ "Goto undefined subroutine");
2831 }
2832
cd17cc2e
DM
2833 if (CxTYPE(cx) == CXt_SUB) {
2834 CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth;
2835 SvREFCNT_dec_NN(cx->blk_sub.cv);
2836 }
2837
a0d0e21e 2838 /* Now do some callish stuff. */
aed2304a 2839 if (CvISXSUB(cv)) {
ad39f3a2 2840 const SSize_t items = arg ? AvFILL(arg) + 1 : 0;
cd313eb4 2841 const bool m = arg ? cBOOL(SvRMAGICAL(arg)) : 0;
049bd5ff
FC
2842 SV** mark;
2843
8ae997c5 2844 ENTER;
80774f05
DM
2845 SAVETMPS;
2846 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2847
049bd5ff 2848 /* put GvAV(defgv) back onto stack */
8c9d3376
FC
2849 if (items) {
2850 EXTEND(SP, items+1); /* @_ could have been extended. */
8c9d3376 2851 }
049bd5ff 2852 mark = SP;
ad39f3a2 2853 if (items) {
de935cc9 2854 SSize_t index;
ad39f3a2 2855 bool r = cBOOL(AvREAL(arg));
b1464ded 2856 for (index=0; index<items; index++)
ad39f3a2
FC
2857 {
2858 SV *sv;
2859 if (m) {
2860 SV ** const svp = av_fetch(arg, index, 0);
2861 sv = svp ? *svp : NULL;
dd2a7f90 2862 }
ad39f3a2
FC
2863 else sv = AvARRAY(arg)[index];
2864 SP[index+1] = sv
2865 ? r ? SvREFCNT_inc_NN(sv_2mortal(sv)) : sv
2866 : sv_2mortal(newSVavdefelem(arg, index, 1));
2867 }
049bd5ff 2868 }
ad39f3a2 2869 SP += items;
049bd5ff
FC
2870 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
2871 /* Restore old @_ */
b405d38b 2872 CX_POP_SAVEARRAY(cx);
b1464ded 2873 }
1fa4e549 2874
51eb35b5 2875 retop = cx->blk_sub.retop;
b1e25d05
DM
2876 PL_comppad = cx->blk_sub.prevcomppad;
2877 PL_curpad = LIKELY(PL_comppad) ? AvARRAY(PL_comppad) : NULL;
8ae997c5
DM
2878
2879 /* XS subs don't have a CXt_SUB, so pop it;
ed8ff0f3
DM
2880 * this is a cx_popblock(), less all the stuff we already did
2881 * for cx_topblock() earlier */
8ae997c5 2882 PL_curcop = cx->blk_oldcop;
5da525e9 2883 CX_POP(cx);
8ae997c5 2884
b37c2d43
AL
2885 /* Push a mark for the start of arglist */
2886 PUSHMARK(mark);
2887 PUTBACK;
2888 (void)(*CvXSUB(cv))(aTHX_ cv);
a57c6685 2889 LEAVE;
51eb35b5 2890 goto _return;
a0d0e21e
LW
2891 }
2892 else {
b70d5558 2893 PADLIST * const padlist = CvPADLIST(cv);
39de75fd 2894
80774f05
DM
2895 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2896
a73d8813 2897 /* partial unrolled cx_pushsub(): */
39de75fd 2898
a0d0e21e 2899 cx->blk_sub.cv = cv;
1a5b3db4 2900 cx->blk_sub.olddepth = CvDEPTH(cv);
dd2155a4 2901
a0d0e21e 2902 CvDEPTH(cv)++;
2c50b7ed
DM
2903 SvREFCNT_inc_simple_void_NN(cv);
2904 if (CvDEPTH(cv) > 1) {
2b9dff67 2905 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION))
44a8e56a 2906 sub_crush_depth(cv);
26019298 2907 pad_push(padlist, CvDEPTH(cv));
a0d0e21e 2908 }
426a09cd 2909 PL_curcop = cx->blk_oldcop;
fd617465 2910 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
bafb2adc 2911 if (CxHASARGS(cx))
6d4ff0d2 2912 {
f72bdec3
DM
2913 /* second half of donating @_ from the old sub to the
2914 * new sub: abandon the original pad[0] AV in the
2915 * new sub, and replace it with the donated @_.
2916 * pad[0] takes ownership of the extra refcount
2917 * we gave arg earlier */
bfa371b6
FC
2918 if (arg) {
2919 SvREFCNT_dec(PAD_SVl(0));
fed4514a 2920 PAD_SVl(0) = (SV *)arg;
13122036 2921 SvREFCNT_inc_simple_void_NN(arg);
bfa371b6 2922 }
049bd5ff
FC
2923
2924 /* GvAV(PL_defgv) might have been modified on scope
f72bdec3 2925 exit, so point it at arg again. */
049bd5ff
FC
2926 if (arg != GvAV(PL_defgv)) {
2927 AV * const av = GvAV(PL_defgv);
2928 GvAV(PL_defgv) = (AV *)SvREFCNT_inc_simple(arg);
2929 SvREFCNT_dec(av);
a0d0e21e
LW
2930 }
2931 }
13122036 2932
491527d0 2933 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
005a8a35 2934 Perl_get_db_sub(aTHX_ NULL, cv);
b37c2d43 2935 if (PERLDB_GOTO) {
b96d8cd9 2936 CV * const gotocv = get_cvs("DB::goto", 0);
b37c2d43
AL
2937 if (gotocv) {
2938 PUSHMARK( PL_stack_sp );
ad64d0ec 2939 call_sv(MUTABLE_SV(gotocv), G_SCALAR | G_NODEBUG);
b37c2d43
AL
2940 PL_stack_sp--;
2941 }
491527d0 2942 }
1ce6579f 2943 }
51eb35b5
DD
2944 retop = CvSTART(cv);
2945 goto putback_return;
a0d0e21e
LW
2946 }
2947 }
1614b0e3 2948 else {
7d1d69cb 2949 /* goto EXPR */
55b37f1c 2950 label = SvPV_nomg_const(sv, label_len);
5db1eb8d 2951 label_flags = SvUTF8(sv);
1614b0e3 2952 }
a0d0e21e 2953 }
2fc690dc 2954 else if (!(PL_op->op_flags & OPf_SPECIAL)) {
7d1d69cb 2955 /* goto LABEL or dump LABEL */
5db1eb8d
BF
2956 label = cPVOP->op_pv;
2957 label_flags = (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0;
2958 label_len = strlen(label);
2959 }
0157ef98 2960 if (!(do_dump || label_len)) DIE(aTHX_ "%s", must_have_label);
a0d0e21e 2961
f410a211
NC
2962 PERL_ASYNC_CHECK();
2963
3532f34a 2964 if (label_len) {
cbbf8932 2965 OP *gotoprobe = NULL;
3b2447bc 2966 bool leaving_eval = FALSE;
33d34e4c 2967 bool in_block = FALSE;
3c157b3c 2968 bool pseudo_block = FALSE;
cbbf8932 2969 PERL_CONTEXT *last_eval_cx = NULL;
a0d0e21e
LW
2970
2971 /* find label */
2972
d4c19fe8 2973 PL_lastgotoprobe = NULL;
a0d0e21e
LW
2974 *enterops = 0;
2975 for (ix = cxstack_ix; ix >= 0; ix--) {
2976 cx = &cxstack[ix];
6b35e009 2977 switch (CxTYPE(cx)) {
a0d0e21e 2978 case CXt_EVAL:
3b2447bc 2979 leaving_eval = TRUE;
971ecbe6 2980 if (!CxTRYBLOCK(cx)) {
a4f3a277
RH
2981 gotoprobe = (last_eval_cx ?
2982 last_eval_cx->blk_eval.old_eval_root :
2983 PL_eval_root);
2984 last_eval_cx = cx;
9c5794fe
RH
2985 break;
2986 }
2987 /* else fall through */
93661e56
DM
2988 case CXt_LOOP_PLAIN:
2989 case CXt_LOOP_LAZYIV:
2990 case CXt_LOOP_LAZYSV:
2991 case CXt_LOOP_LIST:
2992 case CXt_LOOP_ARY:
bb5aedc1
VP
2993 case CXt_GIVEN:
2994 case CXt_WHEN:
e6dae479 2995 gotoprobe = OpSIBLING(cx->blk_oldcop);
a0d0e21e
LW
2996 break;
2997 case CXt_SUBST:
2998 continue;
2999 case CXt_BLOCK:
33d34e4c 3000 if (ix) {
e6dae479 3001 gotoprobe = OpSIBLING(cx->blk_oldcop);
33d34e4c
AE
3002 in_block = TRUE;
3003 } else
3280af22 3004 gotoprobe = PL_main_root;
a0d0e21e 3005 break;
b3933176 3006 case CXt_SUB:
3c157b3c
Z
3007 gotoprobe = CvROOT(cx->blk_sub.cv);
3008 pseudo_block = cBOOL(CxMULTICALL(cx));
3009 break;
7766f137 3010 case CXt_FORMAT:
0a753a76 3011 case CXt_NULL:
a651a37d 3012 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
a0d0e21e
LW
3013 default:
3014 if (ix)
5637ef5b
NC
3015 DIE(aTHX_ "panic: goto, type=%u, ix=%ld",
3016 CxTYPE(cx), (long) ix);
3280af22 3017 gotoprobe = PL_main_root;
a0d0e21e
LW
3018 break;
3019 }
2b597662 3020 if (gotoprobe) {
29e61fd9
DM
3021 OP *sibl1, *sibl2;
3022
5db1eb8d 3023 retop = dofindlabel(gotoprobe, label, label_len, label_flags,
2b597662
GS
3024 enterops, enterops + GOTO_DEPTH);
3025 if (retop)
3026 break;
e6dae479 3027 if ( (sibl1 = OpSIBLING(gotoprobe)) &&
29e61fd9 3028 sibl1->op_type == OP_UNSTACK &&
e6dae479 3029 (sibl2 = OpSIBLING(sibl1)))
29e61fd9
DM
3030 {
3031 retop = dofindlabel(sibl2,
5db1eb8d
BF
3032 label, label_len, label_flags, enterops,
3033 enterops + GOTO_DEPTH);
eae48c89
Z
3034 if (retop)
3035 break;
3036 }
2b597662 3037 }
3c157b3c
Z
3038 if (pseudo_block)
3039 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
3280af22 3040 PL_lastgotoprobe = gotoprobe;
a0d0e21e
LW
3041 }
3042 if (!retop)
147e3846 3043 DIE(aTHX_ "Can't find label %" UTF8f,
b17a0679 3044 UTF8fARG(label_flags, label_len, label));
a0d0e21e 3045
3b2447bc
RH
3046 /* if we're leaving an eval, check before we pop any frames
3047 that we're not going to punt, otherwise the error
3048 won't be caught */
3049
3050 if (leaving_eval && *enterops && enterops[1]) {
3051 I32 i;
3052 for (i = 1; enterops[i]; i++)
3053 if (enterops[i]->op_type == OP_ENTERITER)
3054 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
3055 }
3056
b500e03b
GG
3057 if (*enterops && enterops[1]) {
3058 I32 i = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3059 if (enterops[i])
dc6e8de0 3060 deprecate("\"goto\" to jump into a construct");
b500e03b
GG
3061 }
3062
a0d0e21e
LW
3063 /* pop unwanted frames */
3064
3065 if (ix < cxstack_ix) {
a0d0e21e 3066 if (ix < 0)
5edb7975 3067 DIE(aTHX_ "panic: docatch: illegal ix=%ld", (long)ix);
a0d0e21e 3068 dounwind(ix);
7e637ba4 3069 cx = CX_CUR();
ed8ff0f3 3070 cx_topblock(cx);
a0d0e21e
LW
3071 }
3072
3073 /* push wanted frames */
3074
748a9306 3075 if (*enterops && enterops[1]) {
0bd48802 3076 OP * const oldop = PL_op;
33d34e4c
AE
3077 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3078 for (; enterops[ix]; ix++) {
533c011a 3079 PL_op = enterops[ix];
84902520
TB
3080 /* Eventually we may want to stack the needed arguments
3081 * for each op. For now, we punt on the hard ones. */
533c011a 3082 if (PL_op->op_type == OP_ENTERITER)
894356b3 3083 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
16c91539 3084 PL_op->op_ppaddr(aTHX);
a0d0e21e 3085 }
533c011a 3086 PL_op = oldop;
a0d0e21e
LW
3087 }
3088 }
3089
2631bbca 3090 if (do_dump) {
a5f75d66 3091#ifdef VMS
6b88bc9c 3092 if (!retop) retop = PL_main_start;
a5f75d66 3093#endif
3280af22
NIS
3094 PL_restartop = retop;
3095 PL_do_undump = TRUE;
a0d0e21e
LW
3096
3097 my_unexec();
3098
3280af22
NIS
3099 PL_restartop = 0; /* hmm, must be GNU unexec().. */
3100 PL_do_undump = FALSE;
a0d0e21e
LW
3101 }
3102
51eb35b5
DD
3103 putback_return:
3104 PL_stack_sp = sp;
3105 _return:
47c9d59f 3106 PERL_ASYNC_CHECK();
51eb35b5 3107 return retop;
a0d0e21e
LW
3108}
3109
3110PP(pp_exit)
3111{
39644a26 3112 dSP;
a0d0e21e
LW
3113 I32 anum;
3114
3115 if (MAXARG < 1)
3116 anum = 0;
9d3c658e
FC
3117 else if (!TOPs) {
3118 anum = 0; (void)POPs;
3119 }
ff0cee69 3120 else {
a0d0e21e 3121 anum = SvIVx(POPs);
d98f61e7 3122#ifdef VMS
5450b4d8
FC
3123 if (anum == 1
3124 && SvTRUE(cop_hints_fetch_pvs(PL_curcop, "vmsish_exit", 0)))
ff0cee69 3125 anum = 0;
97124ef6
FC
3126 VMSISH_HUSHED =
3127 VMSISH_HUSHED || (PL_curcop->op_private & OPpHUSH_VMSISH);
ff0cee69
PP
3128#endif
3129 }
cc3604b1 3130 PL_exit_flags |= PERL_EXIT_EXPECTED;
a0d0e21e 3131 my_exit(anum);
3280af22 3132 PUSHs(&PL_sv_undef);
a0d0e21e
LW
3133 RETURN;
3134}
3135
a0d0e21e
LW
3136/* Eval. */
3137
0824fdcb 3138STATIC void
cea2e8a9 3139S_save_lines(pTHX_ AV *array, SV *sv)
a0d0e21e 3140{
504618e9 3141 const char *s = SvPVX_const(sv);
890ce7af 3142 const char * const send = SvPVX_const(sv) + SvCUR(sv);
504618e9 3143 I32 line = 1;
a0d0e21e 3144
7918f24d
NC
3145 PERL_ARGS_ASSERT_SAVE_LINES;
3146
a0d0e21e 3147 while (s && s < send) {
f54cb97a 3148 const char *t;
b9f83d2f 3149 SV * const tmpstr = newSV_type(SVt_PVMG);
a0d0e21e 3150
1d963ff3 3151 t = (const char *)memchr(s, '\n', send - s);
a0d0e21e
LW
3152 if (t)
3153 t++;
3154 else
3155 t = send;
3156
3157 sv_setpvn(tmpstr, s, t - s);
3158 av_store(array, line++, tmpstr);
3159 s = t;
3160 }
3161}
3162
22f16304
RU
3163/*
3164=for apidoc docatch
3165
3166Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context.
3167
31680 is used as continue inside eval,
3169
31703 is used for a die caught by an inner eval - continue inner loop
3171
75af9d73 3172See F<cop.h>: je_mustcatch, when set at any runlevel to TRUE, means eval ops must
22f16304
RU
3173establish a local jmpenv to handle exception traps.
3174
3175=cut
3176*/
0824fdcb 3177STATIC OP *
d7e3f70f 3178S_docatch(pTHX_ Perl_ppaddr_t firstpp)
1e422769 3179{
6224f72b 3180 int ret;
06b5626a 3181 OP * const oldop = PL_op;
db36c5a1 3182 dJMPENV;
1e422769 3183
54310121 3184 assert(CATCH_GET == TRUE);
8bffa5f8 3185
14dd3ad8 3186 JMPENV_PUSH(ret);
6224f72b 3187 switch (ret) {
312caa8e 3188 case 0:
d7e3f70f 3189 PL_op = firstpp(aTHX);
14dd3ad8 3190 redo_body:
85aaa934 3191 CALLRUNOPS(aTHX);
312caa8e
CS
3192 break;
3193 case 3:
8bffa5f8 3194 /* die caught by an inner eval - continue inner loop */
febb3a6d
Z
3195 if (PL_restartop && PL_restartjmpenv == PL_top_env) {
3196 PL_restartjmpenv = NULL;
312caa8e
CS
3197 PL_op = PL_restartop;
3198 PL_restartop = 0;
3199 goto redo_body;
3200 }
924ba076 3201 /* FALLTHROUGH */
312caa8e 3202 default:
14dd3ad8 3203 JMPENV_POP;
533c011a 3204 PL_op = oldop;
6224f72b 3205 JMPENV_JUMP(ret);
e5964223 3206 NOT_REACHED; /* NOTREACHED */
1e422769 3207 }
14dd3ad8 3208 JMPENV_POP;
533c011a 3209 PL_op = oldop;
5f66b61c 3210 return NULL;
1e422769
PP
3211}
3212
a3985cdc
DM
3213
3214/*
3215=for apidoc find_runcv
3216
3217Locate the CV corresponding to the currently executing sub or eval.
796b6530
KW
3218If C<db_seqp> is non_null, skip CVs that are in the DB package and populate
3219C<*db_seqp> with the cop sequence number at the point that the DB:: code was
72d33970
FC
3220entered. (This allows debuggers to eval in the scope of the breakpoint
3221rather than in the scope of the debugger itself.)
a3985cdc
DM
3222
3223=cut
3224*/
3225
3226CV*
d819b83a 3227Perl_find_runcv(pTHX_ U32 *db_seqp)
a3985cdc 3228{
db4cf31d 3229 return Perl_find_runcv_where(aTHX_ 0, 0, db_seqp);
70794f7b
FC
3230}
3231
3232/* If this becomes part of the API, it might need a better name. */
3233CV *
db4cf31d 3234Perl_find_runcv_where(pTHX_ U8 cond, IV arg, U32 *db_seqp)
70794f7b 3235{
a3985cdc 3236 PERL_SI *si;
b4b0692a 3237 int level = 0;
a3985cdc 3238
d819b83a 3239 if (db_seqp)
c3923c33
DM
3240 *db_seqp =
3241 PL_curcop == &PL_compiling
3242 ? PL_cop_seqmax
3243 : PL_curcop->cop_seq;
3244
a3985cdc 3245 for (si = PL_curstackinfo; si; si = si->si_prev) {
06b5626a 3246 I32 ix;
a3985cdc 3247 for (ix = si->si_cxix; ix >= 0; ix--) {
06b5626a 3248 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
70794f7b 3249 CV *cv = NULL;
d819b83a 3250 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
70794f7b 3251 cv = cx->blk_sub.cv;
d819b83a
DM
3252 /* skip DB:: code */
3253 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
3254 *db_seqp = cx->blk_oldcop->cop_seq;
3255 continue;
3256 }
a453e28a
DM
3257 if (cx->cx_type & CXp_SUB_RE)
3258 continue;
d819b83a 3259 }
a3985cdc 3260 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
70794f7b
FC
3261 cv = cx->blk_eval.cv;
3262 if (cv) {
3263 switch (cond) {
db4cf31d
FC
3264 case FIND_RUNCV_padid_eq:
3265 if (!CvPADLIST(cv)
b4db5868 3266 || CvPADLIST(cv)->xpadl_id != (U32)arg)
8771da69 3267 continue;
b4b0692a
FC
3268 return cv;
3269 case FIND_RUNCV_level_eq:
db4cf31d 3270 if (level++ != arg) continue;
2165bd23 3271 /* FALLTHROUGH */
70794f7b
FC
3272 default:
3273 return cv;
3274 }
3275 }
a3985cdc
DM
3276 }
3277 }
db4cf31d 3278 return cond == FIND_RUNCV_padid_eq ? NULL : PL_main_cv;
a3985cdc
DM
3279}
3280
3281
27e90453
DM
3282/* Run yyparse() in a setjmp wrapper. Returns:
3283 * 0: yyparse() successful
3284 * 1: yyparse() failed
3285 * 3: yyparse() died
3286 */
3287STATIC int
28ac2b49 3288S_try_yyparse(pTHX_ int gramtype)
27e90453
DM
3289{
3290 int ret;
3291 dJMPENV;
3292
4ebe6e95 3293 assert(CxTYPE(CX_CUR()) == CXt_EVAL);
27e90453
DM
3294 JMPENV_PUSH(ret);
3295 switch (ret) {
3296 case 0:
28ac2b49 3297 ret = yyparse(gramtype) ? 1 : 0;
27e90453
DM
3298 break;
3299 case 3:
3300 break;
3301 default:
3302 JMPENV_POP;
3303 JMPENV_JUMP(ret);
e5964223 3304 NOT_REACHED; /* NOTREACHED */
27e90453
DM
3305 }
3306 JMPENV_POP;
3307 return ret;
3308}
3309
3310
104a8185
DM
3311/* Compile a require/do or an eval ''.
3312 *
a3985cdc 3313 * outside is the lexically enclosing CV (if any) that invoked us.
104a8185
DM
3314 * seq is the current COP scope value.
3315 * hh is the saved hints hash, if any.
3316 *
410be5db 3317 * Returns a bool indicating whether the compile was successful; if so,
104a8185
DM
3318 * PL_eval_start contains the first op of the compiled code; otherwise,
3319 * pushes undef.
3320 *
3321 * This function is called from two places: pp_require and pp_entereval.
3322 * These can be distinguished by whether PL_op is entereval.
7d116edc
FC
3323 */
3324
410be5db 3325STATIC bool
1c23e2bd 3326S_doeval_compile(pTHX_ U8 gimme, CV* outside, U32 seq, HV *hh)
a0d0e21e 3327{
20b7effb 3328 dSP;
46c461b5 3329 OP * const saveop = PL_op;
104a8185 3330 bool clear_hints = saveop->op_type != OP_ENTEREVAL;
f45b078d 3331 COP * const oldcurcop = PL_curcop;
26c9400e 3332 bool in_require = (saveop->op_type == OP_REQUIRE);
27e90453 3333 int yystatus;
676a678a 3334 CV *evalcv;
a0d0e21e 3335
27e90453 3336 PL_in_eval = (in_require
6dc8a9e4 3337 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
a1941760
DM
3338 : (EVAL_INEVAL |
3339 ((PL_op->op_private & OPpEVAL_RE_REPARSING)
3340 ? EVAL_RE_REPARSING : 0)));
a0d0e21e 3341
1ce6579f
PP
3342 PUSHMARK(SP);
3343
676a678a
Z
3344 evalcv = MUTABLE_CV(newSV_type(SVt_PVCV));
3345 CvEVAL_on(evalcv);
4ebe6e95
DM
3346 assert(CxTYPE(CX_CUR()) == CXt_EVAL);
3347 CX_CUR()->blk_eval.cv = evalcv;
3348 CX_CUR()->blk_gimme = gimme;
2090ab20 3349
676a678a
Z
3350 CvOUTSIDE_SEQ(evalcv) = seq;
3351 CvOUTSIDE(evalcv) = MUTABLE_CV(SvREFCNT_inc_simple(outside));
a3985cdc 3352
dd2155a4 3353 /* set up a scratch pad */
a0d0e21e 3354
eacbb379 3355 CvPADLIST_set(evalcv, pad_new(padnew_SAVE));
cecbe010 3356 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
2c05e328 3357
07055b4c 3358
b5bbe64a 3359 SAVEMORTALIZESV(evalcv); /* must remain until end of current statement */
748a9306 3360
a0d0e21e
LW
3361 /* make sure we compile in the right package */
3362
ed094faf 3363 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
03d9f026 3364 SAVEGENERICSV(PL_curstash);
cb1ad50e
FC
3365 PL_curstash = (HV *)CopSTASH(PL_curcop);
3366 if (SvTYPE(PL_curstash) != SVt_PVHV) PL_curstash = NULL;
04680144
FC
3367 else {
3368 SvREFCNT_inc_simple_void(PL_curstash);
3369 save_item(PL_curstname);
3370 sv_sethek(PL_curstname, HvNAME_HEK(PL_curstash));
3371 }
a0d0e21e 3372 }
3c10abe3 3373 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
3280af22
NIS