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
[rt.cpan.org #72767] Don’t propagate warnings into do-file
[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 {
8ca8a454
NC		 331 if (SvIsCOW(targ)) {
332 sv_force_normal_flags(targ, SV_COW_DROP_PV);
333 } else
8ca8a454
NC		 334 {
335 SvPV_free(targ);
336 }
337 SvPV_set(targ, SvPVX(dstr));
338 SvCUR_set(targ, SvCUR(dstr));
339 SvLEN_set(targ, SvLEN(dstr));
340 if (DO_UTF8(dstr))
341 SvUTF8_on(targ);
342 SvPV_set(dstr, NULL);
343
4f4d7508 344 mPUSHi(saviters - 1);
48c036b1 345
8ca8a454
NC		 346 (void)SvPOK_only_UTF8(targ);
347 }
5cd24f17 348
20be6587 349 /* update the taint state of various various variables in
ef07e810
DM		 350 * preparation for final exit.
351 * See "how taint works" above pp_subst() */
20be6587
DM		 352 if (PL_tainting) {
353 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
354 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
355 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
356 )
357 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
358
359 if (!(cx->sb_rxtainted & SUBST_TAINT_BOOLRET)
360 && (cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT))
361 )
362 SvTAINTED_on(TOPs); /* taint return value */
363 /* needed for mg_set below */
364 PL_tainted = cBOOL(cx->sb_rxtainted &
365 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL));
366 SvTAINT(TARG);
367 }
368 /* PL_tainted must be correctly set for this mg_set */
369 SvSETMAGIC(TARG);
370 TAINT_NOT;
4633a7c4 371 LEAVE_SCOPE(cx->sb_oldsave);
a0d0e21e
LW		 372 POPSUBST(cx);
373 RETURNOP(pm->op_next);
20be6587 374 /* NOTREACHED */
a0d0e21e 375 }
8e5e9ebe 376 cx->sb_iters = saviters;
a0d0e21e 377 }
07bc277f 378 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
a0d0e21e
LW		 379 m = s;
380 s = orig;
07bc277f 381 cx->sb_orig = orig = RX_SUBBEG(rx);
a0d0e21e
LW		 382 s = orig + (m - s);
383 cx->sb_strend = s + (cx->sb_strend - m);
384 }
07bc277f 385 cx->sb_m = m = RX_OFFS(rx)[0].start + orig;
db79b45b 386 if (m > s) {
bfed75c6 387 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
db79b45b
JH		 388 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
389 else
390 sv_catpvn(dstr, s, m-s);
391 }
07bc277f 392 cx->sb_s = RX_OFFS(rx)[0].end + orig;
084916e3 393 { /* Update the pos() information. */
8ca8a454
NC		 394 SV * const sv
395 = (pm->op_pmflags & PMf_NONDESTRUCT) ? cx->sb_dstr : cx->sb_targ;
084916e3 396 MAGIC *mg;
7a7f3e45 397 SvUPGRADE(sv, SVt_PVMG);
14befaf4 398 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
d83f0a82 399#ifdef PERL_OLD_COPY_ON_WRITE
51a9ea20 400 if (SvIsCOW(sv))
d83f0a82
NC		 401 sv_force_normal_flags(sv, 0);
402#endif
403 mg = sv_magicext(sv, NULL, PERL_MAGIC_regex_global, &PL_vtbl_mglob,
404 NULL, 0);
084916e3 405 }
ce474962 406 mg->mg_len = m - orig;
084916e3 407 }
988e6e7e 408 if (old != rx)
d6106309 409 (void)ReREFCNT_inc(rx);
20be6587 410 /* update the taint state of various various variables in preparation
ef07e810
DM		 411 * for calling the code block.
412 * See "how taint works" above pp_subst() */
20be6587
DM		 413 if (PL_tainting) {
414 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
415 cx->sb_rxtainted |= SUBST_TAINT_PAT;
416
417 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
418 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
419 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
420 )
421 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
422
423 if (cx->sb_iters > 1 && (cx->sb_rxtainted &
424 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL)))
8ca8a454
NC		 425 SvTAINTED_on((pm->op_pmflags & PMf_NONDESTRUCT)
426 ? cx->sb_dstr : cx->sb_targ);
20be6587
DM		 427 TAINT_NOT;
428 }
d9f97599 429 rxres_save(&cx->sb_rxres, rx);
af9838cc 430 PL_curpm = pm;
29f2e912 431 RETURNOP(pm->op_pmstashstartu.op_pmreplstart);
a0d0e21e
LW		 432}
433
c90c0ff4 434void
864dbfa3 435Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
c90c0ff4 436{
437 UV *p = (UV*)*rsp;
438 U32 i;
7918f24d
NC		 439
440 PERL_ARGS_ASSERT_RXRES_SAVE;
96a5add6 441 PERL_UNUSED_CONTEXT;
c90c0ff4 442
07bc277f 443 if (!p || p[1] < RX_NPARENS(rx)) {
f8c7b90f 444#ifdef PERL_OLD_COPY_ON_WRITE
07bc277f 445 i = 7 + RX_NPARENS(rx) * 2;
ed252734 446#else
07bc277f 447 i = 6 + RX_NPARENS(rx) * 2;
ed252734 448#endif
c90c0ff4 449 if (!p)
a02a5408 450 Newx(p, i, UV);
c90c0ff4 451 else
452 Renew(p, i, UV);
453 *rsp = (void*)p;
454 }
455
07bc277f 456 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? RX_SUBBEG(rx) : NULL);
cf93c79d 457 RX_MATCH_COPIED_off(rx);
c90c0ff4 458
f8c7b90f 459#ifdef PERL_OLD_COPY_ON_WRITE
bdd9a1b1
NC		 460 *p++ = PTR2UV(RX_SAVED_COPY(rx));
461 RX_SAVED_COPY(rx) = NULL;
ed252734
NC		 462#endif
463
07bc277f 464 *p++ = RX_NPARENS(rx);
c90c0ff4 465
07bc277f
NC		 466 *p++ = PTR2UV(RX_SUBBEG(rx));
467 *p++ = (UV)RX_SUBLEN(rx);
468 for (i = 0; i <= RX_NPARENS(rx); ++i) {
469 *p++ = (UV)RX_OFFS(rx)[i].start;
470 *p++ = (UV)RX_OFFS(rx)[i].end;
c90c0ff4 471 }
472}
473
9c105995
NC		 474static void
475S_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
c90c0ff4 476{
477 UV *p = (UV*)*rsp;
478 U32 i;
7918f24d
NC		 479
480 PERL_ARGS_ASSERT_RXRES_RESTORE;
96a5add6 481 PERL_UNUSED_CONTEXT;
c90c0ff4 482
ed252734 483 RX_MATCH_COPY_FREE(rx);
cf93c79d 484 RX_MATCH_COPIED_set(rx, *p);
c90c0ff4 485 *p++ = 0;
486
f8c7b90f 487#ifdef PERL_OLD_COPY_ON_WRITE
bdd9a1b1
NC		 488 if (RX_SAVED_COPY(rx))
489 SvREFCNT_dec (RX_SAVED_COPY(rx));
490 RX_SAVED_COPY(rx) = INT2PTR(SV*,*p);
ed252734
NC		 491 *p++ = 0;
492#endif
493
07bc277f 494 RX_NPARENS(rx) = *p++;
c90c0ff4 495
07bc277f
NC		 496 RX_SUBBEG(rx) = INT2PTR(char*,*p++);
497 RX_SUBLEN(rx) = (I32)(*p++);
498 for (i = 0; i <= RX_NPARENS(rx); ++i) {
499 RX_OFFS(rx)[i].start = (I32)(*p++);
500 RX_OFFS(rx)[i].end = (I32)(*p++);
c90c0ff4 501 }
502}
503
9c105995
NC		 504static void
505S_rxres_free(pTHX_ void **rsp)
c90c0ff4 506{
44f8325f 507 UV * const p = (UV*)*rsp;
7918f24d
NC		 508
509 PERL_ARGS_ASSERT_RXRES_FREE;
96a5add6 510 PERL_UNUSED_CONTEXT;
c90c0ff4 511
512 if (p) {
94010e71
NC		 513#ifdef PERL_POISON
514 void *tmp = INT2PTR(char*,*p);
515 Safefree(tmp);
516 if (*p)
7e337ee0 517 PoisonFree(*p, 1, sizeof(*p));
94010e71 518#else
56431972 519 Safefree(INT2PTR(char*,*p));
94010e71 520#endif
f8c7b90f 521#ifdef PERL_OLD_COPY_ON_WRITE
ed252734
NC		 522 if (p[1]) {
523 SvREFCNT_dec (INT2PTR(SV*,p[1]));
524 }
525#endif
c90c0ff4 526 Safefree(p);
4608196e 527 *rsp = NULL;
c90c0ff4 528 }
529}
530
a701009a
DM		 531#define FORM_NUM_BLANK (1<<30)
532#define FORM_NUM_POINT (1<<29)
533
a0d0e21e
LW		 534PP(pp_formline)
535{
97aff369 536 dVAR; dSP; dMARK; dORIGMARK;
823a54a3 537 register SV * const tmpForm = *++MARK;
086b26f3
DM		 538 SV *formsv; /* contains text of original format */
539 register U32 *fpc; /* format ops program counter */
540 register char *t; /* current append position in target string */
541 const char *f; /* current position in format string */
a0d0e21e 542 register I32 arg;
086b26f3
DM		 543 register SV *sv = NULL; /* current item */
544 const char *item = NULL;/* string value of current item */
545 I32 itemsize = 0; /* length of current item, possibly truncated */
546 I32 fieldsize = 0; /* width of current field */
547 I32 lines = 0; /* number of lines that have been output */
548 bool chopspace = (strchr(PL_chopset, ' ') != NULL); /* does $: have space */
549 const char *chophere = NULL; /* where to chop current item */
f5ada144 550 STRLEN linemark = 0; /* pos of start of line in output */
65202027 551 NV value;
086b26f3 552 bool gotsome = FALSE; /* seen at least one non-blank item on this line */
a0d0e21e 553 STRLEN len;
26e935cf 554 STRLEN linemax; /* estimate of output size in bytes */
1bd51a4c
IH		 555 bool item_is_utf8 = FALSE;
556 bool targ_is_utf8 = FALSE;
bfed75c6 557 const char *fmt;
74e0ddf7 558 MAGIC *mg = NULL;
4ff700b9
DM		 559 U8 *source; /* source of bytes to append */
560 STRLEN to_copy; /* how may bytes to append */
ea60cfe8 561 char trans; /* what chars to translate */
74e0ddf7 562
3808a683 563 mg = doparseform(tmpForm);
a0d0e21e 564
74e0ddf7 565 fpc = (U32*)mg->mg_ptr;
3808a683
DM		 566 /* the actual string the format was compiled from.
567 * with overload etc, this may not match tmpForm */
568 formsv = mg->mg_obj;
569
74e0ddf7 570
3280af22 571 SvPV_force(PL_formtarget, len);
3808a683 572 if (SvTAINTED(tmpForm) || SvTAINTED(formsv))
125b9982 573 SvTAINTED_on(PL_formtarget);
1bd51a4c
IH		 574 if (DO_UTF8(PL_formtarget))
575 targ_is_utf8 = TRUE;
26e935cf
DM		 576 linemax = (SvCUR(formsv) * (IN_BYTES ? 1 : 3) + 1);
577 t = SvGROW(PL_formtarget, len + linemax + 1);
578 /* XXX from now onwards, SvCUR(PL_formtarget) is invalid */
a0d0e21e 579 t += len;
3808a683 580 f = SvPV_const(formsv, len);
a0d0e21e
LW		 581
582 for (;;) {
583 DEBUG_f( {
bfed75c6 584 const char *name = "???";
a0d0e21e
LW		 585 arg = -1;
586 switch (*fpc) {
587 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
588 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
589 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
590 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
591 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
592
593 case FF_CHECKNL: name = "CHECKNL"; break;
594 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
595 case FF_SPACE: name = "SPACE"; break;
596 case FF_HALFSPACE: name = "HALFSPACE"; break;
597 case FF_ITEM: name = "ITEM"; break;
598 case FF_CHOP: name = "CHOP"; break;
599 case FF_LINEGLOB: name = "LINEGLOB"; break;
600 case FF_NEWLINE: name = "NEWLINE"; break;
601 case FF_MORE: name = "MORE"; break;
602 case FF_LINEMARK: name = "LINEMARK"; break;
603 case FF_END: name = "END"; break;
bfed75c6 604 case FF_0DECIMAL: name = "0DECIMAL"; break;
a1b95068 605 case FF_LINESNGL: name = "LINESNGL"; break;
a0d0e21e
LW		 606 }
607 if (arg >= 0)
bf49b057 608 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
a0d0e21e 609 else
bf49b057 610 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
5f80b19c 611 } );
a0d0e21e
LW		 612 switch (*fpc++) {
613 case FF_LINEMARK:
f5ada144 614 linemark = t - SvPVX(PL_formtarget);
a0d0e21e
LW		 615 lines++;
616 gotsome = FALSE;
617 break;
618
619 case FF_LITERAL:
ea60cfe8
DM		 620 to_copy = *fpc++;
621 source = (U8 *)f;
622 f += to_copy;
623 trans = '~';
75645721 624 item_is_utf8 = targ_is_utf8 ? !!DO_UTF8(formsv) : !!SvUTF8(formsv);
ea60cfe8 625 goto append;
a0d0e21e
LW		 626
627 case FF_SKIP:
628 f += *fpc++;
629 break;
630
631 case FF_FETCH:
632 arg = *fpc++;
633 f += arg;
634 fieldsize = arg;
635
636 if (MARK < SP)
637 sv = *++MARK;
638 else {
3280af22 639 sv = &PL_sv_no;
a2a5de95 640 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
a0d0e21e 641 }
125b9982
NT		 642 if (SvTAINTED(sv))
643 SvTAINTED_on(PL_formtarget);
a0d0e21e
LW		 644 break;
645
646 case FF_CHECKNL:
5a34cab7
NC		 647 {
648 const char *send;
649 const char *s = item = SvPV_const(sv, len);
650 itemsize = len;
651 if (DO_UTF8(sv)) {
652 itemsize = sv_len_utf8(sv);
653 if (itemsize != (I32)len) {
654 I32 itembytes;
655 if (itemsize > fieldsize) {
656 itemsize = fieldsize;
657 itembytes = itemsize;
658 sv_pos_u2b(sv, &itembytes, 0);
659 }
660 else
661 itembytes = len;
662 send = chophere = s + itembytes;
663 while (s < send) {
664 if (*s & ~31)
665 gotsome = TRUE;
666 else if (*s == '\n')
667 break;
668 s++;
669 }
670 item_is_utf8 = TRUE;
671 itemsize = s - item;
672 sv_pos_b2u(sv, &itemsize);
673 break;
a0ed51b3 674 }
a0ed51b3 675 }
5a34cab7
NC		 676 item_is_utf8 = FALSE;
677 if (itemsize > fieldsize)
678 itemsize = fieldsize;
679 send = chophere = s + itemsize;
680 while (s < send) {
681 if (*s & ~31)
682 gotsome = TRUE;
683 else if (*s == '\n')
684 break;
685 s++;
686 }
687 itemsize = s - item;
688 break;
a0ed51b3 689 }
a0d0e21e
LW		 690
691 case FF_CHECKCHOP:
5a34cab7
NC		 692 {
693 const char *s = item = SvPV_const(sv, len);
694 itemsize = len;
695 if (DO_UTF8(sv)) {
696 itemsize = sv_len_utf8(sv);
697 if (itemsize != (I32)len) {
698 I32 itembytes;
699 if (itemsize <= fieldsize) {
700 const char *send = chophere = s + itemsize;
701 while (s < send) {
702 if (*s == '\r') {
703 itemsize = s - item;
a0ed51b3 704 chophere = s;
a0ed51b3 705 break;
5a34cab7
NC		 706 }
707 if (*s++ & ~31)
a0ed51b3 708 gotsome = TRUE;
a0ed51b3 709 }
a0ed51b3 710 }
5a34cab7
NC		 711 else {
712 const char *send;
713 itemsize = fieldsize;
714 itembytes = itemsize;
715 sv_pos_u2b(sv, &itembytes, 0);
716 send = chophere = s + itembytes;
717 while (s < send || (s == send && isSPACE(*s))) {
718 if (isSPACE(*s)) {
719 if (chopspace)
720 chophere = s;
721 if (*s == '\r')
722 break;
723 }
724 else {
725 if (*s & ~31)
726 gotsome = TRUE;
727 if (strchr(PL_chopset, *s))
728 chophere = s + 1;
729 }
730 s++;
731 }
732 itemsize = chophere - item;
733 sv_pos_b2u(sv, &itemsize);
734 }
735 item_is_utf8 = TRUE;
a0d0e21e
LW		 736 break;
737 }
a0d0e21e 738 }
5a34cab7
NC		 739 item_is_utf8 = FALSE;
740 if (itemsize <= fieldsize) {
741 const char *const send = chophere = s + itemsize;
742 while (s < send) {
743 if (*s == '\r') {
744 itemsize = s - item;
a0d0e21e 745 chophere = s;
a0d0e21e 746 break;
5a34cab7
NC		 747 }
748 if (*s++ & ~31)
a0d0e21e 749 gotsome = TRUE;
a0d0e21e 750 }
a0d0e21e 751 }
5a34cab7
NC		 752 else {
753 const char *send;
754 itemsize = fieldsize;
755 send = chophere = s + itemsize;
756 while (s < send || (s == send && isSPACE(*s))) {
757 if (isSPACE(*s)) {
758 if (chopspace)
759 chophere = s;
760 if (*s == '\r')
761 break;
762 }
763 else {
764 if (*s & ~31)
765 gotsome = TRUE;
766 if (strchr(PL_chopset, *s))
767 chophere = s + 1;
768 }
769 s++;
770 }
771 itemsize = chophere - item;
772 }
773 break;
a0d0e21e 774 }
a0d0e21e
LW		 775
776 case FF_SPACE:
777 arg = fieldsize - itemsize;
778 if (arg) {
779 fieldsize -= arg;
780 while (arg-- > 0)
781 *t++ = ' ';
782 }
783 break;
784
785 case FF_HALFSPACE:
786 arg = fieldsize - itemsize;
787 if (arg) {
788 arg /= 2;
789 fieldsize -= arg;
790 while (arg-- > 0)
791 *t++ = ' ';
792 }
793 break;
794
795 case FF_ITEM:
8aa7beb6
DM		 796 to_copy = itemsize;
797 source = (U8 *)item;
798 trans = 1;
799 if (item_is_utf8) {
800 /* convert to_copy from chars to bytes */
801 U8 *s = source;
802 while (to_copy--)
803 s += UTF8SKIP(s);
804 to_copy = s - source;
a0d0e21e 805 }
8aa7beb6 806 goto append;
a0d0e21e
LW		 807
808 case FF_CHOP:
5a34cab7
NC		 809 {
810 const char *s = chophere;
811 if (chopspace) {
af68e756 812 while (isSPACE(*s))
5a34cab7
NC		 813 s++;
814 }
815 sv_chop(sv,s);
816 SvSETMAGIC(sv);
817 break;
a0d0e21e 818 }
a0d0e21e 819
a1b95068
WL		 820 case FF_LINESNGL:
821 chopspace = 0;
a0d0e21e 822 case FF_LINEGLOB:
5a34cab7 823 {
e32383e2 824 const bool oneline = fpc[-1] == FF_LINESNGL;
5a34cab7 825 const char *s = item = SvPV_const(sv, len);
7440a75b 826 const char *const send = s + len;
7440a75b 827
f3f2f1a3 828 item_is_utf8 = DO_UTF8(sv);
a1137ee5 829 if (!len)
7440a75b 830 break;
ea60cfe8 831 trans = 0;
0d21cefe 832 gotsome = TRUE;
a1137ee5 833 chophere = s + len;
4ff700b9
DM		 834 source = (U8 *) s;
835 to_copy = len;
0d21cefe
DM		 836 while (s < send) {
837 if (*s++ == '\n') {
838 if (oneline) {
839 to_copy = s - SvPVX_const(sv) - 1;
840 chophere = s;
841 break;
842 } else {
843 if (s == send) {
0d21cefe
DM		 844 to_copy--;
845 } else
846 lines++;
1bd51a4c 847 }
a0d0e21e 848 }
0d21cefe 849 }
a2c0032b
DM		 850 }
851
ea60cfe8
DM		 852 append:
853 /* append to_copy bytes from source to PL_formstring.
854 * item_is_utf8 implies source is utf8.
855 * if trans, translate certain characters during the copy */
a2c0032b
DM		 856 {
857 U8 *tmp = NULL;
26e935cf 858 STRLEN grow = 0;
0325ce87
DM		 859
860 SvCUR_set(PL_formtarget,
861 t - SvPVX_const(PL_formtarget));
862
0d21cefe
DM		 863 if (targ_is_utf8 && !item_is_utf8) {
864 source = tmp = bytes_to_utf8(source, &to_copy);
0d21cefe
DM		 865 } else {
866 if (item_is_utf8 && !targ_is_utf8) {
f5ada144 867 U8 *s;
0d21cefe 868 /* Upgrade targ to UTF8, and then we reduce it to
0325ce87
DM		 869 a problem we have a simple solution for.
870 Don't need get magic. */
0d21cefe 871 sv_utf8_upgrade_nomg(PL_formtarget);
0325ce87 872 targ_is_utf8 = TRUE;
f5ada144
DM		 873 /* re-calculate linemark */
874 s = (U8*)SvPVX(PL_formtarget);
26e935cf
DM		 875 /* the bytes we initially allocated to append the
876 * whole line may have been gobbled up during the
877 * upgrade, so allocate a whole new line's worth
878 * for safety */
879 grow = linemax;
f5ada144
DM		 880 while (linemark--)
881 s += UTF8SKIP(s);
882 linemark = s - (U8*)SvPVX(PL_formtarget);
e8e72d41 883 }
0d21cefe
DM		 884 /* Easy. They agree. */
885 assert (item_is_utf8 == targ_is_utf8);
886 }
26e935cf
DM		 887 if (!trans)
888 /* @* and ^* are the only things that can exceed
889 * the linemax, so grow by the output size, plus
890 * a whole new form's worth in case of any further
891 * output */
892 grow = linemax + to_copy;
893 if (grow)
894 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + grow + 1);
0d21cefe
DM		 895 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
896
897 Copy(source, t, to_copy, char);
ea60cfe8 898 if (trans) {
8aa7beb6
DM		 899 /* blank out ~ or control chars, depending on trans.
900 * works on bytes not chars, so relies on not
901 * matching utf8 continuation bytes */
ea60cfe8
DM		 902 U8 *s = (U8*)t;
903 U8 *send = s + to_copy;
904 while (s < send) {
8aa7beb6
DM		 905 const int ch = *s;
906 if (trans == '~' ? (ch == '~') :
907#ifdef EBCDIC
908 iscntrl(ch)
909#else
910 (!(ch & ~31))
911#endif
912 )
ea60cfe8
DM		 913 *s = ' ';
914 s++;
915 }
916 }
917
0d21cefe
DM		 918 t += to_copy;
919 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) + to_copy);
a1137ee5 920 if (tmp)
0d21cefe 921 Safefree(tmp);
5a34cab7 922 break;
a0d0e21e 923 }
a0d0e21e 924
a1b95068
WL		 925 case FF_0DECIMAL:
926 arg = *fpc++;
927#if defined(USE_LONG_DOUBLE)
10edeb5d 928 fmt = (const char *)
a701009a 929 ((arg & FORM_NUM_POINT) ?
10edeb5d 930 "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl);
a1b95068 931#else
10edeb5d 932 fmt = (const char *)
a701009a 933 ((arg & FORM_NUM_POINT) ?
10edeb5d 934 "%#0*.*f" : "%0*.*f");
a1b95068
WL		 935#endif
936 goto ff_dec;
a0d0e21e 937 case FF_DECIMAL:
a0d0e21e 938 arg = *fpc++;
65202027 939#if defined(USE_LONG_DOUBLE)
10edeb5d 940 fmt = (const char *)
a701009a 941 ((arg & FORM_NUM_POINT) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl);
65202027 942#else
10edeb5d 943 fmt = (const char *)
a701009a 944 ((arg & FORM_NUM_POINT) ? "%#*.*f" : "%*.*f");
65202027 945#endif
a1b95068 946 ff_dec:
784707d5
JP		 947 /* If the field is marked with ^ and the value is undefined,
948 blank it out. */
a701009a 949 if ((arg & FORM_NUM_BLANK) && !SvOK(sv)) {
784707d5
JP		 950 arg = fieldsize;
951 while (arg--)
952 *t++ = ' ';
953 break;
954 }
955 gotsome = TRUE;
956 value = SvNV(sv);
a1b95068 957 /* overflow evidence */
bfed75c6 958 if (num_overflow(value, fieldsize, arg)) {
a1b95068
WL		 959 arg = fieldsize;
960 while (arg--)
961 *t++ = '#';
962 break;
963 }
784707d5
JP		 964 /* Formats aren't yet marked for locales, so assume "yes". */
965 {
966 STORE_NUMERIC_STANDARD_SET_LOCAL();
a701009a
DM		 967 arg &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
968 my_snprintf(t, SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget)), fmt, (int) fieldsize, (int) arg, value);
784707d5
JP		 969 RESTORE_NUMERIC_STANDARD();
970 }
971 t += fieldsize;
972 break;
a1b95068 973
a0d0e21e
LW		 974 case FF_NEWLINE:
975 f++;
f5ada144 976 while (t-- > (SvPVX(PL_formtarget) + linemark) && *t == ' ') ;
a0d0e21e
LW		 977 t++;
978 *t++ = '\n';
979 break;
980
981 case FF_BLANK:
982 arg = *fpc++;
983 if (gotsome) {
984 if (arg) { /* repeat until fields exhausted? */
11f9eeaf
DM		 985 fpc--;
986 goto end;
a0d0e21e
LW		 987 }
988 }
989 else {
f5ada144 990 t = SvPVX(PL_formtarget) + linemark;
a0d0e21e
LW		 991 lines--;
992 }
993 break;
994
995 case FF_MORE:
5a34cab7
NC		 996 {
997 const char *s = chophere;
998 const char *send = item + len;
999 if (chopspace) {
af68e756 1000 while (isSPACE(*s) && (s < send))
5a34cab7 1001 s++;
a0d0e21e 1002 }
5a34cab7
NC		 1003 if (s < send) {
1004 char *s1;
1005 arg = fieldsize - itemsize;
1006 if (arg) {
1007 fieldsize -= arg;
1008 while (arg-- > 0)
1009 *t++ = ' ';
1010 }
1011 s1 = t - 3;
1012 if (strnEQ(s1," ",3)) {
1013 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
1014 s1--;
1015 }
1016 *s1++ = '.';
1017 *s1++ = '.';
1018 *s1++ = '.';
a0d0e21e 1019 }
5a34cab7 1020 break;
a0d0e21e 1021 }
a0d0e21e 1022 case FF_END:
11f9eeaf 1023 end:
bf2bec63 1024 assert(t < SvPVX_const(PL_formtarget) + SvLEN(PL_formtarget));
a0d0e21e 1025 *t = '\0';
b15aece3 1026 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
1bd51a4c
IH		 1027 if (targ_is_utf8)
1028 SvUTF8_on(PL_formtarget);
3280af22 1029 FmLINES(PL_formtarget) += lines;
a0d0e21e 1030 SP = ORIGMARK;
11f9eeaf
DM		 1031 if (fpc[-1] == FF_BLANK)
1032 RETURNOP(cLISTOP->op_first);
1033 else
1034 RETPUSHYES;
a0d0e21e
LW		 1035 }
1036 }
1037}
1038
1039PP(pp_grepstart)
1040{
27da23d5 1041 dVAR; dSP;
a0d0e21e
LW		 1042 SV *src;
1043
3280af22 1044 if (PL_stack_base + *PL_markstack_ptr == SP) {
a0d0e21e 1045 (void)POPMARK;
54310121 1046 if (GIMME_V == G_SCALAR)
6e449a3a 1047 mXPUSHi(0);
533c011a 1048 RETURNOP(PL_op->op_next->op_next);
a0d0e21e 1049 }
3280af22 1050 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
897d3989
NC		 1051 Perl_pp_pushmark(aTHX); /* push dst */
1052 Perl_pp_pushmark(aTHX); /* push src */
d343c3ef 1053 ENTER_with_name("grep"); /* enter outer scope */
a0d0e21e
LW		 1054
1055 SAVETMPS;
59f00321
RGS		 1056 if (PL_op->op_private & OPpGREP_LEX)
1057 SAVESPTR(PAD_SVl(PL_op->op_targ));
1058 else
1059 SAVE_DEFSV;
d343c3ef 1060 ENTER_with_name("grep_item"); /* enter inner scope */
7766f137 1061 SAVEVPTR(PL_curpm);
a0d0e21e 1062
3280af22 1063 src = PL_stack_base[*PL_markstack_ptr];
a0d0e21e 1064 SvTEMP_off(src);
59f00321
RGS		 1065 if (PL_op->op_private & OPpGREP_LEX)
1066 PAD_SVl(PL_op->op_targ) = src;
1067 else
414bf5ae 1068 DEFSV_set(src);
a0d0e21e
LW		 1069
1070 PUTBACK;
533c011a 1071 if (PL_op->op_type == OP_MAPSTART)
897d3989 1072 Perl_pp_pushmark(aTHX); /* push top */
533c011a 1073 return ((LOGOP*)PL_op->op_next)->op_other;
a0d0e21e
LW		 1074}
1075
a0d0e21e
LW		 1076PP(pp_mapwhile)
1077{
27da23d5 1078 dVAR; dSP;
f54cb97a 1079 const I32 gimme = GIMME_V;
544f3153 1080 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
a0d0e21e
LW		 1081 I32 count;
1082 I32 shift;
1083 SV** src;
ac27b0f5 1084 SV** dst;
a0d0e21e 1085
544f3153 1086 /* first, move source pointer to the next item in the source list */
3280af22 1087 ++PL_markstack_ptr[-1];
544f3153
GS		 1088
1089 /* if there are new items, push them into the destination list */
4c90a460 1090 if (items && gimme != G_VOID) {
544f3153
GS		 1091 /* might need to make room back there first */
1092 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
1093 /* XXX this implementation is very pessimal because the stack
1094 * is repeatedly extended for every set of items. Is possible
1095 * to do this without any stack extension or copying at all
1096 * by maintaining a separate list over which the map iterates
18ef8bea 1097 * (like foreach does). --gsar */
544f3153
GS		 1098
1099 /* everything in the stack after the destination list moves
1100 * towards the end the stack by the amount of room needed */
1101 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
1102
1103 /* items to shift up (accounting for the moved source pointer) */
1104 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
18ef8bea
BT		 1105
1106 /* This optimization is by Ben Tilly and it does
1107 * things differently from what Sarathy (gsar)
1108 * is describing. The downside of this optimization is
1109 * that leaves "holes" (uninitialized and hopefully unused areas)
1110 * to the Perl stack, but on the other hand this
1111 * shouldn't be a problem. If Sarathy's idea gets
1112 * implemented, this optimization should become
1113 * irrelevant. --jhi */
1114 if (shift < count)
1115 shift = count; /* Avoid shifting too often --Ben Tilly */
bfed75c6 1116
924508f0
GS		 1117 EXTEND(SP,shift);
1118 src = SP;
1119 dst = (SP += shift);
3280af22
NIS		 1120 PL_markstack_ptr[-1] += shift;
1121 *PL_markstack_ptr += shift;
544f3153 1122 while (count--)
a0d0e21e
LW		 1123 *dst-- = *src--;
1124 }
544f3153 1125 /* copy the new items down to the destination list */
ac27b0f5 1126 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
22023b26 1127 if (gimme == G_ARRAY) {
b2a2a901
DM		 1128 /* add returned items to the collection (making mortal copies
1129 * if necessary), then clear the current temps stack frame
1130 * *except* for those items. We do this splicing the items
1131 * into the start of the tmps frame (so some items may be on
59d53fd6 1132 * the tmps stack twice), then moving PL_tmps_floor above
b2a2a901
DM		 1133 * them, then freeing the frame. That way, the only tmps that
1134 * accumulate over iterations are the return values for map.
1135 * We have to do to this way so that everything gets correctly
1136 * freed if we die during the map.
1137 */
1138 I32 tmpsbase;
1139 I32 i = items;
1140 /* make space for the slice */
1141 EXTEND_MORTAL(items);
1142 tmpsbase = PL_tmps_floor + 1;
1143 Move(PL_tmps_stack + tmpsbase,
1144 PL_tmps_stack + tmpsbase + items,
1145 PL_tmps_ix - PL_tmps_floor,
1146 SV*);
1147 PL_tmps_ix += items;
1148
1149 while (i-- > 0) {
1150 SV *sv = POPs;
1151 if (!SvTEMP(sv))
1152 sv = sv_mortalcopy(sv);
1153 *dst-- = sv;
1154 PL_tmps_stack[tmpsbase++] = SvREFCNT_inc_simple(sv);
1155 }
1156 /* clear the stack frame except for the items */
1157 PL_tmps_floor += items;
1158 FREETMPS;
1159 /* FREETMPS may have cleared the TEMP flag on some of the items */
1160 i = items;
1161 while (i-- > 0)
1162 SvTEMP_on(PL_tmps_stack[--tmpsbase]);
22023b26 1163 }
bfed75c6 1164 else {
22023b26
TP		 1165 /* scalar context: we don't care about which values map returns
1166 * (we use undef here). And so we certainly don't want to do mortal
1167 * copies of meaningless values. */
1168 while (items-- > 0) {
b988aa42 1169 (void)POPs;
22023b26
TP		 1170 *dst-- = &PL_sv_undef;
1171 }
b2a2a901 1172 FREETMPS;
22023b26 1173 }
a0d0e21e 1174 }
b2a2a901
DM		 1175 else {
1176 FREETMPS;
1177 }
d343c3ef 1178 LEAVE_with_name("grep_item"); /* exit inner scope */
a0d0e21e
LW		 1179
1180 /* All done yet? */
3280af22 1181 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
a0d0e21e
LW		 1182
1183 (void)POPMARK; /* pop top */
d343c3ef 1184 LEAVE_with_name("grep"); /* exit outer scope */
a0d0e21e 1185 (void)POPMARK; /* pop src */
3280af22 1186 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
a0d0e21e 1187 (void)POPMARK; /* pop dst */
3280af22 1188 SP = PL_stack_base + POPMARK; /* pop original mark */
54310121 1189 if (gimme == G_SCALAR) {
7cc47870
RGS		 1190 if (PL_op->op_private & OPpGREP_LEX) {
1191 SV* sv = sv_newmortal();
1192 sv_setiv(sv, items);
1193 PUSHs(sv);
1194 }
1195 else {
1196 dTARGET;
1197 XPUSHi(items);
1198 }
a0d0e21e 1199 }
54310121 1200 else if (gimme == G_ARRAY)
1201 SP += items;
a0d0e21e
LW		 1202 RETURN;
1203 }
1204 else {
1205 SV *src;
1206
d343c3ef 1207 ENTER_with_name("grep_item"); /* enter inner scope */
7766f137 1208 SAVEVPTR(PL_curpm);
a0d0e21e 1209
544f3153 1210 /* set $_ to the new source item */
3280af22 1211 src = PL_stack_base[PL_markstack_ptr[-1]];
a0d0e21e 1212 SvTEMP_off(src);
59f00321
RGS		 1213 if (PL_op->op_private & OPpGREP_LEX)
1214 PAD_SVl(PL_op->op_targ) = src;
1215 else
414bf5ae 1216 DEFSV_set(src);
a0d0e21e
LW		 1217
1218 RETURNOP(cLOGOP->op_other);
1219 }
1220}
1221
a0d0e21e
LW		 1222/* Range stuff. */
1223
1224PP(pp_range)
1225{
97aff369 1226 dVAR;
a0d0e21e 1227 if (GIMME == G_ARRAY)
1a67a97c 1228 return NORMAL;
538573f7 1229 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1a67a97c 1230 return cLOGOP->op_other;
538573f7 1231 else
1a67a97c 1232 return NORMAL;
a0d0e21e
LW		 1233}
1234
1235PP(pp_flip)
1236{
97aff369 1237 dVAR;
39644a26 1238 dSP;
a0d0e21e
LW		 1239
1240 if (GIMME == G_ARRAY) {
1a67a97c 1241 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
a0d0e21e
LW		 1242 }
1243 else {
1244 dTOPss;
44f8325f 1245 SV * const targ = PAD_SV(PL_op->op_targ);
bfed75c6 1246 int flip = 0;
790090df 1247
bfed75c6 1248 if (PL_op->op_private & OPpFLIP_LINENUM) {
4e3399f9
YST		 1249 if (GvIO(PL_last_in_gv)) {
1250 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1251 }
1252 else {
fafc274c 1253 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
44f8325f
AL		 1254 if (gv && GvSV(gv))
1255 flip = SvIV(sv) == SvIV(GvSV(gv));
4e3399f9 1256 }
bfed75c6
AL		 1257 } else {
1258 flip = SvTRUE(sv);
1259 }
1260 if (flip) {
a0d0e21e 1261 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
533c011a 1262 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e 1263 sv_setiv(targ, 1);
3e3baf6d 1264 SETs(targ);
a0d0e21e
LW		 1265 RETURN;
1266 }
1267 else {
1268 sv_setiv(targ, 0);
924508f0 1269 SP--;
1a67a97c 1270 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
a0d0e21e
LW		 1271 }
1272 }
76f68e9b 1273 sv_setpvs(TARG, "");
a0d0e21e
LW		 1274 SETs(targ);
1275 RETURN;
1276 }
1277}
1278
8e9bbdb9
RGS		 1279/* This code tries to decide if "$left .. $right" should use the
1280 magical string increment, or if the range is numeric (we make
1281 an exception for .."0" [#18165]). AMS 20021031. */
1282
1283#define RANGE_IS_NUMERIC(left,right) ( \
b0e74086
RGS		 1284 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1285 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
e0ab1c0e 1286 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
b15aece3 1287 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
e0ab1c0e 1288 && (!SvOK(right) || looks_like_number(right))))
8e9bbdb9 1289
a0d0e21e
LW		 1290PP(pp_flop)
1291{
97aff369 1292 dVAR; dSP;
a0d0e21e
LW		 1293
1294 if (GIMME == G_ARRAY) {
1295 dPOPPOPssrl;
86cb7173 1296
5b295bef
RD		 1297 SvGETMAGIC(left);
1298 SvGETMAGIC(right);
a0d0e21e 1299
8e9bbdb9 1300 if (RANGE_IS_NUMERIC(left,right)) {
901017d6
AL		 1301 register IV i, j;
1302 IV max;
f52e41ad
FC		 1303 if ((SvOK(left) && SvNV_nomg(left) < IV_MIN) ||
1304 (SvOK(right) && SvNV_nomg(right) > IV_MAX))
d470f89e 1305 DIE(aTHX_ "Range iterator outside integer range");
f52e41ad
FC		 1306 i = SvIV_nomg(left);
1307 max = SvIV_nomg(right);
bbce6d69 1308 if (max >= i) {
c1ab3db2
AK		 1309 j = max - i + 1;
1310 EXTEND_MORTAL(j);
1311 EXTEND(SP, j);
bbce6d69 1312 }
c1ab3db2
AK		 1313 else
1314 j = 0;
1315 while (j--) {
901017d6 1316 SV * const sv = sv_2mortal(newSViv(i++));
a0d0e21e
LW		 1317 PUSHs(sv);
1318 }
1319 }
1320 else {
3c323193
FC		 1321 STRLEN len, llen;
1322 const char * const lpv = SvPV_nomg_const(left, llen);
f52e41ad 1323 const char * const tmps = SvPV_nomg_const(right, len);
a0d0e21e 1324
3c323193 1325 SV *sv = newSVpvn_flags(lpv, llen, SvUTF8(left)|SVs_TEMP);
89ea2908 1326 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
a0d0e21e 1327 XPUSHs(sv);
b15aece3 1328 if (strEQ(SvPVX_const(sv),tmps))
89ea2908 1329 break;
a0d0e21e
LW		 1330 sv = sv_2mortal(newSVsv(sv));
1331 sv_inc(sv);
1332 }
a0d0e21e
LW		 1333 }
1334 }
1335 else {
1336 dTOPss;
901017d6 1337 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
4e3399f9 1338 int flop = 0;
a0d0e21e 1339 sv_inc(targ);
4e3399f9
YST		 1340
1341 if (PL_op->op_private & OPpFLIP_LINENUM) {
1342 if (GvIO(PL_last_in_gv)) {
1343 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1344 }
1345 else {
fafc274c 1346 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
4e3399f9
YST		 1347 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1348 }
1349 }
1350 else {
1351 flop = SvTRUE(sv);
1352 }
1353
1354 if (flop) {
a0d0e21e 1355 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
396482e1 1356 sv_catpvs(targ, "E0");
a0d0e21e
LW		 1357 }
1358 SETs(targ);
1359 }
1360
1361 RETURN;
1362}
1363
1364/* Control. */
1365
27da23d5 1366static const char * const context_name[] = {
515afda2 1367 "pseudo-block",
f31522f3 1368 NULL, /* CXt_WHEN never actually needs "block" */
76753e7f 1369 NULL, /* CXt_BLOCK never actually needs "block" */
f31522f3 1370 NULL, /* CXt_GIVEN never actually needs "block" */
76753e7f
NC		 1371 NULL, /* CXt_LOOP_FOR never actually needs "loop" */
1372 NULL, /* CXt_LOOP_PLAIN never actually needs "loop" */
1373 NULL, /* CXt_LOOP_LAZYSV never actually needs "loop" */
1374 NULL, /* CXt_LOOP_LAZYIV never actually needs "loop" */
515afda2 1375 "subroutine",
76753e7f 1376 "format",
515afda2 1377 "eval",
515afda2 1378 "substitution",
515afda2
NC		 1379};
1380
76e3520e 1381STATIC I32
06b5626a 1382S_dopoptolabel(pTHX_ const char *label)
a0d0e21e 1383{
97aff369 1384 dVAR;
a0d0e21e 1385 register I32 i;
a0d0e21e 1386
7918f24d
NC		 1387 PERL_ARGS_ASSERT_DOPOPTOLABEL;
1388
a0d0e21e 1389 for (i = cxstack_ix; i >= 0; i--) {
901017d6 1390 register const PERL_CONTEXT * const cx = &cxstack[i];
6b35e009 1391 switch (CxTYPE(cx)) {
a0d0e21e 1392 case CXt_SUBST:
a0d0e21e 1393 case CXt_SUB:
7766f137 1394 case CXt_FORMAT:
a0d0e21e 1395 case CXt_EVAL:
0a753a76 1396 case CXt_NULL:
dcbac5bb 1397 /* diag_listed_as: Exiting subroutine via %s */
a2a5de95
NC		 1398 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1399 context_name[CxTYPE(cx)], OP_NAME(PL_op));
515afda2
NC		 1400 if (CxTYPE(cx) == CXt_NULL)
1401 return -1;
1402 break;
c6fdafd0 1403 case CXt_LOOP_LAZYIV:
d01136d6 1404 case CXt_LOOP_LAZYSV:
3b719c58
NC		 1405 case CXt_LOOP_FOR:
1406 case CXt_LOOP_PLAIN:
7e8f1eac
AD		 1407 {
1408 const char *cx_label = CxLABEL(cx);
1409 if (!cx_label || strNE(label, cx_label) ) {
1c98cc53 1410 DEBUG_l(Perl_deb(aTHX_ "(poptolabel(): skipping label at cx=%ld %s)\n",
7e8f1eac 1411 (long)i, cx_label));
a0d0e21e
LW		 1412 continue;
1413 }
1c98cc53 1414 DEBUG_l( Perl_deb(aTHX_ "(poptolabel(): found label at cx=%ld %s)\n", (long)i, label));
a0d0e21e 1415 return i;
7e8f1eac 1416 }
a0d0e21e
LW		 1417 }
1418 }
1419 return i;
1420}
1421
0d863452
RH		 1422
1423
e50aee73 1424I32
864dbfa3 1425Perl_dowantarray(pTHX)
e50aee73 1426{
97aff369 1427 dVAR;
f54cb97a 1428 const I32 gimme = block_gimme();
54310121 1429 return (gimme == G_VOID) ? G_SCALAR : gimme;
1430}
1431
1432I32
864dbfa3 1433Perl_block_gimme(pTHX)
54310121 1434{
97aff369 1435 dVAR;
06b5626a 1436 const I32 cxix = dopoptosub(cxstack_ix);
e50aee73 1437 if (cxix < 0)
46fc3d4c 1438 return G_VOID;
e50aee73 1439
54310121 1440 switch (cxstack[cxix].blk_gimme) {
d2719217
GS		 1441 case G_VOID:
1442 return G_VOID;
54310121 1443 case G_SCALAR:
e50aee73 1444 return G_SCALAR;
54310121 1445 case G_ARRAY:
1446 return G_ARRAY;
1447 default:
cea2e8a9 1448 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
d2719217
GS		 1449 /* NOTREACHED */
1450 return 0;
54310121 1451 }
e50aee73
AD		 1452}
1453
78f9721b
SM		 1454I32
1455Perl_is_lvalue_sub(pTHX)
1456{
97aff369 1457 dVAR;
06b5626a 1458 const I32 cxix = dopoptosub(cxstack_ix);
78f9721b
SM		 1459 assert(cxix >= 0); /* We should only be called from inside subs */
1460
bafb2adc
NC		 1461 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1462 return CxLVAL(cxstack + cxix);
78f9721b
SM		 1463 else
1464 return 0;
1465}
1466
777d9014
FC		 1467/* only used by PUSHSUB */
1468I32
1469Perl_was_lvalue_sub(pTHX)
1470{
1471 dVAR;
1472 const I32 cxix = dopoptosub(cxstack_ix-1);
1473 assert(cxix >= 0); /* We should only be called from inside subs */
1474
1475 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1476 return CxLVAL(cxstack + cxix);
1477 else
1478 return 0;
1479}
1480
76e3520e 1481STATIC I32
901017d6 1482S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
2c375eb9 1483{
97aff369 1484 dVAR;
a0d0e21e 1485 I32 i;
7918f24d
NC		 1486
1487 PERL_ARGS_ASSERT_DOPOPTOSUB_AT;
1488
a0d0e21e 1489 for (i = startingblock; i >= 0; i--) {
901017d6 1490 register const PERL_CONTEXT * const cx = &cxstk[i];
6b35e009 1491 switch (CxTYPE(cx)) {
a0d0e21e
LW		 1492 default:
1493 continue;
1494 case CXt_EVAL:
1495 case CXt_SUB:
7766f137 1496 case CXt_FORMAT:
1c98cc53 1497 DEBUG_l( Perl_deb(aTHX_ "(dopoptosub_at(): found sub at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1498 return i;
1499 }
1500 }
1501 return i;
1502}
1503
76e3520e 1504STATIC I32
cea2e8a9 1505S_dopoptoeval(pTHX_ I32 startingblock)
a0d0e21e 1506{
97aff369 1507 dVAR;
a0d0e21e 1508 I32 i;
a0d0e21e 1509 for (i = startingblock; i >= 0; i--) {
06b5626a 1510 register const PERL_CONTEXT *cx = &cxstack[i];
6b35e009 1511 switch (CxTYPE(cx)) {
a0d0e21e
LW		 1512 default:
1513 continue;
1514 case CXt_EVAL:
1c98cc53 1515 DEBUG_l( Perl_deb(aTHX_ "(dopoptoeval(): found eval at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1516 return i;
1517 }
1518 }
1519 return i;
1520}
1521
76e3520e 1522STATIC I32
cea2e8a9 1523S_dopoptoloop(pTHX_ I32 startingblock)
a0d0e21e 1524{
97aff369 1525 dVAR;
a0d0e21e 1526 I32 i;
a0d0e21e 1527 for (i = startingblock; i >= 0; i--) {
901017d6 1528 register const PERL_CONTEXT * const cx = &cxstack[i];
6b35e009 1529 switch (CxTYPE(cx)) {
a0d0e21e 1530 case CXt_SUBST:
a0d0e21e 1531 case CXt_SUB:
7766f137 1532 case CXt_FORMAT:
a0d0e21e 1533 case CXt_EVAL:
0a753a76 1534 case CXt_NULL:
dcbac5bb 1535 /* diag_listed_as: Exiting subroutine via %s */
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);
ae917476 2400 /* diag_listed_as: Can't return %s from lvalue subroutine */
d25b0d7b
FC		 2401 Perl_croak(aTHX_
2402 "Can't return a %s from lvalue subroutine",
2403 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2404 }
2405 else
4bee03f8
FC		 2406 *++newsp =
2407 SvTEMP(*MARK)
2408 ? *MARK
2409 : sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
3bdf583b
FC		 2410 }
2411 }
2412 PL_stack_sp = newsp;
2413}
2414
a0d0e21e
LW		 2415PP(pp_return)
2416{
27da23d5 2417 dVAR; dSP; dMARK;
c09156bb 2418 register PERL_CONTEXT *cx;
f86702cc 2419 bool popsub2 = FALSE;
b45de488 2420 bool clear_errsv = FALSE;
fa1e92c4 2421 bool lval = FALSE;
a0d0e21e
LW		 2422 I32 gimme;
2423 SV **newsp;
2424 PMOP *newpm;
2425 I32 optype = 0;
b6494f15 2426 SV *namesv;
b0d9ce38 2427 SV *sv;
b263a1ad 2428 OP *retop = NULL;
a0d0e21e 2429
0bd48802
AL		 2430 const I32 cxix = dopoptosub(cxstack_ix);
2431
9850bf21
RH		 2432 if (cxix < 0) {
2433 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
2434 * sort block, which is a CXt_NULL
2435 * not a CXt_SUB */
2436 dounwind(0);
d7507f74
RH		 2437 PL_stack_base[1] = *PL_stack_sp;
2438 PL_stack_sp = PL_stack_base + 1;
a0d0e21e
LW		 2439 return 0;
2440 }
9850bf21
RH		 2441 else
2442 DIE(aTHX_ "Can't return outside a subroutine");
a0d0e21e 2443 }
a0d0e21e
LW		 2444 if (cxix < cxstack_ix)
2445 dounwind(cxix);
2446
d7507f74
RH		 2447 if (CxMULTICALL(&cxstack[cxix])) {
2448 gimme = cxstack[cxix].blk_gimme;
2449 if (gimme == G_VOID)
2450 PL_stack_sp = PL_stack_base;
2451 else if (gimme == G_SCALAR) {
2452 PL_stack_base[1] = *PL_stack_sp;
2453 PL_stack_sp = PL_stack_base + 1;
2454 }
9850bf21 2455 return 0;
d7507f74 2456 }
9850bf21 2457
a0d0e21e 2458 POPBLOCK(cx,newpm);
6b35e009 2459 switch (CxTYPE(cx)) {
a0d0e21e 2460 case CXt_SUB:
f86702cc 2461 popsub2 = TRUE;
fa1e92c4 2462 lval = !!CvLVALUE(cx->blk_sub.cv);
f39bc417 2463 retop = cx->blk_sub.retop;
5dd42e15 2464 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
a0d0e21e
LW		 2465 break;
2466 case CXt_EVAL:
b45de488
GS		 2467 if (!(PL_in_eval & EVAL_KEEPERR))
2468 clear_errsv = TRUE;
a0d0e21e 2469 POPEVAL(cx);
b6494f15 2470 namesv = cx->blk_eval.old_namesv;
f39bc417 2471 retop = cx->blk_eval.retop;
1d76a5c3
GS		 2472 if (CxTRYBLOCK(cx))
2473 break;
748a9306
LW		 2474 if (optype == OP_REQUIRE &&
2475 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
2476 {
54310121 2477 /* Unassume the success we assumed earlier. */
b6494f15 2478 (void)hv_delete(GvHVn(PL_incgv),
ecad31f0 2479 SvPVX_const(namesv),
c60dbbc3 2480 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
b6494f15
VP		 2481 G_DISCARD);
2482 DIE(aTHX_ "%"SVf" did not return a true value", SVfARG(namesv));
748a9306 2483 }
a0d0e21e 2484 break;
7766f137
GS		 2485 case CXt_FORMAT:
2486 POPFORMAT(cx);
f39bc417 2487 retop = cx->blk_sub.retop;
7766f137 2488 break;
a0d0e21e 2489 default:
5637ef5b 2490 DIE(aTHX_ "panic: return, type=%u", (unsigned) CxTYPE(cx));
a0d0e21e
LW		 2491 }
2492
a1f49e72 2493 TAINT_NOT;
d25b0d7b 2494 if (lval) S_return_lvalues(aTHX_ MARK, SP, newsp, gimme, cx, newpm);
3bdf583b
FC		 2495 else {
2496 if (gimme == G_SCALAR) {
a29cdaf0
IZ		 2497 if (MARK < SP) {
2498 if (popsub2) {
a8bba7fa 2499 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
6f48390a
FC		 2500 if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
2501 && !SvMAGICAL(TOPs)) {
a29cdaf0
IZ		 2502 *++newsp = SvREFCNT_inc(*SP);
2503 FREETMPS;
2504 sv_2mortal(*newsp);
959e3673
GS		 2505 }
2506 else {
2507 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
a29cdaf0 2508 FREETMPS;
959e3673
GS		 2509 *++newsp = sv_mortalcopy(sv);
2510 SvREFCNT_dec(sv);
a29cdaf0 2511 }
959e3673 2512 }
6f48390a
FC		 2513 else if (SvTEMP(*SP) && SvREFCNT(*SP) == 1
2514 && !SvMAGICAL(*SP)) {
767eda44 2515 *++newsp = *SP;
767eda44 2516 }
959e3673 2517 else
767eda44 2518 *++newsp = sv_mortalcopy(*SP);
959e3673
GS		 2519 }
2520 else
a29cdaf0 2521 *++newsp = sv_mortalcopy(*SP);
959e3673
GS		 2522 }
2523 else
3280af22 2524 *++newsp = &PL_sv_undef;
3bdf583b
FC		 2525 }
2526 else if (gimme == G_ARRAY) {
a1f49e72 2527 while (++MARK <= SP) {
3ed94dc0 2528 *++newsp = popsub2 && SvTEMP(*MARK) && SvREFCNT(*MARK) == 1
6f48390a 2529 && !SvGMAGICAL(*MARK)
f86702cc 2530 ? *MARK : sv_mortalcopy(*MARK);
a1f49e72
CS		 2531 TAINT_NOT; /* Each item is independent */
2532 }
3bdf583b
FC		 2533 }
2534 PL_stack_sp = newsp;
a0d0e21e 2535 }
a0d0e21e 2536
5dd42e15 2537 LEAVE;
f86702cc 2538 /* Stack values are safe: */
2539 if (popsub2) {
5dd42e15 2540 cxstack_ix--;
b0d9ce38 2541 POPSUB(cx,sv); /* release CV and @_ ... */
f86702cc 2542 }
b0d9ce38 2543 else
c445ea15 2544 sv = NULL;
3280af22 2545 PL_curpm = newpm; /* ... and pop $1 et al */
f86702cc 2546
b0d9ce38 2547 LEAVESUB(sv);
8433848b 2548 if (clear_errsv) {
ab69dbc2 2549 CLEAR_ERRSV();
8433848b 2550 }
f39bc417 2551 return retop;
a0d0e21e
LW		 2552}
2553
4f443c3d
FC		 2554/* This duplicates parts of pp_leavesub, so that it can share code with
2555 * pp_return */
2556PP(pp_leavesublv)
2557{
2558 dVAR; dSP;
4f443c3d
FC		 2559 SV **newsp;
2560 PMOP *newpm;
2561 I32 gimme;
2562 register PERL_CONTEXT *cx;
2563 SV *sv;
2564
2565 if (CxMULTICALL(&cxstack[cxstack_ix]))
2566 return 0;
2567
2568 POPBLOCK(cx,newpm);
2569 cxstack_ix++; /* temporarily protect top context */
4f443c3d
FC		 2570
2571 TAINT_NOT;
2572
0d235c77 2573 S_return_lvalues(aTHX_ newsp, SP, newsp, gimme, cx, newpm);
4f443c3d
FC		 2574
2575 LEAVE;
2576 cxstack_ix--;
2577 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2578 PL_curpm = newpm; /* ... and pop $1 et al */
2579
2580 LEAVESUB(sv);
2581 return cx->blk_sub.retop;
2582}
2583
a0d0e21e
LW		 2584PP(pp_last)
2585{
27da23d5 2586 dVAR; dSP;
a0d0e21e 2587 I32 cxix;
c09156bb 2588 register PERL_CONTEXT *cx;
f86702cc 2589 I32 pop2 = 0;
a0d0e21e 2590 I32 gimme;
8772537c 2591 I32 optype;
b263a1ad 2592 OP *nextop = NULL;
a0d0e21e
LW		 2593 SV **newsp;
2594 PMOP *newpm;
a8bba7fa 2595 SV **mark;
c445ea15 2596 SV *sv = NULL;
9d4ba2ae 2597
a0d0e21e 2598
533c011a 2599 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e
LW		 2600 cxix = dopoptoloop(cxstack_ix);
2601 if (cxix < 0)
a651a37d 2602 DIE(aTHX_ "Can't \"last\" outside a loop block");
a0d0e21e
LW		 2603 }
2604 else {
2605 cxix = dopoptolabel(cPVOP->op_pv);
2606 if (cxix < 0)
cea2e8a9 2607 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
a0d0e21e
LW		 2608 }
2609 if (cxix < cxstack_ix)
2610 dounwind(cxix);
2611
2612 POPBLOCK(cx,newpm);
5dd42e15 2613 cxstack_ix++; /* temporarily protect top context */
a8bba7fa 2614 mark = newsp;
6b35e009 2615 switch (CxTYPE(cx)) {
c6fdafd0 2616 case CXt_LOOP_LAZYIV:
d01136d6 2617 case CXt_LOOP_LAZYSV:
3b719c58
NC		 2618 case CXt_LOOP_FOR:
2619 case CXt_LOOP_PLAIN:
2620 pop2 = CxTYPE(cx);
a8bba7fa 2621 newsp = PL_stack_base + cx->blk_loop.resetsp;
022eaa24 2622 nextop = cx->blk_loop.my_op->op_lastop->op_next;
a0d0e21e 2623 break;
f86702cc 2624 case CXt_SUB:
f86702cc 2625 pop2 = CXt_SUB;
f39bc417 2626 nextop = cx->blk_sub.retop;
a0d0e21e 2627 break;
f86702cc 2628 case CXt_EVAL:
2629 POPEVAL(cx);
f39bc417 2630 nextop = cx->blk_eval.retop;
a0d0e21e 2631 break;
7766f137
GS		 2632 case CXt_FORMAT:
2633 POPFORMAT(cx);
f39bc417 2634 nextop = cx->blk_sub.retop;
7766f137 2635 break;
a0d0e21e 2636 default:
5637ef5b 2637 DIE(aTHX_ "panic: last, type=%u", (unsigned) CxTYPE(cx));
a0d0e21e
LW		 2638 }
2639
a1f49e72 2640 TAINT_NOT;
b9d76716
VP		 2641 SP = adjust_stack_on_leave(newsp, SP, MARK, gimme,
2642 pop2 == CXt_SUB ? SVs_TEMP : 0);
f86702cc 2643 PUTBACK;
2644
5dd42e15
DM		 2645 LEAVE;
2646 cxstack_ix--;
f86702cc 2647 /* Stack values are safe: */
2648 switch (pop2) {
c6fdafd0 2649 case CXt_LOOP_LAZYIV:
3b719c58 2650 case CXt_LOOP_PLAIN:
d01136d6 2651 case CXt_LOOP_LAZYSV:
3b719c58 2652 case CXt_LOOP_FOR:
a8bba7fa 2653 POPLOOP(cx); /* release loop vars ... */
4fdae800 2654 LEAVE;
f86702cc 2655 break;
2656 case CXt_SUB:
b0d9ce38 2657 POPSUB(cx,sv); /* release CV and @_ ... */
f86702cc 2658 break;
a0d0e21e 2659 }
3280af22 2660 PL_curpm = newpm; /* ... and pop $1 et al */
a0d0e21e 2661
b0d9ce38 2662 LEAVESUB(sv);
9d4ba2ae
AL		 2663 PERL_UNUSED_VAR(optype);
2664 PERL_UNUSED_VAR(gimme);
f86702cc 2665 return nextop;
a0d0e21e
LW		 2666}
2667
2668PP(pp_next)
2669{
27da23d5 2670 dVAR;
a0d0e21e 2671 I32 cxix;
c09156bb 2672 register PERL_CONTEXT *cx;
85538317 2673 I32 inner;
a0d0e21e 2674
533c011a 2675 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e
LW		 2676 cxix = dopoptoloop(cxstack_ix);
2677 if (cxix < 0)
a651a37d 2678 DIE(aTHX_ "Can't \"next\" outside a loop block");
a0d0e21e
LW		 2679 }
2680 else {
2681 cxix = dopoptolabel(cPVOP->op_pv);
2682 if (cxix < 0)
cea2e8a9 2683 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
a0d0e21e
LW		 2684 }
2685 if (cxix < cxstack_ix)
2686 dounwind(cxix);
2687
85538317
GS		 2688 /* clear off anything above the scope we're re-entering, but
2689 * save the rest until after a possible continue block */
2690 inner = PL_scopestack_ix;
1ba6ee2b 2691 TOPBLOCK(cx);
85538317
GS		 2692 if (PL_scopestack_ix < inner)
2693 leave_scope(PL_scopestack[PL_scopestack_ix]);
3a1b2b9e 2694 PL_curcop = cx->blk_oldcop;
d57ce4df 2695 return (cx)->blk_loop.my_op->op_nextop;
a0d0e21e
LW		 2696}
2697
2698PP(pp_redo)
2699{
27da23d5 2700 dVAR;
a0d0e21e 2701 I32 cxix;
c09156bb 2702 register PERL_CONTEXT *cx;
a0d0e21e 2703 I32 oldsave;
a034e688 2704 OP* redo_op;
a0d0e21e 2705
533c011a 2706 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e
LW		 2707 cxix = dopoptoloop(cxstack_ix);
2708 if (cxix < 0)
a651a37d 2709 DIE(aTHX_ "Can't \"redo\" outside a loop block");
a0d0e21e
LW		 2710 }
2711 else {
2712 cxix = dopoptolabel(cPVOP->op_pv);
2713 if (cxix < 0)
cea2e8a9 2714 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
a0d0e21e
LW		 2715 }
2716 if (cxix < cxstack_ix)
2717 dounwind(cxix);
2718
022eaa24 2719 redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
a034e688
DM		 2720 if (redo_op->op_type == OP_ENTER) {
2721 /* pop one less context to avoid $x being freed in while (my $x..) */
2722 cxstack_ix++;
2723 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2724 redo_op = redo_op->op_next;
2725 }
2726
a0d0e21e 2727 TOPBLOCK(cx);
3280af22 2728 oldsave = PL_scopestack[PL_scopestack_ix - 1];
a0d0e21e 2729 LEAVE_SCOPE(oldsave);
936c78b5 2730 FREETMPS;
3a1b2b9e 2731 PL_curcop = cx->blk_oldcop;
a034e688 2732 return redo_op;
a0d0e21e
LW		 2733}
2734
0824fdcb 2735STATIC OP *
bfed75c6 2736S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
a0d0e21e 2737{
97aff369 2738 dVAR;
a0d0e21e 2739 OP **ops = opstack;
bfed75c6 2740 static const char too_deep[] = "Target of goto is too deeply nested";
a0d0e21e 2741
7918f24d
NC		 2742 PERL_ARGS_ASSERT_DOFINDLABEL;
2743
fc36a67e 2744 if (ops >= oplimit)
cea2e8a9 2745 Perl_croak(aTHX_ too_deep);
11343788
MB		 2746 if (o->op_type == OP_LEAVE ||
2747 o->op_type == OP_SCOPE ||
2748 o->op_type == OP_LEAVELOOP ||
33d34e4c 2749 o->op_type == OP_LEAVESUB ||
11343788 2750 o->op_type == OP_LEAVETRY)
fc36a67e 2751 {
5dc0d613 2752 *ops++ = cUNOPo->op_first;
fc36a67e 2753 if (ops >= oplimit)
cea2e8a9 2754 Perl_croak(aTHX_ too_deep);
fc36a67e 2755 }
c4aa4e48 2756 *ops = 0;
11343788 2757 if (o->op_flags & OPf_KIDS) {
aec46f14 2758 OP *kid;
a0d0e21e 2759 /* First try all the kids at this level, since that's likeliest. */
11343788 2760 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
7e8f1eac
AD		 2761 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2762 const char *kid_label = CopLABEL(kCOP);
2763 if (kid_label && strEQ(kid_label, label))
2764 return kid;
2765 }
a0d0e21e 2766 }
11343788 2767 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
3280af22 2768 if (kid == PL_lastgotoprobe)
a0d0e21e 2769 continue;
ed8d0fe2
SM		 2770 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2771 if (ops == opstack)
2772 *ops++ = kid;
2773 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2774 ops[-1]->op_type == OP_DBSTATE)
2775 ops[-1] = kid;
2776 else
2777 *ops++ = kid;
2778 }
155aba94 2779 if ((o = dofindlabel(kid, label, ops, oplimit)))
11343788 2780 return o;
a0d0e21e
LW		 2781 }
2782 }
c4aa4e48 2783 *ops = 0;
a0d0e21e
LW		 2784 return 0;
2785}
2786
a0d0e21e
LW		 2787PP(pp_goto)
2788{
27da23d5 2789 dVAR; dSP;
cbbf8932 2790 OP *retop = NULL;
a0d0e21e 2791 I32 ix;
c09156bb 2792 register PERL_CONTEXT *cx;
fc36a67e 2793#define GOTO_DEPTH 64
2794 OP *enterops[GOTO_DEPTH];
cbbf8932 2795 const char *label = NULL;
bfed75c6
AL		 2796 const bool do_dump = (PL_op->op_type == OP_DUMP);
2797 static const char must_have_label[] = "goto must have label";
a0d0e21e 2798
533c011a 2799 if (PL_op->op_flags & OPf_STACKED) {
9d4ba2ae 2800 SV * const sv = POPs;
a0d0e21e
LW		 2801
2802 /* This egregious kludge implements goto &subroutine */
2803 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2804 I32 cxix;
c09156bb 2805 register PERL_CONTEXT *cx;
ea726b52 2806 CV *cv = MUTABLE_CV(SvRV(sv));
a0d0e21e
LW		 2807 SV** mark;
2808 I32 items = 0;
2809 I32 oldsave;
b1464ded 2810 bool reified = 0;
a0d0e21e 2811
e8f7dd13 2812 retry:
4aa0a1f7 2813 if (!CvROOT(cv) && !CvXSUB(cv)) {
7fc63493 2814 const GV * const gv = CvGV(cv);
e8f7dd13 2815 if (gv) {
7fc63493 2816 GV *autogv;
e8f7dd13
GS		 2817 SV *tmpstr;
2818 /* autoloaded stub? */
2819 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2820 goto retry;
c271df94
BF		 2821 autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv),
2822 GvNAMELEN(gv),
2823 GvNAMEUTF8(gv) ? SVf_UTF8 : 0);
e8f7dd13
GS		 2824 if (autogv && (cv = GvCV(autogv)))
2825 goto retry;
2826 tmpstr = sv_newmortal();
c445ea15 2827 gv_efullname3(tmpstr, gv, NULL);
be2597df 2828 DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr));
4aa0a1f7 2829 }
cea2e8a9 2830 DIE(aTHX_ "Goto undefined subroutine");
4aa0a1f7
AD		 2831 }
2832
a0d0e21e 2833 /* First do some returnish stuff. */
b37c2d43 2834 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
71fc2216 2835 FREETMPS;
a0d0e21e
LW		 2836 cxix = dopoptosub(cxstack_ix);
2837 if (cxix < 0)
cea2e8a9 2838 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
a0d0e21e
LW		 2839 if (cxix < cxstack_ix)
2840 dounwind(cxix);
2841 TOPBLOCK(cx);
2d43a17f 2842 SPAGAIN;
564abe23 2843 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2d43a17f 2844 if (CxTYPE(cx) == CXt_EVAL) {
c74ace89 2845 if (CxREALEVAL(cx))
00455a92 2846 /* diag_listed_as: Can't goto subroutine from an eval-%s */
c74ace89
DM		 2847 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2848 else
00455a92 2849 /* diag_listed_as: Can't goto subroutine from an eval-%s */
c74ace89 2850 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2d43a17f 2851 }
9850bf21
RH		 2852 else if (CxMULTICALL(cx))
2853 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
bafb2adc 2854 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
d8b46c1b 2855 /* put @_ back onto stack */
a0d0e21e 2856 AV* av = cx->blk_sub.argarray;
bfed75c6 2857
93965878 2858 items = AvFILLp(av) + 1;
a45cdc79
DM		 2859 EXTEND(SP, items+1); /* @_ could have been extended. */
2860 Copy(AvARRAY(av), SP + 1, items, SV*);
3280af22
NIS		 2861 SvREFCNT_dec(GvAV(PL_defgv));
2862 GvAV(PL_defgv) = cx->blk_sub.savearray;
b1464ded 2863 CLEAR_ARGARRAY(av);
d8b46c1b 2864 /* abandon @_ if it got reified */
62b1ebc2 2865 if (AvREAL(av)) {
b1464ded
DM		 2866 reified = 1;
2867 SvREFCNT_dec(av);
d8b46c1b
GS		 2868 av = newAV();
2869 av_extend(av, items-1);
11ca45c0 2870 AvREIFY_only(av);
ad64d0ec 2871 PAD_SVl(0) = MUTABLE_SV(cx->blk_sub.argarray = av);
62b1ebc2 2872 }
a0d0e21e 2873 }
aed2304a 2874 else if (CvISXSUB(cv)) { /* put GvAV(defgv) back onto stack */
890ce7af 2875 AV* const av = GvAV(PL_defgv);
1fa4e549 2876 items = AvFILLp(av) + 1;
a45cdc79
DM		 2877 EXTEND(SP, items+1); /* @_ could have been extended. */
2878 Copy(AvARRAY(av), SP + 1, items, SV*);
1fa4e549 2879 }
a45cdc79
DM		 2880 mark = SP;
2881 SP += items;
6b35e009 2882 if (CxTYPE(cx) == CXt_SUB &&
b150fb22 2883 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
a0d0e21e 2884 SvREFCNT_dec(cx->blk_sub.cv);
3280af22 2885 oldsave = PL_scopestack[PL_scopestack_ix - 1];
a0d0e21e
LW		 2886 LEAVE_SCOPE(oldsave);
2887
1d59c038
FC		 2888 /* A destructor called during LEAVE_SCOPE could have undefined
2889 * our precious cv. See bug #99850. */
2890 if (!CvROOT(cv) && !CvXSUB(cv)) {
2891 const GV * const gv = CvGV(cv);
2892 if (gv) {
2893 SV * const tmpstr = sv_newmortal();
2894 gv_efullname3(tmpstr, gv, NULL);
2895 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",
2896 SVfARG(tmpstr));
2897 }
2898 DIE(aTHX_ "Goto undefined subroutine");
2899 }
2900
a0d0e21e
LW		 2901 /* Now do some callish stuff. */
2902 SAVETMPS;
5023d17a 2903 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
aed2304a 2904 if (CvISXSUB(cv)) {
b37c2d43 2905 OP* const retop = cx->blk_sub.retop;
9d63fa07
KW		 2906 SV **newsp PERL_UNUSED_DECL;
2907 I32 gimme PERL_UNUSED_DECL;
b1464ded
DM		 2908 if (reified) {
2909 I32 index;
2910 for (index=0; index<items; index++)
2911 sv_2mortal(SP[-index]);
2912 }
1fa4e549 2913
b37c2d43
AL		 2914 /* XS subs don't have a CxSUB, so pop it */
2915 POPBLOCK(cx, PL_curpm);
2916 /* Push a mark for the start of arglist */
2917 PUSHMARK(mark);
2918 PUTBACK;
2919 (void)(*CvXSUB(cv))(aTHX_ cv);
a57c6685 2920 LEAVE;
5eff7df7 2921 return retop;
a0d0e21e
LW		 2922 }
2923 else {
b37c2d43 2924 AV* const padlist = CvPADLIST(cv);
6b35e009 2925 if (CxTYPE(cx) == CXt_EVAL) {
85a64632 2926 PL_in_eval = CxOLD_IN_EVAL(cx);
3280af22 2927 PL_eval_root = cx->blk_eval.old_eval_root;
b150fb22 2928 cx->cx_type = CXt_SUB;
b150fb22 2929 }
a0d0e21e 2930 cx->blk_sub.cv = cv;
1a5b3db4 2931 cx->blk_sub.olddepth = CvDEPTH(cv);
dd2155a4 2932
a0d0e21e
LW		 2933 CvDEPTH(cv)++;
2934 if (CvDEPTH(cv) < 2)
74c765eb 2935 SvREFCNT_inc_simple_void_NN(cv);
dd2155a4 2936 else {
2b9dff67 2937 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION))
44a8e56a 2938 sub_crush_depth(cv);
26019298 2939 pad_push(padlist, CvDEPTH(cv));
a0d0e21e 2940 }
426a09cd 2941 PL_curcop = cx->blk_oldcop;
fd617465
DM		 2942 SAVECOMPPAD();
2943 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
bafb2adc 2944 if (CxHASARGS(cx))
6d4ff0d2 2945 {
502c6561 2946 AV *const av = MUTABLE_AV(PAD_SVl(0));
a0d0e21e 2947
3280af22 2948 cx->blk_sub.savearray = GvAV(PL_defgv);
502c6561 2949 GvAV(PL_defgv) = MUTABLE_AV(SvREFCNT_inc_simple(av));
dd2155a4 2950 CX_CURPAD_SAVE(cx->blk_sub);
6d4ff0d2 2951 cx->blk_sub.argarray = av;
a0d0e21e
LW		 2952
2953 if (items >= AvMAX(av) + 1) {
b37c2d43 2954 SV **ary = AvALLOC(av);
a0d0e21e
LW		 2955 if (AvARRAY(av) != ary) {
2956 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
9c6bc640 2957 AvARRAY(av) = ary;
a0d0e21e
LW		 2958 }
2959 if (items >= AvMAX(av) + 1) {
2960 AvMAX(av) = items - 1;
2961 Renew(ary,items+1,SV*);
2962 AvALLOC(av) = ary;
9c6bc640 2963 AvARRAY(av) = ary;
a0d0e21e
LW		 2964 }
2965 }
a45cdc79 2966 ++mark;
a0d0e21e 2967 Copy(mark,AvARRAY(av),items,SV*);
93965878 2968 AvFILLp(av) = items - 1;
d8b46c1b 2969 assert(!AvREAL(av));
b1464ded
DM		 2970 if (reified) {
2971 /* transfer 'ownership' of refcnts to new @_ */
2972 AvREAL_on(av);
2973 AvREIFY_off(av);
2974 }
a0d0e21e
LW		 2975 while (items--) {
2976 if (*mark)
2977 SvTEMP_off(*mark);
2978 mark++;
2979 }
2980 }
491527d0 2981 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
005a8a35 2982 Perl_get_db_sub(aTHX_ NULL, cv);
b37c2d43 2983 if (PERLDB_GOTO) {
b96d8cd9 2984 CV * const gotocv = get_cvs("DB::goto", 0);
b37c2d43
AL		 2985 if (gotocv) {
2986 PUSHMARK( PL_stack_sp );
ad64d0ec 2987 call_sv(MUTABLE_SV(gotocv), G_SCALAR | G_NODEBUG);
b37c2d43
AL		 2988 PL_stack_sp--;
2989 }
491527d0 2990 }
1ce6579f 2991 }
a0d0e21e
LW		 2992 RETURNOP(CvSTART(cv));
2993 }
2994 }
1614b0e3 2995 else {
0510663f 2996 label = SvPV_nolen_const(sv);
1614b0e3 2997 if (!(do_dump || *label))
cea2e8a9 2998 DIE(aTHX_ must_have_label);
1614b0e3 2999 }
a0d0e21e 3000 }
533c011a 3001 else if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e 3002 if (! do_dump)
cea2e8a9 3003 DIE(aTHX_ must_have_label);
a0d0e21e
LW		 3004 }
3005 else
3006 label = cPVOP->op_pv;
3007
f410a211
NC		 3008 PERL_ASYNC_CHECK();
3009
a0d0e21e 3010 if (label && *label) {
cbbf8932 3011 OP *gotoprobe = NULL;
3b2447bc 3012 bool leaving_eval = FALSE;
33d34e4c 3013 bool in_block = FALSE;
cbbf8932 3014 PERL_CONTEXT *last_eval_cx = NULL;
a0d0e21e
LW		 3015
3016 /* find label */
3017
d4c19fe8 3018 PL_lastgotoprobe = NULL;
a0d0e21e
LW		 3019 *enterops = 0;
3020 for (ix = cxstack_ix; ix >= 0; ix--) {
3021 cx = &cxstack[ix];
6b35e009 3022 switch (CxTYPE(cx)) {
a0d0e21e 3023 case CXt_EVAL:
3b2447bc 3024 leaving_eval = TRUE;
971ecbe6 3025 if (!CxTRYBLOCK(cx)) {
a4f3a277
RH		 3026 gotoprobe = (last_eval_cx ?
3027 last_eval_cx->blk_eval.old_eval_root :
3028 PL_eval_root);
3029 last_eval_cx = cx;
9c5794fe
RH		 3030 break;
3031 }
3032 /* else fall through */
c6fdafd0 3033 case CXt_LOOP_LAZYIV:
d01136d6 3034 case CXt_LOOP_LAZYSV:
3b719c58
NC		 3035 case CXt_LOOP_FOR:
3036 case CXt_LOOP_PLAIN:
bb5aedc1
VP		 3037 case CXt_GIVEN:
3038 case CXt_WHEN:
a0d0e21e
LW		 3039 gotoprobe = cx->blk_oldcop->op_sibling;
3040 break;
3041 case CXt_SUBST:
3042 continue;
3043 case CXt_BLOCK:
33d34e4c 3044 if (ix) {
a0d0e21e 3045 gotoprobe = cx->blk_oldcop->op_sibling;
33d34e4c
AE		 3046 in_block = TRUE;
3047 } else
3280af22 3048 gotoprobe = PL_main_root;
a0d0e21e 3049 break;
b3933176 3050 case CXt_SUB:
9850bf21 3051 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
b3933176
CS		 3052 gotoprobe = CvROOT(cx->blk_sub.cv);
3053 break;
3054 }
3055 /* FALL THROUGH */
7766f137 3056 case CXt_FORMAT:
0a753a76 3057 case CXt_NULL:
a651a37d 3058 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
a0d0e21e
LW		 3059 default:
3060 if (ix)
5637ef5b
NC		 3061 DIE(aTHX_ "panic: goto, type=%u, ix=%ld",
3062 CxTYPE(cx), (long) ix);
3280af22 3063 gotoprobe = PL_main_root;
a0d0e21e
LW		 3064 break;
3065 }
2b597662
GS		 3066 if (gotoprobe) {
3067 retop = dofindlabel(gotoprobe, label,
3068 enterops, enterops + GOTO_DEPTH);
3069 if (retop)
3070 break;
eae48c89
Z		 3071 if (gotoprobe->op_sibling &&
3072 gotoprobe->op_sibling->op_type == OP_UNSTACK &&
3073 gotoprobe->op_sibling->op_sibling) {
3074 retop = dofindlabel(gotoprobe->op_sibling->op_sibling,
3075 label, enterops, enterops + GOTO_DEPTH);
3076 if (retop)
3077 break;
3078 }
2b597662 3079 }
3280af22 3080 PL_lastgotoprobe = gotoprobe;
a0d0e21e
LW		 3081 }
3082 if (!retop)
cea2e8a9 3083 DIE(aTHX_ "Can't find label %s", label);
a0d0e21e 3084
3b2447bc
RH		 3085 /* if we're leaving an eval, check before we pop any frames
3086 that we're not going to punt, otherwise the error
3087 won't be caught */
3088
3089 if (leaving_eval && *enterops && enterops[1]) {
3090 I32 i;
3091 for (i = 1; enterops[i]; i++)
3092 if (enterops[i]->op_type == OP_ENTERITER)
3093 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
3094 }
3095
b500e03b
GG		 3096 if (*enterops && enterops[1]) {
3097 I32 i = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3098 if (enterops[i])
3099 deprecate("\"goto\" to jump into a construct");
3100 }
3101
a0d0e21e
LW		 3102 /* pop unwanted frames */
3103
3104 if (ix < cxstack_ix) {
3105 I32 oldsave;
3106
3107 if (ix < 0)
3108 ix = 0;
3109 dounwind(ix);
3110 TOPBLOCK(cx);
3280af22 3111 oldsave = PL_scopestack[PL_scopestack_ix];
a0d0e21e
LW		 3112 LEAVE_SCOPE(oldsave);
3113 }
3114
3115 /* push wanted frames */
3116
748a9306 3117 if (*enterops && enterops[1]) {
0bd48802 3118 OP * const oldop = PL_op;
33d34e4c
AE		 3119 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3120 for (; enterops[ix]; ix++) {
533c011a 3121 PL_op = enterops[ix];
84902520
TB		 3122 /* Eventually we may want to stack the needed arguments
3123 * for each op. For now, we punt on the hard ones. */
533c011a 3124 if (PL_op->op_type == OP_ENTERITER)
894356b3 3125 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
16c91539 3126 PL_op->op_ppaddr(aTHX);
a0d0e21e 3127 }
533c011a 3128 PL_op = oldop;
a0d0e21e
LW		 3129 }
3130 }
3131
3132 if (do_dump) {
a5f75d66 3133#ifdef VMS
6b88bc9c 3134 if (!retop) retop = PL_main_start;
a5f75d66 3135#endif
3280af22
NIS		 3136 PL_restartop = retop;
3137 PL_do_undump = TRUE;
a0d0e21e
LW		 3138
3139 my_unexec();
3140
3280af22
NIS		 3141 PL_restartop = 0; /* hmm, must be GNU unexec().. */
3142 PL_do_undump = FALSE;
a0d0e21e
LW		 3143 }
3144
3145 RETURNOP(retop);
3146}
3147
3148PP(pp_exit)
3149{
97aff369 3150 dVAR;
39644a26 3151 dSP;
a0d0e21e
LW		 3152 I32 anum;
3153
3154 if (MAXARG < 1)
3155 anum = 0;
9d3c658e
FC		 3156 else if (!TOPs) {
3157 anum = 0; (void)POPs;
3158 }
ff0cee69 3159 else {
a0d0e21e 3160 anum = SvIVx(POPs);
d98f61e7
GS		 3161#ifdef VMS
3162 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
ff0cee69 3163 anum = 0;
96e176bf 3164 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
ff0cee69 3165#endif
3166 }
cc3604b1 3167 PL_exit_flags |= PERL_EXIT_EXPECTED;
81d86705
NC		 3168#ifdef PERL_MAD
3169 /* KLUDGE: disable exit 0 in BEGIN blocks when we're just compiling */
3170 if (anum || !(PL_minus_c && PL_madskills))
3171 my_exit(anum);
3172#else
a0d0e21e 3173 my_exit(anum);
81d86705 3174#endif
3280af22 3175 PUSHs(&PL_sv_undef);
a0d0e21e
LW		 3176 RETURN;
3177}
3178
a0d0e21e
LW		 3179/* Eval. */
3180
0824fdcb 3181STATIC void
cea2e8a9 3182S_save_lines(pTHX_ AV *array, SV *sv)
a0d0e21e 3183{
504618e9 3184 const char *s = SvPVX_const(sv);
890ce7af 3185 const char * const send = SvPVX_const(sv) + SvCUR(sv);
504618e9 3186 I32 line = 1;
a0d0e21e 3187
7918f24d
NC		 3188 PERL_ARGS_ASSERT_SAVE_LINES;
3189
a0d0e21e 3190 while (s && s < send) {
f54cb97a 3191 const char *t;
b9f83d2f 3192 SV * const tmpstr = newSV_type(SVt_PVMG);
a0d0e21e 3193
1d963ff3 3194 t = (const char *)memchr(s, '\n', send - s);
a0d0e21e
LW		 3195 if (t)
3196 t++;
3197 else
3198 t = send;
3199
3200 sv_setpvn(tmpstr, s, t - s);
3201 av_store(array, line++, tmpstr);
3202 s = t;
3203 }
3204}
3205
22f16304
RU		 3206/*
3207=for apidoc docatch
3208
3209Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context.
3210
32110 is used as continue inside eval,
3212
32133 is used for a die caught by an inner eval - continue inner loop
3214
3215See cop.h: je_mustcatch, when set at any runlevel to TRUE, means eval ops must
3216establish a local jmpenv to handle exception traps.
3217
3218=cut
3219*/
0824fdcb 3220STATIC OP *
cea2e8a9 3221S_docatch(pTHX_ OP *o)
1e422769 3222{
97aff369 3223 dVAR;
6224f72b 3224 int ret;
06b5626a 3225 OP * const oldop = PL_op;
db36c5a1 3226 dJMPENV;
1e422769 3227
1e422769 3228#ifdef DEBUGGING
54310121 3229 assert(CATCH_GET == TRUE);
1e422769 3230#endif
312caa8e 3231 PL_op = o;
8bffa5f8 3232
14dd3ad8 3233 JMPENV_PUSH(ret);
6224f72b 3234 switch (ret) {
312caa8e 3235 case 0:
abd70938
DM		 3236 assert(cxstack_ix >= 0);
3237 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3238 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
14dd3ad8 3239 redo_body:
85aaa934 3240 CALLRUNOPS(aTHX);
312caa8e
CS		 3241 break;
3242 case 3:
8bffa5f8 3243 /* die caught by an inner eval - continue inner loop */
febb3a6d
Z		 3244 if (PL_restartop && PL_restartjmpenv == PL_top_env) {
3245 PL_restartjmpenv = NULL;
312caa8e
CS		 3246 PL_op = PL_restartop;
3247 PL_restartop = 0;
3248 goto redo_body;
3249 }
3250 /* FALL THROUGH */
3251 default:
14dd3ad8 3252 JMPENV_POP;
533c011a 3253 PL_op = oldop;
6224f72b 3254 JMPENV_JUMP(ret);
1e422769 3255 /* NOTREACHED */
1e422769 3256 }
14dd3ad8 3257 JMPENV_POP;
533c011a 3258 PL_op = oldop;
5f66b61c 3259 return NULL;
1e422769 3260}
3261
ee23ad3b
NC		 3262/* James Bond: Do you expect me to talk?
3263 Auric Goldfinger: No, Mr. Bond. I expect you to die.
3264
3265 This code is an ugly hack, doesn't work with lexicals in subroutines that are
3266 called more than once, and is only used by regcomp.c, for (?{}) blocks.
3267
3268 Currently it is not used outside the core code. Best if it stays that way.
d59a8b3e
NC		 3269
3270 Hence it's now deprecated, and will be removed.
ee23ad3b 3271*/
c277df42 3272OP *
bfed75c6 3273Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
c277df42
IZ		 3274/* sv Text to convert to OP tree. */
3275/* startop op_free() this to undo. */
3276/* code Short string id of the caller. */
3277{
d59a8b3e
NC		 3278 PERL_ARGS_ASSERT_SV_COMPILE_2OP;
3279 return Perl_sv_compile_2op_is_broken(aTHX_ sv, startop, code, padp);
3280}
3281
3282/* Don't use this. It will go away without warning once the regexp engine is
3283 refactored not to use it. */
3284OP *
3285Perl_sv_compile_2op_is_broken(pTHX_ SV *sv, OP **startop, const char *code,
3286 PAD **padp)
3287{
27da23d5 3288 dVAR; dSP; /* Make POPBLOCK work. */
c277df42
IZ		 3289 PERL_CONTEXT *cx;
3290 SV **newsp;
b094c71d 3291 I32 gimme = G_VOID;
c277df42
IZ		 3292 I32 optype;
3293 OP dummy;
83ee9e09
GS		 3294 char tbuf[TYPE_DIGITS(long) + 12 + 10];
3295 char *tmpbuf = tbuf;
c277df42 3296 char *safestr;
a3985cdc 3297 int runtime;
601f1833 3298 CV* runcv = NULL; /* initialise to avoid compiler warnings */
f7997f86 3299 STRLEN len;
634d6919 3300 bool need_catch;
c277df42 3301
d59a8b3e 3302 PERL_ARGS_ASSERT_SV_COMPILE_2OP_IS_BROKEN;
7918f24d 3303
d343c3ef 3304 ENTER_with_name("eval");
27fcb6ee 3305 lex_start(sv, NULL, LEX_START_SAME_FILTER);
c277df42
IZ		 3306 SAVETMPS;
3307 /* switch to eval mode */
3308
923e4eb5 3309 if (IN_PERL_COMPILETIME) {
f4dd75d9 3310 SAVECOPSTASH_FREE(&PL_compiling);
11faa288 3311 CopSTASH_set(&PL_compiling, PL_curstash);
cbce877f 3312 }
83ee9e09 3313 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
9d4ba2ae 3314 SV * const sv = sv_newmortal();
83ee9e09
GS		 3315 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
3316 code, (unsigned long)++PL_evalseq,
3317 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3318 tmpbuf = SvPVX(sv);
fc009855 3319 len = SvCUR(sv);
83ee9e09
GS		 3320 }
3321 else
d9fad198
JH		 3322 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(%.10s_eval %lu)", code,
3323 (unsigned long)++PL_evalseq);
f4dd75d9 3324 SAVECOPFILE_FREE(&PL_compiling);
57843af0 3325 CopFILE_set(&PL_compiling, tmpbuf+2);
f4dd75d9 3326 SAVECOPLINE(&PL_compiling);
57843af0 3327 CopLINE_set(&PL_compiling, 1);
c277df42
IZ		 3328 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3329 deleting the eval's FILEGV from the stash before gv_check() runs
3330 (i.e. before run-time proper). To work around the coredump that
3331 ensues, we always turn GvMULTI_on for any globals that were
3332 introduced within evals. See force_ident(). GSAR 96-10-12 */
f7997f86
NC		 3333 safestr = savepvn(tmpbuf, len);
3334 SAVEDELETE(PL_defstash, safestr, len);
b3ac6de7 3335 SAVEHINTS();
d1ca3daa 3336#ifdef OP_IN_REGISTER
6b88bc9c 3337 PL_opsave = op;
d1ca3daa 3338#else
7766f137 3339 SAVEVPTR(PL_op);
d1ca3daa 3340#endif
c277df42 3341
a3985cdc 3342 /* we get here either during compilation, or via pp_regcomp at runtime */
923e4eb5 3343 runtime = IN_PERL_RUNTIME;
a3985cdc 3344 if (runtime)
558b4424 3345 {
d819b83a 3346 runcv = find_runcv(NULL);
a3985cdc 3347
558b4424
FC		 3348 /* At run time, we have to fetch the hints from PL_curcop. */
3349 PL_hints = PL_curcop->cop_hints;
3350 if (PL_hints & HINT_LOCALIZE_HH) {
3351 /* SAVEHINTS created a new HV in PL_hintgv, which we
3352 need to GC */
3353 SvREFCNT_dec(GvHV(PL_hintgv));
3354 GvHV(PL_hintgv) =
3355 refcounted_he_chain_2hv(PL_curcop->cop_hints_hash, 0);
3356 hv_magic(GvHV(PL_hintgv), NULL, PERL_MAGIC_hints);
3357 }
3358 SAVECOMPILEWARNINGS();
3359 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
3360 cophh_free(CopHINTHASH_get(&PL_compiling));
3361 /* XXX Does this need to avoid copying a label? */
3362 PL_compiling.cop_hints_hash
3363 = cophh_copy(PL_curcop->cop_hints_hash);
3364 }
3365
533c011a 3366 PL_op = &dummy;
13b51b79 3367 PL_op->op_type = OP_ENTEREVAL;
533c011a 3368 PL_op->op_flags = 0; /* Avoid uninit warning. */
923e4eb5 3369 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
6b75f042 3370 PUSHEVAL(cx, 0);
634d6919
GG		 3371 need_catch = CATCH_GET;
3372 CATCH_SET(TRUE);
a3985cdc
DM		 3373
3374 if (runtime)
f45b078d 3375 (void) doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq, NULL);
a3985cdc 3376 else
f45b078d 3377 (void) doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax, NULL);
634d6919 3378 CATCH_SET(need_catch);
13b51b79 3379 POPBLOCK(cx,PL_curpm);
e84b9f1f 3380 POPEVAL(cx);
c277df42
IZ		 3381
3382 (*startop)->op_type = OP_NULL;
22c35a8c 3383 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
f3548bdc 3384 /* XXX DAPM do this properly one year */
502c6561 3385 *padp = MUTABLE_AV(SvREFCNT_inc_simple(PL_comppad));
d343c3ef 3386 LEAVE_with_name("eval");
923e4eb5 3387 if (IN_PERL_COMPILETIME)
623e6609 3388 CopHINTS_set(&PL_compiling, PL_hints);
d1ca3daa 3389#ifdef OP_IN_REGISTER
6b88bc9c 3390 op = PL_opsave;
d1ca3daa 3391#endif
9d4ba2ae
AL		 3392 PERL_UNUSED_VAR(newsp);
3393 PERL_UNUSED_VAR(optype);
3394
410be5db 3395 return PL_eval_start;
c277df42
IZ		 3396}
3397
a3985cdc
DM		 3398
3399/*
3400=for apidoc find_runcv
3401
3402Locate the CV corresponding to the currently executing sub or eval.
d819b83a
DM		 3403If db_seqp is non_null, skip CVs that are in the DB package and populate
3404*db_seqp with the cop sequence number at the point that the DB:: code was
3405entered. (allows debuggers to eval in the scope of the breakpoint rather
cf525c36 3406than in the scope of the debugger itself).
a3985cdc
DM		 3407
3408=cut
3409*/
3410
3411CV*
d819b83a 3412Perl_find_runcv(pTHX_ U32 *db_seqp)
a3985cdc 3413{
97aff369 3414 dVAR;
a3985cdc 3415 PERL_SI *si;
a3985cdc 3416
d819b83a
DM		 3417 if (db_seqp)
3418 *db_seqp = PL_curcop->cop_seq;
a3985cdc 3419 for (si = PL_curstackinfo; si; si = si->si_prev) {
06b5626a 3420 I32 ix;
a3985cdc 3421 for (ix = si->si_cxix; ix >= 0; ix--) {
06b5626a 3422 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
d819b83a 3423 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1b6737cc 3424 CV * const cv = cx->blk_sub.cv;
d819b83a
DM		 3425 /* skip DB:: code */
3426 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
3427 *db_seqp = cx->blk_oldcop->cop_seq;
3428 continue;
3429 }
3430 return cv;
3431 }
a3985cdc 3432 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
676a678a 3433 return cx->blk_eval.cv;
a3985cdc
DM		 3434 }
3435 }
3436 return PL_main_cv;
3437}
3438
3439
27e90453
DM		 3440/* Run yyparse() in a setjmp wrapper. Returns:
3441 * 0: yyparse() successful
3442 * 1: yyparse() failed
3443 * 3: yyparse() died
3444 */
3445STATIC int
28ac2b49 3446S_try_yyparse(pTHX_ int gramtype)
27e90453
DM		 3447{
3448 int ret;
3449 dJMPENV;
3450
3451 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3452 JMPENV_PUSH(ret);
3453 switch (ret) {
3454 case 0:
28ac2b49 3455 ret = yyparse(gramtype) ? 1 : 0;
27e90453
DM		 3456 break;
3457 case 3:
3458 break;
3459 default:
3460 JMPENV_POP;
3461 JMPENV_JUMP(ret);
3462 /* NOTREACHED */
3463 }
3464 JMPENV_POP;
3465 return ret;
3466}
3467
3468
a3985cdc
DM		 3469/* Compile a require/do, an eval '', or a /(?{...})/.
3470 * In the last case, startop is non-null, and contains the address of
3471 * a pointer that should be set to the just-compiled code.
3472 * outside is the lexically enclosing CV (if any) that invoked us.
410be5db
DM		 3473 * Returns a bool indicating whether the compile was successful; if so,
3474 * PL_eval_start contains the first op of the compiled ocde; otherwise,
3475 * pushes undef (also croaks if startop != NULL).
a3985cdc
DM		 3476 */
3477
7d116edc
FC		 3478/* This function is called from three places, sv_compile_2op, pp_return
3479 * and pp_entereval. These can be distinguished as follows:
3480 * sv_compile_2op - startop is non-null
3840c57b
FC		 3481 * pp_require - startop is null; saveop is not entereval
3482 * pp_entereval - startop is null; saveop is entereval
7d116edc
FC		 3483 */
3484
410be5db 3485STATIC bool
f45b078d 3486S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq, HV *hh)
a0d0e21e 3487{
27da23d5 3488 dVAR; dSP;
46c461b5 3489 OP * const saveop = PL_op;
f45b078d 3490 COP * const oldcurcop = PL_curcop;
27e90453
DM		 3491 bool in_require = (saveop && saveop->op_type == OP_REQUIRE);
3492 int yystatus;
676a678a 3493 CV *evalcv;
a0d0e21e 3494
27e90453 3495 PL_in_eval = (in_require
6dc8a9e4
IZ		 3496 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
3497 : EVAL_INEVAL);
a0d0e21e 3498
1ce6579f 3499 PUSHMARK(SP);
3500
676a678a
Z		 3501 evalcv = MUTABLE_CV(newSV_type(SVt_PVCV));
3502 CvEVAL_on(evalcv);
2090ab20 3503 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
676a678a 3504 cxstack[cxstack_ix].blk_eval.cv = evalcv;
86a64801 3505 cxstack[cxstack_ix].blk_gimme = gimme;
2090ab20 3506
676a678a
Z		 3507 CvOUTSIDE_SEQ(evalcv) = seq;
3508 CvOUTSIDE(evalcv) = MUTABLE_CV(SvREFCNT_inc_simple(outside));
a3985cdc 3509
dd2155a4 3510 /* set up a scratch pad */
a0d0e21e 3511
676a678a 3512 CvPADLIST(evalcv) = pad_new(padnew_SAVE);
cecbe010 3513 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
2c05e328 3514
07055b4c 3515
81d86705 3516 if (!PL_madskills)
676a678a 3517 SAVEMORTALIZESV(evalcv); /* must remain until end of current statement */
748a9306 3518
a0d0e21e
LW		 3519 /* make sure we compile in the right package */
3520
ed094faf 3521 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
03d9f026
FC		 3522 SAVEGENERICSV(PL_curstash);
3523 PL_curstash = (HV *)SvREFCNT_inc_simple(CopSTASH(PL_curcop));
a0d0e21e 3524 }
3c10abe3 3525 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
3280af22
NIS		 3526 SAVESPTR(PL_beginav);
3527 PL_beginav = newAV();
3528 SAVEFREESV(PL_beginav);
3c10abe3
AG		 3529 SAVESPTR(PL_unitcheckav);
3530 PL_unitcheckav = newAV();
3531 SAVEFREESV(PL_unitcheckav);
a0d0e21e 3532
81d86705 3533#ifdef PERL_MAD
9da243ce 3534 SAVEBOOL(PL_madskills);
81d86705
NC		 3535 PL_madskills = 0;
3536#endif
3537
676a678a
Z		 3538 if (!startop) ENTER_with_name("evalcomp");
3539 SAVESPTR(PL_compcv);
3540 PL_compcv = evalcv;
3541
a0d0e21e
LW		 3542 /* try to compile it */
3543
5f66b61c 3544 PL_eval_root = NULL;
3280af22 3545 PL_curcop = &PL_compiling;
5f66b61c 3546 if (saveop && (saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
faef0170 3547 PL_in_eval |= EVAL_KEEPERR;
ab69dbc2
RGS		 3548 else
3549 CLEAR_ERRSV();
27e90453 3550
f45b078d 3551 if (!startop) {
3840c57b 3552 bool clear_hints = saveop->op_type != OP_ENTEREVAL;
f45b078d 3553 SAVEHINTS();
3840c57b 3554 if (clear_hints) {
f45b078d
FC		 3555 PL_hints = 0;
3556 hv_clear(GvHV(PL_hintgv));
3557 }
3558 else {
3559 PL_hints = saveop->op_private & OPpEVAL_COPHH
3560 ? oldcurcop->cop_hints : saveop->op_targ;
3561 if (hh) {
3562 /* SAVEHINTS created a new HV in PL_hintgv, which we need to GC */
3563 SvREFCNT_dec(GvHV(PL_hintgv));
3564 GvHV(PL_hintgv) = hh;
3565 }
3566 }
3567 SAVECOMPILEWARNINGS();
3840c57b 3568 if (clear_hints) {
f45b078d
FC		 3569 if (PL_dowarn & G_WARN_ALL_ON)
3570 PL_compiling.cop_warnings = pWARN_ALL ;
3571 else if (PL_dowarn & G_WARN_ALL_OFF)
3572 PL_compiling.cop_warnings = pWARN_NONE ;
3573 else
3574 PL_compiling.cop_warnings = pWARN_STD ;
3575 }
3576 else {
3577 PL_compiling.cop_warnings =
3578 DUP_WARNINGS(oldcurcop->cop_warnings);
3579 cophh_free(CopHINTHASH_get(&PL_compiling));
3580 if (Perl_cop_fetch_label(aTHX_ oldcurcop, NULL, NULL)) {
3581 /* The label, if present, is the first entry on the chain. So rather
3582 than writing a blank label in front of it (which involves an
3583 allocation), just use the next entry in the chain. */
3584 PL_compiling.cop_hints_hash
3585 = cophh_copy(oldcurcop->cop_hints_hash->refcounted_he_next);
3586 /* Check the assumption that this removed the label. */
3587 assert(Perl_cop_fetch_label(aTHX_ &PL_compiling, NULL, NULL) == NULL);
3588 }
3589 else
3590 PL_compiling.cop_hints_hash = cophh_copy(oldcurcop->cop_hints_hash);
3591 }
3592 }
3593
a88d97bf 3594 CALL_BLOCK_HOOKS(bhk_eval, saveop);
52db365a 3595
27e90453
DM		 3596 /* note that yyparse() may raise an exception, e.g. C<BEGIN{die}>,
3597 * so honour CATCH_GET and trap it here if necessary */
3598
28ac2b49 3599 yystatus = (!in_require && CATCH_GET) ? S_try_yyparse(aTHX_ GRAMPROG) : yyparse(GRAMPROG);
27e90453
DM		 3600
3601 if (yystatus || PL_parser->error_count || !PL_eval_root) {
0c58d367 3602 SV **newsp; /* Used by POPBLOCK. */
d164302a 3603 PERL_CONTEXT *cx;
27e90453 3604 I32 optype; /* Used by POPEVAL. */
d164302a 3605 SV *namesv;
bfed75c6 3606
d164302a
GG		 3607 cx = NULL;
3608 namesv = NULL;
27e90453
DM		 3609 PERL_UNUSED_VAR(newsp);
3610 PERL_UNUSED_VAR(optype);
3611
c86ffc32
DM		 3612 /* note that if yystatus == 3, then the EVAL CX block has already
3613 * been popped, and various vars restored */
533c011a 3614 PL_op = saveop;
27e90453 3615 if (yystatus != 3) {
c86ffc32
DM		 3616 if (PL_eval_root) {
3617 op_free(PL_eval_root);
3618 PL_eval_root = NULL;
3619 }
27e90453
DM		 3620 SP = PL_stack_base + POPMARK; /* pop original mark */
3621 if (!startop) {
3622 POPBLOCK(cx,PL_curpm);
3623 POPEVAL(cx);
b6494f15 3624 namesv = cx->blk_eval.old_namesv;
27e90453 3625 }
bbde7ba3 3626 /* POPBLOCK renders LEAVE_with_name("evalcomp") unnecessary. */
27e90453 3627 LEAVE_with_name("eval"); /* pp_entereval knows about this LEAVE. */
cd6472fc 3628 }
9d4ba2ae 3629
27e90453 3630 if (in_require) {
b6494f15
VP		 3631 if (!cx) {
3632 /* If cx is still NULL, it means that we didn't go in the
3633 * POPEVAL branch. */
3634 cx = &cxstack[cxstack_ix];
3635 assert(CxTYPE(cx) == CXt_EVAL);
3636 namesv = cx->blk_eval.old_namesv;
3637 }
3638 (void)hv_store(GvHVn(PL_incgv),
ecad31f0 3639 SvPVX_const(namesv),
c60dbbc3 3640 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
b6494f15 3641 &PL_sv_undef, 0);
ecad31f0
BF		 3642 Perl_croak(aTHX_ "%"SVf"Compilation failed in require",
3643 SVfARG(ERRSV
3644 ? ERRSV
3645 : newSVpvs_flags("Unknown error\n", SVs_TEMP)));
5a844595
GS		 3646 }
3647 else if (startop) {
27e90453
DM		 3648 if (yystatus != 3) {
3649 POPBLOCK(cx,PL_curpm);
3650 POPEVAL(cx);
3651 }
ecad31f0
BF		 3652 Perl_croak(aTHX_ "%"SVf"Compilation failed in regexp",
3653 SVfARG(ERRSV
3654 ? ERRSV
3655 : newSVpvs_flags("Unknown error\n", SVs_TEMP)));
7a2e2cd6 3656 }
9d7f88dd 3657 else {
ecad31f0 3658 if (!*(SvPVx_nolen_const(ERRSV))) {
6502358f 3659 sv_setpvs(ERRSV, "Compilation error");
9d7f88dd
SR		 3660 }
3661 }
2bf54cc6 3662 if (gimme != G_ARRAY) PUSHs(&PL_sv_undef);
410be5db
DM		 3663 PUTBACK;
3664 return FALSE;
a0d0e21e 3665 }
bbde7ba3 3666 else if (!startop) LEAVE_with_name("evalcomp");
57843af0 3667 CopLINE_set(&PL_compiling, 0);
c277df42 3668 if (startop) {
3280af22 3669 *startop = PL_eval_root;
c277df42 3670 } else
3280af22 3671 SAVEFREEOP(PL_eval_root);
0c58d367 3672
a0d0e21e
LW		 3673 DEBUG_x(dump_eval());
3674
55497cff 3675 /* Register with debugger: */
6482a30d 3676 if (PERLDB_INTER && saveop && saveop->op_type == OP_REQUIRE) {
b96d8cd9 3677 CV * const cv = get_cvs("DB::postponed", 0);
55497cff 3678 if (cv) {
3679 dSP;
924508f0 3680 PUSHMARK(SP);
ad64d0ec 3681 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
55497cff 3682 PUTBACK;
ad64d0ec 3683 call_sv(MUTABLE_SV(cv), G_DISCARD);
55497cff 3684 }
3685 }
3686
8ed49485
FC		 3687 if (PL_unitcheckav) {
3688 OP *es = PL_eval_start;
3c10abe3 3689 call_list(PL_scopestack_ix, PL_unitcheckav);
8ed49485
FC		 3690 PL_eval_start = es;
3691 }
3c10abe3 3692
a0d0e21e
LW		 3693 /* compiled okay, so do it */
3694
676a678a 3695 CvDEPTH(evalcv) = 1;
3280af22 3696 SP = PL_stack_base + POPMARK; /* pop original mark */
533c011a 3697 PL_op = saveop; /* The caller may need it. */
bc177e6b 3698 PL_parser->lex_state = LEX_NOTPARSING; /* $^S needs this. */
5dc0d613 3699
410be5db
DM		 3700 PUTBACK;
3701 return TRUE;
a0d0e21e
LW		 3702}
3703
a6c40364 3704STATIC PerlIO *
282b29ee 3705S_check_type_and_open(pTHX_ SV *name)
ce8abf5f
SP		 3706{
3707 Stat_t st;
282b29ee
NC		 3708 const char *p = SvPV_nolen_const(name);
3709 const int st_rc = PerlLIO_stat(p, &st);
df528165 3710
7918f24d
NC		 3711 PERL_ARGS_ASSERT_CHECK_TYPE_AND_OPEN;
3712
6b845e56 3713 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
4608196e 3714 return NULL;
ce8abf5f
SP		 3715 }
3716
ccb84406 3717#if !defined(PERLIO_IS_STDIO) && !defined(USE_SFIO)
639dfab0 3718 return PerlIO_openn(aTHX_ ":", PERL_SCRIPT_MODE, -1, 0, 0, NULL, 1, &name);
ccb84406 3719#else
282b29ee 3720 return PerlIO_open(p, PERL_SCRIPT_MODE);
ccb84406 3721#endif
ce8abf5f
SP		 3722}
3723
75c20bac 3724#ifndef PERL_DISABLE_PMC
ce8abf5f 3725STATIC PerlIO *
282b29ee 3726S_doopen_pm(pTHX_ SV *name)
b295d113 3727{
282b29ee
NC		 3728 STRLEN namelen;
3729 const char *p = SvPV_const(name, namelen);
b295d113 3730
7918f24d
NC		 3731 PERL_ARGS_ASSERT_DOOPEN_PM;
3732
282b29ee 3733 if (namelen > 3 && memEQs(p + namelen - 3, 3, ".pm")) {
eb70bb4a 3734 SV *const pmcsv = sv_newmortal();
a6c40364 3735 Stat_t pmcstat;
50b8ed39 3736
eb70bb4a 3737 SvSetSV_nosteal(pmcsv,name);
282b29ee 3738 sv_catpvn(pmcsv, "c", 1);
50b8ed39 3739
282b29ee
NC		 3740 if (PerlLIO_stat(SvPV_nolen_const(pmcsv), &pmcstat) >= 0)
3741 return check_type_and_open(pmcsv);
a6c40364 3742 }
282b29ee 3743 return check_type_and_open(name);
75c20bac 3744}
7925835c 3745#else
282b29ee 3746# define doopen_pm(name) check_type_and_open(name)
7925835c 3747#endif /* !PERL_DISABLE_PMC */
b295d113 3748
a0d0e21e
LW		 3749PP(pp_require)
3750{
27da23d5 3751 dVAR; dSP;
c09156bb 3752 register PERL_CONTEXT *cx;
a0d0e21e 3753 SV *sv;
5c144d81 3754 const char *name;
6132ea6c 3755 STRLEN len;
4492be7a
JM		 3756 char * unixname;
3757 STRLEN unixlen;
62f5ad7a 3758#ifdef VMS
4492be7a 3759 int vms_unixname = 0;
62f5ad7a 3760#endif
c445ea15
AL		 3761 const char *tryname = NULL;
3762 SV *namesv = NULL;
f54cb97a 3763 const I32 gimme = GIMME_V;
bbed91b5 3764 int filter_has_file = 0;
c445ea15 3765 PerlIO *tryrsfp = NULL;
34113e50 3766 SV *filter_cache = NULL;
c445ea15
AL		 3767 SV *filter_state = NULL;
3768 SV *filter_sub = NULL;
3769 SV *hook_sv = NULL;
6ec9efec
JH		 3770 SV *encoding;
3771 OP *op;
a0d0e21e
LW		 3772
3773 sv = POPs;
d7aa5382 3774 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
d086148c 3775 sv = sv_2mortal(new_version(sv));
d7aa5382 3776 if (!sv_derived_from(PL_patchlevel, "version"))
ac0e6a2f 3777 upg_version(PL_patchlevel, TRUE);
149c1637 3778 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3cacfbb9 3779 if ( vcmp(sv,PL_patchlevel) <= 0 )
468aa647 3780 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
e753e3b1
FC		 3781 SVfARG(sv_2mortal(vnormal(sv))),
3782 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3783 );
468aa647
RGS		 3784 }
3785 else {
d1029faa
JP		 3786 if ( vcmp(sv,PL_patchlevel) > 0 ) {
3787 I32 first = 0;
3788 AV *lav;
3789 SV * const req = SvRV(sv);
85fbaab2 3790 SV * const pv = *hv_fetchs(MUTABLE_HV(req), "original", FALSE);
d1029faa
JP		 3791
3792 /* get the left hand term */
502c6561 3793 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(req), "version", FALSE)));
d1029faa
JP		 3794
3795 first = SvIV(*av_fetch(lav,0,0));
3796 if ( first > (int)PERL_REVISION /* probably 'use 6.0' */
85fbaab2 3797 || hv_exists(MUTABLE_HV(req), "qv", 2 ) /* qv style */
d1029faa
JP		 3798 || av_len(lav) > 1 /* FP with > 3 digits */
3799 || strstr(SvPVX(pv),".0") /* FP with leading 0 */
3800 ) {
3801 DIE(aTHX_ "Perl %"SVf" required--this is only "
9d056fb0
FC		 3802 "%"SVf", stopped",
3803 SVfARG(sv_2mortal(vnormal(req))),
3804 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3805 );
d1029faa
JP		 3806 }
3807 else { /* probably 'use 5.10' or 'use 5.8' */
af61dbfd 3808 SV *hintsv;
d1029faa
JP		 3809 I32 second = 0;
3810
3811 if (av_len(lav)>=1)
3812 second = SvIV(*av_fetch(lav,1,0));
3813
3814 second /= second >= 600 ? 100 : 10;
af61dbfd
NC		 3815 hintsv = Perl_newSVpvf(aTHX_ "v%d.%d.0",
3816 (int)first, (int)second);
d1029faa
JP		 3817 upg_version(hintsv, TRUE);
3818
3819 DIE(aTHX_ "Perl %"SVf" required (did you mean %"SVf"?)"
3820 "--this is only %"SVf", stopped",
1be7d6f3
FC		 3821 SVfARG(sv_2mortal(vnormal(req))),
3822 SVfARG(sv_2mortal(vnormal(sv_2mortal(hintsv)))),
3823 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3824 );
d1029faa
JP		 3825 }
3826 }
468aa647 3827 }
d7aa5382 3828
7dfde25d 3829 RETPUSHYES;
a0d0e21e 3830 }
5c144d81 3831 name = SvPV_const(sv, len);
6132ea6c 3832 if (!(name && len > 0 && *name))
cea2e8a9 3833 DIE(aTHX_ "Null filename used");
4633a7c4 3834 TAINT_PROPER("require");
4492be7a
JM		 3835
3836
3837#ifdef VMS
3838 /* The key in the %ENV hash is in the syntax of file passed as the argument
3839 * usually this is in UNIX format, but sometimes in VMS format, which
3840 * can result in a module being pulled in more than once.
3841 * To prevent this, the key must be stored in UNIX format if the VMS
3842 * name can be translated to UNIX.
3843 */
3844 if ((unixname = tounixspec(name, NULL)) != NULL) {
3845 unixlen = strlen(unixname);
3846 vms_unixname = 1;
3847 }
3848 else
3849#endif
3850 {
3851 /* if not VMS or VMS name can not be translated to UNIX, pass it
3852 * through.
3853 */
3854 unixname = (char *) name;
3855 unixlen = len;
3856 }
44f8325f 3857 if (PL_op->op_type == OP_REQUIRE) {
4492be7a
JM		 3858 SV * const * const svp = hv_fetch(GvHVn(PL_incgv),
3859 unixname, unixlen, 0);
44f8325f
AL		 3860 if ( svp ) {
3861 if (*svp != &PL_sv_undef)
3862 RETPUSHYES;
3863 else
087b5369
RD		 3864 DIE(aTHX_ "Attempt to reload %s aborted.\n"
3865 "Compilation failed in require", unixname);
44f8325f 3866 }
4d8b06f1 3867 }
a0d0e21e
LW		 3868
3869 /* prepare to compile file */
3870
be4b629d 3871 if (path_is_absolute(name)) {
282b29ee 3872 /* At this point, name is SvPVX(sv) */
46fc3d4c 3873 tryname = name;
282b29ee 3874 tryrsfp = doopen_pm(sv);
bf4acbe4 3875 }
be4b629d 3876 if (!tryrsfp) {
44f8325f 3877 AV * const ar = GvAVn(PL_incgv);
a0d0e21e 3878 I32 i;
748a9306 3879#ifdef VMS
4492be7a 3880 if (vms_unixname)
46fc3d4c 3881#endif
3882 {
d0328fd7 3883 namesv = newSV_type(SVt_PV);
46fc3d4c 3884 for (i = 0; i <= AvFILL(ar); i++) {
df528165 3885 SV * const dirsv = *av_fetch(ar, i, TRUE);
bbed91b5 3886
ad64d0ec 3887 if (SvTIED_mg((const SV *)ar, PERL_MAGIC_tied))
c38a6530 3888 mg_get(dirsv);
bbed91b5
KF		 3889 if (SvROK(dirsv)) {
3890 int count;
a3b58a99 3891 SV **svp;
bbed91b5
KF		 3892 SV *loader = dirsv;
3893
e14e2dc8
NC		 3894 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3895 && !sv_isobject(loader))
3896 {
502c6561 3897 loader = *av_fetch(MUTABLE_AV(SvRV(loader)), 0, TRUE);
bbed91b5
KF		 3898 }
3899
b900a521 3900 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
44f0be63 3901 PTR2UV(SvRV(dirsv)), name);
349d4f2f 3902 tryname = SvPVX_const(namesv);
c445ea15 3903 tryrsfp = NULL;
bbed91b5 3904
d343c3ef 3905 ENTER_with_name("call_INC");
bbed91b5
KF		 3906 SAVETMPS;
3907 EXTEND(SP, 2);
3908
3909 PUSHMARK(SP);
3910 PUSHs(dirsv);
3911 PUSHs(sv);
3912 PUTBACK;
e982885c
NC		 3913 if (sv_isobject(loader))
3914 count = call_method("INC", G_ARRAY);
3915 else
3916 count = call_sv(loader, G_ARRAY);
bbed91b5
KF		 3917 SPAGAIN;
3918
3919 if (count > 0) {
3920 int i = 0;
3921 SV *arg;
3922
3923 SP -= count - 1;
3924 arg = SP[i++];
3925
34113e50
NC		 3926 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3927 && !isGV_with_GP(SvRV(arg))) {
3928 filter_cache = SvRV(arg);
74c765eb 3929 SvREFCNT_inc_simple_void_NN(filter_cache);
34113e50
NC		 3930
3931 if (i < count) {
3932 arg = SP[i++];
3933 }
3934 }
3935
6e592b3a 3936 if (SvROK(arg) && isGV_with_GP(SvRV(arg))) {
bbed91b5
KF		 3937 arg = SvRV(arg);
3938 }
3939
6e592b3a 3940 if (isGV_with_GP(arg)) {
159b6efe 3941 IO * const io = GvIO((const GV *)arg);
bbed91b5
KF		 3942
3943 ++filter_has_file;
3944
3945 if (io) {
3946 tryrsfp = IoIFP(io);
0f7de14d
NC		 3947 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3948 PerlIO_close(IoOFP(io));
bbed91b5 3949 }
0f7de14d
NC		 3950 IoIFP(io) = NULL;
3951 IoOFP(io) = NULL;
bbed91b5
KF		 3952 }
3953
3954 if (i < count) {
3955 arg = SP[i++];
3956 }
3957 }
3958
3959 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3960 filter_sub = arg;
74c765eb 3961 SvREFCNT_inc_simple_void_NN(filter_sub);
bbed91b5
KF		 3962
3963 if (i < count) {
3964 filter_state = SP[i];
b37c2d43 3965 SvREFCNT_inc_simple_void(filter_state);
bbed91b5 3966 }
34113e50 3967 }
bbed91b5 3968
34113e50
NC		 3969 if (!tryrsfp && (filter_cache || filter_sub)) {
3970 tryrsfp = PerlIO_open(BIT_BUCKET,
3971 PERL_SCRIPT_MODE);
bbed91b5 3972 }
1d06aecd 3973 SP--;
bbed91b5
KF		 3974 }
3975
3976 PUTBACK;
3977 FREETMPS;
d343c3ef 3978 LEAVE_with_name("call_INC");
bbed91b5 3979
c5f55552
NC		 3980 /* Adjust file name if the hook has set an %INC entry.
3981 This needs to happen after the FREETMPS above. */
3982 svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3983 if (svp)
3984 tryname = SvPV_nolen_const(*svp);
3985
bbed91b5 3986 if (tryrsfp) {
89ccab8c 3987 hook_sv = dirsv;
bbed91b5
KF		 3988 break;
3989 }
3990
3991 filter_has_file = 0;
34113e50
NC		 3992 if (filter_cache) {
3993 SvREFCNT_dec(filter_cache);
3994 filter_cache = NULL;
3995 }
bbed91b5
KF		 3996 if (filter_state) {
3997 SvREFCNT_dec(filter_state);
c445ea15 3998 filter_state = NULL;
bbed91b5
KF		 3999 }
4000 if (filter_sub) {
4001 SvREFCNT_dec(filter_sub);
c445ea15 4002 filter_sub = NULL;
bbed91b5
KF		 4003 }
4004 }
4005 else {
be4b629d 4006 if (!path_is_absolute(name)
be4b629d 4007 ) {
b640a14a
NC		 4008 const char *dir;
4009 STRLEN dirlen;
4010
4011 if (SvOK(dirsv)) {
4012 dir = SvPV_const(dirsv, dirlen);
4013 } else {
4014 dir = "";
4015 dirlen = 0;
4016 }
4017
e37778c2 4018#ifdef VMS
bbed91b5 4019 char *unixdir;
c445ea15 4020 if ((unixdir = tounixpath(dir, NULL)) == NULL)
bbed91b5
KF		 4021 continue;
4022 sv_setpv(namesv, unixdir);
4023 sv_catpv(namesv, unixname);
e37778c2
NC		 4024#else
4025# ifdef __SYMBIAN32__
27da23d5
JH		 4026 if (PL_origfilename[0] &&
4027 PL_origfilename[1] == ':' &&
4028 !(dir[0] && dir[1] == ':'))
4029 Perl_sv_setpvf(aTHX_ namesv,
4030 "%c:%s\\%s",
4031 PL_origfilename[0],
4032 dir, name);
4033 else
4034 Perl_sv_setpvf(aTHX_ namesv,
4035 "%s\\%s",
4036 dir, name);
e37778c2 4037# else
b640a14a
NC		 4038 /* The equivalent of
4039 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
4040 but without the need to parse the format string, or
4041 call strlen on either pointer, and with the correct
4042 allocation up front. */
4043 {
4044 char *tmp = SvGROW(namesv, dirlen + len + 2);
4045
4046 memcpy(tmp, dir, dirlen);
4047 tmp +=dirlen;
4048 *tmp++ = '/';
4049 /* name came from an SV, so it will have a '\0' at the
4050 end that we can copy as part of this memcpy(). */
4051 memcpy(tmp, name, len + 1);
4052
4053 SvCUR_set(namesv, dirlen + len + 1);
282b29ee 4054 SvPOK_on(namesv);
b640a14a 4055 }
27da23d5 4056# endif
bf4acbe4 4057#endif
bbed91b5 4058 TAINT_PROPER("require");
349d4f2f 4059 tryname = SvPVX_const(namesv);
282b29ee 4060 tryrsfp = doopen_pm(namesv);
bbed91b5 4061 if (tryrsfp) {
e63be746
RGS		 4062 if (tryname[0] == '.' && tryname[1] == '/') {
4063 ++tryname;
4064 while (*++tryname == '/');
4065 }
bbed91b5
KF		 4066 break;
4067 }
ff806af2
DM		 4068 else if (errno == EMFILE)
4069 /* no point in trying other paths if out of handles */
4070 break;
be4b629d 4071 }
46fc3d4c 4072 }
a0d0e21e
LW		 4073 }
4074 }
4075 }
b2ef6d44 4076 sv_2mortal(namesv);
a0d0e21e 4077 if (!tryrsfp) {
533c011a 4078 if (PL_op->op_type == OP_REQUIRE) {
e31de809 4079 if(errno == EMFILE) {
c9d5e35e
NC		 4080 /* diag_listed_as: Can't locate %s */
4081 DIE(aTHX_ "Can't locate %s: %s", name, Strerror(errno));
e31de809
SP		 4082 } else {
4083 if (namesv) { /* did we lookup @INC? */
44f8325f 4084 AV * const ar = GvAVn(PL_incgv);
e31de809 4085 I32 i;
c9d5e35e
NC		 4086 SV *const inc = newSVpvs_flags("", SVs_TEMP);
4087 for (i = 0; i <= AvFILL(ar); i++) {
4088 sv_catpvs(inc, " ");
4089 sv_catsv(inc, *av_fetch(ar, i, TRUE));
4090 }
4091
4092 /* diag_listed_as: Can't locate %s */
4093 DIE(aTHX_
4094 "Can't locate %s in @INC%s%s (@INC contains:%" SVf ")",
4095 name,
686c4ca0
NC		 4096 (memEQ(name + len - 2, ".h", 3)
4097 ? " (change .h to .ph maybe?) (did you run h2ph?)" : ""),
4098 (memEQ(name + len - 3, ".ph", 4)
c9d5e35e
NC		 4099 ? " (did you run h2ph?)" : ""),
4100 inc
4101 );
4102 }
2683423c 4103 }
c9d5e35e 4104 DIE(aTHX_ "Can't locate %s", name);
a0d0e21e
LW		 4105 }
4106
4107 RETPUSHUNDEF;
4108 }
d8bfb8bd 4109 else
93189314 4110 SETERRNO(0, SS_NORMAL);
a0d0e21e
LW		 4111
4112 /* Assume success here to prevent recursive requirement. */
238d24b4 4113 /* name is never assigned to again, so len is still strlen(name) */
d3a4e64e 4114 /* Check whether a hook in @INC has already filled %INC */
44f8325f 4115 if (!hook_sv) {
4492be7a 4116 (void)hv_store(GvHVn(PL_incgv),
b2ef6d44 4117 unixname, unixlen, newSVpv(tryname,0),0);
44f8325f 4118 } else {
4492be7a 4119 SV** const svp = hv_fetch(GvHVn(PL_incgv), unixname, unixlen, 0);
44f8325f 4120 if (!svp)
4492be7a
JM		 4121 (void)hv_store(GvHVn(PL_incgv),
4122 unixname, unixlen, SvREFCNT_inc_simple(hook_sv), 0 );
d3a4e64e 4123 }
a0d0e21e 4124
d343c3ef 4125 ENTER_with_name("eval");
a0d0e21e 4126 SAVETMPS;
b2ef6d44
FC		 4127 SAVECOPFILE_FREE(&PL_compiling);
4128 CopFILE_set(&PL_compiling, tryname);
8eaa0acf 4129 lex_start(NULL, tryrsfp, 0);
e50aee73 4130
34113e50 4131 if (filter_sub || filter_cache) {
4464f08e
NC		 4132 /* We can use the SvPV of the filter PVIO itself as our cache, rather
4133 than hanging another SV from it. In turn, filter_add() optionally
4134 takes the SV to use as the filter (or creates a new SV if passed
4135 NULL), so simply pass in whatever value filter_cache has. */
4136 SV * const datasv = filter_add(S_run_user_filter, filter_cache);
bbed91b5 4137 IoLINES(datasv) = filter_has_file;
159b6efe
NC		 4138 IoTOP_GV(datasv) = MUTABLE_GV(filter_state);
4139 IoBOTTOM_GV(datasv) = MUTABLE_GV(filter_sub);
bbed91b5
KF		 4140 }
4141
4142 /* switch to eval mode */
a0d0e21e 4143 PUSHBLOCK(cx, CXt_EVAL, SP);
6b75f042 4144 PUSHEVAL(cx, name);
f39bc417 4145 cx->blk_eval.retop = PL_op->op_next;
a0d0e21e 4146
57843af0
GS		 4147 SAVECOPLINE(&PL_compiling);
4148 CopLINE_set(&PL_compiling, 0);
a0d0e21e
LW		 4149
4150 PUTBACK;
6ec9efec
JH		 4151
4152 /* Store and reset encoding. */
4153 encoding = PL_encoding;
c445ea15 4154 PL_encoding = NULL;
6ec9efec 4155
f45b078d 4156 if (doeval(gimme, NULL, NULL, PL_curcop->cop_seq, NULL))
410be5db
DM		 4157 op = DOCATCH(PL_eval_start);
4158 else
4159 op = PL_op->op_next;
bfed75c6 4160
6ec9efec
JH		 4161 /* Restore encoding. */
4162 PL_encoding = encoding;
4163
4164 return op;
a0d0e21e
LW		 4165}
4166
996c9baa
VP		 4167/* This is a op added to hold the hints hash for
4168 pp_entereval. The hash can be modified by the code
4169 being eval'ed, so we return a copy instead. */
4170
4171PP(pp_hintseval)
4172{
4173 dVAR;
4174 dSP;
defdfed5 4175 mXPUSHs(MUTABLE_SV(hv_copy_hints_hv(MUTABLE_HV(cSVOP_sv))));
996c9baa
VP		 4176 RETURN;
4177}
4178
4179
a0d0e21e
LW		 4180PP(pp_entereval)
4181{
27da23d5 4182 dVAR; dSP;
c09156bb 4183 register PERL_CONTEXT *cx;
0d863452 4184 SV *sv;
890ce7af 4185 const I32 gimme = GIMME_V;
fd06b02c 4186 const U32 was = PL_breakable_sub_gen;
83ee9e09 4187 char tbuf[TYPE_DIGITS(long) + 12];
78da7625 4188 bool saved_delete = FALSE;
83ee9e09 4189 char *tmpbuf = tbuf;
a0d0e21e 4190 STRLEN len;
a3985cdc 4191 CV* runcv;
0abcdfa4 4192 U32 seq, lex_flags = 0;
c445ea15 4193 HV *saved_hh = NULL;
60d63348 4194 const bool bytes = PL_op->op_private & OPpEVAL_BYTES;
e389bba9 4195
0d863452 4196 if (PL_op->op_private & OPpEVAL_HAS_HH) {
85fbaab2 4197 saved_hh = MUTABLE_HV(SvREFCNT_inc(POPs));
0d863452 4198 }
bc344123
FC		 4199 else if (PL_hints & HINT_LOCALIZE_HH || (
4200 PL_op->op_private & OPpEVAL_COPHH
4201 && PL_curcop->cop_hints & HINT_LOCALIZE_HH
4202 )) {
7d789282
FC		 4203 saved_hh = cop_hints_2hv(PL_curcop, 0);
4204 hv_magic(saved_hh, NULL, PERL_MAGIC_hints);
4205 }
0d863452 4206 sv = POPs;
895b760f
DM		 4207 if (!SvPOK(sv)) {
4208 /* make sure we've got a plain PV (no overload etc) before testing
4209 * for taint. Making a copy here is probably overkill, but better
4210 * safe than sorry */
0479a84a
NC		 4211 STRLEN len;
4212 const char * const p = SvPV_const(sv, len);
4213
4214 sv = newSVpvn_flags(p, len, SVs_TEMP | SvUTF8(sv));
0abcdfa4 4215 lex_flags |= LEX_START_COPIED;
7d789282 4216
60d63348 4217 if (bytes && SvUTF8(sv))
7d789282
FC		 4218 SvPVbyte_force(sv, len);
4219 }
60d63348 4220 else if (bytes && SvUTF8(sv)) {
e1fa07e3 4221 /* Don't modify someone else's scalar */
7d789282
FC		 4222 STRLEN len;
4223 sv = newSVsv(sv);
5cefc8c1 4224 (void)sv_2mortal(sv);
7d789282 4225 SvPVbyte_force(sv,len);
0abcdfa4 4226 lex_flags |= LEX_START_COPIED;
895b760f 4227 }
a0d0e21e 4228
af2d3def 4229 TAINT_IF(SvTAINTED(sv));
748a9306 4230 TAINT_PROPER("eval");
a0d0e21e 4231
d343c3ef 4232 ENTER_with_name("eval");
0abcdfa4 4233 lex_start(sv, NULL, lex_flags | (PL_op->op_private & OPpEVAL_UNICODE
60d63348
FC		 4234 ? LEX_IGNORE_UTF8_HINTS
4235 : bytes ? LEX_EVALBYTES : LEX_START_SAME_FILTER
0abcdfa4 4236 )
60d63348 4237 );
748a9306 4238 SAVETMPS;
ac27b0f5 4239
a0d0e21e
LW		 4240 /* switch to eval mode */
4241
83ee9e09 4242 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
8b38226b
AL		 4243 SV * const temp_sv = sv_newmortal();
4244 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
83ee9e09
GS		 4245 (unsigned long)++PL_evalseq,
4246 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
8b38226b
AL		 4247 tmpbuf = SvPVX(temp_sv);
4248 len = SvCUR(temp_sv);
83ee9e09
GS		 4249 }
4250 else
d9fad198 4251 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
f4dd75d9 4252 SAVECOPFILE_FREE(&PL_compiling);
57843af0 4253 CopFILE_set(&PL_compiling, tmpbuf+2);
f4dd75d9 4254 SAVECOPLINE(&PL_compiling);
57843af0 4255 CopLINE_set(&PL_compiling, 1);
d819b83a
DM		 4256 /* special case: an eval '' executed within the DB package gets lexically
4257 * placed in the first non-DB CV rather than the current CV - this
4258 * allows the debugger to execute code, find lexicals etc, in the
4259 * scope of the code being debugged. Passing &seq gets find_runcv
4260 * to do the dirty work for us */
4261 runcv = find_runcv(&seq);
a0d0e21e 4262
6b35e009 4263 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
6b75f042 4264 PUSHEVAL(cx, 0);
f39bc417 4265 cx->blk_eval.retop = PL_op->op_next;
a0d0e21e
LW		 4266
4267 /* prepare to compile string */
4268
a44e3ce2 4269 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash)
bdc0bf6f 4270 save_lines(CopFILEAV(&PL_compiling), PL_parser->linestr);
78da7625 4271 else {
c8cb8d55
FC		 4272 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
4273 deleting the eval's FILEGV from the stash before gv_check() runs
4274 (i.e. before run-time proper). To work around the coredump that
4275 ensues, we always turn GvMULTI_on for any globals that were
4276 introduced within evals. See force_ident(). GSAR 96-10-12 */
78da7625
FC		 4277 char *const safestr = savepvn(tmpbuf, len);
4278 SAVEDELETE(PL_defstash, safestr, len);
4279 saved_delete = TRUE;
4280 }
4281
a0d0e21e 4282 PUTBACK;
f9bddea7 4283
f45b078d 4284 if (doeval(gimme, NULL, runcv, seq, saved_hh)) {
f9bddea7
NC		 4285 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4286 ? (PERLDB_LINE || PERLDB_SAVESRC)
4287 : PERLDB_SAVESRC_NOSUBS) {
4288 /* Retain the filegv we created. */
78da7625 4289 } else if (!saved_delete) {
f9bddea7
NC		 4290 char *const safestr = savepvn(tmpbuf, len);
4291 SAVEDELETE(PL_defstash, safestr, len);
4292 }
4293 return DOCATCH(PL_eval_start);
4294 } else {
486ec47a 4295 /* We have already left the scope set up earlier thanks to the LEAVE
f9bddea7 4296 in doeval(). */
eb044b10
NC		 4297 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4298 ? (PERLDB_LINE || PERLDB_SAVESRC)
4299 : PERLDB_SAVESRC_INVALID) {
f9bddea7 4300 /* Retain the filegv we created. */
7857f360 4301 } else if (!saved_delete) {
f9bddea7
NC		 4302 (void)hv_delete(PL_defstash, tmpbuf, len, G_DISCARD);
4303 }
4304 return PL_op->op_next;
4305 }
a0d0e21e
LW		 4306}
4307
4308PP(pp_leaveeval)
4309{
27da23d5 4310 dVAR; dSP;
a0d0e21e
LW		 4311 SV **newsp;
4312 PMOP *newpm;
4313 I32 gimme;
c09156bb 4314 register PERL_CONTEXT *cx;
a0d0e21e 4315 OP *retop;
06b5626a 4316 const U8 save_flags = PL_op -> op_flags;
a0d0e21e 4317 I32 optype;
b6494f15 4318 SV *namesv;
676a678a 4319 CV *evalcv;
a0d0e21e 4320
011c3814 4321 PERL_ASYNC_CHECK();
a0d0e21e
LW		 4322 POPBLOCK(cx,newpm);
4323 POPEVAL(cx);
b6494f15 4324 namesv = cx->blk_eval.old_namesv;
f39bc417 4325 retop = cx->blk_eval.retop;
676a678a 4326 evalcv = cx->blk_eval.cv;
a0d0e21e 4327
a1f49e72 4328 TAINT_NOT;
b9d76716
VP		 4329 SP = adjust_stack_on_leave((gimme == G_VOID) ? SP : newsp, SP, newsp,
4330 gimme, SVs_TEMP);
3280af22 4331 PL_curpm = newpm; /* Don't pop $1 et al till now */
a0d0e21e 4332
4fdae800 4333#ifdef DEBUGGING
676a678a 4334 assert(CvDEPTH(evalcv) == 1);
4fdae800 4335#endif
676a678a 4336 CvDEPTH(evalcv) = 0;
4fdae800 4337
1ce6579f 4338 if (optype == OP_REQUIRE &&
924508f0 4339 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
54310121 4340 {
1ce6579f 4341 /* Unassume the success we assumed earlier. */
b6494f15 4342 (void)hv_delete(GvHVn(PL_incgv),
ecad31f0 4343 SvPVX_const(namesv),
c60dbbc3 4344 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
b6494f15
VP		 4345 G_DISCARD);
4346 retop = Perl_die(aTHX_ "%"SVf" did not return a true value",
4347 SVfARG(namesv));
c5df3096 4348 /* die_unwind() did LEAVE, or we won't be here */
f46d017c
GS		 4349 }
4350 else {
d343c3ef 4351 LEAVE_with_name("eval");
8433848b 4352 if (!(save_flags & OPf_SPECIAL)) {
ab69dbc2 4353 CLEAR_ERRSV();
8433848b 4354 }
a0d0e21e 4355 }
a0d0e21e
LW		 4356
4357 RETURNOP(retop);
4358}
4359
edb2152a
NC		 4360/* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
4361 close to the related Perl_create_eval_scope. */
4362void
4363Perl_delete_eval_scope(pTHX)
a0d0e21e 4364{
edb2152a
NC		 4365 SV **newsp;
4366 PMOP *newpm;
4367 I32 gimme;
c09156bb 4368 register PERL_CONTEXT *cx;
edb2152a
NC		 4369 I32 optype;
4370
4371 POPBLOCK(cx,newpm);
4372 POPEVAL(cx);
4373 PL_curpm = newpm;
d343c3ef 4374 LEAVE_with_name("eval_scope");
edb2152a
NC		 4375 PERL_UNUSED_VAR(newsp);
4376 PERL_UNUSED_VAR(gimme);
4377 PERL_UNUSED_VAR(optype);
4378}
a0d0e21e 4379
edb2152a
NC		 4380/* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
4381 also needed by Perl_fold_constants. */
4382PERL_CONTEXT *
4383Perl_create_eval_scope(pTHX_ U32 flags)
4384{
4385 PERL_CONTEXT *cx;
4386 const I32 gimme = GIMME_V;
4387
d343c3ef 4388 ENTER_with_name("eval_scope");
a0d0e21e
LW		 4389 SAVETMPS;
4390
edb2152a 4391 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), PL_stack_sp);
6b75f042 4392 PUSHEVAL(cx, 0);
a0d0e21e 4393
faef0170 4394 PL_in_eval = EVAL_INEVAL;
edb2152a
NC		 4395 if (flags & G_KEEPERR)
4396 PL_in_eval |= EVAL_KEEPERR;
ab69dbc2
RGS		 4397 else
4398 CLEAR_ERRSV();
edb2152a
NC		 4399 if (flags & G_FAKINGEVAL) {
4400 PL_eval_root = PL_op; /* Only needed so that goto works right. */
4401 }
4402 return cx;
4403}
4404
4405PP(pp_entertry)
4406{
4407 dVAR;
df528165 4408 PERL_CONTEXT * const cx = create_eval_scope(0);
edb2152a 4409 cx->blk_eval.retop = cLOGOP->op_other->op_next;
533c011a 4410 return DOCATCH(PL_op->op_next);
a0d0e21e
LW		 4411}
4412
4413PP(pp_leavetry)
4414{
27da23d5 4415 dVAR; dSP;
a0d0e21e
LW		 4416 SV **newsp;
4417 PMOP *newpm;
4418 I32 gimme;
c09156bb 4419 register PERL_CONTEXT *cx;
a0d0e21e
LW		 4420 I32 optype;
4421
011c3814 4422 PERL_ASYNC_CHECK();
a0d0e21e
LW		 4423 POPBLOCK(cx,newpm);
4424 POPEVAL(cx);
9d4ba2ae 4425 PERL_UNUSED_VAR(optype);
a0d0e21e 4426
a1f49e72 4427 TAINT_NOT;
b9d76716 4428 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
3280af22 4429 PL_curpm = newpm; /* Don't pop $1 et al till now */
a0d0e21e 4430
d343c3ef 4431 LEAVE_with_name("eval_scope");
ab69dbc2 4432 CLEAR_ERRSV();
745cf2ff 4433 RETURN;
a0d0e21e
LW		 4434}
4435
0d863452
RH		 4436PP(pp_entergiven)
4437{
4438 dVAR; dSP;
4439 register PERL_CONTEXT *cx;
4440 const I32 gimme = GIMME_V;
4441
d343c3ef 4442 ENTER_with_name("given");
0d863452
RH		 4443 SAVETMPS;
4444
87e4a53a 4445 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
f7010667 4446 sv_setsv_mg(PAD_SV(PL_op->op_targ), POPs);
0d863452
RH		 4447
4448 PUSHBLOCK(cx, CXt_GIVEN, SP);
4449 PUSHGIVEN(cx);
4450
4451 RETURN;
4452}
4453
4454PP(pp_leavegiven)
4455{
4456 dVAR; dSP;
4457 register PERL_CONTEXT *cx;
4458 I32 gimme;
4459 SV **newsp;
4460 PMOP *newpm;
96a5add6 4461 PERL_UNUSED_CONTEXT;
0d863452
RH		 4462
4463 POPBLOCK(cx,newpm);
4464 assert(CxTYPE(cx) == CXt_GIVEN);
0d863452 4465
25b991bf 4466 TAINT_NOT;
b9d76716 4467 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
25b991bf 4468 PL_curpm = newpm; /* Don't pop $1 et al till now */
0d863452 4469
d343c3ef 4470 LEAVE_with_name("given");
25b991bf 4471 RETURN;
0d863452
RH		 4472}
4473
4474/* Helper routines used by pp_smartmatch */
4136a0f7 4475STATIC PMOP *
84679df5 4476S_make_matcher(pTHX_ REGEXP *re)
0d863452 4477{
97aff369 4478 dVAR;
0d863452 4479 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
7918f24d
NC		 4480
4481 PERL_ARGS_ASSERT_MAKE_MATCHER;
4482
d6106309 4483 PM_SETRE(matcher, ReREFCNT_inc(re));
7918f24d 4484
0d863452 4485 SAVEFREEOP((OP *) matcher);
d343c3ef 4486 ENTER_with_name("matcher"); SAVETMPS;
0d863452
RH		 4487 SAVEOP();
4488 return matcher;
4489}
4490
4136a0f7 4491STATIC bool
0d863452
RH		 4492S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
4493{
97aff369 4494 dVAR;
0d863452 4495 dSP;
7918f24d
NC		 4496
4497 PERL_ARGS_ASSERT_MATCHER_MATCHES_SV;
0d863452
RH		 4498
4499 PL_op = (OP *) matcher;
4500 XPUSHs(sv);
4501 PUTBACK;
897d3989 4502 (void) Perl_pp_match(aTHX);
0d863452
RH		 4503 SPAGAIN;
4504 return (SvTRUEx(POPs));
4505}
4506
4136a0f7 4507STATIC void
0d863452
RH		 4508S_destroy_matcher(pTHX_ PMOP *matcher)
4509{
97aff369 4510 dVAR;
7918f24d
NC		 4511
4512 PERL_ARGS_ASSERT_DESTROY_MATCHER;
0d863452 4513 PERL_UNUSED_ARG(matcher);
7918f24d 4514
0d863452 4515 FREETMPS;
d343c3ef 4516 LEAVE_with_name("matcher");
0d863452
RH		 4517}
4518
4519/* Do a smart match */
4520PP(pp_smartmatch)
4521{
d7c0d282 4522 DEBUG_M(Perl_deb(aTHX_ "Starting smart match resolution\n"));
be88a5c3 4523 return do_smartmatch(NULL, NULL, 0);
0d863452
RH		 4524}
4525
4b021f5f
RGS		 4526/* This version of do_smartmatch() implements the
4527 * table of smart matches that is found in perlsyn.
0d863452 4528 */
4136a0f7 4529STATIC OP *
be88a5c3 4530S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other, const bool copied)
0d863452 4531{
97aff369 4532 dVAR;
0d863452
RH		 4533 dSP;
4534
41e726ac 4535 bool object_on_left = FALSE;
0d863452
RH		 4536 SV *e = TOPs; /* e is for 'expression' */
4537 SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */
a566f585 4538
6f1401dc
DM		 4539 /* Take care only to invoke mg_get() once for each argument.
4540 * Currently we do this by copying the SV if it's magical. */
4541 if (d) {
be88a5c3 4542 if (!copied && SvGMAGICAL(d))
6f1401dc
DM		 4543 d = sv_mortalcopy(d);
4544 }
4545 else
4546 d = &PL_sv_undef;
4547
4548 assert(e);
4549 if (SvGMAGICAL(e))
4550 e = sv_mortalcopy(e);
4551
2c9d2554 4552 /* First of all, handle overload magic of the rightmost argument */
6d743019 4553 if (SvAMAGIC(e)) {
d7c0d282
DM		 4554 SV * tmpsv;
4555 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n"));
4556 DEBUG_M(Perl_deb(aTHX_ " attempting overload\n"));
4557
4558 tmpsv = amagic_call(d, e, smart_amg, 0);
7c41e62e
RGS		 4559 if (tmpsv) {
4560 SPAGAIN;
4561 (void)POPs;
4562 SETs(tmpsv);
4563 RETURN;
4564 }
d7c0d282 4565 DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; continuing...\n"));
7c41e62e 4566 }
62ec5f58 4567
0d863452
RH		 4568 SP -= 2; /* Pop the values */
4569
0d863452 4570
b0138e99 4571 /* ~~ undef */
62ec5f58 4572 if (!SvOK(e)) {
d7c0d282 4573 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-undef\n"));
62ec5f58 4574 if (SvOK(d))
33570f8b
RGS		 4575 RETPUSHNO;
4576 else
62ec5f58 4577 RETPUSHYES;
33570f8b 4578 }
e67b97bd 4579
d7c0d282
DM		 4580 if (sv_isobject(e) && (SvTYPE(SvRV(e)) != SVt_REGEXP)) {
4581 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n"));
62ec5f58 4582 Perl_croak(aTHX_ "Smart matching a non-overloaded object breaks encapsulation");
d7c0d282 4583 }
41e726ac
RGS		 4584 if (sv_isobject(d) && (SvTYPE(SvRV(d)) != SVt_REGEXP))
4585 object_on_left = TRUE;
62ec5f58 4586
b0138e99 4587 /* ~~ sub */
a4a197da 4588 if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVCV) {
0d863452 4589 I32 c;
41e726ac
RGS		 4590 if (object_on_left) {
4591 goto sm_any_sub; /* Treat objects like scalars */
4592 }
4593 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
a4a197da
RGS		 4594 /* Test sub truth for each key */
4595 HE *he;
4596 bool andedresults = TRUE;
4597 HV *hv = (HV*) SvRV(d);
168ff818 4598 I32 numkeys = hv_iterinit(hv);
d7c0d282 4599 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-CodeRef\n"));
168ff818 4600 if (numkeys == 0)
07edf497 4601 RETPUSHYES;
a4a197da 4602 while ( (he = hv_iternext(hv)) ) {
d7c0d282 4603 DEBUG_M(Perl_deb(aTHX_ " testing hash key...\n"));
d343c3ef 4604 ENTER_with_name("smartmatch_hash_key_test");
a4a197da
RGS		 4605 SAVETMPS;
4606 PUSHMARK(SP);
4607 PUSHs(hv_iterkeysv(he));
4608 PUTBACK;
4609 c = call_sv(e, G_SCALAR);
4610 SPAGAIN;
4611 if (c == 0)
4612 andedresults = FALSE;
4613 else
4614 andedresults = SvTRUEx(POPs) && andedresults;
4615 FREETMPS;
d343c3ef 4616 LEAVE_with_name("smartmatch_hash_key_test");
a4a197da
RGS		 4617 }
4618 if (andedresults)
4619 RETPUSHYES;
4620 else
4621 RETPUSHNO;
4622 }
4623 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4624 /* Test sub truth for each element */
4625 I32 i;
4626 bool andedresults = TRUE;
4627 AV *av = (AV*) SvRV(d);
4628 const I32 len = av_len(av);
d7c0d282 4629 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-CodeRef\n"));
168ff818 4630 if (len == -1)
07edf497 4631 RETPUSHYES;
a4a197da
RGS		 4632 for (i = 0; i <= len; ++i) {
4633 SV * const * const svp = av_fetch(av, i, FALSE);
d7c0d282 4634 DEBUG_M(Perl_deb(aTHX_ " testing array element...\n"));
d343c3ef 4635 ENTER_with_name("smartmatch_array_elem_test");
a4a197da
RGS		 4636 SAVETMPS;
4637 PUSHMARK(SP);
4638 if (svp)
4639 PUSHs(*svp);
4640 PUTBACK;
4641 c = call_sv(e, G_SCALAR);
4642 SPAGAIN;
4643 if (c == 0)
4644 andedresults = FALSE;
4645 else
4646 andedresults = SvTRUEx(POPs) && andedresults;
4647 FREETMPS;
d343c3ef 4648 LEAVE_with_name("smartmatch_array_elem_test");
a4a197da
RGS		 4649 }
4650 if (andedresults)
4651 RETPUSHYES;
4652 else
4653 RETPUSHNO;
4654 }
4655 else {
41e726ac 4656 sm_any_sub:
d7c0d282 4657 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-CodeRef\n"));
d343c3ef 4658 ENTER_with_name("smartmatch_coderef");
a4a197da
RGS		 4659 SAVETMPS;
4660 PUSHMARK(SP);
4661 PUSHs(d);
4662 PUTBACK;
4663 c = call_sv(e, G_SCALAR);
4664 SPAGAIN;
4665 if (c == 0)
4666 PUSHs(&PL_sv_no);
4667 else if (SvTEMP(TOPs))
4668 SvREFCNT_inc_void(TOPs);
4669 FREETMPS;
d343c3ef 4670 LEAVE_with_name("smartmatch_coderef");
a4a197da
RGS		 4671 RETURN;
4672 }
0d863452 4673 }
b0138e99 4674 /* ~~ %hash */
61a621c6 4675 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVHV) {
41e726ac
RGS		 4676 if (object_on_left) {
4677 goto sm_any_hash; /* Treat objects like scalars */
4678 }
4679 else if (!SvOK(d)) {
d7c0d282 4680 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash ($a undef)\n"));
61a621c6
RGS		 4681 RETPUSHNO;
4682 }
4683 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
0d863452
RH		 4684 /* Check that the key-sets are identical */
4685 HE *he;
61a621c6 4686 HV *other_hv = MUTABLE_HV(SvRV(d));
0d863452
RH		 4687 bool tied = FALSE;
4688 bool other_tied = FALSE;
4689 U32 this_key_count = 0,
4690 other_key_count = 0;
33ed63a2 4691 HV *hv = MUTABLE_HV(SvRV(e));
d7c0d282
DM		 4692
4693 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Hash\n"));
0d863452 4694 /* Tied hashes don't know how many keys they have. */
33ed63a2 4695 if (SvTIED_mg((SV*)hv, PERL_MAGIC_tied)) {
0d863452
RH		 4696 tied = TRUE;
4697 }
ad64d0ec 4698 else if (SvTIED_mg((const SV *)other_hv, PERL_MAGIC_tied)) {
c445ea15 4699 HV * const temp = other_hv;
33ed63a2
RGS		 4700 other_hv = hv;
4701 hv = temp;
0d863452
RH		 4702 tied = TRUE;
4703 }
ad64d0ec 4704 if (SvTIED_mg((const SV *)other_hv, PERL_MAGIC_tied))
0d863452
RH		 4705 other_tied = TRUE;
4706
33ed63a2 4707 if (!tied && HvUSEDKEYS((const HV *) hv) != HvUSEDKEYS(other_hv))
0d863452
RH		 4708 RETPUSHNO;
4709
4710 /* The hashes have the same number of keys, so it suffices
4711 to check that one is a subset of the other. */
33ed63a2
RGS		 4712 (void) hv_iterinit(hv);
4713 while ( (he = hv_iternext(hv)) ) {
b15feb55 4714 SV *key = hv_iterkeysv(he);
d7c0d282
DM		 4715
4716 DEBUG_M(Perl_deb(aTHX_ " comparing hash key...\n"));
0d863452
RH		 4717 ++ this_key_count;
4718
b15feb55 4719 if(!hv_exists_ent(other_hv, key, 0)) {
33ed63a2 4720 (void) hv_iterinit(hv); /* reset iterator */
0d863452
RH		 4721 RETPUSHNO;
4722 }
4723 }
4724
4725 if (other_tied) {
4726 (void) hv_iterinit(other_hv);
4727 while ( hv_iternext(other_hv) )
4728 ++other_key_count;
4729 }
4730 else
4731 other_key_count = HvUSEDKEYS(other_hv);
4732
4733 if (this_key_count != other_key_count)
4734 RETPUSHNO;
4735 else
4736 RETPUSHYES;
4737 }
61a621c6
RGS		 4738 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4739 AV * const other_av = MUTABLE_AV(SvRV(d));
c445ea15 4740 const I32 other_len = av_len(other_av) + 1;
0d863452 4741 I32 i;
33ed63a2 4742 HV *hv = MUTABLE_HV(SvRV(e));
71b0fb34 4743
d7c0d282 4744 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Hash\n"));
71b0fb34 4745 for (i = 0; i < other_len; ++i) {
c445ea15 4746 SV ** const svp = av_fetch(other_av, i, FALSE);
d7c0d282 4747 DEBUG_M(Perl_deb(aTHX_ " checking for key existence...\n"));
71b0fb34 4748 if (svp) { /* ??? When can this not happen? */
b15feb55 4749 if (hv_exists_ent(hv, *svp, 0))
71b0fb34
DK		 4750 RETPUSHYES;
4751 }
0d863452 4752 }
71b0fb34 4753 RETPUSHNO;
0d863452 4754 }
a566f585 4755 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) {
d7c0d282 4756 DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Hash\n"));
ea0c2dbd
RGS		 4757 sm_regex_hash:
4758 {
4759 PMOP * const matcher = make_matcher((REGEXP*) SvRV(d));
4760 HE *he;
4761 HV *hv = MUTABLE_HV(SvRV(e));
4762
4763 (void) hv_iterinit(hv);
4764 while ( (he = hv_iternext(hv)) ) {
d7c0d282 4765 DEBUG_M(Perl_deb(aTHX_ " testing key against pattern...\n"));
ea0c2dbd
RGS		 4766 if (matcher_matches_sv(matcher, hv_iterkeysv(he))) {
4767 (void) hv_iterinit(hv);
4768 destroy_matcher(matcher);
4769 RETPUSHYES;
4770 }
0d863452 4771 }
ea0c2dbd
RGS		 4772 destroy_matcher(matcher);
4773 RETPUSHNO;
0d863452 4774 }
0d863452
RH		 4775 }
4776 else {
41e726ac 4777 sm_any_hash:
d7c0d282 4778 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash\n"));
61a621c6 4779 if (hv_exists_ent(MUTABLE_HV(SvRV(e)), d, 0))
0d863452
RH		 4780 RETPUSHYES;
4781 else
4782 RETPUSHNO;
4783 }
4784 }
b0138e99
RGS		 4785 /* ~~ @array */
4786 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVAV) {
41e726ac
RGS		 4787 if (object_on_left) {
4788 goto sm_any_array; /* Treat objects like scalars */
4789 }
4790 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
b0138e99
RGS		 4791 AV * const other_av = MUTABLE_AV(SvRV(e));
4792 const I32 other_len = av_len(other_av) + 1;
4793 I32 i;
4794
d7c0d282 4795 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Array\n"));
b0138e99
RGS		 4796 for (i = 0; i < other_len; ++i) {
4797 SV ** const svp = av_fetch(other_av, i, FALSE);
d7c0d282
DM		 4798
4799 DEBUG_M(Perl_deb(aTHX_ " testing for key existence...\n"));
b0138e99 4800 if (svp) { /* ??? When can this not happen? */
b15feb55 4801 if (hv_exists_ent(MUTABLE_HV(SvRV(d)), *svp, 0))
b0138e99
RGS		 4802 RETPUSHYES;
4803 }
4804 }
4805 RETPUSHNO;
4806 }
4807 if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4808 AV *other_av = MUTABLE_AV(SvRV(d));
d7c0d282 4809 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Array\n"));
b0138e99 4810 if (av_len(MUTABLE_AV(SvRV(e))) != av_len(other_av))
0d863452
RH		 4811 RETPUSHNO;
4812 else {
4813 I32 i;
c445ea15 4814 const I32 other_len = av_len(other_av);
0d863452 4815
a0714e2c 4816 if (NULL == seen_this) {
0d863452 4817 seen_this = newHV();
ad64d0ec 4818 (void) sv_2mortal(MUTABLE_SV(seen_this));
0d863452 4819 }
a0714e2c 4820 if (NULL == seen_other) {
6bc991bf 4821 seen_other = newHV();
ad64d0ec 4822 (void) sv_2mortal(MUTABLE_SV(seen_other));
0d863452
RH		 4823 }
4824 for(i = 0; i <= other_len; ++i) {
b0138e99 4825 SV * const * const this_elem = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
c445ea15
AL		 4826 SV * const * const other_elem = av_fetch(other_av, i, FALSE);
4827
0d863452 4828 if (!this_elem || !other_elem) {
69c3dccf
RGS		 4829 if ((this_elem && SvOK(*this_elem))
4830 || (other_elem && SvOK(*other_elem)))
0d863452
RH		 4831 RETPUSHNO;
4832 }
365c4e3d
RGS		 4833 else if (hv_exists_ent(seen_this,
4834 sv_2mortal(newSViv(PTR2IV(*this_elem))), 0) ||
4835 hv_exists_ent(seen_other,
4836 sv_2mortal(newSViv(PTR2IV(*other_elem))), 0))
0d863452
RH		 4837 {
4838 if (*this_elem != *other_elem)
4839 RETPUSHNO;
4840 }
4841 else {
04fe65b0
RGS		 4842 (void)hv_store_ent(seen_this,
4843 sv_2mortal(newSViv(PTR2IV(*this_elem))),
4844 &PL_sv_undef, 0);
4845 (void)hv_store_ent(seen_other,
4846 sv_2mortal(newSViv(PTR2IV(*other_elem))),
4847 &PL_sv_undef, 0);
0d863452 4848 PUSHs(*other_elem);
a566f585 4849 PUSHs(*this_elem);
0d863452
RH		 4850
4851 PUTBACK;
d7c0d282 4852 DEBUG_M(Perl_deb(aTHX_ " recursively comparing array element...\n"));
be88a5c3 4853 (void) do_smartmatch(seen_this, seen_other, 0);
0d863452 4854 SPAGAIN;
d7c0d282 4855 DEBUG_M(Perl_deb(aTHX_ " recursion finished\n"));
0d863452
RH		 4856
4857 if (!SvTRUEx(POPs))
4858 RETPUSHNO;
4859 }
4860 }
4861 RETPUSHYES;
4862 }
4863 }
a566f585 4864 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) {
d7c0d282 4865 DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Array\n"));
ea0c2dbd
RGS		 4866 sm_regex_array:
4867 {
4868 PMOP * const matcher = make_matcher((REGEXP*) SvRV(d));
4869 const I32 this_len = av_len(MUTABLE_AV(SvRV(e)));
4870 I32 i;
0d863452 4871
ea0c2dbd
RGS		 4872 for(i = 0; i <= this_len; ++i) {
4873 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
d7c0d282 4874 DEBUG_M(Perl_deb(aTHX_ " testing element against pattern...\n"));
ea0c2dbd
RGS		 4875 if (svp && matcher_matches_sv(matcher, *svp)) {
4876 destroy_matcher(matcher);
4877 RETPUSHYES;
4878 }
0d863452 4879 }
ea0c2dbd
RGS		 4880 destroy_matcher(matcher);
4881 RETPUSHNO;
0d863452 4882 }
0d863452 4883 }
015eb7b9
RGS		 4884 else if (!SvOK(d)) {
4885 /* undef ~~ array */
4886 const I32 this_len = av_len(MUTABLE_AV(SvRV(e)));
0d863452
RH		 4887 I32 i;
4888
d7c0d282 4889 DEBUG_M(Perl_deb(aTHX_ " applying rule Undef-Array\n"));
015eb7b9 4890 for (i = 0; i <= this_len; ++i) {
b0138e99 4891 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
d7c0d282 4892 DEBUG_M(Perl_deb(aTHX_ " testing for undef element...\n"));
015eb7b9 4893 if (!svp || !SvOK(*svp))
0d863452
RH		 4894 RETPUSHYES;
4895 }
4896 RETPUSHNO;
4897 }
015eb7b9 4898 else {
41e726ac
RGS		 4899 sm_any_array:
4900 {
4901 I32 i;
4902 const I32 this_len = av_len(MUTABLE_AV(SvRV(e)));
0d863452 4903
d7c0d282 4904 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Array\n"));
41e726ac
RGS		 4905 for (i = 0; i <= this_len; ++i) {
4906 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4907 if (!svp)
4908 continue;
015eb7b9 4909
41e726ac
RGS		 4910 PUSHs(d);
4911 PUSHs(*svp);
4912 PUTBACK;
4913 /* infinite recursion isn't supposed to happen here */
d7c0d282 4914 DEBUG_M(Perl_deb(aTHX_ " recursively testing array element...\n"));
be88a5c3 4915 (void) do_smartmatch(NULL, NULL, 1);
41e726ac 4916 SPAGAIN;
d7c0d282 4917 DEBUG_M(Perl_deb(aTHX_ " recursion finished\n"));
41e726ac
RGS		 4918 if (SvTRUEx(POPs))
4919 RETPUSHYES;
4920 }
4921 RETPUSHNO;
0d863452 4922 }
0d863452
RH		 4923 }
4924 }
b0138e99 4925 /* ~~ qr// */
a566f585 4926 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_REGEXP) {
ea0c2dbd
RGS		 4927 if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4928 SV *t = d; d = e; e = t;
d7c0d282 4929 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Regex\n"));
ea0c2dbd
RGS		 4930 goto sm_regex_hash;
4931 }
4932 else if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4933 SV *t = d; d = e; e = t;
d7c0d282 4934 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Regex\n"));
ea0c2dbd
RGS		 4935 goto sm_regex_array;
4936 }
4937 else {
4938 PMOP * const matcher = make_matcher((REGEXP*) SvRV(e));
0d863452 4939
d7c0d282 4940 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Regex\n"));
ea0c2dbd
RGS		 4941 PUTBACK;
4942 PUSHs(matcher_matches_sv(matcher, d)
4943 ? &PL_sv_yes
4944 : &PL_sv_no);
4945 destroy_matcher(matcher);
4946 RETURN;
4947 }
0d863452 4948 }
b0138e99 4949 /* ~~ scalar */
2c9d2554
RGS		 4950 /* See if there is overload magic on left */
4951 else if (object_on_left && SvAMAGIC(d)) {
4952 SV *tmpsv;
d7c0d282
DM		 4953 DEBUG_M(Perl_deb(aTHX_ " applying rule Object-Any\n"));
4954 DEBUG_M(Perl_deb(aTHX_ " attempting overload\n"));
2c9d2554
RGS		 4955 PUSHs(d); PUSHs(e);
4956 PUTBACK;
4957 tmpsv = amagic_call(d, e, smart_amg, AMGf_noright);
4958 if (tmpsv) {
4959 SPAGAIN;
4960 (void)POPs;
4961 SETs(tmpsv);
4962 RETURN;
4963 }
4964 SP -= 2;
d7c0d282 4965 DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; falling back...\n"));
2c9d2554
RGS		 4966 goto sm_any_scalar;
4967 }
fb51372e
RGS		 4968 else if (!SvOK(d)) {
4969 /* undef ~~ scalar ; we already know that the scalar is SvOK */
d7c0d282 4970 DEBUG_M(Perl_deb(aTHX_ " applying rule undef-Any\n"));
fb51372e
RGS		 4971 RETPUSHNO;
4972 }
2c9d2554
RGS		 4973 else
4974 sm_any_scalar:
4975 if (SvNIOK(e) || (SvPOK(e) && looks_like_number(e) && SvNIOK(d))) {
d7c0d282
DM		 4976 DEBUG_M(if (SvNIOK(e))
4977 Perl_deb(aTHX_ " applying rule Any-Num\n");
4978 else
4979 Perl_deb(aTHX_ " applying rule Num-numish\n");
4980 );
33ed63a2 4981 /* numeric comparison */
0d863452
RH		 4982 PUSHs(d); PUSHs(e);
4983 PUTBACK;
a98fe34d 4984 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
897d3989 4985 (void) Perl_pp_i_eq(aTHX);
0d863452 4986 else
897d3989 4987 (void) Perl_pp_eq(aTHX);
0d863452
RH		 4988 SPAGAIN;
4989 if (SvTRUEx(POPs))
4990 RETPUSHYES;
4991 else
4992 RETPUSHNO;
4993 }
4994
4995 /* As a last resort, use string comparison */
d7c0d282 4996 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Any\n"));
0d863452
RH		 4997 PUSHs(d); PUSHs(e);
4998 PUTBACK;
897d3989 4999 return Perl_pp_seq(aTHX);
0d863452
RH		 5000}
5001
5002PP(pp_enterwhen)
5003{
5004 dVAR; dSP;
5005 register PERL_CONTEXT *cx;
5006 const I32 gimme = GIMME_V;
5007
5008 /* This is essentially an optimization: if the match
5009 fails, we don't want to push a context and then
5010 pop it again right away, so we skip straight
5011 to the op that follows the leavewhen.
25b991bf 5012 RETURNOP calls PUTBACK which restores the stack pointer after the POPs.
0d863452
RH		 5013 */
5014 if ((0 == (PL_op->op_flags & OPf_SPECIAL)) && !SvTRUEx(POPs))
25b991bf 5015 RETURNOP(cLOGOP->op_other->op_next);
0d863452 5016
c08f093b 5017 ENTER_with_name("when");
0d863452
RH		 5018 SAVETMPS;
5019
5020 PUSHBLOCK(cx, CXt_WHEN, SP);
5021 PUSHWHEN(cx);
5022
5023 RETURN;
5024}
5025
5026PP(pp_leavewhen)
5027{
5028 dVAR; dSP;
c08f093b 5029 I32 cxix;
0d863452 5030 register PERL_CONTEXT *cx;
c08f093b 5031 I32 gimme;
0d863452
RH		 5032 SV **newsp;
5033 PMOP *newpm;
5034
c08f093b
VP		 5035 cxix = dopoptogiven(cxstack_ix);
5036 if (cxix < 0)
fc7debfb
FC		 5037 /* diag_listed_as: Can't "when" outside a topicalizer */
5038 DIE(aTHX_ "Can't \"%s\" outside a topicalizer",
5039 PL_op->op_flags & OPf_SPECIAL ? "default" : "when");
c08f093b 5040
0d863452
RH		 5041 POPBLOCK(cx,newpm);
5042 assert(CxTYPE(cx) == CXt_WHEN);
5043
c08f093b
VP		 5044 TAINT_NOT;
5045 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
0d863452
RH		 5046 PL_curpm = newpm; /* pop $1 et al */
5047
c08f093b
VP		 5048 LEAVE_with_name("when");
5049
5050 if (cxix < cxstack_ix)
5051 dounwind(cxix);
5052
5053 cx = &cxstack[cxix];
5054
5055 if (CxFOREACH(cx)) {
5056 /* clear off anything above the scope we're re-entering */
5057 I32 inner = PL_scopestack_ix;
5058
5059 TOPBLOCK(cx);
5060 if (PL_scopestack_ix < inner)
5061 leave_scope(PL_scopestack[PL_scopestack_ix]);
5062 PL_curcop = cx->blk_oldcop;
5063
5064 return cx->blk_loop.my_op->op_nextop;
5065 }
5066 else
b1b5a4ae 5067 RETURNOP(cx->blk_givwhen.leave_op);
0d863452
RH		 5068}
5069
5070PP(pp_continue)
5071{
c08f093b 5072 dVAR; dSP;
0d863452
RH		 5073 I32 cxix;
5074 register PERL_CONTEXT *cx;
c08f093b
VP		 5075 I32 gimme;
5076 SV **newsp;
5077 PMOP *newpm;
7be5bd17
FR		 5078
5079 PERL_UNUSED_VAR(gimme);
0d863452
RH		 5080
5081 cxix = dopoptowhen(cxstack_ix);
5082 if (cxix < 0)
5083 DIE(aTHX_ "Can't \"continue\" outside a when block");
c08f093b 5084
0d863452
RH		 5085 if (cxix < cxstack_ix)
5086 dounwind(cxix);
5087
c08f093b
VP		 5088 POPBLOCK(cx,newpm);
5089 assert(CxTYPE(cx) == CXt_WHEN);
5090
5091 SP = newsp;
5092 PL_curpm = newpm; /* pop $1 et al */
5093
5094 LEAVE_with_name("when");
5095 RETURNOP(cx->blk_givwhen.leave_op->op_next);
0d863452
RH		 5096}
5097
5098PP(pp_break)
5099{
5100 dVAR;
5101 I32 cxix;
5102 register PERL_CONTEXT *cx;
25b991bf 5103
0d863452 5104 cxix = dopoptogiven(cxstack_ix);
c08f093b
VP		 5105 if (cxix < 0)
5106 DIE(aTHX_ "Can't \"break\" outside a given block");
5107
5108 cx = &cxstack[cxix];
5109 if (CxFOREACH(cx))
0d863452
RH		 5110 DIE(aTHX_ "Can't \"break\" in a loop topicalizer");
5111
5112 if (cxix < cxstack_ix)
5113 dounwind(cxix);
0d863452 5114
0787ea8a
VP		 5115 /* Restore the sp at the time we entered the given block */
5116 TOPBLOCK(cx);
5117
c08f093b 5118 return cx->blk_givwhen.leave_op;
0d863452
RH		 5119}
5120
74e0ddf7 5121static MAGIC *
cea2e8a9 5122S_doparseform(pTHX_ SV *sv)
a0d0e21e
LW		 5123{
5124 STRLEN len;
37ffbfcc 5125 register char *s = SvPV(sv, len);
3808a683 5126 register char *send;
086b26f3
DM		 5127 register char *base = NULL; /* start of current field */
5128 register I32 skipspaces = 0; /* number of contiguous spaces seen */
5129 bool noblank = FALSE; /* ~ or ~~ seen on this line */
5130 bool repeat = FALSE; /* ~~ seen on this line */
5131 bool postspace = FALSE; /* a text field may need right padding */
dea28490
JJ		 5132 U32 *fops;
5133 register U32 *fpc;
086b26f3 5134 U32 *linepc = NULL; /* position of last FF_LINEMARK */
a0d0e21e 5135 register I32 arg;
086b26f3
DM		 5136 bool ischop; /* it's a ^ rather than a @ */
5137 bool unchopnum = FALSE; /* at least one @ (i.e. non-chop) num field seen */
a1b95068 5138 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
3808a683
DM		 5139 MAGIC *mg = NULL;
5140 SV *sv_copy;
a0d0e21e 5141
7918f24d
NC		 5142 PERL_ARGS_ASSERT_DOPARSEFORM;
5143
55497cff 5144 if (len == 0)
cea2e8a9 5145 Perl_croak(aTHX_ "Null picture in formline");
ac27b0f5 5146
3808a683
DM		 5147 if (SvTYPE(sv) >= SVt_PVMG) {
5148 /* This might, of course, still return NULL. */
5149 mg = mg_find(sv, PERL_MAGIC_fm);
5150 } else {
5151 sv_upgrade(sv, SVt_PVMG);
5152 }
5153
5154 if (mg) {
5155 /* still the same as previously-compiled string? */
5156 SV *old = mg->mg_obj;
5157 if ( !(!!SvUTF8(old) ^ !!SvUTF8(sv))
5158 && len == SvCUR(old)
5159 && strnEQ(SvPVX(old), SvPVX(sv), len)
b57b1734
DM		 5160 ) {
5161 DEBUG_f(PerlIO_printf(Perl_debug_log,"Re-using compiled format\n"));
3808a683 5162 return mg;
b57b1734 5163 }
3808a683 5164
b57b1734 5165 DEBUG_f(PerlIO_printf(Perl_debug_log, "Re-compiling format\n"));
3808a683
DM		 5166 Safefree(mg->mg_ptr);
5167 mg->mg_ptr = NULL;
5168 SvREFCNT_dec(old);
5169 mg->mg_obj = NULL;
5170 }
b57b1734
DM		 5171 else {
5172 DEBUG_f(PerlIO_printf(Perl_debug_log, "Compiling format\n"));
3808a683 5173 mg = sv_magicext(sv, NULL, PERL_MAGIC_fm, &PL_vtbl_fm, NULL, 0);
b57b1734 5174 }
3808a683
DM		 5175
5176 sv_copy = newSVpvn_utf8(s, len, SvUTF8(sv));
5177 s = SvPV(sv_copy, len); /* work on the copy, not the original */
5178 send = s + len;
5179
5180
815f25c6
DM		 5181 /* estimate the buffer size needed */
5182 for (base = s; s <= send; s++) {
a1b95068 5183 if (*s == '\n' || *s == '@' || *s == '^')
815f25c6
DM		 5184 maxops += 10;
5185 }
5186 s = base;
c445ea15 5187 base = NULL;
815f25c6 5188
a02a5408 5189 Newx(fops, maxops, U32);
a0d0e21e
LW		 5190 fpc = fops;
5191
5192 if (s < send) {
5193 linepc = fpc;
5194 *fpc++ = FF_LINEMARK;
5195 noblank = repeat = FALSE;
5196 base = s;
5197 }
5198
5199 while (s <= send) {
5200 switch (*s++) {
5201 default:
5202 skipspaces = 0;
5203 continue;
5204
5205 case '~':
5206 if (*s == '~') {
5207 repeat = TRUE;
b57b1734
DM		 5208 skipspaces++;
5209 s++;
a0d0e21e
LW		 5210 }
5211 noblank = TRUE;
a0d0e21e
LW		 5212 /* FALL THROUGH */
5213 case ' ': case '\t':
5214 skipspaces++;
5215 continue;
a1b95068
WL		 5216 case 0:
5217 if (s < send) {
5218 skipspaces = 0;
5219 continue;
5220 } /* else FALL THROUGH */
5221 case '\n':
a0d0e21e
LW		 5222 arg = s - base;
5223 skipspaces++;
5224 arg -= skipspaces;
5225 if (arg) {
5f05dabc 5226 if (postspace)
a0d0e21e 5227 *fpc++ = FF_SPACE;
a0d0e21e 5228 *fpc++ = FF_LITERAL;
76912796 5229 *fpc++ = (U32)arg;
a0d0e21e 5230 }
5f05dabc 5231 postspace = FALSE;
a0d0e21e
LW		 5232 if (s <= send)
5233 skipspaces--;
5234 if (skipspaces) {
5235 *fpc++ = FF_SKIP;
76912796 5236 *fpc++ = (U32)skipspaces;
a0d0e21e
LW		 5237 }
5238 skipspaces = 0;
5239 if (s <= send)
5240 *fpc++ = FF_NEWLINE;
5241 if (noblank) {
5242 *fpc++ = FF_BLANK;
5243 if (repeat)
5244 arg = fpc - linepc + 1;
5245 else
5246 arg = 0;
76912796 5247 *fpc++ = (U32)arg;
a0d0e21e
LW		 5248 }
5249 if (s < send) {
5250 linepc = fpc;
5251 *fpc++ = FF_LINEMARK;
5252 noblank = repeat = FALSE;
5253 base = s;
5254 }
5255 else
5256 s++;
5257 continue;
5258
5259 case '@':
5260 case '^':
5261 ischop = s[-1] == '^';
5262
5263 if (postspace) {
5264 *fpc++ = FF_SPACE;
5265 postspace = FALSE;
5266 }
5267 arg = (s - base) - 1;
5268 if (arg) {
5269 *fpc++ = FF_LITERAL;
76912796 5270 *fpc++ = (U32)arg;
a0d0e21e
LW		 5271 }
5272
5273 base = s - 1;
5274 *fpc++ = FF_FETCH;
086b26f3 5275 if (*s == '*') { /* @* or ^* */
a0d0e21e 5276 s++;
a1b95068
WL		 5277 *fpc++ = 2; /* skip the @* or ^* */
5278 if (ischop) {
5279 *fpc++ = FF_LINESNGL;
5280 *fpc++ = FF_CHOP;
5281 } else
5282 *fpc++ = FF_LINEGLOB;
a0d0e21e 5283 }
086b26f3 5284 else if (*s == '#' || (*s == '.' && s[1] == '#')) { /* @###, ^### */
a701009a 5285 arg = ischop ? FORM_NUM_BLANK : 0;
a0d0e21e
LW		 5286 base = s - 1;
5287 while (*s == '#')
5288 s++;
5289 if (*s == '.') {
06b5626a 5290 const char * const f = ++s;
a0d0e21e
LW		 5291 while (*s == '#')
5292 s++;
a701009a 5293 arg |= FORM_NUM_POINT + (s - f);
a0d0e21e
LW		 5294 }
5295 *fpc++ = s - base; /* fieldsize for FETCH */
5296 *fpc++ = FF_DECIMAL;
76912796 5297 *fpc++ = (U32)arg;
a1b95068 5298 unchopnum |= ! ischop;
784707d5
JP		 5299 }
5300 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
a701009a 5301 arg = ischop ? FORM_NUM_BLANK : 0;
784707d5
JP		 5302 base = s - 1;
5303 s++; /* skip the '0' first */
5304 while (*s == '#')
5305 s++;
5306 if (*s == '.') {
06b5626a 5307 const char * const f = ++s;
784707d5
JP		 5308 while (*s == '#')
5309 s++;
a701009a 5310 arg |= FORM_NUM_POINT + (s - f);
784707d5
JP		 5311 }
5312 *fpc++ = s - base; /* fieldsize for FETCH */
5313 *fpc++ = FF_0DECIMAL;
76912796 5314 *fpc++ = (U32)arg;
a1b95068 5315 unchopnum |= ! ischop;
a0d0e21e 5316 }
086b26f3 5317 else { /* text field */
a0d0e21e
LW		 5318 I32 prespace = 0;
5319 bool ismore = FALSE;
5320
5321 if (*s == '>') {
5322 while (*++s == '>') ;
5323 prespace = FF_SPACE;
5324 }
5325 else if (*s == '|') {
5326 while (*++s == '|') ;
5327 prespace = FF_HALFSPACE;
5328 postspace = TRUE;
5329 }
5330 else {
5331 if (*s == '<')
5332 while (*++s == '<') ;
5333 postspace = TRUE;
5334 }
5335 if (*s == '.' && s[1] == '.' && s[2] == '.') {
5336 s += 3;
5337 ismore = TRUE;
5338 }
5339 *fpc++ = s - base; /* fieldsize for FETCH */
5340
5341 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
5342
5343 if (prespace)
76912796 5344 *fpc++ = (U32)prespace; /* add SPACE or HALFSPACE */
a0d0e21e
LW		 5345 *fpc++ = FF_ITEM;
5346 if (ismore)
5347 *fpc++ = FF_MORE;
5348 if (ischop)
5349 *fpc++ = FF_CHOP;
5350 }
5351 base = s;
5352 skipspaces = 0;
5353 continue;
5354 }
5355 }
5356 *fpc++ = FF_END;
5357
815f25c6 5358 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
a0d0e21e 5359 arg = fpc - fops;
74e0ddf7 5360
3808a683 5361 mg->mg_ptr = (char *) fops;
74e0ddf7 5362 mg->mg_len = arg * sizeof(U32);
3808a683
DM		 5363 mg->mg_obj = sv_copy;
5364 mg->mg_flags |= MGf_REFCOUNTED;
a1b95068 5365
bfed75c6 5366 if (unchopnum && repeat)
75f63940 5367 Perl_die(aTHX_ "Repeated format line will never terminate (~~ and @#)");
74e0ddf7
NC		 5368
5369 return mg;
a1b95068
WL		 5370}
5371
5372
5373STATIC bool
5374S_num_overflow(NV value, I32 fldsize, I32 frcsize)
5375{
5376 /* Can value be printed in fldsize chars, using %*.*f ? */
5377 NV pwr = 1;
5378 NV eps = 0.5;
5379 bool res = FALSE;
5380 int intsize = fldsize - (value < 0 ? 1 : 0);
5381
a701009a 5382 if (frcsize & FORM_NUM_POINT)
a1b95068 5383 intsize--;
a701009a 5384 frcsize &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
a1b95068
WL		 5385 intsize -= frcsize;
5386
5387 while (intsize--) pwr *= 10.0;
5388 while (frcsize--) eps /= 10.0;
5389
5390 if( value >= 0 ){
5391 if (value + eps >= pwr)
5392 res = TRUE;
5393 } else {
5394 if (value - eps <= -pwr)
5395 res = TRUE;
5396 }
5397 return res;
a0d0e21e 5398}
4e35701f 5399
bbed91b5 5400static I32
0bd48802 5401S_run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
bbed91b5 5402{
27da23d5 5403 dVAR;
0bd48802 5404 SV * const datasv = FILTER_DATA(idx);
504618e9 5405 const int filter_has_file = IoLINES(datasv);
ad64d0ec
NC		 5406 SV * const filter_state = MUTABLE_SV(IoTOP_GV(datasv));
5407 SV * const filter_sub = MUTABLE_SV(IoBOTTOM_GV(datasv));
941a98a0 5408 int status = 0;
ec0b63d7 5409 SV *upstream;
941a98a0 5410 STRLEN got_len;
162177c1
Z		 5411 char *got_p = NULL;
5412 char *prune_from = NULL;
34113e50 5413 bool read_from_cache = FALSE;
bb7a0f54
MHM		 5414 STRLEN umaxlen;
5415
7918f24d
NC		 5416 PERL_ARGS_ASSERT_RUN_USER_FILTER;
5417
bb7a0f54
MHM		 5418 assert(maxlen >= 0);
5419 umaxlen = maxlen;
5675696b 5420
bbed91b5
KF		 5421 /* I was having segfault trouble under Linux 2.2.5 after a
5422 parse error occured. (Had to hack around it with a test
13765c85 5423 for PL_parser->error_count == 0.) Solaris doesn't segfault --
bbed91b5
KF		 5424 not sure where the trouble is yet. XXX */
5425
4464f08e
NC		 5426 {
5427 SV *const cache = datasv;
937b367d
NC		 5428 if (SvOK(cache)) {
5429 STRLEN cache_len;
5430 const char *cache_p = SvPV(cache, cache_len);
941a98a0
NC		 5431 STRLEN take = 0;
5432
bb7a0f54 5433 if (umaxlen) {
941a98a0
NC		 5434 /* Running in block mode and we have some cached data already.
5435 */
bb7a0f54 5436 if (cache_len >= umaxlen) {
941a98a0
NC		 5437 /* In fact, so much data we don't even need to call
5438 filter_read. */
bb7a0f54 5439 take = umaxlen;
941a98a0
NC		 5440 }
5441 } else {
10edeb5d
JH		 5442 const char *const first_nl =
5443 (const char *)memchr(cache_p, '\n', cache_len);
941a98a0
NC		 5444 if (first_nl) {
5445 take = first_nl + 1 - cache_p;
5446 }
5447 }
5448 if (take) {
5449 sv_catpvn(buf_sv, cache_p, take);
5450 sv_chop(cache, cache_p + take);
486ec47a 5451 /* Definitely not EOF */
937b367d
NC		 5452 return 1;
5453 }
941a98a0 5454
937b367d 5455 sv_catsv(buf_sv, cache);
bb7a0f54
MHM		 5456 if (umaxlen) {
5457 umaxlen -= cache_len;
941a98a0 5458 }
937b367d 5459 SvOK_off(cache);
34113e50 5460 read_from_cache = TRUE;
937b367d
NC		 5461 }
5462 }
ec0b63d7 5463
34113e50
NC		 5464 /* Filter API says that the filter appends to the contents of the buffer.
5465 Usually the buffer is "", so the details don't matter. But if it's not,
5466 then clearly what it contains is already filtered by this filter, so we
5467 don't want to pass it in a second time.
5468 I'm going to use a mortal in case the upstream filter croaks. */
ec0b63d7
NC		 5469 upstream = ((SvOK(buf_sv) && sv_len(buf_sv)) || SvGMAGICAL(buf_sv))
5470 ? sv_newmortal() : buf_sv;
5471 SvUPGRADE(upstream, SVt_PV);
937b367d 5472
bbed91b5 5473 if (filter_has_file) {
67e70b33 5474 status = FILTER_READ(idx+1, upstream, 0);
bbed91b5
KF		 5475 }
5476
34113e50 5477 if (filter_sub && status >= 0) {
39644a26 5478 dSP;
bbed91b5
KF		 5479 int count;
5480
d343c3ef 5481 ENTER_with_name("call_filter_sub");
55b5114f 5482 SAVE_DEFSV;
bbed91b5
KF		 5483 SAVETMPS;
5484 EXTEND(SP, 2);
5485
414bf5ae 5486 DEFSV_set(upstream);
bbed91b5 5487 PUSHMARK(SP);
6e449a3a 5488 mPUSHi(0);
bbed91b5
KF		 5489 if (filter_state) {
5490 PUSHs(filter_state);
5491 }
5492 PUTBACK;
5493 count = call_sv(filter_sub, G_SCALAR);
5494 SPAGAIN;
5495
5496 if (count > 0) {
5497 SV *out = POPs;
5498 if (SvOK(out)) {
941a98a0 5499 status = SvIV(out);
bbed91b5
KF		 5500 }
5501 }
5502
5503 PUTBACK;
5504 FREETMPS;
d343c3ef 5505 LEAVE_with_name("call_filter_sub");
bbed91b5
KF		 5506 }
5507
941a98a0
NC		 5508 if(SvOK(upstream)) {
5509 got_p = SvPV(upstream, got_len);
bb7a0f54
MHM		 5510 if (umaxlen) {
5511 if (got_len > umaxlen) {
5512 prune_from = got_p + umaxlen;
937b367d 5513 }
941a98a0 5514 } else {
162177c1 5515 char *const first_nl = (char *)memchr(got_p, '\n', got_len);
941a98a0
NC		 5516 if (first_nl && first_nl + 1 < got_p + got_len) {
5517 /* There's a second line here... */
5518 prune_from = first_nl + 1;
937b367d 5519 }
937b367d
NC		 5520 }
5521 }
941a98a0
NC		 5522 if (prune_from) {
5523 /* Oh. Too long. Stuff some in our cache. */
5524 STRLEN cached_len = got_p + got_len - prune_from;
4464f08e 5525 SV *const cache = datasv;
941a98a0 5526
4464f08e 5527 if (SvOK(cache)) {
941a98a0
NC		 5528 /* Cache should be empty. */
5529 assert(!SvCUR(cache));
5530 }
5531
5532 sv_setpvn(cache, prune_from, cached_len);
5533 /* If you ask for block mode, you may well split UTF-8 characters.
5534 "If it breaks, you get to keep both parts"
5535 (Your code is broken if you don't put them back together again
5536 before something notices.) */
5537 if (SvUTF8(upstream)) {
5538 SvUTF8_on(cache);
5539 }
5540 SvCUR_set(upstream, got_len - cached_len);
162177c1 5541 *prune_from = 0;
941a98a0
NC		 5542 /* Can't yet be EOF */
5543 if (status == 0)
5544 status = 1;
5545 }
937b367d 5546
34113e50
NC		 5547 /* If they are at EOF but buf_sv has something in it, then they may never
5548 have touched the SV upstream, so it may be undefined. If we naively
5549 concatenate it then we get a warning about use of uninitialised value.
5550 */
5551 if (upstream != buf_sv && (SvOK(upstream) || SvGMAGICAL(upstream))) {
937b367d
NC		 5552 sv_catsv(buf_sv, upstream);
5553 }
5554
941a98a0 5555 if (status <= 0) {
bbed91b5 5556 IoLINES(datasv) = 0;
bbed91b5
KF		 5557 if (filter_state) {
5558 SvREFCNT_dec(filter_state);
a0714e2c 5559 IoTOP_GV(datasv) = NULL;
bbed91b5
KF		 5560 }
5561 if (filter_sub) {
5562 SvREFCNT_dec(filter_sub);
a0714e2c 5563 IoBOTTOM_GV(datasv) = NULL;
bbed91b5 5564 }
0bd48802 5565 filter_del(S_run_user_filter);
bbed91b5 5566 }
34113e50
NC		 5567 if (status == 0 && read_from_cache) {
5568 /* If we read some data from the cache (and by getting here it implies
5569 that we emptied the cache) then we aren't yet at EOF, and mustn't
5570 report that to our caller. */
5571 return 1;
5572 }
941a98a0 5573 return status;
bbed91b5 5574}
84d4ea48 5575
be4b629d
CN		 5576/* perhaps someone can come up with a better name for
5577 this? it is not really "absolute", per se ... */
cf42f822 5578static bool
5f66b61c 5579S_path_is_absolute(const char *name)
be4b629d 5580{
7918f24d
NC		 5581 PERL_ARGS_ASSERT_PATH_IS_ABSOLUTE;
5582
be4b629d 5583 if (PERL_FILE_IS_ABSOLUTE(name)
3f66cd94 5584#ifdef WIN32
36f064bc
CL		 5585 || (*name == '.' && ((name[1] == '/' ||
5586 (name[1] == '.' && name[2] == '/'))
5587 || (name[1] == '\\' ||
5588 ( name[1] == '.' && name[2] == '\\')))
5589 )
5590#else
be4b629d 5591 || (*name == '.' && (name[1] == '/' ||
0bd48802 5592 (name[1] == '.' && name[2] == '/')))
36f064bc 5593#endif
0bd48802 5594 )
be4b629d
CN		 5595 {
5596 return TRUE;
5597 }
5598 else
5599 return FALSE;
5600}
241d1a3b
NC		 5601
5602/*
5603 * Local variables:
5604 * c-indentation-style: bsd
5605 * c-basic-offset: 4
5606 * indent-tabs-mode: t
5607 * End:
5608 *
37442d52
RGS		 5609 * ex: set ts=8 sts=4 sw=4 noet:
5610 */
Unnamed repository; edit this file 'description' to name the repository.