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