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