This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
https://perl5.git.perl.org / perl5.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Add new OPpEVAL flags to B::Concise
[perl5.git] / pp_ctl.c
CommitLineData
a0d0e21e
LW		 1/* pp_ctl.c
2 *
1129b882
NC		 3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
a0d0e21e
LW		 5 *
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
8 *
9 */
10
11/*
4ac71550
TC		 12 * Now far ahead the Road has gone,
13 * And I must follow, if I can,
14 * Pursuing it with eager feet,
15 * Until it joins some larger way
16 * Where many paths and errands meet.
17 * And whither then? I cannot say.
18 *
19 * [Bilbo on p.35 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
a0d0e21e
LW		 20 */
21
166f8a29
DM		 22/* This file contains control-oriented pp ("push/pop") functions that
23 * execute the opcodes that make up a perl program. A typical pp function
24 * expects to find its arguments on the stack, and usually pushes its
25 * results onto the stack, hence the 'pp' terminology. Each OP structure
26 * contains a pointer to the relevant pp_foo() function.
27 *
28 * Control-oriented means things like pp_enteriter() and pp_next(), which
29 * alter the flow of control of the program.
30 */
31
32
a0d0e21e 33#include "EXTERN.h"
864dbfa3 34#define PERL_IN_PP_CTL_C
a0d0e21e
LW		 35#include "perl.h"
36
54310121 37#define DOCATCH(o) ((CATCH_GET == TRUE) ? docatch(o) : (o))
1e422769 38
94fcd414
NC		 39#define dopoptosub(plop) dopoptosub_at(cxstack, (plop))
40
a0d0e21e
LW		 41PP(pp_wantarray)
42{
97aff369 43 dVAR;
39644a26 44 dSP;
a0d0e21e 45 I32 cxix;
93f0bc49 46 const PERL_CONTEXT *cx;
a0d0e21e
LW		 47 EXTEND(SP, 1);
48
93f0bc49
FC		 49 if (PL_op->op_private & OPpOFFBYONE) {
50 if (!(cx = caller_cx(1,NULL))) RETPUSHUNDEF;
51 }
52 else {
53 cxix = dopoptosub(cxstack_ix);
54 if (cxix < 0)
a0d0e21e 55 RETPUSHUNDEF;
93f0bc49
FC		 56 cx = &cxstack[cxix];
57 }
a0d0e21e 58
93f0bc49 59 switch (cx->blk_gimme) {
54310121 60 case G_ARRAY:
a0d0e21e 61 RETPUSHYES;
54310121 62 case G_SCALAR:
a0d0e21e 63 RETPUSHNO;
54310121 64 default:
65 RETPUSHUNDEF;
66 }
a0d0e21e
LW		 67}
68
2cd61cdb
IZ		 69PP(pp_regcreset)
70{
97aff369 71 dVAR;
2cd61cdb
IZ		 72 /* XXXX Should store the old value to allow for tie/overload - and
73 restore in regcomp, where marked with XXXX. */
3280af22 74 PL_reginterp_cnt = 0;
0b4182de 75 TAINT_NOT;
2cd61cdb
IZ		 76 return NORMAL;
77}
78
b3eb6a9b
GS		 79PP(pp_regcomp)
80{
97aff369 81 dVAR;
39644a26 82 dSP;
a0d0e21e 83 register PMOP *pm = (PMOP*)cLOGOP->op_other;
a0d0e21e 84 SV *tmpstr;
84679df5 85 REGEXP *re = NULL;
bfed75c6 86
4b5a0d1c 87 /* prevent recompiling under /o and ithreads. */
3db8f154 88#if defined(USE_ITHREADS)
131b3ad0
DM		 89 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
90 if (PL_op->op_flags & OPf_STACKED) {
91 dMARK;
92 SP = MARK;
93 }
94 else
95 (void)POPs;
96 RETURN;
97 }
513629ba 98#endif
d4b87e75
BM		 99
100#define tryAMAGICregexp(rx) \
101 STMT_START { \
6f1401dc 102 SvGETMAGIC(rx); \
d4b87e75 103 if (SvROK(rx) && SvAMAGIC(rx)) { \
31d632c3 104 SV *sv = AMG_CALLunary(rx, regexp_amg); \
d4b87e75
BM		 105 if (sv) { \
106 if (SvROK(sv)) \
107 sv = SvRV(sv); \
108 if (SvTYPE(sv) != SVt_REGEXP) \
109 Perl_croak(aTHX_ "Overloaded qr did not return a REGEXP"); \
110 rx = sv; \
111 } \
112 } \
113 } STMT_END
114
115
131b3ad0 116 if (PL_op->op_flags & OPf_STACKED) {
486ec47a 117 /* multiple args; concatenate them */
131b3ad0
DM		 118 dMARK; dORIGMARK;
119 tmpstr = PAD_SV(ARGTARG);
76f68e9b 120 sv_setpvs(tmpstr, "");
131b3ad0 121 while (++MARK <= SP) {
d4b87e75 122 SV *msv = *MARK;
79a8d529 123 SV *sv;
d4b87e75 124
79a8d529 125 tryAMAGICregexp(msv);
d4b87e75 126
79a8d529
DM		 127 if ((SvAMAGIC(tmpstr) || SvAMAGIC(msv)) &&
128 (sv = amagic_call(tmpstr, msv, concat_amg, AMGf_assign)))
129 {
130 sv_setsv(tmpstr, sv);
131 continue;
131b3ad0 132 }
a9984b10 133 sv_catsv_nomg(tmpstr, msv);
131b3ad0
DM		 134 }
135 SvSETMAGIC(tmpstr);
136 SP = ORIGMARK;
137 }
d4b87e75 138 else {
131b3ad0 139 tmpstr = POPs;
d4b87e75
BM		 140 tryAMAGICregexp(tmpstr);
141 }
142
143#undef tryAMAGICregexp
513629ba 144
b3eb6a9b 145 if (SvROK(tmpstr)) {
d8f6592e 146 SV * const sv = SvRV(tmpstr);
5c35adbb 147 if (SvTYPE(sv) == SVt_REGEXP)
d2f13c59 148 re = (REGEXP*) sv;
c277df42 149 }
d4b87e75
BM		 150 else if (SvTYPE(tmpstr) == SVt_REGEXP)
151 re = (REGEXP*) tmpstr;
152
5c35adbb 153 if (re) {
69dc4b30
FC		 154 /* The match's LHS's get-magic might need to access this op's reg-
155 exp (as is sometimes the case with $'; see bug 70764). So we
156 must call get-magic now before we replace the regexp. Hopeful-
157 ly this hack can be replaced with the approach described at
158 http://www.nntp.perl.org/group/perl.perl5.porters/2007/03
159 /msg122415.html some day. */
455d9033
FC		 160 if(pm->op_type == OP_MATCH) {
161 SV *lhs;
162 const bool was_tainted = PL_tainted;
163 if (pm->op_flags & OPf_STACKED)
69dc4b30 164 lhs = TOPs;
455d9033
FC		 165 else if (pm->op_private & OPpTARGET_MY)
166 lhs = PAD_SV(pm->op_targ);
167 else lhs = DEFSV;
168 SvGETMAGIC(lhs);
169 /* Restore the previous value of PL_tainted (which may have been
170 modified by get-magic), to avoid incorrectly setting the
171 RXf_TAINTED flag further down. */
172 PL_tainted = was_tainted;
173 }
69dc4b30 174
f0826785 175 re = reg_temp_copy(NULL, re);
aaa362c4 176 ReREFCNT_dec(PM_GETRE(pm));
28d8d7f4 177 PM_SETRE(pm, re);
c277df42
IZ		 178 }
179 else {
f3ec07c7
DM		 180 STRLEN len = 0;
181 const char *t = SvOK(tmpstr) ? SvPV_nomg_const(tmpstr, len) : "";
182
c737faaf 183 re = PM_GETRE(pm);
14a49a24 184 assert (re != (REGEXP*) &PL_sv_undef);
c277df42 185
20408e3c 186 /* Check against the last compiled regexp. */
a11c8683 187 if (!re || !RX_PRECOMP(re) || RX_PRELEN(re) != len ||
220fc49f 188 memNE(RX_PRECOMP(re), t, len))
85aff577 189 {
07bc277f 190 const regexp_engine *eng = re ? RX_ENGINE(re) : NULL;
73134a2e 191 U32 pm_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
d8f6592e
AL		 192 if (re) {
193 ReREFCNT_dec(re);
14a49a24
NC		 194#ifdef USE_ITHREADS
195 PM_SETRE(pm, (REGEXP*) &PL_sv_undef);
196#else
4608196e 197 PM_SETRE(pm, NULL); /* crucial if regcomp aborts */
14a49a24 198#endif
1e2e3d02 199 } else if (PL_curcop->cop_hints_hash) {
20439bc7 200 SV *ptr = cop_hints_fetch_pvs(PL_curcop, "regcomp", 0);
1e2e3d02
YO		 201 if (ptr && SvIOK(ptr) && SvIV(ptr))
202 eng = INT2PTR(regexp_engine*,SvIV(ptr));
c277df42 203 }
664e119d 204
533c011a 205 if (PL_op->op_flags & OPf_SPECIAL)
3280af22 206 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
a0d0e21e 207
15d9c083 208 if (!DO_UTF8(tmpstr) && SvUTF8(tmpstr)) {
b9ad30b4
NC		 209 /* Not doing UTF-8, despite what the SV says. Is this only if
210 we're trapped in use 'bytes'? */
211 /* Make a copy of the octet sequence, but without the flag on,
212 as the compiler now honours the SvUTF8 flag on tmpstr. */
213 STRLEN len;
214 const char *const p = SvPV(tmpstr, len);
215 tmpstr = newSVpvn_flags(p, len, SVs_TEMP);
216 }
3e102237 217 else if (SvAMAGIC(tmpstr) || SvGMAGICAL(tmpstr)) {
f3ec07c7 218 /* make a copy to avoid extra stringifies */
0479a84a 219 tmpstr = newSVpvn_flags(t, len, SVs_TEMP | SvUTF8(tmpstr));
f3ec07c7 220 }
c737faaf 221
5a8697a7 222 if (eng)
3ab4a224 223 PM_SETRE(pm, CALLREGCOMP_ENG(eng, tmpstr, pm_flags));
5a8697a7 224 else
3ab4a224 225 PM_SETRE(pm, CALLREGCOMP(tmpstr, pm_flags));
c737faaf 226
f86aaa29 227 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
2cd61cdb 228 inside tie/overload accessors. */
c277df42 229 }
4633a7c4 230 }
c737faaf
YO		 231
232 re = PM_GETRE(pm);
a0d0e21e 233
72311751 234#ifndef INCOMPLETE_TAINTS
3280af22 235 if (PL_tainting) {
9274aefd
DM		 236 if (PL_tainted) {
237 SvTAINTED_on((SV*)re);
07bc277f 238 RX_EXTFLAGS(re) |= RXf_TAINTED;
9274aefd 239 }
72311751
GS		 240 }
241#endif
242
220fc49f 243 if (!RX_PRELEN(PM_GETRE(pm)) && PL_curpm)
3280af22 244 pm = PL_curpm;
a0d0e21e 245
c737faaf
YO		 246
247#if !defined(USE_ITHREADS)
248 /* can't change the optree at runtime either */
249 /* PMf_KEEP is handled differently under threads to avoid these problems */
a0d0e21e 250 if (pm->op_pmflags & PMf_KEEP) {
c90c0ff4 251 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
533c011a 252 cLOGOP->op_first->op_next = PL_op->op_next;
a0d0e21e 253 }
c737faaf 254#endif
a0d0e21e
LW		 255 RETURN;
256}
257
258PP(pp_substcont)
259{
97aff369 260 dVAR;
39644a26 261 dSP;
c09156bb 262 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
901017d6
AL		 263 register PMOP * const pm = (PMOP*) cLOGOP->op_other;
264 register SV * const dstr = cx->sb_dstr;
a0d0e21e
LW		 265 register char *s = cx->sb_s;
266 register char *m = cx->sb_m;
267 char *orig = cx->sb_orig;
901017d6 268 register REGEXP * const rx = cx->sb_rx;
c445ea15 269 SV *nsv = NULL;
988e6e7e 270 REGEXP *old = PM_GETRE(pm);
f410a211
NC		 271
272 PERL_ASYNC_CHECK();
273
988e6e7e 274 if(old != rx) {
bfed75c6 275 if(old)
988e6e7e 276 ReREFCNT_dec(old);
d6106309 277 PM_SETRE(pm,ReREFCNT_inc(rx));
d8f2cf8a
AB		 278 }
279
d9f97599 280 rxres_restore(&cx->sb_rxres, rx);
01b35787 281 RX_MATCH_UTF8_set(rx, DO_UTF8(cx->sb_targ));
c90c0ff4 282
a0d0e21e 283 if (cx->sb_iters++) {
a3b680e6 284 const I32 saviters = cx->sb_iters;
a0d0e21e 285 if (cx->sb_iters > cx->sb_maxiters)
cea2e8a9 286 DIE(aTHX_ "Substitution loop");
a0d0e21e 287
447ee134
DM		 288 SvGETMAGIC(TOPs); /* possibly clear taint on $1 etc: #67962 */
289
ef07e810 290 /* See "how taint works" above pp_subst() */
20be6587
DM		 291 if (SvTAINTED(TOPs))
292 cx->sb_rxtainted |= SUBST_TAINT_REPL;
447ee134 293 sv_catsv_nomg(dstr, POPs);
2c296965
YO		 294 /* XXX: adjust for positive offsets of \G for instance s/(.)\G//g with positive pos() */
295 s -= RX_GOFS(rx);
a0d0e21e
LW		 296
297 /* Are we done */
134b8cd8
NC		 298 /* I believe that we can't set REXEC_SCREAM here if
299 SvSCREAM(cx->sb_targ) is true because SvPVX(cx->sb_targ) isn't always
300 equal to s. [See the comment before Perl_re_intuit_start(), which is
301 called from Perl_regexec_flags(), which says that it should be when
302 SvSCREAM() is true.] s, cx->sb_strend and orig will be consistent
303 with SvPVX(cx->sb_targ), as substconst doesn't modify cx->sb_targ
304 during the match. */
2c296965
YO		 305 if (CxONCE(cx) || s < orig ||
306 !CALLREGEXEC(rx, s, cx->sb_strend, orig,
307 (s == m) + RX_GOFS(rx), cx->sb_targ, NULL,
308 ((cx->sb_rflags & REXEC_COPY_STR)
309 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
310 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
a0d0e21e 311 {
8ca8a454 312 SV *targ = cx->sb_targ;
748a9306 313
078c425b
JH		 314 assert(cx->sb_strend >= s);
315 if(cx->sb_strend > s) {
316 if (DO_UTF8(dstr) && !SvUTF8(targ))
317 sv_catpvn_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
318 else
319 sv_catpvn(dstr, s, cx->sb_strend - s);
320 }
20be6587
DM		 321 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
322 cx->sb_rxtainted |= SUBST_TAINT_PAT;
9212bbba 323
8ca8a454
NC		 324 if (pm->op_pmflags & PMf_NONDESTRUCT) {
325 PUSHs(dstr);
326 /* From here on down we're using the copy, and leaving the
327 original untouched. */
328 targ = dstr;
329 }
330 else {
f8c7b90f 331#ifdef PERL_OLD_COPY_ON_WRITE
8ca8a454
NC		 332 if (SvIsCOW(targ)) {
333 sv_force_normal_flags(targ, SV_COW_DROP_PV);
334 } else
ed252734 335#endif
8ca8a454
NC		 336 {
337 SvPV_free(targ);
338 }
339 SvPV_set(targ, SvPVX(dstr));
340 SvCUR_set(targ, SvCUR(dstr));
341 SvLEN_set(targ, SvLEN(dstr));
342 if (DO_UTF8(dstr))
343 SvUTF8_on(targ);
344 SvPV_set(dstr, NULL);
345
4f4d7508 346 mPUSHi(saviters - 1);
48c036b1 347
8ca8a454
NC		 348 (void)SvPOK_only_UTF8(targ);
349 }
5cd24f17 350
20be6587 351 /* update the taint state of various various variables in
ef07e810
DM		 352 * preparation for final exit.
353 * See "how taint works" above pp_subst() */
20be6587
DM		 354 if (PL_tainting) {
355 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
356 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
357 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
358 )
359 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
360
361 if (!(cx->sb_rxtainted & SUBST_TAINT_BOOLRET)
362 && (cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT))
363 )
364 SvTAINTED_on(TOPs); /* taint return value */
365 /* needed for mg_set below */
366 PL_tainted = cBOOL(cx->sb_rxtainted &
367 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL));
368 SvTAINT(TARG);
369 }
370 /* PL_tainted must be correctly set for this mg_set */
371 SvSETMAGIC(TARG);
372 TAINT_NOT;
4633a7c4 373 LEAVE_SCOPE(cx->sb_oldsave);
a0d0e21e
LW		 374 POPSUBST(cx);
375 RETURNOP(pm->op_next);
20be6587 376 /* NOTREACHED */
a0d0e21e 377 }
8e5e9ebe 378 cx->sb_iters = saviters;
a0d0e21e 379 }
07bc277f 380 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
a0d0e21e
LW		 381 m = s;
382 s = orig;
07bc277f 383 cx->sb_orig = orig = RX_SUBBEG(rx);
a0d0e21e
LW		 384 s = orig + (m - s);
385 cx->sb_strend = s + (cx->sb_strend - m);
386 }
07bc277f 387 cx->sb_m = m = RX_OFFS(rx)[0].start + orig;
db79b45b 388 if (m > s) {
bfed75c6 389 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
db79b45b
JH		 390 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
391 else
392 sv_catpvn(dstr, s, m-s);
393 }
07bc277f 394 cx->sb_s = RX_OFFS(rx)[0].end + orig;
084916e3 395 { /* Update the pos() information. */
8ca8a454
NC		 396 SV * const sv
397 = (pm->op_pmflags & PMf_NONDESTRUCT) ? cx->sb_dstr : cx->sb_targ;
084916e3 398 MAGIC *mg;
7a7f3e45 399 SvUPGRADE(sv, SVt_PVMG);
14befaf4 400 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
d83f0a82 401#ifdef PERL_OLD_COPY_ON_WRITE
51a9ea20 402 if (SvIsCOW(sv))
d83f0a82
NC		 403 sv_force_normal_flags(sv, 0);
404#endif
405 mg = sv_magicext(sv, NULL, PERL_MAGIC_regex_global, &PL_vtbl_mglob,
406 NULL, 0);
084916e3 407 }
ce474962 408 mg->mg_len = m - orig;
084916e3 409 }
988e6e7e 410 if (old != rx)
d6106309 411 (void)ReREFCNT_inc(rx);
20be6587 412 /* update the taint state of various various variables in preparation
ef07e810
DM		 413 * for calling the code block.
414 * See "how taint works" above pp_subst() */
20be6587
DM		 415 if (PL_tainting) {
416 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
417 cx->sb_rxtainted |= SUBST_TAINT_PAT;
418
419 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
420 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
421 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
422 )
423 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
424
425 if (cx->sb_iters > 1 && (cx->sb_rxtainted &
426 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL)))
8ca8a454
NC		 427 SvTAINTED_on((pm->op_pmflags & PMf_NONDESTRUCT)
428 ? cx->sb_dstr : cx->sb_targ);
20be6587
DM		 429 TAINT_NOT;
430 }
d9f97599 431 rxres_save(&cx->sb_rxres, rx);
af9838cc 432 PL_curpm = pm;
29f2e912 433 RETURNOP(pm->op_pmstashstartu.op_pmreplstart);
a0d0e21e
LW		 434}
435
c90c0ff4 436void
864dbfa3 437Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
c90c0ff4 438{
439 UV *p = (UV*)*rsp;
440 U32 i;
7918f24d
NC		 441
442 PERL_ARGS_ASSERT_RXRES_SAVE;
96a5add6 443 PERL_UNUSED_CONTEXT;
c90c0ff4 444
07bc277f 445 if (!p || p[1] < RX_NPARENS(rx)) {
f8c7b90f 446#ifdef PERL_OLD_COPY_ON_WRITE
07bc277f 447 i = 7 + RX_NPARENS(rx) * 2;
ed252734 448#else
07bc277f 449 i = 6 + RX_NPARENS(rx) * 2;
ed252734 450#endif
c90c0ff4 451 if (!p)
a02a5408 452 Newx(p, i, UV);
c90c0ff4 453 else
454 Renew(p, i, UV);
455 *rsp = (void*)p;
456 }
457
07bc277f 458 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? RX_SUBBEG(rx) : NULL);
cf93c79d 459 RX_MATCH_COPIED_off(rx);
c90c0ff4 460
f8c7b90f 461#ifdef PERL_OLD_COPY_ON_WRITE
bdd9a1b1
NC		 462 *p++ = PTR2UV(RX_SAVED_COPY(rx));
463 RX_SAVED_COPY(rx) = NULL;
ed252734
NC		 464#endif
465
07bc277f 466 *p++ = RX_NPARENS(rx);
c90c0ff4 467
07bc277f
NC		 468 *p++ = PTR2UV(RX_SUBBEG(rx));
469 *p++ = (UV)RX_SUBLEN(rx);
470 for (i = 0; i <= RX_NPARENS(rx); ++i) {
471 *p++ = (UV)RX_OFFS(rx)[i].start;
472 *p++ = (UV)RX_OFFS(rx)[i].end;
c90c0ff4 473 }
474}
475
9c105995
NC		 476static void
477S_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
c90c0ff4 478{
479 UV *p = (UV*)*rsp;
480 U32 i;
7918f24d
NC		 481
482 PERL_ARGS_ASSERT_RXRES_RESTORE;
96a5add6 483 PERL_UNUSED_CONTEXT;
c90c0ff4 484
ed252734 485 RX_MATCH_COPY_FREE(rx);
cf93c79d 486 RX_MATCH_COPIED_set(rx, *p);
c90c0ff4 487 *p++ = 0;
488
f8c7b90f 489#ifdef PERL_OLD_COPY_ON_WRITE
bdd9a1b1
NC		 490 if (RX_SAVED_COPY(rx))
491 SvREFCNT_dec (RX_SAVED_COPY(rx));
492 RX_SAVED_COPY(rx) = INT2PTR(SV*,*p);
ed252734
NC		 493 *p++ = 0;
494#endif
495
07bc277f 496 RX_NPARENS(rx) = *p++;
c90c0ff4 497
07bc277f
NC		 498 RX_SUBBEG(rx) = INT2PTR(char*,*p++);
499 RX_SUBLEN(rx) = (I32)(*p++);
500 for (i = 0; i <= RX_NPARENS(rx); ++i) {
501 RX_OFFS(rx)[i].start = (I32)(*p++);
502 RX_OFFS(rx)[i].end = (I32)(*p++);
c90c0ff4 503 }
504}
505
9c105995
NC		 506static void
507S_rxres_free(pTHX_ void **rsp)
c90c0ff4 508{
44f8325f 509 UV * const p = (UV*)*rsp;
7918f24d
NC		 510
511 PERL_ARGS_ASSERT_RXRES_FREE;
96a5add6 512 PERL_UNUSED_CONTEXT;
c90c0ff4 513
514 if (p) {
94010e71
NC		 515#ifdef PERL_POISON
516 void *tmp = INT2PTR(char*,*p);
517 Safefree(tmp);
518 if (*p)
7e337ee0 519 PoisonFree(*p, 1, sizeof(*p));
94010e71 520#else
56431972 521 Safefree(INT2PTR(char*,*p));
94010e71 522#endif
f8c7b90f 523#ifdef PERL_OLD_COPY_ON_WRITE
ed252734
NC		 524 if (p[1]) {
525 SvREFCNT_dec (INT2PTR(SV*,p[1]));
526 }
527#endif
c90c0ff4 528 Safefree(p);
4608196e 529 *rsp = NULL;
c90c0ff4 530 }
531}
532
a701009a
DM		 533#define FORM_NUM_BLANK (1<<30)
534#define FORM_NUM_POINT (1<<29)
535
a0d0e21e
LW		 536PP(pp_formline)
537{
97aff369 538 dVAR; dSP; dMARK; dORIGMARK;
823a54a3 539 register SV * const tmpForm = *++MARK;
086b26f3
DM		 540 SV *formsv; /* contains text of original format */
541 register U32 *fpc; /* format ops program counter */
542 register char *t; /* current append position in target string */
543 const char *f; /* current position in format string */
a0d0e21e 544 register I32 arg;
086b26f3
DM		 545 register SV *sv = NULL; /* current item */
546 const char *item = NULL;/* string value of current item */
547 I32 itemsize = 0; /* length of current item, possibly truncated */
548 I32 fieldsize = 0; /* width of current field */
549 I32 lines = 0; /* number of lines that have been output */
550 bool chopspace = (strchr(PL_chopset, ' ') != NULL); /* does $: have space */
551 const char *chophere = NULL; /* where to chop current item */
f5ada144 552 STRLEN linemark = 0; /* pos of start of line in output */
65202027 553 NV value;
086b26f3 554 bool gotsome = FALSE; /* seen at least one non-blank item on this line */
a0d0e21e 555 STRLEN len;
26e935cf 556 STRLEN linemax; /* estimate of output size in bytes */
1bd51a4c
IH		 557 bool item_is_utf8 = FALSE;
558 bool targ_is_utf8 = FALSE;
bfed75c6 559 const char *fmt;
74e0ddf7 560 MAGIC *mg = NULL;
4ff700b9
DM		 561 U8 *source; /* source of bytes to append */
562 STRLEN to_copy; /* how may bytes to append */
ea60cfe8 563 char trans; /* what chars to translate */
74e0ddf7 564
3808a683 565 mg = doparseform(tmpForm);
a0d0e21e 566
74e0ddf7 567 fpc = (U32*)mg->mg_ptr;
3808a683
DM		 568 /* the actual string the format was compiled from.
569 * with overload etc, this may not match tmpForm */
570 formsv = mg->mg_obj;
571
74e0ddf7 572
3280af22 573 SvPV_force(PL_formtarget, len);
3808a683 574 if (SvTAINTED(tmpForm) || SvTAINTED(formsv))
125b9982 575 SvTAINTED_on(PL_formtarget);
1bd51a4c
IH		 576 if (DO_UTF8(PL_formtarget))
577 targ_is_utf8 = TRUE;
26e935cf
DM		 578 linemax = (SvCUR(formsv) * (IN_BYTES ? 1 : 3) + 1);
579 t = SvGROW(PL_formtarget, len + linemax + 1);
580 /* XXX from now onwards, SvCUR(PL_formtarget) is invalid */
a0d0e21e 581 t += len;
3808a683 582 f = SvPV_const(formsv, len);
a0d0e21e
LW		 583
584 for (;;) {
585 DEBUG_f( {
bfed75c6 586 const char *name = "???";
a0d0e21e
LW		 587 arg = -1;
588 switch (*fpc) {
589 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
590 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
591 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
592 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
593 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
594
595 case FF_CHECKNL: name = "CHECKNL"; break;
596 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
597 case FF_SPACE: name = "SPACE"; break;
598 case FF_HALFSPACE: name = "HALFSPACE"; break;
599 case FF_ITEM: name = "ITEM"; break;
600 case FF_CHOP: name = "CHOP"; break;
601 case FF_LINEGLOB: name = "LINEGLOB"; break;
602 case FF_NEWLINE: name = "NEWLINE"; break;
603 case FF_MORE: name = "MORE"; break;
604 case FF_LINEMARK: name = "LINEMARK"; break;
605 case FF_END: name = "END"; break;
bfed75c6 606 case FF_0DECIMAL: name = "0DECIMAL"; break;
a1b95068 607 case FF_LINESNGL: name = "LINESNGL"; break;
a0d0e21e
LW		 608 }
609 if (arg >= 0)
bf49b057 610 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
a0d0e21e 611 else
bf49b057 612 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
5f80b19c 613 } );
a0d0e21e
LW		 614 switch (*fpc++) {
615 case FF_LINEMARK:
f5ada144 616 linemark = t - SvPVX(PL_formtarget);
a0d0e21e
LW		 617 lines++;
618 gotsome = FALSE;
619 break;
620
621 case FF_LITERAL:
ea60cfe8
DM		 622 to_copy = *fpc++;
623 source = (U8 *)f;
624 f += to_copy;
625 trans = '~';
75645721 626 item_is_utf8 = targ_is_utf8 ? !!DO_UTF8(formsv) : !!SvUTF8(formsv);
ea60cfe8 627 goto append;
a0d0e21e
LW		 628
629 case FF_SKIP:
630 f += *fpc++;
631 break;
632
633 case FF_FETCH:
634 arg = *fpc++;
635 f += arg;
636 fieldsize = arg;
637
638 if (MARK < SP)
639 sv = *++MARK;
640 else {
3280af22 641 sv = &PL_sv_no;
a2a5de95 642 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
a0d0e21e 643 }
125b9982
NT		 644 if (SvTAINTED(sv))
645 SvTAINTED_on(PL_formtarget);
a0d0e21e
LW		 646 break;
647
648 case FF_CHECKNL:
5a34cab7
NC		 649 {
650 const char *send;
651 const char *s = item = SvPV_const(sv, len);
652 itemsize = len;
653 if (DO_UTF8(sv)) {
654 itemsize = sv_len_utf8(sv);
655 if (itemsize != (I32)len) {
656 I32 itembytes;
657 if (itemsize > fieldsize) {
658 itemsize = fieldsize;
659 itembytes = itemsize;
660 sv_pos_u2b(sv, &itembytes, 0);
661 }
662 else
663 itembytes = len;
664 send = chophere = s + itembytes;
665 while (s < send) {
666 if (*s & ~31)
667 gotsome = TRUE;
668 else if (*s == '\n')
669 break;
670 s++;
671 }
672 item_is_utf8 = TRUE;
673 itemsize = s - item;
674 sv_pos_b2u(sv, &itemsize);
675 break;
a0ed51b3 676 }
a0ed51b3 677 }
5a34cab7
NC		 678 item_is_utf8 = FALSE;
679 if (itemsize > fieldsize)
680 itemsize = fieldsize;
681 send = chophere = s + itemsize;
682 while (s < send) {
683 if (*s & ~31)
684 gotsome = TRUE;
685 else if (*s == '\n')
686 break;
687 s++;
688 }
689 itemsize = s - item;
690 break;
a0ed51b3 691 }
a0d0e21e
LW		 692
693 case FF_CHECKCHOP:
5a34cab7
NC		 694 {
695 const char *s = item = SvPV_const(sv, len);
696 itemsize = len;
697 if (DO_UTF8(sv)) {
698 itemsize = sv_len_utf8(sv);
699 if (itemsize != (I32)len) {
700 I32 itembytes;
701 if (itemsize <= fieldsize) {
702 const char *send = chophere = s + itemsize;
703 while (s < send) {
704 if (*s == '\r') {
705 itemsize = s - item;
a0ed51b3 706 chophere = s;
a0ed51b3 707 break;
5a34cab7
NC		 708 }
709 if (*s++ & ~31)
a0ed51b3 710 gotsome = TRUE;
a0ed51b3 711 }
a0ed51b3 712 }
5a34cab7
NC		 713 else {
714 const char *send;
715 itemsize = fieldsize;
716 itembytes = itemsize;
717 sv_pos_u2b(sv, &itembytes, 0);
718 send = chophere = s + itembytes;
719 while (s < send || (s == send && isSPACE(*s))) {
720 if (isSPACE(*s)) {
721 if (chopspace)
722 chophere = s;
723 if (*s == '\r')
724 break;
725 }
726 else {
727 if (*s & ~31)
728 gotsome = TRUE;
729 if (strchr(PL_chopset, *s))
730 chophere = s + 1;
731 }
732 s++;
733 }
734 itemsize = chophere - item;
735 sv_pos_b2u(sv, &itemsize);
736 }
737 item_is_utf8 = TRUE;
a0d0e21e
LW		 738 break;
739 }
a0d0e21e 740 }
5a34cab7
NC		 741 item_is_utf8 = FALSE;
742 if (itemsize <= fieldsize) {
743 const char *const send = chophere = s + itemsize;
744 while (s < send) {
745 if (*s == '\r') {
746 itemsize = s - item;
a0d0e21e 747 chophere = s;
a0d0e21e 748 break;
5a34cab7
NC		 749 }
750 if (*s++ & ~31)
a0d0e21e 751 gotsome = TRUE;
a0d0e21e 752 }
a0d0e21e 753 }
5a34cab7
NC		 754 else {
755 const char *send;
756 itemsize = fieldsize;
757 send = chophere = s + itemsize;
758 while (s < send || (s == send && isSPACE(*s))) {
759 if (isSPACE(*s)) {
760 if (chopspace)
761 chophere = s;
762 if (*s == '\r')
763 break;
764 }
765 else {
766 if (*s & ~31)
767 gotsome = TRUE;
768 if (strchr(PL_chopset, *s))
769 chophere = s + 1;
770 }
771 s++;
772 }
773 itemsize = chophere - item;
774 }
775 break;
a0d0e21e 776 }
a0d0e21e
LW		 777
778 case FF_SPACE:
779 arg = fieldsize - itemsize;
780 if (arg) {
781 fieldsize -= arg;
782 while (arg-- > 0)
783 *t++ = ' ';
784 }
785 break;
786
787 case FF_HALFSPACE:
788 arg = fieldsize - itemsize;
789 if (arg) {
790 arg /= 2;
791 fieldsize -= arg;
792 while (arg-- > 0)
793 *t++ = ' ';
794 }
795 break;
796
797 case FF_ITEM:
8aa7beb6
DM		 798 to_copy = itemsize;
799 source = (U8 *)item;
800 trans = 1;
801 if (item_is_utf8) {
802 /* convert to_copy from chars to bytes */
803 U8 *s = source;
804 while (to_copy--)
805 s += UTF8SKIP(s);
806 to_copy = s - source;
a0d0e21e 807 }
8aa7beb6 808 goto append;
a0d0e21e
LW		 809
810 case FF_CHOP:
5a34cab7
NC		 811 {
812 const char *s = chophere;
813 if (chopspace) {
af68e756 814 while (isSPACE(*s))
5a34cab7
NC		 815 s++;
816 }
817 sv_chop(sv,s);
818 SvSETMAGIC(sv);
819 break;
a0d0e21e 820 }
a0d0e21e 821
a1b95068
WL		 822 case FF_LINESNGL:
823 chopspace = 0;
a0d0e21e 824 case FF_LINEGLOB:
5a34cab7 825 {
e32383e2 826 const bool oneline = fpc[-1] == FF_LINESNGL;
5a34cab7 827 const char *s = item = SvPV_const(sv, len);
7440a75b 828 const char *const send = s + len;
7440a75b 829
f3f2f1a3 830 item_is_utf8 = DO_UTF8(sv);
a1137ee5 831 if (!len)
7440a75b 832 break;
ea60cfe8 833 trans = 0;
0d21cefe 834 gotsome = TRUE;
a1137ee5 835 chophere = s + len;
4ff700b9
DM		 836 source = (U8 *) s;
837 to_copy = len;
0d21cefe
DM		 838 while (s < send) {
839 if (*s++ == '\n') {
840 if (oneline) {
841 to_copy = s - SvPVX_const(sv) - 1;
842 chophere = s;
843 break;
844 } else {
845 if (s == send) {
0d21cefe
DM		 846 to_copy--;
847 } else
848 lines++;
1bd51a4c 849 }
a0d0e21e 850 }
0d21cefe 851 }
a2c0032b
DM		 852 }
853
ea60cfe8
DM		 854 append:
855 /* append to_copy bytes from source to PL_formstring.
856 * item_is_utf8 implies source is utf8.
857 * if trans, translate certain characters during the copy */
a2c0032b
DM		 858 {
859 U8 *tmp = NULL;
26e935cf 860 STRLEN grow = 0;
0325ce87
DM		 861
862 SvCUR_set(PL_formtarget,
863 t - SvPVX_const(PL_formtarget));
864
0d21cefe
DM		 865 if (targ_is_utf8 && !item_is_utf8) {
866 source = tmp = bytes_to_utf8(source, &to_copy);
0d21cefe
DM		 867 } else {
868 if (item_is_utf8 && !targ_is_utf8) {
f5ada144 869 U8 *s;
0d21cefe 870 /* Upgrade targ to UTF8, and then we reduce it to
0325ce87
DM		 871 a problem we have a simple solution for.
872 Don't need get magic. */
0d21cefe 873 sv_utf8_upgrade_nomg(PL_formtarget);
0325ce87 874 targ_is_utf8 = TRUE;
f5ada144
DM		 875 /* re-calculate linemark */
876 s = (U8*)SvPVX(PL_formtarget);
26e935cf
DM		 877 /* the bytes we initially allocated to append the
878 * whole line may have been gobbled up during the
879 * upgrade, so allocate a whole new line's worth
880 * for safety */
881 grow = linemax;
f5ada144
DM		 882 while (linemark--)
883 s += UTF8SKIP(s);
884 linemark = s - (U8*)SvPVX(PL_formtarget);
e8e72d41 885 }
0d21cefe
DM		 886 /* Easy. They agree. */
887 assert (item_is_utf8 == targ_is_utf8);
888 }
26e935cf
DM		 889 if (!trans)
890 /* @* and ^* are the only things that can exceed
891 * the linemax, so grow by the output size, plus
892 * a whole new form's worth in case of any further
893 * output */
894 grow = linemax + to_copy;
895 if (grow)
896 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + grow + 1);
0d21cefe
DM		 897 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
898
899 Copy(source, t, to_copy, char);
ea60cfe8 900 if (trans) {
8aa7beb6
DM		 901 /* blank out ~ or control chars, depending on trans.
902 * works on bytes not chars, so relies on not
903 * matching utf8 continuation bytes */
ea60cfe8
DM		 904 U8 *s = (U8*)t;
905 U8 *send = s + to_copy;
906 while (s < send) {
8aa7beb6
DM		 907 const int ch = *s;
908 if (trans == '~' ? (ch == '~') :
909#ifdef EBCDIC
910 iscntrl(ch)
911#else
912 (!(ch & ~31))
913#endif
914 )
ea60cfe8
DM		 915 *s = ' ';
916 s++;
917 }
918 }
919
0d21cefe
DM		 920 t += to_copy;
921 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) + to_copy);
a1137ee5 922 if (tmp)
0d21cefe 923 Safefree(tmp);
5a34cab7 924 break;
a0d0e21e 925 }
a0d0e21e 926
a1b95068
WL		 927 case FF_0DECIMAL:
928 arg = *fpc++;
929#if defined(USE_LONG_DOUBLE)
10edeb5d 930 fmt = (const char *)
a701009a 931 ((arg & FORM_NUM_POINT) ?
10edeb5d 932 "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl);
a1b95068 933#else
10edeb5d 934 fmt = (const char *)
a701009a 935 ((arg & FORM_NUM_POINT) ?
10edeb5d 936 "%#0*.*f" : "%0*.*f");
a1b95068
WL		 937#endif
938 goto ff_dec;
a0d0e21e 939 case FF_DECIMAL:
a0d0e21e 940 arg = *fpc++;
65202027 941#if defined(USE_LONG_DOUBLE)
10edeb5d 942 fmt = (const char *)
a701009a 943 ((arg & FORM_NUM_POINT) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl);
65202027 944#else
10edeb5d 945 fmt = (const char *)
a701009a 946 ((arg & FORM_NUM_POINT) ? "%#*.*f" : "%*.*f");
65202027 947#endif
a1b95068 948 ff_dec:
784707d5
JP		 949 /* If the field is marked with ^ and the value is undefined,
950 blank it out. */
a701009a 951 if ((arg & FORM_NUM_BLANK) && !SvOK(sv)) {
784707d5
JP		 952 arg = fieldsize;
953 while (arg--)
954 *t++ = ' ';
955 break;
956 }
957 gotsome = TRUE;
958 value = SvNV(sv);
a1b95068 959 /* overflow evidence */
bfed75c6 960 if (num_overflow(value, fieldsize, arg)) {
a1b95068
WL		 961 arg = fieldsize;
962 while (arg--)
963 *t++ = '#';
964 break;
965 }
784707d5
JP		 966 /* Formats aren't yet marked for locales, so assume "yes". */
967 {
968 STORE_NUMERIC_STANDARD_SET_LOCAL();
a701009a
DM		 969 arg &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
970 my_snprintf(t, SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget)), fmt, (int) fieldsize, (int) arg, value);
784707d5
JP		 971 RESTORE_NUMERIC_STANDARD();
972 }
973 t += fieldsize;
974 break;
a1b95068 975
a0d0e21e
LW		 976 case FF_NEWLINE:
977 f++;
f5ada144 978 while (t-- > (SvPVX(PL_formtarget) + linemark) && *t == ' ') ;
a0d0e21e
LW		 979 t++;
980 *t++ = '\n';
981 break;
982
983 case FF_BLANK:
984 arg = *fpc++;
985 if (gotsome) {
986 if (arg) { /* repeat until fields exhausted? */
11f9eeaf
DM		 987 fpc--;
988 goto end;
a0d0e21e
LW		 989 }
990 }
991 else {
f5ada144 992 t = SvPVX(PL_formtarget) + linemark;
a0d0e21e
LW		 993 lines--;
994 }
995 break;
996
997 case FF_MORE:
5a34cab7
NC		 998 {
999 const char *s = chophere;
1000 const char *send = item + len;
1001 if (chopspace) {
af68e756 1002 while (isSPACE(*s) && (s < send))
5a34cab7 1003 s++;
a0d0e21e 1004 }
5a34cab7
NC		 1005 if (s < send) {
1006 char *s1;
1007 arg = fieldsize - itemsize;
1008 if (arg) {
1009 fieldsize -= arg;
1010 while (arg-- > 0)
1011 *t++ = ' ';
1012 }
1013 s1 = t - 3;
1014 if (strnEQ(s1," ",3)) {
1015 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
1016 s1--;
1017 }
1018 *s1++ = '.';
1019 *s1++ = '.';
1020 *s1++ = '.';
a0d0e21e 1021 }
5a34cab7 1022 break;
a0d0e21e 1023 }
a0d0e21e 1024 case FF_END:
11f9eeaf 1025 end:
bf2bec63 1026 assert(t < SvPVX_const(PL_formtarget) + SvLEN(PL_formtarget));
a0d0e21e 1027 *t = '\0';
b15aece3 1028 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
1bd51a4c
IH		 1029 if (targ_is_utf8)
1030 SvUTF8_on(PL_formtarget);
3280af22 1031 FmLINES(PL_formtarget) += lines;
a0d0e21e 1032 SP = ORIGMARK;
11f9eeaf
DM		 1033 if (fpc[-1] == FF_BLANK)
1034 RETURNOP(cLISTOP->op_first);
1035 else
1036 RETPUSHYES;
a0d0e21e
LW		 1037 }
1038 }
1039}
1040
1041PP(pp_grepstart)
1042{
27da23d5 1043 dVAR; dSP;
a0d0e21e
LW		 1044 SV *src;
1045
3280af22 1046 if (PL_stack_base + *PL_markstack_ptr == SP) {
a0d0e21e 1047 (void)POPMARK;
54310121 1048 if (GIMME_V == G_SCALAR)
6e449a3a 1049 mXPUSHi(0);
533c011a 1050 RETURNOP(PL_op->op_next->op_next);
a0d0e21e 1051 }
3280af22 1052 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
897d3989
NC		 1053 Perl_pp_pushmark(aTHX); /* push dst */
1054 Perl_pp_pushmark(aTHX); /* push src */
d343c3ef 1055 ENTER_with_name("grep"); /* enter outer scope */
a0d0e21e
LW		 1056
1057 SAVETMPS;
59f00321
RGS		 1058 if (PL_op->op_private & OPpGREP_LEX)
1059 SAVESPTR(PAD_SVl(PL_op->op_targ));
1060 else
1061 SAVE_DEFSV;
d343c3ef 1062 ENTER_with_name("grep_item"); /* enter inner scope */
7766f137 1063 SAVEVPTR(PL_curpm);
a0d0e21e 1064
3280af22 1065 src = PL_stack_base[*PL_markstack_ptr];
a0d0e21e 1066 SvTEMP_off(src);
59f00321
RGS		 1067 if (PL_op->op_private & OPpGREP_LEX)
1068 PAD_SVl(PL_op->op_targ) = src;
1069 else
414bf5ae 1070 DEFSV_set(src);
a0d0e21e
LW		 1071
1072 PUTBACK;
533c011a 1073 if (PL_op->op_type == OP_MAPSTART)
897d3989 1074 Perl_pp_pushmark(aTHX); /* push top */
533c011a 1075 return ((LOGOP*)PL_op->op_next)->op_other;
a0d0e21e
LW		 1076}
1077
a0d0e21e
LW		 1078PP(pp_mapwhile)
1079{
27da23d5 1080 dVAR; dSP;
f54cb97a 1081 const I32 gimme = GIMME_V;
544f3153 1082 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
a0d0e21e
LW		 1083 I32 count;
1084 I32 shift;
1085 SV** src;
ac27b0f5 1086 SV** dst;
a0d0e21e 1087
544f3153 1088 /* first, move source pointer to the next item in the source list */
3280af22 1089 ++PL_markstack_ptr[-1];
544f3153
GS		 1090
1091 /* if there are new items, push them into the destination list */
4c90a460 1092 if (items && gimme != G_VOID) {
544f3153
GS		 1093 /* might need to make room back there first */
1094 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
1095 /* XXX this implementation is very pessimal because the stack
1096 * is repeatedly extended for every set of items. Is possible
1097 * to do this without any stack extension or copying at all
1098 * by maintaining a separate list over which the map iterates
18ef8bea 1099 * (like foreach does). --gsar */
544f3153
GS		 1100
1101 /* everything in the stack after the destination list moves
1102 * towards the end the stack by the amount of room needed */
1103 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
1104
1105 /* items to shift up (accounting for the moved source pointer) */
1106 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
18ef8bea
BT		 1107
1108 /* This optimization is by Ben Tilly and it does
1109 * things differently from what Sarathy (gsar)
1110 * is describing. The downside of this optimization is
1111 * that leaves "holes" (uninitialized and hopefully unused areas)
1112 * to the Perl stack, but on the other hand this
1113 * shouldn't be a problem. If Sarathy's idea gets
1114 * implemented, this optimization should become
1115 * irrelevant. --jhi */
1116 if (shift < count)
1117 shift = count; /* Avoid shifting too often --Ben Tilly */
bfed75c6 1118
924508f0
GS		 1119 EXTEND(SP,shift);
1120 src = SP;
1121 dst = (SP += shift);
3280af22
NIS		 1122 PL_markstack_ptr[-1] += shift;
1123 *PL_markstack_ptr += shift;
544f3153 1124 while (count--)
a0d0e21e
LW		 1125 *dst-- = *src--;
1126 }
544f3153 1127 /* copy the new items down to the destination list */
ac27b0f5 1128 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
22023b26 1129 if (gimme == G_ARRAY) {
b2a2a901
DM		 1130 /* add returned items to the collection (making mortal copies
1131 * if necessary), then clear the current temps stack frame
1132 * *except* for those items. We do this splicing the items
1133 * into the start of the tmps frame (so some items may be on
59d53fd6 1134 * the tmps stack twice), then moving PL_tmps_floor above
b2a2a901
DM		 1135 * them, then freeing the frame. That way, the only tmps that
1136 * accumulate over iterations are the return values for map.
1137 * We have to do to this way so that everything gets correctly
1138 * freed if we die during the map.
1139 */
1140 I32 tmpsbase;
1141 I32 i = items;
1142 /* make space for the slice */
1143 EXTEND_MORTAL(items);
1144 tmpsbase = PL_tmps_floor + 1;
1145 Move(PL_tmps_stack + tmpsbase,
1146 PL_tmps_stack + tmpsbase + items,
1147 PL_tmps_ix - PL_tmps_floor,
1148 SV*);
1149 PL_tmps_ix += items;
1150
1151 while (i-- > 0) {
1152 SV *sv = POPs;
1153 if (!SvTEMP(sv))
1154 sv = sv_mortalcopy(sv);
1155 *dst-- = sv;
1156 PL_tmps_stack[tmpsbase++] = SvREFCNT_inc_simple(sv);
1157 }
1158 /* clear the stack frame except for the items */
1159 PL_tmps_floor += items;
1160 FREETMPS;
1161 /* FREETMPS may have cleared the TEMP flag on some of the items */
1162 i = items;
1163 while (i-- > 0)
1164 SvTEMP_on(PL_tmps_stack[--tmpsbase]);
22023b26 1165 }
bfed75c6 1166 else {
22023b26
TP		 1167 /* scalar context: we don't care about which values map returns
1168 * (we use undef here). And so we certainly don't want to do mortal
1169 * copies of meaningless values. */
1170 while (items-- > 0) {
b988aa42 1171 (void)POPs;
22023b26
TP		 1172 *dst-- = &PL_sv_undef;
1173 }
b2a2a901 1174 FREETMPS;
22023b26 1175 }
a0d0e21e 1176 }
b2a2a901
DM		 1177 else {
1178 FREETMPS;
1179 }
d343c3ef 1180 LEAVE_with_name("grep_item"); /* exit inner scope */
a0d0e21e
LW		 1181
1182 /* All done yet? */
3280af22 1183 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
a0d0e21e
LW		 1184
1185 (void)POPMARK; /* pop top */
d343c3ef 1186 LEAVE_with_name("grep"); /* exit outer scope */
a0d0e21e 1187 (void)POPMARK; /* pop src */
3280af22 1188 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
a0d0e21e 1189 (void)POPMARK; /* pop dst */
3280af22 1190 SP = PL_stack_base + POPMARK; /* pop original mark */
54310121 1191 if (gimme == G_SCALAR) {
7cc47870
RGS		 1192 if (PL_op->op_private & OPpGREP_LEX) {
1193 SV* sv = sv_newmortal();
1194 sv_setiv(sv, items);
1195 PUSHs(sv);
1196 }
1197 else {
1198 dTARGET;
1199 XPUSHi(items);
1200 }
a0d0e21e 1201 }
54310121 1202 else if (gimme == G_ARRAY)
1203 SP += items;
a0d0e21e
LW		 1204 RETURN;
1205 }
1206 else {
1207 SV *src;
1208
d343c3ef 1209 ENTER_with_name("grep_item"); /* enter inner scope */
7766f137 1210 SAVEVPTR(PL_curpm);
a0d0e21e 1211
544f3153 1212 /* set $_ to the new source item */
3280af22 1213 src = PL_stack_base[PL_markstack_ptr[-1]];
a0d0e21e 1214 SvTEMP_off(src);
59f00321
RGS		 1215 if (PL_op->op_private & OPpGREP_LEX)
1216 PAD_SVl(PL_op->op_targ) = src;
1217 else
414bf5ae 1218 DEFSV_set(src);
a0d0e21e
LW		 1219
1220 RETURNOP(cLOGOP->op_other);
1221 }
1222}
1223
a0d0e21e
LW		 1224/* Range stuff. */
1225
1226PP(pp_range)
1227{
97aff369 1228 dVAR;
a0d0e21e 1229 if (GIMME == G_ARRAY)
1a67a97c 1230 return NORMAL;
538573f7 1231 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1a67a97c 1232 return cLOGOP->op_other;
538573f7 1233 else
1a67a97c 1234 return NORMAL;
a0d0e21e
LW		 1235}
1236
1237PP(pp_flip)
1238{
97aff369 1239 dVAR;
39644a26 1240 dSP;
a0d0e21e
LW		 1241
1242 if (GIMME == G_ARRAY) {
1a67a97c 1243 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
a0d0e21e
LW		 1244 }
1245 else {
1246 dTOPss;
44f8325f 1247 SV * const targ = PAD_SV(PL_op->op_targ);
bfed75c6 1248 int flip = 0;
790090df 1249
bfed75c6 1250 if (PL_op->op_private & OPpFLIP_LINENUM) {
4e3399f9
YST		 1251 if (GvIO(PL_last_in_gv)) {
1252 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1253 }
1254 else {
fafc274c 1255 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
44f8325f
AL		 1256 if (gv && GvSV(gv))
1257 flip = SvIV(sv) == SvIV(GvSV(gv));
4e3399f9 1258 }
bfed75c6
AL		 1259 } else {
1260 flip = SvTRUE(sv);
1261 }
1262 if (flip) {
a0d0e21e 1263 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
533c011a 1264 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e 1265 sv_setiv(targ, 1);
3e3baf6d 1266 SETs(targ);
a0d0e21e
LW		 1267 RETURN;
1268 }
1269 else {
1270 sv_setiv(targ, 0);
924508f0 1271 SP--;
1a67a97c 1272 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
a0d0e21e
LW		 1273 }
1274 }
76f68e9b 1275 sv_setpvs(TARG, "");
a0d0e21e
LW		 1276 SETs(targ);
1277 RETURN;
1278 }
1279}
1280
8e9bbdb9
RGS		 1281/* This code tries to decide if "$left .. $right" should use the
1282 magical string increment, or if the range is numeric (we make
1283 an exception for .."0" [#18165]). AMS 20021031. */
1284
1285#define RANGE_IS_NUMERIC(left,right) ( \
b0e74086
RGS		 1286 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1287 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
e0ab1c0e 1288 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
b15aece3 1289 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
e0ab1c0e 1290 && (!SvOK(right) || looks_like_number(right))))
8e9bbdb9 1291
a0d0e21e
LW		 1292PP(pp_flop)
1293{
97aff369 1294 dVAR; dSP;
a0d0e21e
LW		 1295
1296 if (GIMME == G_ARRAY) {
1297 dPOPPOPssrl;
86cb7173 1298
5b295bef
RD		 1299 SvGETMAGIC(left);
1300 SvGETMAGIC(right);
a0d0e21e 1301
8e9bbdb9 1302 if (RANGE_IS_NUMERIC(left,right)) {
901017d6
AL		 1303 register IV i, j;
1304 IV max;
f52e41ad
FC		 1305 if ((SvOK(left) && SvNV_nomg(left) < IV_MIN) ||
1306 (SvOK(right) && SvNV_nomg(right) > IV_MAX))
d470f89e 1307 DIE(aTHX_ "Range iterator outside integer range");
f52e41ad
FC		 1308 i = SvIV_nomg(left);
1309 max = SvIV_nomg(right);
bbce6d69 1310 if (max >= i) {
c1ab3db2
AK		 1311 j = max - i + 1;
1312 EXTEND_MORTAL(j);
1313 EXTEND(SP, j);
bbce6d69 1314 }
c1ab3db2
AK		 1315 else
1316 j = 0;
1317 while (j--) {
901017d6 1318 SV * const sv = sv_2mortal(newSViv(i++));
a0d0e21e
LW		 1319 PUSHs(sv);
1320 }
1321 }
1322 else {
3c323193
FC		 1323 STRLEN len, llen;
1324 const char * const lpv = SvPV_nomg_const(left, llen);
f52e41ad 1325 const char * const tmps = SvPV_nomg_const(right, len);
a0d0e21e 1326
3c323193 1327 SV *sv = newSVpvn_flags(lpv, llen, SvUTF8(left)|SVs_TEMP);
89ea2908 1328 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
a0d0e21e 1329 XPUSHs(sv);
b15aece3 1330 if (strEQ(SvPVX_const(sv),tmps))
89ea2908 1331 break;
a0d0e21e
LW		 1332 sv = sv_2mortal(newSVsv(sv));
1333 sv_inc(sv);
1334 }
a0d0e21e
LW		 1335 }
1336 }
1337 else {
1338 dTOPss;
901017d6 1339 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
4e3399f9 1340 int flop = 0;
a0d0e21e 1341 sv_inc(targ);
4e3399f9
YST		 1342
1343 if (PL_op->op_private & OPpFLIP_LINENUM) {
1344 if (GvIO(PL_last_in_gv)) {
1345 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1346 }
1347 else {
fafc274c 1348 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
4e3399f9
YST		 1349 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1350 }
1351 }
1352 else {
1353 flop = SvTRUE(sv);
1354 }
1355
1356 if (flop) {
a0d0e21e 1357 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
396482e1 1358 sv_catpvs(targ, "E0");
a0d0e21e
LW		 1359 }
1360 SETs(targ);
1361 }
1362
1363 RETURN;
1364}
1365
1366/* Control. */
1367
27da23d5 1368static const char * const context_name[] = {
515afda2 1369 "pseudo-block",
f31522f3 1370 NULL, /* CXt_WHEN never actually needs "block" */
76753e7f 1371 NULL, /* CXt_BLOCK never actually needs "block" */
f31522f3 1372 NULL, /* CXt_GIVEN never actually needs "block" */
76753e7f
NC		 1373 NULL, /* CXt_LOOP_FOR never actually needs "loop" */
1374 NULL, /* CXt_LOOP_PLAIN never actually needs "loop" */
1375 NULL, /* CXt_LOOP_LAZYSV never actually needs "loop" */
1376 NULL, /* CXt_LOOP_LAZYIV never actually needs "loop" */
515afda2 1377 "subroutine",
76753e7f 1378 "format",
515afda2 1379 "eval",
515afda2 1380 "substitution",
515afda2
NC		 1381};
1382
76e3520e 1383STATIC I32
06b5626a 1384S_dopoptolabel(pTHX_ const char *label)
a0d0e21e 1385{
97aff369 1386 dVAR;
a0d0e21e 1387 register I32 i;
a0d0e21e 1388
7918f24d
NC		 1389 PERL_ARGS_ASSERT_DOPOPTOLABEL;
1390
a0d0e21e 1391 for (i = cxstack_ix; i >= 0; i--) {
901017d6 1392 register const PERL_CONTEXT * const cx = &cxstack[i];
6b35e009 1393 switch (CxTYPE(cx)) {
a0d0e21e 1394 case CXt_SUBST:
a0d0e21e 1395 case CXt_SUB:
7766f137 1396 case CXt_FORMAT:
a0d0e21e 1397 case CXt_EVAL:
0a753a76 1398 case CXt_NULL:
a2a5de95
NC		 1399 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1400 context_name[CxTYPE(cx)], OP_NAME(PL_op));
515afda2
NC		 1401 if (CxTYPE(cx) == CXt_NULL)
1402 return -1;
1403 break;
c6fdafd0 1404 case CXt_LOOP_LAZYIV:
d01136d6 1405 case CXt_LOOP_LAZYSV:
3b719c58
NC		 1406 case CXt_LOOP_FOR:
1407 case CXt_LOOP_PLAIN:
7e8f1eac
AD		 1408 {
1409 const char *cx_label = CxLABEL(cx);
1410 if (!cx_label || strNE(label, cx_label) ) {
1c98cc53 1411 DEBUG_l(Perl_deb(aTHX_ "(poptolabel(): skipping label at cx=%ld %s)\n",
7e8f1eac 1412 (long)i, cx_label));
a0d0e21e
LW		 1413 continue;
1414 }
1c98cc53 1415 DEBUG_l( Perl_deb(aTHX_ "(poptolabel(): found label at cx=%ld %s)\n", (long)i, label));
a0d0e21e 1416 return i;
7e8f1eac 1417 }
a0d0e21e
LW		 1418 }
1419 }
1420 return i;
1421}
1422
0d863452
RH		 1423
1424
e50aee73 1425I32
864dbfa3 1426Perl_dowantarray(pTHX)
e50aee73 1427{
97aff369 1428 dVAR;
f54cb97a 1429 const I32 gimme = block_gimme();
54310121 1430 return (gimme == G_VOID) ? G_SCALAR : gimme;
1431}
1432
1433I32
864dbfa3 1434Perl_block_gimme(pTHX)
54310121 1435{
97aff369 1436 dVAR;
06b5626a 1437 const I32 cxix = dopoptosub(cxstack_ix);
e50aee73 1438 if (cxix < 0)
46fc3d4c 1439 return G_VOID;
e50aee73 1440
54310121 1441 switch (cxstack[cxix].blk_gimme) {
d2719217
GS		 1442 case G_VOID:
1443 return G_VOID;
54310121 1444 case G_SCALAR:
e50aee73 1445 return G_SCALAR;
54310121 1446 case G_ARRAY:
1447 return G_ARRAY;
1448 default:
cea2e8a9 1449 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
d2719217
GS		 1450 /* NOTREACHED */
1451 return 0;
54310121 1452 }
e50aee73
AD		 1453}
1454
78f9721b
SM		 1455I32
1456Perl_is_lvalue_sub(pTHX)
1457{
97aff369 1458 dVAR;
06b5626a 1459 const I32 cxix = dopoptosub(cxstack_ix);
78f9721b
SM		 1460 assert(cxix >= 0); /* We should only be called from inside subs */
1461
bafb2adc
NC		 1462 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1463 return CxLVAL(cxstack + cxix);
78f9721b
SM		 1464 else
1465 return 0;
1466}
1467
777d9014
FC		 1468/* only used by PUSHSUB */
1469I32
1470Perl_was_lvalue_sub(pTHX)
1471{
1472 dVAR;
1473 const I32 cxix = dopoptosub(cxstack_ix-1);
1474 assert(cxix >= 0); /* We should only be called from inside subs */
1475
1476 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1477 return CxLVAL(cxstack + cxix);
1478 else
1479 return 0;
1480}
1481
76e3520e 1482STATIC I32
901017d6 1483S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
2c375eb9 1484{
97aff369 1485 dVAR;
a0d0e21e 1486 I32 i;
7918f24d
NC		 1487
1488 PERL_ARGS_ASSERT_DOPOPTOSUB_AT;
1489
a0d0e21e 1490 for (i = startingblock; i >= 0; i--) {
901017d6 1491 register const PERL_CONTEXT * const cx = &cxstk[i];
6b35e009 1492 switch (CxTYPE(cx)) {
a0d0e21e
LW		 1493 default:
1494 continue;
1495 case CXt_EVAL:
1496 case CXt_SUB:
7766f137 1497 case CXt_FORMAT:
1c98cc53 1498 DEBUG_l( Perl_deb(aTHX_ "(dopoptosub_at(): found sub at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1499 return i;
1500 }
1501 }
1502 return i;
1503}
1504
76e3520e 1505STATIC I32
cea2e8a9 1506S_dopoptoeval(pTHX_ I32 startingblock)
a0d0e21e 1507{
97aff369 1508 dVAR;
a0d0e21e 1509 I32 i;
a0d0e21e 1510 for (i = startingblock; i >= 0; i--) {
06b5626a 1511 register const PERL_CONTEXT *cx = &cxstack[i];
6b35e009 1512 switch (CxTYPE(cx)) {
a0d0e21e
LW		 1513 default:
1514 continue;
1515 case CXt_EVAL:
1c98cc53 1516 DEBUG_l( Perl_deb(aTHX_ "(dopoptoeval(): found eval at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1517 return i;
1518 }
1519 }
1520 return i;
1521}
1522
76e3520e 1523STATIC I32
cea2e8a9 1524S_dopoptoloop(pTHX_ I32 startingblock)
a0d0e21e 1525{
97aff369 1526 dVAR;
a0d0e21e 1527 I32 i;
a0d0e21e 1528 for (i = startingblock; i >= 0; i--) {
901017d6 1529 register const PERL_CONTEXT * const cx = &cxstack[i];
6b35e009 1530 switch (CxTYPE(cx)) {
a0d0e21e 1531 case CXt_SUBST:
a0d0e21e 1532 case CXt_SUB:
7766f137 1533 case CXt_FORMAT:
a0d0e21e 1534 case CXt_EVAL:
0a753a76 1535 case CXt_NULL:
a2a5de95
NC		 1536 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1537 context_name[CxTYPE(cx)], OP_NAME(PL_op));
515afda2
NC		 1538 if ((CxTYPE(cx)) == CXt_NULL)
1539 return -1;
1540 break;
c6fdafd0 1541 case CXt_LOOP_LAZYIV:
d01136d6 1542 case CXt_LOOP_LAZYSV:
3b719c58
NC		 1543 case CXt_LOOP_FOR:
1544 case CXt_LOOP_PLAIN:
1c98cc53 1545 DEBUG_l( Perl_deb(aTHX_ "(dopoptoloop(): found loop at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1546 return i;
1547 }
1548 }
1549 return i;
1550}
1551
0d863452
RH		 1552STATIC I32
1553S_dopoptogiven(pTHX_ I32 startingblock)
1554{
97aff369 1555 dVAR;
0d863452
RH		 1556 I32 i;
1557 for (i = startingblock; i >= 0; i--) {
1558 register const PERL_CONTEXT *cx = &cxstack[i];
1559 switch (CxTYPE(cx)) {
1560 default:
1561 continue;
1562 case CXt_GIVEN:
1c98cc53 1563 DEBUG_l( Perl_deb(aTHX_ "(dopoptogiven(): found given at cx=%ld)\n", (long)i));
0d863452 1564 return i;
3b719c58
NC		 1565 case CXt_LOOP_PLAIN:
1566 assert(!CxFOREACHDEF(cx));
1567 break;
c6fdafd0 1568 case CXt_LOOP_LAZYIV:
d01136d6 1569 case CXt_LOOP_LAZYSV:
3b719c58 1570 case CXt_LOOP_FOR:
0d863452 1571 if (CxFOREACHDEF(cx)) {
1c98cc53 1572 DEBUG_l( Perl_deb(aTHX_ "(dopoptogiven(): found foreach at cx=%ld)\n", (long)i));
0d863452
RH		 1573 return i;
1574 }
1575 }
1576 }
1577 return i;
1578}
1579
1580STATIC I32
1581S_dopoptowhen(pTHX_ I32 startingblock)
1582{
97aff369 1583 dVAR;
0d863452
RH		 1584 I32 i;
1585 for (i = startingblock; i >= 0; i--) {
1586 register const PERL_CONTEXT *cx = &cxstack[i];
1587 switch (CxTYPE(cx)) {
1588 default:
1589 continue;
1590 case CXt_WHEN:
1c98cc53 1591 DEBUG_l( Perl_deb(aTHX_ "(dopoptowhen(): found when at cx=%ld)\n", (long)i));
0d863452
RH		 1592 return i;
1593 }
1594 }
1595 return i;
1596}
1597
a0d0e21e 1598void
864dbfa3 1599Perl_dounwind(pTHX_ I32 cxix)
a0d0e21e 1600{
97aff369 1601 dVAR;
a0d0e21e
LW		 1602 I32 optype;
1603
f144f1e3
DM		 1604 if (!PL_curstackinfo) /* can happen if die during thread cloning */
1605 return;
1606
a0d0e21e 1607 while (cxstack_ix > cxix) {
b0d9ce38 1608 SV *sv;
06b5626a 1609 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1c98cc53 1610 DEBUG_CX("UNWIND"); \
a0d0e21e 1611 /* Note: we don't need to restore the base context info till the end. */
6b35e009 1612 switch (CxTYPE(cx)) {
c90c0ff4 1613 case CXt_SUBST:
1614 POPSUBST(cx);
1615 continue; /* not break */
a0d0e21e 1616 case CXt_SUB:
b0d9ce38
GS		 1617 POPSUB(cx,sv);
1618 LEAVESUB(sv);
a0d0e21e
LW		 1619 break;
1620 case CXt_EVAL:
1621 POPEVAL(cx);
1622 break;
c6fdafd0 1623 case CXt_LOOP_LAZYIV:
d01136d6 1624 case CXt_LOOP_LAZYSV:
3b719c58
NC		 1625 case CXt_LOOP_FOR:
1626 case CXt_LOOP_PLAIN:
a0d0e21e
LW		 1627 POPLOOP(cx);
1628 break;
0a753a76 1629 case CXt_NULL:
a0d0e21e 1630 break;
7766f137
GS		 1631 case CXt_FORMAT:
1632 POPFORMAT(cx);
1633 break;
a0d0e21e 1634 }
c90c0ff4 1635 cxstack_ix--;
a0d0e21e 1636 }
1b6737cc 1637 PERL_UNUSED_VAR(optype);
a0d0e21e
LW		 1638}
1639
5a844595
GS		 1640void
1641Perl_qerror(pTHX_ SV *err)
1642{
97aff369 1643 dVAR;
7918f24d
NC		 1644
1645 PERL_ARGS_ASSERT_QERROR;
1646
6b2fb389
DM		 1647 if (PL_in_eval) {
1648 if (PL_in_eval & EVAL_KEEPERR) {
ecad31f0
BF		 1649 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1650 SVfARG(err));
6b2fb389
DM		 1651 }
1652 else
1653 sv_catsv(ERRSV, err);
1654 }
5a844595
GS		 1655 else if (PL_errors)
1656 sv_catsv(PL_errors, err);
1657 else
be2597df 1658 Perl_warn(aTHX_ "%"SVf, SVfARG(err));
13765c85
DM		 1659 if (PL_parser)
1660 ++PL_parser->error_count;
5a844595
GS		 1661}
1662
bb4c52e0 1663void
c5df3096 1664Perl_die_unwind(pTHX_ SV *msv)
a0d0e21e 1665{
27da23d5 1666 dVAR;
c5df3096 1667 SV *exceptsv = sv_mortalcopy(msv);
96d9b9cd 1668 U8 in_eval = PL_in_eval;
c5df3096 1669 PERL_ARGS_ASSERT_DIE_UNWIND;
87582a92 1670
96d9b9cd 1671 if (in_eval) {
a0d0e21e 1672 I32 cxix;
a0d0e21e 1673 I32 gimme;
a0d0e21e 1674
22a30693
Z		 1675 /*
1676 * Historically, perl used to set ERRSV ($@) early in the die
1677 * process and rely on it not getting clobbered during unwinding.
1678 * That sucked, because it was liable to get clobbered, so the
1679 * setting of ERRSV used to emit the exception from eval{} has
1680 * been moved to much later, after unwinding (see just before
1681 * JMPENV_JUMP below). However, some modules were relying on the
1682 * early setting, by examining $@ during unwinding to use it as
1683 * a flag indicating whether the current unwinding was caused by
1684 * an exception. It was never a reliable flag for that purpose,
1685 * being totally open to false positives even without actual
1686 * clobberage, but was useful enough for production code to
1687 * semantically rely on it.
1688 *
1689 * We'd like to have a proper introspective interface that
1690 * explicitly describes the reason for whatever unwinding
1691 * operations are currently in progress, so that those modules
1692 * work reliably and $@ isn't further overloaded. But we don't
1693 * have one yet. In its absence, as a stopgap measure, ERRSV is
1694 * now *additionally* set here, before unwinding, to serve as the
1695 * (unreliable) flag that it used to.
1696 *
1697 * This behaviour is temporary, and should be removed when a
1698 * proper way to detect exceptional unwinding has been developed.
1699 * As of 2010-12, the authors of modules relying on the hack
1700 * are aware of the issue, because the modules failed on
1701 * perls 5.13.{1..7} which had late setting of $@ without this
1702 * early-setting hack.
1703 */
1704 if (!(in_eval & EVAL_KEEPERR)) {
1705 SvTEMP_off(exceptsv);
1706 sv_setsv(ERRSV, exceptsv);
1707 }
1708
5a844595
GS		 1709 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1710 && PL_curstackinfo->si_prev)
1711 {
bac4b2ad 1712 dounwind(-1);
d3acc0f7 1713 POPSTACK;
bac4b2ad 1714 }
e336de0d 1715
a0d0e21e
LW		 1716 if (cxix >= 0) {
1717 I32 optype;
b6494f15 1718 SV *namesv;
35a4481c 1719 register PERL_CONTEXT *cx;
901017d6 1720 SV **newsp;
8f89e5a9
Z		 1721 COP *oldcop;
1722 JMPENV *restartjmpenv;
1723 OP *restartop;
a0d0e21e
LW		 1724
1725 if (cxix < cxstack_ix)
1726 dounwind(cxix);
1727
3280af22 1728 POPBLOCK(cx,PL_curpm);
6b35e009 1729 if (CxTYPE(cx) != CXt_EVAL) {
7d0994e0 1730 STRLEN msglen;
96d9b9cd 1731 const char* message = SvPVx_const(exceptsv, msglen);
10edeb5d 1732 PerlIO_write(Perl_error_log, (const char *)"panic: die ", 11);
bf49b057 1733 PerlIO_write(Perl_error_log, message, msglen);
a0d0e21e
LW		 1734 my_exit(1);
1735 }
1736 POPEVAL(cx);
b6494f15 1737 namesv = cx->blk_eval.old_namesv;
8f89e5a9
Z		 1738 oldcop = cx->blk_oldcop;
1739 restartjmpenv = cx->blk_eval.cur_top_env;
1740 restartop = cx->blk_eval.retop;
a0d0e21e
LW		 1741
1742 if (gimme == G_SCALAR)
3280af22
NIS		 1743 *++newsp = &PL_sv_undef;
1744 PL_stack_sp = newsp;
a0d0e21e
LW		 1745
1746 LEAVE;
748a9306 1747
7fb6a879
GS		 1748 /* LEAVE could clobber PL_curcop (see save_re_context())
1749 * XXX it might be better to find a way to avoid messing with
1750 * PL_curcop in save_re_context() instead, but this is a more
1751 * minimal fix --GSAR */
8f89e5a9 1752 PL_curcop = oldcop;
7fb6a879 1753
7a2e2cd6 1754 if (optype == OP_REQUIRE) {
b6494f15 1755 (void)hv_store(GvHVn(PL_incgv),
ecad31f0 1756 SvPVX_const(namesv),
c60dbbc3 1757 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
27bcc0a7 1758 &PL_sv_undef, 0);
27e90453
DM		 1759 /* note that unlike pp_entereval, pp_require isn't
1760 * supposed to trap errors. So now that we've popped the
1761 * EVAL that pp_require pushed, and processed the error
1762 * message, rethrow the error */
ecad31f0
BF		 1763 Perl_croak(aTHX_ "%"SVf"Compilation failed in require",
1764 SVfARG(exceptsv ? exceptsv : newSVpvs_flags("Unknown error\n",
1765 SVs_TEMP)));
7a2e2cd6 1766 }
c5df3096 1767 if (in_eval & EVAL_KEEPERR) {
ecad31f0
BF		 1768 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1769 SVfARG(exceptsv));
96d9b9cd
Z		 1770 }
1771 else {
1772 sv_setsv(ERRSV, exceptsv);
1773 }
8f89e5a9
Z		 1774 PL_restartjmpenv = restartjmpenv;
1775 PL_restartop = restartop;
bb4c52e0
GG		 1776 JMPENV_JUMP(3);
1777 /* NOTREACHED */
a0d0e21e
LW		 1778 }
1779 }
87582a92 1780
96d9b9cd 1781 write_to_stderr(exceptsv);
f86702cc 1782 my_failure_exit();
1783 /* NOTREACHED */
a0d0e21e
LW		 1784}
1785
1786PP(pp_xor)
1787{
97aff369 1788 dVAR; dSP; dPOPTOPssrl;
a0d0e21e
LW		 1789 if (SvTRUE(left) != SvTRUE(right))
1790 RETSETYES;
1791 else
1792 RETSETNO;
1793}
1794
8dff4fc5
BM		 1795/*
1796=for apidoc caller_cx
1797
1798The XSUB-writer's equivalent of L<caller()|perlfunc/caller>. The
1799returned C<PERL_CONTEXT> structure can be interrogated to find all the
1800information returned to Perl by C<caller>. Note that XSUBs don't get a
1801stack frame, so C<caller_cx(0, NULL)> will return information for the
1802immediately-surrounding Perl code.
1803
1804This function skips over the automatic calls to C<&DB::sub> made on the
1805behalf of the debugger. If the stack frame requested was a sub called by
1806C<DB::sub>, the return value will be the frame for the call to
1807C<DB::sub>, since that has the correct line number/etc. for the call
1808site. If I<dbcxp> is non-C<NULL>, it will be set to a pointer to the
1809frame for the sub call itself.
1810
1811=cut
1812*/
1813
1814const PERL_CONTEXT *
1815Perl_caller_cx(pTHX_ I32 count, const PERL_CONTEXT **dbcxp)
a0d0e21e 1816{
a0d0e21e 1817 register I32 cxix = dopoptosub(cxstack_ix);
901017d6
AL		 1818 register const PERL_CONTEXT *cx;
1819 register const PERL_CONTEXT *ccstack = cxstack;
1820 const PERL_SI *top_si = PL_curstackinfo;
27d41816 1821
a0d0e21e 1822 for (;;) {
2c375eb9
GS		 1823 /* we may be in a higher stacklevel, so dig down deeper */
1824 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1825 top_si = top_si->si_prev;
1826 ccstack = top_si->si_cxstack;
1827 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1828 }
8dff4fc5
BM		 1829 if (cxix < 0)
1830 return NULL;
f2a7f298
DG		 1831 /* caller() should not report the automatic calls to &DB::sub */
1832 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
3280af22 1833 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
a0d0e21e
LW		 1834 count++;
1835 if (!count--)
1836 break;
2c375eb9 1837 cxix = dopoptosub_at(ccstack, cxix - 1);
a0d0e21e 1838 }
2c375eb9
GS		 1839
1840 cx = &ccstack[cxix];
8dff4fc5
BM		 1841 if (dbcxp) *dbcxp = cx;
1842
7766f137 1843 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
f54cb97a 1844 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
2c375eb9 1845 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
06a5b730 1846 field below is defined for any cx. */
f2a7f298
DG		 1847 /* caller() should not report the automatic calls to &DB::sub */
1848 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
2c375eb9 1849 cx = &ccstack[dbcxix];
06a5b730 1850 }
1851
8dff4fc5
BM		 1852 return cx;
1853}
1854
1855PP(pp_caller)
1856{
1857 dVAR;
1858 dSP;
1859 register const PERL_CONTEXT *cx;
1860 const PERL_CONTEXT *dbcx;
1861 I32 gimme;
d527ce7c 1862 const HEK *stash_hek;
8dff4fc5 1863 I32 count = 0;
ce0b554b 1864 bool has_arg = MAXARG && TOPs;
8dff4fc5 1865
ce0b554b
FC		 1866 if (MAXARG) {
1867 if (has_arg)
8dff4fc5 1868 count = POPi;
ce0b554b
FC		 1869 else (void)POPs;
1870 }
8dff4fc5 1871
ce0b554b 1872 cx = caller_cx(count + !!(PL_op->op_private & OPpOFFBYONE), &dbcx);
8dff4fc5
BM		 1873 if (!cx) {
1874 if (GIMME != G_ARRAY) {
1875 EXTEND(SP, 1);
1876 RETPUSHUNDEF;
1877 }
1878 RETURN;
1879 }
1880
d527ce7c 1881 stash_hek = HvNAME_HEK((HV*)CopSTASH(cx->blk_oldcop));
a0d0e21e 1882 if (GIMME != G_ARRAY) {
27d41816 1883 EXTEND(SP, 1);
d527ce7c 1884 if (!stash_hek)
3280af22 1885 PUSHs(&PL_sv_undef);
49d8d3a1
MB		 1886 else {
1887 dTARGET;
d527ce7c 1888 sv_sethek(TARG, stash_hek);
49d8d3a1
MB		 1889 PUSHs(TARG);
1890 }
a0d0e21e
LW		 1891 RETURN;
1892 }
a0d0e21e 1893
b3ca2e83 1894 EXTEND(SP, 11);
27d41816 1895
d527ce7c 1896 if (!stash_hek)
3280af22 1897 PUSHs(&PL_sv_undef);
d527ce7c
BF		 1898 else {
1899 dTARGET;
1900 sv_sethek(TARG, stash_hek);
1901 PUSHTARG;
1902 }
6e449a3a
MHM		 1903 mPUSHs(newSVpv(OutCopFILE(cx->blk_oldcop), 0));
1904 mPUSHi((I32)CopLINE(cx->blk_oldcop));
ce0b554b 1905 if (!has_arg)
a0d0e21e 1906 RETURN;
7766f137 1907 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
8dff4fc5 1908 GV * const cvgv = CvGV(dbcx->blk_sub.cv);
7766f137 1909 /* So is ccstack[dbcxix]. */
07b8c804 1910 if (isGV(cvgv)) {
561b68a9 1911 SV * const sv = newSV(0);
c445ea15 1912 gv_efullname3(sv, cvgv, NULL);
6e449a3a 1913 mPUSHs(sv);
bf38a478 1914 PUSHs(boolSV(CxHASARGS(cx)));
07b8c804
RGS		 1915 }
1916 else {
84bafc02 1917 PUSHs(newSVpvs_flags("(unknown)", SVs_TEMP));
bf38a478 1918 PUSHs(boolSV(CxHASARGS(cx)));
07b8c804 1919 }
a0d0e21e
LW		 1920 }
1921 else {
84bafc02 1922 PUSHs(newSVpvs_flags("(eval)", SVs_TEMP));
6e449a3a 1923 mPUSHi(0);
a0d0e21e 1924 }
54310121 1925 gimme = (I32)cx->blk_gimme;
1926 if (gimme == G_VOID)
3280af22 1927 PUSHs(&PL_sv_undef);
54310121 1928 else
98625aca 1929 PUSHs(boolSV((gimme & G_WANT) == G_ARRAY));
6b35e009 1930 if (CxTYPE(cx) == CXt_EVAL) {
811a4de9 1931 /* eval STRING */
85a64632 1932 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
4633a7c4 1933 PUSHs(cx->blk_eval.cur_text);
3280af22 1934 PUSHs(&PL_sv_no);
0f79a09d 1935 }
811a4de9 1936 /* require */
0f79a09d 1937 else if (cx->blk_eval.old_namesv) {
6e449a3a 1938 mPUSHs(newSVsv(cx->blk_eval.old_namesv));
3280af22 1939 PUSHs(&PL_sv_yes);
06a5b730 1940 }
811a4de9
GS		 1941 /* eval BLOCK (try blocks have old_namesv == 0) */
1942 else {
1943 PUSHs(&PL_sv_undef);
1944 PUSHs(&PL_sv_undef);
1945 }
4633a7c4 1946 }
a682de96
GS		 1947 else {
1948 PUSHs(&PL_sv_undef);
1949 PUSHs(&PL_sv_undef);
1950 }
bafb2adc 1951 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)
ed094faf 1952 && CopSTASH_eq(PL_curcop, PL_debstash))
4633a7c4 1953 {
66a1b24b
AL		 1954 AV * const ary = cx->blk_sub.argarray;
1955 const int off = AvARRAY(ary) - AvALLOC(ary);
a0d0e21e 1956
e1a80902 1957 Perl_init_dbargs(aTHX);
a0d0e21e 1958
3280af22
NIS		 1959 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1960 av_extend(PL_dbargs, AvFILLp(ary) + off);
1961 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1962 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
a0d0e21e 1963 }
f3aa04c2
GS		 1964 /* XXX only hints propagated via op_private are currently
1965 * visible (others are not easily accessible, since they
1966 * use the global PL_hints) */
6e449a3a 1967 mPUSHi(CopHINTS_get(cx->blk_oldcop));
e476b1b5
GS		 1968 {
1969 SV * mask ;
72dc9ed5 1970 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
114bafba 1971
ac27b0f5 1972 if (old_warnings == pWARN_NONE ||
114bafba 1973 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
e476b1b5 1974 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
ac27b0f5 1975 else if (old_warnings == pWARN_ALL ||
75b6c4ca
RGS		 1976 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1977 /* Get the bit mask for $warnings::Bits{all}, because
1978 * it could have been extended by warnings::register */
1979 SV **bits_all;
6673a63c 1980 HV * const bits = get_hv("warnings::Bits", 0);
017a3ce5 1981 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
75b6c4ca
RGS		 1982 mask = newSVsv(*bits_all);
1983 }
1984 else {
1985 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1986 }
1987 }
e476b1b5 1988 else
72dc9ed5 1989 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
6e449a3a 1990 mPUSHs(mask);
e476b1b5 1991 }
b3ca2e83 1992
c28fe1ec 1993 PUSHs(cx->blk_oldcop->cop_hints_hash ?
20439bc7 1994 sv_2mortal(newRV_noinc(MUTABLE_SV(cop_hints_2hv(cx->blk_oldcop, 0))))
b3ca2e83 1995 : &PL_sv_undef);
a0d0e21e
LW		 1996 RETURN;
1997}
1998
a0d0e21e
LW		 1999PP(pp_reset)
2000{
97aff369 2001 dVAR;
39644a26 2002 dSP;
f650fa72
FC		 2003 const char * const tmps =
2004 (MAXARG < 1 || (!TOPs && !POPs)) ? (const char *)"" : POPpconstx;
11faa288 2005 sv_reset(tmps, CopSTASH(PL_curcop));
3280af22 2006 PUSHs(&PL_sv_yes);
a0d0e21e
LW		 2007 RETURN;
2008}
2009
dd2155a4
DM		 2010/* like pp_nextstate, but used instead when the debugger is active */
2011
a0d0e21e
LW		 2012PP(pp_dbstate)
2013{
27da23d5 2014 dVAR;
533c011a 2015 PL_curcop = (COP*)PL_op;
a0d0e21e 2016 TAINT_NOT; /* Each statement is presumed innocent */
3280af22 2017 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
a0d0e21e
LW		 2018 FREETMPS;
2019
f410a211
NC		 2020 PERL_ASYNC_CHECK();
2021
5df8de69
DM		 2022 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
2023 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
a0d0e21e 2024 {
39644a26 2025 dSP;
c09156bb 2026 register PERL_CONTEXT *cx;
f54cb97a 2027 const I32 gimme = G_ARRAY;
eb160463 2028 U8 hasargs;
0bd48802
AL		 2029 GV * const gv = PL_DBgv;
2030 register CV * const cv = GvCV(gv);
a0d0e21e 2031
a0d0e21e 2032 if (!cv)
cea2e8a9 2033 DIE(aTHX_ "No DB::DB routine defined");
a0d0e21e 2034
aea4f609
DM		 2035 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
2036 /* don't do recursive DB::DB call */
a0d0e21e 2037 return NORMAL;
748a9306 2038
a57c6685 2039 ENTER;
4633a7c4
LW		 2040 SAVETMPS;
2041
3280af22 2042 SAVEI32(PL_debug);
55497cff 2043 SAVESTACK_POS();
3280af22 2044 PL_debug = 0;
748a9306 2045 hasargs = 0;
924508f0 2046 SPAGAIN;
748a9306 2047
aed2304a 2048 if (CvISXSUB(cv)) {
c127bd3a
SF		 2049 CvDEPTH(cv)++;
2050 PUSHMARK(SP);
2051 (void)(*CvXSUB(cv))(aTHX_ cv);
2052 CvDEPTH(cv)--;
2053 FREETMPS;
a57c6685 2054 LEAVE;
c127bd3a
SF		 2055 return NORMAL;
2056 }
2057 else {
2058 PUSHBLOCK(cx, CXt_SUB, SP);
2059 PUSHSUB_DB(cx);
2060 cx->blk_sub.retop = PL_op->op_next;
2061 CvDEPTH(cv)++;
2062 SAVECOMPPAD();
2063 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), 1);
2064 RETURNOP(CvSTART(cv));
2065 }
a0d0e21e
LW		 2066 }
2067 else
2068 return NORMAL;
2069}
2070
b9d76716
VP		 2071STATIC SV **
2072S_adjust_stack_on_leave(pTHX_ SV **newsp, SV **sp, SV **mark, I32 gimme, U32 flags)
2073{
9a214eec 2074 bool padtmp = 0;
b9d76716
VP		 2075 PERL_ARGS_ASSERT_ADJUST_STACK_ON_LEAVE;
2076
9a214eec
DM		 2077 if (flags & SVs_PADTMP) {
2078 flags &= ~SVs_PADTMP;
2079 padtmp = 1;
2080 }
b9d76716
VP		 2081 if (gimme == G_SCALAR) {
2082 if (MARK < SP)
9a214eec
DM		 2083 *++newsp = ((SvFLAGS(*SP) & flags) || (padtmp && SvPADTMP(*SP)))
2084 ? *SP : sv_mortalcopy(*SP);
b9d76716
VP		 2085 else {
2086 /* MEXTEND() only updates MARK, so reuse it instead of newsp. */
2087 MARK = newsp;
2088 MEXTEND(MARK, 1);
2089 *++MARK = &PL_sv_undef;
2090 return MARK;
2091 }
2092 }
2093 else if (gimme == G_ARRAY) {
2094 /* in case LEAVE wipes old return values */
2095 while (++MARK <= SP) {
9a214eec 2096 if ((SvFLAGS(*MARK) & flags) || (padtmp && SvPADTMP(*MARK)))
b9d76716
VP		 2097 *++newsp = *MARK;
2098 else {
2099 *++newsp = sv_mortalcopy(*MARK);
2100 TAINT_NOT; /* Each item is independent */
2101 }
2102 }
2103 /* When this function was called with MARK == newsp, we reach this
2104 * point with SP == newsp. */
2105 }
2106
2107 return newsp;
2108}
2109
2b9a6457
VP		 2110PP(pp_enter)
2111{
2112 dVAR; dSP;
2113 register PERL_CONTEXT *cx;
7c2d9d03 2114 I32 gimme = GIMME_V;
2b9a6457
VP		 2115
2116 ENTER_with_name("block");
2117
2118 SAVETMPS;
2119 PUSHBLOCK(cx, CXt_BLOCK, SP);
2120
2121 RETURN;
2122}
2123
2124PP(pp_leave)
2125{
2126 dVAR; dSP;
2127 register PERL_CONTEXT *cx;
2128 SV **newsp;
2129 PMOP *newpm;
2130 I32 gimme;
2131
2132 if (PL_op->op_flags & OPf_SPECIAL) {
2133 cx = &cxstack[cxstack_ix];
2134 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
2135 }
2136
2137 POPBLOCK(cx,newpm);
2138
2139 gimme = OP_GIMME(PL_op, (cxstack_ix >= 0) ? gimme : G_SCALAR);
2140
2141 TAINT_NOT;
f02ea43c 2142 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
2b9a6457
VP		 2143 PL_curpm = newpm; /* Don't pop $1 et al till now */
2144
2145 LEAVE_with_name("block");
2146
2147 RETURN;
2148}
2149
a0d0e21e
LW		 2150PP(pp_enteriter)
2151{
27da23d5 2152 dVAR; dSP; dMARK;
c09156bb 2153 register PERL_CONTEXT *cx;
f54cb97a 2154 const I32 gimme = GIMME_V;
df530c37 2155 void *itervar; /* location of the iteration variable */
840fe433 2156 U8 cxtype = CXt_LOOP_FOR;
a0d0e21e 2157
d343c3ef 2158 ENTER_with_name("loop1");
4633a7c4
LW		 2159 SAVETMPS;
2160
aafca525
DM		 2161 if (PL_op->op_targ) { /* "my" variable */
2162 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
14f338dc
DM		 2163 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
2164 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
2165 SVs_PADSTALE, SVs_PADSTALE);
2166 }
09edbca0 2167 SAVEPADSVANDMORTALIZE(PL_op->op_targ);
89e00a7c 2168#ifdef USE_ITHREADS
df530c37 2169 itervar = PL_comppad;
89e00a7c 2170#else
aafca525 2171 itervar = &PAD_SVl(PL_op->op_targ);
7766f137 2172#endif
54b9620d 2173 }
aafca525 2174 else { /* symbol table variable */
159b6efe 2175 GV * const gv = MUTABLE_GV(POPs);
f83b46a0
DM		 2176 SV** svp = &GvSV(gv);
2177 save_pushptrptr(gv, SvREFCNT_inc(*svp), SAVEt_GVSV);
561b68a9 2178 *svp = newSV(0);
df530c37 2179 itervar = (void *)gv;
54b9620d 2180 }
4633a7c4 2181
0d863452
RH		 2182 if (PL_op->op_private & OPpITER_DEF)
2183 cxtype |= CXp_FOR_DEF;
2184
d343c3ef 2185 ENTER_with_name("loop2");
a0d0e21e 2186
7766f137 2187 PUSHBLOCK(cx, cxtype, SP);
df530c37 2188 PUSHLOOP_FOR(cx, itervar, MARK);
533c011a 2189 if (PL_op->op_flags & OPf_STACKED) {
d01136d6
BS		 2190 SV *maybe_ary = POPs;
2191 if (SvTYPE(maybe_ary) != SVt_PVAV) {
89ea2908 2192 dPOPss;
d01136d6 2193 SV * const right = maybe_ary;
984a4bea
RD		 2194 SvGETMAGIC(sv);
2195 SvGETMAGIC(right);
4fe3f0fa 2196 if (RANGE_IS_NUMERIC(sv,right)) {
d01136d6 2197 cx->cx_type &= ~CXTYPEMASK;
c6fdafd0
NC		 2198 cx->cx_type |= CXt_LOOP_LAZYIV;
2199 /* Make sure that no-one re-orders cop.h and breaks our
2200 assumptions */
2201 assert(CxTYPE(cx) == CXt_LOOP_LAZYIV);
a2309040 2202#ifdef NV_PRESERVES_UV
f52e41ad
FC		 2203 if ((SvOK(sv) && ((SvNV_nomg(sv) < (NV)IV_MIN) ||
2204 (SvNV_nomg(sv) > (NV)IV_MAX)))
a2309040 2205 ||
f52e41ad
FC		 2206 (SvOK(right) && ((SvNV_nomg(right) > (NV)IV_MAX) ||
2207 (SvNV_nomg(right) < (NV)IV_MIN))))
a2309040 2208#else
f52e41ad 2209 if ((SvOK(sv) && ((SvNV_nomg(sv) <= (NV)IV_MIN)
a2309040 2210 ||
f52e41ad
FC		 2211 ((SvNV_nomg(sv) > 0) &&
2212 ((SvUV_nomg(sv) > (UV)IV_MAX) ||
2213 (SvNV_nomg(sv) > (NV)UV_MAX)))))
a2309040 2214 ||
f52e41ad 2215 (SvOK(right) && ((SvNV_nomg(right) <= (NV)IV_MIN)
a2309040 2216 ||
f52e41ad
FC		 2217 ((SvNV_nomg(right) > 0) &&
2218 ((SvUV_nomg(right) > (UV)IV_MAX) ||
2219 (SvNV_nomg(right) > (NV)UV_MAX))
2220 ))))
a2309040 2221#endif
076d9a11 2222 DIE(aTHX_ "Range iterator outside integer range");
f52e41ad
FC		 2223 cx->blk_loop.state_u.lazyiv.cur = SvIV_nomg(sv);
2224 cx->blk_loop.state_u.lazyiv.end = SvIV_nomg(right);
d4665a05
DM		 2225#ifdef DEBUGGING
2226 /* for correct -Dstv display */
2227 cx->blk_oldsp = sp - PL_stack_base;
2228#endif
89ea2908 2229 }
3f63a782 2230 else {
d01136d6
BS		 2231 cx->cx_type &= ~CXTYPEMASK;
2232 cx->cx_type |= CXt_LOOP_LAZYSV;
2233 /* Make sure that no-one re-orders cop.h and breaks our
2234 assumptions */
2235 assert(CxTYPE(cx) == CXt_LOOP_LAZYSV);
2236 cx->blk_loop.state_u.lazysv.cur = newSVsv(sv);
2237 cx->blk_loop.state_u.lazysv.end = right;
2238 SvREFCNT_inc(right);
2239 (void) SvPV_force_nolen(cx->blk_loop.state_u.lazysv.cur);
267cc4a8
NC		 2240 /* This will do the upgrade to SVt_PV, and warn if the value
2241 is uninitialised. */
10516c54 2242 (void) SvPV_nolen_const(right);
267cc4a8
NC		 2243 /* Doing this avoids a check every time in pp_iter in pp_hot.c
2244 to replace !SvOK() with a pointer to "". */
2245 if (!SvOK(right)) {
2246 SvREFCNT_dec(right);
d01136d6 2247 cx->blk_loop.state_u.lazysv.end = &PL_sv_no;
267cc4a8 2248 }
3f63a782 2249 }
89ea2908 2250 }
d01136d6 2251 else /* SvTYPE(maybe_ary) == SVt_PVAV */ {
502c6561 2252 cx->blk_loop.state_u.ary.ary = MUTABLE_AV(maybe_ary);
d01136d6
BS		 2253 SvREFCNT_inc(maybe_ary);
2254 cx->blk_loop.state_u.ary.ix =
2255 (PL_op->op_private & OPpITER_REVERSED) ?
2256 AvFILL(cx->blk_loop.state_u.ary.ary) + 1 :
2257 -1;
ef3e5ea9 2258 }
89ea2908 2259 }
d01136d6
BS		 2260 else { /* iterating over items on the stack */
2261 cx->blk_loop.state_u.ary.ary = NULL; /* means to use the stack */
ef3e5ea9 2262 if (PL_op->op_private & OPpITER_REVERSED) {
d01136d6 2263 cx->blk_loop.state_u.ary.ix = cx->blk_oldsp + 1;
ef3e5ea9
NC		 2264 }
2265 else {
d01136d6 2266 cx->blk_loop.state_u.ary.ix = MARK - PL_stack_base;
ef3e5ea9 2267 }
4633a7c4 2268 }
a0d0e21e
LW		 2269
2270 RETURN;
2271}
2272
2273PP(pp_enterloop)
2274{
27da23d5 2275 dVAR; dSP;
c09156bb 2276 register PERL_CONTEXT *cx;
f54cb97a 2277 const I32 gimme = GIMME_V;
a0d0e21e 2278
d343c3ef 2279 ENTER_with_name("loop1");
a0d0e21e 2280 SAVETMPS;
d343c3ef 2281 ENTER_with_name("loop2");
a0d0e21e 2282
3b719c58
NC		 2283 PUSHBLOCK(cx, CXt_LOOP_PLAIN, SP);
2284 PUSHLOOP_PLAIN(cx, SP);
a0d0e21e
LW		 2285
2286 RETURN;
2287}
2288
2289PP(pp_leaveloop)
2290{
27da23d5 2291 dVAR; dSP;
c09156bb 2292 register PERL_CONTEXT *cx;
a0d0e21e
LW		 2293 I32 gimme;
2294 SV **newsp;
2295 PMOP *newpm;
2296 SV **mark;
2297
2298 POPBLOCK(cx,newpm);
3b719c58 2299 assert(CxTYPE_is_LOOP(cx));
4fdae800 2300 mark = newsp;
a8bba7fa 2301 newsp = PL_stack_base + cx->blk_loop.resetsp;
f86702cc 2302
a1f49e72 2303 TAINT_NOT;
b9d76716 2304 SP = adjust_stack_on_leave(newsp, SP, MARK, gimme, 0);
f86702cc 2305 PUTBACK;
2306
a8bba7fa 2307 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
3280af22 2308 PL_curpm = newpm; /* ... and pop $1 et al */
f86702cc 2309
d343c3ef
GG		 2310 LEAVE_with_name("loop2");
2311 LEAVE_with_name("loop1");
a0d0e21e 2312
f86702cc 2313 return NORMAL;
a0d0e21e
LW		 2314}
2315
3bdf583b
FC		 2316STATIC void
2317S_return_lvalues(pTHX_ SV **mark, SV **sp, SV **newsp, I32 gimme,
d25b0d7b 2318 PERL_CONTEXT *cx, PMOP *newpm)
3bdf583b 2319{
80422e24 2320 const bool ref = !!(CxLVAL(cx) & OPpENTERSUB_INARGS);
3bdf583b 2321 if (gimme == G_SCALAR) {
d25b0d7b
FC		 2322 if (CxLVAL(cx) && !ref) { /* Leave it as it is if we can. */
2323 SV *sv;
001de122 2324 const char *what = NULL;
d25b0d7b
FC		 2325 if (MARK < SP) {
2326 assert(MARK+1 == SP);
2327 if ((SvPADTMP(TOPs) ||
2328 (SvFLAGS(TOPs) & (SVf_READONLY | SVf_FAKE))
2329 == SVf_READONLY
2330 ) &&
2331 !SvSMAGICAL(TOPs)) {
001de122 2332 what =
d25b0d7b 2333 SvREADONLY(TOPs) ? (TOPs == &PL_sv_undef) ? "undef"
001de122 2334 : "a readonly value" : "a temporary";
d25b0d7b 2335 }
001de122 2336 else goto copy_sv;
d25b0d7b
FC		 2337 }
2338 else {
2339 /* sub:lvalue{} will take us here. */
001de122 2340 what = "undef";
d25b0d7b 2341 }
001de122
FC		 2342 LEAVE;
2343 cxstack_ix--;
2344 POPSUB(cx,sv);
2345 PL_curpm = newpm;
2346 LEAVESUB(sv);
2347 Perl_croak(aTHX_
2348 "Can't return %s from lvalue subroutine", what
2349 );
d25b0d7b 2350 }
93905212 2351 if (MARK < SP) {
a5ad7a5a 2352 copy_sv:
3bdf583b
FC		 2353 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2354 *++newsp = SvREFCNT_inc(*SP);
2355 FREETMPS;
2356 sv_2mortal(*newsp);
2357 }
2358 else
e08be60b 2359 *++newsp =
e08be60b
FC		 2360 !SvTEMP(*SP)
2361 ? sv_2mortal(SvREFCNT_inc_simple_NN(*SP))
2362 : *SP;
3bdf583b 2363 }
0d235c77
FC		 2364 else {
2365 EXTEND(newsp,1);
3bdf583b 2366 *++newsp = &PL_sv_undef;
0d235c77 2367 }
0e9700df 2368 if (CxLVAL(cx) & OPpDEREF) {
767eda44
FC		 2369 SvGETMAGIC(TOPs);
2370 if (!SvOK(TOPs)) {
0e9700df 2371 TOPs = vivify_ref(TOPs, CxLVAL(cx) & OPpDEREF);
767eda44
FC		 2372 }
2373 }
3bdf583b
FC		 2374 }
2375 else if (gimme == G_ARRAY) {
0e9700df 2376 assert (!(CxLVAL(cx) & OPpDEREF));
80422e24 2377 if (ref || !CxLVAL(cx))
e08be60b
FC		 2378 while (++MARK <= SP)
2379 *++newsp =
2380 SvTEMP(*MARK)
2381 ? *MARK
80422e24
FC		 2382 : ref && SvFLAGS(*MARK) & SVs_PADTMP
2383 ? sv_mortalcopy(*MARK)
2384 : sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
e08be60b 2385 else while (++MARK <= SP) {
d25b0d7b
FC		 2386 if (*MARK != &PL_sv_undef
2387 && (SvPADTMP(*MARK)
2388 || (SvFLAGS(*MARK) & (SVf_READONLY|SVf_FAKE))
2389 == SVf_READONLY
2390 )
2391 ) {
2392 SV *sv;
2393 /* Might be flattened array after $#array = */
2394 PUTBACK;
2395 LEAVE;
2396 cxstack_ix--;
2397 POPSUB(cx,sv);
2398 PL_curpm = newpm;
2399 LEAVESUB(sv);
2400 Perl_croak(aTHX_
2401 "Can't return a %s from lvalue subroutine",
2402 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2403 }
2404 else
4bee03f8
FC		 2405 *++newsp =
2406 SvTEMP(*MARK)
2407 ? *MARK
2408 : sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
3bdf583b
FC		 2409 }
2410 }
2411 PL_stack_sp = newsp;
2412}
2413
a0d0e21e
LW		 2414PP(pp_return)
2415{
27da23d5 2416 dVAR; dSP; dMARK;
c09156bb 2417 register PERL_CONTEXT *cx;
f86702cc 2418 bool popsub2 = FALSE;
b45de488 2419 bool clear_errsv = FALSE;
fa1e92c4 2420 bool lval = FALSE;
a0d0e21e
LW		 2421 I32 gimme;
2422 SV **newsp;
2423 PMOP *newpm;
2424 I32 optype = 0;
b6494f15 2425 SV *namesv;
b0d9ce38 2426 SV *sv;
b263a1ad 2427 OP *retop = NULL;
a0d0e21e 2428
0bd48802
AL		 2429 const I32 cxix = dopoptosub(cxstack_ix);
2430
9850bf21
RH		 2431 if (cxix < 0) {
2432 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
2433 * sort block, which is a CXt_NULL
2434 * not a CXt_SUB */
2435 dounwind(0);
d7507f74
RH		 2436 PL_stack_base[1] = *PL_stack_sp;
2437 PL_stack_sp = PL_stack_base + 1;
a0d0e21e
LW		 2438 return 0;
2439 }
9850bf21
RH		 2440 else
2441 DIE(aTHX_ "Can't return outside a subroutine");
a0d0e21e 2442 }
a0d0e21e
LW		 2443 if (cxix < cxstack_ix)
2444 dounwind(cxix);
2445
d7507f74
RH		 2446 if (CxMULTICALL(&cxstack[cxix])) {
2447 gimme = cxstack[cxix].blk_gimme;
2448 if (gimme == G_VOID)
2449 PL_stack_sp = PL_stack_base;
2450 else if (gimme == G_SCALAR) {
2451 PL_stack_base[1] = *PL_stack_sp;
2452 PL_stack_sp = PL_stack_base + 1;
2453 }
9850bf21 2454 return 0;
d7507f74 2455 }
9850bf21 2456
a0d0e21e 2457 POPBLOCK(cx,newpm);
6b35e009 2458 switch (CxTYPE(cx)) {
a0d0e21e 2459 case CXt_SUB:
f86702cc 2460 popsub2 = TRUE;
fa1e92c4 2461 lval = !!CvLVALUE(cx->blk_sub.cv);
f39bc417 2462 retop = cx->blk_sub.retop;
5dd42e15 2463 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
a0d0e21e
LW		 2464 break;
2465 case CXt_EVAL:
b45de488
GS		 2466 if (!(PL_in_eval & EVAL_KEEPERR))
2467 clear_errsv = TRUE;
a0d0e21e 2468 POPEVAL(cx);
b6494f15 2469 namesv = cx->blk_eval.old_namesv;
f39bc417 2470 retop = cx->blk_eval.retop;
1d76a5c3
GS		 2471 if (CxTRYBLOCK(cx))
2472 break;
748a9306
LW		 2473 if (optype == OP_REQUIRE &&
2474 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
2475 {
54310121 2476 /* Unassume the success we assumed earlier. */
b6494f15 2477 (void)hv_delete(GvHVn(PL_incgv),
ecad31f0 2478 SvPVX_const(namesv),
c60dbbc3 2479 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
b6494f15
VP		 2480 G_DISCARD);
2481 DIE(aTHX_ "%"SVf" did not return a true value", SVfARG(namesv));
748a9306 2482 }
a0d0e21e 2483 break;
7766f137
GS		 2484 case CXt_FORMAT:
2485 POPFORMAT(cx);
f39bc417 2486 retop = cx->blk_sub.retop;
7766f137 2487 break;
a0d0e21e 2488 default:
cea2e8a9 2489 DIE(aTHX_ "panic: return");
a0d0e21e
LW		 2490 }
2491
a1f49e72 2492 TAINT_NOT;
d25b0d7b 2493 if (lval) S_return_lvalues(aTHX_ MARK, SP, newsp, gimme, cx, newpm);
3bdf583b
FC		 2494 else {
2495 if (gimme == G_SCALAR) {
a29cdaf0
IZ		 2496 if (MARK < SP) {
2497 if (popsub2) {
a8bba7fa 2498 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
3ed94dc0 2499 if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1) {
a29cdaf0
IZ		 2500 *++newsp = SvREFCNT_inc(*SP);
2501 FREETMPS;
2502 sv_2mortal(*newsp);
959e3673
GS		 2503 }
2504 else {
2505 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
a29cdaf0 2506 FREETMPS;
959e3673
GS		 2507 *++newsp = sv_mortalcopy(sv);
2508 SvREFCNT_dec(sv);
a29cdaf0 2509 }
959e3673 2510 }
3ed94dc0 2511 else if (SvTEMP(*SP) && SvREFCNT(*SP) == 1) {
767eda44 2512 *++newsp = *SP;
767eda44 2513 }
959e3673 2514 else
767eda44 2515 *++newsp = sv_mortalcopy(*SP);
959e3673
GS		 2516 }
2517 else
a29cdaf0 2518 *++newsp = sv_mortalcopy(*SP);
959e3673
GS		 2519 }
2520 else
3280af22 2521 *++newsp = &PL_sv_undef;
3bdf583b
FC		 2522 }
2523 else if (gimme == G_ARRAY) {
a1f49e72 2524 while (++MARK <= SP) {
3ed94dc0 2525 *++newsp = popsub2 && SvTEMP(*MARK) && SvREFCNT(*MARK) == 1
f86702cc 2526 ? *MARK : sv_mortalcopy(*MARK);
a1f49e72
CS		 2527 TAINT_NOT; /* Each item is independent */
2528 }
3bdf583b
FC		 2529 }
2530 PL_stack_sp = newsp;
a0d0e21e 2531 }
a0d0e21e 2532
5dd42e15 2533 LEAVE;
f86702cc 2534 /* Stack values are safe: */
2535 if (popsub2) {
5dd42e15 2536 cxstack_ix--;
b0d9ce38 2537 POPSUB(cx,sv); /* release CV and @_ ... */
f86702cc 2538 }
b0d9ce38 2539 else
c445ea15 2540 sv = NULL;
3280af22 2541 PL_curpm = newpm; /* ... and pop $1 et al */
f86702cc 2542
b0d9ce38 2543 LEAVESUB(sv);
8433848b 2544 if (clear_errsv) {
ab69dbc2 2545 CLEAR_ERRSV();
8433848b 2546 }
f39bc417 2547 return retop;
a0d0e21e
LW		 2548}
2549
4f443c3d
FC		 2550/* This duplicates parts of pp_leavesub, so that it can share code with
2551 * pp_return */
2552PP(pp_leavesublv)
2553{
2554 dVAR; dSP;
4f443c3d
FC		 2555 SV **newsp;
2556 PMOP *newpm;
2557 I32 gimme;
2558 register PERL_CONTEXT *cx;
2559 SV *sv;
2560
2561 if (CxMULTICALL(&cxstack[cxstack_ix]))
2562 return 0;
2563
2564 POPBLOCK(cx,newpm);
2565 cxstack_ix++; /* temporarily protect top context */
4f443c3d
FC		 2566
2567 TAINT_NOT;
2568
0d235c77 2569 S_return_lvalues(aTHX_ newsp, SP, newsp, gimme, cx, newpm);
4f443c3d
FC		 2570
2571 LEAVE;
2572 cxstack_ix--;
2573 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2574 PL_curpm = newpm; /* ... and pop $1 et al */
2575
2576 LEAVESUB(sv);
2577 return cx->blk_sub.retop;
2578}
2579
a0d0e21e
LW		 2580PP(pp_last)
2581{
27da23d5 2582 dVAR; dSP;
a0d0e21e 2583 I32 cxix;
c09156bb 2584 register PERL_CONTEXT *cx;
f86702cc 2585 I32 pop2 = 0;
a0d0e21e 2586 I32 gimme;
8772537c 2587 I32 optype;
b263a1ad 2588 OP *nextop = NULL;
a0d0e21e
LW		 2589 SV **newsp;
2590 PMOP *newpm;
a8bba7fa 2591 SV **mark;
c445ea15 2592 SV *sv = NULL;
9d4ba2ae 2593
a0d0e21e 2594
533c011a 2595 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e
LW		 2596 cxix = dopoptoloop(cxstack_ix);
2597 if (cxix < 0)
a651a37d 2598 DIE(aTHX_ "Can't \"last\" outside a loop block");
a0d0e21e
LW		 2599 }
2600 else {
2601 cxix = dopoptolabel(cPVOP->op_pv);
2602 if (cxix < 0)
cea2e8a9 2603 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
a0d0e21e
LW		 2604 }
2605 if (cxix < cxstack_ix)
2606 dounwind(cxix);
2607
2608 POPBLOCK(cx,newpm);
5dd42e15 2609 cxstack_ix++; /* temporarily protect top context */
a8bba7fa 2610 mark = newsp;
6b35e009 2611 switch (CxTYPE(cx)) {
c6fdafd0 2612 case CXt_LOOP_LAZYIV:
d01136d6 2613 case CXt_LOOP_LAZYSV:
3b719c58
NC		 2614 case CXt_LOOP_FOR:
2615 case CXt_LOOP_PLAIN:
2616 pop2 = CxTYPE(cx);
a8bba7fa 2617 newsp = PL_stack_base + cx->blk_loop.resetsp;
022eaa24 2618 nextop = cx->blk_loop.my_op->op_lastop->op_next;
a0d0e21e 2619 break;
f86702cc 2620 case CXt_SUB:
f86702cc 2621 pop2 = CXt_SUB;
f39bc417 2622 nextop = cx->blk_sub.retop;
a0d0e21e 2623 break;
f86702cc 2624 case CXt_EVAL:
2625 POPEVAL(cx);
f39bc417 2626 nextop = cx->blk_eval.retop;
a0d0e21e 2627 break;
7766f137
GS		 2628 case CXt_FORMAT:
2629 POPFORMAT(cx);
f39bc417 2630 nextop = cx->blk_sub.retop;
7766f137 2631 break;
a0d0e21e 2632 default:
cea2e8a9 2633 DIE(aTHX_ "panic: last");
a0d0e21e
LW		 2634 }
2635
a1f49e72 2636 TAINT_NOT;
b9d76716
VP		 2637 SP = adjust_stack_on_leave(newsp, SP, MARK, gimme,
2638 pop2 == CXt_SUB ? SVs_TEMP : 0);
f86702cc 2639 PUTBACK;
2640
5dd42e15
DM		 2641 LEAVE;
2642 cxstack_ix--;
f86702cc 2643 /* Stack values are safe: */
2644 switch (pop2) {
c6fdafd0 2645 case CXt_LOOP_LAZYIV:
3b719c58 2646 case CXt_LOOP_PLAIN:
d01136d6 2647 case CXt_LOOP_LAZYSV:
3b719c58 2648 case CXt_LOOP_FOR:
a8bba7fa 2649 POPLOOP(cx); /* release loop vars ... */
4fdae800 2650 LEAVE;
f86702cc 2651 break;
2652 case CXt_SUB:
b0d9ce38 2653 POPSUB(cx,sv); /* release CV and @_ ... */
f86702cc 2654 break;
a0d0e21e 2655 }
3280af22 2656 PL_curpm = newpm; /* ... and pop $1 et al */
a0d0e21e 2657
b0d9ce38 2658 LEAVESUB(sv);
9d4ba2ae
AL		 2659 PERL_UNUSED_VAR(optype);
2660 PERL_UNUSED_VAR(gimme);
f86702cc 2661 return nextop;
a0d0e21e
LW		 2662}
2663
2664PP(pp_next)
2665{
27da23d5 2666 dVAR;
a0d0e21e 2667 I32 cxix;
c09156bb 2668 register PERL_CONTEXT *cx;
85538317 2669 I32 inner;
a0d0e21e 2670
533c011a 2671 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e
LW		 2672 cxix = dopoptoloop(cxstack_ix);
2673 if (cxix < 0)
a651a37d 2674 DIE(aTHX_ "Can't \"next\" outside a loop block");
a0d0e21e
LW		 2675 }
2676 else {
2677 cxix = dopoptolabel(cPVOP->op_pv);
2678 if (cxix < 0)
cea2e8a9 2679 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
a0d0e21e
LW		 2680 }
2681 if (cxix < cxstack_ix)
2682 dounwind(cxix);
2683
85538317
GS		 2684 /* clear off anything above the scope we're re-entering, but
2685 * save the rest until after a possible continue block */
2686 inner = PL_scopestack_ix;
1ba6ee2b 2687 TOPBLOCK(cx);
85538317
GS		 2688 if (PL_scopestack_ix < inner)
2689 leave_scope(PL_scopestack[PL_scopestack_ix]);
3a1b2b9e 2690 PL_curcop = cx->blk_oldcop;
d57ce4df 2691 return (cx)->blk_loop.my_op->op_nextop;
a0d0e21e
LW		 2692}
2693
2694PP(pp_redo)
2695{
27da23d5 2696 dVAR;
a0d0e21e 2697 I32 cxix;
c09156bb 2698 register PERL_CONTEXT *cx;
a0d0e21e 2699 I32 oldsave;
a034e688 2700 OP* redo_op;
a0d0e21e 2701
533c011a 2702 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e
LW		 2703 cxix = dopoptoloop(cxstack_ix);
2704 if (cxix < 0)
a651a37d 2705 DIE(aTHX_ "Can't \"redo\" outside a loop block");
a0d0e21e
LW		 2706 }
2707 else {
2708 cxix = dopoptolabel(cPVOP->op_pv);
2709 if (cxix < 0)
cea2e8a9 2710 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
a0d0e21e
LW		 2711 }
2712 if (cxix < cxstack_ix)
2713 dounwind(cxix);
2714
022eaa24 2715 redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
a034e688
DM		 2716 if (redo_op->op_type == OP_ENTER) {
2717 /* pop one less context to avoid $x being freed in while (my $x..) */
2718 cxstack_ix++;
2719 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2720 redo_op = redo_op->op_next;
2721 }
2722
a0d0e21e 2723 TOPBLOCK(cx);
3280af22 2724 oldsave = PL_scopestack[PL_scopestack_ix - 1];
a0d0e21e 2725 LEAVE_SCOPE(oldsave);
936c78b5 2726 FREETMPS;
3a1b2b9e 2727 PL_curcop = cx->blk_oldcop;
a034e688 2728 return redo_op;
a0d0e21e
LW		 2729}
2730
0824fdcb 2731STATIC OP *
bfed75c6 2732S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
a0d0e21e 2733{
97aff369 2734 dVAR;
a0d0e21e 2735 OP **ops = opstack;
bfed75c6 2736 static const char too_deep[] = "Target of goto is too deeply nested";
a0d0e21e 2737
7918f24d
NC		 2738 PERL_ARGS_ASSERT_DOFINDLABEL;
2739
fc36a67e 2740 if (ops >= oplimit)
cea2e8a9 2741 Perl_croak(aTHX_ too_deep);
11343788
MB		 2742 if (o->op_type == OP_LEAVE ||
2743 o->op_type == OP_SCOPE ||
2744 o->op_type == OP_LEAVELOOP ||
33d34e4c 2745 o->op_type == OP_LEAVESUB ||
11343788 2746 o->op_type == OP_LEAVETRY)
fc36a67e 2747 {
5dc0d613 2748 *ops++ = cUNOPo->op_first;
fc36a67e 2749 if (ops >= oplimit)
cea2e8a9 2750 Perl_croak(aTHX_ too_deep);
fc36a67e 2751 }
c4aa4e48 2752 *ops = 0;
11343788 2753 if (o->op_flags & OPf_KIDS) {
aec46f14 2754 OP *kid;
a0d0e21e 2755 /* First try all the kids at this level, since that's likeliest. */
11343788 2756 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
7e8f1eac
AD		 2757 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2758 const char *kid_label = CopLABEL(kCOP);
2759 if (kid_label && strEQ(kid_label, label))
2760 return kid;
2761 }
a0d0e21e 2762 }
11343788 2763 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
3280af22 2764 if (kid == PL_lastgotoprobe)
a0d0e21e 2765 continue;
ed8d0fe2
SM		 2766 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2767 if (ops == opstack)
2768 *ops++ = kid;
2769 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2770 ops[-1]->op_type == OP_DBSTATE)
2771 ops[-1] = kid;
2772 else
2773 *ops++ = kid;
2774 }
155aba94 2775 if ((o = dofindlabel(kid, label, ops, oplimit)))
11343788 2776 return o;
a0d0e21e
LW		 2777 }
2778 }
c4aa4e48 2779 *ops = 0;
a0d0e21e
LW		 2780 return 0;
2781}
2782
a0d0e21e
LW		 2783PP(pp_goto)
2784{
27da23d5 2785 dVAR; dSP;
cbbf8932 2786 OP *retop = NULL;
a0d0e21e 2787 I32 ix;
c09156bb 2788 register PERL_CONTEXT *cx;
fc36a67e 2789#define GOTO_DEPTH 64
2790 OP *enterops[GOTO_DEPTH];
cbbf8932 2791 const char *label = NULL;
bfed75c6
AL		 2792 const bool do_dump = (PL_op->op_type == OP_DUMP);
2793 static const char must_have_label[] = "goto must have label";
a0d0e21e 2794
533c011a 2795 if (PL_op->op_flags & OPf_STACKED) {
9d4ba2ae 2796 SV * const sv = POPs;
a0d0e21e
LW		 2797
2798 /* This egregious kludge implements goto &subroutine */
2799 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2800 I32 cxix;
c09156bb 2801 register PERL_CONTEXT *cx;
ea726b52 2802 CV *cv = MUTABLE_CV(SvRV(sv));
a0d0e21e
LW		 2803 SV** mark;
2804 I32 items = 0;
2805 I32 oldsave;
b1464ded 2806 bool reified = 0;
a0d0e21e 2807
e8f7dd13 2808 retry:
4aa0a1f7 2809 if (!CvROOT(cv) && !CvXSUB(cv)) {
7fc63493 2810 const GV * const gv = CvGV(cv);
e8f7dd13 2811 if (gv) {
7fc63493 2812 GV *autogv;
e8f7dd13
GS		 2813 SV *tmpstr;
2814 /* autoloaded stub? */
2815 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2816 goto retry;
c271df94
BF		 2817 autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv),
2818 GvNAMELEN(gv),
2819 GvNAMEUTF8(gv) ? SVf_UTF8 : 0);
e8f7dd13
GS		 2820 if (autogv && (cv = GvCV(autogv)))
2821 goto retry;
2822 tmpstr = sv_newmortal();
c445ea15 2823 gv_efullname3(tmpstr, gv, NULL);
be2597df 2824 DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr));
4aa0a1f7 2825 }
cea2e8a9 2826 DIE(aTHX_ "Goto undefined subroutine");
4aa0a1f7
AD		 2827 }
2828
a0d0e21e 2829 /* First do some returnish stuff. */
b37c2d43 2830 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
71fc2216 2831 FREETMPS;
a0d0e21e
LW		 2832 cxix = dopoptosub(cxstack_ix);
2833 if (cxix < 0)
cea2e8a9 2834 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
a0d0e21e
LW		 2835 if (cxix < cxstack_ix)
2836 dounwind(cxix);
2837 TOPBLOCK(cx);
2d43a17f 2838 SPAGAIN;
564abe23 2839 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2d43a17f 2840 if (CxTYPE(cx) == CXt_EVAL) {
c74ace89
DM		 2841 if (CxREALEVAL(cx))
2842 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2843 else
2844 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2d43a17f 2845 }
9850bf21
RH		 2846 else if (CxMULTICALL(cx))
2847 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
bafb2adc 2848 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
d8b46c1b 2849 /* put @_ back onto stack */
a0d0e21e 2850 AV* av = cx->blk_sub.argarray;
bfed75c6 2851
93965878 2852 items = AvFILLp(av) + 1;
a45cdc79
DM		 2853 EXTEND(SP, items+1); /* @_ could have been extended. */
2854 Copy(AvARRAY(av), SP + 1, items, SV*);
3280af22
NIS		 2855 SvREFCNT_dec(GvAV(PL_defgv));
2856 GvAV(PL_defgv) = cx->blk_sub.savearray;
b1464ded 2857 CLEAR_ARGARRAY(av);
d8b46c1b 2858 /* abandon @_ if it got reified */
62b1ebc2 2859 if (AvREAL(av)) {
b1464ded
DM		 2860 reified = 1;
2861 SvREFCNT_dec(av);
d8b46c1b
GS		 2862 av = newAV();
2863 av_extend(av, items-1);
11ca45c0 2864 AvREIFY_only(av);
ad64d0ec 2865 PAD_SVl(0) = MUTABLE_SV(cx->blk_sub.argarray = av);
62b1ebc2 2866 }
a0d0e21e 2867 }
aed2304a 2868 else if (CvISXSUB(cv)) { /* put GvAV(defgv) back onto stack */
890ce7af 2869 AV* const av = GvAV(PL_defgv);
1fa4e549 2870 items = AvFILLp(av) + 1;
a45cdc79
DM		 2871 EXTEND(SP, items+1); /* @_ could have been extended. */
2872 Copy(AvARRAY(av), SP + 1, items, SV*);
1fa4e549 2873 }
a45cdc79
DM		 2874 mark = SP;
2875 SP += items;
6b35e009 2876 if (CxTYPE(cx) == CXt_SUB &&
b150fb22 2877 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
a0d0e21e 2878 SvREFCNT_dec(cx->blk_sub.cv);
3280af22 2879 oldsave = PL_scopestack[PL_scopestack_ix - 1];
a0d0e21e
LW		 2880 LEAVE_SCOPE(oldsave);
2881
2882 /* Now do some callish stuff. */
2883 SAVETMPS;
5023d17a 2884 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
aed2304a 2885 if (CvISXSUB(cv)) {
b37c2d43 2886 OP* const retop = cx->blk_sub.retop;
9410e98d
RB		 2887 SV **newsp __attribute__unused__;
2888 I32 gimme __attribute__unused__;
b1464ded
DM		 2889 if (reified) {
2890 I32 index;
2891 for (index=0; index<items; index++)
2892 sv_2mortal(SP[-index]);
2893 }
1fa4e549 2894
b37c2d43
AL		 2895 /* XS subs don't have a CxSUB, so pop it */
2896 POPBLOCK(cx, PL_curpm);
2897 /* Push a mark for the start of arglist */
2898 PUSHMARK(mark);
2899 PUTBACK;
2900 (void)(*CvXSUB(cv))(aTHX_ cv);
a57c6685 2901 LEAVE;
5eff7df7 2902 return retop;
a0d0e21e
LW		 2903 }
2904 else {
b37c2d43 2905 AV* const padlist = CvPADLIST(cv);
6b35e009 2906 if (CxTYPE(cx) == CXt_EVAL) {
85a64632 2907 PL_in_eval = CxOLD_IN_EVAL(cx);
3280af22 2908 PL_eval_root = cx->blk_eval.old_eval_root;
b150fb22 2909 cx->cx_type = CXt_SUB;
b150fb22 2910 }
a0d0e21e 2911 cx->blk_sub.cv = cv;
1a5b3db4 2912 cx->blk_sub.olddepth = CvDEPTH(cv);
dd2155a4 2913
a0d0e21e
LW		 2914 CvDEPTH(cv)++;
2915 if (CvDEPTH(cv) < 2)
74c765eb 2916 SvREFCNT_inc_simple_void_NN(cv);
dd2155a4 2917 else {
2b9dff67 2918 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION))
44a8e56a 2919 sub_crush_depth(cv);
26019298 2920 pad_push(padlist, CvDEPTH(cv));
a0d0e21e 2921 }
426a09cd 2922 PL_curcop = cx->blk_oldcop;
fd617465
DM		 2923 SAVECOMPPAD();
2924 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
bafb2adc 2925 if (CxHASARGS(cx))
6d4ff0d2 2926 {
502c6561 2927 AV *const av = MUTABLE_AV(PAD_SVl(0));
a0d0e21e 2928
3280af22 2929 cx->blk_sub.savearray = GvAV(PL_defgv);
502c6561 2930 GvAV(PL_defgv) = MUTABLE_AV(SvREFCNT_inc_simple(av));
dd2155a4 2931 CX_CURPAD_SAVE(cx->blk_sub);
6d4ff0d2 2932 cx->blk_sub.argarray = av;
a0d0e21e
LW		 2933
2934 if (items >= AvMAX(av) + 1) {
b37c2d43 2935 SV **ary = AvALLOC(av);
a0d0e21e
LW		 2936 if (AvARRAY(av) != ary) {
2937 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
9c6bc640 2938 AvARRAY(av) = ary;
a0d0e21e
LW		 2939 }
2940 if (items >= AvMAX(av) + 1) {
2941 AvMAX(av) = items - 1;
2942 Renew(ary,items+1,SV*);
2943 AvALLOC(av) = ary;
9c6bc640 2944 AvARRAY(av) = ary;
a0d0e21e
LW		 2945 }
2946 }
a45cdc79 2947 ++mark;
a0d0e21e 2948 Copy(mark,AvARRAY(av),items,SV*);
93965878 2949 AvFILLp(av) = items - 1;
d8b46c1b 2950 assert(!AvREAL(av));
b1464ded
DM		 2951 if (reified) {
2952 /* transfer 'ownership' of refcnts to new @_ */
2953 AvREAL_on(av);
2954 AvREIFY_off(av);
2955 }
a0d0e21e
LW		 2956 while (items--) {
2957 if (*mark)
2958 SvTEMP_off(*mark);
2959 mark++;
2960 }
2961 }
491527d0 2962 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
005a8a35 2963 Perl_get_db_sub(aTHX_ NULL, cv);
b37c2d43 2964 if (PERLDB_GOTO) {
b96d8cd9 2965 CV * const gotocv = get_cvs("DB::goto", 0);
b37c2d43
AL		 2966 if (gotocv) {
2967 PUSHMARK( PL_stack_sp );
ad64d0ec 2968 call_sv(MUTABLE_SV(gotocv), G_SCALAR | G_NODEBUG);
b37c2d43
AL		 2969 PL_stack_sp--;
2970 }
491527d0 2971 }
1ce6579f 2972 }
a0d0e21e
LW		 2973 RETURNOP(CvSTART(cv));
2974 }
2975 }
1614b0e3 2976 else {
0510663f 2977 label = SvPV_nolen_const(sv);
1614b0e3 2978 if (!(do_dump || *label))
cea2e8a9 2979 DIE(aTHX_ must_have_label);
1614b0e3 2980 }
a0d0e21e 2981 }
533c011a 2982 else if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e 2983 if (! do_dump)
cea2e8a9 2984 DIE(aTHX_ must_have_label);
a0d0e21e
LW		 2985 }
2986 else
2987 label = cPVOP->op_pv;
2988
f410a211
NC		 2989 PERL_ASYNC_CHECK();
2990
a0d0e21e 2991 if (label && *label) {
cbbf8932 2992 OP *gotoprobe = NULL;
3b2447bc 2993 bool leaving_eval = FALSE;
33d34e4c 2994 bool in_block = FALSE;
cbbf8932 2995 PERL_CONTEXT *last_eval_cx = NULL;
a0d0e21e
LW		 2996
2997 /* find label */
2998
d4c19fe8 2999 PL_lastgotoprobe = NULL;
a0d0e21e
LW		 3000 *enterops = 0;
3001 for (ix = cxstack_ix; ix >= 0; ix--) {
3002 cx = &cxstack[ix];
6b35e009 3003 switch (CxTYPE(cx)) {
a0d0e21e 3004 case CXt_EVAL:
3b2447bc 3005 leaving_eval = TRUE;
971ecbe6 3006 if (!CxTRYBLOCK(cx)) {
a4f3a277
RH		 3007 gotoprobe = (last_eval_cx ?
3008 last_eval_cx->blk_eval.old_eval_root :
3009 PL_eval_root);
3010 last_eval_cx = cx;
9c5794fe
RH		 3011 break;
3012 }
3013 /* else fall through */
c6fdafd0 3014 case CXt_LOOP_LAZYIV:
d01136d6 3015 case CXt_LOOP_LAZYSV:
3b719c58
NC		 3016 case CXt_LOOP_FOR:
3017 case CXt_LOOP_PLAIN:
bb5aedc1
VP		 3018 case CXt_GIVEN:
3019 case CXt_WHEN:
a0d0e21e
LW		 3020 gotoprobe = cx->blk_oldcop->op_sibling;
3021 break;
3022 case CXt_SUBST:
3023 continue;
3024 case CXt_BLOCK:
33d34e4c 3025 if (ix) {
a0d0e21e 3026 gotoprobe = cx->blk_oldcop->op_sibling;
33d34e4c
AE		 3027 in_block = TRUE;
3028 } else
3280af22 3029 gotoprobe = PL_main_root;
a0d0e21e 3030 break;
b3933176 3031 case CXt_SUB:
9850bf21 3032 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
b3933176
CS		 3033 gotoprobe = CvROOT(cx->blk_sub.cv);
3034 break;
3035 }
3036 /* FALL THROUGH */
7766f137 3037 case CXt_FORMAT:
0a753a76 3038 case CXt_NULL:
a651a37d 3039 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
a0d0e21e
LW		 3040 default:
3041 if (ix)
cea2e8a9 3042 DIE(aTHX_ "panic: goto");
3280af22 3043 gotoprobe = PL_main_root;
a0d0e21e
LW		 3044 break;
3045 }
2b597662
GS		 3046 if (gotoprobe) {
3047 retop = dofindlabel(gotoprobe, label,
3048 enterops, enterops + GOTO_DEPTH);
3049 if (retop)
3050 break;
eae48c89
Z		 3051 if (gotoprobe->op_sibling &&
3052 gotoprobe->op_sibling->op_type == OP_UNSTACK &&
3053 gotoprobe->op_sibling->op_sibling) {
3054 retop = dofindlabel(gotoprobe->op_sibling->op_sibling,
3055 label, enterops, enterops + GOTO_DEPTH);
3056 if (retop)
3057 break;
3058 }
2b597662 3059 }
3280af22 3060 PL_lastgotoprobe = gotoprobe;
a0d0e21e
LW		 3061 }
3062 if (!retop)
cea2e8a9 3063 DIE(aTHX_ "Can't find label %s", label);
a0d0e21e 3064
3b2447bc
RH		 3065 /* if we're leaving an eval, check before we pop any frames
3066 that we're not going to punt, otherwise the error
3067 won't be caught */
3068
3069 if (leaving_eval && *enterops && enterops[1]) {
3070 I32 i;
3071 for (i = 1; enterops[i]; i++)
3072 if (enterops[i]->op_type == OP_ENTERITER)
3073 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
3074 }
3075
b500e03b
GG		 3076 if (*enterops && enterops[1]) {
3077 I32 i = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3078 if (enterops[i])
3079 deprecate("\"goto\" to jump into a construct");
3080 }
3081
a0d0e21e
LW		 3082 /* pop unwanted frames */
3083
3084 if (ix < cxstack_ix) {
3085 I32 oldsave;
3086
3087 if (ix < 0)
3088 ix = 0;
3089 dounwind(ix);
3090 TOPBLOCK(cx);
3280af22 3091 oldsave = PL_scopestack[PL_scopestack_ix];
a0d0e21e
LW		 3092 LEAVE_SCOPE(oldsave);
3093 }
3094
3095 /* push wanted frames */
3096
748a9306 3097 if (*enterops && enterops[1]) {
0bd48802 3098 OP * const oldop = PL_op;
33d34e4c
AE		 3099 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3100 for (; enterops[ix]; ix++) {
533c011a 3101 PL_op = enterops[ix];
84902520
TB		 3102 /* Eventually we may want to stack the needed arguments
3103 * for each op. For now, we punt on the hard ones. */
533c011a 3104 if (PL_op->op_type == OP_ENTERITER)
894356b3 3105 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
16c91539 3106 PL_op->op_ppaddr(aTHX);
a0d0e21e 3107 }
533c011a 3108 PL_op = oldop;
a0d0e21e
LW		 3109 }
3110 }
3111
3112 if (do_dump) {
a5f75d66 3113#ifdef VMS
6b88bc9c 3114 if (!retop) retop = PL_main_start;
a5f75d66 3115#endif
3280af22
NIS		 3116 PL_restartop = retop;
3117 PL_do_undump = TRUE;
a0d0e21e
LW		 3118
3119 my_unexec();
3120
3280af22
NIS		 3121 PL_restartop = 0; /* hmm, must be GNU unexec().. */
3122 PL_do_undump = FALSE;
a0d0e21e
LW		 3123 }
3124
3125 RETURNOP(retop);
3126}
3127
3128PP(pp_exit)
3129{
97aff369 3130 dVAR;
39644a26 3131 dSP;
a0d0e21e
LW		 3132 I32 anum;
3133
3134 if (MAXARG < 1)
3135 anum = 0;
9d3c658e
FC		 3136 else if (!TOPs) {
3137 anum = 0; (void)POPs;
3138 }
ff0cee69 3139 else {
a0d0e21e 3140 anum = SvIVx(POPs);
d98f61e7
GS		 3141#ifdef VMS
3142 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
ff0cee69 3143 anum = 0;
96e176bf 3144 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
ff0cee69 3145#endif
3146 }
cc3604b1 3147 PL_exit_flags |= PERL_EXIT_EXPECTED;
81d86705
NC		 3148#ifdef PERL_MAD
3149 /* KLUDGE: disable exit 0 in BEGIN blocks when we're just compiling */
3150 if (anum || !(PL_minus_c && PL_madskills))
3151 my_exit(anum);
3152#else
a0d0e21e 3153 my_exit(anum);
81d86705 3154#endif
3280af22 3155 PUSHs(&PL_sv_undef);
a0d0e21e
LW		 3156 RETURN;
3157}
3158
a0d0e21e
LW		 3159/* Eval. */
3160
0824fdcb 3161STATIC void
cea2e8a9 3162S_save_lines(pTHX_ AV *array, SV *sv)
a0d0e21e 3163{
504618e9 3164 const char *s = SvPVX_const(sv);
890ce7af 3165 const char * const send = SvPVX_const(sv) + SvCUR(sv);
504618e9 3166 I32 line = 1;
a0d0e21e 3167
7918f24d
NC		 3168 PERL_ARGS_ASSERT_SAVE_LINES;
3169
a0d0e21e 3170 while (s && s < send) {
f54cb97a 3171 const char *t;
b9f83d2f 3172 SV * const tmpstr = newSV_type(SVt_PVMG);
a0d0e21e 3173
1d963ff3 3174 t = (const char *)memchr(s, '\n', send - s);
a0d0e21e
LW		 3175 if (t)
3176 t++;
3177 else
3178 t = send;
3179
3180 sv_setpvn(tmpstr, s, t - s);
3181 av_store(array, line++, tmpstr);
3182 s = t;
3183 }
3184}
3185
22f16304
RU		 3186/*
3187=for apidoc docatch
3188
3189Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context.
3190
31910 is used as continue inside eval,
3192
31933 is used for a die caught by an inner eval - continue inner loop
3194
3195See cop.h: je_mustcatch, when set at any runlevel to TRUE, means eval ops must
3196establish a local jmpenv to handle exception traps.
3197
3198=cut
3199*/
0824fdcb 3200STATIC OP *
cea2e8a9 3201S_docatch(pTHX_ OP *o)
1e422769 3202{
97aff369 3203 dVAR;
6224f72b 3204 int ret;
06b5626a 3205 OP * const oldop = PL_op;
db36c5a1 3206 dJMPENV;
1e422769 3207
1e422769 3208#ifdef DEBUGGING
54310121 3209 assert(CATCH_GET == TRUE);
1e422769 3210#endif
312caa8e 3211 PL_op = o;
8bffa5f8 3212
14dd3ad8 3213 JMPENV_PUSH(ret);
6224f72b 3214 switch (ret) {
312caa8e 3215 case 0:
abd70938
DM		 3216 assert(cxstack_ix >= 0);
3217 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3218 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
14dd3ad8 3219 redo_body:
85aaa934 3220 CALLRUNOPS(aTHX);
312caa8e
CS		 3221 break;
3222 case 3:
8bffa5f8 3223 /* die caught by an inner eval - continue inner loop */
febb3a6d
Z		 3224 if (PL_restartop && PL_restartjmpenv == PL_top_env) {
3225 PL_restartjmpenv = NULL;
312caa8e
CS		 3226 PL_op = PL_restartop;
3227 PL_restartop = 0;
3228 goto redo_body;
3229 }
3230 /* FALL THROUGH */
3231 default:
14dd3ad8 3232 JMPENV_POP;
533c011a 3233 PL_op = oldop;
6224f72b 3234 JMPENV_JUMP(ret);
1e422769 3235 /* NOTREACHED */
1e422769 3236 }
14dd3ad8 3237 JMPENV_POP;
533c011a 3238 PL_op = oldop;
5f66b61c 3239 return NULL;
1e422769 3240}
3241
ee23ad3b
NC		 3242/* James Bond: Do you expect me to talk?
3243 Auric Goldfinger: No, Mr. Bond. I expect you to die.
3244
3245 This code is an ugly hack, doesn't work with lexicals in subroutines that are
3246 called more than once, and is only used by regcomp.c, for (?{}) blocks.
3247
3248 Currently it is not used outside the core code. Best if it stays that way.
d59a8b3e
NC		 3249
3250 Hence it's now deprecated, and will be removed.
ee23ad3b 3251*/
c277df42 3252OP *
bfed75c6 3253Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
c277df42
IZ		 3254/* sv Text to convert to OP tree. */
3255/* startop op_free() this to undo. */
3256/* code Short string id of the caller. */
3257{
d59a8b3e
NC		 3258 PERL_ARGS_ASSERT_SV_COMPILE_2OP;
3259 return Perl_sv_compile_2op_is_broken(aTHX_ sv, startop, code, padp);
3260}
3261
3262/* Don't use this. It will go away without warning once the regexp engine is
3263 refactored not to use it. */
3264OP *
3265Perl_sv_compile_2op_is_broken(pTHX_ SV *sv, OP **startop, const char *code,
3266 PAD **padp)
3267{
27da23d5 3268 dVAR; dSP; /* Make POPBLOCK work. */
c277df42
IZ		 3269 PERL_CONTEXT *cx;
3270 SV **newsp;
b094c71d 3271 I32 gimme = G_VOID;
c277df42
IZ		 3272 I32 optype;
3273 OP dummy;
83ee9e09
GS		 3274 char tbuf[TYPE_DIGITS(long) + 12 + 10];
3275 char *tmpbuf = tbuf;
c277df42 3276 char *safestr;
a3985cdc 3277 int runtime;
601f1833 3278 CV* runcv = NULL; /* initialise to avoid compiler warnings */
f7997f86 3279 STRLEN len;
634d6919 3280 bool need_catch;
c277df42 3281
d59a8b3e 3282 PERL_ARGS_ASSERT_SV_COMPILE_2OP_IS_BROKEN;
7918f24d 3283
d343c3ef 3284 ENTER_with_name("eval");
27fcb6ee 3285 lex_start(sv, NULL, LEX_START_SAME_FILTER);
c277df42
IZ		 3286 SAVETMPS;
3287 /* switch to eval mode */
3288
923e4eb5 3289 if (IN_PERL_COMPILETIME) {
f4dd75d9 3290 SAVECOPSTASH_FREE(&PL_compiling);
11faa288 3291 CopSTASH_set(&PL_compiling, PL_curstash);
cbce877f 3292 }
83ee9e09 3293 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
9d4ba2ae 3294 SV * const sv = sv_newmortal();
83ee9e09
GS		 3295 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
3296 code, (unsigned long)++PL_evalseq,
3297 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3298 tmpbuf = SvPVX(sv);
fc009855 3299 len = SvCUR(sv);
83ee9e09
GS		 3300 }
3301 else
d9fad198
JH		 3302 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(%.10s_eval %lu)", code,
3303 (unsigned long)++PL_evalseq);
f4dd75d9 3304 SAVECOPFILE_FREE(&PL_compiling);
57843af0 3305 CopFILE_set(&PL_compiling, tmpbuf+2);
f4dd75d9 3306 SAVECOPLINE(&PL_compiling);
57843af0 3307 CopLINE_set(&PL_compiling, 1);
c277df42
IZ		 3308 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3309 deleting the eval's FILEGV from the stash before gv_check() runs
3310 (i.e. before run-time proper). To work around the coredump that
3311 ensues, we always turn GvMULTI_on for any globals that were
3312 introduced within evals. See force_ident(). GSAR 96-10-12 */
f7997f86
NC		 3313 safestr = savepvn(tmpbuf, len);
3314 SAVEDELETE(PL_defstash, safestr, len);
b3ac6de7 3315 SAVEHINTS();
d1ca3daa 3316#ifdef OP_IN_REGISTER
6b88bc9c 3317 PL_opsave = op;
d1ca3daa 3318#else
7766f137 3319 SAVEVPTR(PL_op);
d1ca3daa 3320#endif
c277df42 3321
a3985cdc 3322 /* we get here either during compilation, or via pp_regcomp at runtime */
923e4eb5 3323 runtime = IN_PERL_RUNTIME;
a3985cdc 3324 if (runtime)
558b4424 3325 {
d819b83a 3326 runcv = find_runcv(NULL);
a3985cdc 3327
558b4424
FC		 3328 /* At run time, we have to fetch the hints from PL_curcop. */
3329 PL_hints = PL_curcop->cop_hints;
3330 if (PL_hints & HINT_LOCALIZE_HH) {
3331 /* SAVEHINTS created a new HV in PL_hintgv, which we
3332 need to GC */
3333 SvREFCNT_dec(GvHV(PL_hintgv));
3334 GvHV(PL_hintgv) =
3335 refcounted_he_chain_2hv(PL_curcop->cop_hints_hash, 0);
3336 hv_magic(GvHV(PL_hintgv), NULL, PERL_MAGIC_hints);
3337 }
3338 SAVECOMPILEWARNINGS();
3339 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
3340 cophh_free(CopHINTHASH_get(&PL_compiling));
3341 /* XXX Does this need to avoid copying a label? */
3342 PL_compiling.cop_hints_hash
3343 = cophh_copy(PL_curcop->cop_hints_hash);
3344 }
3345
533c011a 3346 PL_op = &dummy;
13b51b79 3347 PL_op->op_type = OP_ENTEREVAL;
533c011a 3348 PL_op->op_flags = 0; /* Avoid uninit warning. */
923e4eb5 3349 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
6b75f042 3350 PUSHEVAL(cx, 0);
634d6919
GG		 3351 need_catch = CATCH_GET;
3352 CATCH_SET(TRUE);
a3985cdc
DM		 3353
3354 if (runtime)
410be5db 3355 (void) doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq);
a3985cdc 3356 else
410be5db 3357 (void) doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax);
634d6919 3358 CATCH_SET(need_catch);
13b51b79 3359 POPBLOCK(cx,PL_curpm);
e84b9f1f 3360 POPEVAL(cx);
c277df42
IZ		 3361
3362 (*startop)->op_type = OP_NULL;
22c35a8c 3363 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
f3548bdc 3364 /* XXX DAPM do this properly one year */
502c6561 3365 *padp = MUTABLE_AV(SvREFCNT_inc_simple(PL_comppad));
d343c3ef 3366 LEAVE_with_name("eval");
923e4eb5 3367 if (IN_PERL_COMPILETIME)
623e6609 3368 CopHINTS_set(&PL_compiling, PL_hints);
d1ca3daa 3369#ifdef OP_IN_REGISTER
6b88bc9c 3370 op = PL_opsave;
d1ca3daa 3371#endif
9d4ba2ae
AL		 3372 PERL_UNUSED_VAR(newsp);
3373 PERL_UNUSED_VAR(optype);
3374
410be5db 3375 return PL_eval_start;
c277df42
IZ		 3376}
3377
a3985cdc
DM		 3378
3379/*
3380=for apidoc find_runcv
3381
3382Locate the CV corresponding to the currently executing sub or eval.
d819b83a
DM		 3383If db_seqp is non_null, skip CVs that are in the DB package and populate
3384*db_seqp with the cop sequence number at the point that the DB:: code was
3385entered. (allows debuggers to eval in the scope of the breakpoint rather
cf525c36 3386than in the scope of the debugger itself).
a3985cdc
DM		 3387
3388=cut
3389*/
3390
3391CV*
d819b83a 3392Perl_find_runcv(pTHX_ U32 *db_seqp)
a3985cdc 3393{
97aff369 3394 dVAR;
a3985cdc 3395 PERL_SI *si;
a3985cdc 3396
d819b83a
DM		 3397 if (db_seqp)
3398 *db_seqp = PL_curcop->cop_seq;
a3985cdc 3399 for (si = PL_curstackinfo; si; si = si->si_prev) {
06b5626a 3400 I32 ix;
a3985cdc 3401 for (ix = si->si_cxix; ix >= 0; ix--) {
06b5626a 3402 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
d819b83a 3403 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1b6737cc 3404 CV * const cv = cx->blk_sub.cv;
d819b83a
DM		 3405 /* skip DB:: code */
3406 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
3407 *db_seqp = cx->blk_oldcop->cop_seq;
3408 continue;
3409 }
3410 return cv;
3411 }
a3985cdc
DM		 3412 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
3413 return PL_compcv;
3414 }
3415 }
3416 return PL_main_cv;
3417}
3418
3419
27e90453
DM		 3420/* Run yyparse() in a setjmp wrapper. Returns:
3421 * 0: yyparse() successful
3422 * 1: yyparse() failed
3423 * 3: yyparse() died
3424 */
3425STATIC int
28ac2b49 3426S_try_yyparse(pTHX_ int gramtype)
27e90453
DM		 3427{
3428 int ret;
3429 dJMPENV;
3430
3431 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3432 JMPENV_PUSH(ret);
3433 switch (ret) {
3434 case 0:
28ac2b49 3435 ret = yyparse(gramtype) ? 1 : 0;
27e90453
DM		 3436 break;
3437 case 3:
3438 break;
3439 default:
3440 JMPENV_POP;
3441 JMPENV_JUMP(ret);
3442 /* NOTREACHED */
3443 }
3444 JMPENV_POP;
3445 return ret;
3446}
3447
3448
a3985cdc
DM		 3449/* Compile a require/do, an eval '', or a /(?{...})/.
3450 * In the last case, startop is non-null, and contains the address of
3451 * a pointer that should be set to the just-compiled code.
3452 * outside is the lexically enclosing CV (if any) that invoked us.
410be5db
DM		 3453 * Returns a bool indicating whether the compile was successful; if so,
3454 * PL_eval_start contains the first op of the compiled ocde; otherwise,
3455 * pushes undef (also croaks if startop != NULL).
a3985cdc
DM		 3456 */
3457
410be5db 3458STATIC bool
a3985cdc 3459S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq)
a0d0e21e 3460{
27da23d5 3461 dVAR; dSP;
46c461b5 3462 OP * const saveop = PL_op;
27e90453
DM		 3463 bool in_require = (saveop && saveop->op_type == OP_REQUIRE);
3464 int yystatus;
a0d0e21e 3465
27e90453 3466 PL_in_eval = (in_require
6dc8a9e4
IZ		 3467 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
3468 : EVAL_INEVAL);
a0d0e21e 3469
1ce6579f 3470 PUSHMARK(SP);
3471
3280af22 3472 SAVESPTR(PL_compcv);
ea726b52 3473 PL_compcv = MUTABLE_CV(newSV_type(SVt_PVCV));
1aff0e91 3474 CvEVAL_on(PL_compcv);
2090ab20
JH		 3475 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3476 cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
86a64801 3477 cxstack[cxstack_ix].blk_gimme = gimme;
2090ab20 3478
a3985cdc 3479 CvOUTSIDE_SEQ(PL_compcv) = seq;
ea726b52 3480 CvOUTSIDE(PL_compcv) = MUTABLE_CV(SvREFCNT_inc_simple(outside));
a3985cdc 3481
dd2155a4 3482 /* set up a scratch pad */
a0d0e21e 3483
dd2155a4 3484 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE);
cecbe010 3485 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
2c05e328 3486
07055b4c 3487
81d86705
NC		 3488 if (!PL_madskills)
3489 SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
748a9306 3490
a0d0e21e
LW		 3491 /* make sure we compile in the right package */
3492
ed094faf 3493 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
03d9f026
FC		 3494 SAVEGENERICSV(PL_curstash);
3495 PL_curstash = (HV *)SvREFCNT_inc_simple(CopSTASH(PL_curcop));
a0d0e21e 3496 }
3c10abe3 3497 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
3280af22
NIS		 3498 SAVESPTR(PL_beginav);
3499 PL_beginav = newAV();
3500 SAVEFREESV(PL_beginav);
3c10abe3
AG		 3501 SAVESPTR(PL_unitcheckav);
3502 PL_unitcheckav = newAV();
3503 SAVEFREESV(PL_unitcheckav);
a0d0e21e 3504
81d86705 3505#ifdef PERL_MAD
9da243ce 3506 SAVEBOOL(PL_madskills);
81d86705
NC		 3507 PL_madskills = 0;
3508#endif
3509
a0d0e21e
LW		 3510 /* try to compile it */
3511
5f66b61c 3512 PL_eval_root = NULL;
3280af22 3513 PL_curcop = &PL_compiling;
5f66b61c 3514 if (saveop && (saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
faef0170 3515 PL_in_eval |= EVAL_KEEPERR;
ab69dbc2
RGS		 3516 else
3517 CLEAR_ERRSV();
27e90453 3518
a88d97bf 3519 CALL_BLOCK_HOOKS(bhk_eval, saveop);
52db365a 3520
27e90453
DM		 3521 /* note that yyparse() may raise an exception, e.g. C<BEGIN{die}>,
3522 * so honour CATCH_GET and trap it here if necessary */
3523
28ac2b49 3524 yystatus = (!in_require && CATCH_GET) ? S_try_yyparse(aTHX_ GRAMPROG) : yyparse(GRAMPROG);
27e90453
DM		 3525
3526 if (yystatus || PL_parser->error_count || !PL_eval_root) {
0c58d367 3527 SV **newsp; /* Used by POPBLOCK. */
d164302a 3528 PERL_CONTEXT *cx;
27e90453 3529 I32 optype; /* Used by POPEVAL. */
d164302a 3530 SV *namesv;
bfed75c6 3531
d164302a
GG		 3532 cx = NULL;
3533 namesv = NULL;
27e90453
DM		 3534 PERL_UNUSED_VAR(newsp);
3535 PERL_UNUSED_VAR(optype);
3536
c86ffc32
DM		 3537 /* note that if yystatus == 3, then the EVAL CX block has already
3538 * been popped, and various vars restored */
533c011a 3539 PL_op = saveop;
27e90453 3540 if (yystatus != 3) {
c86ffc32
DM		 3541 if (PL_eval_root) {
3542 op_free(PL_eval_root);
3543 PL_eval_root = NULL;
3544 }
27e90453
DM		 3545 SP = PL_stack_base + POPMARK; /* pop original mark */
3546 if (!startop) {
3547 POPBLOCK(cx,PL_curpm);
3548 POPEVAL(cx);
b6494f15 3549 namesv = cx->blk_eval.old_namesv;
27e90453 3550 }
c277df42 3551 }
27e90453
DM		 3552 if (yystatus != 3)
3553 LEAVE_with_name("eval"); /* pp_entereval knows about this LEAVE. */
9d4ba2ae 3554
27e90453 3555 if (in_require) {
b6494f15
VP		 3556 if (!cx) {
3557 /* If cx is still NULL, it means that we didn't go in the
3558 * POPEVAL branch. */
3559 cx = &cxstack[cxstack_ix];
3560 assert(CxTYPE(cx) == CXt_EVAL);
3561 namesv = cx->blk_eval.old_namesv;
3562 }
3563 (void)hv_store(GvHVn(PL_incgv),
ecad31f0 3564 SvPVX_const(namesv),
c60dbbc3 3565 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
b6494f15 3566 &PL_sv_undef, 0);
ecad31f0
BF		 3567 Perl_croak(aTHX_ "%"SVf"Compilation failed in require",
3568 SVfARG(ERRSV
3569 ? ERRSV
3570 : newSVpvs_flags("Unknown error\n", SVs_TEMP)));
5a844595
GS		 3571 }
3572 else if (startop) {
27e90453
DM		 3573 if (yystatus != 3) {
3574 POPBLOCK(cx,PL_curpm);
3575 POPEVAL(cx);
3576 }
ecad31f0
BF		 3577 Perl_croak(aTHX_ "%"SVf"Compilation failed in regexp",
3578 SVfARG(ERRSV
3579 ? ERRSV
3580 : newSVpvs_flags("Unknown error\n", SVs_TEMP)));
7a2e2cd6 3581 }
9d7f88dd 3582 else {
ecad31f0 3583 if (!*(SvPVx_nolen_const(ERRSV))) {
6502358f 3584 sv_setpvs(ERRSV, "Compilation error");
9d7f88dd
SR		 3585 }
3586 }
410be5db
DM		 3587 PUSHs(&PL_sv_undef);
3588 PUTBACK;
3589 return FALSE;
a0d0e21e 3590 }
57843af0 3591 CopLINE_set(&PL_compiling, 0);
c277df42 3592 if (startop) {
3280af22 3593 *startop = PL_eval_root;
c277df42 3594 } else
3280af22 3595 SAVEFREEOP(PL_eval_root);
0c58d367 3596
a0d0e21e
LW		 3597 DEBUG_x(dump_eval());
3598
55497cff 3599 /* Register with debugger: */
6482a30d 3600 if (PERLDB_INTER && saveop && saveop->op_type == OP_REQUIRE) {
b96d8cd9 3601 CV * const cv = get_cvs("DB::postponed", 0);
55497cff 3602 if (cv) {
3603 dSP;
924508f0 3604 PUSHMARK(SP);
ad64d0ec 3605 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
55497cff 3606 PUTBACK;
ad64d0ec 3607 call_sv(MUTABLE_SV(cv), G_DISCARD);
55497cff 3608 }
3609 }
3610
8ed49485
FC		 3611 if (PL_unitcheckav) {
3612 OP *es = PL_eval_start;
3c10abe3 3613 call_list(PL_scopestack_ix, PL_unitcheckav);
8ed49485
FC		 3614 PL_eval_start = es;
3615 }
3c10abe3 3616
a0d0e21e
LW		 3617 /* compiled okay, so do it */
3618
3280af22
NIS		 3619 CvDEPTH(PL_compcv) = 1;
3620 SP = PL_stack_base + POPMARK; /* pop original mark */
533c011a 3621 PL_op = saveop; /* The caller may need it. */
bc177e6b 3622 PL_parser->lex_state = LEX_NOTPARSING; /* $^S needs this. */
5dc0d613 3623
410be5db
DM		 3624 PUTBACK;
3625 return TRUE;
a0d0e21e
LW		 3626}
3627
a6c40364 3628STATIC PerlIO *
282b29ee 3629S_check_type_and_open(pTHX_ SV *name)
ce8abf5f
SP		 3630{
3631 Stat_t st;
282b29ee
NC		 3632 const char *p = SvPV_nolen_const(name);
3633 const int st_rc = PerlLIO_stat(p, &st);
df528165 3634
7918f24d
NC		 3635 PERL_ARGS_ASSERT_CHECK_TYPE_AND_OPEN;
3636
6b845e56 3637 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
4608196e 3638 return NULL;
ce8abf5f
SP		 3639 }
3640
ccb84406 3641#if !defined(PERLIO_IS_STDIO) && !defined(USE_SFIO)
639dfab0 3642 return PerlIO_openn(aTHX_ ":", PERL_SCRIPT_MODE, -1, 0, 0, NULL, 1, &name);
ccb84406 3643#else
282b29ee 3644 return PerlIO_open(p, PERL_SCRIPT_MODE);
ccb84406 3645#endif
ce8abf5f
SP		 3646}
3647
75c20bac 3648#ifndef PERL_DISABLE_PMC
ce8abf5f 3649STATIC PerlIO *
282b29ee 3650S_doopen_pm(pTHX_ SV *name)
b295d113 3651{
282b29ee
NC		 3652 STRLEN namelen;
3653 const char *p = SvPV_const(name, namelen);
b295d113 3654
7918f24d
NC		 3655 PERL_ARGS_ASSERT_DOOPEN_PM;
3656
282b29ee 3657 if (namelen > 3 && memEQs(p + namelen - 3, 3, ".pm")) {
eb70bb4a 3658 SV *const pmcsv = sv_newmortal();
a6c40364 3659 Stat_t pmcstat;
50b8ed39 3660
eb70bb4a 3661 SvSetSV_nosteal(pmcsv,name);
282b29ee 3662 sv_catpvn(pmcsv, "c", 1);
50b8ed39 3663
282b29ee
NC		 3664 if (PerlLIO_stat(SvPV_nolen_const(pmcsv), &pmcstat) >= 0)
3665 return check_type_and_open(pmcsv);
a6c40364 3666 }
282b29ee 3667 return check_type_and_open(name);
75c20bac 3668}
7925835c 3669#else
282b29ee 3670# define doopen_pm(name) check_type_and_open(name)
7925835c 3671#endif /* !PERL_DISABLE_PMC */
b295d113 3672
a0d0e21e
LW		 3673PP(pp_require)
3674{
27da23d5 3675 dVAR; dSP;
c09156bb 3676 register PERL_CONTEXT *cx;
a0d0e21e 3677 SV *sv;
5c144d81 3678 const char *name;
6132ea6c 3679 STRLEN len;
4492be7a
JM		 3680 char * unixname;
3681 STRLEN unixlen;
62f5ad7a 3682#ifdef VMS
4492be7a 3683 int vms_unixname = 0;
62f5ad7a 3684#endif
c445ea15
AL		 3685 const char *tryname = NULL;
3686 SV *namesv = NULL;
f54cb97a 3687 const I32 gimme = GIMME_V;
bbed91b5 3688 int filter_has_file = 0;
c445ea15 3689 PerlIO *tryrsfp = NULL;
34113e50 3690 SV *filter_cache = NULL;
c445ea15
AL		 3691 SV *filter_state = NULL;
3692 SV *filter_sub = NULL;
3693 SV *hook_sv = NULL;
6ec9efec
JH		 3694 SV *encoding;
3695 OP *op;
a0d0e21e
LW		 3696
3697 sv = POPs;
d7aa5382 3698 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
d086148c 3699 sv = sv_2mortal(new_version(sv));
d7aa5382 3700 if (!sv_derived_from(PL_patchlevel, "version"))
ac0e6a2f 3701 upg_version(PL_patchlevel, TRUE);
149c1637 3702 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3cacfbb9 3703 if ( vcmp(sv,PL_patchlevel) <= 0 )
468aa647 3704 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
e753e3b1
FC		 3705 SVfARG(sv_2mortal(vnormal(sv))),
3706 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3707 );
468aa647
RGS		 3708 }
3709 else {
d1029faa
JP		 3710 if ( vcmp(sv,PL_patchlevel) > 0 ) {
3711 I32 first = 0;
3712 AV *lav;
3713 SV * const req = SvRV(sv);
85fbaab2 3714 SV * const pv = *hv_fetchs(MUTABLE_HV(req), "original", FALSE);
d1029faa
JP		 3715
3716 /* get the left hand term */
502c6561 3717 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(req), "version", FALSE)));
d1029faa
JP		 3718
3719 first = SvIV(*av_fetch(lav,0,0));
3720 if ( first > (int)PERL_REVISION /* probably 'use 6.0' */
85fbaab2 3721 || hv_exists(MUTABLE_HV(req), "qv", 2 ) /* qv style */
d1029faa
JP		 3722 || av_len(lav) > 1 /* FP with > 3 digits */
3723 || strstr(SvPVX(pv),".0") /* FP with leading 0 */
3724 ) {
3725 DIE(aTHX_ "Perl %"SVf" required--this is only "
9d056fb0
FC		 3726 "%"SVf", stopped",
3727 SVfARG(sv_2mortal(vnormal(req))),
3728 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3729 );
d1029faa
JP		 3730 }
3731 else { /* probably 'use 5.10' or 'use 5.8' */
af61dbfd 3732 SV *hintsv;
d1029faa
JP		 3733 I32 second = 0;
3734
3735 if (av_len(lav)>=1)
3736 second = SvIV(*av_fetch(lav,1,0));
3737
3738 second /= second >= 600 ? 100 : 10;
af61dbfd
NC		 3739 hintsv = Perl_newSVpvf(aTHX_ "v%d.%d.0",
3740 (int)first, (int)second);
d1029faa
JP		 3741 upg_version(hintsv, TRUE);
3742
3743 DIE(aTHX_ "Perl %"SVf" required (did you mean %"SVf"?)"
3744 "--this is only %"SVf", stopped",
1be7d6f3
FC		 3745 SVfARG(sv_2mortal(vnormal(req))),
3746 SVfARG(sv_2mortal(vnormal(sv_2mortal(hintsv)))),
3747 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3748 );
d1029faa
JP		 3749 }
3750 }
468aa647 3751 }
d7aa5382 3752
7dfde25d 3753 RETPUSHYES;
a0d0e21e 3754 }
5c144d81 3755 name = SvPV_const(sv, len);
6132ea6c 3756 if (!(name && len > 0 && *name))
cea2e8a9 3757 DIE(aTHX_ "Null filename used");
4633a7c4 3758 TAINT_PROPER("require");
4492be7a
JM		 3759
3760
3761#ifdef VMS
3762 /* The key in the %ENV hash is in the syntax of file passed as the argument
3763 * usually this is in UNIX format, but sometimes in VMS format, which
3764 * can result in a module being pulled in more than once.
3765 * To prevent this, the key must be stored in UNIX format if the VMS
3766 * name can be translated to UNIX.
3767 */
3768 if ((unixname = tounixspec(name, NULL)) != NULL) {
3769 unixlen = strlen(unixname);
3770 vms_unixname = 1;
3771 }
3772 else
3773#endif
3774 {
3775 /* if not VMS or VMS name can not be translated to UNIX, pass it
3776 * through.
3777 */
3778 unixname = (char *) name;
3779 unixlen = len;
3780 }
44f8325f 3781 if (PL_op->op_type == OP_REQUIRE) {
4492be7a
JM		 3782 SV * const * const svp = hv_fetch(GvHVn(PL_incgv),
3783 unixname, unixlen, 0);
44f8325f
AL		 3784 if ( svp ) {
3785 if (*svp != &PL_sv_undef)
3786 RETPUSHYES;
3787 else
087b5369
RD		 3788 DIE(aTHX_ "Attempt to reload %s aborted.\n"
3789 "Compilation failed in require", unixname);
44f8325f 3790 }
4d8b06f1 3791 }
a0d0e21e
LW		 3792
3793 /* prepare to compile file */
3794
be4b629d 3795 if (path_is_absolute(name)) {
282b29ee 3796 /* At this point, name is SvPVX(sv) */
46fc3d4c 3797 tryname = name;
282b29ee 3798 tryrsfp = doopen_pm(sv);
bf4acbe4 3799 }
be4b629d 3800 if (!tryrsfp) {
44f8325f 3801 AV * const ar = GvAVn(PL_incgv);
a0d0e21e 3802 I32 i;
748a9306 3803#ifdef VMS
4492be7a 3804 if (vms_unixname)
46fc3d4c 3805#endif
3806 {
d0328fd7 3807 namesv = newSV_type(SVt_PV);
46fc3d4c 3808 for (i = 0; i <= AvFILL(ar); i++) {
df528165 3809 SV * const dirsv = *av_fetch(ar, i, TRUE);
bbed91b5 3810
ad64d0ec 3811 if (SvTIED_mg((const SV *)ar, PERL_MAGIC_tied))
c38a6530 3812 mg_get(dirsv);
bbed91b5
KF		 3813 if (SvROK(dirsv)) {
3814 int count;
a3b58a99 3815 SV **svp;
bbed91b5
KF		 3816 SV *loader = dirsv;
3817
e14e2dc8
NC		 3818 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3819 && !sv_isobject(loader))
3820 {
502c6561 3821 loader = *av_fetch(MUTABLE_AV(SvRV(loader)), 0, TRUE);
bbed91b5
KF		 3822 }
3823
b900a521 3824 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
44f0be63 3825 PTR2UV(SvRV(dirsv)), name);
349d4f2f 3826 tryname = SvPVX_const(namesv);
c445ea15 3827 tryrsfp = NULL;
bbed91b5 3828
d343c3ef 3829 ENTER_with_name("call_INC");
bbed91b5
KF		 3830 SAVETMPS;
3831 EXTEND(SP, 2);
3832
3833 PUSHMARK(SP);
3834 PUSHs(dirsv);
3835 PUSHs(sv);
3836 PUTBACK;
e982885c
NC		 3837 if (sv_isobject(loader))
3838 count = call_method("INC", G_ARRAY);
3839 else
3840 count = call_sv(loader, G_ARRAY);
bbed91b5
KF		 3841 SPAGAIN;
3842
3843 if (count > 0) {
3844 int i = 0;
3845 SV *arg;
3846
3847 SP -= count - 1;
3848 arg = SP[i++];
3849
34113e50
NC		 3850 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3851 && !isGV_with_GP(SvRV(arg))) {
3852 filter_cache = SvRV(arg);
74c765eb 3853 SvREFCNT_inc_simple_void_NN(filter_cache);
34113e50
NC		 3854
3855 if (i < count) {
3856 arg = SP[i++];
3857 }
3858 }
3859
6e592b3a 3860 if (SvROK(arg) && isGV_with_GP(SvRV(arg))) {
bbed91b5
KF		 3861 arg = SvRV(arg);
3862 }
3863
6e592b3a 3864 if (isGV_with_GP(arg)) {
159b6efe 3865 IO * const io = GvIO((const GV *)arg);
bbed91b5
KF		 3866
3867 ++filter_has_file;
3868
3869 if (io) {
3870 tryrsfp = IoIFP(io);
0f7de14d
NC		 3871 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3872 PerlIO_close(IoOFP(io));
bbed91b5 3873 }
0f7de14d
NC		 3874 IoIFP(io) = NULL;
3875 IoOFP(io) = NULL;
bbed91b5
KF		 3876 }
3877
3878 if (i < count) {
3879 arg = SP[i++];
3880 }
3881 }
3882
3883 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3884 filter_sub = arg;
74c765eb 3885 SvREFCNT_inc_simple_void_NN(filter_sub);
bbed91b5
KF		 3886
3887 if (i < count) {
3888 filter_state = SP[i];
b37c2d43 3889 SvREFCNT_inc_simple_void(filter_state);
bbed91b5 3890 }
34113e50 3891 }
bbed91b5 3892
34113e50
NC		 3893 if (!tryrsfp && (filter_cache || filter_sub)) {
3894 tryrsfp = PerlIO_open(BIT_BUCKET,
3895 PERL_SCRIPT_MODE);
bbed91b5 3896 }
1d06aecd 3897 SP--;
bbed91b5
KF		 3898 }
3899
3900 PUTBACK;
3901 FREETMPS;
d343c3ef 3902 LEAVE_with_name("call_INC");
bbed91b5 3903
c5f55552
NC		 3904 /* Adjust file name if the hook has set an %INC entry.
3905 This needs to happen after the FREETMPS above. */
3906 svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3907 if (svp)
3908 tryname = SvPV_nolen_const(*svp);
3909
bbed91b5 3910 if (tryrsfp) {
89ccab8c 3911 hook_sv = dirsv;
bbed91b5
KF		 3912 break;
3913 }
3914
3915 filter_has_file = 0;
34113e50
NC		 3916 if (filter_cache) {
3917 SvREFCNT_dec(filter_cache);
3918 filter_cache = NULL;
3919 }
bbed91b5
KF		 3920 if (filter_state) {
3921 SvREFCNT_dec(filter_state);
c445ea15 3922 filter_state = NULL;
bbed91b5
KF		 3923 }
3924 if (filter_sub) {
3925 SvREFCNT_dec(filter_sub);
c445ea15 3926 filter_sub = NULL;
bbed91b5
KF		 3927 }
3928 }
3929 else {
be4b629d 3930 if (!path_is_absolute(name)
be4b629d 3931 ) {
b640a14a
NC		 3932 const char *dir;
3933 STRLEN dirlen;
3934
3935 if (SvOK(dirsv)) {
3936 dir = SvPV_const(dirsv, dirlen);
3937 } else {
3938 dir = "";
3939 dirlen = 0;
3940 }
3941
e37778c2 3942#ifdef VMS
bbed91b5 3943 char *unixdir;
c445ea15 3944 if ((unixdir = tounixpath(dir, NULL)) == NULL)
bbed91b5
KF		 3945 continue;
3946 sv_setpv(namesv, unixdir);
3947 sv_catpv(namesv, unixname);
e37778c2
NC		 3948#else
3949# ifdef __SYMBIAN32__
27da23d5
JH		 3950 if (PL_origfilename[0] &&
3951 PL_origfilename[1] == ':' &&
3952 !(dir[0] && dir[1] == ':'))
3953 Perl_sv_setpvf(aTHX_ namesv,
3954 "%c:%s\\%s",
3955 PL_origfilename[0],
3956 dir, name);
3957 else
3958 Perl_sv_setpvf(aTHX_ namesv,
3959 "%s\\%s",
3960 dir, name);
e37778c2 3961# else
b640a14a
NC		 3962 /* The equivalent of
3963 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3964 but without the need to parse the format string, or
3965 call strlen on either pointer, and with the correct
3966 allocation up front. */
3967 {
3968 char *tmp = SvGROW(namesv, dirlen + len + 2);
3969
3970 memcpy(tmp, dir, dirlen);
3971 tmp +=dirlen;
3972 *tmp++ = '/';
3973 /* name came from an SV, so it will have a '\0' at the
3974 end that we can copy as part of this memcpy(). */
3975 memcpy(tmp, name, len + 1);
3976
3977 SvCUR_set(namesv, dirlen + len + 1);
282b29ee 3978 SvPOK_on(namesv);
b640a14a 3979 }
27da23d5 3980# endif
bf4acbe4 3981#endif
bbed91b5 3982 TAINT_PROPER("require");
349d4f2f 3983 tryname = SvPVX_const(namesv);
282b29ee 3984 tryrsfp = doopen_pm(namesv);
bbed91b5 3985 if (tryrsfp) {
e63be746
RGS		 3986 if (tryname[0] == '.' && tryname[1] == '/') {
3987 ++tryname;
3988 while (*++tryname == '/');
3989 }
bbed91b5
KF		 3990 break;
3991 }
ff806af2
DM		 3992 else if (errno == EMFILE)
3993 /* no point in trying other paths if out of handles */
3994 break;
be4b629d 3995 }
46fc3d4c 3996 }
a0d0e21e
LW		 3997 }
3998 }
3999 }
b2ef6d44 4000 sv_2mortal(namesv);
a0d0e21e 4001 if (!tryrsfp) {
533c011a 4002 if (PL_op->op_type == OP_REQUIRE) {
e31de809 4003 if(errno == EMFILE) {
c9d5e35e
NC		 4004 /* diag_listed_as: Can't locate %s */
4005 DIE(aTHX_ "Can't locate %s: %s", name, Strerror(errno));
e31de809
SP		 4006 } else {
4007 if (namesv) { /* did we lookup @INC? */
44f8325f 4008 AV * const ar = GvAVn(PL_incgv);
e31de809 4009 I32 i;
c9d5e35e
NC		 4010 SV *const inc = newSVpvs_flags("", SVs_TEMP);
4011 for (i = 0; i <= AvFILL(ar); i++) {
4012 sv_catpvs(inc, " ");
4013 sv_catsv(inc, *av_fetch(ar, i, TRUE));
4014 }
4015
4016 /* diag_listed_as: Can't locate %s */
4017 DIE(aTHX_
4018 "Can't locate %s in @INC%s%s (@INC contains:%" SVf ")",
4019 name,
686c4ca0
NC		 4020 (memEQ(name + len - 2, ".h", 3)
4021 ? " (change .h to .ph maybe?) (did you run h2ph?)" : ""),
4022 (memEQ(name + len - 3, ".ph", 4)
c9d5e35e
NC		 4023 ? " (did you run h2ph?)" : ""),
4024 inc
4025 );
4026 }
2683423c 4027 }
c9d5e35e 4028 DIE(aTHX_ "Can't locate %s", name);
a0d0e21e
LW		 4029 }
4030
4031 RETPUSHUNDEF;
4032 }
d8bfb8bd 4033 else
93189314 4034 SETERRNO(0, SS_NORMAL);
a0d0e21e
LW		 4035
4036 /* Assume success here to prevent recursive requirement. */
238d24b4 4037 /* name is never assigned to again, so len is still strlen(name) */
d3a4e64e 4038 /* Check whether a hook in @INC has already filled %INC */
44f8325f 4039 if (!hook_sv) {
4492be7a 4040 (void)hv_store(GvHVn(PL_incgv),
b2ef6d44 4041 unixname, unixlen, newSVpv(tryname,0),0);
44f8325f 4042 } else {
4492be7a 4043 SV** const svp = hv_fetch(GvHVn(PL_incgv), unixname, unixlen, 0);
44f8325f 4044 if (!svp)
4492be7a
JM		 4045 (void)hv_store(GvHVn(PL_incgv),
4046 unixname, unixlen, SvREFCNT_inc_simple(hook_sv), 0 );
d3a4e64e 4047 }
a0d0e21e 4048
d343c3ef 4049 ENTER_with_name("eval");
a0d0e21e 4050 SAVETMPS;
b2ef6d44
FC		 4051 SAVECOPFILE_FREE(&PL_compiling);
4052 CopFILE_set(&PL_compiling, tryname);
8eaa0acf 4053 lex_start(NULL, tryrsfp, 0);
e50aee73 4054
b3ac6de7 4055 SAVEHINTS();
3280af22 4056 PL_hints = 0;
f747ebd6 4057 hv_clear(GvHV(PL_hintgv));
27eaf14c 4058
68da3b2f 4059 SAVECOMPILEWARNINGS();
0453d815 4060 if (PL_dowarn & G_WARN_ALL_ON)
d3a7d8c7 4061 PL_compiling.cop_warnings = pWARN_ALL ;
0453d815 4062 else if (PL_dowarn & G_WARN_ALL_OFF)
d3a7d8c7 4063 PL_compiling.cop_warnings = pWARN_NONE ;
ac27b0f5 4064 else
d3a7d8c7 4065 PL_compiling.cop_warnings = pWARN_STD ;
a0d0e21e 4066
34113e50 4067 if (filter_sub || filter_cache) {
4464f08e
NC		 4068 /* We can use the SvPV of the filter PVIO itself as our cache, rather
4069 than hanging another SV from it. In turn, filter_add() optionally
4070 takes the SV to use as the filter (or creates a new SV if passed
4071 NULL), so simply pass in whatever value filter_cache has. */
4072 SV * const datasv = filter_add(S_run_user_filter, filter_cache);
bbed91b5 4073 IoLINES(datasv) = filter_has_file;
159b6efe
NC		 4074 IoTOP_GV(datasv) = MUTABLE_GV(filter_state);
4075 IoBOTTOM_GV(datasv) = MUTABLE_GV(filter_sub);
bbed91b5
KF		 4076 }
4077
4078 /* switch to eval mode */
a0d0e21e 4079 PUSHBLOCK(cx, CXt_EVAL, SP);
6b75f042 4080 PUSHEVAL(cx, name);
f39bc417 4081 cx->blk_eval.retop = PL_op->op_next;
a0d0e21e 4082
57843af0
GS		 4083 SAVECOPLINE(&PL_compiling);
4084 CopLINE_set(&PL_compiling, 0);
a0d0e21e
LW		 4085
4086 PUTBACK;
6ec9efec
JH		 4087
4088 /* Store and reset encoding. */
4089 encoding = PL_encoding;
c445ea15 4090 PL_encoding = NULL;
6ec9efec 4091
410be5db
DM		 4092 if (doeval(gimme, NULL, NULL, PL_curcop->cop_seq))
4093 op = DOCATCH(PL_eval_start);
4094 else
4095 op = PL_op->op_next;
bfed75c6 4096
6ec9efec
JH		 4097 /* Restore encoding. */
4098 PL_encoding = encoding;
4099
4100 return op;
a0d0e21e
LW		 4101}
4102
996c9baa
VP		 4103/* This is a op added to hold the hints hash for
4104 pp_entereval. The hash can be modified by the code
4105 being eval'ed, so we return a copy instead. */
4106
4107PP(pp_hintseval)
4108{
4109 dVAR;
4110 dSP;
defdfed5 4111 mXPUSHs(MUTABLE_SV(hv_copy_hints_hv(MUTABLE_HV(cSVOP_sv))));
996c9baa
VP		 4112 RETURN;
4113}
4114
4115
a0d0e21e
LW		 4116PP(pp_entereval)
4117{
27da23d5 4118 dVAR; dSP;
c09156bb 4119 register PERL_CONTEXT *cx;
0d863452 4120 SV *sv;
890ce7af 4121 const I32 gimme = GIMME_V;
fd06b02c 4122 const U32 was = PL_breakable_sub_gen;
83ee9e09 4123 char tbuf[TYPE_DIGITS(long) + 12];
78da7625 4124 bool saved_delete = FALSE;
83ee9e09 4125 char *tmpbuf = tbuf;
a0d0e21e 4126 STRLEN len;
a3985cdc 4127 CV* runcv;
d819b83a 4128 U32 seq;
c445ea15 4129 HV *saved_hh = NULL;
e389bba9 4130
0d863452 4131 if (PL_op->op_private & OPpEVAL_HAS_HH) {
85fbaab2 4132 saved_hh = MUTABLE_HV(SvREFCNT_inc(POPs));
0d863452 4133 }
7d789282
FC		 4134 else if (PL_op->op_private & OPpEVAL_COPHH
4135 && PL_curcop->cop_hints & HINT_LOCALIZE_HH) {
4136 saved_hh = cop_hints_2hv(PL_curcop, 0);
4137 hv_magic(saved_hh, NULL, PERL_MAGIC_hints);
4138 }
0d863452 4139 sv = POPs;
895b760f
DM		 4140 if (!SvPOK(sv)) {
4141 /* make sure we've got a plain PV (no overload etc) before testing
4142 * for taint. Making a copy here is probably overkill, but better
4143 * safe than sorry */
0479a84a
NC		 4144 STRLEN len;
4145 const char * const p = SvPV_const(sv, len);
4146
4147 sv = newSVpvn_flags(p, len, SVs_TEMP | SvUTF8(sv));
7d789282
FC		 4148
4149 if (PL_op->op_private & OPpEVAL_BYTES && SvUTF8(sv))
4150 SvPVbyte_force(sv, len);
4151 }
4152 else if (PL_op->op_private & OPpEVAL_BYTES && SvUTF8(sv)) {
4153 /* Don’t modify someone else’s scalar */
4154 STRLEN len;
4155 sv = newSVsv(sv);
4156 SvPVbyte_force(sv,len);
895b760f 4157 }
a0d0e21e 4158
af2d3def 4159 TAINT_IF(SvTAINTED(sv));
748a9306 4160 TAINT_PROPER("eval");
a0d0e21e 4161
d343c3ef 4162 ENTER_with_name("eval");
802a15e9
BF		 4163 lex_start(sv, NULL, LEX_START_SAME_FILTER |
4164 ( PL_op->op_private & OPpEVAL_UNICODE
4165 ? LEX_IGNORE_UTF8_HINTS : 0 ));
748a9306 4166 SAVETMPS;
ac27b0f5 4167
a0d0e21e
LW		 4168 /* switch to eval mode */
4169
83ee9e09 4170 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
8b38226b
AL		 4171 SV * const temp_sv = sv_newmortal();
4172 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
83ee9e09
GS		 4173 (unsigned long)++PL_evalseq,
4174 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
8b38226b
AL		 4175 tmpbuf = SvPVX(temp_sv);
4176 len = SvCUR(temp_sv);
83ee9e09
GS		 4177 }
4178 else
d9fad198 4179 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
f4dd75d9 4180 SAVECOPFILE_FREE(&PL_compiling);
57843af0 4181 CopFILE_set(&PL_compiling, tmpbuf+2);
f4dd75d9 4182 SAVECOPLINE(&PL_compiling);
57843af0 4183 CopLINE_set(&PL_compiling, 1);
55497cff 4184 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
4185 deleting the eval's FILEGV from the stash before gv_check() runs
4186 (i.e. before run-time proper). To work around the coredump that
4187 ensues, we always turn GvMULTI_on for any globals that were
4188 introduced within evals. See force_ident(). GSAR 96-10-12 */
b3ac6de7 4189 SAVEHINTS();
7d789282
FC		 4190 PL_hints = PL_op->op_private & OPpEVAL_COPHH
4191 ? PL_curcop->cop_hints : PL_op->op_targ;
cda55376
AV		 4192 if (saved_hh) {
4193 /* SAVEHINTS created a new HV in PL_hintgv, which we need to GC */
4194 SvREFCNT_dec(GvHV(PL_hintgv));
0d863452 4195 GvHV(PL_hintgv) = saved_hh;
cda55376 4196 }
68da3b2f 4197 SAVECOMPILEWARNINGS();
72dc9ed5 4198 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
20439bc7 4199 cophh_free(CopHINTHASH_get(&PL_compiling));
aebc0cbe 4200 if (Perl_cop_fetch_label(aTHX_ PL_curcop, NULL, NULL)) {
47550813
NC		 4201 /* The label, if present, is the first entry on the chain. So rather
4202 than writing a blank label in front of it (which involves an
4203 allocation), just use the next entry in the chain. */
4204 PL_compiling.cop_hints_hash
20439bc7 4205 = cophh_copy(PL_curcop->cop_hints_hash->refcounted_he_next);
47550813 4206 /* Check the assumption that this removed the label. */
aebc0cbe 4207 assert(Perl_cop_fetch_label(aTHX_ &PL_compiling, NULL, NULL) == NULL);
47550813
NC		 4208 }
4209 else
20439bc7 4210 PL_compiling.cop_hints_hash = cophh_copy(PL_curcop->cop_hints_hash);
d819b83a
DM		 4211 /* special case: an eval '' executed within the DB package gets lexically
4212 * placed in the first non-DB CV rather than the current CV - this
4213 * allows the debugger to execute code, find lexicals etc, in the
4214 * scope of the code being debugged. Passing &seq gets find_runcv
4215 * to do the dirty work for us */
4216 runcv = find_runcv(&seq);
a0d0e21e 4217
6b35e009 4218 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
6b75f042 4219 PUSHEVAL(cx, 0);
f39bc417 4220 cx->blk_eval.retop = PL_op->op_next;
a0d0e21e
LW		 4221
4222 /* prepare to compile string */
4223
a44e3ce2 4224 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash)
bdc0bf6f 4225 save_lines(CopFILEAV(&PL_compiling), PL_parser->linestr);
78da7625
FC		 4226 else {
4227 char *const safestr = savepvn(tmpbuf, len);
4228 SAVEDELETE(PL_defstash, safestr, len);
4229 saved_delete = TRUE;
4230 }
4231
a0d0e21e 4232 PUTBACK;
f9bddea7
NC		 4233
4234 if (doeval(gimme, NULL, runcv, seq)) {
4235 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4236 ? (PERLDB_LINE || PERLDB_SAVESRC)
4237 : PERLDB_SAVESRC_NOSUBS) {
4238 /* Retain the filegv we created. */
78da7625 4239 } else if (!saved_delete) {
f9bddea7
NC		 4240 char *const safestr = savepvn(tmpbuf, len);
4241 SAVEDELETE(PL_defstash, safestr, len);
4242 }
4243 return DOCATCH(PL_eval_start);
4244 } else {
486ec47a 4245 /* We have already left the scope set up earlier thanks to the LEAVE
f9bddea7 4246 in doeval(). */
eb044b10
NC		 4247 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4248 ? (PERLDB_LINE || PERLDB_SAVESRC)
4249 : PERLDB_SAVESRC_INVALID) {
f9bddea7 4250 /* Retain the filegv we created. */
7857f360 4251 } else if (!saved_delete) {
f9bddea7
NC		 4252 (void)hv_delete(PL_defstash, tmpbuf, len, G_DISCARD);
4253 }
4254 return PL_op->op_next;
4255 }
a0d0e21e
LW		 4256}
4257
4258PP(pp_leaveeval)
4259{
27da23d5 4260 dVAR; dSP;
a0d0e21e
LW		 4261 SV **newsp;
4262 PMOP *newpm;
4263 I32 gimme;
c09156bb 4264 register PERL_CONTEXT *cx;
a0d0e21e 4265 OP *retop;
06b5626a 4266 const U8 save_flags = PL_op -> op_flags;
a0d0e21e 4267 I32 optype;
b6494f15 4268 SV *namesv;
a0d0e21e 4269
011c3814 4270 PERL_ASYNC_CHECK();
a0d0e21e
LW		 4271 POPBLOCK(cx,newpm);
4272 POPEVAL(cx);
b6494f15 4273 namesv = cx->blk_eval.old_namesv;
f39bc417 4274 retop = cx->blk_eval.retop;
a0d0e21e 4275
a1f49e72 4276 TAINT_NOT;
b9d76716
VP		 4277 SP = adjust_stack_on_leave((gimme == G_VOID) ? SP : newsp, SP, newsp,
4278 gimme, SVs_TEMP);
3280af22 4279 PL_curpm = newpm; /* Don't pop $1 et al till now */
a0d0e21e 4280
4fdae800 4281#ifdef DEBUGGING
3280af22 4282 assert(CvDEPTH(PL_compcv) == 1);
4fdae800 4283#endif
3280af22 4284 CvDEPTH(PL_compcv) = 0;
4fdae800 4285
1ce6579f 4286 if (optype == OP_REQUIRE &&
924508f0 4287 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
54310121 4288 {
1ce6579f 4289 /* Unassume the success we assumed earlier. */
b6494f15 4290 (void)hv_delete(GvHVn(PL_incgv),
ecad31f0 4291 SvPVX_const(namesv),
c60dbbc3 4292 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
b6494f15
VP		 4293 G_DISCARD);
4294 retop = Perl_die(aTHX_ "%"SVf" did not return a true value",
4295 SVfARG(namesv));
c5df3096 4296 /* die_unwind() did LEAVE, or we won't be here */
f46d017c
GS		 4297 }
4298 else {
d343c3ef 4299 LEAVE_with_name("eval");
8433848b 4300 if (!(save_flags & OPf_SPECIAL)) {
ab69dbc2 4301 CLEAR_ERRSV();
8433848b 4302 }
a0d0e21e 4303 }
a0d0e21e
LW		 4304
4305 RETURNOP(retop);
4306}
4307
edb2152a
NC		 4308/* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
4309 close to the related Perl_create_eval_scope. */
4310void
4311Perl_delete_eval_scope(pTHX)
a0d0e21e 4312{
edb2152a
NC		 4313 SV **newsp;
4314 PMOP *newpm;
4315 I32 gimme;
c09156bb 4316 register PERL_CONTEXT *cx;
edb2152a
NC		 4317 I32 optype;
4318
4319 POPBLOCK(cx,newpm);
4320 POPEVAL(cx);
4321 PL_curpm = newpm;
d343c3ef 4322 LEAVE_with_name("eval_scope");
edb2152a
NC		 4323 PERL_UNUSED_VAR(newsp);
4324 PERL_UNUSED_VAR(gimme);
4325 PERL_UNUSED_VAR(optype);
4326}
a0d0e21e 4327
edb2152a
NC		 4328/* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
4329 also needed by Perl_fold_constants. */
4330PERL_CONTEXT *
4331Perl_create_eval_scope(pTHX_ U32 flags)
4332{
4333 PERL_CONTEXT *cx;
4334 const I32 gimme = GIMME_V;
4335
d343c3ef 4336 ENTER_with_name("eval_scope");
a0d0e21e
LW		 4337 SAVETMPS;
4338
edb2152a 4339 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), PL_stack_sp);
6b75f042 4340 PUSHEVAL(cx, 0);
a0d0e21e 4341
faef0170 4342 PL_in_eval = EVAL_INEVAL;
edb2152a
NC		 4343 if (flags & G_KEEPERR)
4344 PL_in_eval |= EVAL_KEEPERR;
ab69dbc2
RGS		 4345 else
4346 CLEAR_ERRSV();
edb2152a
NC		 4347 if (flags & G_FAKINGEVAL) {
4348 PL_eval_root = PL_op; /* Only needed so that goto works right. */
4349 }
4350 return cx;
4351}
4352
4353PP(pp_entertry)
4354{
4355 dVAR;
df528165 4356 PERL_CONTEXT * const cx = create_eval_scope(0);
edb2152a 4357 cx->blk_eval.retop = cLOGOP->op_other->op_next;
533c011a 4358 return DOCATCH(PL_op->op_next);
a0d0e21e
LW		 4359}
4360
4361PP(pp_leavetry)
4362{
27da23d5 4363 dVAR; dSP;
a0d0e21e
LW		 4364 SV **newsp;
4365 PMOP *newpm;
4366 I32 gimme;
c09156bb 4367 register PERL_CONTEXT *cx;
a0d0e21e
LW		 4368 I32 optype;
4369
011c3814 4370 PERL_ASYNC_CHECK();
a0d0e21e
LW		 4371 POPBLOCK(cx,newpm);
4372 POPEVAL(cx);
9d4ba2ae 4373 PERL_UNUSED_VAR(optype);
a0d0e21e 4374
a1f49e72 4375 TAINT_NOT;
b9d76716 4376 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
3280af22 4377 PL_curpm = newpm; /* Don't pop $1 et al till now */
a0d0e21e 4378
d343c3ef 4379 LEAVE_with_name("eval_scope");
ab69dbc2 4380 CLEAR_ERRSV();
745cf2ff 4381 RETURN;
a0d0e21e
LW		 4382}
4383
0d863452
RH		 4384PP(pp_entergiven)
4385{
4386 dVAR; dSP;
4387 register PERL_CONTEXT *cx;
4388 const I32 gimme = GIMME_V;
4389
d343c3ef 4390 ENTER_with_name("given");
0d863452
RH		 4391 SAVETMPS;
4392
87e4a53a 4393 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
f7010667 4394 sv_setsv_mg(PAD_SV(PL_op->op_targ), POPs);
0d863452
RH		 4395
4396 PUSHBLOCK(cx, CXt_GIVEN, SP);
4397 PUSHGIVEN(cx);
4398
4399 RETURN;
4400}
4401
4402PP(pp_leavegiven)
4403{
4404 dVAR; dSP;
4405 register PERL_CONTEXT *cx;
4406 I32 gimme;
4407 SV **newsp;
4408 PMOP *newpm;
96a5add6 4409 PERL_UNUSED_CONTEXT;
0d863452
RH		 4410
4411 POPBLOCK(cx,newpm);
4412 assert(CxTYPE(cx) == CXt_GIVEN);
0d863452 4413
25b991bf 4414 TAINT_NOT;
b9d76716 4415 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
25b991bf 4416 PL_curpm = newpm; /* Don't pop $1 et al till now */
0d863452 4417
d343c3ef 4418 LEAVE_with_name("given");
25b991bf 4419 RETURN;
0d863452
RH		 4420}
4421
4422/* Helper routines used by pp_smartmatch */
4136a0f7 4423STATIC PMOP *
84679df5 4424S_make_matcher(pTHX_ REGEXP *re)
0d863452 4425{
97aff369 4426 dVAR;
0d863452 4427 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
7918f24d
NC		 4428
4429 PERL_ARGS_ASSERT_MAKE_MATCHER;
4430
d6106309 4431 PM_SETRE(matcher, ReREFCNT_inc(re));
7918f24d 4432
0d863452 4433 SAVEFREEOP((OP *) matcher);
d343c3ef 4434 ENTER_with_name("matcher"); SAVETMPS;
0d863452
RH		 4435 SAVEOP();
4436 return matcher;
4437}
4438
4136a0f7 4439STATIC bool
0d863452
RH		 4440S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
4441{
97aff369 4442 dVAR;
0d863452 4443 dSP;
7918f24d
NC		 4444
4445 PERL_ARGS_ASSERT_MATCHER_MATCHES_SV;
0d863452
RH		 4446
4447 PL_op = (OP *) matcher;
4448 XPUSHs(sv);
4449 PUTBACK;
897d3989 4450 (void) Perl_pp_match(aTHX);
0d863452
RH		 4451 SPAGAIN;
4452 return (SvTRUEx(POPs));
4453}
4454
4136a0f7 4455STATIC void
0d863452
RH		 4456S_destroy_matcher(pTHX_ PMOP *matcher)
4457{
97aff369 4458 dVAR;
7918f24d
NC		 4459
4460 PERL_ARGS_ASSERT_DESTROY_MATCHER;
0d863452 4461 PERL_UNUSED_ARG(matcher);
7918f24d 4462
0d863452 4463 FREETMPS;
d343c3ef 4464 LEAVE_with_name("matcher");
0d863452
RH		 4465}
4466
4467/* Do a smart match */
4468PP(pp_smartmatch)
4469{
d7c0d282 4470 DEBUG_M(Perl_deb(aTHX_ "Starting smart match resolution\n"));
be88a5c3 4471 return do_smartmatch(NULL, NULL, 0);
0d863452
RH		 4472}
4473
4b021f5f
RGS		 4474/* This version of do_smartmatch() implements the
4475 * table of smart matches that is found in perlsyn.
0d863452 4476 */
4136a0f7 4477STATIC OP *
be88a5c3 4478S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other, const bool copied)
0d863452 4479{
97aff369 4480 dVAR;
0d863452
RH		 4481 dSP;
4482
41e726ac 4483 bool object_on_left = FALSE;
0d863452
RH		 4484 SV *e = TOPs; /* e is for 'expression' */
4485 SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */
a566f585 4486
6f1401dc
DM		 4487 /* Take care only to invoke mg_get() once for each argument.
4488 * Currently we do this by copying the SV if it's magical. */
4489 if (d) {
be88a5c3 4490 if (!copied && SvGMAGICAL(d))
6f1401dc
DM		 4491 d = sv_mortalcopy(d);
4492 }
4493 else
4494 d = &PL_sv_undef;
4495
4496 assert(e);
4497 if (SvGMAGICAL(e))
4498 e = sv_mortalcopy(e);
4499
2c9d2554 4500 /* First of all, handle overload magic of the rightmost argument */
6d743019 4501 if (SvAMAGIC(e)) {
d7c0d282
DM		 4502 SV * tmpsv;
4503 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n"));
4504 DEBUG_M(Perl_deb(aTHX_ " attempting overload\n"));
4505
4506 tmpsv = amagic_call(d, e, smart_amg, 0);
7c41e62e
RGS		 4507 if (tmpsv) {
4508 SPAGAIN;
4509 (void)POPs;
4510 SETs(tmpsv);
4511 RETURN;
4512 }
d7c0d282 4513 DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; continuing...\n"));
7c41e62e 4514 }
62ec5f58 4515
0d863452
RH		 4516 SP -= 2; /* Pop the values */
4517
0d863452 4518
b0138e99 4519 /* ~~ undef */
62ec5f58 4520 if (!SvOK(e)) {
d7c0d282 4521 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-undef\n"));
62ec5f58 4522 if (SvOK(d))
33570f8b
RGS		 4523 RETPUSHNO;
4524 else
62ec5f58 4525 RETPUSHYES;
33570f8b 4526 }
e67b97bd 4527
d7c0d282
DM		 4528 if (sv_isobject(e) && (SvTYPE(SvRV(e)) != SVt_REGEXP)) {
4529 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n"));
62ec5f58 4530 Perl_croak(aTHX_ "Smart matching a non-overloaded object breaks encapsulation");
d7c0d282 4531 }
41e726ac
RGS		 4532 if (sv_isobject(d) && (SvTYPE(SvRV(d)) != SVt_REGEXP))
4533 object_on_left = TRUE;
62ec5f58 4534
b0138e99 4535 /* ~~ sub */
a4a197da 4536 if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVCV) {
0d863452 4537 I32 c;
41e726ac
RGS		 4538 if (object_on_left) {
4539 goto sm_any_sub; /* Treat objects like scalars */
4540 }
4541 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
a4a197da
RGS		 4542 /* Test sub truth for each key */
4543 HE *he;
4544 bool andedresults = TRUE;
4545 HV *hv = (HV*) SvRV(d);
168ff818 4546 I32 numkeys = hv_iterinit(hv);
d7c0d282 4547 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-CodeRef\n"));
168ff818 4548 if (numkeys == 0)
07edf497 4549 RETPUSHYES;
a4a197da 4550 while ( (he = hv_iternext(hv)) ) {
d7c0d282 4551 DEBUG_M(Perl_deb(aTHX_ " testing hash key...\n"));
d343c3ef 4552 ENTER_with_name("smartmatch_hash_key_test");
a4a197da
RGS		 4553 SAVETMPS;
4554 PUSHMARK(SP);
4555 PUSHs(hv_iterkeysv(he));
4556 PUTBACK;
4557 c = call_sv(e, G_SCALAR);
4558 SPAGAIN;
4559 if (c == 0)
4560 andedresults = FALSE;
4561 else
4562 andedresults = SvTRUEx(POPs) && andedresults;
4563 FREETMPS;
d343c3ef 4564 LEAVE_with_name("smartmatch_hash_key_test");
a4a197da
RGS		 4565 }
4566 if (andedresults)
4567 RETPUSHYES;
4568 else
4569 RETPUSHNO;
4570 }
4571 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4572 /* Test sub truth for each element */
4573 I32 i;
4574 bool andedresults = TRUE;
4575 AV *av = (AV*) SvRV(d);
4576 const I32 len = av_len(av);
d7c0d282 4577 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-CodeRef\n"));
168ff818 4578 if (len == -1)
07edf497 4579 RETPUSHYES;
a4a197da
RGS		 4580 for (i = 0; i <= len; ++i) {
4581 SV * const * const svp = av_fetch(av, i, FALSE);
d7c0d282 4582 DEBUG_M(Perl_deb(aTHX_ " testing array element...\n"));
d343c3ef 4583 ENTER_with_name("smartmatch_array_elem_test");
a4a197da
RGS		 4584 SAVETMPS;
4585 PUSHMARK(SP);
4586 if (svp)
4587 PUSHs(*svp);
4588 PUTBACK;
4589 c = call_sv(e, G_SCALAR);
4590 SPAGAIN;
4591 if (c == 0)
4592 andedresults = FALSE;
4593 else
4594 andedresults = SvTRUEx(POPs) && andedresults;
4595 FREETMPS;
d343c3ef 4596 LEAVE_with_name("smartmatch_array_elem_test");
a4a197da
RGS		 4597 }
4598 if (andedresults)
4599 RETPUSHYES;
4600 else
4601 RETPUSHNO;
4602 }
4603 else {
41e726ac 4604 sm_any_sub:
d7c0d282 4605 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-CodeRef\n"));
d343c3ef 4606 ENTER_with_name("smartmatch_coderef");
a4a197da
RGS		 4607 SAVETMPS;
4608 PUSHMARK(SP);
4609 PUSHs(d);
4610 PUTBACK;
4611 c = call_sv(e, G_SCALAR);
4612 SPAGAIN;
4613 if (c == 0)
4614 PUSHs(&PL_sv_no);
4615 else if (SvTEMP(TOPs))
4616 SvREFCNT_inc_void(TOPs);
4617 FREETMPS;
d343c3ef 4618 LEAVE_with_name("smartmatch_coderef");
a4a197da
RGS		 4619 RETURN;
4620 }
0d863452 4621 }
b0138e99 4622 /* ~~ %hash */
61a621c6 4623 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVHV) {
41e726ac
RGS		 4624 if (object_on_left) {
4625 goto sm_any_hash; /* Treat objects like scalars */
4626 }
4627 else if (!SvOK(d)) {
d7c0d282 4628 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash ($a undef)\n"));
61a621c6
RGS		 4629 RETPUSHNO;
4630 }
4631 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
0d863452
RH		 4632 /* Check that the key-sets are identical */
4633 HE *he;
61a621c6 4634 HV *other_hv = MUTABLE_HV(SvRV(d));
0d863452
RH		 4635 bool tied = FALSE;
4636 bool other_tied = FALSE;
4637 U32 this_key_count = 0,
4638 other_key_count = 0;
33ed63a2 4639 HV *hv = MUTABLE_HV(SvRV(e));
d7c0d282
DM		 4640
4641 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Hash\n"));
0d863452 4642 /* Tied hashes don't know how many keys they have. */
33ed63a2 4643 if (SvTIED_mg((SV*)hv, PERL_MAGIC_tied)) {
0d863452
RH		 4644 tied = TRUE;
4645 }
ad64d0ec 4646 else if (SvTIED_mg((const SV *)other_hv, PERL_MAGIC_tied)) {
c445ea15 4647 HV * const temp = other_hv;
33ed63a2
RGS		 4648 other_hv = hv;
4649 hv = temp;
0d863452
RH		 4650 tied = TRUE;
4651 }
ad64d0ec 4652 if (SvTIED_mg((const SV *)other_hv, PERL_MAGIC_tied))
0d863452
RH		 4653 other_tied = TRUE;
4654
33ed63a2 4655 if (!tied && HvUSEDKEYS((const HV *) hv) != HvUSEDKEYS(other_hv))
0d863452
RH		 4656 RETPUSHNO;
4657
4658 /* The hashes have the same number of keys, so it suffices
4659 to check that one is a subset of the other. */
33ed63a2
RGS		 4660 (void) hv_iterinit(hv);
4661 while ( (he = hv_iternext(hv)) ) {
b15feb55 4662 SV *key = hv_iterkeysv(he);
d7c0d282
DM		 4663
4664 DEBUG_M(Perl_deb(aTHX_ " comparing hash key...\n"));
0d863452
RH		 4665 ++ this_key_count;
4666
b15feb55 4667 if(!hv_exists_ent(other_hv, key, 0)) {
33ed63a2 4668 (void) hv_iterinit(hv); /* reset iterator */
0d863452
RH		 4669 RETPUSHNO;
4670 }
4671 }
4672
4673 if (other_tied) {
4674 (void) hv_iterinit(other_hv);
4675 while ( hv_iternext(other_hv) )
4676 ++other_key_count;
4677 }
4678 else
4679 other_key_count = HvUSEDKEYS(other_hv);
4680
4681 if (this_key_count != other_key_count)
4682 RETPUSHNO;
4683 else
4684 RETPUSHYES;
4685 }
61a621c6
RGS		 4686 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4687 AV * const other_av = MUTABLE_AV(SvRV(d));
c445ea15 4688 const I32 other_len = av_len(other_av) + 1;
0d863452 4689 I32 i;
33ed63a2 4690 HV *hv = MUTABLE_HV(SvRV(e));
71b0fb34 4691
d7c0d282 4692 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Hash\n"));
71b0fb34 4693 for (i = 0; i < other_len; ++i) {
c445ea15 4694 SV ** const svp = av_fetch(other_av, i, FALSE);
d7c0d282 4695 DEBUG_M(Perl_deb(aTHX_ " checking for key existence...\n"));
71b0fb34 4696 if (svp) { /* ??? When can this not happen? */
b15feb55 4697 if (hv_exists_ent(hv, *svp, 0))
71b0fb34
DK		 4698 RETPUSHYES;
4699 }
0d863452 4700 }
71b0fb34 4701 RETPUSHNO;
0d863452 4702 }
a566f585 4703 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) {
d7c0d282 4704 DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Hash\n"));
ea0c2dbd
RGS		 4705 sm_regex_hash:
4706 {
4707 PMOP * const matcher = make_matcher((REGEXP*) SvRV(d));
4708 HE *he;
4709 HV *hv = MUTABLE_HV(SvRV(e));
4710
4711 (void) hv_iterinit(hv);
4712 while ( (he = hv_iternext(hv)) ) {
d7c0d282 4713 DEBUG_M(Perl_deb(aTHX_ " testing key against pattern...\n"));
ea0c2dbd
RGS		 4714 if (matcher_matches_sv(matcher, hv_iterkeysv(he))) {
4715 (void) hv_iterinit(hv);
4716 destroy_matcher(matcher);
4717 RETPUSHYES;
4718 }
0d863452 4719 }
ea0c2dbd
RGS		 4720 destroy_matcher(matcher);
4721 RETPUSHNO;
0d863452 4722 }
0d863452
RH		 4723 }
4724 else {
41e726ac 4725 sm_any_hash:
d7c0d282 4726 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash\n"));
61a621c6 4727 if (hv_exists_ent(MUTABLE_HV(SvRV(e)), d, 0))
0d863452
RH		 4728 RETPUSHYES;
4729 else
4730 RETPUSHNO;
4731 }
4732 }
b0138e99
RGS		 4733 /* ~~ @array */
4734 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVAV) {
41e726ac
RGS		 4735 if (object_on_left) {
4736 goto sm_any_array; /* Treat objects like scalars */
4737 }
4738 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
b0138e99
RGS		 4739 AV * const other_av = MUTABLE_AV(SvRV(e));
4740 const I32 other_len = av_len(other_av) + 1;
4741 I32 i;
4742
d7c0d282 4743 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Array\n"));
b0138e99
RGS		 4744 for (i = 0; i < other_len; ++i) {
4745 SV ** const svp = av_fetch(other_av, i, FALSE);
d7c0d282
DM		 4746
4747 DEBUG_M(Perl_deb(aTHX_ " testing for key existence...\n"));
b0138e99 4748 if (svp) { /* ??? When can this not happen? */
b15feb55 4749 if (hv_exists_ent(MUTABLE_HV(SvRV(d)), *svp, 0))
b0138e99
RGS		 4750 RETPUSHYES;
4751 }
4752 }
4753 RETPUSHNO;
4754 }
4755 if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4756 AV *other_av = MUTABLE_AV(SvRV(d));
d7c0d282 4757 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Array\n"));
b0138e99 4758 if (av_len(MUTABLE_AV(SvRV(e))) != av_len(other_av))
0d863452
RH		 4759 RETPUSHNO;
4760 else {
4761 I32 i;
c445ea15 4762 const I32 other_len = av_len(other_av);
0d863452 4763
a0714e2c 4764 if (NULL == seen_this) {
0d863452 4765 seen_this = newHV();
ad64d0ec 4766 (void) sv_2mortal(MUTABLE_SV(seen_this));
0d863452 4767 }
a0714e2c 4768 if (NULL == seen_other) {
6bc991bf 4769 seen_other = newHV();
ad64d0ec 4770 (void) sv_2mortal(MUTABLE_SV(seen_other));
0d863452
RH		 4771 }
4772 for(i = 0; i <= other_len; ++i) {
b0138e99 4773 SV * const * const this_elem = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
c445ea15
AL		 4774 SV * const * const other_elem = av_fetch(other_av, i, FALSE);
4775
0d863452 4776 if (!this_elem || !other_elem) {
69c3dccf
RGS		 4777 if ((this_elem && SvOK(*this_elem))
4778 || (other_elem && SvOK(*other_elem)))
0d863452
RH		 4779 RETPUSHNO;
4780 }
365c4e3d
RGS		 4781 else if (hv_exists_ent(seen_this,
4782 sv_2mortal(newSViv(PTR2IV(*this_elem))), 0) ||
4783 hv_exists_ent(seen_other,
4784 sv_2mortal(newSViv(PTR2IV(*other_elem))), 0))
0d863452
RH		 4785 {
4786 if (*this_elem != *other_elem)
4787 RETPUSHNO;
4788 }
4789 else {
04fe65b0
RGS		 4790 (void)hv_store_ent(seen_this,
4791 sv_2mortal(newSViv(PTR2IV(*this_elem))),
4792 &PL_sv_undef, 0);
4793 (void)hv_store_ent(seen_other,
4794 sv_2mortal(newSViv(PTR2IV(*other_elem))),
4795 &PL_sv_undef, 0);
0d863452 4796 PUSHs(*other_elem);
a566f585 4797 PUSHs(*this_elem);
0d863452
RH		 4798
4799 PUTBACK;
d7c0d282 4800 DEBUG_M(Perl_deb(aTHX_ " recursively comparing array element...\n"));
be88a5c3 4801 (void) do_smartmatch(seen_this, seen_other, 0);
0d863452 4802 SPAGAIN;
d7c0d282 4803 DEBUG_M(Perl_deb(aTHX_ " recursion finished\n"));
0d863452
RH		 4804
4805 if (!SvTRUEx(POPs))
4806 RETPUSHNO;
4807 }
4808 }
4809 RETPUSHYES;
4810 }
4811 }
a566f585 4812 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) {
d7c0d282 4813 DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Array\n"));
ea0c2dbd
RGS		 4814 sm_regex_array:
4815 {
4816 PMOP * const matcher = make_matcher((REGEXP*) SvRV(d));
4817 const I32 this_len = av_len(MUTABLE_AV(SvRV(e)));
4818 I32 i;
0d863452 4819
ea0c2dbd
RGS		 4820 for(i = 0; i <= this_len; ++i) {
4821 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
d7c0d282 4822 DEBUG_M(Perl_deb(aTHX_ " testing element against pattern...\n"));
ea0c2dbd
RGS		 4823 if (svp && matcher_matches_sv(matcher, *svp)) {
4824 destroy_matcher(matcher);
4825 RETPUSHYES;
4826 }
0d863452 4827 }
ea0c2dbd
RGS		 4828 destroy_matcher(matcher);
4829 RETPUSHNO;
0d863452 4830 }
0d863452 4831 }
015eb7b9
RGS		 4832 else if (!SvOK(d)) {
4833 /* undef ~~ array */
4834 const I32 this_len = av_len(MUTABLE_AV(SvRV(e)));
0d863452
RH		 4835 I32 i;
4836
d7c0d282 4837 DEBUG_M(Perl_deb(aTHX_ " applying rule Undef-Array\n"));
015eb7b9 4838 for (i = 0; i <= this_len; ++i) {
b0138e99 4839 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
d7c0d282 4840 DEBUG_M(Perl_deb(aTHX_ " testing for undef element...\n"));
015eb7b9 4841 if (!svp || !SvOK(*svp))
0d863452
RH		 4842 RETPUSHYES;
4843 }
4844 RETPUSHNO;
4845 }
015eb7b9 4846 else {
41e726ac
RGS		 4847 sm_any_array:
4848 {
4849 I32 i;
4850 const I32 this_len = av_len(MUTABLE_AV(SvRV(e)));
0d863452 4851
d7c0d282 4852 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Array\n"));
41e726ac
RGS		 4853 for (i = 0; i <= this_len; ++i) {
4854 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4855 if (!svp)
4856 continue;
015eb7b9 4857
41e726ac
RGS		 4858 PUSHs(d);
4859 PUSHs(*svp);
4860 PUTBACK;
4861 /* infinite recursion isn't supposed to happen here */
d7c0d282 4862 DEBUG_M(Perl_deb(aTHX_ " recursively testing array element...\n"));
be88a5c3 4863 (void) do_smartmatch(NULL, NULL, 1);
41e726ac 4864 SPAGAIN;
d7c0d282 4865 DEBUG_M(Perl_deb(aTHX_ " recursion finished\n"));
41e726ac
RGS		 4866 if (SvTRUEx(POPs))
4867 RETPUSHYES;
4868 }
4869 RETPUSHNO;
0d863452 4870 }
0d863452
RH		 4871 }
4872 }
b0138e99 4873 /* ~~ qr// */
a566f585 4874 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_REGEXP) {
ea0c2dbd
RGS		 4875 if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4876 SV *t = d; d = e; e = t;
d7c0d282 4877 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Regex\n"));
ea0c2dbd
RGS		 4878 goto sm_regex_hash;
4879 }
4880 else if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4881 SV *t = d; d = e; e = t;
d7c0d282 4882 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Regex\n"));
ea0c2dbd
RGS		 4883 goto sm_regex_array;
4884 }
4885 else {
4886 PMOP * const matcher = make_matcher((REGEXP*) SvRV(e));
0d863452 4887
d7c0d282 4888 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Regex\n"));
ea0c2dbd
RGS		 4889 PUTBACK;
4890 PUSHs(matcher_matches_sv(matcher, d)
4891 ? &PL_sv_yes
4892 : &PL_sv_no);
4893 destroy_matcher(matcher);
4894 RETURN;
4895 }
0d863452 4896 }
b0138e99 4897 /* ~~ scalar */
2c9d2554
RGS		 4898 /* See if there is overload magic on left */
4899 else if (object_on_left && SvAMAGIC(d)) {
4900 SV *tmpsv;
d7c0d282
DM		 4901 DEBUG_M(Perl_deb(aTHX_ " applying rule Object-Any\n"));
4902 DEBUG_M(Perl_deb(aTHX_ " attempting overload\n"));
2c9d2554
RGS		 4903 PUSHs(d); PUSHs(e);
4904 PUTBACK;
4905 tmpsv = amagic_call(d, e, smart_amg, AMGf_noright);
4906 if (tmpsv) {
4907 SPAGAIN;
4908 (void)POPs;
4909 SETs(tmpsv);
4910 RETURN;
4911 }
4912 SP -= 2;
d7c0d282 4913 DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; falling back...\n"));
2c9d2554
RGS		 4914 goto sm_any_scalar;
4915 }
fb51372e
RGS		 4916 else if (!SvOK(d)) {
4917 /* undef ~~ scalar ; we already know that the scalar is SvOK */
d7c0d282 4918 DEBUG_M(Perl_deb(aTHX_ " applying rule undef-Any\n"));
fb51372e
RGS		 4919 RETPUSHNO;
4920 }
2c9d2554
RGS		 4921 else
4922 sm_any_scalar:
4923 if (SvNIOK(e) || (SvPOK(e) && looks_like_number(e) && SvNIOK(d))) {
d7c0d282
DM		 4924 DEBUG_M(if (SvNIOK(e))
4925 Perl_deb(aTHX_ " applying rule Any-Num\n");
4926 else
4927 Perl_deb(aTHX_ " applying rule Num-numish\n");
4928 );
33ed63a2 4929 /* numeric comparison */
0d863452
RH		 4930 PUSHs(d); PUSHs(e);
4931 PUTBACK;
a98fe34d 4932 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
897d3989 4933 (void) Perl_pp_i_eq(aTHX);
0d863452 4934 else
897d3989 4935 (void) Perl_pp_eq(aTHX);
0d863452
RH		 4936 SPAGAIN;
4937 if (SvTRUEx(POPs))
4938 RETPUSHYES;
4939 else
4940 RETPUSHNO;
4941 }
4942
4943 /* As a last resort, use string comparison */
d7c0d282 4944 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Any\n"));
0d863452
RH		 4945 PUSHs(d); PUSHs(e);
4946 PUTBACK;
897d3989 4947 return Perl_pp_seq(aTHX);
0d863452
RH		 4948}
4949
4950PP(pp_enterwhen)
4951{
4952 dVAR; dSP;
4953 register PERL_CONTEXT *cx;
4954 const I32 gimme = GIMME_V;
4955
4956 /* This is essentially an optimization: if the match
4957 fails, we don't want to push a context and then
4958 pop it again right away, so we skip straight
4959 to the op that follows the leavewhen.
25b991bf 4960 RETURNOP calls PUTBACK which restores the stack pointer after the POPs.
0d863452
RH		 4961 */
4962 if ((0 == (PL_op->op_flags & OPf_SPECIAL)) && !SvTRUEx(POPs))
25b991bf 4963 RETURNOP(cLOGOP->op_other->op_next);
0d863452 4964
c08f093b 4965 ENTER_with_name("when");
0d863452
RH		 4966 SAVETMPS;
4967
4968 PUSHBLOCK(cx, CXt_WHEN, SP);
4969 PUSHWHEN(cx);
4970
4971 RETURN;
4972}
4973
4974PP(pp_leavewhen)
4975{
4976 dVAR; dSP;
c08f093b 4977 I32 cxix;
0d863452 4978 register PERL_CONTEXT *cx;
c08f093b 4979 I32 gimme;
0d863452
RH		 4980 SV **newsp;
4981 PMOP *newpm;
4982
c08f093b
VP		 4983 cxix = dopoptogiven(cxstack_ix);
4984 if (cxix < 0)
4985 DIE(aTHX_ "Can't use when() outside a topicalizer");
4986
0d863452
RH		 4987 POPBLOCK(cx,newpm);
4988 assert(CxTYPE(cx) == CXt_WHEN);
4989
c08f093b
VP		 4990 TAINT_NOT;
4991 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
0d863452
RH		 4992 PL_curpm = newpm; /* pop $1 et al */
4993
c08f093b
VP		 4994 LEAVE_with_name("when");
4995
4996 if (cxix < cxstack_ix)
4997 dounwind(cxix);
4998
4999 cx = &cxstack[cxix];
5000
5001 if (CxFOREACH(cx)) {
5002 /* clear off anything above the scope we're re-entering */
5003 I32 inner = PL_scopestack_ix;
5004
5005 TOPBLOCK(cx);
5006 if (PL_scopestack_ix < inner)
5007 leave_scope(PL_scopestack[PL_scopestack_ix]);
5008 PL_curcop = cx->blk_oldcop;
5009
5010 return cx->blk_loop.my_op->op_nextop;
5011 }
5012 else
b1b5a4ae 5013 RETURNOP(cx->blk_givwhen.leave_op);
0d863452
RH		 5014}
5015
5016PP(pp_continue)
5017{
c08f093b 5018 dVAR; dSP;
0d863452
RH		 5019 I32 cxix;
5020 register PERL_CONTEXT *cx;
c08f093b
VP		 5021 I32 gimme;
5022 SV **newsp;
5023 PMOP *newpm;
7be5bd17
FR		 5024
5025 PERL_UNUSED_VAR(gimme);
0d863452
RH		 5026
5027 cxix = dopoptowhen(cxstack_ix);
5028 if (cxix < 0)
5029 DIE(aTHX_ "Can't \"continue\" outside a when block");
c08f093b 5030
0d863452
RH		 5031 if (cxix < cxstack_ix)
5032 dounwind(cxix);
5033
c08f093b
VP		 5034 POPBLOCK(cx,newpm);
5035 assert(CxTYPE(cx) == CXt_WHEN);
5036
5037 SP = newsp;
5038 PL_curpm = newpm; /* pop $1 et al */
5039
5040 LEAVE_with_name("when");
5041 RETURNOP(cx->blk_givwhen.leave_op->op_next);
0d863452
RH		 5042}
5043
5044PP(pp_break)
5045{
5046 dVAR;
5047 I32 cxix;
5048 register PERL_CONTEXT *cx;
25b991bf 5049
0d863452 5050 cxix = dopoptogiven(cxstack_ix);
c08f093b
VP		 5051 if (cxix < 0)
5052 DIE(aTHX_ "Can't \"break\" outside a given block");
5053
5054 cx = &cxstack[cxix];
5055 if (CxFOREACH(cx))
0d863452
RH		 5056 DIE(aTHX_ "Can't \"break\" in a loop topicalizer");
5057
5058 if (cxix < cxstack_ix)
5059 dounwind(cxix);
0d863452 5060
0787ea8a
VP		 5061 /* Restore the sp at the time we entered the given block */
5062 TOPBLOCK(cx);
5063
c08f093b 5064 return cx->blk_givwhen.leave_op;
0d863452
RH		 5065}
5066
74e0ddf7 5067static MAGIC *
cea2e8a9 5068S_doparseform(pTHX_ SV *sv)
a0d0e21e
LW		 5069{
5070 STRLEN len;
37ffbfcc 5071 register char *s = SvPV(sv, len);
3808a683 5072 register char *send;
086b26f3
DM		 5073 register char *base = NULL; /* start of current field */
5074 register I32 skipspaces = 0; /* number of contiguous spaces seen */
5075 bool noblank = FALSE; /* ~ or ~~ seen on this line */
5076 bool repeat = FALSE; /* ~~ seen on this line */
5077 bool postspace = FALSE; /* a text field may need right padding */
dea28490
JJ		 5078 U32 *fops;
5079 register U32 *fpc;
086b26f3 5080 U32 *linepc = NULL; /* position of last FF_LINEMARK */
a0d0e21e 5081 register I32 arg;
086b26f3
DM		 5082 bool ischop; /* it's a ^ rather than a @ */
5083 bool unchopnum = FALSE; /* at least one @ (i.e. non-chop) num field seen */
a1b95068 5084 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
3808a683
DM		 5085 MAGIC *mg = NULL;
5086 SV *sv_copy;
a0d0e21e 5087
7918f24d
NC		 5088 PERL_ARGS_ASSERT_DOPARSEFORM;
5089
55497cff 5090 if (len == 0)
cea2e8a9 5091 Perl_croak(aTHX_ "Null picture in formline");
ac27b0f5 5092
3808a683
DM		 5093 if (SvTYPE(sv) >= SVt_PVMG) {
5094 /* This might, of course, still return NULL. */
5095 mg = mg_find(sv, PERL_MAGIC_fm);
5096 } else {
5097 sv_upgrade(sv, SVt_PVMG);
5098 }
5099
5100 if (mg) {
5101 /* still the same as previously-compiled string? */
5102 SV *old = mg->mg_obj;
5103 if ( !(!!SvUTF8(old) ^ !!SvUTF8(sv))
5104 && len == SvCUR(old)
5105 && strnEQ(SvPVX(old), SvPVX(sv), len)
b57b1734
DM		 5106 ) {
5107 DEBUG_f(PerlIO_printf(Perl_debug_log,"Re-using compiled format\n"));
3808a683 5108 return mg;
b57b1734 5109 }
3808a683 5110
b57b1734 5111 DEBUG_f(PerlIO_printf(Perl_debug_log, "Re-compiling format\n"));
3808a683
DM		 5112 Safefree(mg->mg_ptr);
5113 mg->mg_ptr = NULL;
5114 SvREFCNT_dec(old);
5115 mg->mg_obj = NULL;
5116 }
b57b1734
DM		 5117 else {
5118 DEBUG_f(PerlIO_printf(Perl_debug_log, "Compiling format\n"));
3808a683 5119 mg = sv_magicext(sv, NULL, PERL_MAGIC_fm, &PL_vtbl_fm, NULL, 0);
b57b1734 5120 }
3808a683
DM		 5121
5122 sv_copy = newSVpvn_utf8(s, len, SvUTF8(sv));
5123 s = SvPV(sv_copy, len); /* work on the copy, not the original */
5124 send = s + len;
5125
5126
815f25c6
DM		 5127 /* estimate the buffer size needed */
5128 for (base = s; s <= send; s++) {
a1b95068 5129 if (*s == '\n' || *s == '@' || *s == '^')
815f25c6
DM		 5130 maxops += 10;
5131 }
5132 s = base;
c445ea15 5133 base = NULL;
815f25c6 5134
a02a5408 5135 Newx(fops, maxops, U32);
a0d0e21e
LW		 5136 fpc = fops;
5137
5138 if (s < send) {
5139 linepc = fpc;
5140 *fpc++ = FF_LINEMARK;
5141 noblank = repeat = FALSE;
5142 base = s;
5143 }
5144
5145 while (s <= send) {
5146 switch (*s++) {
5147 default:
5148 skipspaces = 0;
5149 continue;
5150
5151 case '~':
5152 if (*s == '~') {
5153 repeat = TRUE;
b57b1734
DM		 5154 skipspaces++;
5155 s++;
a0d0e21e
LW		 5156 }
5157 noblank = TRUE;
a0d0e21e
LW		 5158 /* FALL THROUGH */
5159 case ' ': case '\t':
5160 skipspaces++;
5161 continue;
a1b95068
WL		 5162 case 0:
5163 if (s < send) {
5164 skipspaces = 0;
5165 continue;
5166 } /* else FALL THROUGH */
5167 case '\n':
a0d0e21e
LW		 5168 arg = s - base;
5169 skipspaces++;
5170 arg -= skipspaces;
5171 if (arg) {
5f05dabc 5172 if (postspace)
a0d0e21e 5173 *fpc++ = FF_SPACE;
a0d0e21e 5174 *fpc++ = FF_LITERAL;
76912796 5175 *fpc++ = (U32)arg;
a0d0e21e 5176 }
5f05dabc 5177 postspace = FALSE;
a0d0e21e
LW		 5178 if (s <= send)
5179 skipspaces--;
5180 if (skipspaces) {
5181 *fpc++ = FF_SKIP;
76912796 5182 *fpc++ = (U32)skipspaces;
a0d0e21e
LW		 5183 }
5184 skipspaces = 0;
5185 if (s <= send)
5186 *fpc++ = FF_NEWLINE;
5187 if (noblank) {
5188 *fpc++ = FF_BLANK;
5189 if (repeat)
5190 arg = fpc - linepc + 1;
5191 else
5192 arg = 0;
76912796 5193 *fpc++ = (U32)arg;
a0d0e21e
LW		 5194 }
5195 if (s < send) {
5196 linepc = fpc;
5197 *fpc++ = FF_LINEMARK;
5198 noblank = repeat = FALSE;
5199 base = s;
5200 }
5201 else
5202 s++;
5203 continue;
5204
5205 case '@':
5206 case '^':
5207 ischop = s[-1] == '^';
5208
5209 if (postspace) {
5210 *fpc++ = FF_SPACE;
5211 postspace = FALSE;
5212 }
5213 arg = (s - base) - 1;
5214 if (arg) {
5215 *fpc++ = FF_LITERAL;
76912796 5216 *fpc++ = (U32)arg;
a0d0e21e
LW		 5217 }
5218
5219 base = s - 1;
5220 *fpc++ = FF_FETCH;
086b26f3 5221 if (*s == '*') { /* @* or ^* */
a0d0e21e 5222 s++;
a1b95068
WL		 5223 *fpc++ = 2; /* skip the @* or ^* */
5224 if (ischop) {
5225 *fpc++ = FF_LINESNGL;
5226 *fpc++ = FF_CHOP;
5227 } else
5228 *fpc++ = FF_LINEGLOB;
a0d0e21e 5229 }
086b26f3 5230 else if (*s == '#' || (*s == '.' && s[1] == '#')) { /* @###, ^### */
a701009a 5231 arg = ischop ? FORM_NUM_BLANK : 0;
a0d0e21e
LW		 5232 base = s - 1;
5233 while (*s == '#')
5234 s++;
5235 if (*s == '.') {
06b5626a 5236 const char * const f = ++s;
a0d0e21e
LW		 5237 while (*s == '#')
5238 s++;
a701009a 5239 arg |= FORM_NUM_POINT + (s - f);
a0d0e21e
LW		 5240 }
5241 *fpc++ = s - base; /* fieldsize for FETCH */
5242 *fpc++ = FF_DECIMAL;
76912796 5243 *fpc++ = (U32)arg;
a1b95068 5244 unchopnum |= ! ischop;
784707d5
JP		 5245 }
5246 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
a701009a 5247 arg = ischop ? FORM_NUM_BLANK : 0;
784707d5
JP		 5248 base = s - 1;
5249 s++; /* skip the '0' first */
5250 while (*s == '#')
5251 s++;
5252 if (*s == '.') {
06b5626a 5253 const char * const f = ++s;
784707d5
JP		 5254 while (*s == '#')
5255 s++;
a701009a 5256 arg |= FORM_NUM_POINT + (s - f);
784707d5
JP		 5257 }
5258 *fpc++ = s - base; /* fieldsize for FETCH */
5259 *fpc++ = FF_0DECIMAL;
76912796 5260 *fpc++ = (U32)arg;
a1b95068 5261 unchopnum |= ! ischop;
a0d0e21e 5262 }
086b26f3 5263 else { /* text field */
a0d0e21e
LW		 5264 I32 prespace = 0;
5265 bool ismore = FALSE;
5266
5267 if (*s == '>') {
5268 while (*++s == '>') ;
5269 prespace = FF_SPACE;
5270 }
5271 else if (*s == '|') {
5272 while (*++s == '|') ;
5273 prespace = FF_HALFSPACE;
5274 postspace = TRUE;
5275 }
5276 else {
5277 if (*s == '<')
5278 while (*++s == '<') ;
5279 postspace = TRUE;
5280 }
5281 if (*s == '.' && s[1] == '.' && s[2] == '.') {
5282 s += 3;
5283 ismore = TRUE;
5284 }
5285 *fpc++ = s - base; /* fieldsize for FETCH */
5286
5287 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
5288
5289 if (prespace)
76912796 5290 *fpc++ = (U32)prespace; /* add SPACE or HALFSPACE */
a0d0e21e
LW		 5291 *fpc++ = FF_ITEM;
5292 if (ismore)
5293 *fpc++ = FF_MORE;
5294 if (ischop)
5295 *fpc++ = FF_CHOP;
5296 }
5297 base = s;
5298 skipspaces = 0;
5299 continue;
5300 }
5301 }
5302 *fpc++ = FF_END;
5303
815f25c6 5304 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
a0d0e21e 5305 arg = fpc - fops;
74e0ddf7 5306
3808a683 5307 mg->mg_ptr = (char *) fops;
74e0ddf7 5308 mg->mg_len = arg * sizeof(U32);
3808a683
DM		 5309 mg->mg_obj = sv_copy;
5310 mg->mg_flags |= MGf_REFCOUNTED;
a1b95068 5311
bfed75c6 5312 if (unchopnum && repeat)
75f63940 5313 Perl_die(aTHX_ "Repeated format line will never terminate (~~ and @#)");
74e0ddf7
NC		 5314
5315 return mg;
a1b95068
WL		 5316}
5317
5318
5319STATIC bool
5320S_num_overflow(NV value, I32 fldsize, I32 frcsize)
5321{
5322 /* Can value be printed in fldsize chars, using %*.*f ? */
5323 NV pwr = 1;
5324 NV eps = 0.5;
5325 bool res = FALSE;
5326 int intsize = fldsize - (value < 0 ? 1 : 0);
5327
a701009a 5328 if (frcsize & FORM_NUM_POINT)
a1b95068 5329 intsize--;
a701009a 5330 frcsize &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
a1b95068
WL		 5331 intsize -= frcsize;
5332
5333 while (intsize--) pwr *= 10.0;
5334 while (frcsize--) eps /= 10.0;
5335
5336 if( value >= 0 ){
5337 if (value + eps >= pwr)
5338 res = TRUE;
5339 } else {
5340 if (value - eps <= -pwr)
5341 res = TRUE;
5342 }
5343 return res;
a0d0e21e 5344}
4e35701f 5345
bbed91b5 5346static I32
0bd48802 5347S_run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
bbed91b5 5348{
27da23d5 5349 dVAR;
0bd48802 5350 SV * const datasv = FILTER_DATA(idx);
504618e9 5351 const int filter_has_file = IoLINES(datasv);
ad64d0ec
NC		 5352 SV * const filter_state = MUTABLE_SV(IoTOP_GV(datasv));
5353 SV * const filter_sub = MUTABLE_SV(IoBOTTOM_GV(datasv));
941a98a0 5354 int status = 0;
ec0b63d7 5355 SV *upstream;
941a98a0 5356 STRLEN got_len;
162177c1
Z		 5357 char *got_p = NULL;
5358 char *prune_from = NULL;
34113e50 5359 bool read_from_cache = FALSE;
bb7a0f54
MHM		 5360 STRLEN umaxlen;
5361
7918f24d
NC		 5362 PERL_ARGS_ASSERT_RUN_USER_FILTER;
5363
bb7a0f54
MHM		 5364 assert(maxlen >= 0);
5365 umaxlen = maxlen;
5675696b 5366
bbed91b5
KF		 5367 /* I was having segfault trouble under Linux 2.2.5 after a
5368 parse error occured. (Had to hack around it with a test
13765c85 5369 for PL_parser->error_count == 0.) Solaris doesn't segfault --
bbed91b5
KF		 5370 not sure where the trouble is yet. XXX */
5371
4464f08e
NC		 5372 {
5373 SV *const cache = datasv;
937b367d
NC		 5374 if (SvOK(cache)) {
5375 STRLEN cache_len;
5376 const char *cache_p = SvPV(cache, cache_len);
941a98a0
NC		 5377 STRLEN take = 0;
5378
bb7a0f54 5379 if (umaxlen) {
941a98a0
NC		 5380 /* Running in block mode and we have some cached data already.
5381 */
bb7a0f54 5382 if (cache_len >= umaxlen) {
941a98a0
NC		 5383 /* In fact, so much data we don't even need to call
5384 filter_read. */
bb7a0f54 5385 take = umaxlen;
941a98a0
NC		 5386 }
5387 } else {
10edeb5d
JH		 5388 const char *const first_nl =
5389 (const char *)memchr(cache_p, '\n', cache_len);
941a98a0
NC		 5390 if (first_nl) {
5391 take = first_nl + 1 - cache_p;
5392 }
5393 }
5394 if (take) {
5395 sv_catpvn(buf_sv, cache_p, take);
5396 sv_chop(cache, cache_p + take);
486ec47a 5397 /* Definitely not EOF */
937b367d
NC		 5398 return 1;
5399 }
941a98a0 5400
937b367d 5401 sv_catsv(buf_sv, cache);
bb7a0f54
MHM		 5402 if (umaxlen) {
5403 umaxlen -= cache_len;
941a98a0 5404 }
937b367d 5405 SvOK_off(cache);
34113e50 5406 read_from_cache = TRUE;
937b367d
NC		 5407 }
5408 }
ec0b63d7 5409
34113e50
NC		 5410 /* Filter API says that the filter appends to the contents of the buffer.
5411 Usually the buffer is "", so the details don't matter. But if it's not,
5412 then clearly what it contains is already filtered by this filter, so we
5413 don't want to pass it in a second time.
5414 I'm going to use a mortal in case the upstream filter croaks. */
ec0b63d7
NC		 5415 upstream = ((SvOK(buf_sv) && sv_len(buf_sv)) || SvGMAGICAL(buf_sv))
5416 ? sv_newmortal() : buf_sv;
5417 SvUPGRADE(upstream, SVt_PV);
937b367d 5418
bbed91b5 5419 if (filter_has_file) {
67e70b33 5420 status = FILTER_READ(idx+1, upstream, 0);
bbed91b5
KF		 5421 }
5422
34113e50 5423 if (filter_sub && status >= 0) {
39644a26 5424 dSP;
bbed91b5
KF		 5425 int count;
5426
d343c3ef 5427 ENTER_with_name("call_filter_sub");
339c6c60
FC		 5428 save_gp(PL_defgv, 0);
5429 GvINTRO_off(PL_defgv);
d34a6664 5430 SAVEGENERICSV(GvSV(PL_defgv));
bbed91b5
KF		 5431 SAVETMPS;
5432 EXTEND(SP, 2);
5433
414bf5ae 5434 DEFSV_set(upstream);
d34a6664 5435 SvREFCNT_inc_simple_void_NN(upstream);
bbed91b5 5436 PUSHMARK(SP);
6e449a3a 5437 mPUSHi(0);
bbed91b5
KF		 5438 if (filter_state) {
5439 PUSHs(filter_state);
5440 }
5441 PUTBACK;
5442 count = call_sv(filter_sub, G_SCALAR);
5443 SPAGAIN;
5444
5445 if (count > 0) {
5446 SV *out = POPs;
5447 if (SvOK(out)) {
941a98a0 5448 status = SvIV(out);
bbed91b5
KF		 5449 }
5450 }
5451
5452 PUTBACK;
5453 FREETMPS;
d343c3ef 5454 LEAVE_with_name("call_filter_sub");
bbed91b5
KF		 5455 }
5456
941a98a0
NC		 5457 if(SvOK(upstream)) {
5458 got_p = SvPV(upstream, got_len);
bb7a0f54
MHM		 5459 if (umaxlen) {
5460 if (got_len > umaxlen) {
5461 prune_from = got_p + umaxlen;
937b367d 5462 }
941a98a0 5463 } else {
162177c1 5464 char *const first_nl = (char *)memchr(got_p, '\n', got_len);
941a98a0
NC		 5465 if (first_nl && first_nl + 1 < got_p + got_len) {
5466 /* There's a second line here... */
5467 prune_from = first_nl + 1;
937b367d 5468 }
937b367d
NC		 5469 }
5470 }
941a98a0
NC		 5471 if (prune_from) {
5472 /* Oh. Too long. Stuff some in our cache. */
5473 STRLEN cached_len = got_p + got_len - prune_from;
4464f08e 5474 SV *const cache = datasv;
941a98a0 5475
4464f08e 5476 if (SvOK(cache)) {
941a98a0
NC		 5477 /* Cache should be empty. */
5478 assert(!SvCUR(cache));
5479 }
5480
5481 sv_setpvn(cache, prune_from, cached_len);
5482 /* If you ask for block mode, you may well split UTF-8 characters.
5483 "If it breaks, you get to keep both parts"
5484 (Your code is broken if you don't put them back together again
5485 before something notices.) */
5486 if (SvUTF8(upstream)) {
5487 SvUTF8_on(cache);
5488 }
5489 SvCUR_set(upstream, got_len - cached_len);
162177c1 5490 *prune_from = 0;
941a98a0
NC		 5491 /* Can't yet be EOF */
5492 if (status == 0)
5493 status = 1;
5494 }
937b367d 5495
34113e50
NC		 5496 /* If they are at EOF but buf_sv has something in it, then they may never
5497 have touched the SV upstream, so it may be undefined. If we naively
5498 concatenate it then we get a warning about use of uninitialised value.
5499 */
5500 if (upstream != buf_sv && (SvOK(upstream) || SvGMAGICAL(upstream))) {
937b367d
NC		 5501 sv_catsv(buf_sv, upstream);
5502 }
5503
941a98a0 5504 if (status <= 0) {
bbed91b5 5505 IoLINES(datasv) = 0;
bbed91b5
KF		 5506 if (filter_state) {
5507 SvREFCNT_dec(filter_state);
a0714e2c 5508 IoTOP_GV(datasv) = NULL;
bbed91b5
KF		 5509 }
5510 if (filter_sub) {
5511 SvREFCNT_dec(filter_sub);
a0714e2c 5512 IoBOTTOM_GV(datasv) = NULL;
bbed91b5 5513 }
0bd48802 5514 filter_del(S_run_user_filter);
bbed91b5 5515 }
34113e50
NC		 5516 if (status == 0 && read_from_cache) {
5517 /* If we read some data from the cache (and by getting here it implies
5518 that we emptied the cache) then we aren't yet at EOF, and mustn't
5519 report that to our caller. */
5520 return 1;
5521 }
941a98a0 5522 return status;
bbed91b5 5523}
84d4ea48 5524
be4b629d
CN		 5525/* perhaps someone can come up with a better name for
5526 this? it is not really "absolute", per se ... */
cf42f822 5527static bool
5f66b61c 5528S_path_is_absolute(const char *name)
be4b629d 5529{
7918f24d
NC		 5530 PERL_ARGS_ASSERT_PATH_IS_ABSOLUTE;
5531
be4b629d 5532 if (PERL_FILE_IS_ABSOLUTE(name)
3f66cd94 5533#ifdef WIN32
36f064bc
CL		 5534 || (*name == '.' && ((name[1] == '/' ||
5535 (name[1] == '.' && name[2] == '/'))
5536 || (name[1] == '\\' ||
5537 ( name[1] == '.' && name[2] == '\\')))
5538 )
5539#else
be4b629d 5540 || (*name == '.' && (name[1] == '/' ||
0bd48802 5541 (name[1] == '.' && name[2] == '/')))
36f064bc 5542#endif
0bd48802 5543 )
be4b629d
CN		 5544 {
5545 return TRUE;
5546 }
5547 else
5548 return FALSE;
5549}
241d1a3b
NC		 5550
5551/*
5552 * Local variables:
5553 * c-indentation-style: bsd
5554 * c-basic-offset: 4
5555 * indent-tabs-mode: t
5556 * End:
5557 *
37442d52
RGS		 5558 * ex: set ts=8 sts=4 sw=4 noet:
5559 */
Unnamed repository; edit this file 'description' to name the repository.