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