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