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