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