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