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