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