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