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