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