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