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