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