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