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