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