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