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
Dumper.xs: Update comment
[perl5.git] / pp_ctl.c
CommitLineData
a0d0e21e
LW		 1/* pp_ctl.c
2 *
1129b882
NC		 3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
a0d0e21e
LW		 5 *
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
8 *
9 */
10
11/*
4ac71550
TC		 12 * Now far ahead the Road has gone,
13 * And I must follow, if I can,
14 * Pursuing it with eager feet,
15 * Until it joins some larger way
16 * Where many paths and errands meet.
17 * And whither then? I cannot say.
18 *
19 * [Bilbo on p.35 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
a0d0e21e
LW		 20 */
21
166f8a29
DM		 22/* This file contains control-oriented pp ("push/pop") functions that
23 * execute the opcodes that make up a perl program. A typical pp function
24 * expects to find its arguments on the stack, and usually pushes its
25 * results onto the stack, hence the 'pp' terminology. Each OP structure
26 * contains a pointer to the relevant pp_foo() function.
27 *
28 * Control-oriented means things like pp_enteriter() and pp_next(), which
29 * alter the flow of control of the program.
30 */
31
32
a0d0e21e 33#include "EXTERN.h"
864dbfa3 34#define PERL_IN_PP_CTL_C
a0d0e21e
LW		 35#include "perl.h"
36
54310121 37#define DOCATCH(o) ((CATCH_GET == TRUE) ? docatch(o) : (o))
1e422769 38
94fcd414
NC		 39#define dopoptosub(plop) dopoptosub_at(cxstack, (plop))
40
a0d0e21e
LW		 41PP(pp_wantarray)
42{
97aff369 43 dVAR;
39644a26 44 dSP;
a0d0e21e 45 I32 cxix;
93f0bc49 46 const PERL_CONTEXT *cx;
a0d0e21e
LW		 47 EXTEND(SP, 1);
48
93f0bc49
FC		 49 if (PL_op->op_private & OPpOFFBYONE) {
50 if (!(cx = caller_cx(1,NULL))) RETPUSHUNDEF;
51 }
52 else {
53 cxix = dopoptosub(cxstack_ix);
54 if (cxix < 0)
a0d0e21e 55 RETPUSHUNDEF;
93f0bc49
FC		 56 cx = &cxstack[cxix];
57 }
a0d0e21e 58
93f0bc49 59 switch (cx->blk_gimme) {
54310121 60 case G_ARRAY:
a0d0e21e 61 RETPUSHYES;
54310121 62 case G_SCALAR:
a0d0e21e 63 RETPUSHNO;
54310121 64 default:
65 RETPUSHUNDEF;
66 }
a0d0e21e
LW		 67}
68
2cd61cdb
IZ		 69PP(pp_regcreset)
70{
97aff369 71 dVAR;
0b4182de 72 TAINT_NOT;
2cd61cdb
IZ		 73 return NORMAL;
74}
75
b3eb6a9b
GS		 76PP(pp_regcomp)
77{
97aff369 78 dVAR;
39644a26 79 dSP;
eb578fdb 80 PMOP *pm = (PMOP*)cLOGOP->op_other;
9f141731 81 SV **args;
df787a7b 82 int nargs;
84679df5 83 REGEXP *re = NULL;
9f141731
DM		 84 REGEXP *new_re;
85 const regexp_engine *eng;
dbc200c5 86 bool is_bare_re= FALSE;
bfed75c6 87
df787a7b
DM		 88 if (PL_op->op_flags & OPf_STACKED) {
89 dMARK;
90 nargs = SP - MARK;
91 args = ++MARK;
92 }
93 else {
94 nargs = 1;
95 args = SP;
96 }
97
4b5a0d1c 98 /* prevent recompiling under /o and ithreads. */
3db8f154 99#if defined(USE_ITHREADS)
131b3ad0 100 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
df787a7b 101 SP = args-1;
131b3ad0
DM		 102 RETURN;
103 }
513629ba 104#endif
d4b87e75 105
9f141731
DM		 106 re = PM_GETRE(pm);
107 assert (re != (REGEXP*) &PL_sv_undef);
108 eng = re ? RX_ENGINE(re) : current_re_engine();
109
dbc200c5
YO		 110 /*
111 In the below logic: these are basically the same - check if this regcomp is part of a split.
112
113 (PL_op->op_pmflags & PMf_split )
114 (PL_op->op_next->op_type == OP_PUSHRE)
115
116 We could add a new mask for this and copy the PMf_split, if we did
117 some bit definition fiddling first.
118
119 For now we leave this
120 */
121
3c13cae6
DM		 122 new_re = (eng->op_comp
123 ? eng->op_comp
124 : &Perl_re_op_compile
125 )(aTHX_ args, nargs, pm->op_code_list, eng, re,
346d3070 126 &is_bare_re,
dbc200c5 127 (pm->op_pmflags & RXf_PMf_FLAGCOPYMASK),
a5ae69f0
DM		 128 pm->op_pmflags |
129 (PL_op->op_flags & OPf_SPECIAL ? PMf_USE_RE_EVAL : 0));
dbc200c5 130
346d3070 131 if (pm->op_pmflags & PMf_HAS_CV)
8d919b0a 132 ReANY(new_re)->qr_anoncv
9fe3265f 133 = (CV*) SvREFCNT_inc(PAD_SV(PL_op->op_targ));
9f141731
DM		 134
135 if (is_bare_re) {
136 REGEXP *tmp;
137 /* The match's LHS's get-magic might need to access this op's regexp
138 (e.g. $' =~ /$re/ while foo; see bug 70764). So we must call
139 get-magic now before we replace the regexp. Hopefully this hack can
140 be replaced with the approach described at
141 http://www.nntp.perl.org/group/perl.perl5.porters/2007/03/msg122415.html
142 some day. */
143 if (pm->op_type == OP_MATCH) {
144 SV *lhs;
284167a5 145 const bool was_tainted = TAINT_get;
9f141731
DM		 146 if (pm->op_flags & OPf_STACKED)
147 lhs = args[-1];
148 else if (pm->op_private & OPpTARGET_MY)
149 lhs = PAD_SV(pm->op_targ);
150 else lhs = DEFSV;
151 SvGETMAGIC(lhs);
152 /* Restore the previous value of PL_tainted (which may have been
153 modified by get-magic), to avoid incorrectly setting the
284167a5
S		 154 RXf_TAINTED flag with RX_TAINT_on further down. */
155 TAINT_set(was_tainted);
9a9b5ec9
DM		 156#if NO_TAINT_SUPPORT
157 PERL_UNUSED_VAR(was_tainted);
158#endif
df787a7b 159 }
9f141731
DM		 160 tmp = reg_temp_copy(NULL, new_re);
161 ReREFCNT_dec(new_re);
162 new_re = tmp;
df787a7b 163 }
dbc200c5 164
9f141731
DM		 165 if (re != new_re) {
166 ReREFCNT_dec(re);
167 PM_SETRE(pm, new_re);
c277df42 168 }
d4b87e75 169
dbc200c5 170
72311751 171#ifndef INCOMPLETE_TAINTS
284167a5 172 if (TAINTING_get && TAINT_get) {
9f141731 173 SvTAINTED_on((SV*)new_re);
284167a5 174 RX_TAINT_on(new_re);
72311751
GS		 175 }
176#endif
177
c737faaf
YO		 178#if !defined(USE_ITHREADS)
179 /* can't change the optree at runtime either */
180 /* PMf_KEEP is handled differently under threads to avoid these problems */
9f141731
DM		 181 if (!RX_PRELEN(PM_GETRE(pm)) && PL_curpm)
182 pm = PL_curpm;
a0d0e21e 183 if (pm->op_pmflags & PMf_KEEP) {
c90c0ff4 184 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
533c011a 185 cLOGOP->op_first->op_next = PL_op->op_next;
a0d0e21e 186 }
c737faaf 187#endif
9f141731 188
df787a7b 189 SP = args-1;
a0d0e21e
LW		 190 RETURN;
191}
192
9f141731 193
a0d0e21e
LW		 194PP(pp_substcont)
195{
97aff369 196 dVAR;
39644a26 197 dSP;
eb578fdb
KW		 198 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
199 PMOP * const pm = (PMOP*) cLOGOP->op_other;
200 SV * const dstr = cx->sb_dstr;
201 char *s = cx->sb_s;
202 char *m = cx->sb_m;
a0d0e21e 203 char *orig = cx->sb_orig;
eb578fdb 204 REGEXP * const rx = cx->sb_rx;
c445ea15 205 SV *nsv = NULL;
988e6e7e 206 REGEXP *old = PM_GETRE(pm);
f410a211
NC		 207
208 PERL_ASYNC_CHECK();
209
988e6e7e 210 if(old != rx) {
bfed75c6 211 if(old)
988e6e7e 212 ReREFCNT_dec(old);
d6106309 213 PM_SETRE(pm,ReREFCNT_inc(rx));
d8f2cf8a
AB		 214 }
215
d9f97599 216 rxres_restore(&cx->sb_rxres, rx);
c90c0ff4 217
a0d0e21e 218 if (cx->sb_iters++) {
a3b680e6 219 const I32 saviters = cx->sb_iters;
a0d0e21e 220 if (cx->sb_iters > cx->sb_maxiters)
cea2e8a9 221 DIE(aTHX_ "Substitution loop");
a0d0e21e 222
447ee134
DM		 223 SvGETMAGIC(TOPs); /* possibly clear taint on $1 etc: #67962 */
224
ef07e810 225 /* See "how taint works" above pp_subst() */
20be6587
DM		 226 if (SvTAINTED(TOPs))
227 cx->sb_rxtainted |= SUBST_TAINT_REPL;
447ee134 228 sv_catsv_nomg(dstr, POPs);
2c296965 229 if (CxONCE(cx) || s < orig ||
03c83e26
DM		 230 !CALLREGEXEC(rx, s, cx->sb_strend, orig,
231 (s == m), cx->sb_targ, NULL,
d5e7783a 232 (REXEC_IGNOREPOS|REXEC_NOT_FIRST|REXEC_FAIL_ON_UNDERFLOW)))
a0d0e21e 233 {
8ca8a454 234 SV *targ = cx->sb_targ;
748a9306 235
078c425b
JH		 236 assert(cx->sb_strend >= s);
237 if(cx->sb_strend > s) {
238 if (DO_UTF8(dstr) && !SvUTF8(targ))
4bac9ae4 239 sv_catpvn_nomg_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
078c425b 240 else
4bac9ae4 241 sv_catpvn_nomg(dstr, s, cx->sb_strend - s);
078c425b 242 }
20be6587
DM		 243 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
244 cx->sb_rxtainted |= SUBST_TAINT_PAT;
9212bbba 245
8ca8a454
NC		 246 if (pm->op_pmflags & PMf_NONDESTRUCT) {
247 PUSHs(dstr);
248 /* From here on down we're using the copy, and leaving the
249 original untouched. */
250 targ = dstr;
251 }
252 else {
9e0ea7f3
FC		 253 SV_CHECK_THINKFIRST_COW_DROP(targ);
254 if (isGV(targ)) Perl_croak_no_modify();
255 SvPV_free(targ);
8ca8a454
NC		 256 SvPV_set(targ, SvPVX(dstr));
257 SvCUR_set(targ, SvCUR(dstr));
258 SvLEN_set(targ, SvLEN(dstr));
259 if (DO_UTF8(dstr))
260 SvUTF8_on(targ);
261 SvPV_set(dstr, NULL);
262
52c47e16 263 PL_tainted = 0;
4f4d7508 264 mPUSHi(saviters - 1);
48c036b1 265
8ca8a454
NC		 266 (void)SvPOK_only_UTF8(targ);
267 }
5cd24f17 268
20be6587 269 /* update the taint state of various various variables in
ef07e810
DM		 270 * preparation for final exit.
271 * See "how taint works" above pp_subst() */
284167a5 272 if (TAINTING_get) {
20be6587
DM		 273 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
274 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
275 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
276 )
277 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
278
279 if (!(cx->sb_rxtainted & SUBST_TAINT_BOOLRET)
280 && (cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT))
281 )
282 SvTAINTED_on(TOPs); /* taint return value */
283 /* needed for mg_set below */
284167a5
S		 284 TAINT_set(
285 cBOOL(cx->sb_rxtainted &
286 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL))
287 );
20be6587
DM		 288 SvTAINT(TARG);
289 }
290 /* PL_tainted must be correctly set for this mg_set */
291 SvSETMAGIC(TARG);
292 TAINT_NOT;
4633a7c4 293 LEAVE_SCOPE(cx->sb_oldsave);
a0d0e21e 294 POPSUBST(cx);
47c9d59f 295 PERL_ASYNC_CHECK();
a0d0e21e 296 RETURNOP(pm->op_next);
118e2215 297 assert(0); /* NOTREACHED */
a0d0e21e 298 }
8e5e9ebe 299 cx->sb_iters = saviters;
a0d0e21e 300 }
07bc277f 301 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
a0d0e21e
LW		 302 m = s;
303 s = orig;
6502e081 304 assert(!RX_SUBOFFSET(rx));
07bc277f 305 cx->sb_orig = orig = RX_SUBBEG(rx);
a0d0e21e
LW		 306 s = orig + (m - s);
307 cx->sb_strend = s + (cx->sb_strend - m);
308 }
07bc277f 309 cx->sb_m = m = RX_OFFS(rx)[0].start + orig;
db79b45b 310 if (m > s) {
bfed75c6 311 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
4bac9ae4 312 sv_catpvn_nomg_utf8_upgrade(dstr, s, m - s, nsv);
db79b45b 313 else
4bac9ae4 314 sv_catpvn_nomg(dstr, s, m-s);
db79b45b 315 }
07bc277f 316 cx->sb_s = RX_OFFS(rx)[0].end + orig;
084916e3 317 { /* Update the pos() information. */
8ca8a454
NC		 318 SV * const sv
319 = (pm->op_pmflags & PMf_NONDESTRUCT) ? cx->sb_dstr : cx->sb_targ;
084916e3 320 MAGIC *mg;
96c2a8ff
FC		 321 if (!(mg = mg_find_mglob(sv))) {
322 mg = sv_magicext_mglob(sv);
084916e3 323 }
25fdce4a
FC		 324 assert(SvPOK(dstr));
325 MgBYTEPOS_set(mg, sv, SvPVX(dstr), m - orig);
084916e3 326 }
988e6e7e 327 if (old != rx)
d6106309 328 (void)ReREFCNT_inc(rx);
20be6587 329 /* update the taint state of various various variables in preparation
ef07e810
DM		 330 * for calling the code block.
331 * See "how taint works" above pp_subst() */
284167a5 332 if (TAINTING_get) {
20be6587
DM		 333 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
334 cx->sb_rxtainted |= SUBST_TAINT_PAT;
335
336 if ((cx->sb_rxtainted & SUBST_TAINT_PAT) ||
337 ((cx->sb_rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
338 == (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
339 )
340 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
341
342 if (cx->sb_iters > 1 && (cx->sb_rxtainted &
343 (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL)))
8ca8a454
NC		 344 SvTAINTED_on((pm->op_pmflags & PMf_NONDESTRUCT)
345 ? cx->sb_dstr : cx->sb_targ);
20be6587
DM		 346 TAINT_NOT;
347 }
d9f97599 348 rxres_save(&cx->sb_rxres, rx);
af9838cc 349 PL_curpm = pm;
29f2e912 350 RETURNOP(pm->op_pmstashstartu.op_pmreplstart);
a0d0e21e
LW		 351}
352
c90c0ff4 353void
864dbfa3 354Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
c90c0ff4 355{
356 UV *p = (UV*)*rsp;
357 U32 i;
7918f24d
NC		 358
359 PERL_ARGS_ASSERT_RXRES_SAVE;
96a5add6 360 PERL_UNUSED_CONTEXT;
c90c0ff4 361
07bc277f 362 if (!p || p[1] < RX_NPARENS(rx)) {
db2c6cb3 363#ifdef PERL_ANY_COW
6502e081 364 i = 7 + (RX_NPARENS(rx)+1) * 2;
ed252734 365#else
6502e081 366 i = 6 + (RX_NPARENS(rx)+1) * 2;
ed252734 367#endif
c90c0ff4 368 if (!p)
a02a5408 369 Newx(p, i, UV);
c90c0ff4 370 else
371 Renew(p, i, UV);
372 *rsp = (void*)p;
373 }
374
5eabab15
DM		 375 /* what (if anything) to free on croak */
376 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? RX_SUBBEG(rx) : NULL);
cf93c79d 377 RX_MATCH_COPIED_off(rx);
6c31ff74 378 *p++ = RX_NPARENS(rx);
c90c0ff4 379
db2c6cb3 380#ifdef PERL_ANY_COW
bdd9a1b1
NC		 381 *p++ = PTR2UV(RX_SAVED_COPY(rx));
382 RX_SAVED_COPY(rx) = NULL;
ed252734
NC		 383#endif
384
07bc277f
NC		 385 *p++ = PTR2UV(RX_SUBBEG(rx));
386 *p++ = (UV)RX_SUBLEN(rx);
6502e081
DM		 387 *p++ = (UV)RX_SUBOFFSET(rx);
388 *p++ = (UV)RX_SUBCOFFSET(rx);
07bc277f
NC		 389 for (i = 0; i <= RX_NPARENS(rx); ++i) {
390 *p++ = (UV)RX_OFFS(rx)[i].start;
391 *p++ = (UV)RX_OFFS(rx)[i].end;
c90c0ff4 392 }
393}
394
9c105995
NC		 395static void
396S_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
c90c0ff4 397{
398 UV *p = (UV*)*rsp;
399 U32 i;
7918f24d
NC		 400
401 PERL_ARGS_ASSERT_RXRES_RESTORE;
96a5add6 402 PERL_UNUSED_CONTEXT;
c90c0ff4 403
ed252734 404 RX_MATCH_COPY_FREE(rx);
cf93c79d 405 RX_MATCH_COPIED_set(rx, *p);
c90c0ff4 406 *p++ = 0;
6c31ff74 407 RX_NPARENS(rx) = *p++;
c90c0ff4 408
db2c6cb3 409#ifdef PERL_ANY_COW
bdd9a1b1
NC		 410 if (RX_SAVED_COPY(rx))
411 SvREFCNT_dec (RX_SAVED_COPY(rx));
412 RX_SAVED_COPY(rx) = INT2PTR(SV*,*p);
ed252734
NC		 413 *p++ = 0;
414#endif
415
07bc277f
NC		 416 RX_SUBBEG(rx) = INT2PTR(char*,*p++);
417 RX_SUBLEN(rx) = (I32)(*p++);
6502e081
DM		 418 RX_SUBOFFSET(rx) = (I32)*p++;
419 RX_SUBCOFFSET(rx) = (I32)*p++;
07bc277f
NC		 420 for (i = 0; i <= RX_NPARENS(rx); ++i) {
421 RX_OFFS(rx)[i].start = (I32)(*p++);
422 RX_OFFS(rx)[i].end = (I32)(*p++);
c90c0ff4 423 }
424}
425
9c105995
NC		 426static void
427S_rxres_free(pTHX_ void **rsp)
c90c0ff4 428{
44f8325f 429 UV * const p = (UV*)*rsp;
7918f24d
NC		 430
431 PERL_ARGS_ASSERT_RXRES_FREE;
96a5add6 432 PERL_UNUSED_CONTEXT;
c90c0ff4 433
434 if (p) {
94010e71 435 void *tmp = INT2PTR(char*,*p);
6c31ff74 436#ifdef PERL_POISON
db2c6cb3 437#ifdef PERL_ANY_COW
6c31ff74 438 U32 i = 9 + p[1] * 2;
94010e71 439#else
6c31ff74 440 U32 i = 8 + p[1] * 2;
94010e71 441#endif
6c31ff74
NC		 442#endif
443
db2c6cb3 444#ifdef PERL_ANY_COW
6c31ff74 445 SvREFCNT_dec (INT2PTR(SV*,p[2]));
ed252734 446#endif
6c31ff74
NC		 447#ifdef PERL_POISON
448 PoisonFree(p, i, sizeof(UV));
449#endif
450
451 Safefree(tmp);
c90c0ff4 452 Safefree(p);
4608196e 453 *rsp = NULL;
c90c0ff4 454 }
455}
456
a701009a
DM		 457#define FORM_NUM_BLANK (1<<30)
458#define FORM_NUM_POINT (1<<29)
459
a0d0e21e
LW		 460PP(pp_formline)
461{
97aff369 462 dVAR; dSP; dMARK; dORIGMARK;
eb578fdb 463 SV * const tmpForm = *++MARK;
086b26f3 464 SV *formsv; /* contains text of original format */
eb578fdb
KW		 465 U32 *fpc; /* format ops program counter */
466 char *t; /* current append position in target string */
086b26f3 467 const char *f; /* current position in format string */
eb578fdb
KW		 468 I32 arg;
469 SV *sv = NULL; /* current item */
086b26f3
DM		 470 const char *item = NULL;/* string value of current item */
471 I32 itemsize = 0; /* length of current item, possibly truncated */
472 I32 fieldsize = 0; /* width of current field */
473 I32 lines = 0; /* number of lines that have been output */
474 bool chopspace = (strchr(PL_chopset, ' ') != NULL); /* does $: have space */
475 const char *chophere = NULL; /* where to chop current item */
f5ada144 476 STRLEN linemark = 0; /* pos of start of line in output */
65202027 477 NV value;
086b26f3 478 bool gotsome = FALSE; /* seen at least one non-blank item on this line */
a0d0e21e 479 STRLEN len;
26e935cf 480 STRLEN linemax; /* estimate of output size in bytes */
1bd51a4c
IH		 481 bool item_is_utf8 = FALSE;
482 bool targ_is_utf8 = FALSE;
bfed75c6 483 const char *fmt;
74e0ddf7 484 MAGIC *mg = NULL;
4ff700b9
DM		 485 U8 *source; /* source of bytes to append */
486 STRLEN to_copy; /* how may bytes to append */
ea60cfe8 487 char trans; /* what chars to translate */
74e0ddf7 488
3808a683 489 mg = doparseform(tmpForm);
a0d0e21e 490
74e0ddf7 491 fpc = (U32*)mg->mg_ptr;
3808a683
DM		 492 /* the actual string the format was compiled from.
493 * with overload etc, this may not match tmpForm */
494 formsv = mg->mg_obj;
495
74e0ddf7 496
3280af22 497 SvPV_force(PL_formtarget, len);
3808a683 498 if (SvTAINTED(tmpForm) || SvTAINTED(formsv))
125b9982 499 SvTAINTED_on(PL_formtarget);
1bd51a4c
IH		 500 if (DO_UTF8(PL_formtarget))
501 targ_is_utf8 = TRUE;
26e935cf
DM		 502 linemax = (SvCUR(formsv) * (IN_BYTES ? 1 : 3) + 1);
503 t = SvGROW(PL_formtarget, len + linemax + 1);
504 /* XXX from now onwards, SvCUR(PL_formtarget) is invalid */
a0d0e21e 505 t += len;
3808a683 506 f = SvPV_const(formsv, len);
a0d0e21e
LW		 507
508 for (;;) {
509 DEBUG_f( {
bfed75c6 510 const char *name = "???";
a0d0e21e
LW		 511 arg = -1;
512 switch (*fpc) {
513 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
514 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
515 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
516 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
517 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
518
519 case FF_CHECKNL: name = "CHECKNL"; break;
520 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
521 case FF_SPACE: name = "SPACE"; break;
522 case FF_HALFSPACE: name = "HALFSPACE"; break;
523 case FF_ITEM: name = "ITEM"; break;
524 case FF_CHOP: name = "CHOP"; break;
525 case FF_LINEGLOB: name = "LINEGLOB"; break;
526 case FF_NEWLINE: name = "NEWLINE"; break;
527 case FF_MORE: name = "MORE"; break;
528 case FF_LINEMARK: name = "LINEMARK"; break;
529 case FF_END: name = "END"; break;
bfed75c6 530 case FF_0DECIMAL: name = "0DECIMAL"; break;
a1b95068 531 case FF_LINESNGL: name = "LINESNGL"; break;
a0d0e21e
LW		 532 }
533 if (arg >= 0)
bf49b057 534 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
a0d0e21e 535 else
bf49b057 536 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
5f80b19c 537 } );
a0d0e21e
LW		 538 switch (*fpc++) {
539 case FF_LINEMARK:
f5ada144 540 linemark = t - SvPVX(PL_formtarget);
a0d0e21e
LW		 541 lines++;
542 gotsome = FALSE;
543 break;
544
545 case FF_LITERAL:
ea60cfe8
DM		 546 to_copy = *fpc++;
547 source = (U8 *)f;
548 f += to_copy;
549 trans = '~';
75645721 550 item_is_utf8 = targ_is_utf8 ? !!DO_UTF8(formsv) : !!SvUTF8(formsv);
ea60cfe8 551 goto append;
a0d0e21e
LW		 552
553 case FF_SKIP:
554 f += *fpc++;
555 break;
556
557 case FF_FETCH:
558 arg = *fpc++;
559 f += arg;
560 fieldsize = arg;
561
562 if (MARK < SP)
563 sv = *++MARK;
564 else {
3280af22 565 sv = &PL_sv_no;
a2a5de95 566 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
a0d0e21e 567 }
125b9982
NT		 568 if (SvTAINTED(sv))
569 SvTAINTED_on(PL_formtarget);
a0d0e21e
LW		 570 break;
571
572 case FF_CHECKNL:
5a34cab7
NC		 573 {
574 const char *send;
575 const char *s = item = SvPV_const(sv, len);
576 itemsize = len;
577 if (DO_UTF8(sv)) {
578 itemsize = sv_len_utf8(sv);
579 if (itemsize != (I32)len) {
580 I32 itembytes;
581 if (itemsize > fieldsize) {
582 itemsize = fieldsize;
583 itembytes = itemsize;
584 sv_pos_u2b(sv, &itembytes, 0);
585 }
586 else
587 itembytes = len;
588 send = chophere = s + itembytes;
589 while (s < send) {
077dbbf3 590 if (! isCNTRL(*s))
5a34cab7
NC		 591 gotsome = TRUE;
592 else if (*s == '\n')
593 break;
594 s++;
595 }
596 item_is_utf8 = TRUE;
597 itemsize = s - item;
598 sv_pos_b2u(sv, &itemsize);
599 break;
a0ed51b3 600 }
a0ed51b3 601 }
5a34cab7
NC		 602 item_is_utf8 = FALSE;
603 if (itemsize > fieldsize)
604 itemsize = fieldsize;
605 send = chophere = s + itemsize;
606 while (s < send) {
077dbbf3 607 if (! isCNTRL(*s))
5a34cab7
NC		 608 gotsome = TRUE;
609 else if (*s == '\n')
610 break;
611 s++;
612 }
613 itemsize = s - item;
614 break;
a0ed51b3 615 }
a0d0e21e
LW		 616
617 case FF_CHECKCHOP:
5a34cab7
NC		 618 {
619 const char *s = item = SvPV_const(sv, len);
620 itemsize = len;
621 if (DO_UTF8(sv)) {
622 itemsize = sv_len_utf8(sv);
623 if (itemsize != (I32)len) {
624 I32 itembytes;
625 if (itemsize <= fieldsize) {
626 const char *send = chophere = s + itemsize;
627 while (s < send) {
628 if (*s == '\r') {
629 itemsize = s - item;
a0ed51b3 630 chophere = s;
a0ed51b3 631 break;
5a34cab7 632 }
077dbbf3 633 if (! isCNTRL(*s))
a0ed51b3 634 gotsome = TRUE;
077dbbf3 635 s++;
a0ed51b3 636 }
a0ed51b3 637 }
5a34cab7
NC		 638 else {
639 const char *send;
640 itemsize = fieldsize;
641 itembytes = itemsize;
642 sv_pos_u2b(sv, &itembytes, 0);
643 send = chophere = s + itembytes;
644 while (s < send || (s == send && isSPACE(*s))) {
645 if (isSPACE(*s)) {
646 if (chopspace)
647 chophere = s;
648 if (*s == '\r')
649 break;
650 }
651 else {
077dbbf3 652 if (! isCNTRL(*s))
5a34cab7
NC		 653 gotsome = TRUE;
654 if (strchr(PL_chopset, *s))
655 chophere = s + 1;
656 }
657 s++;
658 }
659 itemsize = chophere - item;
660 sv_pos_b2u(sv, &itemsize);
661 }
662 item_is_utf8 = TRUE;
a0d0e21e
LW		 663 break;
664 }
a0d0e21e 665 }
5a34cab7
NC		 666 item_is_utf8 = FALSE;
667 if (itemsize <= fieldsize) {
668 const char *const send = chophere = s + itemsize;
669 while (s < send) {
670 if (*s == '\r') {
671 itemsize = s - item;
a0d0e21e 672 chophere = s;
a0d0e21e 673 break;
5a34cab7 674 }
077dbbf3 675 if (! isCNTRL(*s))
a0d0e21e 676 gotsome = TRUE;
077dbbf3 677 s++;
a0d0e21e 678 }
a0d0e21e 679 }
5a34cab7
NC		 680 else {
681 const char *send;
682 itemsize = fieldsize;
683 send = chophere = s + itemsize;
684 while (s < send || (s == send && isSPACE(*s))) {
685 if (isSPACE(*s)) {
686 if (chopspace)
687 chophere = s;
688 if (*s == '\r')
689 break;
690 }
691 else {
077dbbf3 692 if (! isCNTRL(*s))
5a34cab7
NC		 693 gotsome = TRUE;
694 if (strchr(PL_chopset, *s))
695 chophere = s + 1;
696 }
697 s++;
698 }
699 itemsize = chophere - item;
700 }
701 break;
a0d0e21e 702 }
a0d0e21e
LW		 703
704 case FF_SPACE:
705 arg = fieldsize - itemsize;
706 if (arg) {
707 fieldsize -= arg;
708 while (arg-- > 0)
709 *t++ = ' ';
710 }
711 break;
712
713 case FF_HALFSPACE:
714 arg = fieldsize - itemsize;
715 if (arg) {
716 arg /= 2;
717 fieldsize -= arg;
718 while (arg-- > 0)
719 *t++ = ' ';
720 }
721 break;
722
723 case FF_ITEM:
8aa7beb6
DM		 724 to_copy = itemsize;
725 source = (U8 *)item;
726 trans = 1;
727 if (item_is_utf8) {
728 /* convert to_copy from chars to bytes */
729 U8 *s = source;
730 while (to_copy--)
731 s += UTF8SKIP(s);
732 to_copy = s - source;
a0d0e21e 733 }
8aa7beb6 734 goto append;
a0d0e21e
LW		 735
736 case FF_CHOP:
5a34cab7
NC		 737 {
738 const char *s = chophere;
739 if (chopspace) {
af68e756 740 while (isSPACE(*s))
5a34cab7
NC		 741 s++;
742 }
743 sv_chop(sv,s);
744 SvSETMAGIC(sv);
745 break;
a0d0e21e 746 }
a0d0e21e 747
a1b95068
WL		 748 case FF_LINESNGL:
749 chopspace = 0;
a0d0e21e 750 case FF_LINEGLOB:
5a34cab7 751 {
e32383e2 752 const bool oneline = fpc[-1] == FF_LINESNGL;
5a34cab7 753 const char *s = item = SvPV_const(sv, len);
7440a75b 754 const char *const send = s + len;
7440a75b 755
f3f2f1a3 756 item_is_utf8 = DO_UTF8(sv);
a1137ee5 757 if (!len)
7440a75b 758 break;
ea60cfe8 759 trans = 0;
0d21cefe 760 gotsome = TRUE;
a1137ee5 761 chophere = s + len;
4ff700b9
DM		 762 source = (U8 *) s;
763 to_copy = len;
0d21cefe
DM		 764 while (s < send) {
765 if (*s++ == '\n') {
766 if (oneline) {
767 to_copy = s - SvPVX_const(sv) - 1;
768 chophere = s;
769 break;
770 } else {
771 if (s == send) {
0d21cefe
DM		 772 to_copy--;
773 } else
774 lines++;
1bd51a4c 775 }
a0d0e21e 776 }
0d21cefe 777 }
a2c0032b
DM		 778 }
779
ea60cfe8
DM		 780 append:
781 /* append to_copy bytes from source to PL_formstring.
782 * item_is_utf8 implies source is utf8.
783 * if trans, translate certain characters during the copy */
a2c0032b
DM		 784 {
785 U8 *tmp = NULL;
26e935cf 786 STRLEN grow = 0;
0325ce87
DM		 787
788 SvCUR_set(PL_formtarget,
789 t - SvPVX_const(PL_formtarget));
790
0d21cefe
DM		 791 if (targ_is_utf8 && !item_is_utf8) {
792 source = tmp = bytes_to_utf8(source, &to_copy);
0d21cefe
DM		 793 } else {
794 if (item_is_utf8 && !targ_is_utf8) {
f5ada144 795 U8 *s;
0d21cefe 796 /* Upgrade targ to UTF8, and then we reduce it to
0325ce87
DM		 797 a problem we have a simple solution for.
798 Don't need get magic. */
0d21cefe 799 sv_utf8_upgrade_nomg(PL_formtarget);
0325ce87 800 targ_is_utf8 = TRUE;
f5ada144
DM		 801 /* re-calculate linemark */
802 s = (U8*)SvPVX(PL_formtarget);
26e935cf
DM		 803 /* the bytes we initially allocated to append the
804 * whole line may have been gobbled up during the
805 * upgrade, so allocate a whole new line's worth
806 * for safety */
807 grow = linemax;
f5ada144
DM		 808 while (linemark--)
809 s += UTF8SKIP(s);
810 linemark = s - (U8*)SvPVX(PL_formtarget);
e8e72d41 811 }
0d21cefe
DM		 812 /* Easy. They agree. */
813 assert (item_is_utf8 == targ_is_utf8);
814 }
26e935cf
DM		 815 if (!trans)
816 /* @* and ^* are the only things that can exceed
817 * the linemax, so grow by the output size, plus
818 * a whole new form's worth in case of any further
819 * output */
820 grow = linemax + to_copy;
821 if (grow)
822 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + grow + 1);
0d21cefe
DM		 823 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
824
825 Copy(source, t, to_copy, char);
ea60cfe8 826 if (trans) {
8aa7beb6
DM		 827 /* blank out ~ or control chars, depending on trans.
828 * works on bytes not chars, so relies on not
829 * matching utf8 continuation bytes */
ea60cfe8
DM		 830 U8 *s = (U8*)t;
831 U8 *send = s + to_copy;
832 while (s < send) {
8aa7beb6 833 const int ch = *s;
077dbbf3 834 if (trans == '~' ? (ch == '~') : isCNTRL(ch))
ea60cfe8
DM		 835 *s = ' ';
836 s++;
837 }
838 }
839
0d21cefe
DM		 840 t += to_copy;
841 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) + to_copy);
a1137ee5 842 if (tmp)
0d21cefe 843 Safefree(tmp);
5a34cab7 844 break;
a0d0e21e 845 }
a0d0e21e 846
a1b95068
WL		 847 case FF_0DECIMAL:
848 arg = *fpc++;
849#if defined(USE_LONG_DOUBLE)
10edeb5d 850 fmt = (const char *)
a701009a 851 ((arg & FORM_NUM_POINT) ?
10edeb5d 852 "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl);
a1b95068 853#else
10edeb5d 854 fmt = (const char *)
a701009a 855 ((arg & FORM_NUM_POINT) ?
10edeb5d 856 "%#0*.*f" : "%0*.*f");
a1b95068
WL		 857#endif
858 goto ff_dec;
a0d0e21e 859 case FF_DECIMAL:
a0d0e21e 860 arg = *fpc++;
65202027 861#if defined(USE_LONG_DOUBLE)
10edeb5d 862 fmt = (const char *)
a701009a 863 ((arg & FORM_NUM_POINT) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl);
65202027 864#else
10edeb5d 865 fmt = (const char *)
a701009a 866 ((arg & FORM_NUM_POINT) ? "%#*.*f" : "%*.*f");
65202027 867#endif
a1b95068 868 ff_dec:
784707d5
JP		 869 /* If the field is marked with ^ and the value is undefined,
870 blank it out. */
a701009a 871 if ((arg & FORM_NUM_BLANK) && !SvOK(sv)) {
784707d5
JP		 872 arg = fieldsize;
873 while (arg--)
874 *t++ = ' ';
875 break;
876 }
877 gotsome = TRUE;
878 value = SvNV(sv);
a1b95068 879 /* overflow evidence */
bfed75c6 880 if (num_overflow(value, fieldsize, arg)) {
a1b95068
WL		 881 arg = fieldsize;
882 while (arg--)
883 *t++ = '#';
884 break;
885 }
784707d5
JP		 886 /* Formats aren't yet marked for locales, so assume "yes". */
887 {
888 STORE_NUMERIC_STANDARD_SET_LOCAL();
a701009a
DM		 889 arg &= ~(FORM_NUM_POINT|FORM_NUM_BLANK);
890 my_snprintf(t, SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget)), fmt, (int) fieldsize, (int) arg, value);
784707d5
JP		 891 RESTORE_NUMERIC_STANDARD();
892 }
893 t += fieldsize;
894 break;
a1b95068 895
a0d0e21e
LW		 896 case FF_NEWLINE:
897 f++;
f5ada144 898 while (t-- > (SvPVX(PL_formtarget) + linemark) && *t == ' ') ;
a0d0e21e
LW		 899 t++;
900 *t++ = '\n';
901 break;
902
903 case FF_BLANK:
904 arg = *fpc++;
905 if (gotsome) {
906 if (arg) { /* repeat until fields exhausted? */
11f9eeaf
DM		 907 fpc--;
908 goto end;
a0d0e21e
LW		 909 }
910 }
911 else {
f5ada144 912 t = SvPVX(PL_formtarget) + linemark;
a0d0e21e
LW		 913 lines--;
914 }
915 break;
916
917 case FF_MORE:
5a34cab7
NC		 918 {
919 const char *s = chophere;
920 const char *send = item + len;
921 if (chopspace) {
af68e756 922 while (isSPACE(*s) && (s < send))
5a34cab7 923 s++;
a0d0e21e 924 }
5a34cab7
NC		 925 if (s < send) {
926 char *s1;
927 arg = fieldsize - itemsize;
928 if (arg) {
929 fieldsize -= arg;
930 while (arg-- > 0)
931 *t++ = ' ';
932 }
933 s1 = t - 3;
934 if (strnEQ(s1," ",3)) {
935 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
936 s1--;
937 }
938 *s1++ = '.';
939 *s1++ = '.';
940 *s1++ = '.';
a0d0e21e 941 }
5a34cab7 942 break;
a0d0e21e 943 }
a0d0e21e 944 case FF_END:
11f9eeaf 945 end:
bf2bec63 946 assert(t < SvPVX_const(PL_formtarget) + SvLEN(PL_formtarget));
a0d0e21e 947 *t = '\0';
b15aece3 948 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
1bd51a4c
IH		 949 if (targ_is_utf8)
950 SvUTF8_on(PL_formtarget);
3280af22 951 FmLINES(PL_formtarget) += lines;
a0d0e21e 952 SP = ORIGMARK;
11f9eeaf
DM		 953 if (fpc[-1] == FF_BLANK)
954 RETURNOP(cLISTOP->op_first);
955 else
956 RETPUSHYES;
a0d0e21e
LW		 957 }
958 }
959}
960
961PP(pp_grepstart)
962{
27da23d5 963 dVAR; dSP;
a0d0e21e
LW		 964 SV *src;
965
3280af22 966 if (PL_stack_base + *PL_markstack_ptr == SP) {
a0d0e21e 967 (void)POPMARK;
54310121 968 if (GIMME_V == G_SCALAR)
6e449a3a 969 mXPUSHi(0);
533c011a 970 RETURNOP(PL_op->op_next->op_next);
a0d0e21e 971 }
3280af22 972 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
897d3989
NC		 973 Perl_pp_pushmark(aTHX); /* push dst */
974 Perl_pp_pushmark(aTHX); /* push src */
d343c3ef 975 ENTER_with_name("grep"); /* enter outer scope */
a0d0e21e
LW		 976
977 SAVETMPS;
59f00321
RGS		 978 if (PL_op->op_private & OPpGREP_LEX)
979 SAVESPTR(PAD_SVl(PL_op->op_targ));
980 else
981 SAVE_DEFSV;
d343c3ef 982 ENTER_with_name("grep_item"); /* enter inner scope */
7766f137 983 SAVEVPTR(PL_curpm);
a0d0e21e 984
3280af22 985 src = PL_stack_base[*PL_markstack_ptr];
a0ed822e
FC		 986 if (SvPADTMP(src) && !IS_PADGV(src)) {
987 src = PL_stack_base[*PL_markstack_ptr] = sv_mortalcopy(src);
988 PL_tmps_floor++;
989 }
a0d0e21e 990 SvTEMP_off(src);
59f00321
RGS		 991 if (PL_op->op_private & OPpGREP_LEX)
992 PAD_SVl(PL_op->op_targ) = src;
993 else
414bf5ae 994 DEFSV_set(src);
a0d0e21e
LW		 995
996 PUTBACK;
533c011a 997 if (PL_op->op_type == OP_MAPSTART)
897d3989 998 Perl_pp_pushmark(aTHX); /* push top */
533c011a 999 return ((LOGOP*)PL_op->op_next)->op_other;
a0d0e21e
LW		 1000}
1001
a0d0e21e
LW		 1002PP(pp_mapwhile)
1003{
27da23d5 1004 dVAR; dSP;
f54cb97a 1005 const I32 gimme = GIMME_V;
544f3153 1006 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
a0d0e21e
LW		 1007 I32 count;
1008 I32 shift;
1009 SV** src;
ac27b0f5 1010 SV** dst;
a0d0e21e 1011
544f3153 1012 /* first, move source pointer to the next item in the source list */
3280af22 1013 ++PL_markstack_ptr[-1];
544f3153
GS		 1014
1015 /* if there are new items, push them into the destination list */
4c90a460 1016 if (items && gimme != G_VOID) {
544f3153
GS		 1017 /* might need to make room back there first */
1018 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
1019 /* XXX this implementation is very pessimal because the stack
1020 * is repeatedly extended for every set of items. Is possible
1021 * to do this without any stack extension or copying at all
1022 * by maintaining a separate list over which the map iterates
18ef8bea 1023 * (like foreach does). --gsar */
544f3153
GS		 1024
1025 /* everything in the stack after the destination list moves
1026 * towards the end the stack by the amount of room needed */
1027 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
1028
1029 /* items to shift up (accounting for the moved source pointer) */
1030 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
18ef8bea
BT		 1031
1032 /* This optimization is by Ben Tilly and it does
1033 * things differently from what Sarathy (gsar)
1034 * is describing. The downside of this optimization is
1035 * that leaves "holes" (uninitialized and hopefully unused areas)
1036 * to the Perl stack, but on the other hand this
1037 * shouldn't be a problem. If Sarathy's idea gets
1038 * implemented, this optimization should become
1039 * irrelevant. --jhi */
1040 if (shift < count)
1041 shift = count; /* Avoid shifting too often --Ben Tilly */
bfed75c6 1042
924508f0
GS		 1043 EXTEND(SP,shift);
1044 src = SP;
1045 dst = (SP += shift);
3280af22
NIS		 1046 PL_markstack_ptr[-1] += shift;
1047 *PL_markstack_ptr += shift;
544f3153 1048 while (count--)
a0d0e21e
LW		 1049 *dst-- = *src--;
1050 }
544f3153 1051 /* copy the new items down to the destination list */
ac27b0f5 1052 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
22023b26 1053 if (gimme == G_ARRAY) {
b2a2a901
DM		 1054 /* add returned items to the collection (making mortal copies
1055 * if necessary), then clear the current temps stack frame
1056 * *except* for those items. We do this splicing the items
1057 * into the start of the tmps frame (so some items may be on
59d53fd6 1058 * the tmps stack twice), then moving PL_tmps_floor above
b2a2a901
DM		 1059 * them, then freeing the frame. That way, the only tmps that
1060 * accumulate over iterations are the return values for map.
1061 * We have to do to this way so that everything gets correctly
1062 * freed if we die during the map.
1063 */
1064 I32 tmpsbase;
1065 I32 i = items;
1066 /* make space for the slice */
1067 EXTEND_MORTAL(items);
1068 tmpsbase = PL_tmps_floor + 1;
1069 Move(PL_tmps_stack + tmpsbase,
1070 PL_tmps_stack + tmpsbase + items,
1071 PL_tmps_ix - PL_tmps_floor,
1072 SV*);
1073 PL_tmps_ix += items;
1074
1075 while (i-- > 0) {
1076 SV *sv = POPs;
1077 if (!SvTEMP(sv))
1078 sv = sv_mortalcopy(sv);
1079 *dst-- = sv;
1080 PL_tmps_stack[tmpsbase++] = SvREFCNT_inc_simple(sv);
1081 }
1082 /* clear the stack frame except for the items */
1083 PL_tmps_floor += items;
1084 FREETMPS;
1085 /* FREETMPS may have cleared the TEMP flag on some of the items */
1086 i = items;
1087 while (i-- > 0)
1088 SvTEMP_on(PL_tmps_stack[--tmpsbase]);
22023b26 1089 }
bfed75c6 1090 else {
22023b26
TP		 1091 /* scalar context: we don't care about which values map returns
1092 * (we use undef here). And so we certainly don't want to do mortal
1093 * copies of meaningless values. */
1094 while (items-- > 0) {
b988aa42 1095 (void)POPs;
22023b26
TP		 1096 *dst-- = &PL_sv_undef;
1097 }
b2a2a901 1098 FREETMPS;
22023b26 1099 }
a0d0e21e 1100 }
b2a2a901
DM		 1101 else {
1102 FREETMPS;
1103 }
d343c3ef 1104 LEAVE_with_name("grep_item"); /* exit inner scope */
a0d0e21e
LW		 1105
1106 /* All done yet? */
3280af22 1107 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
a0d0e21e
LW		 1108
1109 (void)POPMARK; /* pop top */
d343c3ef 1110 LEAVE_with_name("grep"); /* exit outer scope */
a0d0e21e 1111 (void)POPMARK; /* pop src */
3280af22 1112 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
a0d0e21e 1113 (void)POPMARK; /* pop dst */
3280af22 1114 SP = PL_stack_base + POPMARK; /* pop original mark */
54310121 1115 if (gimme == G_SCALAR) {
7cc47870
RGS		 1116 if (PL_op->op_private & OPpGREP_LEX) {
1117 SV* sv = sv_newmortal();
1118 sv_setiv(sv, items);
1119 PUSHs(sv);
1120 }
1121 else {
1122 dTARGET;
1123 XPUSHi(items);
1124 }
a0d0e21e 1125 }
54310121 1126 else if (gimme == G_ARRAY)
1127 SP += items;
a0d0e21e
LW		 1128 RETURN;
1129 }
1130 else {
1131 SV *src;
1132
d343c3ef 1133 ENTER_with_name("grep_item"); /* enter inner scope */
7766f137 1134 SAVEVPTR(PL_curpm);
a0d0e21e 1135
544f3153 1136 /* set $_ to the new source item */
3280af22 1137 src = PL_stack_base[PL_markstack_ptr[-1]];
a0ed822e 1138 if (SvPADTMP(src) && !IS_PADGV(src)) src = sv_mortalcopy(src);
a0d0e21e 1139 SvTEMP_off(src);
59f00321
RGS		 1140 if (PL_op->op_private & OPpGREP_LEX)
1141 PAD_SVl(PL_op->op_targ) = src;
1142 else
414bf5ae 1143 DEFSV_set(src);
a0d0e21e
LW		 1144
1145 RETURNOP(cLOGOP->op_other);
1146 }
1147}
1148
a0d0e21e
LW		 1149/* Range stuff. */
1150
1151PP(pp_range)
1152{
97aff369 1153 dVAR;
a0d0e21e 1154 if (GIMME == G_ARRAY)
1a67a97c 1155 return NORMAL;
538573f7 1156 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1a67a97c 1157 return cLOGOP->op_other;
538573f7 1158 else
1a67a97c 1159 return NORMAL;
a0d0e21e
LW		 1160}
1161
1162PP(pp_flip)
1163{
97aff369 1164 dVAR;
39644a26 1165 dSP;
a0d0e21e
LW		 1166
1167 if (GIMME == G_ARRAY) {
1a67a97c 1168 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
a0d0e21e
LW		 1169 }
1170 else {
1171 dTOPss;
44f8325f 1172 SV * const targ = PAD_SV(PL_op->op_targ);
bfed75c6 1173 int flip = 0;
790090df 1174
bfed75c6 1175 if (PL_op->op_private & OPpFLIP_LINENUM) {
4e3399f9
YST		 1176 if (GvIO(PL_last_in_gv)) {
1177 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1178 }
1179 else {
fafc274c 1180 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
44f8325f
AL		 1181 if (gv && GvSV(gv))
1182 flip = SvIV(sv) == SvIV(GvSV(gv));
4e3399f9 1183 }
bfed75c6
AL		 1184 } else {
1185 flip = SvTRUE(sv);
1186 }
1187 if (flip) {
a0d0e21e 1188 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
533c011a 1189 if (PL_op->op_flags & OPf_SPECIAL) {
a0d0e21e 1190 sv_setiv(targ, 1);
3e3baf6d 1191 SETs(targ);
a0d0e21e
LW		 1192 RETURN;
1193 }
1194 else {
1195 sv_setiv(targ, 0);
924508f0 1196 SP--;
1a67a97c 1197 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
a0d0e21e
LW		 1198 }
1199 }
76f68e9b 1200 sv_setpvs(TARG, "");
a0d0e21e
LW		 1201 SETs(targ);
1202 RETURN;
1203 }
1204}
1205
8e9bbdb9
RGS		 1206/* This code tries to decide if "$left .. $right" should use the
1207 magical string increment, or if the range is numeric (we make
1208 an exception for .."0" [#18165]). AMS 20021031. */
1209
1210#define RANGE_IS_NUMERIC(left,right) ( \
b0e74086
RGS		 1211 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1212 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
e0ab1c0e 1213 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
b15aece3 1214 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
e0ab1c0e 1215 && (!SvOK(right) || looks_like_number(right))))
8e9bbdb9 1216
a0d0e21e
LW		 1217PP(pp_flop)
1218{
97aff369 1219 dVAR; dSP;
a0d0e21e
LW		 1220
1221 if (GIMME == G_ARRAY) {
1222 dPOPPOPssrl;
86cb7173 1223
5b295bef
RD		 1224 SvGETMAGIC(left);
1225 SvGETMAGIC(right);
a0d0e21e 1226
8e9bbdb9 1227 if (RANGE_IS_NUMERIC(left,right)) {
eb578fdb 1228 IV i, j;
901017d6 1229 IV max;
4d91eccc
FC		 1230 if ((SvOK(left) && !SvIOK(left) && SvNV_nomg(left) < IV_MIN) ||
1231 (SvOK(right) && (SvIOK(right)
1232 ? SvIsUV(right) && SvUV(right) > IV_MAX
1233 : SvNV_nomg(right) > IV_MAX)))
d470f89e 1234 DIE(aTHX_ "Range iterator outside integer range");
f52e41ad
FC		 1235 i = SvIV_nomg(left);
1236 max = SvIV_nomg(right);
bbce6d69 1237 if (max >= i) {
c1ab3db2 1238 j = max - i + 1;
9a543cee
FC		 1239 if (j > SSize_t_MAX)
1240 Perl_croak(aTHX_ "Out of memory during list extend");
c1ab3db2
AK		 1241 EXTEND_MORTAL(j);
1242 EXTEND(SP, j);
bbce6d69 1243 }
c1ab3db2
AK		 1244 else
1245 j = 0;
1246 while (j--) {
901017d6 1247 SV * const sv = sv_2mortal(newSViv(i++));
a0d0e21e
LW		 1248 PUSHs(sv);
1249 }
1250 }
1251 else {
3c323193
FC		 1252 STRLEN len, llen;
1253 const char * const lpv = SvPV_nomg_const(left, llen);
f52e41ad 1254 const char * const tmps = SvPV_nomg_const(right, len);
a0d0e21e 1255
3c323193 1256 SV *sv = newSVpvn_flags(lpv, llen, SvUTF8(left)|SVs_TEMP);
89ea2908 1257 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
a0d0e21e 1258 XPUSHs(sv);
b15aece3 1259 if (strEQ(SvPVX_const(sv),tmps))
89ea2908 1260 break;
a0d0e21e
LW		 1261 sv = sv_2mortal(newSVsv(sv));
1262 sv_inc(sv);
1263 }
a0d0e21e
LW		 1264 }
1265 }
1266 else {
1267 dTOPss;
901017d6 1268 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
4e3399f9 1269 int flop = 0;
a0d0e21e 1270 sv_inc(targ);
4e3399f9
YST		 1271
1272 if (PL_op->op_private & OPpFLIP_LINENUM) {
1273 if (GvIO(PL_last_in_gv)) {
1274 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1275 }
1276 else {
fafc274c 1277 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
4e3399f9
YST		 1278 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1279 }
1280 }
1281 else {
1282 flop = SvTRUE(sv);
1283 }
1284
1285 if (flop) {
a0d0e21e 1286 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
396482e1 1287 sv_catpvs(targ, "E0");
a0d0e21e
LW		 1288 }
1289 SETs(targ);
1290 }
1291
1292 RETURN;
1293}
1294
1295/* Control. */
1296
27da23d5 1297static const char * const context_name[] = {
515afda2 1298 "pseudo-block",
f31522f3 1299 NULL, /* CXt_WHEN never actually needs "block" */
76753e7f 1300 NULL, /* CXt_BLOCK never actually needs "block" */
f31522f3 1301 NULL, /* CXt_GIVEN never actually needs "block" */
76753e7f
NC		 1302 NULL, /* CXt_LOOP_FOR never actually needs "loop" */
1303 NULL, /* CXt_LOOP_PLAIN never actually needs "loop" */
1304 NULL, /* CXt_LOOP_LAZYSV never actually needs "loop" */
1305 NULL, /* CXt_LOOP_LAZYIV never actually needs "loop" */
515afda2 1306 "subroutine",
76753e7f 1307 "format",
515afda2 1308 "eval",
515afda2 1309 "substitution",
515afda2
NC		 1310};
1311
76e3520e 1312STATIC I32
5db1eb8d 1313S_dopoptolabel(pTHX_ const char *label, STRLEN len, U32 flags)
a0d0e21e 1314{
97aff369 1315 dVAR;
eb578fdb 1316 I32 i;
a0d0e21e 1317
7918f24d
NC		 1318 PERL_ARGS_ASSERT_DOPOPTOLABEL;
1319
a0d0e21e 1320 for (i = cxstack_ix; i >= 0; i--) {
eb578fdb 1321 const PERL_CONTEXT * const cx = &cxstack[i];
6b35e009 1322 switch (CxTYPE(cx)) {
a0d0e21e 1323 case CXt_SUBST:
a0d0e21e 1324 case CXt_SUB:
7766f137 1325 case CXt_FORMAT:
a0d0e21e 1326 case CXt_EVAL:
0a753a76 1327 case CXt_NULL:
dcbac5bb 1328 /* diag_listed_as: Exiting subroutine via %s */
a2a5de95
NC		 1329 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1330 context_name[CxTYPE(cx)], OP_NAME(PL_op));
515afda2
NC		 1331 if (CxTYPE(cx) == CXt_NULL)
1332 return -1;
1333 break;
c6fdafd0 1334 case CXt_LOOP_LAZYIV:
d01136d6 1335 case CXt_LOOP_LAZYSV:
3b719c58
NC		 1336 case CXt_LOOP_FOR:
1337 case CXt_LOOP_PLAIN:
7e8f1eac 1338 {
5db1eb8d
BF		 1339 STRLEN cx_label_len = 0;
1340 U32 cx_label_flags = 0;
1341 const char *cx_label = CxLABEL_len_flags(cx, &cx_label_len, &cx_label_flags);
1342 if (!cx_label || !(
1343 ( (cx_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ?
1344 (flags & SVf_UTF8)
1345 ? (bytes_cmp_utf8(
1346 (const U8*)cx_label, cx_label_len,
1347 (const U8*)label, len) == 0)
1348 : (bytes_cmp_utf8(
1349 (const U8*)label, len,
1350 (const U8*)cx_label, cx_label_len) == 0)
eade7155
BF		 1351 : (len == cx_label_len && ((cx_label == label)
1352 || memEQ(cx_label, label, len))) )) {
1c98cc53 1353 DEBUG_l(Perl_deb(aTHX_ "(poptolabel(): skipping label at cx=%ld %s)\n",
7e8f1eac 1354 (long)i, cx_label));
a0d0e21e
LW		 1355 continue;
1356 }
1c98cc53 1357 DEBUG_l( Perl_deb(aTHX_ "(poptolabel(): found label at cx=%ld %s)\n", (long)i, label));
a0d0e21e 1358 return i;
7e8f1eac 1359 }
a0d0e21e
LW		 1360 }
1361 }
1362 return i;
1363}
1364
0d863452
RH		 1365
1366
e50aee73 1367I32
864dbfa3 1368Perl_dowantarray(pTHX)
e50aee73 1369{
97aff369 1370 dVAR;
f54cb97a 1371 const I32 gimme = block_gimme();
54310121 1372 return (gimme == G_VOID) ? G_SCALAR : gimme;
1373}
1374
1375I32
864dbfa3 1376Perl_block_gimme(pTHX)
54310121 1377{
97aff369 1378 dVAR;
06b5626a 1379 const I32 cxix = dopoptosub(cxstack_ix);
e50aee73 1380 if (cxix < 0)
46fc3d4c 1381 return G_VOID;
e50aee73 1382
54310121 1383 switch (cxstack[cxix].blk_gimme) {
d2719217
GS		 1384 case G_VOID:
1385 return G_VOID;
54310121 1386 case G_SCALAR:
e50aee73 1387 return G_SCALAR;
54310121 1388 case G_ARRAY:
1389 return G_ARRAY;
1390 default:
cea2e8a9 1391 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
118e2215 1392 assert(0); /* NOTREACHED */
d2719217 1393 return 0;
54310121 1394 }
e50aee73
AD		 1395}
1396
78f9721b
SM		 1397I32
1398Perl_is_lvalue_sub(pTHX)
1399{
97aff369 1400 dVAR;
06b5626a 1401 const I32 cxix = dopoptosub(cxstack_ix);
78f9721b
SM		 1402 assert(cxix >= 0); /* We should only be called from inside subs */
1403
bafb2adc
NC		 1404 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1405 return CxLVAL(cxstack + cxix);
78f9721b
SM		 1406 else
1407 return 0;
1408}
1409
777d9014
FC		 1410/* only used by PUSHSUB */
1411I32
1412Perl_was_lvalue_sub(pTHX)
1413{
1414 dVAR;
1415 const I32 cxix = dopoptosub(cxstack_ix-1);
1416 assert(cxix >= 0); /* We should only be called from inside subs */
1417
1418 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1419 return CxLVAL(cxstack + cxix);
1420 else
1421 return 0;
1422}
1423
76e3520e 1424STATIC I32
901017d6 1425S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
2c375eb9 1426{
97aff369 1427 dVAR;
a0d0e21e 1428 I32 i;
7918f24d
NC		 1429
1430 PERL_ARGS_ASSERT_DOPOPTOSUB_AT;
1431
a0d0e21e 1432 for (i = startingblock; i >= 0; i--) {
eb578fdb 1433 const PERL_CONTEXT * const cx = &cxstk[i];
6b35e009 1434 switch (CxTYPE(cx)) {
a0d0e21e
LW		 1435 default:
1436 continue;
a0d0e21e 1437 case CXt_SUB:
5fbe8311
DM		 1438 /* in sub foo { /(?{...})/ }, foo ends up on the CX stack
1439 * twice; the first for the normal foo() call, and the second
1440 * for a faked up re-entry into the sub to execute the
1441 * code block. Hide this faked entry from the world. */
1442 if (cx->cx_type & CXp_SUB_RE_FAKE)
1443 continue;
1444 case CXt_EVAL:
7766f137 1445 case CXt_FORMAT:
1c98cc53 1446 DEBUG_l( Perl_deb(aTHX_ "(dopoptosub_at(): found sub at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1447 return i;
1448 }
1449 }
1450 return i;
1451}
1452
76e3520e 1453STATIC I32
cea2e8a9 1454S_dopoptoeval(pTHX_ I32 startingblock)
a0d0e21e 1455{
97aff369 1456 dVAR;
a0d0e21e 1457 I32 i;
a0d0e21e 1458 for (i = startingblock; i >= 0; i--) {
eb578fdb 1459 const PERL_CONTEXT *cx = &cxstack[i];
6b35e009 1460 switch (CxTYPE(cx)) {
a0d0e21e
LW		 1461 default:
1462 continue;
1463 case CXt_EVAL:
1c98cc53 1464 DEBUG_l( Perl_deb(aTHX_ "(dopoptoeval(): found eval at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1465 return i;
1466 }
1467 }
1468 return i;
1469}
1470
76e3520e 1471STATIC I32
cea2e8a9 1472S_dopoptoloop(pTHX_ I32 startingblock)
a0d0e21e 1473{
97aff369 1474 dVAR;
a0d0e21e 1475 I32 i;
a0d0e21e 1476 for (i = startingblock; i >= 0; i--) {
eb578fdb 1477 const PERL_CONTEXT * const cx = &cxstack[i];
6b35e009 1478 switch (CxTYPE(cx)) {
a0d0e21e 1479 case CXt_SUBST:
a0d0e21e 1480 case CXt_SUB:
7766f137 1481 case CXt_FORMAT:
a0d0e21e 1482 case CXt_EVAL:
0a753a76 1483 case CXt_NULL:
dcbac5bb 1484 /* diag_listed_as: Exiting subroutine via %s */
a2a5de95
NC		 1485 Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1486 context_name[CxTYPE(cx)], OP_NAME(PL_op));
515afda2
NC		 1487 if ((CxTYPE(cx)) == CXt_NULL)
1488 return -1;
1489 break;
c6fdafd0 1490 case CXt_LOOP_LAZYIV:
d01136d6 1491 case CXt_LOOP_LAZYSV:
3b719c58
NC		 1492 case CXt_LOOP_FOR:
1493 case CXt_LOOP_PLAIN:
1c98cc53 1494 DEBUG_l( Perl_deb(aTHX_ "(dopoptoloop(): found loop at cx=%ld)\n", (long)i));
a0d0e21e
LW		 1495 return i;
1496 }
1497 }
1498 return i;
1499}
1500
0d863452
RH		 1501STATIC I32
1502S_dopoptogiven(pTHX_ I32 startingblock)
1503{
97aff369 1504 dVAR;
0d863452
RH		 1505 I32 i;
1506 for (i = startingblock; i >= 0; i--) {
eb578fdb 1507 const PERL_CONTEXT *cx = &cxstack[i];
0d863452
RH		 1508 switch (CxTYPE(cx)) {
1509 default:
1510 continue;
1511 case CXt_GIVEN:
1c98cc53 1512 DEBUG_l( Perl_deb(aTHX_ "(dopoptogiven(): found given at cx=%ld)\n", (long)i));
0d863452 1513 return i;
3b719c58
NC		 1514 case CXt_LOOP_PLAIN:
1515 assert(!CxFOREACHDEF(cx));
1516 break;
c6fdafd0 1517 case CXt_LOOP_LAZYIV:
d01136d6 1518 case CXt_LOOP_LAZYSV:
3b719c58 1519 case CXt_LOOP_FOR:
0d863452 1520 if (CxFOREACHDEF(cx)) {
1c98cc53 1521 DEBUG_l( Perl_deb(aTHX_ "(dopoptogiven(): found foreach at cx=%ld)\n", (long)i));
0d863452
RH		 1522 return i;
1523 }
1524 }
1525 }
1526 return i;
1527}
1528
1529STATIC I32
1530S_dopoptowhen(pTHX_ I32 startingblock)
1531{
97aff369 1532 dVAR;
0d863452
RH		 1533 I32 i;
1534 for (i = startingblock; i >= 0; i--) {
eb578fdb 1535 const PERL_CONTEXT *cx = &cxstack[i];
0d863452
RH		 1536 switch (CxTYPE(cx)) {
1537 default:
1538 continue;
1539 case CXt_WHEN:
1c98cc53 1540 DEBUG_l( Perl_deb(aTHX_ "(dopoptowhen(): found when at cx=%ld)\n", (long)i));
0d863452
RH		 1541 return i;
1542 }
1543 }
1544 return i;
1545}
1546
a0d0e21e 1547void
864dbfa3 1548Perl_dounwind(pTHX_ I32 cxix)
a0d0e21e 1549{
97aff369 1550 dVAR;
a0d0e21e
LW		 1551 I32 optype;
1552
f144f1e3
DM		 1553 if (!PL_curstackinfo) /* can happen if die during thread cloning */
1554 return;
1555
a0d0e21e 1556 while (cxstack_ix > cxix) {
b0d9ce38 1557 SV *sv;
eb578fdb 1558 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1c98cc53 1559 DEBUG_CX("UNWIND"); \
a0d0e21e 1560 /* Note: we don't need to restore the base context info till the end. */
6b35e009 1561 switch (CxTYPE(cx)) {
c90c0ff4 1562 case CXt_SUBST:
1563 POPSUBST(cx);
1564 continue; /* not break */
a0d0e21e 1565 case CXt_SUB:
b0d9ce38
GS		 1566 POPSUB(cx,sv);
1567 LEAVESUB(sv);
a0d0e21e
LW		 1568 break;
1569 case CXt_EVAL:
1570 POPEVAL(cx);
1571 break;
c6fdafd0 1572 case CXt_LOOP_LAZYIV:
d01136d6 1573 case CXt_LOOP_LAZYSV:
3b719c58
NC		 1574 case CXt_LOOP_FOR:
1575 case CXt_LOOP_PLAIN:
a0d0e21e
LW		 1576 POPLOOP(cx);
1577 break;
0a753a76 1578 case CXt_NULL:
a0d0e21e 1579 break;
7766f137
GS		 1580 case CXt_FORMAT:
1581 POPFORMAT(cx);
1582 break;
a0d0e21e 1583 }
c90c0ff4 1584 cxstack_ix--;
a0d0e21e 1585 }
1b6737cc 1586 PERL_UNUSED_VAR(optype);
a0d0e21e
LW		 1587}
1588
5a844595
GS		 1589void
1590Perl_qerror(pTHX_ SV *err)
1591{
97aff369 1592 dVAR;
7918f24d
NC		 1593
1594 PERL_ARGS_ASSERT_QERROR;
1595
6b2fb389
DM		 1596 if (PL_in_eval) {
1597 if (PL_in_eval & EVAL_KEEPERR) {
ecad31f0
BF		 1598 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1599 SVfARG(err));
6b2fb389
DM		 1600 }
1601 else
1602 sv_catsv(ERRSV, err);
1603 }
5a844595
GS		 1604 else if (PL_errors)
1605 sv_catsv(PL_errors, err);
1606 else
be2597df 1607 Perl_warn(aTHX_ "%"SVf, SVfARG(err));
13765c85
DM		 1608 if (PL_parser)
1609 ++PL_parser->error_count;
5a844595
GS		 1610}
1611
bb4c52e0 1612void
c5df3096 1613Perl_die_unwind(pTHX_ SV *msv)
a0d0e21e 1614{
27da23d5 1615 dVAR;
c5df3096 1616 SV *exceptsv = sv_mortalcopy(msv);
96d9b9cd 1617 U8 in_eval = PL_in_eval;
c5df3096 1618 PERL_ARGS_ASSERT_DIE_UNWIND;
87582a92 1619
96d9b9cd 1620 if (in_eval) {
a0d0e21e 1621 I32 cxix;
a0d0e21e 1622 I32 gimme;
a0d0e21e 1623
22a30693
Z		 1624 /*
1625 * Historically, perl used to set ERRSV ($@) early in the die
1626 * process and rely on it not getting clobbered during unwinding.
1627 * That sucked, because it was liable to get clobbered, so the
1628 * setting of ERRSV used to emit the exception from eval{} has
1629 * been moved to much later, after unwinding (see just before
1630 * JMPENV_JUMP below). However, some modules were relying on the
1631 * early setting, by examining $@ during unwinding to use it as
1632 * a flag indicating whether the current unwinding was caused by
1633 * an exception. It was never a reliable flag for that purpose,
1634 * being totally open to false positives even without actual
1635 * clobberage, but was useful enough for production code to
1636 * semantically rely on it.
1637 *
1638 * We'd like to have a proper introspective interface that
1639 * explicitly describes the reason for whatever unwinding
1640 * operations are currently in progress, so that those modules
1641 * work reliably and $@ isn't further overloaded. But we don't
1642 * have one yet. In its absence, as a stopgap measure, ERRSV is
1643 * now *additionally* set here, before unwinding, to serve as the
1644 * (unreliable) flag that it used to.
1645 *
1646 * This behaviour is temporary, and should be removed when a
1647 * proper way to detect exceptional unwinding has been developed.
1648 * As of 2010-12, the authors of modules relying on the hack
1649 * are aware of the issue, because the modules failed on
1650 * perls 5.13.{1..7} which had late setting of $@ without this
1651 * early-setting hack.
1652 */
1653 if (!(in_eval & EVAL_KEEPERR)) {
1654 SvTEMP_off(exceptsv);
1655 sv_setsv(ERRSV, exceptsv);
1656 }
1657
fc941f37
Z		 1658 if (in_eval & EVAL_KEEPERR) {
1659 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf,
1660 SVfARG(exceptsv));
1661 }
1662
5a844595
GS		 1663 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1664 && PL_curstackinfo->si_prev)
1665 {
bac4b2ad 1666 dounwind(-1);
d3acc0f7 1667 POPSTACK;
bac4b2ad 1668 }
e336de0d 1669
a0d0e21e
LW		 1670 if (cxix >= 0) {
1671 I32 optype;
b6494f15 1672 SV *namesv;
eb578fdb 1673 PERL_CONTEXT *cx;
901017d6 1674 SV **newsp;
8f89e5a9
Z		 1675 COP *oldcop;
1676 JMPENV *restartjmpenv;
1677 OP *restartop;
a0d0e21e
LW		 1678
1679 if (cxix < cxstack_ix)
1680 dounwind(cxix);
1681
3280af22 1682 POPBLOCK(cx,PL_curpm);
6b35e009 1683 if (CxTYPE(cx) != CXt_EVAL) {
7d0994e0 1684 STRLEN msglen;
96d9b9cd 1685 const char* message = SvPVx_const(exceptsv, msglen);
10edeb5d 1686 PerlIO_write(Perl_error_log, (const char *)"panic: die ", 11);
bf49b057 1687 PerlIO_write(Perl_error_log, message, msglen);
a0d0e21e
LW		 1688 my_exit(1);
1689 }
1690 POPEVAL(cx);
b6494f15 1691 namesv = cx->blk_eval.old_namesv;
8f89e5a9
Z		 1692 oldcop = cx->blk_oldcop;
1693 restartjmpenv = cx->blk_eval.cur_top_env;
1694 restartop = cx->blk_eval.retop;
a0d0e21e
LW		 1695
1696 if (gimme == G_SCALAR)
3280af22
NIS		 1697 *++newsp = &PL_sv_undef;
1698 PL_stack_sp = newsp;
a0d0e21e
LW		 1699
1700 LEAVE;
748a9306 1701
7fb6a879
GS		 1702 /* LEAVE could clobber PL_curcop (see save_re_context())
1703 * XXX it might be better to find a way to avoid messing with
1704 * PL_curcop in save_re_context() instead, but this is a more
1705 * minimal fix --GSAR */
8f89e5a9 1706 PL_curcop = oldcop;
7fb6a879 1707
7a2e2cd6 1708 if (optype == OP_REQUIRE) {
b6494f15 1709 (void)hv_store(GvHVn(PL_incgv),
ecad31f0 1710 SvPVX_const(namesv),
c60dbbc3 1711 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
27bcc0a7 1712 &PL_sv_undef, 0);
27e90453
DM		 1713 /* note that unlike pp_entereval, pp_require isn't
1714 * supposed to trap errors. So now that we've popped the
1715 * EVAL that pp_require pushed, and processed the error
1716 * message, rethrow the error */
ecad31f0
BF		 1717 Perl_croak(aTHX_ "%"SVf"Compilation failed in require",
1718 SVfARG(exceptsv ? exceptsv : newSVpvs_flags("Unknown error\n",
1719 SVs_TEMP)));
7a2e2cd6 1720 }
fc941f37 1721 if (!(in_eval & EVAL_KEEPERR))
96d9b9cd 1722 sv_setsv(ERRSV, exceptsv);
8f89e5a9
Z		 1723 PL_restartjmpenv = restartjmpenv;
1724 PL_restartop = restartop;
bb4c52e0 1725 JMPENV_JUMP(3);
118e2215 1726 assert(0); /* NOTREACHED */
a0d0e21e
LW		 1727 }
1728 }
87582a92 1729
96d9b9cd 1730 write_to_stderr(exceptsv);
f86702cc 1731 my_failure_exit();
118e2215 1732 assert(0); /* NOTREACHED */
a0d0e21e
LW		 1733}
1734
1735PP(pp_xor)
1736{
97aff369 1737 dVAR; dSP; dPOPTOPssrl;
a0d0e21e
LW		 1738 if (SvTRUE(left) != SvTRUE(right))
1739 RETSETYES;
1740 else
1741 RETSETNO;
1742}
1743
8dff4fc5
BM		 1744/*
1745=for apidoc caller_cx
1746
1747The XSUB-writer's equivalent of L<caller()|perlfunc/caller>. The
1748returned C<PERL_CONTEXT> structure can be interrogated to find all the
1749information returned to Perl by C<caller>. Note that XSUBs don't get a
1750stack frame, so C<caller_cx(0, NULL)> will return information for the
1751immediately-surrounding Perl code.
1752
1753This function skips over the automatic calls to C<&DB::sub> made on the
1754behalf of the debugger. If the stack frame requested was a sub called by
1755C<DB::sub>, the return value will be the frame for the call to
1756C<DB::sub>, since that has the correct line number/etc. for the call
1757site. If I<dbcxp> is non-C<NULL>, it will be set to a pointer to the
1758frame for the sub call itself.
1759
1760=cut
1761*/
1762
1763const PERL_CONTEXT *
1764Perl_caller_cx(pTHX_ I32 count, const PERL_CONTEXT **dbcxp)
a0d0e21e 1765{
eb578fdb
KW		 1766 I32 cxix = dopoptosub(cxstack_ix);
1767 const PERL_CONTEXT *cx;
1768 const PERL_CONTEXT *ccstack = cxstack;
901017d6 1769 const PERL_SI *top_si = PL_curstackinfo;
27d41816 1770
a0d0e21e 1771 for (;;) {
2c375eb9
GS		 1772 /* we may be in a higher stacklevel, so dig down deeper */
1773 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1774 top_si = top_si->si_prev;
1775 ccstack = top_si->si_cxstack;
1776 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1777 }
8dff4fc5
BM		 1778 if (cxix < 0)
1779 return NULL;
f2a7f298
DG		 1780 /* caller() should not report the automatic calls to &DB::sub */
1781 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
3280af22 1782 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
a0d0e21e
LW		 1783 count++;
1784 if (!count--)
1785 break;
2c375eb9 1786 cxix = dopoptosub_at(ccstack, cxix - 1);
a0d0e21e 1787 }
2c375eb9
GS		 1788
1789 cx = &ccstack[cxix];
8dff4fc5
BM		 1790 if (dbcxp) *dbcxp = cx;
1791
7766f137 1792 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
f54cb97a 1793 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
2c375eb9 1794 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
06a5b730 1795 field below is defined for any cx. */
f2a7f298
DG		 1796 /* caller() should not report the automatic calls to &DB::sub */
1797 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
2c375eb9 1798 cx = &ccstack[dbcxix];
06a5b730 1799 }
1800
8dff4fc5
BM		 1801 return cx;
1802}
1803
1804PP(pp_caller)
1805{
1806 dVAR;
1807 dSP;
eb578fdb 1808 const PERL_CONTEXT *cx;
8dff4fc5
BM		 1809 const PERL_CONTEXT *dbcx;
1810 I32 gimme;
d527ce7c 1811 const HEK *stash_hek;
8dff4fc5 1812 I32 count = 0;
ce0b554b 1813 bool has_arg = MAXARG && TOPs;
25502127 1814 const COP *lcop;
8dff4fc5 1815
ce0b554b
FC		 1816 if (MAXARG) {
1817 if (has_arg)
8dff4fc5 1818 count = POPi;
ce0b554b
FC		 1819 else (void)POPs;
1820 }
8dff4fc5 1821
ce0b554b 1822 cx = caller_cx(count + !!(PL_op->op_private & OPpOFFBYONE), &dbcx);
8dff4fc5
BM		 1823 if (!cx) {
1824 if (GIMME != G_ARRAY) {
1825 EXTEND(SP, 1);
1826 RETPUSHUNDEF;
1827 }
1828 RETURN;
1829 }
1830
fb55feef 1831 DEBUG_CX("CALLER");
d0279c7c 1832 assert(CopSTASH(cx->blk_oldcop));
e7886211
FC		 1833 stash_hek = SvTYPE(CopSTASH(cx->blk_oldcop)) == SVt_PVHV
1834 ? HvNAME_HEK((HV*)CopSTASH(cx->blk_oldcop))
1835 : NULL;
a0d0e21e 1836 if (GIMME != G_ARRAY) {
27d41816 1837 EXTEND(SP, 1);
d527ce7c 1838 if (!stash_hek)
3280af22 1839 PUSHs(&PL_sv_undef);
49d8d3a1
MB		 1840 else {
1841 dTARGET;
d527ce7c 1842 sv_sethek(TARG, stash_hek);
49d8d3a1
MB		 1843 PUSHs(TARG);
1844 }
a0d0e21e
LW		 1845 RETURN;
1846 }
a0d0e21e 1847
b3ca2e83 1848 EXTEND(SP, 11);
27d41816 1849
d527ce7c 1850 if (!stash_hek)
3280af22 1851 PUSHs(&PL_sv_undef);
d527ce7c
BF		 1852 else {
1853 dTARGET;
1854 sv_sethek(TARG, stash_hek);
1855 PUSHTARG;
1856 }
6e449a3a 1857 mPUSHs(newSVpv(OutCopFILE(cx->blk_oldcop), 0));
25502127
FC		 1858 lcop = closest_cop(cx->blk_oldcop, cx->blk_oldcop->op_sibling,
1859 cx->blk_sub.retop, TRUE);
1860 if (!lcop)
1861 lcop = cx->blk_oldcop;
1862 mPUSHi((I32)CopLINE(lcop));
ce0b554b 1863 if (!has_arg)
a0d0e21e 1864 RETURN;
7766f137 1865 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
8dff4fc5 1866 GV * const cvgv = CvGV(dbcx->blk_sub.cv);
7766f137 1867 /* So is ccstack[dbcxix]. */
81ed78b2 1868 if (cvgv && isGV(cvgv)) {
561b68a9 1869 SV * const sv = newSV(0);
c445ea15 1870 gv_efullname3(sv, cvgv, NULL);
6e449a3a 1871 mPUSHs(sv);
bf38a478 1872 PUSHs(boolSV(CxHASARGS(cx)));
07b8c804
RGS		 1873 }
1874 else {
84bafc02 1875 PUSHs(newSVpvs_flags("(unknown)", SVs_TEMP));
bf38a478 1876 PUSHs(boolSV(CxHASARGS(cx)));
07b8c804 1877 }
a0d0e21e
LW		 1878 }
1879 else {
84bafc02 1880 PUSHs(newSVpvs_flags("(eval)", SVs_TEMP));
6e449a3a 1881 mPUSHi(0);
a0d0e21e 1882 }
54310121 1883 gimme = (I32)cx->blk_gimme;
1884 if (gimme == G_VOID)
3280af22 1885 PUSHs(&PL_sv_undef);
54310121 1886 else
98625aca 1887 PUSHs(boolSV((gimme & G_WANT) == G_ARRAY));
6b35e009 1888 if (CxTYPE(cx) == CXt_EVAL) {
811a4de9 1889 /* eval STRING */
85a64632 1890 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
19bcb54e
FC		 1891 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
1892 SvCUR(cx->blk_eval.cur_text)-2,
1893 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
3280af22 1894 PUSHs(&PL_sv_no);
0f79a09d 1895 }
811a4de9 1896 /* require */
0f79a09d 1897 else if (cx->blk_eval.old_namesv) {
6e449a3a 1898 mPUSHs(newSVsv(cx->blk_eval.old_namesv));
3280af22 1899 PUSHs(&PL_sv_yes);
06a5b730 1900 }
811a4de9
GS		 1901 /* eval BLOCK (try blocks have old_namesv == 0) */
1902 else {
1903 PUSHs(&PL_sv_undef);
1904 PUSHs(&PL_sv_undef);
1905 }
4633a7c4 1906 }
a682de96
GS		 1907 else {
1908 PUSHs(&PL_sv_undef);
1909 PUSHs(&PL_sv_undef);
1910 }
bafb2adc 1911 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)
ed094faf 1912 && CopSTASH_eq(PL_curcop, PL_debstash))
4633a7c4 1913 {
66a1b24b 1914 AV * const ary = cx->blk_sub.argarray;
c70927a6 1915 const SSize_t off = AvARRAY(ary) - AvALLOC(ary);
a0d0e21e 1916
e1a80902 1917 Perl_init_dbargs(aTHX);
a0d0e21e 1918
3280af22
NIS		 1919 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1920 av_extend(PL_dbargs, AvFILLp(ary) + off);
1921 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1922 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
a0d0e21e 1923 }
6e449a3a 1924 mPUSHi(CopHINTS_get(cx->blk_oldcop));
e476b1b5
GS		 1925 {
1926 SV * mask ;
72dc9ed5 1927 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
114bafba 1928
f07626ad 1929 if (old_warnings == pWARN_NONE)
e476b1b5 1930 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
f07626ad
FC		 1931 else if (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0)
1932 mask = &PL_sv_undef ;
ac27b0f5 1933 else if (old_warnings == pWARN_ALL ||
75b6c4ca
RGS		 1934 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1935 /* Get the bit mask for $warnings::Bits{all}, because
1936 * it could have been extended by warnings::register */
1937 SV **bits_all;
6673a63c 1938 HV * const bits = get_hv("warnings::Bits", 0);
017a3ce5 1939 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
75b6c4ca
RGS		 1940 mask = newSVsv(*bits_all);
1941 }
1942 else {
1943 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1944 }
1945 }
e476b1b5 1946 else
72dc9ed5 1947 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
6e449a3a 1948 mPUSHs(mask);
e476b1b5 1949 }
b3ca2e83 1950
c28fe1ec 1951 PUSHs(cx->blk_oldcop->cop_hints_hash ?
20439bc7 1952 sv_2mortal(newRV_noinc(MUTABLE_SV(cop_hints_2hv(cx->blk_oldcop, 0))))
b3ca2e83 1953 : &PL_sv_undef);
a0d0e21e
LW		 1954 RETURN;
1955}
1956
a0d0e21e
LW		 1957PP(pp_reset)
1958{
97aff369 1959 dVAR;
39644a26 1960 dSP;
ca826051
FC		 1961 const char * tmps;
1962 STRLEN len = 0;
1963 if (MAXARG < 1 || (!TOPs && !POPs))
1964 tmps = NULL, len = 0;
1965 else
1966 tmps = SvPVx_const(POPs, len);
1967 sv_resetpvn(tmps, len, CopSTASH(PL_curcop));
3280af22 1968 PUSHs(&PL_sv_yes);
a0d0e21e
LW		 1969 RETURN;
1970}
1971
dd2155a4
DM		 1972/* like pp_nextstate, but used instead when the debugger is active */
1973
a0d0e21e
LW		 1974PP(pp_dbstate)
1975{
27da23d5 1976 dVAR;
533c011a 1977 PL_curcop = (COP*)PL_op;
a0d0e21e 1978 TAINT_NOT; /* Each statement is presumed innocent */
3280af22 1979 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
a0d0e21e
LW		 1980 FREETMPS;
1981
f410a211
NC		 1982 PERL_ASYNC_CHECK();
1983
5df8de69
DM		 1984 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1985 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
a0d0e21e 1986 {
39644a26 1987 dSP;
eb578fdb 1988 PERL_CONTEXT *cx;
f54cb97a 1989 const I32 gimme = G_ARRAY;
eb160463 1990 U8 hasargs;
0bd48802 1991 GV * const gv = PL_DBgv;
432d4561
JL		 1992 CV * cv = NULL;
1993
1994 if (gv && isGV_with_GP(gv))
1995 cv = GvCV(gv);
a0d0e21e 1996
c2cb6f77 1997 if (!cv || (!CvROOT(cv) && !CvXSUB(cv)))
cea2e8a9 1998 DIE(aTHX_ "No DB::DB routine defined");
a0d0e21e 1999
aea4f609
DM		 2000 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
2001 /* don't do recursive DB::DB call */
a0d0e21e 2002 return NORMAL;
748a9306 2003
a57c6685 2004 ENTER;
4633a7c4
LW		 2005 SAVETMPS;
2006
3280af22 2007 SAVEI32(PL_debug);
55497cff 2008 SAVESTACK_POS();
3280af22 2009 PL_debug = 0;
748a9306 2010 hasargs = 0;
924508f0 2011 SPAGAIN;
748a9306 2012
aed2304a 2013 if (CvISXSUB(cv)) {
c127bd3a
SF		 2014 PUSHMARK(SP);
2015 (void)(*CvXSUB(cv))(aTHX_ cv);
c127bd3a 2016 FREETMPS;
a57c6685 2017 LEAVE;
c127bd3a
SF		 2018 return NORMAL;
2019 }
2020 else {
2021 PUSHBLOCK(cx, CXt_SUB, SP);
2022 PUSHSUB_DB(cx);
2023 cx->blk_sub.retop = PL_op->op_next;
2024 CvDEPTH(cv)++;
9d976ff5
FC		 2025 if (CvDEPTH(cv) >= 2) {
2026 PERL_STACK_OVERFLOW_CHECK();
2027 pad_push(CvPADLIST(cv), CvDEPTH(cv));
2028 }
c127bd3a 2029 SAVECOMPPAD();
9d976ff5 2030 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), CvDEPTH(cv));
c127bd3a
SF		 2031 RETURNOP(CvSTART(cv));
2032 }
a0d0e21e
LW		 2033 }
2034 else
2035 return NORMAL;
2036}
2037
b9d76716
VP		 2038STATIC SV **
2039S_adjust_stack_on_leave(pTHX_ SV **newsp, SV **sp, SV **mark, I32 gimme, U32 flags)
2040{
9a214eec 2041 bool padtmp = 0;
b9d76716
VP		 2042 PERL_ARGS_ASSERT_ADJUST_STACK_ON_LEAVE;
2043
9a214eec
DM		 2044 if (flags & SVs_PADTMP) {
2045 flags &= ~SVs_PADTMP;
2046 padtmp = 1;
2047 }
b9d76716
VP		 2048 if (gimme == G_SCALAR) {
2049 if (MARK < SP)
9a214eec
DM		 2050 *++newsp = ((SvFLAGS(*SP) & flags) || (padtmp && SvPADTMP(*SP)))
2051 ? *SP : sv_mortalcopy(*SP);
b9d76716
VP		 2052 else {
2053 /* MEXTEND() only updates MARK, so reuse it instead of newsp. */
2054 MARK = newsp;
2055 MEXTEND(MARK, 1);
2056 *++MARK = &PL_sv_undef;
2057 return MARK;
2058 }
2059 }
2060 else if (gimme == G_ARRAY) {
2061 /* in case LEAVE wipes old return values */
2062 while (++MARK <= SP) {
9a214eec 2063 if ((SvFLAGS(*MARK) & flags) || (padtmp && SvPADTMP(*MARK)))
b9d76716
VP		 2064 *++newsp = *MARK;
2065 else {
2066 *++newsp = sv_mortalcopy(*MARK);
2067 TAINT_NOT; /* Each item is independent */
2068 }
2069 }
2070 /* When this function was called with MARK == newsp, we reach this
2071 * point with SP == newsp. */
2072 }
2073
2074 return newsp;
2075}
2076
2b9a6457
VP		 2077PP(pp_enter)
2078{
2079 dVAR; dSP;
eb578fdb 2080 PERL_CONTEXT *cx;
7c2d9d03 2081 I32 gimme = GIMME_V;
2b9a6457
VP		 2082
2083 ENTER_with_name("block");
2084
2085 SAVETMPS;
2086 PUSHBLOCK(cx, CXt_BLOCK, SP);
2087
2088 RETURN;
2089}
2090
2091PP(pp_leave)
2092{
2093 dVAR; dSP;
eb578fdb 2094 PERL_CONTEXT *cx;
2b9a6457
VP		 2095 SV **newsp;
2096 PMOP *newpm;
2097 I32 gimme;
2098
2099 if (PL_op->op_flags & OPf_SPECIAL) {
2100 cx = &cxstack[cxstack_ix];
2101 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
2102 }
2103
2104 POPBLOCK(cx,newpm);
2105
2106 gimme = OP_GIMME(PL_op, (cxstack_ix >= 0) ? gimme : G_SCALAR);
2107
2108 TAINT_NOT;
f02ea43c 2109 SP = adjust_stack_on_leave(newsp, SP, newsp, gimme, SVs_PADTMP|SVs_TEMP);
2b9a6457
VP		 2110 PL_curpm = newpm; /* Don't pop $1 et al till now */
2111
2112 LEAVE_with_name("block");
2113
2114 RETURN;
2115}
2116
a0d0e21e
LW		 2117PP(pp_enteriter)
2118{
27da23d5 2119 dVAR; dSP; dMARK;
eb578fdb 2120 PERL_CONTEXT *cx;
f54cb97a 2121 const I32 gimme = GIMME_V;
df530c37 2122 void *itervar; /* location of the iteration variable */
840fe433 2123 U8 cxtype = CXt_LOOP_FOR;
a0d0e21e 2124
d343c3ef 2125 ENTER_with_name("loop1");
4633a7c4
LW		 2126 SAVETMPS;
2127
aafca525
DM		 2128 if (PL_op->op_targ) { /* "my" variable */
2129 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
14f338dc
DM		 2130 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
2131 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
2132 SVs_PADSTALE, SVs_PADSTALE);
2133 }
09edbca0 2134 SAVEPADSVANDMORTALIZE(PL_op->op_targ);
89e00a7c 2135#ifdef USE_ITHREADS
df530c37 2136 itervar = PL_comppad;
89e00a7c 2137#else
aafca525 2138 itervar = &PAD_SVl(PL_op->op_targ);
7766f137 2139#endif
54b9620d 2140 }
aafca525 2141 else { /* symbol table variable */
159b6efe 2142 GV * const gv = MUTABLE_GV(POPs);
f83b46a0
DM		 2143 SV** svp = &GvSV(gv);
2144 save_pushptrptr(gv, SvREFCNT_inc(*svp), SAVEt_GVSV);
561b68a9 2145 *svp = newSV(0);
df530c37 2146 itervar = (void *)gv;
54b9620d 2147 }
4633a7c4 2148
0d863452
RH		 2149 if (PL_op->op_private & OPpITER_DEF)
2150 cxtype |= CXp_FOR_DEF;
2151
d343c3ef 2152 ENTER_with_name("loop2");
a0d0e21e 2153
7766f137 2154 PUSHBLOCK(cx, cxtype, SP);
df530c37 2155 PUSHLOOP_FOR(cx, itervar, MARK);
533c011a 2156 if (PL_op->op_flags & OPf_STACKED) {
d01136d6
BS		 2157 SV *maybe_ary = POPs;
2158 if (SvTYPE(maybe_ary) != SVt_PVAV) {
89ea2908 2159 dPOPss;
d01136d6 2160 SV * const right = maybe_ary;
984a4bea
RD		 2161 SvGETMAGIC(sv);
2162 SvGETMAGIC(right);
4fe3f0fa 2163 if (RANGE_IS_NUMERIC(sv,right)) {
d01136d6 2164 cx->cx_type &= ~CXTYPEMASK;
c6fdafd0
NC		 2165 cx->cx_type |= CXt_LOOP_LAZYIV;
2166 /* Make sure that no-one re-orders cop.h and breaks our
2167 assumptions */
2168 assert(CxTYPE(cx) == CXt_LOOP_LAZYIV);
a2309040 2169#ifdef NV_PRESERVES_UV
f52e41ad
FC		 2170 if ((SvOK(sv) && ((SvNV_nomg(sv) < (NV)IV_MIN) ||
2171 (SvNV_nomg(sv) > (NV)IV_MAX)))
a2309040 2172 ||
f52e41ad
FC		 2173 (SvOK(right) && ((SvNV_nomg(right) > (NV)IV_MAX) ||
2174 (SvNV_nomg(right) < (NV)IV_MIN))))
a2309040 2175#else
f52e41ad 2176 if ((SvOK(sv) && ((SvNV_nomg(sv) <= (NV)IV_MIN)
a2309040 2177 ||
f52e41ad
FC		 2178 ((SvNV_nomg(sv) > 0) &&
2179 ((SvUV_nomg(sv) > (UV)IV_MAX) ||
2180 (SvNV_nomg(sv) > (NV)UV_MAX)))))
a2309040 2181 ||
f52e41ad 2182 (SvOK(right) && ((SvNV_nomg(right) <= (NV)IV_MIN)
a2309040 2183 ||
f52e41ad
FC		 2184 ((SvNV_nomg(right) > 0) &&
2185 ((SvUV_nomg(right) > (UV)IV_MAX) ||
2186 (SvNV_nomg(right) > (NV)UV_MAX))
2187 ))))
a2309040 2188#endif
076d9a11 2189 DIE(aTHX_ "Range iterator outside integer range");
f52e41ad
FC		 2190 cx->blk_loop.state_u.lazyiv.cur = SvIV_nomg(sv);
2191 cx->blk_loop.state_u.lazyiv.end = SvIV_nomg(right);
d4665a05
DM		 2192#ifdef DEBUGGING
2193 /* for correct -Dstv display */
2194 cx->blk_oldsp = sp - PL_stack_base;
2195#endif
89ea2908 2196 }
3f63a782 2197 else {
d01136d6
BS		 2198 cx->cx_type &= ~CXTYPEMASK;
2199 cx->cx_type |= CXt_LOOP_LAZYSV;
2200 /* Make sure that no-one re-orders cop.h and breaks our
2201 assumptions */
2202 assert(CxTYPE(cx) == CXt_LOOP_LAZYSV);
2203 cx->blk_loop.state_u.lazysv.cur = newSVsv(sv);
2204 cx->blk_loop.state_u.lazysv.end = right;
2205 SvREFCNT_inc(right);
2206 (void) SvPV_force_nolen(cx->blk_loop.state_u.lazysv.cur);
267cc4a8
NC		 2207 /* This will do the upgrade to SVt_PV, and warn if the value
2208 is uninitialised. */
10516c54 2209 (void) SvPV_nolen_const(right);
267cc4a8
NC		 2210 /* Doing this avoids a check every time in pp_iter in pp_hot.c
2211 to replace !SvOK() with a pointer to "". */
2212 if (!SvOK(right)) {
2213 SvREFCNT_dec(right);
d01136d6 2214 cx->blk_loop.state_u.lazysv.end = &PL_sv_no;
267cc4a8 2215 }
3f63a782 2216 }
89ea2908 2217 }
d01136d6 2218 else /* SvTYPE(maybe_ary) == SVt_PVAV */ {
502c6561 2219 cx->blk_loop.state_u.ary.ary = MUTABLE_AV(maybe_ary);
d01136d6
BS		 2220 SvREFCNT_inc(maybe_ary);
2221 cx->blk_loop.state_u.ary.ix =
2222 (PL_op->op_private & OPpITER_REVERSED) ?
2223 AvFILL(cx->blk_loop.state_u.ary.ary) + 1 :
2224 -1;
ef3e5ea9 2225 }
89ea2908 2226 }
d01136d6
BS		 2227 else { /* iterating over items on the stack */
2228 cx->blk_loop.state_u.ary.ary = NULL; /* means to use the stack */
ef3e5ea9 2229 if (PL_op->op_private & OPpITER_REVERSED) {
d01136d6 2230 cx->blk_loop.state_u.ary.ix = cx->blk_oldsp + 1;
ef3e5ea9
NC		 2231 }
2232 else {
d01136d6 2233 cx->blk_loop.state_u.ary.ix = MARK - PL_stack_base;
ef3e5ea9 2234 }
4633a7c4 2235 }
a0d0e21e
LW		 2236
2237 RETURN;
2238}
2239
2240PP(pp_enterloop)
2241{
27da23d5 2242 dVAR; dSP;
eb578fdb 2243 PERL_CONTEXT *cx;
f54cb97a 2244 const I32 gimme = GIMME_V;
a0d0e21e 2245
d343c3ef 2246 ENTER_with_name("loop1");
a0d0e21e 2247 SAVETMPS;
d343c3ef 2248 ENTER_with_name("loop2");
a0d0e21e 2249
3b719c58
NC		 2250 PUSHBLOCK(cx, CXt_LOOP_PLAIN, SP);
2251 PUSHLOOP_PLAIN(cx, SP);
a0d0e21e
LW		 2252
2253 RETURN;
2254}
2255
2256PP(pp_leaveloop)
2257{
27da23d5 2258 dVAR; dSP;
eb578fdb 2259 PERL_CONTEXT *cx;
a0d0e21e
LW		 2260 I32 gimme;
2261 SV **newsp;
2262 PMOP *newpm;
2263 SV **mark;
2264
2265 POPBLOCK(cx,newpm);
3b719c58 2266 assert(CxTYPE_is_LOOP(cx));
4fdae800 2267 mark = newsp;
a8bba7fa 2268 newsp = PL_stack_base + cx->blk_loop.resetsp;
f86702cc 2269
a1f49e72 2270 TAINT_NOT;
b9d76716 2271 SP = adjust_stack_on_leave(newsp, SP, MARK, gimme, 0);
f86702cc 2272 PUTBACK;
2273
a8bba7fa 2274 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
3280af22 2275 PL_curpm = newpm; /* ... and pop $1 et al */
f86702cc 2276
d343c3ef
GG		 2277 LEAVE_with_name("loop2");
2278 LEAVE_with_name("loop1");
a0d0e21e 2279
f86702cc 2280 return NORMAL;
a0d0e21e
LW		 2281}
2282
3bdf583b
FC		 2283STATIC void
2284S_return_lvalues(pTHX_ SV **mark, SV **sp, SV **newsp, I32 gimme,
d25b0d7b 2285 PERL_CONTEXT *cx, PMOP *newpm)
3bdf583b 2286{
80422e24 2287 const bool ref = !!(CxLVAL(cx) & OPpENTERSUB_INARGS);
3bdf583b 2288 if (gimme == G_SCALAR) {
d25b0d7b
FC		 2289 if (CxLVAL(cx) && !ref) { /* Leave it as it is if we can. */
2290 SV *sv;
001de122 2291 const char *what = NULL;
d25b0d7b
FC		 2292 if (MARK < SP) {
2293 assert(MARK+1 == SP);
2294 if ((SvPADTMP(TOPs) ||
2295 (SvFLAGS(TOPs) & (SVf_READONLY | SVf_FAKE))
2296 == SVf_READONLY
2297 ) &&
2298 !SvSMAGICAL(TOPs)) {
001de122 2299 what =
d25b0d7b 2300 SvREADONLY(TOPs) ? (TOPs == &PL_sv_undef) ? "undef"
001de122 2301 : "a readonly value" : "a temporary";
d25b0d7b 2302 }
001de122 2303 else goto copy_sv;
d25b0d7b
FC		 2304 }
2305 else {
2306 /* sub:lvalue{} will take us here. */
001de122 2307 what = "undef";
d25b0d7b 2308 }
001de122
FC		 2309 LEAVE;
2310 cxstack_ix--;
2311 POPSUB(cx,sv);
2312 PL_curpm = newpm;
2313 LEAVESUB(sv);
2314 Perl_croak(aTHX_
2315 "Can't return %s from lvalue subroutine", what
2316 );
d25b0d7b 2317 }
93905212 2318 if (MARK < SP) {
a5ad7a5a 2319 copy_sv:
3bdf583b 2320 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
5811c07e 2321 if (!SvPADTMP(*SP)) {
3bdf583b
FC		 2322 *++newsp = SvREFCNT_inc(*SP);
2323 FREETMPS;
2324 sv_2mortal(*newsp);
5811c07e
FC		 2325 }
2326 else {
2327 /* FREETMPS could clobber it */
2328 SV *sv = SvREFCNT_inc(*SP);
2329 FREETMPS;
2330 *++newsp = sv_mortalcopy(sv);
2331 SvREFCNT_dec(sv);
2332 }
3bdf583b
FC		 2333 }
2334 else
e08be60b 2335 *++newsp =
5811c07e
FC		 2336 SvPADTMP(*SP)
2337 ? sv_mortalcopy(*SP)
2338 : !SvTEMP(*SP)
e08be60b
FC		 2339 ? sv_2mortal(SvREFCNT_inc_simple_NN(*SP))
2340 : *SP;
3bdf583b 2341 }
0d235c77
FC		 2342 else {
2343 EXTEND(newsp,1);
3bdf583b 2344 *++newsp = &PL_sv_undef;
0d235c77 2345 }
0e9700df 2346 if (CxLVAL(cx) & OPpDEREF) {
767eda44
FC		 2347 SvGETMAGIC(TOPs);
2348 if (!SvOK(TOPs)) {
0e9700df 2349 TOPs = vivify_ref(TOPs, CxLVAL(cx) & OPpDEREF);
767eda44
FC		 2350 }
2351 }
3bdf583b
FC		 2352 }
2353 else if (gimme == G_ARRAY) {
0e9700df 2354 assert (!(CxLVAL(cx) & OPpDEREF));
80422e24 2355 if (ref || !CxLVAL(cx))
e08be60b
FC		 2356 while (++MARK <= SP)
2357 *++newsp =
5811c07e 2358 SvFLAGS(*MARK) & SVs_PADTMP
80422e24 2359 ? sv_mortalcopy(*MARK)
5811c07e
FC		 2360 : SvTEMP(*MARK)
2361 ? *MARK
80422e24 2362 : sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
e08be60b 2363 else while (++MARK <= SP) {
d25b0d7b
FC		 2364 if (*MARK != &PL_sv_undef
2365 && (SvPADTMP(*MARK)
2366 || (SvFLAGS(*MARK) & (SVf_READONLY|SVf_FAKE))
2367 == SVf_READONLY
2368 )
2369 ) {
2370 SV *sv;
2371 /* Might be flattened array after $#array = */
2372 PUTBACK;
2373 LEAVE;
2374 cxstack_ix--;
2375 POPSUB(cx,sv);
2376 PL_curpm = newpm;
2377 LEAVESUB(sv);
ae917476 2378 /* diag_listed_as: Can't return %s from lvalue subroutine */
d25b0d7b
FC		 2379 Perl_croak(aTHX_
2380 "Can't return a %s from lvalue subroutine",
2381 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2382 }
2383 else
4bee03f8
FC		 2384 *++newsp =
2385 SvTEMP(*MARK)
2386 ? *MARK
2387 : sv_2mortal(SvREFCNT_inc_simple_NN(*MARK));
3bdf583b
FC		 2388 }
2389 }
2390 PL_stack_sp = newsp;
2391}
2392
a0d0e21e
LW		 2393PP(pp_return)
2394{
27da23d5 2395 dVAR; dSP; dMARK;
eb578fdb 2396 PERL_CONTEXT *cx;
f86702cc 2397 bool popsub2 = FALSE;
b45de488 2398 bool clear_errsv = FALSE;
fa1e92c4 2399 bool lval = FALSE;
a0d0e21e
LW		 2400 I32 gimme;
2401 SV **newsp;
2402 PMOP *newpm;
2403 I32 optype = 0;
b6494f15 2404 SV *namesv;
b0d9ce38 2405 SV *sv;
b263a1ad 2406 OP *retop = NULL;
a0d0e21e 2407
0bd48802
AL		 2408 const I32 cxix = dopoptosub(cxstack_ix);
2409
9850bf21
RH		 2410 if (cxix < 0) {
2411 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
2412 * sort block, which is a CXt_NULL
2413 * not a CXt_SUB */
2414 dounwind(0);
d7507f74
RH		 2415 PL_stack_base[1] = *PL_stack_sp;
2416 PL_stack_sp = PL_stack_base + 1;
a0d0e21e
LW		 2417 return 0;
2418 }
9850bf21
RH		 2419 else
2420 DIE(aTHX_ "Can't return outside a subroutine");
a0d0e21e 2421 }
a0d0e21e
LW		 2422 if (cxix < cxstack_ix)
2423 dounwind(cxix);
2424
d7507f74
RH		 2425 if (CxMULTICALL(&cxstack[cxix])) {
2426 gimme = cxstack[cxix].blk_gimme;
2427 if (gimme == G_VOID)
2428 PL_stack_sp = PL_stack_base;
2429 else if (gimme == G_SCALAR) {
2430 PL_stack_base[1] = *PL_stack_sp;
2431 PL_stack_sp = PL_stack_base + 1;
2432 }
9850bf21 2433 return 0;
d7507f74 2434 }
9850bf21 2435
a0d0e21e 2436 POPBLOCK(cx,newpm);
6b35e009 2437 switch (CxTYPE(cx)) {
a0d0e21e 2438 case CXt_SUB:
f86702cc 2439 popsub2 = TRUE;
fa1e92c4 2440 lval = !!CvLVALUE(cx->blk_sub.cv);
f39bc417 2441 retop = cx->blk_sub.retop;
5dd42e15 2442 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
a0d0e21e
LW		 2443 break;
2444 case CXt_EVAL:
b45de488
GS		 2445 if (!(PL_in_eval & EVAL_KEEPERR))
2446 clear_errsv = TRUE;
a0d0e21e 2447 POPEVAL(cx);
b6494f15 2448 namesv = cx->blk_eval.old_namesv;
f39bc417 2449 retop = cx->blk_eval.retop;
1d76a5c3
GS		 2450 if (CxTRYBLOCK(cx))
2451 break;
748a9306
LW		 2452 if (optype == OP_REQUIRE &&
2453 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
2454 {
54310121 2455 /* Unassume the success we assumed earlier. */
b6494f15 2456 (void)hv_delete(GvHVn(PL_incgv),
ecad31f0 2457 SvPVX_const(namesv),
c60dbbc3 2458 SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv),
b6494f15
VP		 2459 G_DISCARD);
2460 DIE(aTHX_ "%"SVf" did not return a true value", SVfARG(namesv));
748a9306 2461 }
a0d0e21e 2462 break;
7766f137 2463 case CXt_FORMAT:
f39bc417 2464 retop = cx->blk_sub.retop;
25375124 2465 POPFORMAT(cx);
7766f137 2466 break;
a0d0e21e 2467 default:
5637ef5b 2468 DIE(aTHX_ "panic: return, type=%u", (unsigned) CxTYPE(cx));
a0d0e21e
LW		 2469 }
2470
a1f49e72 2471 TAINT_NOT;
d25b0d7b 2472 if (lval) S_return_lvalues(aTHX_ MARK, SP, newsp, gimme, cx, newpm);
3bdf583b
FC		 2473 else {
2474 if (gimme == G_SCALAR) {
a29cdaf0
IZ		 2475 if (MARK < SP) {
2476 if (popsub2) {
a8bba7fa 2477 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
6f48390a
FC		 2478 if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
2479 && !SvMAGICAL(TOPs)) {
a29cdaf0
IZ		 2480 *++newsp = SvREFCNT_inc(*SP);
2481 FREETMPS;
2482 sv_2mortal(*newsp);
959e3673
GS		 2483 }
2484 else {
2485 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
a29cdaf0 2486 FREETMPS;
959e3673
GS		 2487 *++newsp = sv_mortalcopy(sv);
2488 SvREFCNT_dec(sv);
a29cdaf0 2489 }
959e3673 2490 }
6f48390a
FC		 2491 else if (SvTEMP(*SP) && SvREFCNT(*SP) == 1
2492 && !SvMAGICAL(*SP)) {
767eda44 2493 *++newsp = *SP;
767eda44 2494 }
959e3673 2495 else
767eda44 2496 *++newsp = sv_mortalcopy(*SP);
959e3673
GS		 2497 }
2498 else
a29cdaf0 2499 *++newsp = sv_mortalcopy(*SP);
959e3673
GS		 2500 }
2501 else
3280af22 2502 *++newsp = &PL_sv_undef;
3bdf583b
FC		 2503 }
2504 else if (gimme == G_ARRAY) {
a1f49e72 2505 while (++MARK <= SP) {
3ed94dc0 2506 *++newsp = popsub2 && SvTEMP(*MARK) && SvREFCNT(*MARK) == 1
6f48390a 2507 && !SvGMAGICAL(*MARK)
f86702cc 2508 ? *MARK : sv_mortalcopy(*MARK);
a1f49e72
CS		 2509 TAINT_NOT; /* Each item is independent */
2510 }
3bdf583b
FC		 2511 }
2512 PL_stack_sp = newsp;
a0d0e21e 2513 }
a0d0e21e 2514
5dd42e15 2515 LEAVE;
f86702cc 2516 /* Stack values are safe: */
2517 if (popsub2) {
5dd42e15 2518 cxstack_ix--;
b0d9ce38 2519 POPSUB(cx,sv); /* release CV and @_ ... */
f86702cc 2520 }
b0d9ce38 2521 else
c445ea15 2522 sv = NULL;
3280af22 2523 PL_curpm = newpm; /* ... and pop $1 et al */
f86702cc 2524
b0d9ce38 2525 LEAVESUB(sv);
8433848b 2526 if (clear_errsv) {
ab69dbc2 2527 CLEAR_ERRSV();
8433848b 2528 }
f39bc417 2529 return retop;
a0d0e21e
LW		 2530}
2531
4f443c3d
FC		 2532/* This duplicates parts of pp_leavesub, so that it can share code with
2533 * pp_return */
2534PP(pp_leavesublv)
2535{
2536 dVAR; dSP;
4f443c3d
FC		 2537 SV **newsp;
2538 PMOP *newpm;
2539 I32 gimme;
eb578fdb 2540 PERL_CONTEXT *cx;
4f443c3d
FC		 2541 SV *sv;
2542
2543 if (CxMULTICALL(&cxstack[cxstack_ix]))
2544 return 0;
2545
2546 POPBLOCK(cx,newpm);
2547 cxstack_ix++; /* temporarily protect top context */
4f443c3d
FC		 2548
2549 TAINT_NOT;
2550
0d235c77 2551 S_return_lvalues(aTHX_ newsp, SP, newsp, gimme, cx, newpm);
4f443c3d
FC		 2552
2553 LEAVE;
4f443c3d 2554 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
25375124 2555 cxstack_ix--;
4f443c3d
FC		 2556 PL_curpm = newpm; /* ... and pop $1 et al */
2557
2558 LEAVESUB(sv);
2559 return cx->blk_sub.retop;
2560}
2561
1f039d60
FC		 2562static I32
2563S_unwind_loop(pTHX_ const char * const opname)
a0d0e21e 2564{
1f039d60 2565 dVAR;
a0d0e21e 2566 I32 cxix;
1f039d60
FC		 2567 if (PL_op->op_flags & OPf_SPECIAL) {
2568 cxix = dopoptoloop(cxstack_ix);
2569 if (cxix < 0)
2570 /* diag_listed_as: Can't "last" outside a loop block */
2571 Perl_croak(aTHX_ "Can't \"%s\" outside a loop block", opname);
2572 }
2573 else {
2574 dSP;
2575 STRLEN label_len;
2576 const char * const label =
2577 PL_op->op_flags & OPf_STACKED
2578 ? SvPV(TOPs,label_len)
2579 : (label_len = strlen(cPVOP->op_pv), cPVOP->op_pv);
2580 const U32 label_flags =
2581 PL_op->op_flags & OPf_STACKED
2582 ? SvUTF8(POPs)
2583 : (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0;
2584 PUTBACK;
2585 cxix = dopoptolabel(label, label_len, label_flags);
2586 if (cxix < 0)
2587 /* diag_listed_as: Label not found for "last %s" */
2588 Perl_croak(aTHX_ "Label not found for \"%s %"SVf"\"",
2589 opname,
2590 SVfARG(PL_op->op_flags & OPf_STACKED
2591 && !SvGMAGICAL(TOPp1s)
2592 ? TOPp1s
2593 : newSVpvn_flags(label,
2594 label_len,
2595 label_flags | SVs_TEMP)));
2596 }
2597 if (cxix < cxstack_ix)
2598 dounwind(cxix);
2599 return cxix;
2600}
2601
2602PP(pp_last)
2603{
2604 dVAR;
eb578fdb 2605 PERL_CONTEXT *cx;
f86702cc 2606 I32 pop2 = 0;
a0d0e21e 2607 I32 gimme;
8772537c 2608 I32 optype;
b263a1ad 2609 OP *nextop = NULL;
a0d0e21e
LW		 2610 SV **newsp;
2611 PMOP *newpm;
a8bba7fa 2612 SV **mark;
c445ea15 2613 SV *sv = NULL;
9d4ba2ae 2614
1f039d60 2615 S_unwind_loop(aTHX_ "last");
a0d0e21e
LW		 2616
2617 POPBLOCK(cx,newpm);
5dd42e15 2618 cxstack_ix++; /* temporarily protect top context */
a8bba7fa 2619 mark = newsp;
6b35e009 2620 switch (CxTYPE(cx)) {
c6fdafd0 2621 case CXt_LOOP_LAZYIV:
d01136d6 2622 case CXt_LOOP_LAZYSV:
3b719c58
NC		 2623 case CXt_LOOP_FOR:
2624 case CXt_LOOP_PLAIN:
2625 pop2 = CxTYPE(cx);
a8bba7fa 2626 newsp = PL_stack_base + cx->blk_loop.resetsp;
022eaa24 2627 nextop = cx->blk_loop.my_op->op_lastop->op_next;
a0d0e21e 2628 break;
f86702cc 2629 case CXt_SUB:
f86702cc 2630 pop2 = CXt_SUB;
f39bc417 2631 nextop = cx->blk_sub.retop;
a0d0e21e 2632 break;
f86702cc 2633 case CXt_EVAL:
2634 POPEVAL(cx);
f39bc417 2635 nextop = cx->blk_eval.retop;
a0d0e21e 2636 break;
7766f137
GS		 2637 case CXt_FORMAT:
2638 POPFORMAT(cx);
f39bc417 2639 nextop = cx->blk_sub.retop;
7766f137 2640 break;
a0d0e21e 2641 default:
5637ef5b 2642 DIE(aTHX_ "panic: last, type=%u", (unsigned) CxTYPE(cx));
a0d0e21e
LW		 2643 }
2644
a1f49e72 2645 TAINT_NOT;
1f039d60 2646 PL_stack_sp = adjust_stack_on_leave(newsp, PL_stack_sp, MARK, gimme,
b9d76716 2647 pop2 == CXt_SUB ? SVs_TEMP : 0);
f86702cc 2648
5dd42e15
DM		 2649 LEAVE;
2650 cxstack_ix--;
f86702cc 2651 /* Stack values are safe: */
2652 switch (pop2) {
c6fdafd0 2653 case CXt_LOOP_LAZYIV:
3b719c58 2654 case CXt_LOOP_PLAIN:
d01136d6 2655 case CXt_LOOP_LAZYSV:
3b719c58 2656 case CXt_LOOP_FOR:
a8bba7fa 2657 POPLOOP(cx); /* release loop vars ... */
4fdae800 2658 LEAVE;
f86702cc 2659 break;
2660 case CXt_SUB:
b0d9ce38 2661 POPSUB(cx,sv); /* release CV and @_ ... */
f86702cc 2662 break;
a0d0e21e 2663 }
3280af22 2664 PL_curpm = newpm; /* ... and pop $1 et al */
a0d0e21e 2665
b0d9ce38 2666 LEAVESUB(sv);
9d4ba2ae
AL		 2667 PERL_UNUSED_VAR(optype);
2668 PERL_UNUSED_VAR(gimme);
f86702cc 2669 return nextop;
a0d0e21e
LW		 2670}
2671
2672PP(pp_next)
2673{
27da23d5 2674 dVAR;
eb578fdb 2675 PERL_CONTEXT *cx;
1f039d60 2676 const I32 inner = PL_scopestack_ix;
a0d0e21e 2677
1f039d60 2678 S_unwind_loop(aTHX_ "next");
a0d0e21e 2679
85538317
GS		 2680 /* clear off anything above the scope we're re-entering, but
2681 * save the rest until after a possible continue block */
1ba6ee2b 2682 TOPBLOCK(cx);
85538317
GS		 2683 if (PL_scopestack_ix < inner)
2684 leave_scope(PL_scopestack[PL_scopestack_ix]);
3a1b2b9e 2685 PL_curcop = cx->blk_oldcop;
47c9d59f 2686 PERL_ASYNC_CHECK();
d57ce4df 2687 return (cx)->blk_loop.my_op->op_nextop;
a0d0e21e
LW		 2688}
2689
2690PP(pp_redo)
2691{
27da23d5 2692 dVAR;
1f039d60 2693 const I32 cxix = S_unwind_loop(aTHX_ "redo");
eb578fdb 2694 PERL_CONTEXT *cx;
a0d0e21e 2695 I32 oldsave;
1f039d60 2696 OP* redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
a0d0e21e 2697
a034e688
DM		 2698 if (redo_op->op_type == OP_ENTER) {
2699 /* pop one less context to avoid $x being freed in while (my $x..) */
2700 cxstack_ix++;
2701 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2702 redo_op = redo_op->op_next;
2703 }
2704
a0d0e21e 2705 TOPBLOCK(cx);
3280af22 2706 oldsave = PL_scopestack[PL_scopestack_ix - 1];
a0d0e21e 2707 LEAVE_SCOPE(oldsave);
936c78b5 2708 FREETMPS;
3a1b2b9e 2709 PL_curcop = cx->blk_oldcop;
47c9d59f 2710 PERL_ASYNC_CHECK();
a034e688 2711 return redo_op;
a0d0e21e
LW		 2712}
2713
0824fdcb 2714STATIC OP *
5db1eb8d 2715S_dofindlabel(pTHX_ OP *o, const char *label, STRLEN len, U32 flags, OP **opstack, OP **oplimit)
a0d0e21e 2716{
97aff369 2717 dVAR;
a0d0e21e 2718 OP **ops = opstack;
a1894d81 2719 static const char* const too_deep = "Target of goto is too deeply nested";
a0d0e21e 2720
7918f24d
NC		 2721 PERL_ARGS_ASSERT_DOFINDLABEL;
2722
fc36a67e 2723 if (ops >= oplimit)
0157ef98 2724 Perl_croak(aTHX_ "%s", too_deep);
11343788
MB		 2725 if (o->op_type == OP_LEAVE ||
2726 o->op_type == OP_SCOPE ||
2727 o->op_type == OP_LEAVELOOP ||
33d34e4c 2728 o->op_type == OP_LEAVESUB ||
11343788 2729 o->op_type == OP_LEAVETRY)
fc36a67e 2730 {
5dc0d613 2731 *ops++ = cUNOPo->op_first;
fc36a67e 2732 if (ops >= oplimit)
0157ef98 2733 Perl_croak(aTHX_ "%s", too_deep);
fc36a67e 2734 }
c4aa4e48 2735 *ops = 0;
11343788 2736 if (o->op_flags & OPf_KIDS) {
aec46f14 2737 OP *kid;
a0d0e21e 2738 /* First try all the kids at this level, since that's likeliest. */
11343788 2739 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
7e8f1eac 2740 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
5db1eb8d
BF		 2741 STRLEN kid_label_len;
2742 U32 kid_label_flags;
2743 const char *kid_label = CopLABEL_len_flags(kCOP,
2744 &kid_label_len, &kid_label_flags);
2745 if (kid_label && (
2746 ( (kid_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ?
2747 (flags & SVf_UTF8)
2748 ? (bytes_cmp_utf8(
2749 (const U8*)kid_label, kid_label_len,
2750 (const U8*)label, len) == 0)
2751 : (bytes_cmp_utf8(
2752 (const U8*)label, len,
2753 (const U8*)kid_label, kid_label_len) == 0)
eade7155
BF		 2754 : ( len == kid_label_len && ((kid_label == label)
2755 || memEQ(kid_label, label, len)))))
7e8f1eac
AD		 2756 return kid;
2757 }
a0d0e21e 2758 }
11343788 2759 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
3280af22 2760 if (kid == PL_lastgotoprobe)
a0d0e21e 2761 continue;
ed8d0fe2
SM		 2762 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2763 if (ops == opstack)
2764 *ops++ = kid;
2765 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2766 ops[-1]->op_type == OP_DBSTATE)
2767 ops[-1] = kid;
2768 else
2769 *ops++ = kid;
2770 }
5db1eb8d 2771 if ((o = dofindlabel(kid, label, len, flags, ops, oplimit)))
11343788 2772 return o;
a0d0e21e
LW		 2773 }
2774 }
c4aa4e48 2775 *ops = 0;
a0d0e21e
LW		 2776 return 0;
2777}
2778
7d1d69cb 2779PP(pp_goto) /* also pp_dump */
a0d0e21e 2780{
27da23d5 2781 dVAR; dSP;
cbbf8932 2782 OP *retop = NULL;
a0d0e21e 2783 I32 ix;
eb578fdb 2784 PERL_CONTEXT *cx;
fc36a67e 2785#define GOTO_DEPTH 64
2786 OP *enterops[GOTO_DEPTH];
cbbf8932 2787 const char *label = NULL;
5db1eb8d
BF		 2788 STRLEN label_len = 0;
2789 U32 label_flags = 0;
bfed75c6 2790 const bool do_dump = (PL_op->op_type == OP_DUMP);
a1894d81 2791 static const char* const must_have_label = "goto must have label";
a0d0e21e 2792
533c011a 2793 if (PL_op->op_flags & OPf_STACKED) {
7d1d69cb
DM		 2794 /* goto EXPR or goto &foo */
2795
9d4ba2ae 2796 SV * const sv = POPs;
55b37f1c 2797 SvGETMAGIC(sv);
a0d0e21e
LW		 2798
2799 /* This egregious kludge implements goto &subroutine */
2800 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2801 I32 cxix;
eb578fdb 2802 PERL_CONTEXT *cx;
ea726b52 2803 CV *cv = MUTABLE_CV(SvRV(sv));
049bd5ff 2804 AV *arg = GvAV(PL_defgv);
a0d0e21e
LW		 2805 I32 oldsave;
2806
e8f7dd13 2807 retry:
4aa0a1f7 2808 if (!CvROOT(cv) && !CvXSUB(cv)) {
7fc63493 2809 const GV * const gv = CvGV(cv);
e8f7dd13 2810 if (gv) {
7fc63493 2811 GV *autogv;
e8f7dd13
GS		 2812 SV *tmpstr;
2813 /* autoloaded stub? */
2814 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2815 goto retry;
c271df94
BF		 2816 autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv),
2817 GvNAMELEN(gv),
2818 GvNAMEUTF8(gv) ? SVf_UTF8 : 0);
e8f7dd13
GS		 2819 if (autogv && (cv = GvCV(autogv)))
2820 goto retry;
2821 tmpstr = sv_newmortal();
c445ea15 2822 gv_efullname3(tmpstr, gv, NULL);
be2597df 2823 DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr));
4aa0a1f7 2824 }
cea2e8a9 2825 DIE(aTHX_ "Goto undefined subroutine");
4aa0a1f7
AD		 2826 }
2827
a0d0e21e 2828 /* First do some returnish stuff. */
b37c2d43 2829 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
71fc2216 2830 FREETMPS;
a0d0e21e 2831 cxix = dopoptosub(cxstack_ix);
8da3792e
S		 2832 if (cxix < cxstack_ix) {
2833 if (cxix < 0) {
2834 SvREFCNT_dec(cv);
2835 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2836 }
a0d0e21e 2837 dounwind(cxix);
8da3792e 2838 }
a0d0e21e 2839 TOPBLOCK(cx);
2d43a17f 2840 SPAGAIN;
564abe23 2841 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2d43a17f 2842 if (CxTYPE(cx) == CXt_EVAL) {
110af908 2843 SvREFCNT_dec(cv);
c74ace89 2844 if (CxREALEVAL(cx))
00455a92 2845 /* diag_listed_as: Can't goto subroutine from an eval-%s */
c74ace89
DM		 2846 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2847 else
00455a92 2848 /* diag_listed_as: Can't goto subroutine from an eval-%s */
c74ace89 2849 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2d43a17f 2850 }
9850bf21 2851 else if (CxMULTICALL(cx))
110af908
FC		 2852 {
2853 SvREFCNT_dec(cv);
9850bf21 2854 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
110af908 2855 }
bafb2adc 2856 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
a0d0e21e 2857 AV* av = cx->blk_sub.argarray;
bfed75c6 2858
049bd5ff
FC		 2859 /* abandon the original @_ if it got reified or if it is
2860 the same as the current @_ */
2861 if (AvREAL(av) || av == arg) {
b1464ded 2862 SvREFCNT_dec(av);
d8b46c1b 2863 av = newAV();
11ca45c0 2864 AvREIFY_only(av);
ad64d0ec 2865 PAD_SVl(0) = MUTABLE_SV(cx->blk_sub.argarray = av);
62b1ebc2 2866 }
049bd5ff 2867 else CLEAR_ARGARRAY(av);
a0d0e21e 2868 }
049bd5ff
FC		 2869 /* We donate this refcount later to the callee’s pad. */
2870 SvREFCNT_inc_simple_void(arg);
6b35e009 2871 if (CxTYPE(cx) == CXt_SUB &&
b150fb22 2872 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
a0d0e21e 2873 SvREFCNT_dec(cx->blk_sub.cv);
3280af22 2874 oldsave = PL_scopestack[PL_scopestack_ix - 1];
a0d0e21e
LW		 2875 LEAVE_SCOPE(oldsave);
2876
1d59c038
FC		 2877 /* A destructor called during LEAVE_SCOPE could have undefined
2878 * our precious cv. See bug #99850. */
2879 if (!CvROOT(cv) && !CvXSUB(cv)) {
2880 const GV * const gv = CvGV(cv);
049bd5ff 2881 SvREFCNT_dec(arg);
1d59c038
FC		 2882 if (gv) {
2883 SV * const tmpstr = sv_newmortal();
2884 gv_efullname3(tmpstr, gv, NULL);
2885 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",
2886 SVfARG(tmpstr));
2887 }
2888 DIE(aTHX_ "Goto undefined subroutine");
2889 }
2890
a0d0e21e
LW		 2891 /* Now do some callish stuff. */
2892 SAVETMPS;
5023d17a 2893 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
aed2304a 2894 if (CvISXSUB(cv)) {
b37c2d43 2895 OP* const retop = cx->blk_sub.retop;
cb65b687
DM		 2896 SV **newsp;
2897 I32 gimme;
8c9d3376 2898 const SSize_t items = arg ? AvFILLp(arg) + 1 : 0;
049bd5ff
FC		 2899 SV** mark;
2900
cb65b687
DM		 2901 PERL_UNUSED_VAR(newsp);
2902 PERL_UNUSED_VAR(gimme);
2903
049bd5ff 2904 /* put GvAV(defgv) back onto stack */
8c9d3376
FC		 2905 if (items) {
2906 EXTEND(SP, items+1); /* @_ could have been extended. */
2907 Copy(AvARRAY(arg), SP + 1, items, SV*);
2908 }
049bd5ff
FC		 2909 mark = SP;
2910 SP += items;
8c9d3376 2911 if (items && AvREAL(arg)) {
de935cc9 2912 SSize_t index;
b1464ded 2913 for (index=0; index<items; index++)
dd2a7f90
FC		 2914 if (SP[-index])
2915 SvREFCNT_inc_void_NN(sv_2mortal(SP[-index]));
2916 else {
199f858d
FC		 2917 SP[-index] = sv_2mortal(newSVavdefelem(arg,
2918 AvFILLp(arg) - index, 1));
dd2a7f90 2919 }
049bd5ff
FC		 2920 }
2921 SvREFCNT_dec(arg);
2922 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
2923 /* Restore old @_ */
2924 arg = GvAV(PL_defgv);
2925 GvAV(PL_defgv) = cx->blk_sub.savearray;
2926 SvREFCNT_dec(arg);
b1464ded 2927 }
1fa4e549 2928
b37c2d43
AL		 2929 /* XS subs don't have a CxSUB, so pop it */
2930 POPBLOCK(cx, PL_curpm);
2931 /* Push a mark for the start of arglist */
2932 PUSHMARK(mark);
2933 PUTBACK;
2934 (void)(*CvXSUB(cv))(aTHX_ cv);
a57c6685 2935 LEAVE;
47c9d59f 2936 PERL_ASYNC_CHECK();
5eff7df7 2937 return retop;
a0d0e21e
LW		 2938 }
2939 else {
b70d5558 2940 PADLIST * const padlist = CvPADLIST(cv);
a0d0e21e 2941 cx->blk_sub.cv = cv;
1a5b3db4 2942 cx->blk_sub.olddepth = CvDEPTH(cv);
dd2155a4 2943
a0d0e21e
LW		 2944 CvDEPTH(cv)++;
2945 if (CvDEPTH(cv) < 2)
74c765eb 2946 SvREFCNT_inc_simple_void_NN(cv);
dd2155a4 2947 else {
2b9dff67 2948 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION))
44a8e56a 2949 sub_crush_depth(cv);
26019298 2950 pad_push(padlist, CvDEPTH(cv));
a0d0e21e 2951 }
426a09cd 2952 PL_curcop = cx->blk_oldcop;
fd617465
DM		 2953 SAVECOMPPAD();
2954 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
bafb2adc 2955 if (CxHASARGS(cx))
6d4ff0d2 2956 {
dd2155a4 2957 CX_CURPAD_SAVE(cx->blk_sub);
a0d0e21e 2958
049bd5ff
FC		 2959 /* cx->blk_sub.argarray has no reference count, so we
2960 need something to hang on to our argument array so
2961 that cx->blk_sub.argarray does not end up pointing
2962 to freed memory as the result of undef *_. So put
2963 it in the callee’s pad, donating our refer-
2964 ence count. */
2965 SvREFCNT_dec(PAD_SVl(0));
2966 PAD_SVl(0) = (SV *)(cx->blk_sub.argarray = arg);
2967
2968 /* GvAV(PL_defgv) might have been modified on scope
2969 exit, so restore it. */
2970 if (arg != GvAV(PL_defgv)) {
2971 AV * const av = GvAV(PL_defgv);
2972 GvAV(PL_defgv) = (AV *)SvREFCNT_inc_simple(arg);
2973 SvREFCNT_dec(av);
a0d0e21e
LW		 2974 }
2975 }
049bd5ff 2976 else SvREFCNT_dec(arg);
491527d0 2977 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
005a8a35 2978 Perl_get_db_sub(aTHX_ NULL, cv);
b37c2d43 2979 if (PERLDB_GOTO) {
b96d8cd9 2980 CV * const gotocv = get_cvs("DB::goto", 0);
b37c2d43
AL		 2981 if (gotocv) {
2982 PUSHMARK( PL_stack_sp );
ad64d0ec 2983 call_sv(MUTABLE_SV(gotocv), G_SCALAR | G_NODEBUG);
b37c2d43
AL		 2984 PL_stack_sp--;
2985 }
491527d0 2986 }
1ce6579f 2987 }
47c9d59f 2988 PERL_ASYNC_CHECK();
a0d0e21e
LW		 2989 RETURNOP(CvSTART(cv));
2990 }
2991 }
1614b0e3 2992 else {
7d1d69cb 2993 /* goto EXPR */
55b37f1c 2994 label = SvPV_nomg_const(sv, label_len);
5db1eb8d 2995 label_flags = SvUTF8(sv);
1614b0e3 2996 }
a0d0e21e 2997 }
2fc690dc 2998 else if (!(PL_op->op_flags & OPf_SPECIAL)) {
7d1d69cb 2999 /* goto LABEL or dump LABEL */
5db1eb8d
BF		 3000 label = cPVOP->op_pv;
3001 label_flags = (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0;
3002 label_len = strlen(label);
3003 }
0157ef98 3004 if (!(do_dump || label_len)) DIE(aTHX_ "%s", must_have_label);
a0d0e21e 3005
f410a211
NC		 3006 PERL_ASYNC_CHECK();
3007
3532f34a 3008 if (label_len) {
cbbf8932 3009 OP *gotoprobe = NULL;
3b2447bc 3010 bool leaving_eval = FALSE;
33d34e4c 3011 bool in_block = FALSE;
cbbf8932 3012 PERL_CONTEXT *last_eval_cx = NULL;
a0d0e21e
LW		 3013
3014 /* find label */
3015
d4c19fe8 3016 PL_lastgotoprobe = NULL;
a0d0e21e
LW		 3017 *enterops = 0;
3018 for (ix = cxstack_ix; ix >= 0; ix--) {
3019 cx = &cxstack[ix];
6b35e009 3020 switch (CxTYPE(cx)) {
a0d0e21e 3021 case CXt_EVAL:
3b2447bc 3022 leaving_eval = TRUE;
971ecbe6 3023 if (!CxTRYBLOCK(cx)) {
a4f3a277
RH		 3024 gotoprobe = (last_eval_cx ?
3025 last_eval_cx->blk_eval.old_eval_root :
3026 PL_eval_root);
3027 last_eval_cx = cx;
9c5794fe
RH		 3028 break;
3029 }
3030 /* else fall through */
c6fdafd0 3031 case CXt_LOOP_LAZYIV:
d01136d6 3032 case CXt_LOOP_LAZYSV:
3b719c58
NC		 3033 case CXt_LOOP_FOR:
3034 case CXt_LOOP_PLAIN:
bb5aedc1
VP		 3035 case CXt_GIVEN:
3036 case CXt_WHEN:
a0d0e21e
LW		 3037 gotoprobe = cx->blk_oldcop->op_sibling;
3038 break;
3039 case CXt_SUBST:
3040 continue;
3041 case CXt_BLOCK:
33d34e4c 3042 if (ix) {
a0d0e21e 3043 gotoprobe = cx->blk_oldcop->op_sibling;
33d34e4c
AE		 3044 in_block = TRUE;
3045 } else
3280af22 3046 gotoprobe = PL_main_root;
a0d0e21e 3047 break;
b3933176 3048 case CXt_SUB:
9850bf21 3049 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
b3933176
CS		 3050 gotoprobe = CvROOT(cx->blk_sub.cv);
3051 break;
3052 }
3053 /* FALL THROUGH */
7766f137 3054 case CXt_FORMAT:
0a753a76 3055 case CXt_NULL:
a651a37d 3056 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
a0d0e21e
LW		 3057 default:
3058 if (ix)
5637ef5b
NC		 3059 DIE(aTHX_ "panic: goto, type=%u, ix=%ld",
3060 CxTYPE(cx), (long) ix);
3280af22 3061 gotoprobe = PL_main_root;
a0d0e21e
LW		 3062 break;
3063 }
2b597662 3064 if (gotoprobe) {
5db1eb8d 3065 retop = dofindlabel(gotoprobe, label, label_len, label_flags,
2b597662
GS		 3066 enterops, enterops + GOTO_DEPTH);
3067 if (retop)
3068 break;
eae48c89
Z		 3069 if (gotoprobe->op_sibling &&
3070 gotoprobe->op_sibling->op_type == OP_UNSTACK &&
3071 gotoprobe->op_sibling->op_sibling) {
3072 retop = dofindlabel(gotoprobe->op_sibling->op_sibling,
5db1eb8d
BF		 3073 label, label_len, label_flags, enterops,
3074 enterops + GOTO_DEPTH);
eae48c89
Z		 3075 if (retop)
3076 break;
3077 }
2b597662 3078 }
3280af22 3079 PL_lastgotoprobe = gotoprobe;
a0d0e21e
LW		 3080 }
3081 if (!retop)
b17a0679
FC		 3082 DIE(aTHX_ "Can't find label %"UTF8f,
3083 UTF8fARG(label_flags, label_len, label));
a0d0e21e 3084
3b2447bc
RH		 3085 /* if we're leaving an eval, check before we pop any frames
3086 that we're not going to punt, otherwise the error
3087 won't be caught */
3088
3089 if (leaving_eval && *enterops && enterops[1]) {
3090 I32 i;
3091 for (i = 1; enterops[i]; i++)
3092 if (enterops[i]->op_type == OP_ENTERITER)
3093 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
3094 }
3095
b500e03b
GG		 3096 if (*enterops && enterops[1]) {
3097 I32 i = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3098 if (enterops[i])
3099 deprecate("\"goto\" to jump into a construct");
3100 }
3101
a0d0e21e
LW		 3102 /* pop unwanted frames */
3103
3104 if (ix < cxstack_ix) {
3105 I32 oldsave;
3106
3107 if (ix < 0)
3108 ix = 0;
3109 dounwind(ix);
3110 TOPBLOCK(cx);
3280af22 3111 oldsave = PL_scopestack[PL_scopestack_ix];
a0d0e21e
LW		 3112 LEAVE_SCOPE(oldsave);
3113 }
3114
3115 /* push wanted frames */
3116
748a9306 3117 if (*enterops && enterops[1]) {
0bd48802 3118 OP * const oldop = PL_op;
33d34e4c
AE		 3119 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
3120 for (; enterops[ix]; ix++) {
533c011a 3121 PL_op = enterops[ix];
84902520
TB		 3122 /* Eventually we may want to stack the needed arguments
3123 * for each op. For now, we punt on the hard ones. */
533c011a 3124 if (PL_op->op_type == OP_ENTERITER)
894356b3 3125 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
16c91539 3126 PL_op->op_ppaddr(aTHX);
a0d0e21e 3127 }
533c011a 3128 PL_op = oldop;
a0d0e21e
LW		 3129 }
3130 }
3131
3132 if (do_dump) {
a5f75d66 3133#ifdef VMS
6b88bc9c 3134 if (!retop) retop = PL_main_start;
a5f75d66 3135#endif
3280af22
NIS		 3136 PL_restartop = retop;
3137 PL_do_undump = TRUE;
a0d0e21e
LW		 3138
3139 my_unexec();
3140
3280af22
NIS		 3141 PL_restartop = 0; /* hmm, must be GNU unexec().. */
3142 PL_do_undump = FALSE;
a0d0e21e
LW		 3143 }
3144
47c9d59f 3145 PERL_ASYNC_CHECK();
a0d0e21e
LW		 3146 RETURNOP(retop);
3147}
3148
3149PP(pp_exit)
3150{
97aff369 3151 dVAR;
39644a26 3152 dSP;
a0d0e21e
LW		 3153 I32 anum;
3154
3155 if (MAXARG < 1)
3156 anum = 0;
9d3c658e
FC		 3157 else if (!TOPs) {
3158 anum = 0; (void)POPs;
3159 }
ff0cee69 3160 else {
a0d0e21e 3161 anum = SvIVx(POPs);
d98f61e7
GS		 3162#ifdef VMS
3163 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
ff0cee69 3164 anum = 0;
96e176bf 3165 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
ff0cee69 3166#endif
3167 }
cc3604b1 3168 PL_exit_flags |= PERL_EXIT_EXPECTED;
81d86705
NC		 3169#ifdef PERL_MAD
3170 /* KLUDGE: disable exit 0 in BEGIN blocks when we're just compiling */
3171 if (anum || !(PL_minus_c && PL_madskills))
3172 my_exit(anum);
3173#else
a0d0e21e 3174 my_exit(anum);
81d86705 3175#endif
3280af22 3176 PUSHs(&PL_sv_undef);
a0d0e21e
LW		 3177 RETURN;
3178}
3179
a0d0e21e
LW		 3180/* Eval. */
3181
0824fdcb 3182STATIC void
cea2e8a9 3183S_save_lines(pTHX_ AV *array, SV *sv)
a0d0e21e 3184{
504618e9 3185 const char *s = SvPVX_const(sv);
890ce7af 3186 const char * const send = SvPVX_const(sv) + SvCUR(sv);
504618e9 3187 I32 line = 1;
a0d0e21e 3188
7918f24d
NC		 3189 PERL_ARGS_ASSERT_SAVE_LINES;
3190
a0d0e21e 3191 while (s && s < send) {
f54cb97a 3192 const char *t;
b9f83d2f 3193 SV * const tmpstr = newSV_type(SVt_PVMG);
a0d0e21e 3194
1d963ff3 3195 t = (const char *)memchr(s, '\n', send - s);
a0d0e21e
LW		 3196 if (t)
3197 t++;
3198 else
3199 t = send;
3200
3201 sv_setpvn(tmpstr, s, t - s);
3202 av_store(array, line++, tmpstr);
3203 s = t;
3204 }
3205}
3206
22f16304
RU		 3207/*
3208=for apidoc docatch
3209
3210Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context.
3211
32120 is used as continue inside eval,
3213
32143 is used for a die caught by an inner eval - continue inner loop
3215
3216See cop.h: je_mustcatch, when set at any runlevel to TRUE, means eval ops must
3217establish a local jmpenv to handle exception traps.
3218
3219=cut
3220*/
0824fdcb 3221STATIC OP *
cea2e8a9 3222S_docatch(pTHX_ OP *o)
1e422769 3223{
97aff369 3224 dVAR;
6224f72b 3225 int ret;
06b5626a 3226 OP * const oldop = PL_op;
db36c5a1 3227 dJMPENV;
1e422769 3228
1e422769 3229#ifdef DEBUGGING
54310121 3230 assert(CATCH_GET == TRUE);
1e422769 3231#endif
312caa8e 3232 PL_op = o;
8bffa5f8 3233
14dd3ad8 3234 JMPENV_PUSH(ret);
6224f72b 3235 switch (ret) {
312caa8e 3236 case 0:
abd70938
DM		 3237 assert(cxstack_ix >= 0);
3238 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3239 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
14dd3ad8 3240 redo_body:
85aaa934 3241 CALLRUNOPS(aTHX);
312caa8e
CS		 3242 break;
3243 case 3:
8bffa5f8 3244 /* die caught by an inner eval - continue inner loop */
febb3a6d
Z		 3245 if (PL_restartop && PL_restartjmpenv == PL_top_env) {
3246 PL_restartjmpenv = NULL;
312caa8e
CS		 3247 PL_op = PL_restartop;
3248 PL_restartop = 0;
3249 goto redo_body;
3250 }
3251 /* FALL THROUGH */
3252 default:
14dd3ad8 3253 JMPENV_POP;
533c011a 3254 PL_op = oldop;
6224f72b 3255 JMPENV_JUMP(ret);
118e2215 3256 assert(0); /* NOTREACHED */
1e422769 3257 }
14dd3ad8 3258 JMPENV_POP;
533c011a 3259 PL_op = oldop;
5f66b61c 3260 return NULL;
1e422769 3261}
3262
a3985cdc
DM		 3263
3264/*
3265=for apidoc find_runcv
3266
3267Locate the CV corresponding to the currently executing sub or eval.
d819b83a
DM		 3268If db_seqp is non_null, skip CVs that are in the DB package and populate
3269*db_seqp with the cop sequence number at the point that the DB:: code was
3270entered. (allows debuggers to eval in the scope of the breakpoint rather
cf525c36 3271than in the scope of the debugger itself).
a3985cdc
DM		 3272
3273=cut
3274*/
3275
3276CV*
d819b83a 3277Perl_find_runcv(pTHX_ U32 *db_seqp)
a3985cdc 3278{
db4cf31d 3279 return Perl_find_runcv_where(aTHX_ 0, 0, db_seqp);
70794f7b
FC		 3280}
3281
3282/* If this becomes part of the API, it might need a better name. */
3283CV *
db4cf31d 3284Perl_find_runcv_where(pTHX_ U8 cond, IV arg, U32 *db_seqp)
70794f7b 3285{
97aff369 3286 dVAR;
a3985cdc 3287 PERL_SI *si;
b4b0692a 3288 int level = 0;
a3985cdc 3289
d819b83a 3290 if (db_seqp)
c3923c33
DM		 3291 *db_seqp =
3292 PL_curcop == &PL_compiling
3293 ? PL_cop_seqmax
3294 : PL_curcop->cop_seq;
3295
a3985cdc 3296 for (si = PL_curstackinfo; si; si = si->si_prev) {
06b5626a 3297 I32 ix;
a3985cdc 3298 for (ix = si->si_cxix; ix >= 0; ix--) {
06b5626a 3299 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
70794f7b 3300 CV *cv = NULL;
d819b83a 3301 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
70794f7b 3302 cv = cx->blk_sub.cv;
d819b83a
DM		 3303 /* skip DB:: code */
3304 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
3305 *db_seqp = cx->blk_oldcop->cop_seq;
3306 continue;
3307 }
a453e28a
DM		 3308 if (cx->cx_type & CXp_SUB_RE)
3309 continue;
d819b83a 3310 }
a3985cdc 3311 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
70794f7b
FC		 3312 cv = cx->blk_eval.cv;
3313 if (cv) {
3314 switch (cond) {
db4cf31d
FC		 3315 case FIND_RUNCV_padid_eq:
3316 if (!CvPADLIST(cv)
a56015b9 3317 || PadlistNAMES(CvPADLIST(cv)) != INT2PTR(PADNAMELIST *, arg))
8771da69 3318 continue;
b4b0692a
FC		 3319 return cv;
3320 case FIND_RUNCV_level_eq:
db4cf31d 3321 if (level++ != arg) continue;
70794f7b
FC		 3322 /* GERONIMO! */
3323 default:
3324 return cv;
3325 }
3326 }
a3985cdc
DM		 3327 }
3328 }
db4cf31d 3329 return cond == FIND_RUNCV_padid_eq ? NULL : PL_main_cv;
a3985cdc
DM		 3330}
3331
3332
27e90453
DM		 3333/* Run yyparse() in a setjmp wrapper. Returns:
3334 * 0: yyparse() successful
3335 * 1: yyparse() failed
3336 * 3: yyparse() died
3337 */
3338STATIC int
28ac2b49 3339S_try_yyparse(pTHX_ int gramtype)
27e90453
DM		 3340{
3341 int ret;
3342 dJMPENV;
3343
3344 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
3345 JMPENV_PUSH(ret);
3346 switch (ret) {
3347 case 0:
28ac2b49 3348 ret = yyparse(gramtype) ? 1 : 0;
27e90453
DM		 3349 break;
3350 case 3:
3351 break;
3352 default:
3353 JMPENV_POP;
3354 JMPENV_JUMP(ret);
118e2215 3355 assert(0); /* NOTREACHED */
27e90453
DM		 3356 }
3357 JMPENV_POP;
3358 return ret;
3359}
3360
3361
104a8185
DM		 3362/* Compile a require/do or an eval ''.
3363 *
a3985cdc 3364 * outside is the lexically enclosing CV (if any) that invoked us.
104a8185
DM		 3365 * seq is the current COP scope value.
3366 * hh is the saved hints hash, if any.
3367 *
410be5db 3368 * Returns a bool indicating whether the compile was successful; if so,
104a8185
DM		 3369 * PL_eval_start contains the first op of the compiled code; otherwise,
3370 * pushes undef.
3371 *
3372 * This function is called from two places: pp_require and pp_entereval.
3373 * These can be distinguished by whether PL_op is entereval.
7d116edc
FC		 3374 */
3375
410be5db 3376STATIC bool
104a8185 3377S_doeval(pTHX_ int gimme, CV* outside, U32 seq, HV *hh)
a0d0e21e 3378{
27da23d5 3379 dVAR; dSP;
46c461b5 3380 OP * const saveop = PL_op;
104a8185 3381 bool clear_hints = saveop->op_type != OP_ENTEREVAL;
f45b078d 3382 COP * const oldcurcop = PL_curcop;
26c9400e 3383 bool in_require = (saveop->op_type == OP_REQUIRE);
27e90453 3384 int yystatus;
676a678a 3385 CV *evalcv;
a0d0e21e 3386
27e90453 3387 PL_in_eval = (in_require
6dc8a9e4 3388 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
a1941760
DM		 3389 : (EVAL_INEVAL |
3390 ((PL_op->op_private & OPpEVAL_RE_REPARSING)
3391 ? EVAL_RE_REPARSING : 0)));
a0d0e21e 3392
1ce6579f 3393 PUSHMARK(SP);
3394
676a678a
Z		 3395 evalcv = MUTABLE_CV(newSV_type(SVt_PVCV));
3396 CvEVAL_on(evalcv);
2090ab20 3397 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
676a678a 3398 cxstack[cxstack_ix].blk_eval.cv = evalcv;
86a64801 3399 cxstack[cxstack_ix].blk_gimme = gimme;
2090ab20 3400
676a678a
Z		 3401 CvOUTSIDE_SEQ(evalcv) = seq;
3402 CvOUTSIDE(evalcv) = MUTABLE_CV(SvREFCNT_inc_simple(outside));
a3985cdc 3403
dd2155a4 3404 /* set up a scratch pad */
a0d0e21e 3405
676a678a 3406 CvPADLIST(evalcv) = pad_new(padnew_SAVE);
cecbe010 3407 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
2c05e328 3408
07055b4c 3409
81d86705 3410 if (!PL_madskills)
676a678a 3411 SAVEMORTALIZESV(evalcv); /* must remain until end of current statement */
748a9306 3412
a0d0e21e
LW		 3413 /* make sure we compile in the right package */
3414
ed094faf 3415 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
03d9f026 3416 SAVEGENERICSV(PL_curstash);
cb1ad50e
FC		 3417 PL_curstash = (HV *)CopSTASH(PL_curcop);
3418 if (SvTYPE(PL_curstash) != SVt_PVHV) PL_curstash = NULL;
3419 else SvREFCNT_inc_simple_void(PL_curstash);
a0d0e21e 3420 }
3c10abe3 3421 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
3280af22
NIS		 3422 SAVESPTR(PL_beginav);
3423 PL_beginav = newAV();
3424 SAVEFREESV(PL_beginav);
3c10abe3
AG		 3425 SAVESPTR(PL_unitcheckav);
3426 PL_unitcheckav = newAV();
3427 SAVEFREESV(PL_unitcheckav);
a0d0e21e 3428
81d86705 3429#ifdef PERL_MAD