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