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