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