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