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