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
[perl #106282] Don’t crash cloning tied %^H
[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:
a2a5de95
NC		 1397 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1398 context_name[CxTYPE(cx)], OP_NAME(PL_op));
515afda2
NC		 1399 if (CxTYPE(cx) == CXt_NULL)
1400 return -1;
1401 break;
c6fdafd0 1402 case CXt_LOOP_LAZYIV:
d01136d6 1403 case CXt_LOOP_LAZYSV:
3b719c58
NC		 1404 case CXt_LOOP_FOR:
1405 case CXt_LOOP_PLAIN:
7e8f1eac
AD		 1406 {
1407 const char *cx_label = CxLABEL(cx);
1408 if (!cx_label || strNE(label, cx_label) ) {
1c98cc53 1409 DEBUG_l(Perl_deb(aTHX_ "(poptolabel(): skipping label at cx=%ld %s)\n",
7e8f1eac 1410 (long)i, cx_label));
a0d0e21e
LW		 1411 continue;
1412 }
1c98cc53 1413 DEBUG_l( Perl_deb(aTHX_ "(poptolabel(): found label at cx=%ld %s)\n", (long)i, label));
a0d0e21e 1414 return i;
7e8f1eac 1415 }
a0d0e21e
LW		 1416 }
1417 }
1418 return i;
1419}
1420
0d863452
RH		 1421
1422
e50aee73 1423I32
864dbfa3 1424Perl_dowantarray(pTHX)
e50aee73 1425{
97aff369 1426 dVAR;
f54cb97a 1427 const I32 gimme = block_gimme();
54310121 1428 return (gimme == G_VOID) ? G_SCALAR : gimme;
1429}
1430
1431I32
864dbfa3 1432Perl_block_gimme(pTHX)
54310121 1433{
97aff369 1434 dVAR;
06b5626a 1435 const I32 cxix = dopoptosub(cxstack_ix);
e50aee73 1436 if (cxix < 0)
46fc3d4c 1437 return G_VOID;
e50aee73 1438
54310121 1439 switch (cxstack[cxix].blk_gimme) {
d2719217
GS		 1440 case G_VOID:
1441 return G_VOID;
54310121 1442 case G_SCALAR:
e50aee73 1443 return G_SCALAR;
54310121 1444 case G_ARRAY:
1445 return G_ARRAY;
1446 default:
cea2e8a9 1447 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
d2719217
GS		 1448 /* NOTREACHED */
1449 return 0;
54310121 1450 }
e50aee73
AD		 1451}
1452
78f9721b
SM		 1453I32
1454Perl_is_lvalue_sub(pTHX)
1455{
97aff369 1456 dVAR;
06b5626a 1457 const I32 cxix = dopoptosub(cxstack_ix);
78f9721b
SM		 1458 assert(cxix >= 0); /* We should only be called from inside subs */
1459
bafb2adc
NC		 1460 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1461 return CxLVAL(cxstack + cxix);
78f9721b
SM		 1462 else
1463 return 0;
1464}
1465
777d9014
FC		 1466/* only used by PUSHSUB */
1467I32
1468Perl_was_lvalue_sub(pTHX)
1469{
1470 dVAR;
1471 const I32 cxix = dopoptosub(cxstack_ix-1);
1472 assert(cxix >= 0); /* We should only be called from inside subs */
1473
1474 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1475 return CxLVAL(cxstack + cxix);
1476 else
1477 return 0;
1478}
1479
76e3520e 1480STATIC I32
901017d6 1481S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
2c375eb9 1482{
97aff369 1483 dVAR;
a0d0e21e 1484 I32 i;
7918f24d
NC		 1485
1486 PERL_ARGS_ASSERT_DOPOPTOSUB_AT;
1487
a0d0e21e 1488 for (i = startingblock; i >= 0; i--) {
901017d6 1489 register const PERL_CONTEXT * const cx = &cxstk[i];
6b35e009 1490 switch (CxTYPE(cx)) {
a0d0e21e
LW		 1491 default:
1492 continue;
1493 case CXt_EVAL:
1494 case CXt_SUB:
7766f137 1495 case CXt_FORMAT:
1c98cc53 1496 DEBUG_l( Perl_deb(aTHX_ "(dopoptosub_at(): found sub at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1497 return i;
1498 }
1499 }
1500 return i;
1501}
1502
76e3520e 1503STATIC I32
cea2e8a9 1504S_dopoptoeval(pTHX_ I32 startingblock)
a0d0e21e 1505{
97aff369 1506 dVAR;
a0d0e21e 1507 I32 i;
a0d0e21e 1508 for (i = startingblock; i >= 0; i--) {
06b5626a 1509 register const PERL_CONTEXT *cx = &cxstack[i];
6b35e009 1510 switch (CxTYPE(cx)) {
a0d0e21e
LW		 1511 default:
1512 continue;
1513 case CXt_EVAL:
1c98cc53 1514 DEBUG_l( Perl_deb(aTHX_ "(dopoptoeval(): found eval at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1515 return i;
1516 }
1517 }
1518 return i;
1519}
1520
76e3520e 1521STATIC I32
cea2e8a9 1522S_dopoptoloop(pTHX_ I32 startingblock)
a0d0e21e 1523{
97aff369 1524 dVAR;
a0d0e21e 1525 I32 i;
a0d0e21e 1526 for (i = startingblock; i >= 0; i--) {
901017d6 1527 register const PERL_CONTEXT * const cx = &cxstack[i];
6b35e009 1528 switch (CxTYPE(cx)) {
a0d0e21e 1529 case CXt_SUBST:
a0d0e21e 1530 case CXt_SUB:
7766f137 1531 case CXt_FORMAT:
a0d0e21e 1532 case CXt_EVAL:
0a753a76 1533 case CXt_NULL:
a2a5de95
NC		 1534 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1535 context_name[CxTYPE(cx)], OP_NAME(PL_op));
515afda2
NC		 1536 if ((CxTYPE(cx)) == CXt_NULL)
1537 return -1;
1538 break;
c6fdafd0 1539 case CXt_LOOP_LAZYIV:
d01136d6 1540 case CXt_LOOP_LAZYSV:
3b719c58
NC		 1541 case CXt_LOOP_FOR:
1542 case CXt_LOOP_PLAIN:
1c98cc53 1543 DEBUG_l( Perl_deb(aTHX_ "(dopoptoloop(): found loop at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1544 return i;
1545 }
1546 }
1547 return i;
1548}
1549
0d863452
RH		 1550STATIC I32
1551S_dopoptogiven(pTHX_ I32 startingblock)
1552{
97aff369 1553 dVAR;
0d863452
RH		 1554 I32 i;
1555 for (i = startingblock; i >= 0; i--) {
1556 register const PERL_CONTEXT *cx = &cxstack[i];
1557 switch (CxTYPE(cx)) {
1558 default:
1559 continue;
1560 case CXt_GIVEN:
1c98cc53 1561 DEBUG_l( Perl_deb(aTHX_ "(dopoptogiven(): found given at cx=%ld)\n", (long)i));
0d863452 1562 return i;
3b719c58
NC		 1563 case CXt_LOOP_PLAIN:
1564 assert(!CxFOREACHDEF(cx));
1565 break;
c6fdafd0 1566 case CXt_LOOP_LAZYIV:
d01136d6 1567 case CXt_LOOP_LAZYSV:
3b719c58 1568 case CXt_LOOP_FOR:
0d863452 1569 if (CxFOREACHDEF(cx)) {
1c98cc53 1570 DEBUG_l( Perl_deb(aTHX_ "(dopoptogiven(): found foreach at cx=%ld)\n", (long)i));
0d863452
RH		 1571 return i;
1572 }
1573 }
1574 }
1575 return i;
1576}
1577
1578STATIC I32
1579S_dopoptowhen(pTHX_ I32 startingblock)
1580{
97aff369 1581 dVAR;
0d863452
RH		 1582 I32 i;
1583 for (i = startingblock; i >= 0; i--) {
1584 register const PERL_CONTEXT *cx = &cxstack[i];
1585 switch (CxTYPE(cx)) {
1586 default:
1587 continue;
1588 case CXt_WHEN:
1c98cc53 1589 DEBUG_l( Perl_deb(aTHX_ "(dopoptowhen(): found when at cx=%ld)\n", (long)i));
0d863452
RH		 1590 return i;
1591 }
1592 }
1593 return i;
1594}
1595
a0d0e21e 1596void
864dbfa3 1597Perl_dounwind(pTHX_ I32 cxix)
a0d0e21e 1598{
97aff369 1599 dVAR;
a0d0e21e
LW		 1600 I32 optype;
1601
f144f1e3
DM		 1602 if (!PL_curstackinfo) /* can happen if die during thread cloning */
1603 return;
1604
a0d0e21e 1605 while (cxstack_ix > cxix) {
b0d9ce38 1606 SV *sv;
06b5626a 1607 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1c98cc53 1608 DEBUG_CX("UNWIND"); \
a0d0e21e 1609 /* Note: we don't need to restore the base context info till the end. */
6b35e009 1610 switch (CxTYPE(cx)) {
c90c0ff4 1611 case CXt_SUBST:
1612 POPSUBST(cx);
1613 continue; /* not break */
a0d0e21e 1614 case CXt_SUB:
b0d9ce38
GS		 1615 POPSUB(cx,sv);
1616 LEAVESUB(sv);
a0d0e21e
LW		 1617 break;
1618 case CXt_EVAL:
1619 POPEVAL(cx);
1620 break;
c6fdafd0 1621 case CXt_LOOP_LAZYIV:
d01136d6 1622 case CXt_LOOP_LAZYSV:
3b719c58
NC		 1623 case CXt_LOOP_FOR:
1624 case CXt_LOOP_PLAIN:
a0d0e21e
LW		 1625 POPLOOP(cx);
1626 break;
0a753a76 1627 case CXt_NULL:
a0d0e21e 1628 break;
7766f137
GS		 1629 case CXt_FORMAT:
1630 POPFORMAT(cx);
1631 break;
a0d0e21e 1632 }
c90c0ff4 1633 cxstack_ix--;
a0d0e21e 1634 }
1b6737cc 1635 PERL_UNUSED_VAR(optype);
a0d0e21e
LW		 1636}
1637
5a844595
GS		 1638void
1639Perl_qerror(pTHX_ SV *err)
1640{
97aff369 1641 dVAR;
7918f24d
NC		 1642
1643 PERL_ARGS_ASSERT_QERROR;
1644
6b2fb389
DM		 1645 if (PL_in_eval) {
1646 if (PL_in_eval & EVAL_KEEPERR) {
ecad31f0
BF		 1647 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1648 SVfARG(err));
6b2fb389
DM		 1649 }
1650 else
1651 sv_catsv(ERRSV, err);
1652 }
5a844595
GS		 1653 else if (PL_errors)
1654 sv_catsv(PL_errors, err);
1655 else
be2597df 1656 Perl_warn(aTHX_ "%"SVf, SVfARG(err));
13765c85
DM		 1657 if (PL_parser)
1658 ++PL_parser->error_count;
5a844595
GS		 1659}
1660
bb4c52e0 1661void
c5df3096 1662Perl_die_unwind(pTHX_ SV *msv)
a0d0e21e 1663{
27da23d5 1664 dVAR;
c5df3096 1665 SV *exceptsv = sv_mortalcopy(msv);
96d9b9cd 1666 U8 in_eval = PL_in_eval;
c5df3096 1667 PERL_ARGS_ASSERT_DIE_UNWIND;
87582a92 1668
96d9b9cd 1669 if (in_eval) {
a0d0e21e 1670 I32 cxix;
a0d0e21e 1671 I32 gimme;
a0d0e21e 1672
22a30693
Z		 1673 /*
1674 * Historically, perl used to set ERRSV ($@) early in the die
1675 * process and rely on it not getting clobbered during unwinding.
1676 * That sucked, because it was liable to get clobbered, so the
1677 * setting of ERRSV used to emit the exception from eval{} has
1678 * been moved to much later, after unwinding (see just before
1679 * JMPENV_JUMP below). However, some modules were relying on the
1680 * early setting, by examining $@ during unwinding to use it as
1681 * a flag indicating whether the current unwinding was caused by
1682 * an exception. It was never a reliable flag for that purpose,
1683 * being totally open to false positives even without actual
1684 * clobberage, but was useful enough for production code to
1685 * semantically rely on it.
1686 *
1687 * We'd like to have a proper introspective interface that
1688 * explicitly describes the reason for whatever unwinding
1689 * operations are currently in progress, so that those modules
1690 * work reliably and $@ isn't further overloaded. But we don't
1691 * have one yet. In its absence, as a stopgap measure, ERRSV is
1692 * now *additionally* set here, before unwinding, to serve as the
1693 * (unreliable) flag that it used to.
1694 *
1695 * This behaviour is temporary, and should be removed when a
1696 * proper way to detect exceptional unwinding has been developed.
1697 * As of 2010-12, the authors of modules relying on the hack
1698 * are aware of the issue, because the modules failed on
1699 * perls 5.13.{1..7} which had late setting of $@ without this
1700 * early-setting hack.
1701 */
1702 if (!(in_eval & EVAL_KEEPERR)) {
1703 SvTEMP_off(exceptsv);
1704 sv_setsv(ERRSV, exceptsv);
1705 }
1706
5a844595
GS		 1707 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1708 && PL_curstackinfo->si_prev)
1709 {
bac4b2ad 1710 dounwind(-1);
d3acc0f7 1711 POPSTACK;
bac4b2ad 1712 }
e336de0d 1713
a0d0e21e
LW		 1714 if (cxix >= 0) {
1715 I32 optype;
b6494f15 1716 SV *namesv;
35a4481c 1717 register PERL_CONTEXT *cx;
901017d6 1718 SV **newsp;
8f89e5a9
Z		 1719 COP *oldcop;
1720 JMPENV *restartjmpenv;
1721 OP *restartop;
a0d0e21e
LW		 1722
1723 if (cxix < cxstack_ix)
1724 dounwind(cxix);
1725
3280af22 1726 POPBLOCK(cx,PL_curpm);
6b35e009 1727 if (CxTYPE(cx) != CXt_EVAL) {
7d0994e0 1728 STRLEN msglen;
96d9b9cd 1729 const char* message = SvPVx_const(exceptsv, msglen);
10edeb5d 1730 PerlIO_write(Perl_error_log, (const char *)"panic: die ", 11);
bf49b057 1731 PerlIO_write(Perl_error_log, message, msglen);
a0d0e21e
LW		 1732 my_exit(1);
1733 }
1734 POPEVAL(cx);
b6494f15 1735 namesv = cx->blk_eval.old_namesv;
8f89e5a9
Z		 1736 oldcop = cx->blk_oldcop;
1737 restartjmpenv = cx->blk_eval.cur_top_env;
1738 restartop = cx->blk_eval.retop;
a0d0e21e
LW		 1739
1740 if (gimme == G_SCALAR)
3280af22
NIS		 1741 *++newsp = &PL_sv_undef;
1742 PL_stack_sp = newsp;
a0d0e21e
LW		 1743
1744 LEAVE;
748a9306 1745
7fb6a879
GS		 1746 /* LEAVE could clobber PL_curcop (see save_re_context())
1747 * XXX it might be better to find a way to avoid messing with
1748 * PL_curcop in save_re_context() instead, but this is a more
1749 * minimal fix --GSAR */
8f89e5a9 1750 PL_curcop = oldcop;
7fb6a879 1751
7a2e2cd6 1752 if (optype == OP_REQUIRE) {
b6494f15 1753 (void)hv_store(GvHVn(PL_incgv),
ecad31f0 1754 SvPVX_const(namesv),
c60dbbc3 1755 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
27bcc0a7 1756 &PL_sv_undef, 0);
27e90453
DM		 1757 /* note that unlike pp_entereval, pp_require isn't
1758 * supposed to trap errors. So now that we've popped the
1759 * EVAL that pp_require pushed, and processed the error
1760 * message, rethrow the error */
ecad31f0
BF		 1761 Perl_croak(aTHX_ "%"SVf"Compilation failed in require",
1762 SVfARG(exceptsv ? exceptsv : newSVpvs_flags("Unknown error\n",
1763 SVs_TEMP)));
7a2e2cd6 1764 }
c5df3096 1765 if (in_eval & EVAL_KEEPERR) {
ecad31f0
BF		 1766 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1767 SVfARG(exceptsv));
96d9b9cd
Z		 1768 }
1769 else {
1770 sv_setsv(ERRSV, exceptsv);
1771 }
8f89e5a9
Z		 1772 PL_restartjmpenv = restartjmpenv;
1773 PL_restartop = restartop;
bb4c52e0
GG		 1774 JMPENV_JUMP(3);
1775 /* NOTREACHED */
a0d0e21e
LW		 1776 }
1777 }
87582a92 1778
96d9b9cd 1779 write_to_stderr(exceptsv);
f86702cc 1780 my_failure_exit();
1781 /* NOTREACHED */
a0d0e21e
LW		 1782}
1783
1784PP(pp_xor)
1785{
97aff369 1786 dVAR; dSP; dPOPTOPssrl;
a0d0e21e
LW		 1787 if (SvTRUE(left) != SvTRUE(right))
1788 RETSETYES;
1789 else
1790 RETSETNO;
1791}
1792
8dff4fc5
BM		 1793/*
1794=for apidoc caller_cx
1795
1796The XSUB-writer's equivalent of L<caller()|perlfunc/caller>. The
1797returned C<PERL_CONTEXT> structure can be interrogated to find all the
1798information returned to Perl by C<caller>. Note that XSUBs don't get a
1799stack frame, so C<caller_cx(0, NULL)> will return information for the
1800immediately-surrounding Perl code.
1801
1802This function skips over the automatic calls to C<&DB::sub> made on the
1803behalf of the debugger. If the stack frame requested was a sub called by
1804C<DB::sub>, the return value will be the frame for the call to
1805C<DB::sub>, since that has the correct line number/etc. for the call
1806site. If I<dbcxp> is non-C<NULL>, it will be set to a pointer to the
1807frame for the sub call itself.
1808
1809=cut
1810*/
1811
1812const PERL_CONTEXT *
1813Perl_caller_cx(pTHX_ I32 count, const PERL_CONTEXT **dbcxp)
a0d0e21e 1814{
a0d0e21e 1815 register I32 cxix = dopoptosub(cxstack_ix);
901017d6
AL		 1816 register const PERL_CONTEXT *cx;
1817 register const PERL_CONTEXT *ccstack = cxstack;
1818 const PERL_SI *top_si = PL_curstackinfo;
27d41816 1819
a0d0e21e 1820 for (;;) {
2c375eb9
GS		 1821 /* we may be in a higher stacklevel, so dig down deeper */
1822 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1823 top_si = top_si->si_prev;
1824 ccstack = top_si->si_cxstack;
1825 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1826 }
8dff4fc5
BM		 1827 if (cxix < 0)
1828 return NULL;
f2a7f298
DG		 1829 /* caller() should not report the automatic calls to &DB::sub */
1830 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
3280af22 1831 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
a0d0e21e
LW		 1832 count++;
1833 if (!count--)
1834 break;
2c375eb9 1835 cxix = dopoptosub_at(ccstack, cxix - 1);
a0d0e21e 1836 }
2c375eb9
GS		 1837
1838 cx = &ccstack[cxix];
8dff4fc5
BM		 1839 if (dbcxp) *dbcxp = cx;
1840
7766f137 1841 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
f54cb97a 1842 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
2c375eb9 1843 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
06a5b730 1844 field below is defined for any cx. */
f2a7f298
DG		 1845 /* caller() should not report the automatic calls to &DB::sub */
1846 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
2c375eb9 1847 cx = &ccstack[dbcxix];
06a5b730 1848 }
1849
8dff4fc5
BM		 1850 return cx;
1851}
1852
1853PP(pp_caller)
1854{
1855 dVAR;
1856 dSP;
1857 register const PERL_CONTEXT *cx;
1858 const PERL_CONTEXT *dbcx;
1859 I32 gimme;
d527ce7c 1860 const HEK *stash_hek;
8dff4fc5 1861 I32 count = 0;
ce0b554b 1862 bool has_arg = MAXARG && TOPs;
8dff4fc5 1863
ce0b554b
FC		 1864 if (MAXARG) {
1865 if (has_arg)
8dff4fc5 1866 count = POPi;
ce0b554b
FC		 1867 else (void)POPs;
1868 }
8dff4fc5 1869
ce0b554b 1870 cx = caller_cx(count + !!(PL_op->op_private & OPpOFFBYONE), &dbcx);
8dff4fc5
BM		 1871 if (!cx) {
1872 if (GIMME != G_ARRAY) {
1873 EXTEND(SP, 1);
1874 RETPUSHUNDEF;
1875 }
1876 RETURN;
1877 }
1878
d527ce7c 1879 stash_hek = HvNAME_HEK((HV*)CopSTASH(cx->blk_oldcop));
a0d0e21e 1880 if (GIMME != G_ARRAY) {
27d41816 1881 EXTEND(SP, 1);
d527ce7c 1882 if (!stash_hek)
3280af22 1883 PUSHs(&PL_sv_undef);
49d8d3a1
MB		 1884 else {
1885 dTARGET;
d527ce7c 1886 sv_sethek(TARG, stash_hek);
49d8d3a1
MB		 1887 PUSHs(TARG);
1888 }
a0d0e21e
LW		 1889 RETURN;
1890 }
a0d0e21e 1891
b3ca2e83 1892 EXTEND(SP, 11);
27d41816 1893
d527ce7c 1894 if (!stash_hek)
3280af22 1895 PUSHs(&PL_sv_undef);
d527ce7c
BF		 1896 else {
1897 dTARGET;
1898 sv_sethek(TARG, stash_hek);
1899 PUSHTARG;
1900 }
6e449a3a
MHM		 1901 mPUSHs(newSVpv(OutCopFILE(cx->blk_oldcop), 0));
1902 mPUSHi((I32)CopLINE(cx->blk_oldcop));
ce0b554b 1903 if (!has_arg)
a0d0e21e 1904 RETURN;
7766f137 1905 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
8dff4fc5 1906 GV * const cvgv = CvGV(dbcx->blk_sub.cv);
7766f137 1907 /* So is ccstack[dbcxix]. */
07b8c804 1908 if (isGV(cvgv)) {
561b68a9 1909 SV * const sv = newSV(0);
c445ea15 1910 gv_efullname3(sv, cvgv, NULL);
6e449a3a 1911 mPUSHs(sv);
bf38a478 1912 PUSHs(boolSV(CxHASARGS(cx)));
07b8c804
RGS		 1913 }
1914 else {
84bafc02 1915 PUSHs(newSVpvs_flags("(unknown)", SVs_TEMP));
bf38a478 1916 PUSHs(boolSV(CxHASARGS(cx)));
07b8c804 1917 }
a0d0e21e
LW		 1918 }
1919 else {
84bafc02 1920 PUSHs(newSVpvs_flags("(eval)", SVs_TEMP));
6e449a3a 1921 mPUSHi(0);
a0d0e21e 1922 }
54310121 1923 gimme = (I32)cx->blk_gimme;
1924 if (gimme == G_VOID)
3280af22 1925 PUSHs(&PL_sv_undef);
54310121 1926 else
98625aca 1927 PUSHs(boolSV((gimme & G_WANT) == G_ARRAY));
6b35e009 1928 if (CxTYPE(cx) == CXt_EVAL) {
811a4de9 1929 /* eval STRING */
85a64632 1930 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
4633a7c4 1931 PUSHs(cx->blk_eval.cur_text);
3280af22 1932 PUSHs(&PL_sv_no);
0f79a09d 1933 }
811a4de9 1934 /* require */
0f79a09d 1935 else if (cx->blk_eval.old_namesv) {
6e449a3a 1936 mPUSHs(newSVsv(cx->blk_eval.old_namesv));
3280af22 1937 PUSHs(&PL_sv_yes);
06a5b730 1938 }
811a4de9
GS		 1939 /* eval BLOCK (try blocks have old_namesv == 0) */
1940 else {
1941 PUSHs(&PL_sv_undef);
1942 PUSHs(&PL_sv_undef);
1943 }
4633a7c4 1944 }
a682de96
GS		 1945 else {
1946 PUSHs(&PL_sv_undef);
1947 PUSHs(&PL_sv_undef);
1948 }
bafb2adc 1949 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)
ed094faf 1950 && CopSTASH_eq(PL_curcop, PL_debstash))
4633a7c4 1951 {
66a1b24b
AL		 1952 AV * const ary = cx->blk_sub.argarray;
1953 const int off = AvARRAY(ary) - AvALLOC(ary);
a0d0e21e 1954
e1a80902 1955 Perl_init_dbargs(aTHX);
a0d0e21e 1956
3280af22
NIS		 1957 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1958 av_extend(PL_dbargs, AvFILLp(ary) + off);
1959 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1960 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
a0d0e21e 1961 }
f3aa04c2
GS		 1962 /* XXX only hints propagated via op_private are currently
1963 * visible (others are not easily accessible, since they
1964 * use the global PL_hints) */
6e449a3a 1965 mPUSHi(CopHINTS_get(cx->blk_oldcop));
e476b1b5
GS		 1966 {
1967 SV * mask ;
72dc9ed5 1968 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
114bafba 1969
ac27b0f5 1970 if (old_warnings == pWARN_NONE ||
114bafba 1971 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
e476b1b5 1972 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
ac27b0f5 1973 else if (old_warnings == pWARN_ALL ||
75b6c4ca
RGS		 1974 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1975 /* Get the bit mask for $warnings::Bits{all}, because
1976 * it could have been extended by warnings::register */
1977 SV **bits_all;
6673a63c 1978 HV * const bits = get_hv("warnings::Bits", 0);
017a3ce5 1979 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
75b6c4ca
RGS		 1980 mask = newSVsv(*bits_all);
1981 }
1982 else {
1983 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1984 }
1985 }
e476b1b5 1986 else
72dc9ed5 1987 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
6e449a3a 1988 mPUSHs(mask);
e476b1b5 1989 }
b3ca2e83 1990
c28fe1ec 1991 PUSHs(cx->blk_oldcop->cop_hints_hash ?
20439bc7 1992 sv_2mortal(newRV_noinc(MUTABLE_SV(cop_hints_2hv(cx->blk_oldcop, 0))))
b3ca2e83 1993 : &PL_sv_undef);
a0d0e21e
LW		 1994 RETURN;
1995}
1996
a0d0e21e
LW		 1997PP(pp_reset)
1998{
97aff369 1999 dVAR;
39644a26 2000 dSP;
f650fa72
FC		 2001 const char * const tmps =
2002 (MAXARG < 1 || (!TOPs && !POPs)) ? (const char *)"" : POPpconstx;
11faa288 2003 sv_reset(tmps, CopSTASH(PL_curcop));
3280af22 2004 PUSHs(&PL_sv_yes);
a0d0e21e
LW		 2005 RETURN;
2006}
2007
dd2155a4
DM		 2008/* like pp_nextstate, but used instead when the debugger is active */
2009
a0d0e21e
LW		 2010PP(pp_dbstate)
2011{
27da23d5 2012 dVAR;
533c011a 2013 PL_curcop = (COP*)PL_op;
a0d0e21e 2014 TAINT_NOT; /* Each statement is presumed innocent */
3280af22 2015 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
a0d0e21e
LW		 2016 FREETMPS;
2017
f410a211
NC		 2018 PERL_ASYNC_CHECK();
2019
5df8de69
DM		 2020 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
2021 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
a0d0e21e 2022 {
39644a26 2023 dSP;
c09156bb 2024 register PERL_CONTEXT *cx;
f54cb97a 2025 const I32 gimme = G_ARRAY;
eb160463 2026 U8 hasargs;
0bd48802
AL		 2027 GV * const gv = PL_DBgv;
2028 register CV * const cv = GvCV(gv);
a0d0e21e 2029
a0d0e21e 2030 if (!cv)
cea2e8a9 2031 DIE(aTHX_ "No DB::DB routine defined");
a0d0e21e 2032
aea4f609
DM		 2033 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
2034 /* don't do recursive DB::DB call */
a0d0e21e 2035 return NORMAL;
748a9306 2036
a57c6685 2037 ENTER;
4633a7c4
LW		 2038 SAVETMPS;
2039
3280af22 2040 SAVEI32(PL_debug);
55497cff 2041 SAVESTACK_POS();
3280af22 2042 PL_debug = 0;
748a9306 2043 hasargs = 0;
924508f0 2044 SPAGAIN;
748a9306 2045
aed2304a 2046 if (CvISXSUB(cv)) {
c127bd3a
SF		 2047 CvDEPTH(cv)++;
2048 PUSHMARK(SP);
2049 (void)(*CvXSUB(cv))(aTHX_ cv);
2050 CvDEPTH(cv)--;
2051 FREETMPS;
a57c6685 2052 LEAVE;
c127bd3a
SF		 2053 return NORMAL;
2054 }
2055 else {
2056 PUSHBLOCK(cx, CXt_SUB, SP);
2057 PUSHSUB_DB(cx);
2058 cx->blk_sub.retop = PL_op->op_next;
2059 CvDEPTH(cv)++;
2060 SAVECOMPPAD();
2061 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), 1);
2062 RETURNOP(CvSTART(cv));
2063 }
a0d0e21e
LW		 2064 }
2065 else
2066 return NORMAL;
2067}
2068
b9d76716
VP		 2069STATIC SV **
2070S_adjust_stack_on_leave(pTHX_ SV **newsp, SV **sp, SV **mark, I32 gimme, U32 flags)
2071{
9a214eec 2072 bool padtmp = 0;
b9d76716
VP		 2073 PERL_ARGS_ASSERT_ADJUST_STACK_ON_LEAVE;
2074
9a214eec
DM		 2075 if (flags & SVs_PADTMP) {
2076 flags &= ~SVs_PADTMP;
2077 padtmp = 1;
2078 }
b9d76716
VP		 2079 if (gimme == G_SCALAR) {
2080 if (MARK < SP)
9a214eec
DM		 2081 *++newsp = ((SvFLAGS(*SP) & flags) || (padtmp && SvPADTMP(*SP)))
2082 ? *SP : sv_mortalcopy(*SP);
b9d76716
VP		 2083 else {
2084 /* MEXTEND() only updates MARK, so reuse it instead of newsp. */
2085 MARK = newsp;
2086 MEXTEND(MARK, 1);
2087 *++MARK = &PL_sv_undef;
2088 return MARK;
2089 }
2090 }
2091 else if (gimme == G_ARRAY) {
2092 /* in case LEAVE wipes old return values */
2093 while (++MARK <= SP) {
9a214eec 2094 if ((SvFLAGS(*MARK) & flags) || (padtmp && SvPADTMP(*MARK)))
b9d76716
VP		 2095 *++newsp = *MARK;
2096 else {
2097 *++newsp = sv_mortalcopy(*MARK);
2098 TAINT_NOT; /* Each item is independent */
2099 }
2100 }
2101 /* When this function was called with MARK == newsp, we reach this
2102 * point with SP == newsp. */
2103 }
2104
2105 return newsp;
2106}
2107
2b9a6457
VP		 2108PP(pp_enter)
2109{
2110 dVAR; dSP;
2111 register PERL_CONTEXT *cx;
7c2d9d03 2112 I32 gimme = GIMME_V;
2b9a6457
VP		 2113
2114 ENTER_with_name("block");
2115
2116 SAVETMPS;
2117 PUSHBLOCK(cx, CXt_BLOCK, SP);
2118
2119 RETURN;
2120}
2121
2122PP(pp_leave)
2123{
2124 dVAR; dSP;
2125 register PERL_CONTEXT *cx;
2126 SV **newsp;
2127 PMOP *newpm;
2128 I32 gimme;
2129
2130 if (PL_op->op_flags & OPf_SPECIAL) {
2131 cx = &cxstack[cxstack_ix];
2132 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
2133 }
2134
2135 POPBLOCK(cx,newpm);
2136
2137 gimme = OP_GIMME(PL_op, (cxstack_ix >= 0) ? gimme : G_SCALAR);
2138
2139 TAINT_NOT;
f02ea43c 2140 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
2b9a6457
VP		 2141 PL_curpm = newpm; /* Don't pop $1 et al till now */
2142
2143 LEAVE_with_name("block");
2144
2145 RETURN;
2146}
2147
a0d0e21e
LW		 2148PP(pp_enteriter)
2149{
27da23d5 2150 dVAR; dSP; dMARK;
c09156bb 2151 register PERL_CONTEXT *cx;
f54cb97a 2152 const I32 gimme = GIMME_V;
df530c37 2153 void *itervar; /* location of the iteration variable */
840fe433 2154 U8 cxtype = CXt_LOOP_FOR;
a0d0e21e 2155
d343c3ef 2156 ENTER_with_name("loop1");
4633a7c4
LW		 2157 SAVETMPS;
2158
aafca525
DM		 2159 if (PL_op->op_targ) { /* "my" variable */
2160 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
14f338dc
DM		 2161 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
2162 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
2163 SVs_PADSTALE, SVs_PADSTALE);
2164 }
09edbca0 2165 SAVEPADSVANDMORTALIZE(PL_op->op_targ);
89e00a7c 2166#ifdef USE_ITHREADS
df530c37 2167 itervar = PL_comppad;
89e00a7c 2168#else
aafca525 2169 itervar = &PAD_SVl(PL_op->op_targ);
7766f137 2170#endif
54b9620d 2171 }
aafca525 2172 else { /* symbol table variable */
159b6efe 2173 GV * const gv = MUTABLE_GV(POPs);
f83b46a0
DM		 2174 SV** svp = &GvSV(gv);
2175 save_pushptrptr(gv, SvREFCNT_inc(*svp), SAVEt_GVSV);
561b68a9 2176 *svp = newSV(0);
df530c37 2177 itervar = (void *)gv;
54b9620d 2178 }
4633a7c4 2179
0d863452
RH		 2180 if (PL_op->op_private & OPpITER_DEF)
2181 cxtype |= CXp_FOR_DEF;
2182
d343c3ef 2183 ENTER_with_name("loop2");
a0d0e21e 2184
7766f137 2185 PUSHBLOCK(cx, cxtype, SP);
df530c37 2186 PUSHLOOP_FOR(cx, itervar, MARK);
533c011a 2187 if (PL_op->op_flags & OPf_STACKED) {
d01136d6
BS		 2188 SV *maybe_ary = POPs;
2189 if (SvTYPE(maybe_ary) != SVt_PVAV) {
89ea2908 2190 dPOPss;
d01136d6 2191 SV * const right = maybe_ary;
984a4bea
RD		 2192 SvGETMAGIC(sv);
2193 SvGETMAGIC(right);
4fe3f0fa 2194 if (RANGE_IS_NUMERIC(sv,right)) {
d01136d6 2195 cx->cx_type &= ~CXTYPEMASK;
c6fdafd0
NC		 2196 cx->cx_type |= CXt_LOOP_LAZYIV;
2197 /* Make sure that no-one re-orders cop.h and breaks our
2198 assumptions */
2199 assert(CxTYPE(cx) == CXt_LOOP_LAZYIV);
a2309040 2200#ifdef NV_PRESERVES_UV
f52e41ad
FC		 2201 if ((SvOK(sv) && ((SvNV_nomg(sv) < (NV)IV_MIN) ||
2202 (SvNV_nomg(sv) > (NV)IV_MAX)))
a2309040 2203 ||
f52e41ad
FC		 2204 (SvOK(right) && ((SvNV_nomg(right) > (NV)IV_MAX) ||
2205 (SvNV_nomg(right) < (NV)IV_MIN))))
a2309040 2206#else
f52e41ad 2207 if ((SvOK(sv) && ((SvNV_nomg(sv) <= (NV)IV_MIN)
a2309040 2208 ||
f52e41ad
FC		 2209 ((SvNV_nomg(sv) > 0) &&
2210 ((SvUV_nomg(sv) > (UV)IV_MAX) ||
2211 (SvNV_nomg(sv) > (NV)UV_MAX)))))
a2309040 2212 ||
f52e41ad 2213 (SvOK(right) && ((SvNV_nomg(right) <= (NV)IV_MIN)
a2309040 2214 ||
f52e41ad
FC		 2215 ((SvNV_nomg(right) > 0) &&
2216 ((SvUV_nomg(right) > (UV)IV_MAX) ||
2217 (SvNV_nomg(right) > (NV)UV_MAX))
2218 ))))
a2309040 2219#endif
076d9a11 2220 DIE(aTHX_ "Range iterator outside integer range");
f52e41ad
FC		 2221 cx->blk_loop.state_u.lazyiv.cur = SvIV_nomg(sv);
2222 cx->blk_loop.state_u.lazyiv.end = SvIV_nomg(right);
d4665a05
DM		 2223#ifdef DEBUGGING
2224 /* for correct -Dstv display */
2225 cx->blk_oldsp = sp - PL_stack_base;
2226#endif
89ea2908 2227 }
3f63a782 2228 else {
d01136d6
BS		 2229 cx->cx_type &= ~CXTYPEMASK;
2230 cx->cx_type |= CXt_LOOP_LAZYSV;
2231 /* Make sure that no-one re-orders cop.h and breaks our
2232 assumptions */
2233 assert(CxTYPE(cx) == CXt_LOOP_LAZYSV);
2234 cx->blk_loop.state_u.lazysv.cur = newSVsv(sv);
2235 cx->blk_loop.state_u.lazysv.end = right;
2236 SvREFCNT_inc(right);
2237 (void) SvPV_force_nolen(cx->blk_loop.state_u.lazysv.cur);
267cc4a8
NC		 2238 /* This will do the upgrade to SVt_PV, and warn if the value
2239 is uninitialised. */
10516c54 2240 (void) SvPV_nolen_const(right);
267cc4a8
NC		 2241 /* Doing this avoids a check every time in pp_iter in pp_hot.c
2242 to replace !SvOK() with a pointer to "". */
2243 if (!SvOK(right)) {
2244 SvREFCNT_dec(right);
d01136d6 2245 cx->blk_loop.state_u.lazysv.end = &PL_sv_no;
267cc4a8 2246 }
3f63a782 2247 }
89ea2908 2248 }
d01136d6 2249 else /* SvTYPE(maybe_ary) == SVt_PVAV */ {
502c6561 2250 cx->blk_loop.state_u.ary.ary = MUTABLE_AV(maybe_ary);
d01136d6
BS		 2251 SvREFCNT_inc(maybe_ary);
2252 cx->blk_loop.state_u.ary.ix =
2253 (PL_op->op_private & OPpITER_REVERSED) ?
2254 AvFILL(cx->blk_loop.state_u.ary.ary) + 1 :
2255 -1;
ef3e5ea9 2256 }
89ea2908 2257 }
d01136d6
BS		 2258 else { /* iterating over items on the stack */
2259 cx->blk_loop.state_u.ary.ary = NULL; /* means to use the stack */
ef3e5ea9 2260 if (PL_op->op_private & OPpITER_REVERSED) {
d01136d6 2261 cx->blk_loop.state_u.ary.ix = cx->blk_oldsp + 1;
ef3e5ea9
NC		 2262 }
2263 else {
d01136d6 2264 cx->blk_loop.state_u.ary.ix = MARK - PL_stack_base;
ef3e5ea9 2265 }
4633a7c4 2266 }
a0d0e21e
LW		 2267
2268 RETURN;
2269}
2270
2271PP(pp_enterloop)
2272{
27da23d5 2273 dVAR; dSP;
c09156bb 2274 register PERL_CONTEXT *cx;
f54cb97a 2275 const I32 gimme = GIMME_V;
a0d0e21e 2276
d343c3ef 2277 ENTER_with_name("loop1");
a0d0e21e 2278 SAVETMPS;
d343c3ef 2279 ENTER_with_name("loop2");
a0d0e21e 2280
3b719c58
NC		 2281 PUSHBLOCK(cx, CXt_LOOP_PLAIN, SP);
2282 PUSHLOOP_PLAIN(cx, SP);
a0d0e21e
LW		 2283
2284 RETURN;
2285}
2286
2287PP(pp_leaveloop)
2288{
27da23d5 2289 dVAR; dSP;
c09156bb 2290 register PERL_CONTEXT *cx;
a0d0e21e
LW		 2291 I32 gimme;
2292 SV **newsp;
2293 PMOP *newpm;
2294 SV **mark;
2295
2296 POPBLOCK(cx,newpm);
3b719c58 2297 assert(CxTYPE_is_LOOP(cx));
4fdae800 2298 mark = newsp;
a8bba7fa 2299 newsp = PL_stack_base + cx->blk_loop.resetsp;
f86702cc 2300
a1f49e72 2301 TAINT_NOT;
b9d76716 2302 SP = adjust_stack_on_leave(newsp, SP, MARK, gimme, 0);
f86702cc 2303 PUTBACK;
2304
a8bba7fa 2305 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
3280af22 2306 PL_curpm = newpm; /* ... and pop $1 et al */
f86702cc 2307
d343c3ef
GG		 2308 LEAVE_with_name("loop2");
2309 LEAVE_with_name("loop1");
a0d0e21e 2310
f86702cc 2311 return NORMAL;
a0d0e21e
LW		 2312}
2313
3bdf583b
FC		 2314STATIC void
2315S_return_lvalues(pTHX_ SV **mark, SV **sp, SV **newsp, I32 gimme,
d25b0d7b 2316 PERL_CONTEXT *cx, PMOP *newpm)
3bdf583b 2317{
80422e24 2318 const bool ref = !!(CxLVAL(cx) & OPpENTERSUB_INARGS);
3bdf583b 2319 if (gimme == G_SCALAR) {
d25b0d7b
FC		 2320 if (CxLVAL(cx) && !ref) { /* Leave it as it is if we can. */
2321 SV *sv;
001de122 2322 const char *what = NULL;
d25b0d7b
FC		 2323 if (MARK < SP) {
2324 assert(MARK+1 == SP);
2325 if ((SvPADTMP(TOPs) ||
2326 (SvFLAGS(TOPs) & (SVf_READONLY | SVf_FAKE))
2327 == SVf_READONLY
2328 ) &&
2329 !SvSMAGICAL(TOPs)) {
001de122 2330 what =
d25b0d7b 2331 SvREADONLY(TOPs) ? (TOPs == &PL_sv_undef) ? "undef"
001de122 2332 : "a readonly value" : "a temporary";
d25b0d7b 2333 }
001de122 2334 else goto copy_sv;
d25b0d7b
FC		 2335 }
2336 else {
2337 /* sub:lvalue{} will take us here. */
001de122 2338 what = "undef";
d25b0d7b 2339 }
001de122
FC		 2340 LEAVE;
2341 cxstack_ix--;
2342 POPSUB(cx,sv);
2343 PL_curpm = newpm;
2344 LEAVESUB(sv);
2345 Perl_croak(aTHX_
2346 "Can't return %s from lvalue subroutine", what
2347 );
d25b0d7b 2348 }
93905212 2349 if (MARK < SP) {
a5ad7a5a 2350 copy_sv:
3bdf583b
FC		 2351 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2352 *++newsp = SvREFCNT_inc(*SP);
2353 FREETMPS;
2354 sv_2mortal(*newsp);
2355 }
2356 else
e08be60b 2357 *++newsp =
e08be60b
FC		 2358 !SvTEMP(*SP)
2359 ? sv_2mortal(SvREFCNT_inc_simple_NN(*SP))
2360 : *SP;
3bdf583b 2361 }
0d235c77
FC		 2362 else {
2363 EXTEND(newsp,1);
3bdf583b 2364 *++newsp = &PL_sv_undef;
0d235c77 2365 }
0e9700df 2366 if (CxLVAL(cx) & OPpDEREF) {
767eda44
FC		 2367 SvGETMAGIC(TOPs);
2368 if (!SvOK(TOPs)) {
0e9700df 2369 TOPs = vivify_ref(TOPs, CxLVAL(cx) & OPpDEREF);
767eda44
FC		 2370 }
2371 }
3bdf583b
FC		 2372 }
2373 else if (gimme == G_ARRAY) {
0e9700df 2374 assert (!(CxLVAL(cx) & OPpDEREF));
80422e24 2375 if (ref || !CxLVAL(cx))
e08be60b
FC		 2376 while (++MARK <= SP)
2377 *++newsp =
2378 SvTEMP(*MARK)
2379 ? *MARK
80422e24
FC		 2380 : ref && SvFLAGS(*MARK) & SVs_PADTMP
2381 ? sv_mortalcopy(*MARK)
2382 : sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
e08be60b 2383 else while (++MARK <= SP) {
d25b0d7b
FC		 2384 if (*MARK != &PL_sv_undef
2385 && (SvPADTMP(*MARK)
2386 || (SvFLAGS(*MARK) & (SVf_READONLY|SVf_FAKE))
2387 == SVf_READONLY
2388 )
2389 ) {
2390 SV *sv;
2391 /* Might be flattened array after $#array = */
2392 PUTBACK;
2393 LEAVE;
2394 cxstack_ix--;
2395 POPSUB(cx,sv);
2396 PL_curpm = newpm;
2397 LEAVESUB(sv);
2398 Perl_croak(aTHX_
2399 "Can't return a %s from lvalue subroutine",
2400 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2401 }
2402 else
4bee03f8
FC		 2403 *++newsp =
2404 SvTEMP(*MARK)
2405 ? *MARK
2406 : sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
3bdf583b
FC		 2407 }
2408 }
2409 PL_stack_sp = newsp;
2410}
2411
a0d0e21e
LW		 2412PP(pp_return)
2413{
27da23d5 2414 dVAR; dSP; dMARK;
c09156bb 2415 register PERL_CONTEXT *cx;
f86702cc 2416 bool popsub2 = FALSE;
b45de488 2417 bool clear_errsv = FALSE;
fa1e92c4 2418 bool lval = FALSE;
a0d0e21e
LW		 2419 I32 gimme;
2420 SV **newsp;
2421 PMOP *newpm;
2422 I32 optype = 0;
b6494f15 2423 SV *namesv;
b0d9ce38 2424 SV *sv;
b263a1ad 2425 OP *retop = NULL;
a0d0e21e 2426
0bd48802
AL		 2427 const I32 cxix = dopoptosub(cxstack_ix);
2428
9850bf21
RH		 2429 if (cxix < 0) {
2430 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
2431 * sort block, which is a CXt_NULL
2432 * not a CXt_SUB */
2433 dounwind(0);
d7507f74
RH		 2434 PL_stack_base[1] = *PL_stack_sp;
2435 PL_stack_sp = PL_stack_base + 1;
a0d0e21e
LW		 2436 return 0;
2437 }
9850bf21
RH		 2438 else
2439 DIE(aTHX_ "Can't return outside a subroutine");
a0d0e21e 2440 }
a0d0e21e
LW		 2441 if (cxix < cxstack_ix)
2442 dounwind(cxix);
2443
d7507f74
RH		 2444 if (CxMULTICALL(&cxstack[cxix])) {
2445 gimme = cxstack[cxix].blk_gimme;
2446 if (gimme == G_VOID)
2447 PL_stack_sp = PL_stack_base;
2448 else if (gimme == G_SCALAR) {
2449 PL_stack_base[1] = *PL_stack_sp;
2450 PL_stack_sp = PL_stack_base + 1;
2451 }
9850bf21 2452 return 0;
d7507f74 2453 }
9850bf21 2454
a0d0e21e 2455 POPBLOCK(cx,newpm);
6b35e009 2456 switch (CxTYPE(cx)) {
a0d0e21e 2457 case CXt_SUB:
f86702cc 2458 popsub2 = TRUE;
fa1e92c4 2459 lval = !!CvLVALUE(cx->blk_sub.cv);
f39bc417 2460 retop = cx->blk_sub.retop;
5dd42e15 2461 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
a0d0e21e
LW		 2462 break;
2463 case CXt_EVAL:
b45de488
GS		 2464 if (!(PL_in_eval & EVAL_KEEPERR))
2465 clear_errsv = TRUE;
a0d0e21e 2466 POPEVAL(cx);
b6494f15 2467 namesv = cx->blk_eval.old_namesv;
f39bc417 2468 retop = cx->blk_eval.retop;
1d76a5c3
GS		 2469 if (CxTRYBLOCK(cx))
2470 break;
748a9306
LW		 2471 if (optype == OP_REQUIRE &&
2472 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
2473 {
54310121 2474 /* Unassume the success we assumed earlier. */
b6494f15 2475 (void)hv_delete(GvHVn(PL_incgv),
ecad31f0 2476 SvPVX_const(namesv),
c60dbbc3 2477 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
b6494f15
VP		 2478 G_DISCARD);
2479 DIE(aTHX_ "%"SVf" did not return a true value", SVfARG(namesv));
748a9306 2480 }
a0d0e21e 2481 break;
7766f137
GS		 2482 case CXt_FORMAT:
2483 POPFORMAT(cx);
f39bc417 2484 retop = cx->blk_sub.retop;
7766f137 2485 break;
a0d0e21e 2486 default:
cea2e8a9 2487 DIE(aTHX_ "panic: return");
a0d0e21e
LW		 2488 }
2489
a1f49e72 2490 TAINT_NOT;
d25b0d7b 2491 if (lval) S_return_lvalues(aTHX_ MARK, SP, newsp, gimme, cx, newpm);
3bdf583b
FC		 2492 else {
2493 if (gimme == G_SCALAR) {
a29cdaf0
IZ		 2494 if (MARK < SP) {
2495 if (popsub2) {
a8bba7fa 2496 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
3ed94dc0 2497 if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1) {
a29cdaf0
IZ		 2498 *++newsp = SvREFCNT_inc(*SP);
2499 FREETMPS;
2500 sv_2mortal(*newsp);
959e3673
GS		 2501 }
2502 else {
2503 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
a29cdaf0 2504 FREETMPS;
959e3673
GS		 2505 *++newsp = sv_mortalcopy(sv);
2506 SvREFCNT_dec(sv);
a29cdaf0 2507 }
959e3673 2508 }
3ed94dc0 2509 else if (SvTEMP(*SP) && SvREFCNT(*SP) == 1) {
767eda44 2510 *++newsp = *SP;
767eda44 2511 }
959e3673 2512 else
767eda44 2513 *++newsp = sv_mortalcopy(*SP);
959e3673
GS		 2514 }
2515 else
a29cdaf0 2516 *++newsp = sv_mortalcopy(*SP);
959e3673
GS		 2517 }
2518 else
3280af22 2519 *++newsp = &PL_sv_undef;
3bdf583b
FC		 2520 }
2521 else if (gimme == G_ARRAY) {
a1f49e72 2522 while (++MARK <= SP) {
3ed94dc0 2523 *++newsp = popsub2 && SvTEMP(*MARK) && SvREFCNT(*MARK) == 1
f86702cc 2524 ? *MARK : sv_mortalcopy(*MARK);
a1f49e72
CS		 2525 TAINT_NOT; /* Each item is independent */
2526 }
3bdf583b
FC		 2527 }
2528 PL_stack_sp = newsp;
a0d0e21e 2529 }
a0d0e21e 2530
5dd42e15 2531 LEAVE;
f86702cc 2532 /* Stack values are safe: */
2533 if (popsub2) {
5dd42e15 2534 cxstack_ix--;
b0d9ce38 2535 POPSUB(cx,sv); /* release CV and @_ ... */
f86702cc 2536 }
b0d9ce38 2537 else
c445ea15 2538 sv = NULL;
3280af22 2539 PL_curpm = newpm; /* ... and pop $1 et al */
f86702cc 2540
b0d9ce38 2541 LEAVESUB(sv);
8433848b 2542 if (clear_errsv) {
ab69dbc2 2543 CLEAR_ERRSV();
8433848b 2544 }
f39bc417 2545 return retop;
a0d0e21e
LW		 2546}
2547
4f443c3d
FC		 2548/* This duplicates parts of pp_leavesub, so that it can share code with
2549 * pp_return */
2550PP(pp_leavesublv)
2551{
2552 dVAR; dSP;
4f443c3d
FC		 2553 SV **newsp;
2554 PMOP *newpm;
2555 I32 gimme;
2556 register PERL_CONTEXT *cx;
2557 SV *sv;
2558
2559 if (CxMULTICALL(&cxstack[cxstack_ix]))
2560 return 0;
2561
2562 POPBLOCK(cx,newpm);
2563 cxstack_ix++; /* temporarily protect top context */
4f443c3d
FC		 2564
2565 TAINT_NOT;
2566
0d235c77 2567 S_return_lvalues(aTHX_ newsp, SP, newsp, gimme, cx, newpm);
4f443c3d
FC		 2568
2569 LEAVE;
2570 cxstack_ix--;
2571 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2572 PL_curpm = newpm; /* ... and pop $1 et al */
2573
2574 LEAVESUB(sv);
2575 return cx->blk_sub.retop;
2576}
2577
a0d0e21e
LW		 2578PP(pp_last)
2579{
27da23d5 2580 dVAR; dSP;
a0d0e21e 2581 I32 cxix;
c09156bb 2582 register PERL_CONTEXT *cx;
f86702cc 2583 I32 pop2 = 0;
a0d0e21e 2584 I32 gimme;
8772537c 2585 I32 optype;
b263a1ad 2586 OP *nextop = NULL;
a0d0e21e
LW		 2587 SV **newsp;
2588 PMOP *newpm;
a8bba7fa 2589 SV **mark;
c445ea15 2590 SV *sv = NULL;
9d4ba2ae 2591
a0d0e21e 2592
533c011a 2593 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e
LW		 2594 cxix = dopoptoloop(cxstack_ix);
2595 if (cxix < 0)
a651a37d 2596 DIE(aTHX_ "Can't \"last\" outside a loop block");
a0d0e21e
LW		 2597 }
2598 else {
2599 cxix = dopoptolabel(cPVOP->op_pv);
2600 if (cxix < 0)
cea2e8a9 2601 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
a0d0e21e
LW		 2602 }
2603 if (cxix < cxstack_ix)
2604 dounwind(cxix);
2605
2606 POPBLOCK(cx,newpm);
5dd42e15 2607 cxstack_ix++; /* temporarily protect top context */
a8bba7fa 2608 mark = newsp;
6b35e009 2609 switch (CxTYPE(cx)) {
c6fdafd0 2610 case CXt_LOOP_LAZYIV:
d01136d6 2611 case CXt_LOOP_LAZYSV:
3b719c58
NC		 2612 case CXt_LOOP_FOR:
2613 case CXt_LOOP_PLAIN:
2614 pop2 = CxTYPE(cx);
a8bba7fa 2615 newsp = PL_stack_base + cx->blk_loop.resetsp;
022eaa24 2616 nextop = cx->blk_loop.my_op->op_lastop->op_next;
a0d0e21e 2617 break;
f86702cc 2618 case CXt_SUB:
f86702cc 2619 pop2 = CXt_SUB;
f39bc417 2620 nextop = cx->blk_sub.retop;
a0d0e21e 2621 break;
f86702cc 2622 case CXt_EVAL:
2623 POPEVAL(cx);
f39bc417 2624 nextop = cx->blk_eval.retop;
a0d0e21e 2625 break;
7766f137
GS		 2626 case CXt_FORMAT:
2627 POPFORMAT(cx);
f39bc417 2628 nextop = cx->blk_sub.retop;
7766f137 2629 break;
a0d0e21e 2630 default:
cea2e8a9 2631 DIE(aTHX_ "panic: last");
a0d0e21e
LW		 2632 }
2633
a1f49e72 2634 TAINT_NOT;
b9d76716
VP		 2635 SP = adjust_stack_on_leave(newsp, SP, MARK, gimme,
2636 pop2 == CXt_SUB ? SVs_TEMP : 0);
f86702cc 2637 PUTBACK;
2638
5dd42e15
DM		 2639 LEAVE;
2640 cxstack_ix--;
f86702cc 2641 /* Stack values are safe: */
2642 switch (pop2) {
c6fdafd0 2643 case CXt_LOOP_LAZYIV:
3b719c58 2644 case CXt_LOOP_PLAIN:
d01136d6 2645 case CXt_LOOP_LAZYSV:
3b719c58 2646 case CXt_LOOP_FOR:
a8bba7fa 2647 POPLOOP(cx); /* release loop vars ... */
4fdae800 2648 LEAVE;
f86702cc 2649 break;
2650 case CXt_SUB:
b0d9ce38 2651 POPSUB(cx,sv); /* release CV and @_ ... */
f86702cc 2652 break;
a0d0e21e 2653 }
3280af22 2654 PL_curpm = newpm; /* ... and pop $1 et al */
a0d0e21e 2655
b0d9ce38 2656 LEAVESUB(sv);
9d4ba2ae
AL		 2657 PERL_UNUSED_VAR(optype);
2658 PERL_UNUSED_VAR(gimme);
f86702cc 2659 return nextop;
a0d0e21e
LW		 2660}
2661
2662PP(pp_next)
2663{
27da23d5 2664 dVAR;
a0d0e21e 2665 I32 cxix;
c09156bb 2666 register PERL_CONTEXT *cx;
85538317 2667 I32 inner;
a0d0e21e 2668
533c011a 2669 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e
LW		 2670 cxix = dopoptoloop(cxstack_ix);
2671 if (cxix < 0)
a651a37d 2672 DIE(aTHX_ "Can't \"next\" outside a loop block");
a0d0e21e
LW		 2673 }
2674 else {
2675 cxix = dopoptolabel(cPVOP->op_pv);
2676 if (cxix < 0)
cea2e8a9 2677 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
a0d0e21e
LW		 2678 }
2679 if (cxix < cxstack_ix)
2680 dounwind(cxix);
2681
85538317
GS		 2682 /* clear off anything above the scope we're re-entering, but
2683 * save the rest until after a possible continue block */
2684 inner = PL_scopestack_ix;
1ba6ee2b 2685 TOPBLOCK(cx);
85538317
GS		 2686 if (PL_scopestack_ix < inner)
2687 leave_scope(PL_scopestack[PL_scopestack_ix]);
3a1b2b9e 2688 PL_curcop = cx->blk_oldcop;
d57ce4df 2689 return (cx)->blk_loop.my_op->op_nextop;
a0d0e21e
LW		 2690}
2691
2692PP(pp_redo)
2693{
27da23d5 2694 dVAR;
a0d0e21e 2695 I32 cxix;
c09156bb 2696 register PERL_CONTEXT *cx;
a0d0e21e 2697 I32 oldsave;
a034e688 2698 OP* redo_op;
a0d0e21e 2699
533c011a 2700 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e
LW		 2701 cxix = dopoptoloop(cxstack_ix);
2702 if (cxix < 0)
a651a37d 2703 DIE(aTHX_ "Can't \"redo\" outside a loop block");
a0d0e21e
LW		 2704 }
2705 else {
2706 cxix = dopoptolabel(cPVOP->op_pv);
2707 if (cxix < 0)
cea2e8a9 2708 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
a0d0e21e
LW		 2709 }
2710 if (cxix < cxstack_ix)
2711 dounwind(cxix);
2712
022eaa24 2713 redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
a034e688
DM		 2714 if (redo_op->op_type == OP_ENTER) {
2715 /* pop one less context to avoid $x being freed in while (my $x..) */
2716 cxstack_ix++;
2717 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2718 redo_op = redo_op->op_next;
2719 }
2720
a0d0e21e 2721 TOPBLOCK(cx);
3280af22 2722 oldsave = PL_scopestack[PL_scopestack_ix - 1];
a0d0e21e 2723 LEAVE_SCOPE(oldsave);
936c78b5 2724 FREETMPS;
3a1b2b9e 2725 PL_curcop = cx->blk_oldcop;
a034e688 2726 return redo_op;
a0d0e21e
LW		 2727}
2728
0824fdcb 2729STATIC OP *
bfed75c6 2730S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
a0d0e21e 2731{
97aff369 2732 dVAR;
a0d0e21e 2733 OP **ops = opstack;
bfed75c6 2734 static const char too_deep[] = "Target of goto is too deeply nested";
a0d0e21e 2735
7918f24d
NC		 2736 PERL_ARGS_ASSERT_DOFINDLABEL;
2737
fc36a67e 2738 if (ops >= oplimit)
cea2e8a9 2739 Perl_croak(aTHX_ too_deep);
11343788
MB		 2740 if (o->op_type == OP_LEAVE ||
2741 o->op_type == OP_SCOPE ||
2742 o->op_type == OP_LEAVELOOP ||
33d34e4c 2743 o->op_type == OP_LEAVESUB ||
11343788 2744 o->op_type == OP_LEAVETRY)
fc36a67e 2745 {
5dc0d613 2746 *ops++ = cUNOPo->op_first;
fc36a67e 2747 if (ops >= oplimit)
cea2e8a9 2748 Perl_croak(aTHX_ too_deep);
fc36a67e 2749 }
c4aa4e48 2750 *ops = 0;
11343788 2751 if (o->op_flags & OPf_KIDS) {
aec46f14 2752 OP *kid;
a0d0e21e 2753 /* First try all the kids at this level, since that's likeliest. */
11343788 2754 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
7e8f1eac
AD		 2755 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2756 const char *kid_label = CopLABEL(kCOP);
2757 if (kid_label && strEQ(kid_label, label))
2758 return kid;
2759 }
a0d0e21e 2760 }
11343788 2761 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
3280af22 2762 if (kid == PL_lastgotoprobe)
a0d0e21e 2763 continue;
ed8d0fe2
SM		 2764 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2765 if (ops == opstack)
2766 *ops++ = kid;
2767 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2768 ops[-1]->op_type == OP_DBSTATE)
2769 ops[-1] = kid;
2770 else
2771 *ops++ = kid;
2772 }
155aba94 2773 if ((o = dofindlabel(kid, label, ops, oplimit)))
11343788 2774 return o;
a0d0e21e
LW		 2775 }
2776 }
c4aa4e48 2777 *ops = 0;
a0d0e21e
LW		 2778 return 0;
2779}
2780
a0d0e21e
LW		 2781PP(pp_goto)
2782{
27da23d5 2783 dVAR; dSP;
cbbf8932 2784 OP *retop = NULL;
a0d0e21e 2785 I32 ix;
c09156bb 2786 register PERL_CONTEXT *cx;
fc36a67e 2787#define GOTO_DEPTH 64
2788 OP *enterops[GOTO_DEPTH];
cbbf8932 2789 const char *label = NULL;
bfed75c6
AL		 2790 const bool do_dump = (PL_op->op_type == OP_DUMP);
2791 static const char must_have_label[] = "goto must have label";
a0d0e21e 2792
533c011a 2793 if (PL_op->op_flags & OPf_STACKED) {
9d4ba2ae 2794 SV * const sv = POPs;
a0d0e21e
LW		 2795
2796 /* This egregious kludge implements goto &subroutine */
2797 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2798 I32 cxix;
c09156bb 2799 register PERL_CONTEXT *cx;
ea726b52 2800 CV *cv = MUTABLE_CV(SvRV(sv));
a0d0e21e
LW		 2801 SV** mark;
2802 I32 items = 0;
2803 I32 oldsave;
b1464ded 2804 bool reified = 0;
a0d0e21e 2805
e8f7dd13 2806 retry:
4aa0a1f7 2807 if (!CvROOT(cv) && !CvXSUB(cv)) {
7fc63493 2808 const GV * const gv = CvGV(cv);
e8f7dd13 2809 if (gv) {
7fc63493 2810 GV *autogv;
e8f7dd13
GS		 2811 SV *tmpstr;
2812 /* autoloaded stub? */
2813 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2814 goto retry;
c271df94
BF		 2815 autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv),
2816 GvNAMELEN(gv),
2817 GvNAMEUTF8(gv) ? SVf_UTF8 : 0);
e8f7dd13
GS		 2818 if (autogv && (cv = GvCV(autogv)))
2819 goto retry;
2820 tmpstr = sv_newmortal();
c445ea15 2821 gv_efullname3(tmpstr, gv, NULL);
be2597df 2822 DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr));
4aa0a1f7 2823 }
cea2e8a9 2824 DIE(aTHX_ "Goto undefined subroutine");
4aa0a1f7
AD		 2825 }
2826
a0d0e21e 2827 /* First do some returnish stuff. */
b37c2d43 2828 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
71fc2216 2829 FREETMPS;
a0d0e21e
LW		 2830 cxix = dopoptosub(cxstack_ix);
2831 if (cxix < 0)
cea2e8a9 2832 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
a0d0e21e
LW		 2833 if (cxix < cxstack_ix)
2834 dounwind(cxix);
2835 TOPBLOCK(cx);
2d43a17f 2836 SPAGAIN;
564abe23 2837 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2d43a17f 2838 if (CxTYPE(cx) == CXt_EVAL) {
c74ace89
DM		 2839 if (CxREALEVAL(cx))
2840 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2841 else
2842 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2d43a17f 2843 }
9850bf21
RH		 2844 else if (CxMULTICALL(cx))
2845 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
bafb2adc 2846 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
d8b46c1b 2847 /* put @_ back onto stack */
a0d0e21e 2848 AV* av = cx->blk_sub.argarray;
bfed75c6 2849
93965878 2850 items = AvFILLp(av) + 1;
a45cdc79
DM		 2851 EXTEND(SP, items+1); /* @_ could have been extended. */
2852 Copy(AvARRAY(av), SP + 1, items, SV*);
3280af22
NIS		 2853 SvREFCNT_dec(GvAV(PL_defgv));
2854 GvAV(PL_defgv) = cx->blk_sub.savearray;
b1464ded 2855 CLEAR_ARGARRAY(av);
d8b46c1b 2856 /* abandon @_ if it got reified */
62b1ebc2 2857 if (AvREAL(av)) {
b1464ded
DM		 2858 reified = 1;
2859 SvREFCNT_dec(av);
d8b46c1b
GS		 2860 av = newAV();
2861 av_extend(av, items-1);
11ca45c0 2862 AvREIFY_only(av);
ad64d0ec 2863 PAD_SVl(0) = MUTABLE_SV(cx->blk_sub.argarray = av);
62b1ebc2 2864 }
a0d0e21e 2865 }
aed2304a 2866 else if (CvISXSUB(cv)) { /* put GvAV(defgv) back onto stack */
890ce7af 2867 AV* const av = GvAV(PL_defgv);
1fa4e549 2868 items = AvFILLp(av) + 1;
a45cdc79
DM		 2869 EXTEND(SP, items+1); /* @_ could have been extended. */
2870 Copy(AvARRAY(av), SP + 1, items, SV*);
1fa4e549 2871 }
a45cdc79
DM		 2872 mark = SP;
2873 SP += items;
6b35e009 2874 if (CxTYPE(cx) == CXt_SUB &&
b150fb22 2875 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
a0d0e21e 2876 SvREFCNT_dec(cx->blk_sub.cv);
3280af22 2877 oldsave = PL_scopestack[PL_scopestack_ix - 1];
a0d0e21e
LW		 2878 LEAVE_SCOPE(oldsave);
2879
1d59c038
FC		 2880 /* A destructor called during LEAVE_SCOPE could have undefined
2881 * our precious cv. See bug #99850. */
2882 if (!CvROOT(cv) && !CvXSUB(cv)) {
2883 const GV * const gv = CvGV(cv);
2884 if (gv) {
2885 SV * const tmpstr = sv_newmortal();
2886 gv_efullname3(tmpstr, gv, NULL);
2887 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",
2888 SVfARG(tmpstr));
2889 }
2890 DIE(aTHX_ "Goto undefined subroutine");
2891 }
2892
a0d0e21e
LW		 2893 /* Now do some callish stuff. */
2894 SAVETMPS;
5023d17a 2895 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
aed2304a 2896 if (CvISXSUB(cv)) {
b37c2d43 2897 OP* const retop = cx->blk_sub.retop;
9d63fa07
KW		 2898 SV **newsp PERL_UNUSED_DECL;
2899 I32 gimme PERL_UNUSED_DECL;
b1464ded
DM		 2900 if (reified) {
2901 I32 index;
2902 for (index=0; index<items; index++)
2903 sv_2mortal(SP[-index]);
2904 }
1fa4e549 2905
b37c2d43
AL		 2906 /* XS subs don't have a CxSUB, so pop it */
2907 POPBLOCK(cx, PL_curpm);
2908 /* Push a mark for the start of arglist */
2909 PUSHMARK(mark);
2910 PUTBACK;
2911 (void)(*CvXSUB(cv))(aTHX_ cv);
a57c6685 2912 LEAVE;
5eff7df7 2913 return retop;
a0d0e21e
LW		 2914 }
2915 else {
b37c2d43 2916 AV* const padlist = CvPADLIST(cv);
6b35e009 2917 if (CxTYPE(cx) == CXt_EVAL) {
85a64632 2918 PL_in_eval = CxOLD_IN_EVAL(cx);
3280af22 2919 PL_eval_root = cx->blk_eval.old_eval_root;
b150fb22 2920 cx->cx_type = CXt_SUB;
b150fb22 2921 }
a0d0e21e 2922 cx->blk_sub.cv = cv;
1a5b3db4 2923 cx->blk_sub.olddepth = CvDEPTH(cv);
dd2155a4 2924
a0d0e21e
LW		 2925 CvDEPTH(cv)++;
2926 if (CvDEPTH(cv) < 2)
74c765eb 2927 SvREFCNT_inc_simple_void_NN(cv);
dd2155a4 2928 else {
2b9dff67 2929 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION))
44a8e56a 2930 sub_crush_depth(cv);
26019298 2931 pad_push(padlist, CvDEPTH(cv));
a0d0e21e 2932 }
426a09cd 2933 PL_curcop = cx->blk_oldcop;
fd617465
DM		 2934 SAVECOMPPAD();
2935 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
bafb2adc 2936 if (CxHASARGS(cx))
6d4ff0d2 2937 {
502c6561 2938 AV *const av = MUTABLE_AV(PAD_SVl(0));
a0d0e21e 2939
3280af22 2940 cx->blk_sub.savearray = GvAV(PL_defgv);
502c6561 2941 GvAV(PL_defgv) = MUTABLE_AV(SvREFCNT_inc_simple(av));
dd2155a4 2942 CX_CURPAD_SAVE(cx->blk_sub);
6d4ff0d2 2943 cx->blk_sub.argarray = av;
a0d0e21e
LW		 2944
2945 if (items >= AvMAX(av) + 1) {
b37c2d43 2946 SV **ary = AvALLOC(av);
a0d0e21e
LW		 2947 if (AvARRAY(av) != ary) {
2948 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
9c6bc640 2949 AvARRAY(av) = ary;
a0d0e21e
LW		 2950 }
2951 if (items >= AvMAX(av) + 1) {
2952 AvMAX(av) = items - 1;
2953 Renew(ary,items+1,SV*);
2954 AvALLOC(av) = ary;
9c6bc640 2955 AvARRAY(av) = ary;
a0d0e21e
LW		 2956 }
2957 }
a45cdc79 2958 ++mark;
a0d0e21e 2959 Copy(mark,AvARRAY(av),items,SV*);
93965878 2960 AvFILLp(av) = items - 1;
d8b46c1b 2961 assert(!AvREAL(av));
b1464ded
DM		 2962 if (reified) {
2963 /* transfer 'ownership' of refcnts to new @_ */
2964 AvREAL_on(av);
2965 AvREIFY_off(av);
2966 }
a0d0e21e
LW		 2967 while (items--) {
2968 if (*mark)
2969 SvTEMP_off(*mark);
2970 mark++;
2971 }
2972 }
491527d0 2973 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
005a8a35 2974 Perl_get_db_sub(aTHX_ NULL, cv);
b37c2d43 2975 if (PERLDB_GOTO) {
b96d8cd9 2976 CV * const gotocv = get_cvs("DB::goto", 0);
b37c2d43
AL		 2977 if (gotocv) {
2978 PUSHMARK( PL_stack_sp );
ad64d0ec 2979 call_sv(MUTABLE_SV(gotocv), G_SCALAR | G_NODEBUG);
b37c2d43
AL		 2980 PL_stack_sp--;
2981 }
491527d0 2982 }
1ce6579f 2983 }
a0d0e21e
LW		 2984 RETURNOP(CvSTART(cv));
2985 }
2986 }
1614b0e3 2987 else {
0510663f 2988 label = SvPV_nolen_const(sv);
1614b0e3 2989 if (!(do_dump || *label))
cea2e8a9 2990 DIE(aTHX_ must_have_label);
1614b0e3 2991 }
a0d0e21e 2992 }
533c011a 2993 else if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e 2994 if (! do_dump)
cea2e8a9 2995 DIE(aTHX_ must_have_label);
a0d0e21e
LW		 2996 }
2997 else
2998 label = cPVOP->op_pv;
2999
f410a211
NC		 3000 PERL_ASYNC_CHECK();
3001
a0d0e21e 3002 if (label && *label) {
cbbf8932 3003 OP *gotoprobe = NULL;
3b2447bc 3004 bool leaving_eval = FALSE;
33d34e4c 3005 bool in_block = FALSE;
cbbf8932 3006 PERL_CONTEXT *last_eval_cx = NULL;
a0d0e21e
LW		 3007
3008 /* find label */
3009
d4c19fe8 3010 PL_lastgotoprobe = NULL;
a0d0e21e
LW		 3011 *enterops = 0;
3012 for (ix = cxstack_ix; ix >= 0; ix--) {
3013 cx = &cxstack[ix];
6b35e009 3014 switch (CxTYPE(cx)) {
a0d0e21e 3015 case CXt_EVAL:
3b2447bc 3016 leaving_eval = TRUE;
971ecbe6 3017 if (!CxTRYBLOCK(cx)) {
a4f3a277
RH		 3018 gotoprobe = (last_eval_cx ?
3019 last_eval_cx->blk_eval.old_eval_root :
3020 PL_eval_root);
3021 last_eval_cx = cx;
9c5794fe
RH		 3022 break;
3023 }
3024 /* else fall through */
c6fdafd0 3025 case CXt_LOOP_LAZYIV:
d01136d6 3026 case CXt_LOOP_LAZYSV:
3b719c58
NC		 3027 case CXt_LOOP_FOR:
3028 case CXt_LOOP_PLAIN:
bb5aedc1
VP		 3029 case CXt_GIVEN:
3030 case CXt_WHEN:
a0d0e21e
LW		 3031 gotoprobe = cx->blk_oldcop->op_sibling;
3032 break;
3033 case CXt_SUBST:
3034 continue;
3035 case CXt_BLOCK:
33d34e4c 3036 if (ix) {
a0d0e21e 3037 gotoprobe = cx->blk_oldcop->op_sibling;
33d34e4c
AE		 3038 in_block = TRUE;
3039 } else
3280af22 3040 gotoprobe = PL_main_root;
a0d0e21e 3041 break;
b3933176 3042 case CXt_SUB:
9850bf21 3043 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
b3933176
CS		 3044 gotoprobe = CvROOT(cx->blk_sub.cv);
3045 break;
3046 }
3047 /* FALL THROUGH */
7766f137 3048 case CXt_FORMAT:
0a753a76 3049 case CXt_NULL:
a651a37d 3050 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
a0d0e21e
LW		 3051 default:
3052 if (ix)
cea2e8a9 3053 DIE(aTHX_ "panic: goto");
3280af22 3054 gotoprobe = PL_main_root;
a0d0e21e
LW		 3055 break;
3056 }
2b597662
GS		 3057 if (gotoprobe) {
3058 retop = dofindlabel(gotoprobe, label,
3059 enterops, enterops + GOTO_DEPTH);
3060 if (retop)
3061 break;
eae48c89
Z		 3062 if (gotoprobe->op_sibling &&
3063 gotoprobe->op_sibling->op_type == OP_UNSTACK &&
3064 gotoprobe->op_sibling->op_sibling) {
3065 retop = dofindlabel(gotoprobe->op_sibling->op_sibling,
3066 label, enterops, enterops + GOTO_DEPTH);
3067 if (retop)
3068 break;
3069 }
2b597662 3070 }
3280af22 3071 PL_lastgotoprobe = gotoprobe;
a0d0e21e
LW		 3072 }
3073 if (!retop)
cea2e8a9 3074 DIE(aTHX_ "Can't find label %s", label);
a0d0e21e 3075
3b2447bc
RH		 3076 /* if we're leaving an eval, check before we pop any frames
3077 that we're not going to punt, otherwise the error
3078 won't be caught */
3079
3080 if (leaving_eval && *enterops && enterops[1]) {
3081 I32 i;
3082 for (i = 1; enterops[i]; i++)
3083 if (enterops[i]->op_type == OP_ENTERITER)
3084 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
3085 }
3086
b500e03b
GG		 3087 if (*enterops && enterops[1]) {
3088 I32 i = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3089 if (enterops[i])
3090 deprecate("\"goto\" to jump into a construct");
3091 }
3092
a0d0e21e
LW		 3093 /* pop unwanted frames */
3094
3095 if (ix < cxstack_ix) {
3096 I32 oldsave;
3097
3098 if (ix < 0)
3099 ix = 0;
3100 dounwind(ix);
3101 TOPBLOCK(cx);
3280af22 3102 oldsave = PL_scopestack[PL_scopestack_ix];
a0d0e21e
LW		 3103 LEAVE_SCOPE(oldsave);
3104 }
3105
3106 /* push wanted frames */
3107
748a9306 3108 if (*enterops && enterops[1]) {
0bd48802 3109 OP * const oldop = PL_op;
33d34e4c
AE		 3110 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3111 for (; enterops[ix]; ix++) {
533c011a 3112 PL_op = enterops[ix];
84902520
TB		 3113 /* Eventually we may want to stack the needed arguments
3114 * for each op. For now, we punt on the hard ones. */
533c011a 3115 if (PL_op->op_type == OP_ENTERITER)
894356b3 3116 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
16c91539 3117 PL_op->op_ppaddr(aTHX);
a0d0e21e 3118 }
533c011a 3119 PL_op = oldop;
a0d0e21e
LW		 3120 }
3121 }
3122
3123 if (do_dump) {
a5f75d66 3124#ifdef VMS
6b88bc9c 3125 if (!retop) retop = PL_main_start;
a5f75d66 3126#endif
3280af22
NIS		 3127 PL_restartop = retop;
3128 PL_do_undump = TRUE;
a0d0e21e
LW		 3129
3130 my_unexec();
3131
3280af22
NIS		 3132 PL_restartop = 0; /* hmm, must be GNU unexec().. */
3133 PL_do_undump = FALSE;
a0d0e21e
LW		 3134 }
3135
3136 RETURNOP(retop);
3137}
3138
3139PP(pp_exit)
3140{
97aff369 3141 dVAR;
39644a26 3142 dSP;
a0d0e21e
LW		 3143 I32 anum;
3144
3145 if (MAXARG < 1)
3146 anum = 0;
9d3c658e
FC		 3147 else if (!TOPs) {
3148 anum = 0; (void)POPs;
3149 }
ff0cee69 3150 else {
a0d0e21e 3151 anum = SvIVx(POPs);
d98f61e7
GS		 3152#ifdef VMS
3153 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
ff0cee69 3154 anum = 0;
96e176bf 3155 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
ff0cee69 3156#endif
3157 }
cc3604b1 3158 PL_exit_flags |= PERL_EXIT_EXPECTED;
81d86705
NC		 3159#ifdef PERL_MAD
3160 /* KLUDGE: disable exit 0 in BEGIN blocks when we're just compiling */
3161 if (anum || !(PL_minus_c && PL_madskills))
3162 my_exit(anum);
3163#else
a0d0e21e 3164 my_exit(anum);
81d86705 3165#endif
3280af22 3166 PUSHs(&PL_sv_undef);
a0d0e21e
LW		 3167 RETURN;
3168}
3169
a0d0e21e
LW		 3170/* Eval. */
3171
0824fdcb 3172STATIC void
cea2e8a9 3173S_save_lines(pTHX_ AV *array, SV *sv)
a0d0e21e 3174{
504618e9 3175 const char *s = SvPVX_const(sv);
890ce7af 3176 const char * const send = SvPVX_const(sv) + SvCUR(sv);
504618e9 3177 I32 line = 1;
a0d0e21e 3178
7918f24d
NC		 3179 PERL_ARGS_ASSERT_SAVE_LINES;
3180
a0d0e21e 3181 while (s && s < send) {
f54cb97a 3182 const char *t;
b9f83d2f 3183 SV * const tmpstr = newSV_type(SVt_PVMG);
a0d0e21e 3184
1d963ff3 3185 t = (const char *)memchr(s, '\n', send - s);
a0d0e21e
LW		 3186 if (t)
3187 t++;
3188 else
3189 t = send;
3190
3191 sv_setpvn(tmpstr, s, t - s);
3192 av_store(array, line++, tmpstr);
3193 s = t;
3194 }
3195}
3196
22f16304
RU		 3197/*
3198=for apidoc docatch
3199
3200Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context.
3201
32020 is used as continue inside eval,
3203
32043 is used for a die caught by an inner eval - continue inner loop
3205
3206See cop.h: je_mustcatch, when set at any runlevel to TRUE, means eval ops must
3207establish a local jmpenv to handle exception traps.
3208
3209=cut
3210*/
0824fdcb 3211STATIC OP *
cea2e8a9 3212S_docatch(pTHX_ OP *o)
1e422769 3213{
97aff369 3214 dVAR;
6224f72b 3215 int ret;
06b5626a 3216 OP * const oldop = PL_op;
db36c5a1 3217 dJMPENV;
1e422769 3218
1e422769 3219#ifdef DEBUGGING
54310121 3220 assert(CATCH_GET == TRUE);
1e422769 3221#endif
312caa8e 3222 PL_op = o;
8bffa5f8 3223
14dd3ad8 3224 JMPENV_PUSH(ret);
6224f72b 3225 switch (ret) {
312caa8e 3226 case 0:
abd70938
DM		 3227 assert(cxstack_ix >= 0);
3228 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3229 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
14dd3ad8 3230 redo_body:
85aaa934 3231 CALLRUNOPS(aTHX);
312caa8e
CS		 3232 break;
3233 case 3:
8bffa5f8 3234 /* die caught by an inner eval - continue inner loop */
febb3a6d
Z		 3235 if (PL_restartop && PL_restartjmpenv == PL_top_env) {
3236 PL_restartjmpenv = NULL;
312caa8e
CS		 3237 PL_op = PL_restartop;
3238 PL_restartop = 0;
3239 goto redo_body;
3240 }
3241 /* FALL THROUGH */
3242 default:
14dd3ad8 3243 JMPENV_POP;
533c011a 3244 PL_op = oldop;
6224f72b 3245 JMPENV_JUMP(ret);
1e422769 3246 /* NOTREACHED */
1e422769 3247 }
14dd3ad8 3248 JMPENV_POP;
533c011a 3249 PL_op = oldop;
5f66b61c 3250 return NULL;
1e422769 3251}
3252
ee23ad3b
NC		 3253/* James Bond: Do you expect me to talk?
3254 Auric Goldfinger: No, Mr. Bond. I expect you to die.
3255
3256 This code is an ugly hack, doesn't work with lexicals in subroutines that are
3257 called more than once, and is only used by regcomp.c, for (?{}) blocks.
3258
3259 Currently it is not used outside the core code. Best if it stays that way.
d59a8b3e
NC		 3260
3261 Hence it's now deprecated, and will be removed.
ee23ad3b 3262*/
c277df42 3263OP *
bfed75c6 3264Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
c277df42
IZ		 3265/* sv Text to convert to OP tree. */
3266/* startop op_free() this to undo. */
3267/* code Short string id of the caller. */
3268{
d59a8b3e
NC		 3269 PERL_ARGS_ASSERT_SV_COMPILE_2OP;
3270 return Perl_sv_compile_2op_is_broken(aTHX_ sv, startop, code, padp);
3271}
3272
3273/* Don't use this. It will go away without warning once the regexp engine is
3274 refactored not to use it. */
3275OP *
3276Perl_sv_compile_2op_is_broken(pTHX_ SV *sv, OP **startop, const char *code,
3277 PAD **padp)
3278{
27da23d5 3279 dVAR; dSP; /* Make POPBLOCK work. */
c277df42
IZ		 3280 PERL_CONTEXT *cx;
3281 SV **newsp;
b094c71d 3282 I32 gimme = G_VOID;
c277df42
IZ		 3283 I32 optype;
3284 OP dummy;
83ee9e09
GS		 3285 char tbuf[TYPE_DIGITS(long) + 12 + 10];
3286 char *tmpbuf = tbuf;
c277df42 3287 char *safestr;
a3985cdc 3288 int runtime;
601f1833 3289 CV* runcv = NULL; /* initialise to avoid compiler warnings */
f7997f86 3290 STRLEN len;
634d6919 3291 bool need_catch;
c277df42 3292
d59a8b3e 3293 PERL_ARGS_ASSERT_SV_COMPILE_2OP_IS_BROKEN;
7918f24d 3294
d343c3ef 3295 ENTER_with_name("eval");
27fcb6ee 3296 lex_start(sv, NULL, LEX_START_SAME_FILTER);
c277df42
IZ		 3297 SAVETMPS;
3298 /* switch to eval mode */
3299
923e4eb5 3300 if (IN_PERL_COMPILETIME) {
f4dd75d9 3301 SAVECOPSTASH_FREE(&PL_compiling);
11faa288 3302 CopSTASH_set(&PL_compiling, PL_curstash);
cbce877f 3303 }
83ee9e09 3304 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
9d4ba2ae 3305 SV * const sv = sv_newmortal();
83ee9e09
GS		 3306 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
3307 code, (unsigned long)++PL_evalseq,
3308 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3309 tmpbuf = SvPVX(sv);
fc009855 3310 len = SvCUR(sv);
83ee9e09
GS		 3311 }
3312 else
d9fad198
JH		 3313 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(%.10s_eval %lu)", code,
3314 (unsigned long)++PL_evalseq);
f4dd75d9 3315 SAVECOPFILE_FREE(&PL_compiling);
57843af0 3316 CopFILE_set(&PL_compiling, tmpbuf+2);
f4dd75d9 3317 SAVECOPLINE(&PL_compiling);
57843af0 3318 CopLINE_set(&PL_compiling, 1);
c277df42
IZ		 3319 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3320 deleting the eval's FILEGV from the stash before gv_check() runs
3321 (i.e. before run-time proper). To work around the coredump that
3322 ensues, we always turn GvMULTI_on for any globals that were
3323 introduced within evals. See force_ident(). GSAR 96-10-12 */
f7997f86
NC		 3324 safestr = savepvn(tmpbuf, len);
3325 SAVEDELETE(PL_defstash, safestr, len);
b3ac6de7 3326 SAVEHINTS();
d1ca3daa 3327#ifdef OP_IN_REGISTER
6b88bc9c 3328 PL_opsave = op;
d1ca3daa 3329#else
7766f137 3330 SAVEVPTR(PL_op);
d1ca3daa 3331#endif
c277df42 3332
a3985cdc 3333 /* we get here either during compilation, or via pp_regcomp at runtime */
923e4eb5 3334 runtime = IN_PERL_RUNTIME;
a3985cdc 3335 if (runtime)
558b4424 3336 {
d819b83a 3337 runcv = find_runcv(NULL);
a3985cdc 3338
558b4424
FC		 3339 /* At run time, we have to fetch the hints from PL_curcop. */
3340 PL_hints = PL_curcop->cop_hints;
3341 if (PL_hints & HINT_LOCALIZE_HH) {
3342 /* SAVEHINTS created a new HV in PL_hintgv, which we
3343 need to GC */
3344 SvREFCNT_dec(GvHV(PL_hintgv));
3345 GvHV(PL_hintgv) =
3346 refcounted_he_chain_2hv(PL_curcop->cop_hints_hash, 0);
3347 hv_magic(GvHV(PL_hintgv), NULL, PERL_MAGIC_hints);
3348 }
3349 SAVECOMPILEWARNINGS();
3350 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
3351 cophh_free(CopHINTHASH_get(&PL_compiling));
3352 /* XXX Does this need to avoid copying a label? */
3353 PL_compiling.cop_hints_hash
3354 = cophh_copy(PL_curcop->cop_hints_hash);
3355 }
3356
533c011a 3357 PL_op = &dummy;
13b51b79 3358 PL_op->op_type = OP_ENTEREVAL;
533c011a 3359 PL_op->op_flags = 0; /* Avoid uninit warning. */
923e4eb5 3360 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
6b75f042 3361 PUSHEVAL(cx, 0);
634d6919
GG		 3362 need_catch = CATCH_GET;
3363 CATCH_SET(TRUE);
a3985cdc
DM		 3364
3365 if (runtime)
f45b078d 3366 (void) doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq, NULL);
a3985cdc 3367 else
f45b078d 3368 (void) doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax, NULL);
634d6919 3369 CATCH_SET(need_catch);
13b51b79 3370 POPBLOCK(cx,PL_curpm);
e84b9f1f 3371 POPEVAL(cx);
c277df42
IZ		 3372
3373 (*startop)->op_type = OP_NULL;
22c35a8c 3374 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
f3548bdc 3375 /* XXX DAPM do this properly one year */
502c6561 3376 *padp = MUTABLE_AV(SvREFCNT_inc_simple(PL_comppad));
d343c3ef 3377 LEAVE_with_name("eval");
923e4eb5 3378 if (IN_PERL_COMPILETIME)
623e6609 3379 CopHINTS_set(&PL_compiling, PL_hints);
d1ca3daa 3380#ifdef OP_IN_REGISTER
6b88bc9c 3381 op = PL_opsave;
d1ca3daa 3382#endif
9d4ba2ae
AL		 3383 PERL_UNUSED_VAR(newsp);
3384 PERL_UNUSED_VAR(optype);
3385
410be5db 3386 return PL_eval_start;
c277df42
IZ		 3387}
3388
a3985cdc
DM		 3389
3390/*
3391=for apidoc find_runcv
3392
3393Locate the CV corresponding to the currently executing sub or eval.
d819b83a
DM		 3394If db_seqp is non_null, skip CVs that are in the DB package and populate
3395*db_seqp with the cop sequence number at the point that the DB:: code was
3396entered. (allows debuggers to eval in the scope of the breakpoint rather
cf525c36 3397than in the scope of the debugger itself).
a3985cdc
DM		 3398
3399=cut
3400*/
3401
3402CV*
d819b83a 3403Perl_find_runcv(pTHX_ U32 *db_seqp)
a3985cdc 3404{
97aff369 3405 dVAR;
a3985cdc 3406 PERL_SI *si;
a3985cdc 3407
d819b83a
DM		 3408 if (db_seqp)
3409 *db_seqp = PL_curcop->cop_seq;
a3985cdc 3410 for (si = PL_curstackinfo; si; si = si->si_prev) {
06b5626a 3411 I32 ix;
a3985cdc 3412 for (ix = si->si_cxix; ix >= 0; ix--) {
06b5626a 3413 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
d819b83a 3414 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1b6737cc 3415 CV * const cv = cx->blk_sub.cv;
d819b83a
DM		 3416 /* skip DB:: code */
3417 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
3418 *db_seqp = cx->blk_oldcop->cop_seq;
3419 continue;
3420 }
3421 return cv;
3422 }
a3985cdc 3423 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
676a678a 3424 return cx->blk_eval.cv;
a3985cdc
DM		 3425 }
3426 }
3427 return PL_main_cv;
3428}
3429
3430
27e90453
DM		 3431/* Run yyparse() in a setjmp wrapper. Returns:
3432 * 0: yyparse() successful
3433 * 1: yyparse() failed
3434 * 3: yyparse() died
3435 */
3436STATIC int
28ac2b49 3437S_try_yyparse(pTHX_ int gramtype)
27e90453
DM		 3438{
3439 int ret;
3440 dJMPENV;
3441
3442 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3443 JMPENV_PUSH(ret);
3444 switch (ret) {
3445 case 0:
28ac2b49 3446 ret = yyparse(gramtype) ? 1 : 0;
27e90453
DM		 3447 break;
3448 case 3:
3449 break;
3450 default:
3451 JMPENV_POP;
3452 JMPENV_JUMP(ret);
3453 /* NOTREACHED */
3454 }
3455 JMPENV_POP;
3456 return ret;
3457}
3458
3459
a3985cdc
DM		 3460/* Compile a require/do, an eval '', or a /(?{...})/.
3461 * In the last case, startop is non-null, and contains the address of
3462 * a pointer that should be set to the just-compiled code.
3463 * outside is the lexically enclosing CV (if any) that invoked us.
410be5db
DM		 3464 * Returns a bool indicating whether the compile was successful; if so,
3465 * PL_eval_start contains the first op of the compiled ocde; otherwise,
3466 * pushes undef (also croaks if startop != NULL).
a3985cdc
DM		 3467 */
3468
7d116edc
FC		 3469/* This function is called from three places, sv_compile_2op, pp_return
3470 * and pp_entereval. These can be distinguished as follows:
3471 * sv_compile_2op - startop is non-null
3472 * pp_require - startop is null; in_require is true
3473 * pp_entereval - stortop is null; in_require is false
3474 */
3475
410be5db 3476STATIC bool
f45b078d 3477S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq, HV *hh)
a0d0e21e 3478{
27da23d5 3479 dVAR; dSP;
46c461b5 3480 OP * const saveop = PL_op;
f45b078d 3481 COP * const oldcurcop = PL_curcop;
27e90453
DM		 3482 bool in_require = (saveop && saveop->op_type == OP_REQUIRE);
3483 int yystatus;
676a678a 3484 CV *evalcv;
a0d0e21e 3485
27e90453 3486 PL_in_eval = (in_require
6dc8a9e4
IZ		 3487 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
3488 : EVAL_INEVAL);
a0d0e21e 3489
1ce6579f 3490 PUSHMARK(SP);
3491
676a678a
Z		 3492 evalcv = MUTABLE_CV(newSV_type(SVt_PVCV));
3493 CvEVAL_on(evalcv);
2090ab20 3494 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
676a678a 3495 cxstack[cxstack_ix].blk_eval.cv = evalcv;
86a64801 3496 cxstack[cxstack_ix].blk_gimme = gimme;
2090ab20 3497
676a678a
Z		 3498 CvOUTSIDE_SEQ(evalcv) = seq;
3499 CvOUTSIDE(evalcv) = MUTABLE_CV(SvREFCNT_inc_simple(outside));
a3985cdc 3500
dd2155a4 3501 /* set up a scratch pad */
a0d0e21e 3502
676a678a 3503 CvPADLIST(evalcv) = pad_new(padnew_SAVE);
cecbe010 3504 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
2c05e328 3505
07055b4c 3506
81d86705 3507 if (!PL_madskills)
676a678a 3508 SAVEMORTALIZESV(evalcv); /* must remain until end of current statement */
748a9306 3509
a0d0e21e
LW		 3510 /* make sure we compile in the right package */
3511
ed094faf 3512 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
03d9f026
FC		 3513 SAVEGENERICSV(PL_curstash);
3514 PL_curstash = (HV *)SvREFCNT_inc_simple(CopSTASH(PL_curcop));
a0d0e21e 3515 }
3c10abe3 3516 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
3280af22
NIS		 3517 SAVESPTR(PL_beginav);
3518 PL_beginav = newAV();
3519 SAVEFREESV(PL_beginav);
3c10abe3
AG		 3520 SAVESPTR(PL_unitcheckav);
3521 PL_unitcheckav = newAV();
3522 SAVEFREESV(PL_unitcheckav);
a0d0e21e 3523
81d86705 3524#ifdef PERL_MAD
9da243ce 3525 SAVEBOOL(PL_madskills);
81d86705
NC		 3526 PL_madskills = 0;
3527#endif
3528
676a678a
Z		 3529 if (!startop) ENTER_with_name("evalcomp");
3530 SAVESPTR(PL_compcv);
3531 PL_compcv = evalcv;
3532
a0d0e21e
LW		 3533 /* try to compile it */
3534
5f66b61c 3535 PL_eval_root = NULL;
3280af22 3536 PL_curcop = &PL_compiling;
5f66b61c 3537 if (saveop && (saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
faef0170 3538 PL_in_eval |= EVAL_KEEPERR;
ab69dbc2
RGS		 3539 else
3540 CLEAR_ERRSV();
27e90453 3541
f45b078d 3542 if (!startop) {
f45b078d
FC		 3543 SAVEHINTS();
3544 if (in_require) {
3545 PL_hints = 0;
3546 hv_clear(GvHV(PL_hintgv));
3547 }
3548 else {
3549 PL_hints = saveop->op_private & OPpEVAL_COPHH
3550 ? oldcurcop->cop_hints : saveop->op_targ;
3551 if (hh) {
3552 /* SAVEHINTS created a new HV in PL_hintgv, which we need to GC */
3553 SvREFCNT_dec(GvHV(PL_hintgv));
3554 GvHV(PL_hintgv) = hh;
3555 }
3556 }
3557 SAVECOMPILEWARNINGS();
3558 if (in_require) {
3559 if (PL_dowarn & G_WARN_ALL_ON)
3560 PL_compiling.cop_warnings = pWARN_ALL ;
3561 else if (PL_dowarn & G_WARN_ALL_OFF)
3562 PL_compiling.cop_warnings = pWARN_NONE ;
3563 else
3564 PL_compiling.cop_warnings = pWARN_STD ;
3565 }
3566 else {
3567 PL_compiling.cop_warnings =
3568 DUP_WARNINGS(oldcurcop->cop_warnings);
3569 cophh_free(CopHINTHASH_get(&PL_compiling));
3570 if (Perl_cop_fetch_label(aTHX_ oldcurcop, NULL, NULL)) {
3571 /* The label, if present, is the first entry on the chain. So rather
3572 than writing a blank label in front of it (which involves an
3573 allocation), just use the next entry in the chain. */
3574 PL_compiling.cop_hints_hash
3575 = cophh_copy(oldcurcop->cop_hints_hash->refcounted_he_next);
3576 /* Check the assumption that this removed the label. */
3577 assert(Perl_cop_fetch_label(aTHX_ &PL_compiling, NULL, NULL) == NULL);
3578 }
3579 else
3580 PL_compiling.cop_hints_hash = cophh_copy(oldcurcop->cop_hints_hash);
3581 }
3582 }
3583
a88d97bf 3584 CALL_BLOCK_HOOKS(bhk_eval, saveop);
52db365a 3585
27e90453
DM		 3586 /* note that yyparse() may raise an exception, e.g. C<BEGIN{die}>,
3587 * so honour CATCH_GET and trap it here if necessary */
3588
28ac2b49 3589 yystatus = (!in_require && CATCH_GET) ? S_try_yyparse(aTHX_ GRAMPROG) : yyparse(GRAMPROG);
27e90453
DM		 3590
3591 if (yystatus || PL_parser->error_count || !PL_eval_root) {
0c58d367 3592 SV **newsp; /* Used by POPBLOCK. */
d164302a 3593 PERL_CONTEXT *cx;
27e90453 3594 I32 optype; /* Used by POPEVAL. */
d164302a 3595 SV *namesv;
bfed75c6 3596
d164302a
GG		 3597 cx = NULL;
3598 namesv = NULL;
27e90453
DM		 3599 PERL_UNUSED_VAR(newsp);
3600 PERL_UNUSED_VAR(optype);
3601
c86ffc32
DM		 3602 /* note that if yystatus == 3, then the EVAL CX block has already
3603 * been popped, and various vars restored */
533c011a 3604 PL_op = saveop;
27e90453 3605 if (yystatus != 3) {
c86ffc32
DM		 3606 if (PL_eval_root) {
3607 op_free(PL_eval_root);
3608 PL_eval_root = NULL;
3609 }
27e90453
DM		 3610 SP = PL_stack_base + POPMARK; /* pop original mark */
3611 if (!startop) {
3612 POPBLOCK(cx,PL_curpm);
3613 POPEVAL(cx);
b6494f15 3614 namesv = cx->blk_eval.old_namesv;
27e90453 3615 }
bbde7ba3 3616 /* POPBLOCK renders LEAVE_with_name("evalcomp") unnecessary. */
27e90453 3617 LEAVE_with_name("eval"); /* pp_entereval knows about this LEAVE. */
cd6472fc 3618 }
9d4ba2ae 3619
27e90453 3620 if (in_require) {
b6494f15
VP		 3621 if (!cx) {
3622 /* If cx is still NULL, it means that we didn't go in the
3623 * POPEVAL branch. */
3624 cx = &cxstack[cxstack_ix];
3625 assert(CxTYPE(cx) == CXt_EVAL);
3626 namesv = cx->blk_eval.old_namesv;
3627 }
3628 (void)hv_store(GvHVn(PL_incgv),
ecad31f0 3629 SvPVX_const(namesv),
c60dbbc3 3630 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
b6494f15 3631 &PL_sv_undef, 0);
ecad31f0
BF		 3632 Perl_croak(aTHX_ "%"SVf"Compilation failed in require",
3633 SVfARG(ERRSV
3634 ? ERRSV
3635 : newSVpvs_flags("Unknown error\n", SVs_TEMP)));
5a844595
GS		 3636 }
3637 else if (startop) {
27e90453
DM		 3638 if (yystatus != 3) {
3639 POPBLOCK(cx,PL_curpm);
3640 POPEVAL(cx);
3641 }
ecad31f0
BF		 3642 Perl_croak(aTHX_ "%"SVf"Compilation failed in regexp",
3643 SVfARG(ERRSV
3644 ? ERRSV
3645 : newSVpvs_flags("Unknown error\n", SVs_TEMP)));
7a2e2cd6 3646 }
9d7f88dd 3647 else {
ecad31f0 3648 if (!*(SvPVx_nolen_const(ERRSV))) {
6502358f 3649 sv_setpvs(ERRSV, "Compilation error");
9d7f88dd
SR		 3650 }
3651 }
2bf54cc6 3652 if (gimme != G_ARRAY) PUSHs(&PL_sv_undef);
410be5db
DM		 3653 PUTBACK;
3654 return FALSE;
a0d0e21e 3655 }
bbde7ba3 3656 else if (!startop) LEAVE_with_name("evalcomp");
57843af0 3657 CopLINE_set(&PL_compiling, 0);
c277df42 3658 if (startop) {
3280af22 3659 *startop = PL_eval_root;
c277df42 3660 } else
3280af22 3661 SAVEFREEOP(PL_eval_root);
0c58d367 3662
a0d0e21e
LW		 3663 DEBUG_x(dump_eval());
3664
55497cff 3665 /* Register with debugger: */
6482a30d 3666 if (PERLDB_INTER && saveop && saveop->op_type == OP_REQUIRE) {
b96d8cd9 3667 CV * const cv = get_cvs("DB::postponed", 0);
55497cff 3668 if (cv) {
3669 dSP;
924508f0 3670 PUSHMARK(SP);
ad64d0ec 3671 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
55497cff 3672 PUTBACK;
ad64d0ec 3673 call_sv(MUTABLE_SV(cv), G_DISCARD);
55497cff 3674 }
3675 }
3676
8ed49485
FC		 3677 if (PL_unitcheckav) {
3678 OP *es = PL_eval_start;
3c10abe3 3679 call_list(PL_scopestack_ix, PL_unitcheckav);
8ed49485
FC		 3680 PL_eval_start = es;
3681 }
3c10abe3 3682
a0d0e21e
LW		 3683 /* compiled okay, so do it */
3684
676a678a 3685 CvDEPTH(evalcv) = 1;
3280af22 3686 SP = PL_stack_base + POPMARK; /* pop original mark */
533c011a 3687 PL_op = saveop; /* The caller may need it. */
bc177e6b 3688 PL_parser->lex_state = LEX_NOTPARSING; /* $^S needs this. */
5dc0d613 3689
410be5db
DM		 3690 PUTBACK;
3691 return TRUE;
a0d0e21e
LW		 3692}
3693
a6c40364 3694STATIC PerlIO *
282b29ee 3695S_check_type_and_open(pTHX_ SV *name)
ce8abf5f
SP		 3696{
3697 Stat_t st;
282b29ee
NC		 3698 const char *p = SvPV_nolen_const(name);
3699 const int st_rc = PerlLIO_stat(p, &st);
df528165 3700
7918f24d
NC		 3701 PERL_ARGS_ASSERT_CHECK_TYPE_AND_OPEN;
3702
6b845e56 3703 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
4608196e 3704 return NULL;
ce8abf5f
SP		 3705 }
3706
ccb84406 3707#if !defined(PERLIO_IS_STDIO) && !defined(USE_SFIO)
639dfab0 3708 return PerlIO_openn(aTHX_ ":", PERL_SCRIPT_MODE, -1, 0, 0, NULL, 1, &name);
ccb84406 3709#else
282b29ee 3710 return PerlIO_open(p, PERL_SCRIPT_MODE);
ccb84406 3711#endif
ce8abf5f
SP		 3712}
3713
75c20bac 3714#ifndef PERL_DISABLE_PMC
ce8abf5f 3715STATIC PerlIO *
282b29ee 3716S_doopen_pm(pTHX_ SV *name)
b295d113 3717{
282b29ee
NC		 3718 STRLEN namelen;
3719 const char *p = SvPV_const(name, namelen);
b295d113 3720
7918f24d
NC		 3721 PERL_ARGS_ASSERT_DOOPEN_PM;
3722
282b29ee 3723 if (namelen > 3 && memEQs(p + namelen - 3, 3, ".pm")) {
eb70bb4a 3724 SV *const pmcsv = sv_newmortal();
a6c40364 3725 Stat_t pmcstat;
50b8ed39 3726
eb70bb4a 3727 SvSetSV_nosteal(pmcsv,name);
282b29ee 3728 sv_catpvn(pmcsv, "c", 1);
50b8ed39 3729
282b29ee
NC		 3730 if (PerlLIO_stat(SvPV_nolen_const(pmcsv), &pmcstat) >= 0)
3731 return check_type_and_open(pmcsv);
a6c40364 3732 }
282b29ee 3733 return check_type_and_open(name);
75c20bac 3734}
7925835c 3735#else
282b29ee 3736# define doopen_pm(name) check_type_and_open(name)
7925835c 3737#endif /* !PERL_DISABLE_PMC */
b295d113 3738
a0d0e21e
LW		 3739PP(pp_require)
3740{
27da23d5 3741 dVAR; dSP;
c09156bb 3742 register PERL_CONTEXT *cx;
a0d0e21e 3743 SV *sv;
5c144d81 3744 const char *name;
6132ea6c 3745 STRLEN len;
4492be7a
JM		 3746 char * unixname;
3747 STRLEN unixlen;
62f5ad7a 3748#ifdef VMS
4492be7a 3749 int vms_unixname = 0;
62f5ad7a 3750#endif
c445ea15
AL		 3751 const char *tryname = NULL;
3752 SV *namesv = NULL;
f54cb97a 3753 const I32 gimme = GIMME_V;
bbed91b5 3754 int filter_has_file = 0;
c445ea15 3755 PerlIO *tryrsfp = NULL;
34113e50 3756 SV *filter_cache = NULL;
c445ea15
AL		 3757 SV *filter_state = NULL;
3758 SV *filter_sub = NULL;
3759 SV *hook_sv = NULL;
6ec9efec
JH		 3760 SV *encoding;
3761 OP *op;
a0d0e21e
LW		 3762
3763 sv = POPs;
d7aa5382 3764 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
d086148c 3765 sv = sv_2mortal(new_version(sv));
d7aa5382 3766 if (!sv_derived_from(PL_patchlevel, "version"))
ac0e6a2f 3767 upg_version(PL_patchlevel, TRUE);
149c1637 3768 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3cacfbb9 3769 if ( vcmp(sv,PL_patchlevel) <= 0 )
468aa647 3770 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
e753e3b1
FC		 3771 SVfARG(sv_2mortal(vnormal(sv))),
3772 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3773 );
468aa647
RGS		 3774 }
3775 else {
d1029faa
JP		 3776 if ( vcmp(sv,PL_patchlevel) > 0 ) {
3777 I32 first = 0;
3778 AV *lav;
3779 SV * const req = SvRV(sv);
85fbaab2 3780 SV * const pv = *hv_fetchs(MUTABLE_HV(req), "original", FALSE);
d1029faa
JP		 3781
3782 /* get the left hand term */
502c6561 3783 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(req), "version", FALSE)));
d1029faa
JP		 3784
3785 first = SvIV(*av_fetch(lav,0,0));
3786 if ( first > (int)PERL_REVISION /* probably 'use 6.0' */
85fbaab2 3787 || hv_exists(MUTABLE_HV(req), "qv", 2 ) /* qv style */
d1029faa
JP		 3788 || av_len(lav) > 1 /* FP with > 3 digits */
3789 || strstr(SvPVX(pv),".0") /* FP with leading 0 */
3790 ) {
3791 DIE(aTHX_ "Perl %"SVf" required--this is only "
9d056fb0
FC		 3792 "%"SVf", stopped",
3793 SVfARG(sv_2mortal(vnormal(req))),
3794 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3795 );
d1029faa
JP		 3796 }
3797 else { /* probably 'use 5.10' or 'use 5.8' */
af61dbfd 3798 SV *hintsv;
d1029faa
JP		 3799 I32 second = 0;
3800
3801 if (av_len(lav)>=1)
3802 second = SvIV(*av_fetch(lav,1,0));
3803
3804 second /= second >= 600 ? 100 : 10;
af61dbfd
NC		 3805 hintsv = Perl_newSVpvf(aTHX_ "v%d.%d.0",
3806 (int)first, (int)second);
d1029faa
JP		 3807 upg_version(hintsv, TRUE);
3808
3809 DIE(aTHX_ "Perl %"SVf" required (did you mean %"SVf"?)"
3810 "--this is only %"SVf", stopped",
1be7d6f3
FC		 3811 SVfARG(sv_2mortal(vnormal(req))),
3812 SVfARG(sv_2mortal(vnormal(sv_2mortal(hintsv)))),
3813 SVfARG(sv_2mortal(vnormal(PL_patchlevel)))
3814 );
d1029faa
JP		 3815 }
3816 }
468aa647 3817 }
d7aa5382 3818
7dfde25d 3819 RETPUSHYES;
a0d0e21e 3820 }
5c144d81 3821 name = SvPV_const(sv, len);
6132ea6c 3822 if (!(name && len > 0 && *name))
cea2e8a9 3823 DIE(aTHX_ "Null filename used");
4633a7c4 3824 TAINT_PROPER("require");
4492be7a
JM		 3825
3826
3827#ifdef VMS
3828 /* The key in the %ENV hash is in the syntax of file passed as the argument
3829 * usually this is in UNIX format, but sometimes in VMS format, which
3830 * can result in a module being pulled in more than once.
3831 * To prevent this, the key must be stored in UNIX format if the VMS
3832 * name can be translated to UNIX.
3833 */
3834 if ((unixname = tounixspec(name, NULL)) != NULL) {
3835 unixlen = strlen(unixname);
3836 vms_unixname = 1;
3837 }
3838 else
3839#endif
3840 {
3841 /* if not VMS or VMS name can not be translated to UNIX, pass it
3842 * through.
3843 */
3844 unixname = (char *) name;
3845 unixlen = len;
3846 }
44f8325f 3847 if (PL_op->op_type == OP_REQUIRE) {
4492be7a
JM		 3848 SV * const * const svp = hv_fetch(GvHVn(PL_incgv),
3849 unixname, unixlen, 0);
44f8325f
AL		 3850 if ( svp ) {
3851 if (*svp != &PL_sv_undef)
3852 RETPUSHYES;
3853 else
087b5369
RD		 3854 DIE(aTHX_ "Attempt to reload %s aborted.\n"
3855 "Compilation failed in require", unixname);
44f8325f 3856 }
4d8b06f1 3857 }
a0d0e21e
LW		 3858
3859 /* prepare to compile file */
3860
be4b629d 3861 if (path_is_absolute(name)) {
282b29ee 3862 /* At this point, name is SvPVX(sv) */
46fc3d4c 3863 tryname = name;
282b29ee 3864 tryrsfp = doopen_pm(sv);
bf4acbe4 3865 }
be4b629d 3866 if (!tryrsfp) {
44f8325f 3867 AV * const ar = GvAVn(PL_incgv);
a0d0e21e 3868 I32 i;
748a9306 3869#ifdef VMS
4492be7a 3870 if (vms_unixname)
46fc3d4c 3871#endif
3872 {
d0328fd7 3873 namesv = newSV_type(SVt_PV);
46fc3d4c 3874 for (i = 0; i <= AvFILL(ar); i++) {
df528165 3875 SV * const dirsv = *av_fetch(ar, i, TRUE);
bbed91b5 3876
ad64d0ec 3877 if (SvTIED_mg((const SV *)ar, PERL_MAGIC_tied))
c38a6530 3878 mg_get(dirsv);
bbed91b5
KF		 3879 if (SvROK(dirsv)) {
3880 int count;
a3b58a99 3881 SV **svp;
bbed91b5
KF		 3882 SV *loader = dirsv;
3883
e14e2dc8
NC		 3884 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3885 && !sv_isobject(loader))
3886 {
502c6561 3887 loader = *av_fetch(MUTABLE_AV(SvRV(loader)), 0, TRUE);
bbed91b5
KF		 3888 }
3889
b900a521 3890 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
44f0be63 3891 PTR2UV(SvRV(dirsv)), name);
349d4f2f 3892 tryname = SvPVX_const(namesv);
c445ea15 3893 tryrsfp = NULL;
bbed91b5 3894
d343c3ef 3895 ENTER_with_name("call_INC");
bbed91b5
KF		 3896 SAVETMPS;
3897 EXTEND(SP, 2);
3898
3899 PUSHMARK(SP);
3900 PUSHs(dirsv);
3901 PUSHs(sv);
3902 PUTBACK;
e982885c
NC		 3903 if (sv_isobject(loader))
3904 count = call_method("INC", G_ARRAY);
3905 else
3906 count = call_sv(loader, G_ARRAY);
bbed91b5
KF		 3907 SPAGAIN;
3908
3909 if (count > 0) {
3910 int i = 0;
3911 SV *arg;
3912
3913 SP -= count - 1;
3914 arg = SP[i++];
3915
34113e50
NC		 3916 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3917 && !isGV_with_GP(SvRV(arg))) {
3918 filter_cache = SvRV(arg);
74c765eb 3919 SvREFCNT_inc_simple_void_NN(filter_cache);
34113e50
NC		 3920
3921 if (i < count) {
3922 arg = SP[i++];
3923 }
3924 }
3925
6e592b3a 3926 if (SvROK(arg) && isGV_with_GP(SvRV(arg))) {
bbed91b5
KF		 3927 arg = SvRV(arg);
3928 }
3929
6e592b3a 3930 if (isGV_with_GP(arg)) {
159b6efe 3931 IO * const io = GvIO((const GV *)arg);
bbed91b5
KF		 3932
3933 ++filter_has_file;
3934
3935 if (io) {
3936 tryrsfp = IoIFP(io);
0f7de14d
NC		 3937 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3938 PerlIO_close(IoOFP(io));
bbed91b5 3939 }
0f7de14d
NC		 3940 IoIFP(io) = NULL;
3941 IoOFP(io) = NULL;
bbed91b5
KF		 3942 }
3943
3944 if (i < count) {
3945 arg = SP[i++];
3946 }
3947 }
3948
3949 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3950 filter_sub = arg;
74c765eb 3951 SvREFCNT_inc_simple_void_NN(filter_sub);
bbed91b5
KF		 3952
3953 if (i < count) {
3954 filter_state = SP[i];
b37c2d43 3955 SvREFCNT_inc_simple_void(filter_state);
bbed91b5 3956 }
34113e50 3957 }
bbed91b5 3958
34113e50
NC		 3959 if (!tryrsfp && (filter_cache || filter_sub)) {
3960 tryrsfp = PerlIO_open(BIT_BUCKET,
3961 PERL_SCRIPT_MODE);
bbed91b5 3962 }
1d06aecd 3963 SP--;
bbed91b5
KF		 3964 }
3965
3966 PUTBACK;
3967 FREETMPS;
d343c3ef 3968 LEAVE_with_name("call_INC");
bbed91b5 3969
c5f55552
NC		 3970 /* Adjust file name if the hook has set an %INC entry.
3971 This needs to happen after the FREETMPS above. */
3972 svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3973 if (svp)
3974 tryname = SvPV_nolen_const(*svp);
3975
bbed91b5 3976 if (tryrsfp) {
89ccab8c 3977 hook_sv = dirsv;
bbed91b5
KF		 3978 break;
3979 }
3980
3981 filter_has_file = 0;
34113e50
NC		 3982 if (filter_cache) {
3983 SvREFCNT_dec(filter_cache);
3984 filter_cache = NULL;
3985 }
bbed91b5
KF		 3986 if (filter_state) {
3987 SvREFCNT_dec(filter_state);
c445ea15 3988 filter_state = NULL;
bbed91b5
KF		 3989 }
3990 if (filter_sub) {
3991 SvREFCNT_dec(filter_sub);
c445ea15 3992 filter_sub = NULL;
bbed91b5
KF		 3993 }
3994 }
3995 else {
be4b629d 3996 if (!path_is_absolute(name)
be4b629d 3997 ) {
b640a14a
NC		 3998 const char *dir;
3999 STRLEN dirlen;
4000
4001 if (SvOK(dirsv)) {
4002 dir = SvPV_const(dirsv, dirlen);
4003 } else {
4004 dir = "";
4005 dirlen = 0;
4006 }
4007
e37778c2 4008#ifdef VMS
bbed91b5 4009 char *unixdir;
c445ea15 4010 if ((unixdir = tounixpath(dir, NULL)) == NULL)
bbed91b5
KF		 4011 continue;
4012 sv_setpv(namesv, unixdir);
4013 sv_catpv(namesv, unixname);
e37778c2
NC		 4014#else
4015# ifdef __SYMBIAN32__
27da23d5
JH		 4016 if (PL_origfilename[0] &&
4017 PL_origfilename[1] == ':' &&
4018 !(dir[0] && dir[1] == ':'))
4019 Perl_sv_setpvf(aTHX_ namesv,
4020 "%c:%s\\%s",
4021 PL_origfilename[0],
4022 dir, name);
4023 else
4024 Perl_sv_setpvf(aTHX_ namesv,
4025 "%s\\%s",
4026 dir, name);
e37778c2 4027# else
b640a14a
NC		 4028 /* The equivalent of
4029 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
4030 but without the need to parse the format string, or
4031 call strlen on either pointer, and with the correct
4032 allocation up front. */
4033 {
4034 char *tmp = SvGROW(namesv, dirlen + len + 2);
4035
4036 memcpy(tmp, dir, dirlen);
4037 tmp +=dirlen;
4038 *tmp++ = '/';
4039 /* name came from an SV, so it will have a '\0' at the
4040 end that we can copy as part of this memcpy(). */
4041 memcpy(tmp, name, len + 1);
4042
4043 SvCUR_set(namesv, dirlen + len + 1);
282b29ee 4044 SvPOK_on(namesv);
b640a14a 4045 }
27da23d5 4046# endif
bf4acbe4 4047#endif
bbed91b5 4048 TAINT_PROPER("require");
349d4f2f 4049 tryname = SvPVX_const(namesv);
282b29ee 4050 tryrsfp = doopen_pm(namesv);
bbed91b5 4051 if (tryrsfp) {
e63be746
RGS		 4052 if (tryname[0] == '.' && tryname[1] == '/') {
4053 ++tryname;
4054 while (*++tryname == '/');
4055 }
bbed91b5
KF		 4056 break;
4057 }
ff806af2
DM		 4058 else if (errno == EMFILE)
4059 /* no point in trying other paths if out of handles */
4060 break;
be4b629d 4061 }
46fc3d4c 4062 }
a0d0e21e
LW		 4063 }
4064 }
4065 }
b2ef6d44 4066 sv_2mortal(namesv);
a0d0e21e 4067 if (!tryrsfp) {
533c011a 4068 if (PL_op->op_type == OP_REQUIRE) {
e31de809 4069 if(errno == EMFILE) {
c9d5e35e
NC		 4070 /* diag_listed_as: Can't locate %s */
4071 DIE(aTHX_ "Can't locate %s: %s", name, Strerror(errno));
e31de809
SP		 4072 } else {
4073 if (namesv) { /* did we lookup @INC? */
44f8325f 4074 AV * const ar = GvAVn(PL_incgv);
e31de809 4075 I32 i;
c9d5e35e
NC		 4076 SV *const inc = newSVpvs_flags("", SVs_TEMP);
4077 for (i = 0; i <= AvFILL(ar); i++) {
4078 sv_catpvs(inc, " ");
4079 sv_catsv(inc, *av_fetch(ar, i, TRUE));
4080 }
4081
4082 /* diag_listed_as: Can't locate %s */
4083 DIE(aTHX_
4084 "Can't locate %s in @INC%s%s (@INC contains:%" SVf ")",
4085 name,
686c4ca0
NC		 4086 (memEQ(name + len - 2, ".h", 3)
4087 ? " (change .h to .ph maybe?) (did you run h2ph?)" : ""),
4088 (memEQ(name + len - 3, ".ph", 4)
c9d5e35e
NC		 4089 ? " (did you run h2ph?)" : ""),
4090 inc
4091 );
4092 }
2683423c 4093 }
c9d5e35e 4094 DIE(aTHX_ "Can't locate %s", name);
a0d0e21e
LW		 4095 }
4096
4097 RETPUSHUNDEF;
4098 }
d8bfb8bd 4099 else
93189314 4100 SETERRNO(0, SS_NORMAL);
a0d0e21e
LW		 4101
4102 /* Assume success here to prevent recursive requirement. */
238d24b4 4103 /* name is never assigned to again, so len is still strlen(name) */
d3a4e64e 4104 /* Check whether a hook in @INC has already filled %INC */
44f8325f 4105 if (!hook_sv) {
4492be7a 4106 (void)hv_store(GvHVn(PL_incgv),
b2ef6d44 4107 unixname, unixlen, newSVpv(tryname,0),0);
44f8325f 4108 } else {
4492be7a 4109 SV** const svp = hv_fetch(GvHVn(PL_incgv), unixname, unixlen, 0);
44f8325f 4110 if (!svp)
4492be7a
JM		 4111 (void)hv_store(GvHVn(PL_incgv),
4112 unixname, unixlen, SvREFCNT_inc_simple(hook_sv), 0 );
d3a4e64e 4113 }
a0d0e21e 4114
d343c3ef 4115 ENTER_with_name("eval");
a0d0e21e 4116 SAVETMPS;
b2ef6d44
FC		 4117 SAVECOPFILE_FREE(&PL_compiling);
4118 CopFILE_set(&PL_compiling, tryname);
8eaa0acf 4119 lex_start(NULL, tryrsfp, 0);
e50aee73 4120
34113e50 4121 if (filter_sub || filter_cache) {
4464f08e
NC		 4122 /* We can use the SvPV of the filter PVIO itself as our cache, rather
4123 than hanging another SV from it. In turn, filter_add() optionally
4124 takes the SV to use as the filter (or creates a new SV if passed
4125 NULL), so simply pass in whatever value filter_cache has. */
4126 SV * const datasv = filter_add(S_run_user_filter, filter_cache);
bbed91b5 4127 IoLINES(datasv) = filter_has_file;
159b6efe
NC		 4128 IoTOP_GV(datasv) = MUTABLE_GV(filter_state);
4129 IoBOTTOM_GV(datasv) = MUTABLE_GV(filter_sub);
bbed91b5
KF		 4130 }
4131
4132 /* switch to eval mode */
a0d0e21e 4133 PUSHBLOCK(cx, CXt_EVAL, SP);
6b75f042 4134 PUSHEVAL(cx, name);
f39bc417 4135 cx->blk_eval.retop = PL_op->op_next;
a0d0e21e 4136
57843af0
GS		 4137 SAVECOPLINE(&PL_compiling);
4138 CopLINE_set(&PL_compiling, 0);
a0d0e21e
LW		 4139
4140 PUTBACK;
6ec9efec
JH		 4141
4142 /* Store and reset encoding. */
4143 encoding = PL_encoding;
c445ea15 4144 PL_encoding = NULL;
6ec9efec 4145
f45b078d 4146 if (doeval(gimme, NULL, NULL, PL_curcop->cop_seq, NULL))
410be5db
DM		 4147 op = DOCATCH(PL_eval_start);
4148 else
4149 op = PL_op->op_next;
bfed75c6 4150
6ec9efec
JH		 4151 /* Restore encoding. */
4152 PL_encoding = encoding;
4153
4154 return op;
a0d0e21e
LW		 4155}
4156
996c9baa
VP		 4157/* This is a op added to hold the hints hash for
4158 pp_entereval. The hash can be modified by the code
4159 being eval'ed, so we return a copy instead. */
4160
4161PP(pp_hintseval)
4162{
4163 dVAR;
4164 dSP;
defdfed5 4165 mXPUSHs(MUTABLE_SV(hv_copy_hints_hv(MUTABLE_HV(cSVOP_sv))));
996c9baa
VP		 4166 RETURN;
4167}
4168
4169
a0d0e21e
LW		 4170PP(pp_entereval)
4171{
27da23d5 4172 dVAR; dSP;
c09156bb 4173 register PERL_CONTEXT *cx;
0d863452 4174 SV *sv;
890ce7af 4175 const I32 gimme = GIMME_V;
fd06b02c 4176 const U32 was = PL_breakable_sub_gen;
83ee9e09 4177 char tbuf[TYPE_DIGITS(long) + 12];
78da7625 4178 bool saved_delete = FALSE;
83ee9e09 4179 char *tmpbuf = tbuf;
a0d0e21e 4180 STRLEN len;
a3985cdc 4181 CV* runcv;
0abcdfa4 4182 U32 seq, lex_flags = 0;
c445ea15 4183 HV *saved_hh = NULL;
60d63348 4184 const bool bytes = PL_op->op_private & OPpEVAL_BYTES;
e389bba9 4185
0d863452 4186 if (PL_op->op_private & OPpEVAL_HAS_HH) {
85fbaab2 4187 saved_hh = MUTABLE_HV(SvREFCNT_inc(POPs));
0d863452 4188 }
bc344123
FC		 4189 else if (PL_hints & HINT_LOCALIZE_HH || (
4190 PL_op->op_private & OPpEVAL_COPHH
4191 && PL_curcop->cop_hints & HINT_LOCALIZE_HH
4192 )) {
7d789282
FC		 4193 saved_hh = cop_hints_2hv(PL_curcop, 0);
4194 hv_magic(saved_hh, NULL, PERL_MAGIC_hints);
4195 }
0d863452 4196 sv = POPs;
895b760f
DM		 4197 if (!SvPOK(sv)) {
4198 /* make sure we've got a plain PV (no overload etc) before testing
4199 * for taint. Making a copy here is probably overkill, but better
4200 * safe than sorry */
0479a84a
NC		 4201 STRLEN len;
4202 const char * const p = SvPV_const(sv, len);
4203
4204 sv = newSVpvn_flags(p, len, SVs_TEMP | SvUTF8(sv));
0abcdfa4 4205 lex_flags |= LEX_START_COPIED;
7d789282 4206
60d63348 4207 if (bytes && SvUTF8(sv))
7d789282
FC		 4208 SvPVbyte_force(sv, len);
4209 }
60d63348 4210 else if (bytes && SvUTF8(sv)) {
e1fa07e3 4211 /* Don't modify someone else's scalar */
7d789282
FC		 4212 STRLEN len;
4213 sv = newSVsv(sv);
5cefc8c1 4214 (void)sv_2mortal(sv);
7d789282 4215 SvPVbyte_force(sv,len);
0abcdfa4 4216 lex_flags |= LEX_START_COPIED;
895b760f 4217 }
a0d0e21e 4218
af2d3def 4219 TAINT_IF(SvTAINTED(sv));
748a9306 4220 TAINT_PROPER("eval");
a0d0e21e 4221
d343c3ef 4222 ENTER_with_name("eval");
0abcdfa4 4223 lex_start(sv, NULL, lex_flags | (PL_op->op_private & OPpEVAL_UNICODE
60d63348
FC		 4224 ? LEX_IGNORE_UTF8_HINTS
4225 : bytes ? LEX_EVALBYTES : LEX_START_SAME_FILTER
0abcdfa4 4226 )
60d63348 4227 );
748a9306 4228 SAVETMPS;
ac27b0f5 4229
a0d0e21e
LW		 4230 /* switch to eval mode */
4231
83ee9e09 4232 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
8b38226b
AL		 4233 SV * const temp_sv = sv_newmortal();
4234 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
83ee9e09
GS		 4235 (unsigned long)++PL_evalseq,
4236 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
8b38226b
AL		 4237 tmpbuf = SvPVX(temp_sv);
4238 len = SvCUR(temp_sv);
83ee9e09
GS		 4239 }
4240 else
d9fad198 4241 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
f4dd75d9 4242 SAVECOPFILE_FREE(&PL_compiling);
57843af0 4243 CopFILE_set(&PL_compiling, tmpbuf+2);
f4dd75d9 4244 SAVECOPLINE(&PL_compiling);
57843af0 4245 CopLINE_set(&PL_compiling, 1);
d819b83a
DM		 4246 /* special case: an eval '' executed within the DB package gets lexically
4247 * placed in the first non-DB CV rather than the current CV - this
4248 * allows the debugger to execute code, find lexicals etc, in the
4249 * scope of the code being debugged. Passing &seq gets find_runcv
4250 * to do the dirty work for us */
4251 runcv = find_runcv(&seq);
a0d0e21e 4252
6b35e009 4253 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
6b75f042 4254 PUSHEVAL(cx, 0);
f39bc417 4255 cx->blk_eval.retop = PL_op->op_next;
a0d0e21e
LW		 4256
4257 /* prepare to compile string */
4258
a44e3ce2 4259 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash)
bdc0bf6f 4260 save_lines(CopFILEAV(&PL_compiling), PL_parser->linestr);
78da7625 4261 else {
c8cb8d55
FC		 4262 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
4263 deleting the eval's FILEGV from the stash before gv_check() runs
4264 (i.e. before run-time proper). To work around the coredump that
4265 ensues, we always turn GvMULTI_on for any globals that were
4266 introduced within evals. See force_ident(). GSAR 96-10-12 */
78da7625
FC		 4267 char *const safestr = savepvn(tmpbuf, len);
4268 SAVEDELETE(PL_defstash, safestr, len);
4269 saved_delete = TRUE;
4270 }
4271
a0d0e21e 4272 PUTBACK;
f9bddea7 4273
f45b078d 4274 if (doeval(gimme, NULL, runcv, seq, saved_hh)) {
f9bddea7
NC		 4275 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4276 ? (PERLDB_LINE || PERLDB_SAVESRC)
4277 : PERLDB_SAVESRC_NOSUBS) {
4278 /* Retain the filegv we created. */
78da7625 4279 } else if (!saved_delete) {
f9bddea7
NC		 4280 char *const safestr = savepvn(tmpbuf, len);
4281 SAVEDELETE(PL_defstash, safestr, len);
4282 }
4283 return DOCATCH(PL_eval_start);
4284 } else {
486ec47a 4285 /* We have already left the scope set up earlier thanks to the LEAVE
f9bddea7 4286 in doeval(). */
eb044b10
NC		 4287 if (was != PL_breakable_sub_gen /* Some subs defined here. */
4288 ? (PERLDB_LINE || PERLDB_SAVESRC)
4289 : PERLDB_SAVESRC_INVALID) {
f9bddea7 4290 /* Retain the filegv we created. */
7857f360 4291 } else if (!saved_delete) {
f9bddea7
NC		 4292 (void)hv_delete(PL_defstash, tmpbuf, len, G_DISCARD);
4293 }
4294 return PL_op->op_next;
4295 }
a0d0e21e
LW		 4296}
4297
4298PP(pp_leaveeval)
4299{
27da23d5 4300 dVAR; dSP;
a0d0e21e
LW		 4301 SV **newsp;
4302 PMOP *newpm;
4303 I32 gimme;
c09156bb 4304 register PERL_CONTEXT *cx;
a0d0e21e 4305 OP *retop;
06b5626a 4306 const U8 save_flags = PL_op -> op_flags;
a0d0e21e 4307 I32 optype;
b6494f15 4308 SV *namesv;
676a678a 4309 CV *evalcv;
a0d0e21e 4310
011c3814 4311 PERL_ASYNC_CHECK();
a0d0e21e
LW		 4312 POPBLOCK(cx,newpm);
4313 POPEVAL(cx);
b6494f15 4314 namesv = cx->blk_eval.old_namesv;
f39bc417 4315 retop = cx->blk_eval.retop;
676a678a 4316 evalcv = cx->blk_eval.cv;
a0d0e21e 4317
a1f49e72 4318 TAINT_NOT;
b9d76716
VP		 4319 SP = adjust_stack_on_leave((gimme == G_VOID) ? SP : newsp, SP, newsp,
4320 gimme, SVs_TEMP);
3280af22 4321 PL_curpm = newpm; /* Don't pop $1 et al till now */
a0d0e21e 4322
4fdae800 4323#ifdef DEBUGGING
676a678a 4324 assert(CvDEPTH(evalcv) == 1);
4fdae800 4325#endif
676a678a 4326 CvDEPTH(evalcv) = 0;
4fdae800 4327
1ce6579f 4328 if (optype == OP_REQUIRE &&
924508f0 4329 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
54310121 4330 {
1ce6579f 4331 /* Unassume the success we assumed earlier. */
b6494f15 4332 (void)hv_delete(GvHVn(PL_incgv),
ecad31f0 4333 SvPVX_const(namesv),
c60dbbc3 4334 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
b6494f15
VP		 4335 G_DISCARD);
4336 retop = Perl_die(aTHX_ "%"SVf" did not return a true value",
4337 SVfARG(namesv));
c5df3096 4338 /* die_unwind() did LEAVE, or we won't be here */
f46d017c
GS		 4339 }
4340 else {
d343c3ef 4341 LEAVE_with_name("eval");
8433848b 4342 if (!(save_flags & OPf_SPECIAL)) {
ab69dbc2 4343 CLEAR_ERRSV();
8433848b 4344 }
a0d0e21e 4345 }
a0d0e21e
LW		 4346
4347 RETURNOP(retop);
4348}
4349
edb2152a
NC		 4350/* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
4351 close to the related Perl_create_eval_scope. */
4352void
4353Perl_delete_eval_scope(pTHX)
a0d0e21e 4354{
edb2152a
NC		 4355 SV **newsp;
4356 PMOP *newpm;
4357 I32 gimme;
c09156bb 4358 register PERL_CONTEXT *cx;
edb2152a
NC		 4359 I32 optype;
4360
4361 POPBLOCK(cx,newpm);
4362 POPEVAL(cx);
4363 PL_curpm = newpm;
d343c3ef 4364 LEAVE_with_name("eval_scope");
edb2152a
NC		 4365 PERL_UNUSED_VAR(newsp);
4366 PERL_UNUSED_VAR(gimme);
4367 PERL_UNUSED_VAR(optype);
4368}
a0d0e21e 4369
edb2152a
NC		 4370/* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
4371 also needed by Perl_fold_constants. */
4372PERL_CONTEXT *
4373Perl_create_eval_scope(pTHX_ U32 flags)
4374{
4375 PERL_CONTEXT *cx;
4376 const I32 gimme = GIMME_V;
4377
d343c3ef 4378 ENTER_with_name("eval_scope");
a0d0e21e
LW		 4379 SAVETMPS;
4380
edb2152a 4381 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), PL_stack_sp);
6b75f042 4382 PUSHEVAL(cx, 0);
a0d0e21e 4383
faef0170 4384 PL_in_eval = EVAL_INEVAL;
edb2152a
NC		 4385 if (flags & G_KEEPERR)
4386 PL_in_eval |= EVAL_KEEPERR;
ab69dbc2
RGS		 4387 else
4388 CLEAR_ERRSV();
edb2152a
NC		 4389 if (flags & G_FAKINGEVAL) {
4390 PL_eval_root = PL_op; /* Only needed so that goto works right. */
4391 }
4392 return cx;
4393}
4394
4395PP(pp_entertry)
4396{
4397 dVAR;
df528165 4398 PERL_CONTEXT * const cx = create_eval_scope(0);
edb2152a 4399 cx->blk_eval.retop = cLOGOP->op_other->op_next;
533c011a 4400 return DOCATCH(PL_op->op_next);
a0d0e21e
LW		 4401}
4402
4403PP(pp_leavetry)
4404{
27da23d5 4405 dVAR; dSP;
a0d0e21e
LW		 4406 SV **newsp;
4407 PMOP *newpm;
4408 I32 gimme;
c09156bb 4409 register PERL_CONTEXT *cx;
a0d0e21e
LW		 4410 I32 optype;
4411
011c3814 4412 PERL_ASYNC_CHECK();
a0d0e21e
LW		 4413 POPBLOCK(cx,newpm);
4414 POPEVAL(cx);
9d4ba2ae 4415 PERL_UNUSED_VAR(optype);
a0d0e21e 4416
a1f49e72 4417 TAINT_NOT;
b9d76716 4418 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
3280af22 4419 PL_curpm = newpm; /* Don't pop $1 et al till now */
a0d0e21e 4420
d343c3ef 4421 LEAVE_with_name("eval_scope");
ab69dbc2 4422 CLEAR_ERRSV();
745cf2ff 4423 RETURN;
a0d0e21e
LW		 4424}
4425
0d863452
RH		 4426PP(pp_entergiven)
4427{
4428 dVAR; dSP;
4429 register PERL_CONTEXT *cx;
4430 const I32 gimme = GIMME_V;
4431
d343c3ef 4432 ENTER_with_name("given");
0d863452
RH		 4433 SAVETMPS;
4434
87e4a53a 4435 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
f7010667 4436 sv_setsv_mg(PAD_SV(PL_op->op_targ), POPs);
0d863452
RH		 4437
4438 PUSHBLOCK(cx, CXt_GIVEN, SP);
4439 PUSHGIVEN(cx);
4440
4441 RETURN;
4442}
4443
4444PP(pp_leavegiven)
4445{
4446 dVAR; dSP;
4447 register PERL_CONTEXT *cx;
4448 I32 gimme;
4449 SV **newsp;
4450 PMOP *newpm;
96a5add6 4451 PERL_UNUSED_CONTEXT;
0d863452
RH		 4452
4453 POPBLOCK(cx,newpm);
4454 assert(CxTYPE(cx) == CXt_GIVEN);
0d863452 4455
25b991bf 4456 TAINT_NOT;
b9d76716 4457 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
25b991bf 4458 PL_curpm = newpm; /* Don't pop $1 et al till now */
0d863452 4459
d343c3ef 4460 LEAVE_with_name("given");
25b991bf 4461 RETURN;
0d863452
RH		 4462}
4463
4464/* Helper routines used by pp_smartmatch */
4136a0f7 4465STATIC PMOP *
84679df5 4466S_make_matcher(pTHX_ REGEXP *re)
0d863452 4467{
97aff369 4468 dVAR;
0d863452 4469 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
7918f24d
NC		 4470
4471 PERL_ARGS_ASSERT_MAKE_MATCHER;
4472
d6106309 4473 PM_SETRE(matcher, ReREFCNT_inc(re));
7918f24d 4474
0d863452 4475 SAVEFREEOP((OP *) matcher);
d343c3ef 4476 ENTER_with_name("matcher"); SAVETMPS;
0d863452
RH		 4477 SAVEOP();
4478 return matcher;
4479}
4480
4136a0f7 4481STATIC bool
0d863452
RH		 4482S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
4483{
97aff369 4484 dVAR;
0d863452 4485 dSP;
7918f24d
NC		 4486
4487 PERL_ARGS_ASSERT_MATCHER_MATCHES_SV;
0d863452
RH		 4488
4489 PL_op = (OP *) matcher;
4490 XPUSHs(sv);
4491 PUTBACK;
897d3989 4492 (void) Perl_pp_match(aTHX);
0d863452
RH		 4493 SPAGAIN;
4494 return (SvTRUEx(POPs));
4495}
4496
4136a0f7 4497STATIC void
0d863452
RH		 4498S_destroy_matcher(pTHX_ PMOP *matcher)
4499{
97aff369 4500 dVAR;
7918f24d
NC		 4501
4502 PERL_ARGS_ASSERT_DESTROY_MATCHER;
0d863452 4503 PERL_UNUSED_ARG(matcher);
7918f24d 4504
0d863452 4505 FREETMPS;
d343c3ef 4506 LEAVE_with_name("matcher");
0d863452
RH		 4507}
4508
4509/* Do a smart match */
4510PP(pp_smartmatch)
4511{
d7c0d282 4512 DEBUG_M(Perl_deb(aTHX_ "Starting smart match resolution\n"));
be88a5c3 4513 return do_smartmatch(NULL, NULL, 0);
0d863452
RH		 4514}
4515
4b021f5f
RGS		 4516/* This version of do_smartmatch() implements the
4517 * table of smart matches that is found in perlsyn.
0d863452 4518 */
4136a0f7 4519STATIC OP *
be88a5c3 4520S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other, const bool copied)
0d863452 4521{
97aff369 4522 dVAR;
0d863452
RH		 4523 dSP;
4524
41e726ac 4525 bool object_on_left = FALSE;
0d863452
RH		 4526 SV *e = TOPs; /* e is for 'expression' */
4527 SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */
a566f585 4528
6f1401dc
DM		 4529 /* Take care only to invoke mg_get() once for each argument.
4530 * Currently we do this by copying the SV if it's magical. */
4531 if (d) {
be88a5c3 4532 if (!copied && SvGMAGICAL(d))
6f1401dc
DM		 4533 d = sv_mortalcopy(d);
4534 }
4535 else
4536 d = &PL_sv_undef;
4537
4538 assert(e);
4539 if (SvGMAGICAL(e))
4540 e = sv_mortalcopy(e);
4541
2c9d2554 4542 /* First of all, handle overload magic of the rightmost argument */
6d743019 4543 if (SvAMAGIC(e)) {
d7c0d282
DM		 4544 SV * tmpsv;
4545 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n"));
4546 DEBUG_M(Perl_deb(aTHX_ " attempting overload\n"));
4547
4548 tmpsv = amagic_call(d, e, smart_amg, 0);
7c41e62e
RGS		 4549 if (tmpsv) {
4550 SPAGAIN;
4551 (void)POPs;
4552 SETs(tmpsv);
4553 RETURN;
4554 }
d7c0d282 4555 DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; continuing...\n"));
7c41e62e 4556 }
62ec5f58 4557
0d863452
RH		 4558 SP -= 2; /* Pop the values */
4559
0d863452 4560
b0138e99 4561 /* ~~ undef */
62ec5f58 4562 if (!SvOK(e)) {
d7c0d282 4563 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-undef\n"));
62ec5f58 4564 if (SvOK(d))
33570f8b
RGS		 4565 RETPUSHNO;
4566 else
62ec5f58 4567 RETPUSHYES;
33570f8b 4568 }
e67b97bd 4569
d7c0d282
DM		 4570 if (sv_isobject(e) && (SvTYPE(SvRV(e)) != SVt_REGEXP)) {
4571 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n"));
62ec5f58 4572 Perl_croak(aTHX_ "Smart matching a non-overloaded object breaks encapsulation");
d7c0d282 4573 }
41e726ac
RGS		 4574 if (sv_isobject(d) && (SvTYPE(SvRV(d)) != SVt_REGEXP))
4575 object_on_left = TRUE;
62ec5f58 4576
b0138e99 4577 /* ~~ sub */
a4a197da 4578 if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVCV) {
0d863452 4579 I32 c;
41e726ac
RGS		 4580 if (object_on_left) {
4581 goto sm_any_sub; /* Treat objects like scalars */
4582 }
4583 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
a4a197da
RGS		 4584 /* Test sub truth for each key */
4585 HE *he;
4586 bool andedresults = TRUE;
4587 HV *hv = (HV*) SvRV(d);
168ff818 4588 I32 numkeys = hv_iterinit(hv);
d7c0d282 4589 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-CodeRef\n"));
168ff818 4590 if (numkeys == 0)
07edf497 4591 RETPUSHYES;
a4a197da 4592 while ( (he = hv_iternext(hv)) ) {
d7c0d282 4593 DEBUG_M(Perl_deb(aTHX_ " testing hash key...\n"));
d343c3ef 4594 ENTER_with_name("smartmatch_hash_key_test");
a4a197da
RGS		 4595 SAVETMPS;
4596 PUSHMARK(SP);
4597 PUSHs(hv_iterkeysv(he));
4598 PUTBACK;
4599 c = call_sv(e, G_SCALAR);
4600 SPAGAIN;
4601 if (c == 0)
4602 andedresults = FALSE;
4603 else
4604 andedresults = SvTRUEx(POPs) && andedresults;
4605 FREETMPS;
d343c3ef 4606 LEAVE_with_name("smartmatch_hash_key_test");
a4a197da
RGS		 4607 }
4608 if (andedresults)
4609 RETPUSHYES;
4610 else
4611 RETPUSHNO;
4612 }
4613 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4614 /* Test sub truth for each element */
4615 I32 i;
4616 bool andedresults = TRUE;
4617 AV *av = (AV*) SvRV(d);
4618 const I32 len = av_len(av);
d7c0d282 4619 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-CodeRef\n"));
168ff818 4620 if (len == -1)
07edf497 4621 RETPUSHYES;
a4a197da
RGS		 4622 for (i = 0; i <= len; ++i) {
4623 SV * const * const svp = av_fetch(av, i, FALSE);
d7c0d282 4624 DEBUG_M(Perl_deb(aTHX_ " testing array element...\n"));
d343c3ef 4625 ENTER_with_name("smartmatch_array_elem_test");
a4a197da
RGS		 4626 SAVETMPS;
4627 PUSHMARK(SP);
4628 if (svp)
4629 PUSHs(*svp);
4630 PUTBACK;
4631 c = call_sv(e, G_SCALAR);
4632 SPAGAIN;
4633 if (c == 0)
4634 andedresults = FALSE;
4635 else
4636 andedresults = SvTRUEx(POPs) && andedresults;
4637 FREETMPS;
d343c3ef 4638 LEAVE_with_name("smartmatch_array_elem_test");
a4a197da
RGS		 4639 }
4640 if (andedresults)
4641 RETPUSHYES;
4642 else
4643 RETPUSHNO;
4644 }
4645 else {
41e726ac 4646 sm_any_sub:
d7c0d282 4647 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-CodeRef\n"));
d343c3ef 4648 ENTER_with_name("smartmatch_coderef");
a4a197da
RGS		 4649 SAVETMPS;
4650 PUSHMARK(SP);
4651 PUSHs(d);
4652 PUTBACK;
4653 c = call_sv(e, G_SCALAR);
4654 SPAGAIN;
4655 if (c == 0)
4656 PUSHs(&PL_sv_no);
4657 else if (SvTEMP(TOPs))
4658 SvREFCNT_inc_void(TOPs);
4659 FREETMPS;
d343c3ef 4660 LEAVE_with_name("smartmatch_coderef");
a4a197da
RGS		 4661 RETURN;
4662 }
0d863452 4663 }
b0138e99 4664 /* ~~ %hash */
61a621c6 4665 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVHV) {
41e726ac
RGS		 4666 if (object_on_left) {
4667 goto sm_any_hash; /* Treat objects like scalars */
4668 }
4669 else if (!SvOK(d)) {
d7c0d282 4670 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash ($a undef)\n"));
61a621c6
RGS		 4671 RETPUSHNO;
4672 }
4673 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
0d863452
RH		 4674 /* Check that the key-sets are identical */
4675 HE *he;
61a621c6 4676 HV *other_hv = MUTABLE_HV(SvRV(d));
0d863452
RH		 4677 bool tied = FALSE;
4678 bool other_tied = FALSE;
4679 U32 this_key_count = 0,
4680 other_key_count = 0;
33ed63a2 4681 HV *hv = MUTABLE_HV(SvRV(e));
d7c0d282
DM		 4682
4683 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Hash\n"));
0d863452 4684 /* Tied hashes don't know how many keys they have. */
33ed63a2 4685 if (SvTIED_mg((SV*)hv, PERL_MAGIC_tied)) {
0d863452
RH		 4686 tied = TRUE;
4687 }
ad64d0ec 4688 else if (SvTIED_mg((const SV *)other_hv, PERL_MAGIC_tied)) {
c445ea15 4689 HV * const temp = other_hv;
33ed63a2
RGS		 4690 other_hv = hv;
4691 hv = temp;
0d863452
RH		 4692 tied = TRUE;
4693 }
ad64d0ec 4694 if (SvTIED_mg((const SV *)other_hv, PERL_MAGIC_tied))
0d863452
RH		 4695 other_tied = TRUE;
4696
33ed63a2 4697 if (!tied && HvUSEDKEYS((const HV *) hv) != HvUSEDKEYS(other_hv))
0d863452
RH		 4698 RETPUSHNO;
4699
4700 /* The hashes have the same number of keys, so it suffices
4701 to check that one is a subset of the other. */
33ed63a2
RGS		 4702 (void) hv_iterinit(hv);
4703 while ( (he = hv_iternext(hv)) ) {
b15feb55 4704 SV *key = hv_iterkeysv(he);
d7c0d282
DM		 4705
4706 DEBUG_M(Perl_deb(aTHX_ " comparing hash key...\n"));
0d863452
RH		 4707 ++ this_key_count;
4708
b15feb55 4709 if(!hv_exists_ent(other_hv, key, 0)) {
33ed63a2 4710 (void) hv_iterinit(hv); /* reset iterator */
0d863452
RH		 4711 RETPUSHNO;
4712 }
4713 }
4714
4715 if (other_tied) {
4716 (void) hv_iterinit(other_hv);
4717 while ( hv_iternext(other_hv) )
4718 ++other_key_count;
4719 }
4720 else
4721 other_key_count = HvUSEDKEYS(other_hv);
4722
4723 if (this_key_count != other_key_count)
4724 RETPUSHNO;
4725 else
4726 RETPUSHYES;
4727 }
61a621c6
RGS		 4728 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4729 AV * const other_av = MUTABLE_AV(SvRV(d));
c445ea15 4730 const I32 other_len = av_len(other_av) + 1;
0d863452 4731 I32 i;
33ed63a2 4732 HV *hv = MUTABLE_HV(SvRV(e));
71b0fb34 4733
d7c0d282 4734 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Hash\n"));
71b0fb34 4735 for (i = 0; i < other_len; ++i) {
c445ea15 4736 SV ** const svp = av_fetch(other_av, i, FALSE);
d7c0d282 4737 DEBUG_M(Perl_deb(aTHX_ " checking for key existence...\n"));
71b0fb34 4738 if (svp) { /* ??? When can this not happen? */
b15feb55 4739 if (hv_exists_ent(hv, *svp, 0))
71b0fb34
DK		 4740 RETPUSHYES;
4741 }
0d863452 4742 }
71b0fb34 4743 RETPUSHNO;
0d863452 4744 }
a566f585 4745 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) {
d7c0d282 4746 DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Hash\n"));
ea0c2dbd
RGS		 4747 sm_regex_hash:
4748 {
4749 PMOP * const matcher = make_matcher((REGEXP*) SvRV(d));
4750 HE *he;
4751 HV *hv = MUTABLE_HV(SvRV(e));
4752
4753 (void) hv_iterinit(hv);
4754 while ( (he = hv_iternext(hv)) ) {
d7c0d282 4755 DEBUG_M(Perl_deb(aTHX_ " testing key against pattern...\n"));
ea0c2dbd
RGS		 4756 if (matcher_matches_sv(matcher, hv_iterkeysv(he))) {
4757 (void) hv_iterinit(hv);
4758 destroy_matcher(matcher);
4759 RETPUSHYES;
4760 }
0d863452 4761 }
ea0c2dbd
RGS		 4762 destroy_matcher(matcher);
4763 RETPUSHNO;
0d863452 4764 }
0d863452
RH		 4765 }
4766 else {
41e726ac 4767 sm_any_hash:
d7c0d282 4768 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash\n"));
61a621c6 4769 if (hv_exists_ent(MUTABLE_HV(SvRV(e)), d, 0))
0d863452
RH		 4770 RETPUSHYES;
4771 else
4772 RETPUSHNO;
4773 }
4774 }
b0138e99
RGS		 4775 /* ~~ @array */
4776 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVAV) {
41e726ac
RGS		 4777 if (object_on_left) {
4778 goto sm_any_array; /* Treat objects like scalars */
4779 }
4780 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
b0138e99
RGS		 4781 AV * const other_av = MUTABLE_AV(SvRV(e));
4782 const I32 other_len = av_len(other_av) + 1;
4783 I32 i;
4784
d7c0d282 4785 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Array\n"));
b0138e99
RGS		 4786 for (i = 0; i < other_len; ++i) {
4787 SV ** const svp = av_fetch(other_av, i, FALSE);
d7c0d282
DM		 4788
4789 DEBUG_M(Perl_deb(aTHX_ " testing for key existence...\n"));
b0138e99 4790 if (svp) { /* ??? When can this not happen? */
b15feb55 4791 if (hv_exists_ent(MUTABLE_HV(SvRV(d)), *svp, 0))
b0138e99
RGS		 4792 RETPUSHYES;
4793 }
4794 }
4795 RETPUSHNO;
4796 }
4797 if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4798 AV *other_av = MUTABLE_AV(SvRV(d));
d7c0d282 4799 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Array\n"));
b0138e99 4800 if (av_len(MUTABLE_AV(SvRV(e))) != av_len(other_av))
0d863452
RH		 4801 RETPUSHNO;
4802 else {
4803 I32 i;
c445ea15 4804 const I32 other_len = av_len(other_av);
0d863452 4805
a0714e2c 4806 if (NULL == seen_this) {
0d863452 4807 seen_this = newHV();
ad64d0ec 4808 (void) sv_2mortal(MUTABLE_SV(seen_this));
0d863452 4809 }
a0714e2c 4810 if (NULL == seen_other) {
6bc991bf 4811 seen_other = newHV();
ad64d0ec 4812 (void) sv_2mortal(MUTABLE_SV(seen_other));
0d863452
RH		 4813 }
4814 for(i = 0; i <= other_len; ++i) {
b0138e99 4815 SV * const * const this_elem = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
c445ea15
AL		 4816 SV * const * const other_elem = av_fetch(other_av, i, FALSE);
4817
0d863452 4818 if (!this_elem || !other_elem) {
69c3dccf
RGS		 4819 if ((this_elem && SvOK(*this_elem))
4820 || (other_elem && SvOK(*other_elem)))
0d863452
RH		 4821 RETPUSHNO;
4822 }
365c4e3d
RGS		 4823 else if (hv_exists_ent(seen_this,
4824 sv_2mortal(newSViv(PTR2IV(*this_elem))), 0) ||
4825 hv_exists_ent(seen_other,
4826 sv_2mortal(newSViv(PTR2IV(*other_elem))), 0))
0d863452
RH		 4827 {
4828 if (*this_elem != *other_elem)
4829 RETPUSHNO;
4830 }
4831 else {
04fe65b0
RGS		 4832 (void)hv_store_ent(seen_this,
4833 sv_2mortal(newSViv(PTR2IV(*this_elem))),
4834 &PL_sv_undef, 0);
4835 (void)hv_store_ent(seen_other,
4836 sv_2mortal(newSViv(PTR2IV(*other_elem))),
4837 &PL_sv_undef, 0);
0d863452 4838 PUSHs(*other_elem);
a566f585 4839 PUSHs(*this_elem);
0d863452
RH		 4840
4841 PUTBACK;
d7c0d282 4842 DEBUG_M(Perl_deb(aTHX_ " recursively comparing array element...\n"));
be88a5c3 4843 (void) do_smartmatch(seen_this, seen_other, 0);
0d863452 4844 SPAGAIN;
d7c0d282 4845 DEBUG_M(Perl_deb(aTHX_ " recursion finished\n"));
0d863452
RH		 4846
4847 if (!SvTRUEx(POPs))
4848 RETPUSHNO;
4849 }
4850 }
4851 RETPUSHYES;
4852 }
4853 }
a566f585 4854 else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) {
d7c0d282 4855 DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Array\n"));
ea0c2dbd
RGS		 4856 sm_regex_array:
4857 {
4858 PMOP * const matcher = make_matcher((REGEXP*) SvRV(d));
4859 const I32 this_len = av_len(MUTABLE_AV(SvRV(e)));
4860 I32 i;
0d863452 4861
ea0c2dbd
RGS		 4862 for(i = 0; i <= this_len; ++i) {
4863 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
d7c0d282 4864 DEBUG_M(Perl_deb(aTHX_ " testing element against pattern...\n"));
ea0c2dbd
RGS		 4865 if (svp && matcher_matches_sv(matcher, *svp)) {
4866 destroy_matcher(matcher);
4867 RETPUSHYES;
4868 }
0d863452 4869 }
ea0c2dbd
RGS		 4870 destroy_matcher(matcher);
4871 RETPUSHNO;
0d863452 4872 }
0d863452 4873 }
015eb7b9
RGS		 4874 else if (!SvOK(d)) {
4875 /* undef ~~ array */
4876 const I32 this_len = av_len(MUTABLE_AV(SvRV(e)));
0d863452
RH		 4877 I32 i;
4878
d7c0d282 4879 DEBUG_M(Perl_deb(aTHX_ " applying rule Undef-Array\n"));
015eb7b9 4880 for (i = 0; i <= this_len; ++i) {
b0138e99 4881 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
d7c0d282 4882 DEBUG_M(Perl_deb(aTHX_ " testing for undef element...\n"));
015eb7b9 4883 if (!svp || !SvOK(*svp))
0d863452
RH		 4884 RETPUSHYES;
4885 }
4886 RETPUSHNO;
4887 }
015eb7b9 4888 else {
41e726ac
RGS		 4889 sm_any_array:
4890 {
4891 I32 i;
4892 const I32 this_len = av_len(MUTABLE_AV(SvRV(e)));
0d863452 4893
d7c0d282 4894 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Array\n"));
41e726ac
RGS		 4895 for (i = 0; i <= this_len; ++i) {
4896 SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE);
4897 if (!svp)
4898 continue;
015eb7b9 4899
41e726ac
RGS		 4900 PUSHs(d);
4901 PUSHs(*svp);
4902 PUTBACK;
4903 /* infinite recursion isn't supposed to happen here */
d7c0d282 4904 DEBUG_M(Perl_deb(aTHX_ " recursively testing array element...\n"));
be88a5c3 4905 (void) do_smartmatch(NULL, NULL, 1);
41e726ac 4906 SPAGAIN;
d7c0d282 4907 DEBUG_M(Perl_deb(aTHX_ " recursion finished\n"));
41e726ac
RGS		 4908 if (SvTRUEx(POPs))
4909 RETPUSHYES;
4910 }
4911 RETPUSHNO;
0d863452 4912 }
0d863452
RH		 4913 }
4914 }
b0138e99 4915 /* ~~ qr// */
a566f585 4916 else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_REGEXP) {
ea0c2dbd
RGS		 4917 if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) {
4918 SV *t = d; d = e; e = t;
d7c0d282 4919 DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Regex\n"));
ea0c2dbd
RGS		 4920 goto sm_regex_hash;
4921 }
4922 else if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) {
4923 SV *t = d; d = e; e = t;
d7c0d282 4924 DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Regex\n"));
ea0c2dbd
RGS		 4925 goto sm_regex_array;
4926 }
4927 else {
4928 PMOP * const matcher = make_matcher((REGEXP*) SvRV(e));
0d863452 4929
d7c0d282 4930 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Regex\n"));
ea0c2dbd
RGS		 4931 PUTBACK;
4932 PUSHs(matcher_matches_sv(matcher, d)
4933 ? &PL_sv_yes
4934 : &PL_sv_no);
4935 destroy_matcher(matcher);
4936 RETURN;
4937 }
0d863452 4938 }
b0138e99 4939 /* ~~ scalar */
2c9d2554
RGS		 4940 /* See if there is overload magic on left */
4941 else if (object_on_left && SvAMAGIC(d)) {
4942 SV *tmpsv;
d7c0d282
DM		 4943 DEBUG_M(Perl_deb(aTHX_ " applying rule Object-Any\n"));
4944 DEBUG_M(Perl_deb(aTHX_ " attempting overload\n"));
2c9d2554
RGS		 4945 PUSHs(d); PUSHs(e);
4946 PUTBACK;
4947 tmpsv = amagic_call(d, e, smart_amg, AMGf_noright);
4948 if (tmpsv) {
4949 SPAGAIN;
4950 (void)POPs;
4951 SETs(tmpsv);
4952 RETURN;
4953 }
4954 SP -= 2;
d7c0d282 4955 DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; falling back...\n"));
2c9d2554
RGS		 4956 goto sm_any_scalar;
4957 }
fb51372e
RGS		 4958 else if (!SvOK(d)) {
4959 /* undef ~~ scalar ; we already know that the scalar is SvOK */
d7c0d282 4960 DEBUG_M(Perl_deb(aTHX_ " applying rule undef-Any\n"));
fb51372e
RGS		 4961 RETPUSHNO;
4962 }
2c9d2554
RGS		 4963 else
4964 sm_any_scalar:
4965 if (SvNIOK(e) || (SvPOK(e) && looks_like_number(e) && SvNIOK(d))) {
d7c0d282
DM		 4966 DEBUG_M(if (SvNIOK(e))
4967 Perl_deb(aTHX_ " applying rule Any-Num\n");
4968 else
4969 Perl_deb(aTHX_ " applying rule Num-numish\n");
4970 );
33ed63a2 4971 /* numeric comparison */
0d863452
RH		 4972 PUSHs(d); PUSHs(e);
4973 PUTBACK;
a98fe34d 4974 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
897d3989 4975 (void) Perl_pp_i_eq(aTHX);
0d863452 4976 else
897d3989 4977 (void) Perl_pp_eq(aTHX);
0d863452
RH		 4978 SPAGAIN;
4979 if (SvTRUEx(POPs))
4980 RETPUSHYES;
4981 else
4982 RETPUSHNO;
4983 }
4984
4985 /* As a last resort, use string comparison */
d7c0d282 4986 DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Any\n"));
0d863452
RH		 4987 PUSHs(d); PUSHs(e);
4988 PUTBACK;
897d3989 4989 return Perl_pp_seq(aTHX);
0d863452
RH		 4990}
4991
4992PP(pp_enterwhen)
4993{
4994 dVAR; dSP;
4995 register PERL_CONTEXT *cx;
4996 const I32 gimme = GIMME_V;
4997
4998 /* This is essentially an optimization: if the match
4999 fails, we don't want to push a context and then
5000 pop it again right away, so we skip straight
5001 to the op that follows the leavewhen.
25b991bf 5002 RETURNOP calls PUTBACK which restores the stack pointer after the POPs.
0d863452
RH		 5003 */
5004 if ((0 == (PL_op->op_flags & OPf_SPECIAL)) && !SvTRUEx(POPs))
25b991bf 5005 RETURNOP(cLOGOP->op_other->op_next);
0d863452 5006
c08f093b 5007 ENTER_with_name("when");
0d863452
RH		 5008 SAVETMPS;
5009
5010 PUSHBLOCK(cx, CXt_WHEN, SP);
5011 PUSHWHEN(cx);
5012
5013 RETURN;
5014}
5015
5016PP(pp_leavewhen)
5017{
5018 dVAR; dSP;
c08f093b 5019 I32 cxix;
0d863452 5020 register PERL_CONTEXT *cx;
c08f093b 5021 I32 gimme;
0d863452
RH		 5022 SV **newsp;
5023 PMOP *newpm;
5024
c08f093b
VP		 5025 cxix = dopoptogiven(cxstack_ix);
5026 if (cxix < 0)
fc7debfb
FC		 5027 /* diag_listed_as: Can't "when" outside a topicalizer */
5028 DIE(aTHX_ "Can't \"%s\" outside a topicalizer",
5029 PL_op->op_flags & OPf_SPECIAL ? "default" : "when");
c08f093b 5030
0d863452
RH		 5031 POPBLOCK(cx,newpm);
5032 assert(CxTYPE(cx) == CXt_WHEN);
5033
c08f093b
VP		 5034 TAINT_NOT;
5035 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
0d863452
RH		 5036 PL_curpm = newpm; /* pop $1 et al */
5037
c08f093b
VP		 5038 LEAVE_with_name("when");
5039
5040 if (cxix < cxstack_ix)
5041 dounwind(cxix);
5042
5043 cx = &cxstack[cxix];
5044
5045 if (CxFOREACH(cx)) {
5046 /* clear off anything above the scope we're re-entering */
5047 I32 inner = PL_scopestack_ix;
5048
5049 TOPBLOCK(cx);
5050 if (PL_scopestack_ix < inner)
5051 leave_scope(PL_scopestack[PL_scopestack_ix]);
5052 PL_curcop = cx->blk_oldcop;
5053
5054 return cx->blk_loop.my_op->op_nextop;
5055 }
5056 else
b1b5a4ae 5057 RETURNOP(cx->blk_givwhen.leave_op);
0d863452
RH		 5058}
5059
5060PP(pp_continue)
5061{
c08f093b 5062 dVAR; dSP;
0d863452
RH		 5063 I32 cxix;
5064 register PERL_CONTEXT *cx;
c08f093b
VP		 5065 I32 gimme;
5066 SV **newsp;
5067 PMOP *newpm;
7be5bd17
FR		 5068
5069 PERL_UNUSED_VAR(gimme);
0d863452
RH		 5070
5071 cxix = dopoptowhen(cxstack_ix);
5072 if (cxix < 0)
5073 DIE(aTHX_ "Can't \"continue\" outside a when block");
c08f093b 5074
0d863452
RH		 5075 if (cxix < cxstack_ix)
5076 dounwind(cxix);
5077
c08f093b
VP		 5078 POPBLOCK(cx,newpm);
5079 assert(CxTYPE(cx) == CXt_WHEN);
5080
5081 SP = newsp;
5082 PL_curpm = newpm; /* pop $1 et al */
5083
5084 LEAVE_with_name("when");
5085 RETURNOP(cx->blk_givwhen.leave_op->op_next);
0d863452
RH		 5086}
5087
5088PP(pp_break)
5089{
5090 dVAR;
5091 I32 cxix;
5092 register PERL_CONTEXT *cx;
25b991bf 5093
0d863452 5094 cxix = dopoptogiven(cxstack_ix);
c08f093b
VP		 5095 if (cxix < 0)
5096 DIE(aTHX_ "Can't \"break\" outside a given block");
5097
5098 cx = &cxstack[cxix];
5099 if (CxFOREACH(cx))
0d863452
RH		 5100 DIE(aTHX_ "Can't \"break\" in a loop topicalizer");
5101
5102 if (cxix < cxstack_ix)
5103 dounwind(cxix);
0d863452 5104
0787ea8a
VP		 5105 /* Restore the sp at the time we entered the given block */
5106 TOPBLOCK(cx);
5107
c08f093b 5108 return cx->blk_givwhen.leave_op;
0d863452
RH		 5109}
5110
74e0ddf7 5111static MAGIC *
cea2e8a9 5112S_doparseform(pTHX_ SV *sv)
a0d0e21e
LW		 5113{
5114 STRLEN len;
37ffbfcc 5115 register char *s = SvPV(sv, len);
3808a683 5116 register char *send;
086b26f3
DM		 5117 register char *base = NULL; /* start of current field */
5118 register I32 skipspaces = 0; /* number of contiguous spaces seen */
5119 bool noblank = FALSE; /* ~ or ~~ seen on this line */
5120 bool repeat = FALSE; /* ~~ seen on this line */
5121 bool postspace = FALSE; /* a text field may need right padding */
dea28490
JJ		 5122 U32 *fops;
5123 register U32 *fpc;
086b26f3 5124 U32 *linepc = NULL; /* position of last FF_LINEMARK */
a0d0e21e 5125 register I32 arg;
086b26f3
DM		 5126 bool ischop; /* it's a ^ rather than a @ */
5127 bool unchopnum = FALSE; /* at least one @ (i.e. non-chop) num field seen */
a1b95068 5128 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
3808a683
DM		 5129 MAGIC *mg = NULL;
5130 SV *sv_copy;
a0d0e21e 5131
7918f24d
NC		 5132 PERL_ARGS_ASSERT_DOPARSEFORM;
5133
55497cff 5134 if (len == 0)
cea2e8a9 5135 Perl_croak(aTHX_ "Null picture in formline");
ac27b0f5 5136
3808a683
DM		 5137 if (SvTYPE(sv) >= SVt_PVMG) {
5138 /* This might, of course, still return NULL. */
5139 mg = mg_find(sv, PERL_MAGIC_fm);
5140 } else {
5141 sv_upgrade(sv, SVt_PVMG);
5142 }
5143
5144 if (mg) {
5145 /* still the same as previously-compiled string? */
5146 SV *old = mg->mg_obj;
5147 if ( !(!!SvUTF8(old) ^ !!SvUTF8(sv))
5148 && len == SvCUR(old)
5149 && strnEQ(SvPVX(old), SvPVX(sv), len)
b57b1734
DM		 5150 ) {
5151 DEBUG_f(PerlIO_printf(Perl_debug_log,"Re-using compiled format\n"));
3808a683 5152 return mg;
b57b1734 5153 }
3808a683 5154
b57b1734 5155 DEBUG_f(PerlIO_printf(Perl_debug_log, "Re-compiling format\n"));
3808a683
DM		 5156 Safefree(mg->mg_ptr);
5157 mg->mg_ptr = NULL;
5158 SvREFCNT_dec(old);
5159 mg->mg_obj = NULL;
5160 }
b57b1734
DM		 5161 else {
5162 DEBUG_f(PerlIO_printf(Perl_debug_log, "Compiling format\n"));
3808a683 5163 mg = sv_magicext(sv, NULL, PERL_MAGIC_fm, &PL_vtbl_fm, NULL, 0);
b57b1734 5164 }
3808a683
DM		 5165
5166 sv_copy = newSVpvn_utf8(s, len, SvUTF8(sv));
5167 s = SvPV(sv_copy, len); /* work on the copy, not the original */
5168 send = s + len;
5169
5170
815f25c6
DM		 5171 /* estimate the buffer size needed */
5172 for (base = s; s <= send; s++) {
a1b95068 5173 if (*s == '\n' || *s == '@' || *s == '^')
815f25c6
DM		 5174 maxops += 10;
5175 }
5176 s = base;
c445ea15 5177 base = NULL;
815f25c6 5178
a02a5408 5179 Newx(fops, maxops, U32);
a0d0e21e
LW		 5180 fpc = fops;
5181
5182 if (s < send) {
5183 linepc = fpc;
5184 *fpc++ = FF_LINEMARK;
5185 noblank = repeat = FALSE;
5186 base = s;
5187 }
5188
5189 while (s <= send) {
5190 switch (*s++) {
5191 default:
5192 skipspaces = 0;
5193 continue;
5194
5195 case '~':
5196 if (*s == '~') {
5197 repeat = TRUE;
b57b1734
DM		 5198 skipspaces++;
5199 s++;
a0d0e21e
LW		 5200 }
5201 noblank = TRUE;
a0d0e21e
LW		 5202 /* FALL THROUGH */
5203 case ' ': case '\t':
5204 skipspaces++;
5205 continue;
a1b95068
WL		 5206 case 0:
5207 if (s < send) {
5208 skipspaces = 0;
5209 continue;
5210 } /* else FALL THROUGH */
5211 case '\n':
a0d0e21e
LW		 5212 arg = s - base;
5213 skipspaces++;
5214 arg -= skipspaces;
5215 if (arg) {
5f05dabc 5216 if (postspace)
a0d0e21e 5217 *fpc++ = FF_SPACE;
a0d0e21e 5218 *fpc++ = FF_LITERAL;
76912796 5219 *fpc++ = (U32)arg;
a0d0e21e 5220 }
5f05dabc 5221 postspace = FALSE;
a0d0e21e
LW		 5222 if (s <= send)
5223 skipspaces--;
5224 if (skipspaces) {
5225 *fpc++ = FF_SKIP;
76912796 5226 *fpc++ = (U32)skipspaces;
a0d0e21e
LW		 5227 }
5228 skipspaces = 0;
5229 if (s <= send)
5230 *fpc++ = FF_NEWLINE;
5231 if (noblank) {
5232 *fpc++ = FF_BLANK;
5233 if (repeat)
5234 arg = fpc - linepc + 1;
5235 else
5236 arg = 0;
76912796 5237 *fpc++ = (U32)arg;
a0d0e21e
LW		 5238 }
5239 if (s < send) {
5240 linepc = fpc;
5241 *fpc++ = FF_LINEMARK;
5242 noblank = repeat = FALSE;
5243 base = s;
5244 }
5245 else
5246 s++;
5247 continue;
5248
5249 case '@':
5250 case '^':
5251 ischop = s[-1] == '^';
5252
5253 if (postspace) {
5254 *fpc++ = FF_SPACE;
5255 postspace = FALSE;
5256 }
5257 arg = (s - base) - 1;
5258 if (arg) {
5259 *fpc++ = FF_LITERAL;
76912796 5260 *fpc++ = (U32)arg;
a0d0e21e
LW		 5261 }
5262
5263 base = s - 1;
5264 *fpc++ = FF_FETCH;
086b26f3 5265 if (*s == '*') { /* @* or ^* */
a0d0e21e 5266 s++;
a1b95068
WL		 5267 *fpc++ = 2; /* skip the @* or ^* */
5268 if (ischop) {
5269 *fpc++ = FF_LINESNGL;
5270 *fpc++ = FF_CHOP;
5271 } else
5272 *fpc++ = FF_LINEGLOB;
a0d0e21e 5273 }
086b26f3 5274 else if (*s == '#' || (*s == '.' && s[1] == '#')) { /* @###, ^### */
a701009a 5275 arg = ischop ? FORM_NUM_BLANK : 0;
a0d0e21e
LW		 5276 base = s - 1;
5277 while (*s == '#')
5278 s++;
5279 if (*s == '.') {
06b5626a 5280 const char * const f = ++s;
a0d0e21e
LW		 5281 while (*s == '#')
5282 s++;
a701009a 5283 arg |= FORM_NUM_POINT + (s - f);
a0d0e21e
LW		 5284 }
5285 *fpc++ = s - base; /* fieldsize for FETCH */
5286 *fpc++ = FF_DECIMAL;
76912796 5287 *fpc++ = (U32)arg;
a1b95068 5288 unchopnum |= ! ischop;
784707d5
JP		 5289 }
5290 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
a701009a 5291 arg = ischop ? FORM_NUM_BLANK : 0;
784707d5
JP		 5292 base = s - 1;
5293 s++; /* skip the '0' first */
5294 while (*s == '#')
5295 s++;
5296 if (*s == '.') {
06b5626a 5297 const char * const f = ++s;
784707d5
JP		 5298 while (*s == '#')
5299 s++;
a701009a 5300 arg |= FORM_NUM_POINT + (s - f);
784707d5
JP		 5301 }
5302 *fpc++ = s - base; /* fieldsize for FETCH */
5303 *fpc++ = FF_0DECIMAL;
76912796 5304 *fpc++ = (U32)arg;
a1b95068 5305 unchopnum |= ! ischop;
a0d0e21e 5306 }
086b26f3 5307 else { /* text field */
a0d0e21e
LW		 5308 I32 prespace = 0;
5309 bool ismore = FALSE;
5310
5311 if (*s == '>') {
5312 while (*++s == '>') ;
5313 prespace = FF_SPACE;
5314 }
5315 else if (*s == '|') {
5316 while (*++s == '|') ;
5317 prespace = FF_HALFSPACE;
5318 postspace = TRUE;
5319 }
5320 else {
5321 if (*s == '<')
5322 while (*++s == '<') ;
5323 postspace = TRUE;
5324 }
5325 if (*s == '.' && s[1] == '.' && s[2] == '.') {
5326 s += 3;
5327 ismore = TRUE;
5328 }
5329 *fpc++ = s - base; /* fieldsize for FETCH */
5330
5331 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
5332
5333 if (prespace)
76912796 5334 *fpc++ = (U32)prespace; /* add SPACE or HALFSPACE */
a0d0e21e
LW		 5335 *fpc++ = FF_ITEM;
5336 if (ismore)
5337 *fpc++ = FF_MORE;
5338 if (ischop)
5339 *fpc++ = FF_CHOP;
5340 }
5341 base = s;
5342 skipspaces = 0;
5343 continue;
5344 }
5345 }
5346 *fpc++ = FF_END;
5347
815f25c6 5348 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
a0d0e21e 5349 arg = fpc - fops;
74e0ddf7 5350
3808a683 5351 mg->mg_ptr = (char *) fops;
74e0ddf7 5352 mg->mg_len = arg * sizeof(U32);
3808a683
DM		 5353 mg->mg_obj = sv_copy;
5354 mg->mg_flags |= MGf_REFCOUNTED;
a1b95068 5355
bfed75c6 5356 if (unchopnum && repeat)
75f63940 5357 Perl_die(aTHX_ "Repeated format line will never terminate (~~ and @#)");
74e0ddf7
NC		 5358
5359 return mg;
a1b95068
WL		 5360}
5361
5362
5363STATIC bool
5364S_num_overflow(NV value, I32 fldsize, I32 frcsize)
5365{
5366 /* Can value be printed in fldsize chars, using %*.*f ? */
5367 NV pwr = 1;
5368 NV eps = 0.5;
5369 bool res = FALSE;
5370 int intsize = fldsize - (value < 0 ? 1 : 0);
5371
a701009a 5372 if (frcsize & FORM_NUM_POINT)
a1b95068 5373 intsize--;
a701009a 5374 frcsize &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
a1b95068
WL		 5375 intsize -= frcsize;
5376
5377 while (intsize--) pwr *= 10.0;
5378 while (frcsize--) eps /= 10.0;
5379
5380 if( value >= 0 ){
5381 if (value + eps >= pwr)
5382 res = TRUE;
5383 } else {
5384 if (value - eps <= -pwr)
5385 res = TRUE;
5386 }
5387 return res;
a0d0e21e 5388}
4e35701f 5389
bbed91b5 5390static I32
0bd48802 5391S_run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
bbed91b5 5392{
27da23d5 5393 dVAR;
0bd48802 5394 SV * const datasv = FILTER_DATA(idx);
504618e9 5395 const int filter_has_file = IoLINES(datasv);
ad64d0ec
NC		 5396 SV * const filter_state = MUTABLE_SV(IoTOP_GV(datasv));
5397 SV * const filter_sub = MUTABLE_SV(IoBOTTOM_GV(datasv));
941a98a0 5398 int status = 0;
ec0b63d7 5399 SV *upstream;
941a98a0 5400 STRLEN got_len;
162177c1
Z		 5401 char *got_p = NULL;
5402 char *prune_from = NULL;
34113e50 5403 bool read_from_cache = FALSE;
bb7a0f54
MHM		 5404 STRLEN umaxlen;
5405
7918f24d
NC		 5406 PERL_ARGS_ASSERT_RUN_USER_FILTER;
5407
bb7a0f54
MHM		 5408 assert(maxlen >= 0);
5409 umaxlen = maxlen;
5675696b 5410
bbed91b5
KF		 5411 /* I was having segfault trouble under Linux 2.2.5 after a
5412 parse error occured. (Had to hack around it with a test
13765c85 5413 for PL_parser->error_count == 0.) Solaris doesn't segfault --
bbed91b5
KF		 5414 not sure where the trouble is yet. XXX */
5415
4464f08e
NC		 5416 {
5417 SV *const cache = datasv;
937b367d
NC		 5418 if (SvOK(cache)) {
5419 STRLEN cache_len;
5420 const char *cache_p = SvPV(cache, cache_len);
941a98a0
NC		 5421 STRLEN take = 0;
5422
bb7a0f54 5423 if (umaxlen) {
941a98a0
NC		 5424 /* Running in block mode and we have some cached data already.
5425 */
bb7a0f54 5426 if (cache_len >= umaxlen) {
941a98a0
NC		 5427 /* In fact, so much data we don't even need to call
5428 filter_read. */
bb7a0f54 5429 take = umaxlen;
941a98a0
NC		 5430 }
5431 } else {
10edeb5d
JH		 5432 const char *const first_nl =
5433 (const char *)memchr(cache_p, '\n', cache_len);
941a98a0
NC		 5434 if (first_nl) {
5435 take = first_nl + 1 - cache_p;
5436 }
5437 }
5438 if (take) {
5439 sv_catpvn(buf_sv, cache_p, take);
5440 sv_chop(cache, cache_p + take);
486ec47a 5441 /* Definitely not EOF */
937b367d
NC		 5442 return 1;
5443 }
941a98a0 5444
937b367d 5445 sv_catsv(buf_sv, cache);
bb7a0f54
MHM		 5446 if (umaxlen) {
5447 umaxlen -= cache_len;
941a98a0 5448 }
937b367d 5449 SvOK_off(cache);
34113e50 5450 read_from_cache = TRUE;
937b367d
NC		 5451 }
5452 }
ec0b63d7 5453
34113e50
NC		 5454 /* Filter API says that the filter appends to the contents of the buffer.
5455 Usually the buffer is "", so the details don't matter. But if it's not,
5456 then clearly what it contains is already filtered by this filter, so we
5457 don't want to pass it in a second time.
5458 I'm going to use a mortal in case the upstream filter croaks. */
ec0b63d7
NC		 5459 upstream = ((SvOK(buf_sv) && sv_len(buf_sv)) || SvGMAGICAL(buf_sv))
5460 ? sv_newmortal() : buf_sv;
5461 SvUPGRADE(upstream, SVt_PV);
937b367d 5462
bbed91b5 5463 if (filter_has_file) {
67e70b33 5464 status = FILTER_READ(idx+1, upstream, 0);
bbed91b5
KF		 5465 }
5466
34113e50 5467 if (filter_sub && status >= 0) {
39644a26 5468 dSP;
bbed91b5
KF		 5469 int count;
5470
d343c3ef 5471 ENTER_with_name("call_filter_sub");
339c6c60
FC		 5472 save_gp(PL_defgv, 0);
5473 GvINTRO_off(PL_defgv);
d34a6664 5474 SAVEGENERICSV(GvSV(PL_defgv));
bbed91b5
KF		 5475 SAVETMPS;
5476 EXTEND(SP, 2);
5477
414bf5ae 5478 DEFSV_set(upstream);
d34a6664 5479 SvREFCNT_inc_simple_void_NN(upstream);
bbed91b5 5480 PUSHMARK(SP);
6e449a3a 5481 mPUSHi(0);
bbed91b5
KF		 5482 if (filter_state) {
5483 PUSHs(filter_state);
5484 }
5485 PUTBACK;
5486 count = call_sv(filter_sub, G_SCALAR);
5487 SPAGAIN;
5488
5489 if (count > 0) {
5490 SV *out = POPs;
5491 if (SvOK(out)) {
941a98a0 5492 status = SvIV(out);
bbed91b5
KF		 5493 }
5494 }
5495
5496 PUTBACK;
5497 FREETMPS;
d343c3ef 5498 LEAVE_with_name("call_filter_sub");
bbed91b5
KF		 5499 }
5500
941a98a0
NC		 5501 if(SvOK(upstream)) {
5502 got_p = SvPV(upstream, got_len);
bb7a0f54
MHM		 5503 if (umaxlen) {
5504 if (got_len > umaxlen) {
5505 prune_from = got_p + umaxlen;
937b367d 5506 }
941a98a0 5507 } else {
162177c1 5508 char *const first_nl = (char *)memchr(got_p, '\n', got_len);
941a98a0
NC		 5509 if (first_nl && first_nl + 1 < got_p + got_len) {
5510 /* There's a second line here... */
5511 prune_from = first_nl + 1;
937b367d 5512 }
937b367d
NC		 5513 }
5514 }
941a98a0
NC		 5515 if (prune_from) {
5516 /* Oh. Too long. Stuff some in our cache. */
5517 STRLEN cached_len = got_p + got_len - prune_from;
4464f08e 5518 SV *const cache = datasv;
941a98a0 5519
4464f08e 5520 if (SvOK(cache)) {
941a98a0
NC		 5521 /* Cache should be empty. */
5522 assert(!SvCUR(cache));
5523 }
5524
5525 sv_setpvn(cache, prune_from, cached_len);
5526 /* If you ask for block mode, you may well split UTF-8 characters.
5527 "If it breaks, you get to keep both parts"
5528 (Your code is broken if you don't put them back together again
5529 before something notices.) */
5530 if (SvUTF8(upstream)) {
5531 SvUTF8_on(cache);
5532 }
5533 SvCUR_set(upstream, got_len - cached_len);
162177c1 5534 *prune_from = 0;
941a98a0
NC		 5535 /* Can't yet be EOF */
5536 if (status == 0)
5537 status = 1;
5538 }
937b367d 5539
34113e50
NC		 5540 /* If they are at EOF but buf_sv has something in it, then they may never
5541 have touched the SV upstream, so it may be undefined. If we naively
5542 concatenate it then we get a warning about use of uninitialised value.
5543 */
5544 if (upstream != buf_sv && (SvOK(upstream) || SvGMAGICAL(upstream))) {
937b367d
NC		 5545 sv_catsv(buf_sv, upstream);
5546 }
5547
941a98a0 5548 if (status <= 0) {
bbed91b5 5549 IoLINES(datasv) = 0;
bbed91b5
KF		 5550 if (filter_state) {
5551 SvREFCNT_dec(filter_state);
a0714e2c 5552 IoTOP_GV(datasv) = NULL;
bbed91b5
KF		 5553 }
5554 if (filter_sub) {
5555 SvREFCNT_dec(filter_sub);
a0714e2c 5556 IoBOTTOM_GV(datasv) = NULL;
bbed91b5 5557 }
0bd48802 5558 filter_del(S_run_user_filter);
bbed91b5 5559 }
34113e50
NC		 5560 if (status == 0 && read_from_cache) {
5561 /* If we read some data from the cache (and by getting here it implies
5562 that we emptied the cache) then we aren't yet at EOF, and mustn't
5563 report that to our caller. */
5564 return 1;
5565 }
941a98a0 5566 return status;
bbed91b5 5567}
84d4ea48 5568
be4b629d
CN		 5569/* perhaps someone can come up with a better name for
5570 this? it is not really "absolute", per se ... */
cf42f822 5571static bool
5f66b61c 5572S_path_is_absolute(const char *name)
be4b629d 5573{
7918f24d
NC		 5574 PERL_ARGS_ASSERT_PATH_IS_ABSOLUTE;
5575
be4b629d 5576 if (PERL_FILE_IS_ABSOLUTE(name)
3f66cd94 5577#ifdef WIN32
36f064bc
CL		 5578 || (*name == '.' && ((name[1] == '/' ||
5579 (name[1] == '.' && name[2] == '/'))
5580 || (name[1] == '\\' ||
5581 ( name[1] == '.' && name[2] == '\\')))
5582 )
5583#else
be4b629d 5584 || (*name == '.' && (name[1] == '/' ||
0bd48802 5585 (name[1] == '.' && name[2] == '/')))
36f064bc 5586#endif
0bd48802 5587 )
be4b629d
CN		 5588 {
5589 return TRUE;
5590 }
5591 else
5592 return FALSE;
5593}
241d1a3b
NC		 5594
5595/*
5596 * Local variables:
5597 * c-indentation-style: bsd
5598 * c-basic-offset: 4
5599 * indent-tabs-mode: t
5600 * End:
5601 *
37442d52
RGS		 5602 * ex: set ts=8 sts=4 sw=4 noet:
5603 */
Unnamed repository; edit this file 'description' to name the repository.