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