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