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