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