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