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