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