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