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