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); |
b405d38b | 290 | CX_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 | ||
10088f56 | 930 | /* also used for: pp_mapstart() */ |
a0d0e21e LW |
931 | PP(pp_grepstart) |
932 | { | |
20b7effb | 933 | dSP; |
a0d0e21e LW |
934 | SV *src; |
935 | ||
6cae08a8 | 936 | if (PL_stack_base + TOPMARK == SP) { |
a0d0e21e | 937 | (void)POPMARK; |
54310121 | 938 | if (GIMME_V == G_SCALAR) |
6e449a3a | 939 | mXPUSHi(0); |
533c011a | 940 | RETURNOP(PL_op->op_next->op_next); |
a0d0e21e | 941 | } |
6cae08a8 | 942 | PL_stack_sp = PL_stack_base + TOPMARK + 1; |
897d3989 NC |
943 | Perl_pp_pushmark(aTHX); /* push dst */ |
944 | Perl_pp_pushmark(aTHX); /* push src */ | |
d343c3ef | 945 | ENTER_with_name("grep"); /* enter outer scope */ |
a0d0e21e LW |
946 | |
947 | SAVETMPS; | |
ffd49c98 | 948 | SAVE_DEFSV; |
d343c3ef | 949 | ENTER_with_name("grep_item"); /* enter inner scope */ |
7766f137 | 950 | SAVEVPTR(PL_curpm); |
a0d0e21e | 951 | |
6cae08a8 | 952 | src = PL_stack_base[TOPMARK]; |
60779a30 | 953 | if (SvPADTMP(src)) { |
6cae08a8 | 954 | src = PL_stack_base[TOPMARK] = sv_mortalcopy(src); |
a0ed822e FC |
955 | PL_tmps_floor++; |
956 | } | |
a0d0e21e | 957 | SvTEMP_off(src); |
ffd49c98 | 958 | DEFSV_set(src); |
a0d0e21e LW |
959 | |
960 | PUTBACK; | |
533c011a | 961 | if (PL_op->op_type == OP_MAPSTART) |
897d3989 | 962 | Perl_pp_pushmark(aTHX); /* push top */ |
533c011a | 963 | return ((LOGOP*)PL_op->op_next)->op_other; |
a0d0e21e LW |
964 | } |
965 | ||
a0d0e21e LW |
966 | PP(pp_mapwhile) |
967 | { | |
20b7effb | 968 | dSP; |
1c23e2bd | 969 | const U8 gimme = GIMME_V; |
6cae08a8 | 970 | I32 items = (SP - PL_stack_base) - TOPMARK; /* how many new items */ |
a0d0e21e LW |
971 | I32 count; |
972 | I32 shift; | |
973 | SV** src; | |
ac27b0f5 | 974 | SV** dst; |
a0d0e21e | 975 | |
544f3153 | 976 | /* first, move source pointer to the next item in the source list */ |
3280af22 | 977 | ++PL_markstack_ptr[-1]; |
544f3153 GS |
978 | |
979 | /* if there are new items, push them into the destination list */ | |
4c90a460 | 980 | if (items && gimme != G_VOID) { |
544f3153 GS |
981 | /* might need to make room back there first */ |
982 | if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) { | |
983 | /* XXX this implementation is very pessimal because the stack | |
984 | * is repeatedly extended for every set of items. Is possible | |
985 | * to do this without any stack extension or copying at all | |
986 | * by maintaining a separate list over which the map iterates | |
18ef8bea | 987 | * (like foreach does). --gsar */ |
544f3153 GS |
988 | |
989 | /* everything in the stack after the destination list moves | |
990 | * towards the end the stack by the amount of room needed */ | |
991 | shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]); | |
992 | ||
993 | /* items to shift up (accounting for the moved source pointer) */ | |
994 | count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1); | |
18ef8bea BT |
995 | |
996 | /* This optimization is by Ben Tilly and it does | |
997 | * things differently from what Sarathy (gsar) | |
998 | * is describing. The downside of this optimization is | |
999 | * that leaves "holes" (uninitialized and hopefully unused areas) | |
1000 | * to the Perl stack, but on the other hand this | |
1001 | * shouldn't be a problem. If Sarathy's idea gets | |
1002 | * implemented, this optimization should become | |
1003 | * irrelevant. --jhi */ | |
1004 | if (shift < count) | |
1005 | shift = count; /* Avoid shifting too often --Ben Tilly */ | |
bfed75c6 | 1006 | |
924508f0 GS |
1007 | EXTEND(SP,shift); |
1008 | src = SP; | |
1009 | dst = (SP += shift); | |
3280af22 NIS |
1010 | PL_markstack_ptr[-1] += shift; |
1011 | *PL_markstack_ptr += shift; | |
544f3153 | 1012 | while (count--) |
a0d0e21e LW |
1013 | *dst-- = *src--; |
1014 | } | |
544f3153 | 1015 | /* copy the new items down to the destination list */ |
ac27b0f5 | 1016 | dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1; |
22023b26 | 1017 | if (gimme == G_ARRAY) { |
b2a2a901 DM |
1018 | /* add returned items to the collection (making mortal copies |
1019 | * if necessary), then clear the current temps stack frame | |
1020 | * *except* for those items. We do this splicing the items | |
1021 | * into the start of the tmps frame (so some items may be on | |
59d53fd6 | 1022 | * the tmps stack twice), then moving PL_tmps_floor above |
b2a2a901 DM |
1023 | * them, then freeing the frame. That way, the only tmps that |
1024 | * accumulate over iterations are the return values for map. | |
1025 | * We have to do to this way so that everything gets correctly | |
1026 | * freed if we die during the map. | |
1027 | */ | |
1028 | I32 tmpsbase; | |
1029 | I32 i = items; | |
1030 | /* make space for the slice */ | |
1031 | EXTEND_MORTAL(items); | |
1032 | tmpsbase = PL_tmps_floor + 1; | |
1033 | Move(PL_tmps_stack + tmpsbase, | |
1034 | PL_tmps_stack + tmpsbase + items, | |
1035 | PL_tmps_ix - PL_tmps_floor, | |
1036 | SV*); | |
1037 | PL_tmps_ix += items; | |
1038 | ||
1039 | while (i-- > 0) { | |
1040 | SV *sv = POPs; | |
1041 | if (!SvTEMP(sv)) | |
1042 | sv = sv_mortalcopy(sv); | |
1043 | *dst-- = sv; | |
1044 | PL_tmps_stack[tmpsbase++] = SvREFCNT_inc_simple(sv); | |
1045 | } | |
1046 | /* clear the stack frame except for the items */ | |
1047 | PL_tmps_floor += items; | |
1048 | FREETMPS; | |
1049 | /* FREETMPS may have cleared the TEMP flag on some of the items */ | |
1050 | i = items; | |
1051 | while (i-- > 0) | |
1052 | SvTEMP_on(PL_tmps_stack[--tmpsbase]); | |
22023b26 | 1053 | } |
bfed75c6 | 1054 | else { |
22023b26 TP |
1055 | /* scalar context: we don't care about which values map returns |
1056 | * (we use undef here). And so we certainly don't want to do mortal | |
1057 | * copies of meaningless values. */ | |
1058 | while (items-- > 0) { | |
b988aa42 | 1059 | (void)POPs; |
22023b26 TP |
1060 | *dst-- = &PL_sv_undef; |
1061 | } | |
b2a2a901 | 1062 | FREETMPS; |
22023b26 | 1063 | } |
a0d0e21e | 1064 | } |
b2a2a901 DM |
1065 | else { |
1066 | FREETMPS; | |
1067 | } | |
d343c3ef | 1068 | LEAVE_with_name("grep_item"); /* exit inner scope */ |
a0d0e21e LW |
1069 | |
1070 | /* All done yet? */ | |
6cae08a8 | 1071 | if (PL_markstack_ptr[-1] > TOPMARK) { |
a0d0e21e LW |
1072 | |
1073 | (void)POPMARK; /* pop top */ | |
d343c3ef | 1074 | LEAVE_with_name("grep"); /* exit outer scope */ |
a0d0e21e | 1075 | (void)POPMARK; /* pop src */ |
3280af22 | 1076 | items = --*PL_markstack_ptr - PL_markstack_ptr[-1]; |
a0d0e21e | 1077 | (void)POPMARK; /* pop dst */ |
3280af22 | 1078 | SP = PL_stack_base + POPMARK; /* pop original mark */ |
54310121 | 1079 | if (gimme == G_SCALAR) { |
7cc47870 RGS |
1080 | dTARGET; |
1081 | XPUSHi(items); | |
a0d0e21e | 1082 | } |
54310121 | 1083 | else if (gimme == G_ARRAY) |
1084 | SP += items; | |
a0d0e21e LW |
1085 | RETURN; |
1086 | } | |
1087 | else { | |
1088 | SV *src; | |
1089 | ||
d343c3ef | 1090 | ENTER_with_name("grep_item"); /* enter inner scope */ |
7766f137 | 1091 | SAVEVPTR(PL_curpm); |
a0d0e21e | 1092 | |
544f3153 | 1093 | /* set $_ to the new source item */ |
3280af22 | 1094 | src = PL_stack_base[PL_markstack_ptr[-1]]; |
60779a30 | 1095 | if (SvPADTMP(src)) { |
60779a30 DM |
1096 | src = sv_mortalcopy(src); |
1097 | } | |
a0d0e21e | 1098 | SvTEMP_off(src); |
ffd49c98 | 1099 | DEFSV_set(src); |
a0d0e21e LW |
1100 | |
1101 | RETURNOP(cLOGOP->op_other); | |
1102 | } | |
1103 | } | |
1104 | ||
a0d0e21e LW |
1105 | /* Range stuff. */ |
1106 | ||
1107 | PP(pp_range) | |
1108 | { | |
82334630 | 1109 | if (GIMME_V == G_ARRAY) |
1a67a97c | 1110 | return NORMAL; |
538573f7 | 1111 | if (SvTRUEx(PAD_SV(PL_op->op_targ))) |
1a67a97c | 1112 | return cLOGOP->op_other; |
538573f7 | 1113 | else |
1a67a97c | 1114 | return NORMAL; |
a0d0e21e LW |
1115 | } |
1116 | ||
1117 | PP(pp_flip) | |
1118 | { | |
39644a26 | 1119 | dSP; |
a0d0e21e | 1120 | |
82334630 | 1121 | if (GIMME_V == G_ARRAY) { |
1a67a97c | 1122 | RETURNOP(((LOGOP*)cUNOP->op_first)->op_other); |
a0d0e21e LW |
1123 | } |
1124 | else { | |
1125 | dTOPss; | |
44f8325f | 1126 | SV * const targ = PAD_SV(PL_op->op_targ); |
bfed75c6 | 1127 | int flip = 0; |
790090df | 1128 | |
bfed75c6 | 1129 | if (PL_op->op_private & OPpFLIP_LINENUM) { |
4e3399f9 YST |
1130 | if (GvIO(PL_last_in_gv)) { |
1131 | flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv)); | |
1132 | } | |
1133 | else { | |
fafc274c | 1134 | GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV); |
44f8325f AL |
1135 | if (gv && GvSV(gv)) |
1136 | flip = SvIV(sv) == SvIV(GvSV(gv)); | |
4e3399f9 | 1137 | } |
bfed75c6 AL |
1138 | } else { |
1139 | flip = SvTRUE(sv); | |
1140 | } | |
1141 | if (flip) { | |
a0d0e21e | 1142 | sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1); |
533c011a | 1143 | if (PL_op->op_flags & OPf_SPECIAL) { |
a0d0e21e | 1144 | sv_setiv(targ, 1); |
3e3baf6d | 1145 | SETs(targ); |
a0d0e21e LW |
1146 | RETURN; |
1147 | } | |
1148 | else { | |
1149 | sv_setiv(targ, 0); | |
924508f0 | 1150 | SP--; |
1a67a97c | 1151 | RETURNOP(((LOGOP*)cUNOP->op_first)->op_other); |
a0d0e21e LW |
1152 | } |
1153 | } | |
76f68e9b | 1154 | sv_setpvs(TARG, ""); |
a0d0e21e LW |
1155 | SETs(targ); |
1156 | RETURN; | |
1157 | } | |
1158 | } | |
1159 | ||
8e9bbdb9 RGS |
1160 | /* This code tries to decide if "$left .. $right" should use the |
1161 | magical string increment, or if the range is numeric (we make | |
1162 | an exception for .."0" [#18165]). AMS 20021031. */ | |
1163 | ||
1164 | #define RANGE_IS_NUMERIC(left,right) ( \ | |
b0e74086 RGS |
1165 | SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \ |
1166 | SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \ | |
e0ab1c0e | 1167 | (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \ |
b15aece3 | 1168 | looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \ |
e0ab1c0e | 1169 | && (!SvOK(right) || looks_like_number(right)))) |
8e9bbdb9 | 1170 | |
a0d0e21e LW |
1171 | PP(pp_flop) |
1172 | { | |
20b7effb | 1173 | dSP; |
a0d0e21e | 1174 | |
82334630 | 1175 | if (GIMME_V == G_ARRAY) { |
a0d0e21e | 1176 | dPOPPOPssrl; |
86cb7173 | 1177 | |
5b295bef RD |
1178 | SvGETMAGIC(left); |
1179 | SvGETMAGIC(right); | |
a0d0e21e | 1180 | |
8e9bbdb9 | 1181 | if (RANGE_IS_NUMERIC(left,right)) { |
b262c4c9 | 1182 | IV i, j, n; |
4d91eccc FC |
1183 | if ((SvOK(left) && !SvIOK(left) && SvNV_nomg(left) < IV_MIN) || |
1184 | (SvOK(right) && (SvIOK(right) | |
1185 | ? SvIsUV(right) && SvUV(right) > IV_MAX | |
1186 | : SvNV_nomg(right) > IV_MAX))) | |
d470f89e | 1187 | DIE(aTHX_ "Range iterator outside integer range"); |
f52e41ad | 1188 | i = SvIV_nomg(left); |
b262c4c9 JH |
1189 | j = SvIV_nomg(right); |
1190 | if (j >= i) { | |
1191 | /* Dance carefully around signed max. */ | |
1192 | bool overflow = (i <= 0 && j > SSize_t_MAX + i - 1); | |
1193 | if (!overflow) { | |
1194 | n = j - i + 1; | |
1195 | /* The wraparound of signed integers is undefined | |
1196 | * behavior, but here we aim for count >=1, and | |
1197 | * negative count is just wrong. */ | |
a1e27170 TC |
1198 | if (n < 1 |
1199 | #if IVSIZE > Size_t_size | |
1200 | || n > SSize_t_MAX | |
1201 | #endif | |
1202 | ) | |
b262c4c9 JH |
1203 | overflow = TRUE; |
1204 | } | |
1205 | if (overflow) | |
1206 | Perl_croak(aTHX_ "Out of memory during list extend"); | |
1207 | EXTEND_MORTAL(n); | |
1208 | EXTEND(SP, n); | |
bbce6d69 | 1209 | } |
c1ab3db2 | 1210 | else |
b262c4c9 JH |
1211 | n = 0; |
1212 | while (n--) { | |
fc01cab4 | 1213 | SV * const sv = sv_2mortal(newSViv(i)); |
a0d0e21e | 1214 | PUSHs(sv); |
fc01cab4 DM |
1215 | if (n) /* avoid incrementing above IV_MAX */ |
1216 | i++; | |
a0d0e21e LW |
1217 | } |
1218 | } | |
1219 | else { | |
3c323193 FC |
1220 | STRLEN len, llen; |
1221 | const char * const lpv = SvPV_nomg_const(left, llen); | |
f52e41ad | 1222 | const char * const tmps = SvPV_nomg_const(right, len); |
a0d0e21e | 1223 | |
3c323193 | 1224 | SV *sv = newSVpvn_flags(lpv, llen, SvUTF8(left)|SVs_TEMP); |
89ea2908 | 1225 | while (!SvNIOKp(sv) && SvCUR(sv) <= len) { |
a0d0e21e | 1226 | XPUSHs(sv); |
b15aece3 | 1227 | if (strEQ(SvPVX_const(sv),tmps)) |
89ea2908 | 1228 | break; |
a0d0e21e LW |
1229 | sv = sv_2mortal(newSVsv(sv)); |
1230 | sv_inc(sv); | |
1231 | } | |
a0d0e21e LW |
1232 | } |
1233 | } | |
1234 | else { | |
1235 | dTOPss; | |
901017d6 | 1236 | SV * const targ = PAD_SV(cUNOP->op_first->op_targ); |
4e3399f9 | 1237 | int flop = 0; |
a0d0e21e | 1238 | sv_inc(targ); |
4e3399f9 YST |
1239 | |
1240 | if (PL_op->op_private & OPpFLIP_LINENUM) { | |
1241 | if (GvIO(PL_last_in_gv)) { | |
1242 | flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv)); | |
1243 | } | |
1244 | else { | |
fafc274c | 1245 | GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV); |
4e3399f9 YST |
1246 | if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv)); |
1247 | } | |
1248 | } | |
1249 | else { | |
1250 | flop = SvTRUE(sv); | |
1251 | } | |
1252 | ||
1253 | if (flop) { | |
a0d0e21e | 1254 | sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0); |
396482e1 | 1255 | sv_catpvs(targ, "E0"); |
a0d0e21e LW |
1256 | } |
1257 | SETs(targ); | |
1258 | } | |
1259 | ||
1260 | RETURN; | |
1261 | } | |
1262 | ||
1263 | /* Control. */ | |
1264 | ||
27da23d5 | 1265 | static const char * const context_name[] = { |
515afda2 | 1266 | "pseudo-block", |
f31522f3 | 1267 | NULL, /* CXt_WHEN never actually needs "block" */ |
76753e7f | 1268 | NULL, /* CXt_BLOCK never actually needs "block" */ |
f31522f3 | 1269 | NULL, /* CXt_GIVEN never actually needs "block" */ |
76753e7f | 1270 | NULL, /* CXt_LOOP_PLAIN never actually needs "loop" */ |
76753e7f | 1271 | NULL, /* CXt_LOOP_LAZYIV never actually needs "loop" */ |
93661e56 DM |
1272 | NULL, /* CXt_LOOP_LAZYSV never actually needs "loop" */ |
1273 | NULL, /* CXt_LOOP_LIST never actually needs "loop" */ | |
1274 | NULL, /* CXt_LOOP_ARY never actually needs "loop" */ | |
515afda2 | 1275 | "subroutine", |
76753e7f | 1276 | "format", |
515afda2 | 1277 | "eval", |
515afda2 | 1278 | "substitution", |
515afda2 NC |
1279 | }; |
1280 | ||
76e3520e | 1281 | STATIC I32 |
5db1eb8d | 1282 | S_dopoptolabel(pTHX_ const char *label, STRLEN len, U32 flags) |
a0d0e21e | 1283 | { |
eb578fdb | 1284 | I32 i; |
a0d0e21e | 1285 | |
7918f24d NC |
1286 | PERL_ARGS_ASSERT_DOPOPTOLABEL; |
1287 | ||
a0d0e21e | 1288 | for (i = cxstack_ix; i >= 0; i--) { |
eb578fdb | 1289 | const PERL_CONTEXT * const cx = &cxstack[i]; |
6b35e009 | 1290 | switch (CxTYPE(cx)) { |
a0d0e21e | 1291 | case CXt_SUBST: |
a0d0e21e | 1292 | case CXt_SUB: |
7766f137 | 1293 | case CXt_FORMAT: |
a0d0e21e | 1294 | case CXt_EVAL: |
0a753a76 | 1295 | case CXt_NULL: |
dcbac5bb | 1296 | /* diag_listed_as: Exiting subroutine via %s */ |
a2a5de95 NC |
1297 | Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s", |
1298 | context_name[CxTYPE(cx)], OP_NAME(PL_op)); | |
79646418 | 1299 | if (CxTYPE(cx) == CXt_NULL) /* sort BLOCK */ |
515afda2 NC |
1300 | return -1; |
1301 | break; | |
93661e56 | 1302 | case CXt_LOOP_PLAIN: |
c6fdafd0 | 1303 | case CXt_LOOP_LAZYIV: |
d01136d6 | 1304 | case CXt_LOOP_LAZYSV: |
93661e56 DM |
1305 | case CXt_LOOP_LIST: |
1306 | case CXt_LOOP_ARY: | |
7e8f1eac | 1307 | { |
5db1eb8d BF |
1308 | STRLEN cx_label_len = 0; |
1309 | U32 cx_label_flags = 0; | |
1310 | const char *cx_label = CxLABEL_len_flags(cx, &cx_label_len, &cx_label_flags); | |
1311 | if (!cx_label || !( | |
1312 | ( (cx_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ? | |
1313 | (flags & SVf_UTF8) | |
1314 | ? (bytes_cmp_utf8( | |
1315 | (const U8*)cx_label, cx_label_len, | |
1316 | (const U8*)label, len) == 0) | |
1317 | : (bytes_cmp_utf8( | |
1318 | (const U8*)label, len, | |
1319 | (const U8*)cx_label, cx_label_len) == 0) | |
eade7155 BF |
1320 | : (len == cx_label_len && ((cx_label == label) |
1321 | || memEQ(cx_label, label, len))) )) { | |
1c98cc53 | 1322 | DEBUG_l(Perl_deb(aTHX_ "(poptolabel(): skipping label at cx=%ld %s)\n", |
7e8f1eac | 1323 | (long)i, cx_label)); |
a0d0e21e LW |
1324 | continue; |
1325 | } | |
1c98cc53 | 1326 | DEBUG_l( Perl_deb(aTHX_ "(poptolabel(): found label at cx=%ld %s)\n", (long)i, label)); |
a0d0e21e | 1327 | return i; |
7e8f1eac | 1328 | } |
a0d0e21e LW |
1329 | } |
1330 | } | |
1331 | return i; | |
1332 | } | |
1333 | ||
0d863452 RH |
1334 | |
1335 | ||
1c23e2bd | 1336 | U8 |
864dbfa3 | 1337 | Perl_dowantarray(pTHX) |
e50aee73 | 1338 | { |
1c23e2bd | 1339 | const U8 gimme = block_gimme(); |
54310121 | 1340 | return (gimme == G_VOID) ? G_SCALAR : gimme; |
1341 | } | |
1342 | ||
1c23e2bd | 1343 | U8 |
864dbfa3 | 1344 | Perl_block_gimme(pTHX) |
54310121 | 1345 | { |
06b5626a | 1346 | const I32 cxix = dopoptosub(cxstack_ix); |
a05700a8 | 1347 | U8 gimme; |
e50aee73 | 1348 | if (cxix < 0) |
46fc3d4c | 1349 | return G_VOID; |
e50aee73 | 1350 | |
a05700a8 DM |
1351 | gimme = (cxstack[cxix].blk_gimme & G_WANT); |
1352 | if (!gimme) | |
1353 | Perl_croak(aTHX_ "panic: bad gimme: %d\n", gimme); | |
1354 | return gimme; | |
e50aee73 AD |
1355 | } |
1356 | ||
a05700a8 | 1357 | |
78f9721b SM |
1358 | I32 |
1359 | Perl_is_lvalue_sub(pTHX) | |
1360 | { | |
06b5626a | 1361 | const I32 cxix = dopoptosub(cxstack_ix); |
78f9721b SM |
1362 | assert(cxix >= 0); /* We should only be called from inside subs */ |
1363 | ||
bafb2adc NC |
1364 | if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv)) |
1365 | return CxLVAL(cxstack + cxix); | |
78f9721b SM |
1366 | else |
1367 | return 0; | |
1368 | } | |
1369 | ||
a73d8813 | 1370 | /* only used by cx_pushsub() */ |
777d9014 FC |
1371 | I32 |
1372 | Perl_was_lvalue_sub(pTHX) | |
1373 | { | |
777d9014 FC |
1374 | const I32 cxix = dopoptosub(cxstack_ix-1); |
1375 | assert(cxix >= 0); /* We should only be called from inside subs */ | |
1376 | ||
1377 | if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv)) | |
1378 | return CxLVAL(cxstack + cxix); | |
1379 | else | |
1380 | return 0; | |
1381 | } | |
1382 | ||
76e3520e | 1383 | STATIC I32 |
901017d6 | 1384 | S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock) |
2c375eb9 | 1385 | { |
a0d0e21e | 1386 | I32 i; |
7918f24d NC |
1387 | |
1388 | PERL_ARGS_ASSERT_DOPOPTOSUB_AT; | |
81611534 JH |
1389 | #ifndef DEBUGGING |
1390 | PERL_UNUSED_CONTEXT; | |
1391 | #endif | |
7918f24d | 1392 | |
a0d0e21e | 1393 | for (i = startingblock; i >= 0; i--) { |
eb578fdb | 1394 | const PERL_CONTEXT * const cx = &cxstk[i]; |
6b35e009 | 1395 | switch (CxTYPE(cx)) { |
a0d0e21e LW |
1396 | default: |
1397 | continue; | |
a0d0e21e | 1398 | case CXt_SUB: |
5fbe8311 DM |
1399 | /* in sub foo { /(?{...})/ }, foo ends up on the CX stack |
1400 | * twice; the first for the normal foo() call, and the second | |
1401 | * for a faked up re-entry into the sub to execute the | |
1402 | * code block. Hide this faked entry from the world. */ | |
1403 | if (cx->cx_type & CXp_SUB_RE_FAKE) | |
1404 | continue; | |
c67159e1 | 1405 | /* FALLTHROUGH */ |
5fbe8311 | 1406 | case CXt_EVAL: |
7766f137 | 1407 | case CXt_FORMAT: |
1c98cc53 | 1408 | DEBUG_l( Perl_deb(aTHX_ "(dopoptosub_at(): found sub at cx=%ld)\n", (long)i)); |
a0d0e21e LW |
1409 | return i; |
1410 | } | |
1411 | } | |
1412 | return i; | |
1413 | } | |
1414 | ||
76e3520e | 1415 | STATIC I32 |
cea2e8a9 | 1416 | S_dopoptoeval(pTHX_ I32 startingblock) |
a0d0e21e LW |
1417 | { |
1418 | I32 i; | |
a0d0e21e | 1419 | for (i = startingblock; i >= 0; i--) { |
eb578fdb | 1420 | const PERL_CONTEXT *cx = &cxstack[i]; |
6b35e009 | 1421 | switch (CxTYPE(cx)) { |
a0d0e21e LW |
1422 | default: |
1423 | continue; | |
1424 | case CXt_EVAL: | |
1c98cc53 | 1425 | DEBUG_l( Perl_deb(aTHX_ "(dopoptoeval(): found eval at cx=%ld)\n", (long)i)); |
a0d0e21e LW |
1426 | return i; |
1427 | } | |
1428 | } | |
1429 | return i; | |
1430 | } | |
1431 | ||
76e3520e | 1432 | STATIC I32 |
cea2e8a9 | 1433 | S_dopoptoloop(pTHX_ I32 startingblock) |
a0d0e21e LW |
1434 | { |
1435 | I32 i; | |
a0d0e21e | 1436 | for (i = startingblock; i >= 0; i--) { |
eb578fdb | 1437 | const PERL_CONTEXT * const cx = &cxstack[i]; |
6b35e009 | 1438 | switch (CxTYPE(cx)) { |
a0d0e21e | 1439 | case CXt_SUBST: |
a0d0e21e | 1440 | case CXt_SUB: |
7766f137 | 1441 | case CXt_FORMAT: |
a0d0e21e | 1442 | case CXt_EVAL: |
0a753a76 | 1443 | case CXt_NULL: |
dcbac5bb | 1444 | /* diag_listed_as: Exiting subroutine via %s */ |
a2a5de95 NC |
1445 | Perl_ck_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s", |
1446 | context_name[CxTYPE(cx)], OP_NAME(PL_op)); | |
79646418 | 1447 | if ((CxTYPE(cx)) == CXt_NULL) /* sort BLOCK */ |
515afda2 NC |
1448 | return -1; |
1449 | break; | |
93661e56 | 1450 | case CXt_LOOP_PLAIN: |
c6fdafd0 | 1451 | case CXt_LOOP_LAZYIV: |
d01136d6 | 1452 | case CXt_LOOP_LAZYSV: |
93661e56 DM |
1453 | case CXt_LOOP_LIST: |
1454 | case CXt_LOOP_ARY: | |
1c98cc53 | 1455 | DEBUG_l( Perl_deb(aTHX_ "(dopoptoloop(): found loop at cx=%ld)\n", (long)i)); |
a0d0e21e LW |
1456 | return i; |
1457 | } | |
1458 | } | |
1459 | return i; | |
1460 | } | |
1461 | ||
28e0cf42 | 1462 | /* find the next GIVEN or FOR (with implicit $_) loop context block */ |
97f2561e | 1463 | |
0d863452 | 1464 | STATIC I32 |
97f2561e | 1465 | S_dopoptogivenfor(pTHX_ I32 startingblock) |
0d863452 RH |
1466 | { |
1467 | I32 i; | |
1468 | for (i = startingblock; i >= 0; i--) { | |
eb578fdb | 1469 | const PERL_CONTEXT *cx = &cxstack[i]; |
0d863452 RH |
1470 | switch (CxTYPE(cx)) { |
1471 | default: | |
1472 | continue; | |
1473 | case CXt_GIVEN: | |
97f2561e | 1474 | DEBUG_l( Perl_deb(aTHX_ "(dopoptogivenfor(): found given at cx=%ld)\n", (long)i)); |
0d863452 | 1475 | return i; |
3b719c58 | 1476 | case CXt_LOOP_PLAIN: |
93661e56 | 1477 | assert(!(cx->cx_type & CXp_FOR_DEF)); |
3b719c58 | 1478 | break; |
c6fdafd0 | 1479 | case CXt_LOOP_LAZYIV: |
d01136d6 | 1480 | case CXt_LOOP_LAZYSV: |
93661e56 DM |
1481 | case CXt_LOOP_LIST: |
1482 | case CXt_LOOP_ARY: | |
1483 | if (cx->cx_type & CXp_FOR_DEF) { | |
97f2561e | 1484 | DEBUG_l( Perl_deb(aTHX_ "(dopoptogivenfor(): found foreach at cx=%ld)\n", (long)i)); |
0d863452 RH |
1485 | return i; |
1486 | } | |
1487 | } | |
1488 | } | |
1489 | return i; | |
1490 | } | |
1491 | ||
1492 | STATIC I32 | |
1493 | S_dopoptowhen(pTHX_ I32 startingblock) | |
1494 | { | |
1495 | I32 i; | |
1496 | for (i = startingblock; i >= 0; i--) { | |
eb578fdb | 1497 | const PERL_CONTEXT *cx = &cxstack[i]; |
0d863452 RH |
1498 | switch (CxTYPE(cx)) { |
1499 | default: | |
1500 | continue; | |
1501 | case CXt_WHEN: | |
1c98cc53 | 1502 | DEBUG_l( Perl_deb(aTHX_ "(dopoptowhen(): found when at cx=%ld)\n", (long)i)); |
0d863452 RH |
1503 | return i; |
1504 | } | |
1505 | } | |
1506 | return i; | |
1507 | } | |
1508 | ||
abaf5d5a | 1509 | /* dounwind(): pop all contexts above (but not including) cxix. |
fc6e609e DM |
1510 | * Note that it clears the savestack frame associated with each popped |
1511 | * context entry, but doesn't free any temps. | |
ed8ff0f3 | 1512 | * It does a cx_popblock() of the last frame that it pops, and leaves |
fc6e609e | 1513 | * cxstack_ix equal to cxix. |
abaf5d5a DM |
1514 | */ |
1515 | ||
a0d0e21e | 1516 | void |
864dbfa3 | 1517 | Perl_dounwind(pTHX_ I32 cxix) |
a0d0e21e | 1518 | { |
f144f1e3 DM |
1519 | if (!PL_curstackinfo) /* can happen if die during thread cloning */ |
1520 | return; | |
1521 | ||
a0d0e21e | 1522 | while (cxstack_ix > cxix) { |
4ebe6e95 | 1523 | PERL_CONTEXT *cx = CX_CUR(); |
5e691bc6 DM |
1524 | |
1525 | CX_DEBUG(cx, "UNWIND"); | |
a0d0e21e | 1526 | /* Note: we don't need to restore the base context info till the end. */ |
76d10131 DM |
1527 | |
1528 | CX_LEAVE_SCOPE(cx); | |
1529 | ||
6b35e009 | 1530 | switch (CxTYPE(cx)) { |
c90c0ff4 | 1531 | case CXt_SUBST: |
b405d38b | 1532 | CX_POPSUBST(cx); |
80d88db0 | 1533 | break; |
a0d0e21e | 1534 | case CXt_SUB: |
a73d8813 | 1535 | cx_popsub(cx); |
a0d0e21e LW |
1536 | break; |
1537 | case CXt_EVAL: | |
13febba5 | 1538 | cx_popeval(cx); |
03e489bc | 1539 | break; |
93661e56 | 1540 | case CXt_LOOP_PLAIN: |
c6fdafd0 | 1541 | case CXt_LOOP_LAZYIV: |
d01136d6 | 1542 | case CXt_LOOP_LAZYSV: |
93661e56 DM |
1543 | case CXt_LOOP_LIST: |
1544 | case CXt_LOOP_ARY: | |
d1b6bf72 | 1545 | cx_poploop(cx); |
a0d0e21e | 1546 | break; |
b95eccd3 | 1547 | case CXt_WHEN: |
2a7b7c61 | 1548 | cx_popwhen(cx); |
b95eccd3 DM |
1549 | break; |
1550 | case CXt_GIVEN: | |
2a7b7c61 | 1551 | cx_popgiven(cx); |
b95eccd3 | 1552 | break; |
f217cb3d | 1553 | case CXt_BLOCK: |
0a753a76 | 1554 | case CXt_NULL: |
f217cb3d | 1555 | /* these two don't have a POPFOO() */ |
a0d0e21e | 1556 | break; |
7766f137 | 1557 | case CXt_FORMAT: |
6a7d52cc | 1558 | cx_popformat(cx); |
7766f137 | 1559 | break; |
a0d0e21e | 1560 | } |
fc6e609e | 1561 | if (cxstack_ix == cxix + 1) { |
ed8ff0f3 | 1562 | cx_popblock(cx); |
fc6e609e | 1563 | } |
c90c0ff4 | 1564 | cxstack_ix--; |
a0d0e21e | 1565 | } |
fc6e609e | 1566 | |
a0d0e21e LW |
1567 | } |
1568 | ||
5a844595 GS |
1569 | void |
1570 | Perl_qerror(pTHX_ SV *err) | |
1571 | { | |
7918f24d NC |
1572 | PERL_ARGS_ASSERT_QERROR; |
1573 | ||
6b2fb389 DM |
1574 | if (PL_in_eval) { |
1575 | if (PL_in_eval & EVAL_KEEPERR) { | |
ecad31f0 BF |
1576 | Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf, |
1577 | SVfARG(err)); | |
6b2fb389 DM |
1578 | } |
1579 | else | |
1580 | sv_catsv(ERRSV, err); | |
1581 | } | |
5a844595 GS |
1582 | else if (PL_errors) |
1583 | sv_catsv(PL_errors, err); | |
1584 | else | |
be2597df | 1585 | Perl_warn(aTHX_ "%"SVf, SVfARG(err)); |
13765c85 DM |
1586 | if (PL_parser) |
1587 | ++PL_parser->error_count; | |
5a844595 GS |
1588 | } |
1589 | ||
d308a779 DM |
1590 | |
1591 | ||
06a7bc17 DM |
1592 | /* pop a CXt_EVAL context and in addition, if it was a require then |
1593 | * based on action: | |
1594 | * 0: do nothing extra; | |
1595 | * 1: undef $INC{$name}; croak "$name did not return a true value"; | |
1596 | * 2: delete $INC{$name}; croak "$errsv: Compilation failed in require" | |
1597 | */ | |
d308a779 | 1598 | |
8a1fd305 | 1599 | static void |
06a7bc17 | 1600 | S_pop_eval_context_maybe_croak(pTHX_ PERL_CONTEXT *cx, SV *errsv, int action) |
d308a779 | 1601 | { |
51787acf | 1602 | SV *namesv = NULL; /* init to avoid dumb compiler warning */ |
06a7bc17 DM |
1603 | bool do_croak; |
1604 | ||
1605 | CX_LEAVE_SCOPE(cx); | |
1606 | do_croak = action && (CxOLD_OP_TYPE(cx) == OP_REQUIRE); | |
2a1e0dfe DM |
1607 | if (do_croak) { |
1608 | /* keep namesv alive after cx_popeval() */ | |
1609 | namesv = cx->blk_eval.old_namesv; | |
1610 | cx->blk_eval.old_namesv = NULL; | |
1611 | sv_2mortal(namesv); | |
1612 | } | |
06a7bc17 DM |
1613 | cx_popeval(cx); |
1614 | cx_popblock(cx); | |
1615 | CX_POP(cx); | |
1616 | ||
1617 | if (do_croak) { | |
1618 | const char *fmt; | |
1619 | HV *inc_hv = GvHVn(PL_incgv); | |
1620 | I32 klen = SvUTF8(namesv) ? -(I32)SvCUR(namesv) : (I32)SvCUR(namesv); | |
1621 | const char *key = SvPVX_const(namesv); | |
d308a779 | 1622 | |
06a7bc17 DM |
1623 | if (action == 1) { |
1624 | (void)hv_delete(inc_hv, key, klen, G_DISCARD); | |
1625 | fmt = "%"SVf" did not return a true value"; | |
1626 | errsv = namesv; | |
1627 | } | |
1628 | else { | |
1629 | (void)hv_store(inc_hv, key, klen, &PL_sv_undef, 0); | |
1630 | fmt = "%"SVf"Compilation failed in require"; | |
1631 | if (!errsv) | |
1632 | errsv = newSVpvs_flags("Unknown error\n", SVs_TEMP); | |
1633 | } | |
1634 | ||
1635 | Perl_croak(aTHX_ fmt, SVfARG(errsv)); | |
1636 | } | |
d308a779 DM |
1637 | } |
1638 | ||
1639 | ||
8c86f023 DM |
1640 | /* die_unwind(): this is the final destination for the various croak() |
1641 | * functions. If we're in an eval, unwind the context and other stacks | |
1642 | * back to the top-most CXt_EVAL and set $@ to msv; otherwise print msv | |
1643 | * to STDERR and initiate an exit. Note that if the CXt_EVAL popped back | |
1644 | * to is a require the exception will be rethrown, as requires don't | |
1645 | * actually trap exceptions. | |
1646 | */ | |
06a7bc17 | 1647 | |
bb4c52e0 | 1648 | void |
c5df3096 | 1649 | Perl_die_unwind(pTHX_ SV *msv) |
a0d0e21e | 1650 | { |
8c86f023 | 1651 | SV *exceptsv = msv; |
96d9b9cd | 1652 | U8 in_eval = PL_in_eval; |
c5df3096 | 1653 | PERL_ARGS_ASSERT_DIE_UNWIND; |
87582a92 | 1654 | |
96d9b9cd | 1655 | if (in_eval) { |
a0d0e21e | 1656 | I32 cxix; |
a0d0e21e | 1657 | |
cc040a9b | 1658 | exceptsv = sv_2mortal(SvREFCNT_inc_simple_NN(exceptsv)); |
8c86f023 | 1659 | |
22a30693 Z |
1660 | /* |
1661 | * Historically, perl used to set ERRSV ($@) early in the die | |
1662 | * process and rely on it not getting clobbered during unwinding. | |
1663 | * That sucked, because it was liable to get clobbered, so the | |
1664 | * setting of ERRSV used to emit the exception from eval{} has | |
1665 | * been moved to much later, after unwinding (see just before | |
1666 | * JMPENV_JUMP below). However, some modules were relying on the | |
1667 | * early setting, by examining $@ during unwinding to use it as | |
1668 | * a flag indicating whether the current unwinding was caused by | |
1669 | * an exception. It was never a reliable flag for that purpose, | |
1670 | * being totally open to false positives even without actual | |
1671 | * clobberage, but was useful enough for production code to | |
1672 | * semantically rely on it. | |
1673 | * | |
1674 | * We'd like to have a proper introspective interface that | |
1675 | * explicitly describes the reason for whatever unwinding | |
1676 | * operations are currently in progress, so that those modules | |
1677 | * work reliably and $@ isn't further overloaded. But we don't | |
1678 | * have one yet. In its absence, as a stopgap measure, ERRSV is | |
1679 | * now *additionally* set here, before unwinding, to serve as the | |
1680 | * (unreliable) flag that it used to. | |
1681 | * | |
1682 | * This behaviour is temporary, and should be removed when a | |
1683 | * proper way to detect exceptional unwinding has been developed. | |
1684 | * As of 2010-12, the authors of modules relying on the hack | |
1685 | * are aware of the issue, because the modules failed on | |
1686 | * perls 5.13.{1..7} which had late setting of $@ without this | |
1687 | * early-setting hack. | |
1688 | */ | |
8c86f023 DM |
1689 | if (!(in_eval & EVAL_KEEPERR)) |
1690 | sv_setsv_flags(ERRSV, exceptsv, | |
1691 | (SV_GMAGIC|SV_DO_COW_SVSETSV|SV_NOSTEAL)); | |
22a30693 | 1692 | |
fc941f37 Z |
1693 | if (in_eval & EVAL_KEEPERR) { |
1694 | Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "\t(in cleanup) %"SVf, | |
1695 | SVfARG(exceptsv)); | |
1696 | } | |
1697 | ||
5a844595 GS |
1698 | while ((cxix = dopoptoeval(cxstack_ix)) < 0 |
1699 | && PL_curstackinfo->si_prev) | |
1700 | { | |
bac4b2ad | 1701 | dounwind(-1); |
d3acc0f7 | 1702 | POPSTACK; |
bac4b2ad | 1703 | } |
e336de0d | 1704 | |
a0d0e21e | 1705 | if (cxix >= 0) { |
eb578fdb | 1706 | PERL_CONTEXT *cx; |
f5ddd604 | 1707 | SV **oldsp; |
1c23e2bd | 1708 | U8 gimme; |
8f89e5a9 Z |
1709 | JMPENV *restartjmpenv; |
1710 | OP *restartop; | |
a0d0e21e LW |
1711 | |
1712 | if (cxix < cxstack_ix) | |
1713 | dounwind(cxix); | |
1714 | ||
4ebe6e95 | 1715 | cx = CX_CUR(); |
f7d0774b | 1716 | assert(CxTYPE(cx) == CXt_EVAL); |
e17c1e7c DM |
1717 | |
1718 | /* return false to the caller of eval */ | |
f5ddd604 | 1719 | oldsp = PL_stack_base + cx->blk_oldsp; |
f7d0774b | 1720 | gimme = cx->blk_gimme; |
f7d0774b | 1721 | if (gimme == G_SCALAR) |
f5ddd604 DM |
1722 | *++oldsp = &PL_sv_undef; |
1723 | PL_stack_sp = oldsp; | |
f7d0774b | 1724 | |
7d140242 DM |
1725 | restartjmpenv = cx->blk_eval.cur_top_env; |
1726 | restartop = cx->blk_eval.retop; | |
06a7bc17 DM |
1727 | /* Note that unlike pp_entereval, pp_require isn't supposed to |
1728 | * trap errors. So if we're a require, after we pop the | |
1729 | * CXt_EVAL that pp_require pushed, rethrow the error with | |
1730 | * croak(exceptsv). This is all handled by the call below when | |
1731 | * action == 2. | |
1732 | */ | |
1733 | S_pop_eval_context_maybe_croak(aTHX_ cx, exceptsv, 2); | |
a0d0e21e | 1734 | |
fc941f37 | 1735 | if (!(in_eval & EVAL_KEEPERR)) |
96d9b9cd | 1736 | sv_setsv(ERRSV, exceptsv); |
8f89e5a9 Z |
1737 | PL_restartjmpenv = restartjmpenv; |
1738 | PL_restartop = restartop; | |
bb4c52e0 | 1739 | JMPENV_JUMP(3); |
e5964223 | 1740 | NOT_REACHED; /* NOTREACHED */ |
a0d0e21e LW |
1741 | } |
1742 | } | |
87582a92 | 1743 | |
96d9b9cd | 1744 | write_to_stderr(exceptsv); |
f86702cc | 1745 | my_failure_exit(); |
e5964223 | 1746 | NOT_REACHED; /* NOTREACHED */ |
a0d0e21e LW |
1747 | } |
1748 | ||
1749 | PP(pp_xor) | |
1750 | { | |
20b7effb | 1751 | dSP; dPOPTOPssrl; |
a0d0e21e LW |
1752 | if (SvTRUE(left) != SvTRUE(right)) |
1753 | RETSETYES; | |
1754 | else | |
1755 | RETSETNO; | |
1756 | } | |
1757 | ||
8dff4fc5 | 1758 | /* |
dcccc8ff KW |
1759 | |
1760 | =head1 CV Manipulation Functions | |
1761 | ||
8dff4fc5 BM |
1762 | =for apidoc caller_cx |
1763 | ||
72d33970 | 1764 | The XSUB-writer's equivalent of L<caller()|perlfunc/caller>. The |
8dff4fc5 | 1765 | returned C<PERL_CONTEXT> structure can be interrogated to find all the |
72d33970 | 1766 | information returned to Perl by C<caller>. Note that XSUBs don't get a |
8dff4fc5 BM |
1767 | stack frame, so C<caller_cx(0, NULL)> will return information for the |
1768 | immediately-surrounding Perl code. | |
1769 | ||
1770 | This function skips over the automatic calls to C<&DB::sub> made on the | |
72d33970 | 1771 | behalf of the debugger. If the stack frame requested was a sub called by |
8dff4fc5 BM |
1772 | C<DB::sub>, the return value will be the frame for the call to |
1773 | C<DB::sub>, since that has the correct line number/etc. for the call | |
72d33970 | 1774 | site. If I<dbcxp> is non-C<NULL>, it will be set to a pointer to the |
8dff4fc5 BM |
1775 | frame for the sub call itself. |
1776 | ||
1777 | =cut | |
1778 | */ | |
1779 | ||
1780 | const PERL_CONTEXT * | |
1781 | Perl_caller_cx(pTHX_ I32 count, const PERL_CONTEXT **dbcxp) | |
a0d0e21e | 1782 | { |
eb578fdb KW |
1783 | I32 cxix = dopoptosub(cxstack_ix); |
1784 | const PERL_CONTEXT *cx; | |
1785 | const PERL_CONTEXT *ccstack = cxstack; | |
901017d6 | 1786 | const PERL_SI *top_si = PL_curstackinfo; |
27d41816 | 1787 | |
a0d0e21e | 1788 | for (;;) { |
2c375eb9 GS |
1789 | /* we may be in a higher stacklevel, so dig down deeper */ |
1790 | while (cxix < 0 && top_si->si_type != PERLSI_MAIN) { | |
1791 | top_si = top_si->si_prev; | |
1792 | ccstack = top_si->si_cxstack; | |
1793 | cxix = dopoptosub_at(ccstack, top_si->si_cxix); | |
1794 | } | |
8dff4fc5 BM |
1795 | if (cxix < 0) |
1796 | return NULL; | |
f2a7f298 DG |
1797 | /* caller() should not report the automatic calls to &DB::sub */ |
1798 | if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 && | |
3280af22 | 1799 | ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub)) |
a0d0e21e LW |
1800 | count++; |
1801 | if (!count--) | |
1802 | break; | |
2c375eb9 | 1803 | cxix = dopoptosub_at(ccstack, cxix - 1); |
a0d0e21e | 1804 | } |
2c375eb9 GS |
1805 | |
1806 | cx = &ccstack[cxix]; | |
8dff4fc5 BM |
1807 | if (dbcxp) *dbcxp = cx; |
1808 | ||
7766f137 | 1809 | if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) { |
f54cb97a | 1810 | const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1); |
2c375eb9 | 1811 | /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the |
06a5b730 | 1812 | field below is defined for any cx. */ |
f2a7f298 DG |
1813 | /* caller() should not report the automatic calls to &DB::sub */ |
1814 | if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub)) | |
2c375eb9 | 1815 | cx = &ccstack[dbcxix]; |
06a5b730 | 1816 | } |
1817 | ||
8dff4fc5 BM |
1818 | return cx; |
1819 | } | |
1820 | ||
1821 | PP(pp_caller) | |
1822 | { | |
8dff4fc5 | 1823 | dSP; |
eb578fdb | 1824 | const PERL_CONTEXT *cx; |
8dff4fc5 | 1825 | const PERL_CONTEXT *dbcx; |
1c23e2bd | 1826 | U8 gimme = GIMME_V; |
d527ce7c | 1827 | const HEK *stash_hek; |
8dff4fc5 | 1828 | I32 count = 0; |
ce0b554b | 1829 | bool has_arg = MAXARG && TOPs; |
25502127 | 1830 | const COP *lcop; |
8dff4fc5 | 1831 | |
ce0b554b FC |
1832 | if (MAXARG) { |
1833 | if (has_arg) | |
8dff4fc5 | 1834 | count = POPi; |
ce0b554b FC |
1835 | else (void)POPs; |
1836 | } | |
8dff4fc5 | 1837 | |
ce0b554b | 1838 | cx = caller_cx(count + !!(PL_op->op_private & OPpOFFBYONE), &dbcx); |
8dff4fc5 | 1839 | if (!cx) { |
48ebc325 | 1840 | if (gimme != G_ARRAY) { |
8dff4fc5 BM |
1841 | EXTEND(SP, 1); |
1842 | RETPUSHUNDEF; | |
1843 | } | |
1844 | RETURN; | |
1845 | } | |
1846 | ||
5e691bc6 | 1847 | CX_DEBUG(cx, "CALLER"); |
d0279c7c | 1848 | assert(CopSTASH(cx->blk_oldcop)); |
e7886211 FC |
1849 | stash_hek = SvTYPE(CopSTASH(cx->blk_oldcop)) == SVt_PVHV |
1850 | ? HvNAME_HEK((HV*)CopSTASH(cx->blk_oldcop)) | |
1851 | : NULL; | |
48ebc325 | 1852 | if (gimme != G_ARRAY) { |
27d41816 | 1853 | EXTEND(SP, 1); |
d527ce7c | 1854 | if (!stash_hek) |
3280af22 | 1855 | PUSHs(&PL_sv_undef); |
49d8d3a1 MB |
1856 | else { |
1857 | dTARGET; | |
d527ce7c | 1858 | sv_sethek(TARG, stash_hek); |
49d8d3a1 MB |
1859 | PUSHs(TARG); |
1860 | } | |
a0d0e21e LW |
1861 | RETURN; |
1862 | } | |
a0d0e21e | 1863 | |
b3ca2e83 | 1864 | EXTEND(SP, 11); |
27d41816 | 1865 | |
d527ce7c | 1866 | if (!stash_hek) |
3280af22 | 1867 | PUSHs(&PL_sv_undef); |
d527ce7c BF |
1868 | else { |
1869 | dTARGET; | |
1870 | sv_sethek(TARG, stash_hek); | |
1871 | PUSHTARG; | |
1872 | } | |
6e449a3a | 1873 | mPUSHs(newSVpv(OutCopFILE(cx->blk_oldcop), 0)); |
e6dae479 | 1874 | lcop = closest_cop(cx->blk_oldcop, OpSIBLING(cx->blk_oldcop), |
25502127 FC |
1875 | cx->blk_sub.retop, TRUE); |
1876 | if (!lcop) | |
1877 | lcop = cx->blk_oldcop; | |
e9e9e546 | 1878 | mPUSHu(CopLINE(lcop)); |
ce0b554b | 1879 | if (!has_arg) |
a0d0e21e | 1880 | RETURN; |
7766f137 GS |
1881 | if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) { |
1882 | /* So is ccstack[dbcxix]. */ | |
a5f47741 | 1883 | if (CvHASGV(dbcx->blk_sub.cv)) { |
ecf05a58 | 1884 | PUSHs(cv_name(dbcx->blk_sub.cv, 0, 0)); |
bf38a478 | 1885 | PUSHs(boolSV(CxHASARGS(cx))); |
07b8c804 RGS |
1886 | } |
1887 | else { | |
84bafc02 | 1888 | PUSHs(newSVpvs_flags("(unknown)", SVs_TEMP)); |
bf38a478 | 1889 | PUSHs(boolSV(CxHASARGS(cx))); |
07b8c804 | 1890 | } |
a0d0e21e LW |
1891 | } |
1892 | else { | |
84bafc02 | 1893 | PUSHs(newSVpvs_flags("(eval)", SVs_TEMP)); |
6e449a3a | 1894 | mPUSHi(0); |
a0d0e21e | 1895 | } |
1c23e2bd | 1896 | gimme = cx->blk_gimme; |
54310121 | 1897 | if (gimme == G_VOID) |
3280af22 | 1898 | PUSHs(&PL_sv_undef); |
54310121 | 1899 | else |
98625aca | 1900 | PUSHs(boolSV((gimme & G_WANT) == G_ARRAY)); |
6b35e009 | 1901 | if (CxTYPE(cx) == CXt_EVAL) { |
811a4de9 | 1902 | /* eval STRING */ |
85a64632 | 1903 | if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) { |
78beb4ca TC |
1904 | SV *cur_text = cx->blk_eval.cur_text; |
1905 | if (SvCUR(cur_text) >= 2) { | |
1906 | PUSHs(newSVpvn_flags(SvPVX(cur_text), SvCUR(cur_text)-2, | |
1907 | SvUTF8(cur_text)|SVs_TEMP)); | |
1908 | } | |
1909 | else { | |
1910 | /* I think this is will always be "", but be sure */ | |
1911 | PUSHs(sv_2mortal(newSVsv(cur_text))); | |
1912 | } | |
1913 | ||
3280af22 | 1914 | PUSHs(&PL_sv_no); |
0f79a09d | 1915 | } |
811a4de9 | 1916 | /* require */ |
0f79a09d | 1917 | else if (cx->blk_eval.old_namesv) { |
6e449a3a | 1918 | mPUSHs(newSVsv(cx->blk_eval.old_namesv)); |
3280af22 | 1919 | PUSHs(&PL_sv_yes); |
06a5b730 | 1920 | } |
811a4de9 GS |
1921 | /* eval BLOCK (try blocks have old_namesv == 0) */ |
1922 | else { | |
1923 | PUSHs(&PL_sv_undef); | |
1924 | PUSHs(&PL_sv_undef); | |
1925 | } | |
4633a7c4 | 1926 | } |
a682de96 GS |
1927 | else { |
1928 | PUSHs(&PL_sv_undef); | |
1929 | PUSHs(&PL_sv_undef); | |
1930 | } | |
bafb2adc | 1931 | if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx) |
ed094faf | 1932 | && CopSTASH_eq(PL_curcop, PL_debstash)) |
4633a7c4 | 1933 | { |
9513529b DM |
1934 | /* slot 0 of the pad contains the original @_ */ |
1935 | AV * const ary = MUTABLE_AV(AvARRAY(MUTABLE_AV( | |
1936 | PadlistARRAY(CvPADLIST(cx->blk_sub.cv))[ | |
1937 | cx->blk_sub.olddepth+1]))[0]); | |
c70927a6 | 1938 | const SSize_t off = AvARRAY(ary) - AvALLOC(ary); |
a0d0e21e | 1939 | |
e1a80902 | 1940 | Perl_init_dbargs(aTHX); |
a0d0e21e | 1941 | |
3280af22 NIS |
1942 | if (AvMAX(PL_dbargs) < AvFILLp(ary) + off) |
1943 | av_extend(PL_dbargs, AvFILLp(ary) + off); | |
1944 | Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*); | |
1945 | AvFILLp(PL_dbargs) = AvFILLp(ary) + off; | |
a0d0e21e | 1946 | } |
6e449a3a | 1947 | mPUSHi(CopHINTS_get(cx->blk_oldcop)); |
e476b1b5 GS |
1948 | { |
1949 | SV * mask ; | |
72dc9ed5 | 1950 | STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ; |
114bafba | 1951 | |
f07626ad | 1952 | if (old_warnings == pWARN_NONE) |
e476b1b5 | 1953 | mask = newSVpvn(WARN_NONEstring, WARNsize) ; |
f07626ad FC |
1954 | else if (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0) |
1955 | mask = &PL_sv_undef ; | |
ac27b0f5 | 1956 | else if (old_warnings == pWARN_ALL || |
75b6c4ca RGS |
1957 | (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) { |
1958 | /* Get the bit mask for $warnings::Bits{all}, because | |
1959 | * it could have been extended by warnings::register */ | |
1960 | SV **bits_all; | |
6673a63c | 1961 | HV * const bits = get_hv("warnings::Bits", 0); |
017a3ce5 | 1962 | if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) { |
75b6c4ca RGS |
1963 | mask = newSVsv(*bits_all); |
1964 | } | |
1965 | else { | |
1966 | mask = newSVpvn(WARN_ALLstring, WARNsize) ; | |
1967 | } | |
1968 | } | |
e476b1b5 | 1969 | else |
72dc9ed5 | 1970 | mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]); |
6e449a3a | 1971 | mPUSHs(mask); |
e476b1b5 | 1972 | } |
b3ca2e83 | 1973 | |
c28fe1ec | 1974 | PUSHs(cx->blk_oldcop->cop_hints_hash ? |
20439bc7 | 1975 | sv_2mortal(newRV_noinc(MUTABLE_SV(cop_hints_2hv(cx->blk_oldcop, 0)))) |
b3ca2e83 | 1976 | : &PL_sv_undef); |
a0d0e21e LW |
1977 | RETURN; |
1978 | } | |
1979 | ||
a0d0e21e LW |
1980 | PP(pp_reset) |
1981 | { | |
39644a26 | 1982 | dSP; |
ca826051 FC |
1983 | const char * tmps; |
1984 | STRLEN len = 0; | |
1985 | if (MAXARG < 1 || (!TOPs && !POPs)) | |
1986 | tmps = NULL, len = 0; | |
1987 | else | |
1988 | tmps = SvPVx_const(POPs, len); | |
1989 | sv_resetpvn(tmps, len, CopSTASH(PL_curcop)); | |
3280af22 | 1990 | PUSHs(&PL_sv_yes); |
a0d0e21e LW |
1991 | RETURN; |
1992 | } | |
1993 | ||
dd2155a4 DM |
1994 | /* like pp_nextstate, but used instead when the debugger is active */ |
1995 | ||
a0d0e21e LW |
1996 | PP(pp_dbstate) |
1997 | { | |
533c011a | 1998 | PL_curcop = (COP*)PL_op; |
a0d0e21e | 1999 | TAINT_NOT; /* Each statement is presumed innocent */ |
4ebe6e95 | 2000 | PL_stack_sp = PL_stack_base + CX_CUR()->blk_oldsp; |
a0d0e21e LW |
2001 | FREETMPS; |
2002 | ||
f410a211 NC |
2003 | PERL_ASYNC_CHECK(); |
2004 | ||
88df5f01 | 2005 | if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */ |
a6d69523 | 2006 | || PL_DBsingle_iv || PL_DBsignal_iv || PL_DBtrace_iv) |
a0d0e21e | 2007 | { |
39644a26 | 2008 | dSP; |
eb578fdb | 2009 | PERL_CONTEXT *cx; |
1c23e2bd | 2010 | const U8 gimme = G_ARRAY; |
0bd48802 | 2011 | GV * const gv = PL_DBgv; |
432d4561 JL |
2012 | CV * cv = NULL; |
2013 | ||
2014 | if (gv && isGV_with_GP(gv)) | |
2015 | cv = GvCV(gv); | |
a0d0e21e | 2016 | |
c2cb6f77 | 2017 | if (!cv || (!CvROOT(cv) && !CvXSUB(cv))) |
cea2e8a9 | 2018 | DIE(aTHX_ "No DB::DB routine defined"); |
a0d0e21e | 2019 | |
aea4f609 DM |
2020 | if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG)) |
2021 | /* don't do recursive DB::DB call */ | |
a0d0e21e | 2022 | return NORMAL; |
748a9306 | 2023 | |
aed2304a | 2024 | if (CvISXSUB(cv)) { |
8ae997c5 DM |
2025 | ENTER; |
2026 | SAVEI32(PL_debug); | |
2027 | PL_debug = 0; | |
2028 | SAVESTACK_POS(); | |
8a44b450 | 2029 | SAVETMPS; |
c127bd3a SF |
2030 | PUSHMARK(SP); |
2031 | (void)(*CvXSUB(cv))(aTHX_ cv); | |
c127bd3a | 2032 | FREETMPS; |
a57c6685 | 2033 | LEAVE; |
c127bd3a SF |
2034 | return NORMAL; |
2035 | } | |
2036 | else { | |
ed8ff0f3 | 2037 | cx = cx_pushblock(CXt_SUB, gimme, SP, PL_savestack_ix); |
a73d8813 DM |
2038 | cx_pushsub(cx, cv, PL_op->op_next, 0); |
2039 | /* OP_DBSTATE's op_private holds hint bits rather than | |
2040 | * the lvalue-ish flags seen in OP_ENTERSUB. So cancel | |
2041 | * any CxLVAL() flags that have now been mis-calculated */ | |
2042 | cx->blk_u16 = 0; | |
8ae997c5 DM |
2043 | |
2044 | SAVEI32(PL_debug); | |
2045 | PL_debug = 0; | |
2046 | SAVESTACK_POS(); | |
c127bd3a | 2047 | CvDEPTH(cv)++; |
d2af2719 | 2048 | if (CvDEPTH(cv) >= 2) |
9d976ff5 | 2049 | pad_push(CvPADLIST(cv), CvDEPTH(cv)); |
9d976ff5 | 2050 | PAD_SET_CUR_NOSAVE(CvPADLIST(cv), CvDEPTH(cv)); |
c127bd3a SF |
2051 | RETURNOP(CvSTART(cv)); |
2052 | } | |
a0d0e21e LW |
2053 | } |
2054 | else | |
2055 | return NORMAL; | |
2056 | } | |
2057 | ||
0663a8f8 | 2058 | |
2b9a6457 VP |
2059 | PP(pp_enter) |
2060 | { | |
1c23e2bd | 2061 | U8 gimme = GIMME_V; |
2b9a6457 | 2062 | |
d4ce7588 DM |
2063 | (void)cx_pushblock(CXt_BLOCK, gimme, PL_stack_sp, PL_savestack_ix); |
2064 | return NORMAL; | |
2b9a6457 VP |
2065 | } |
2066 | ||
d4ce7588 | 2067 | |
2b9a6457 VP |
2068 | PP(pp_leave) |
2069 | { | |
eb578fdb | 2070 | PERL_CONTEXT *cx; |
f5ddd604 | 2071 | SV **oldsp; |
1c23e2bd | 2072 | U8 gimme; |
2b9a6457 | 2073 | |
4ebe6e95 | 2074 | cx = CX_CUR(); |
61d3b95a | 2075 | assert(CxTYPE(cx) == CXt_BLOCK); |
4df352a8 DM |
2076 | |
2077 | if (PL_op->op_flags & OPf_SPECIAL) | |
c349b9a0 DM |
2078 | /* fake block should preserve $1 et al; e.g. /(...)/ while ...; */ |
2079 | cx->blk_oldpm = PL_curpm; | |
4df352a8 | 2080 | |
f5ddd604 | 2081 | oldsp = PL_stack_base + cx->blk_oldsp; |
61d3b95a | 2082 | gimme = cx->blk_gimme; |
2b9a6457 | 2083 | |
0663a8f8 | 2084 | if (gimme == G_VOID) |
f5ddd604 | 2085 | PL_stack_sp = oldsp; |
0663a8f8 | 2086 | else |
f5ddd604 | 2087 | leave_adjust_stacks(oldsp, oldsp, gimme, |
75bc488d | 2088 | PL_op->op_private & OPpLVALUE ? 3 : 1); |
67f63db7 | 2089 | |
2f450c1b | 2090 | CX_LEAVE_SCOPE(cx); |
ed8ff0f3 | 2091 | cx_popblock(cx); |
5da525e9 | 2092 | CX_POP(cx); |
2b9a6457 | 2093 | |
0663a8f8 | 2094 | return NORMAL; |
2b9a6457 VP |
2095 | } |
2096 | ||
eaa9f768 JH |
2097 | static bool |
2098 | S_outside_integer(pTHX_ SV *sv) | |
2099 | { | |
2100 | if (SvOK(sv)) { | |
2101 | const NV nv = SvNV_nomg(sv); | |
415b66b2 JH |
2102 | if (Perl_isinfnan(nv)) |
2103 | return TRUE; | |
eaa9f768 JH |
2104 | #ifdef NV_PRESERVES_UV |
2105 | if (nv < (NV)IV_MIN || nv > (NV)IV_MAX) | |
2106 | return TRUE; | |
2107 | #else | |
2108 | if (nv <= (NV)IV_MIN) | |
2109 | return TRUE; | |
2110 | if ((nv > 0) && | |
2111 | ((nv > (NV)UV_MAX || | |
2112 | SvUV_nomg(sv) > (UV)IV_MAX))) | |
2113 | return TRUE; | |
2114 | #endif | |
2115 | } | |
2116 | return FALSE; | |
2117 | } | |
2118 | ||
a0d0e21e LW |
2119 | PP(pp_enteriter) |
2120 | { | |
20b7effb | 2121 | dSP; dMARK; |
eb578fdb | 2122 | PERL_CONTEXT *cx; |
1c23e2bd | 2123 | const U8 gimme = GIMME_V; |
4ad63d70 | 2124 | void *itervarp; /* GV or pad slot of the iteration variable */ |
f0bb9bf7 | 2125 | SV *itersave; /* the old var in the iterator var slot */ |
93661e56 | 2126 | U8 cxflags = 0; |
a0d0e21e | 2127 | |
aafca525 | 2128 | if (PL_op->op_targ) { /* "my" variable */ |
4ad63d70 DM |
2129 | itervarp = &PAD_SVl(PL_op->op_targ); |
2130 | itersave = *(SV**)itervarp; | |
2131 | assert(itersave); | |
aafca525 | 2132 | if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */ |
fdb8b82b DM |
2133 | /* the SV currently in the pad slot is never live during |
2134 | * iteration (the slot is always aliased to one of the items) | |
2135 | * so it's always stale */ | |
4ad63d70 | 2136 | SvPADSTALE_on(itersave); |
14f338dc | 2137 | } |
4ad63d70 | 2138 | SvREFCNT_inc_simple_void_NN(itersave); |
93661e56 | 2139 | cxflags = CXp_FOR_PAD; |
54b9620d | 2140 | } |
d39c26a6 FC |
2141 | else { |
2142 | SV * const sv = POPs; | |
4ad63d70 | 2143 | itervarp = (void *)sv; |
d4e2b4d6 | 2144 | if (LIKELY(isGV(sv))) { /* symbol table variable */ |
6d3ca00e DM |
2145 | itersave = GvSV(sv); |
2146 | SvREFCNT_inc_simple_void(itersave); | |
93661e56 | 2147 | cxflags = CXp_FOR_GV; |
28e0cf42 DM |
2148 | if (PL_op->op_private & OPpITER_DEF) |
2149 | cxflags |= CXp_FOR_DEF; | |
d4e2b4d6 DM |
2150 | } |
2151 | else { /* LV ref: for \$foo (...) */ | |
2152 | assert(SvTYPE(sv) == SVt_PVMG); | |
2153 | assert(SvMAGIC(sv)); | |
2154 | assert(SvMAGIC(sv)->mg_type == PERL_MAGIC_lvref); | |
2155 | itersave = NULL; | |
93661e56 | 2156 | cxflags = CXp_FOR_LVREF; |
d4e2b4d6 | 2157 | } |
d39c26a6 | 2158 | } |
28e0cf42 DM |
2159 | /* OPpITER_DEF (implicit $_) should only occur with a GV iter var */ |
2160 | assert((cxflags & CXp_FOR_GV) || !(PL_op->op_private & OPpITER_DEF)); | |
0d863452 | 2161 | |
75fbe096 DM |
2162 | /* Note that this context is initially set as CXt_NULL. Further on |
2163 | * down it's changed to one of the CXt_LOOP_*. Before it's changed, | |
2164 | * there mustn't be anything in the blk_loop substruct that requires | |
2165 | * freeing or undoing, in case we die in the meantime. And vice-versa. | |
2166 | */ | |
ed8ff0f3 | 2167 | cx = cx_pushblock(cxflags, gimme, MARK, PL_savestack_ix); |
d1b6bf72 | 2168 | cx_pushloop_for(cx, itervarp, itersave); |
2c49879e | 2169 | |
533c011a | 2170 | if (PL_op->op_flags & OPf_STACKED) { |
2c49879e DM |
2171 | /* OPf_STACKED implies either a single array: for(@), with a |
2172 | * single AV on the stack, or a range: for (1..5), with 1 and 5 on | |
2173 | * the stack */ | |
d01136d6 BS |
2174 | SV *maybe_ary = POPs; |
2175 | if (SvTYPE(maybe_ary) != SVt_PVAV) { | |
2c49879e | 2176 | /* range */ |
89ea2908 | 2177 | dPOPss; |
d01136d6 | 2178 | SV * const right = maybe_ary; |
93661e56 | 2179 | if (UNLIKELY(cxflags & CXp_FOR_LVREF)) |
d39c26a6 | 2180 | DIE(aTHX_ "Assigned value is not a reference"); |
984a4bea RD |
2181 | SvGETMAGIC(sv); |
2182 | SvGETMAGIC(right); | |
4fe3f0fa | 2183 | if (RANGE_IS_NUMERIC(sv,right)) { |
c6fdafd0 | 2184 | cx->cx_type |= CXt_LOOP_LAZYIV; |
eaa9f768 JH |
2185 | if (S_outside_integer(aTHX_ sv) || |
2186 | S_outside_integer(aTHX_ right)) | |
076d9a11 | 2187 | DIE(aTHX_ "Range iterator outside integer range"); |
f52e41ad FC |
2188 | cx->blk_loop.state_u.lazyiv.cur = SvIV_nomg(sv); |
2189 | cx->blk_loop.state_u.lazyiv.end = SvIV_nomg(right); | |
89ea2908 | 2190 | } |
3f63a782 | 2191 | else { |
d01136d6 | 2192 | cx->cx_type |= CXt_LOOP_LAZYSV; |
d01136d6 BS |
2193 | cx->blk_loop.state_u.lazysv.cur = newSVsv(sv); |
2194 | cx->blk_loop.state_u.lazysv.end = right; | |
2c49879e | 2195 | SvREFCNT_inc_simple_void_NN(right); |
d01136d6 | 2196 | (void) SvPV_force_nolen(cx->blk_loop.state_u.lazysv.cur); |
267cc4a8 NC |
2197 | /* This will do the upgrade to SVt_PV, and warn if the value |
2198 | is uninitialised. */ | |
10516c54 | 2199 | (void) SvPV_nolen_const(right); |
267cc4a8 NC |
2200 | /* Doing this avoids a check every time in pp_iter in pp_hot.c |
2201 | to replace !SvOK() with a pointer to "". */ | |
2202 | if (!SvOK(right)) { | |
2203 | SvREFCNT_dec(right); | |
d01136d6 | 2204 | cx->blk_loop.state_u.lazysv.end = &PL_sv_no; |
267cc4a8 | 2205 | } |
3f63a782 | 2206 | } |
89ea2908 | 2207 | } |
d01136d6 | 2208 | else /* SvTYPE(maybe_ary) == SVt_PVAV */ { |
2c49879e | 2209 | /* for (@array) {} */ |
93661e56 | 2210 | cx->cx_type |= CXt_LOOP_ARY; |
502c6561 | 2211 | cx->blk_loop.state_u.ary.ary = MUTABLE_AV(maybe_ary); |
2c49879e | 2212 | SvREFCNT_inc_simple_void_NN(maybe_ary); |
d01136d6 BS |
2213 | cx->blk_loop.state_u.ary.ix = |
2214 | (PL_op->op_private & OPpITER_REVERSED) ? | |
2215 | AvFILL(cx->blk_loop.state_u.ary.ary) + 1 : | |
2216 | -1; | |
ef3e5ea9 | 2217 | } |
8a1f10dd | 2218 | /* EXTEND(SP, 1) not needed in this branch because we just did POPs */ |
89ea2908 | 2219 | } |
d01136d6 | 2220 | else { /* iterating over items on the stack */ |
93661e56 | 2221 | cx->cx_type |= CXt_LOOP_LIST; |
1bef65a2 | 2222 | cx->blk_oldsp = SP - PL_stack_base; |
93661e56 DM |
2223 | cx->blk_loop.state_u.stack.basesp = MARK - PL_stack_base; |
2224 | cx->blk_loop.state_u.stack.ix = | |
2225 | (PL_op->op_private & OPpITER_REVERSED) | |
2226 | ? cx->blk_oldsp + 1 | |
2227 | : cx->blk_loop.state_u.stack.basesp; | |
8a1f10dd DM |
2228 | /* pre-extend stack so pp_iter doesn't have to check every time |
2229 | * it pushes yes/no */ | |
2230 | EXTEND(SP, 1); | |
4633a7c4 | 2231 | } |
a0d0e21e LW |
2232 | |
2233 | RETURN; | |
2234 | } | |
2235 | ||
2236 | PP(pp_enterloop) | |
2237 | { | |
eb578fdb | 2238 | PERL_CONTEXT *cx; |
1c23e2bd | 2239 | const U8 gimme = GIMME_V; |
a0d0e21e | 2240 | |
d4ce7588 | 2241 | cx = cx_pushblock(CXt_LOOP_PLAIN, gimme, PL_stack_sp, PL_savestack_ix); |
d1b6bf72 | 2242 | cx_pushloop_plain(cx); |
d4ce7588 | 2243 | return NORMAL; |
a0d0e21e LW |
2244 | } |
2245 | ||
d4ce7588 | 2246 | |
a0d0e21e LW |
2247 | PP(pp_leaveloop) |
2248 | { | |
eb578fdb | 2249 | PERL_CONTEXT *cx; |
1c23e2bd | 2250 | U8 gimme; |
f5ddd604 | 2251 | SV **oldsp; |
a0d0e21e LW |
2252 | SV **mark; |
2253 | ||
4ebe6e95 | 2254 | cx = CX_CUR(); |
3b719c58 | 2255 | assert(CxTYPE_is_LOOP(cx)); |
61d3b95a | 2256 | mark = PL_stack_base + cx->blk_oldsp; |
f5ddd604 | 2257 | oldsp = CxTYPE(cx) == CXt_LOOP_LIST |
1bef65a2 DM |
2258 | ? PL_stack_base + cx->blk_loop.state_u.stack.basesp |
2259 | : mark; | |
61d3b95a | 2260 | gimme = cx->blk_gimme; |
f86702cc | 2261 | |
0663a8f8 | 2262 | if (gimme == G_VOID) |
f5ddd604 | 2263 | PL_stack_sp = oldsp; |
0663a8f8 | 2264 | else |
f5ddd604 | 2265 | leave_adjust_stacks(MARK, oldsp, gimme, |
75bc488d | 2266 | PL_op->op_private & OPpLVALUE ? 3 : 1); |
f86702cc | 2267 | |
2f450c1b | 2268 | CX_LEAVE_SCOPE(cx); |
d1b6bf72 | 2269 | cx_poploop(cx); /* Stack values are safe: release loop vars ... */ |
ed8ff0f3 | 2270 | cx_popblock(cx); |
5da525e9 | 2271 | CX_POP(cx); |
f86702cc | 2272 | |
f86702cc | 2273 | return NORMAL; |
a0d0e21e LW |
2274 | } |
2275 | ||
31ccb4f5 DM |
2276 | |
2277 | /* This duplicates most of pp_leavesub, but with additional code to handle | |
2278 | * return args in lvalue context. It was forked from pp_leavesub to | |
2279 | * avoid slowing down that function any further. | |
2280 | * | |
2281 | * Any changes made to this function may need to be copied to pp_leavesub | |
2282 | * and vice-versa. | |
c349b9a0 DM |
2283 | * |
2284 | * also tail-called by pp_return | |
57486a97 DM |
2285 | */ |
2286 | ||
31ccb4f5 | 2287 | PP(pp_leavesublv) |
3bdf583b | 2288 | { |
1c23e2bd | 2289 | U8 gimme; |
57486a97 | 2290 | PERL_CONTEXT *cx; |
799da9d7 | 2291 | SV **oldsp; |
5da525e9 | 2292 | OP *retop; |
57486a97 | 2293 | |
4ebe6e95 | 2294 | cx = CX_CUR(); |
61d3b95a DM |
2295 | assert(CxTYPE(cx) == CXt_SUB); |
2296 | ||
2297 | if (CxMULTICALL(cx)) { | |
1f0ba93b DM |
2298 | /* entry zero of a stack is always PL_sv_undef, which |
2299 | * simplifies converting a '()' return into undef in scalar context */ | |
2300 | assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); | |
85ecf147 | 2301 | return 0; |
1f0ba93b | 2302 | } |
85ecf147 | 2303 | |
61d3b95a | 2304 | gimme = cx->blk_gimme; |
799da9d7 | 2305 | oldsp = PL_stack_base + cx->blk_oldsp; /* last arg of previous frame */ |
57486a97 | 2306 | |
799da9d7 DM |
2307 | if (gimme == G_VOID) |
2308 | PL_stack_sp = oldsp; | |
2309 | else { | |
2310 | U8 lval = CxLVAL(cx); | |
2311 | bool is_lval = (lval && !(lval & OPpENTERSUB_INARGS)); | |
2312 | const char *what = NULL; | |
2313 | ||
2314 | if (gimme == G_SCALAR) { | |
2315 | if (is_lval) { | |
2316 | /* check for bad return arg */ | |
2317 | if (oldsp < PL_stack_sp) { | |
2318 | SV *sv = *PL_stack_sp; | |
2319 | if ((SvPADTMP(sv) || SvREADONLY(sv))) { | |
2320 | what = | |
2321 | SvREADONLY(sv) ? (sv == &PL_sv_undef) ? "undef" | |
2322 | : "a readonly value" : "a temporary"; | |
2323 | } | |
2324 | else goto ok; | |
2325 | } | |
2326 | else { | |
2327 | /* sub:lvalue{} will take us here. */ | |
2328 | what = "undef"; | |
2329 | } | |
2330 | croak: | |
2331 | Perl_croak(aTHX_ | |
2332 | "Can't return %s from lvalue subroutine", what); | |
2333 | } | |
57486a97 | 2334 | |
799da9d7 | 2335 | ok: |
e02ce34b | 2336 | leave_adjust_stacks(oldsp, oldsp, gimme, is_lval ? 3 : 2); |
e80c4acf | 2337 | |
799da9d7 DM |
2338 | if (lval & OPpDEREF) { |
2339 | /* lval_sub()->{...} and similar */ | |
2340 | dSP; | |
2341 | SvGETMAGIC(TOPs); | |
2342 | if (!SvOK(TOPs)) { | |
2343 | TOPs = vivify_ref(TOPs, CxLVAL(cx) & OPpDEREF); | |
2344 | } | |
2345 | PUTBACK; | |
2346 | } | |
2347 | } | |
2348 | else { | |
2349 | assert(gimme == G_ARRAY); | |
2350 | assert (!(lval & OPpDEREF)); | |
2351 | ||
2352 | if (is_lval) { | |
2353 | /* scan for bad return args */ | |
2354 | SV **p; | |
2355 | for (p = PL_stack_sp; p > oldsp; p--) { | |
2356 | SV *sv = *p; | |
2357 | /* the PL_sv_undef exception is to allow things like | |
2358 | * this to work, where PL_sv_undef acts as 'skip' | |
2359 | * placeholder on the LHS of list assigns: | |
2360 | * sub foo :lvalue { undef } | |
2361 | * ($a, undef, foo(), $b) = 1..4; | |
2362 | */ | |
2363 | if (sv != &PL_sv_undef && (SvPADTMP(sv) || SvREADONLY(sv))) | |
2364 | { | |
2365 | /* Might be flattened array after $#array = */ | |
2366 | what = SvREADONLY(sv) | |
2367 | ? "a readonly value" : "a temporary"; | |
2368 | goto croak; | |
2369 | } | |
2370 | } | |
2371 | } | |
2372 | ||
e02ce34b | 2373 | leave_adjust_stacks(oldsp, oldsp, gimme, is_lval ? 3 : 2); |
799da9d7 | 2374 | } |
3bdf583b | 2375 | } |
57486a97 | 2376 | |
2f450c1b | 2377 | CX_LEAVE_SCOPE(cx); |
a73d8813 | 2378 | cx_popsub(cx); /* Stack values are safe: release CV and @_ ... */ |
ed8ff0f3 | 2379 | cx_popblock(cx); |
5da525e9 DM |
2380 | retop = cx->blk_sub.retop; |
2381 | CX_POP(cx); | |
57486a97 | 2382 | |
5da525e9 | 2383 | return retop; |
3bdf583b FC |
2384 | } |
2385 | ||
57486a97 | 2386 | |
a0d0e21e LW |
2387 | PP(pp_return) |
2388 | { | |
20b7effb | 2389 | dSP; dMARK; |
eb578fdb | 2390 | PERL_CONTEXT *cx; |
0bd48802 AL |
2391 | const I32 cxix = dopoptosub(cxstack_ix); |
2392 | ||
d40dc6b1 DM |
2393 | assert(cxstack_ix >= 0); |
2394 | if (cxix < cxstack_ix) { | |
2395 | if (cxix < 0) { | |
79646418 DM |
2396 | if (!( PL_curstackinfo->si_type == PERLSI_SORT |
2397 | || ( PL_curstackinfo->si_type == PERLSI_MULTICALL | |
2398 | && (cxstack[0].cx_type & CXp_SUB_RE_FAKE)) | |
2399 | ) | |
2400 | ) | |
3089a108 | 2401 | DIE(aTHX_ "Can't return outside a subroutine"); |
79646418 DM |
2402 | /* We must be in: |
2403 | * a sort block, which is a CXt_NULL not a CXt_SUB; | |
2404 | * or a /(?{...})/ block. | |
2405 | * Handle specially. */ | |
2406 | assert(CxTYPE(&cxstack[0]) == CXt_NULL | |
2407 | || ( CxTYPE(&cxstack[0]) == CXt_SUB | |
2408 | && (cxstack[0].cx_type & CXp_SUB_RE_FAKE))); | |
3089a108 DM |
2409 | if (cxstack_ix > 0) { |
2410 | /* See comment below about context popping. Since we know | |
2411 | * we're scalar and not lvalue, we can preserve the return | |
2412 | * value in a simpler fashion than there. */ | |
2413 | SV *sv = *SP; | |
d40dc6b1 | 2414 | assert(cxstack[0].blk_gimme == G_SCALAR); |
3089a108 DM |
2415 | if ( (sp != PL_stack_base) |
2416 | && !(SvFLAGS(sv) & (SVs_TEMP|SVs_PADTMP)) | |
2417 | ) | |
2418 | *SP = sv_mortalcopy(sv); | |
2419 | dounwind(0); | |
d40dc6b1 | 2420 | } |
3089a108 DM |
2421 | /* caller responsible for popping cxstack[0] */ |
2422 | return 0; | |
d40dc6b1 | 2423 | } |
3089a108 DM |
2424 | |
2425 | /* There are contexts that need popping. Doing this may free the | |
c349b9a0 | 2426 | * return value(s), so preserve them first: e.g. popping the plain |
3089a108 DM |
2427 | * loop here would free $x: |
2428 | * sub f { { my $x = 1; return $x } } | |
2429 | * We may also need to shift the args down; for example, | |
2430 | * for (1,2) { return 3,4 } | |
c349b9a0 DM |
2431 | * leaves 1,2,3,4 on the stack. Both these actions will be done by |
2432 | * leave_adjust_stacks(), along with freeing any temps. Note that | |
2433 | * whoever we tail-call (e.g. pp_leaveeval) will also call | |
2434 | * leave_adjust_stacks(); however, the second call is likely to | |
2435 | * just see a bunch of SvTEMPs with a ref count of 1, and so just | |
2436 | * pass them through, rather than copying them again. So this | |
2437 | * isn't as inefficient as it sounds. | |
3089a108 DM |
2438 | */ |
2439 | cx = &cxstack[cxix]; | |
3089a108 | 2440 | PUTBACK; |
e02ce34b DM |
2441 | if (cx->blk_gimme != G_VOID) |
2442 | leave_adjust_stacks(MARK, PL_stack_base + cx->blk_oldsp, | |
fc6e609e DM |
2443 | cx->blk_gimme, |
2444 | CxTYPE(cx) == CXt_SUB && CvLVALUE(cx->blk_sub.cv) | |
2445 | ? 3 : 0); | |
0663a8f8 | 2446 | SPAGAIN; |
a0d0e21e | 2447 | dounwind(cxix); |
42831ce4 | 2448 | cx = &cxstack[cxix]; /* CX stack may have been realloced */ |
d40dc6b1 | 2449 | } |
3089a108 DM |
2450 | else { |
2451 | /* Like in the branch above, we need to handle any extra junk on | |
2452 | * the stack. But because we're not also popping extra contexts, we | |
2453 | * don't have to worry about prematurely freeing args. So we just | |
2454 | * need to do the bare minimum to handle junk, and leave the main | |
2455 | * arg processing in the function we tail call, e.g. pp_leavesub. | |
2456 | * In list context we have to splice out the junk; in scalar | |
2457 | * context we can leave as-is (pp_leavesub will later return the | |
2458 | * top stack element). But for an empty arg list, e.g. | |
2459 | * for (1,2) { return } | |
2460 | * we need to set sp = oldsp so that pp_leavesub knows to push | |
2461 | * &PL_sv_undef onto the stack. | |
2462 | */ | |
3ebe7c5a DM |
2463 | SV **oldsp; |
2464 | cx = &cxstack[cxix]; | |
2465 | oldsp = PL_stack_base + cx->blk_oldsp; | |
2466 | if (oldsp != MARK) { | |
2467 | SSize_t nargs = SP - MARK; | |
2468 | if (nargs) { | |
2469 | if (cx->blk_gimme == G_ARRAY) { | |
2470 | /* shift return args to base of call stack frame */ | |
2471 | Move(MARK + 1, oldsp + 1, nargs, SV*); | |
2472 | PL_stack_sp = oldsp + nargs; | |
2473 | } | |
6228a1e1 | 2474 | } |
3ebe7c5a DM |
2475 | else |
2476 | PL_stack_sp = oldsp; | |
13929c4c | 2477 | } |
3089a108 | 2478 | } |
617a4f41 DM |
2479 | |
2480 | /* fall through to a normal exit */ | |
2481 | switch (CxTYPE(cx)) { | |
2482 | case CXt_EVAL: | |
2483 | return CxTRYBLOCK(cx) | |
2484 | ? Perl_pp_leavetry(aTHX) | |
2485 | : Perl_pp_leaveeval(aTHX); | |
2486 | case CXt_SUB: | |
13929c4c | 2487 | return CvLVALUE(cx->blk_sub.cv) |
31ccb4f5 | 2488 | ? Perl_pp_leavesublv(aTHX) |
13929c4c | 2489 | : Perl_pp_leavesub(aTHX); |
7766f137 | 2490 | case CXt_FORMAT: |
617a4f41 | 2491 | return Perl_pp_leavewrite(aTHX); |
a0d0e21e | 2492 | default: |
5637ef5b | 2493 | DIE(aTHX_ "panic: return, type=%u", (unsigned) CxTYPE(cx)); |
a0d0e21e | 2494 | } |
a0d0e21e LW |
2495 | } |
2496 | ||
42b5eca0 | 2497 | /* find the enclosing loop or labelled loop and dounwind() back to it. */ |
4f443c3d | 2498 | |
31705cda | 2499 | static PERL_CONTEXT * |
42b5eca0 | 2500 | S_unwind_loop(pTHX) |
a0d0e21e | 2501 | { |
a0d0e21e | 2502 | I32 cxix; |
1f039d60 FC |
2503 | if (PL_op->op_flags & OPf_SPECIAL) { |
2504 | cxix = dopoptoloop(cxstack_ix); | |
2505 | if (cxix < 0) | |
2506 | /* diag_listed_as: Can't "last" outside a loop block */ | |
42b5eca0 DM |
2507 | Perl_croak(aTHX_ "Can't \"%s\" outside a loop block", |
2508 | OP_NAME(PL_op)); | |
1f039d60 FC |
2509 | } |
2510 | else { | |
2511 | dSP; | |
2512 | STRLEN label_len; | |
2513 | const char * const label = | |
2514 | PL_op->op_flags & OPf_STACKED | |
2515 | ? SvPV(TOPs,label_len) | |
2516 | : (label_len = strlen(cPVOP->op_pv), cPVOP->op_pv); | |
2517 | const U32 label_flags = | |
2518 | PL_op->op_flags & OPf_STACKED | |
2519 | ? SvUTF8(POPs) | |
2520 | : (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0; | |
2521 | PUTBACK; | |
2522 | cxix = dopoptolabel(label, label_len, label_flags); | |
2523 | if (cxix < 0) | |
2524 | /* diag_listed_as: Label not found for "last %s" */ | |
2525 | Perl_croak(aTHX_ "Label not found for \"%s %"SVf"\"", | |
42b5eca0 | 2526 | OP_NAME(PL_op), |
1f039d60 FC |
2527 | SVfARG(PL_op->op_flags & OPf_STACKED |
2528 | && !SvGMAGICAL(TOPp1s) | |
2529 | ? TOPp1s | |
2530 | : newSVpvn_flags(label, | |
2531 | label_len, | |
2532 | label_flags | SVs_TEMP))); | |
2533 | } | |
2534 | if (cxix < cxstack_ix) | |
2535 | dounwind(cxix); | |
dc7f00ca | 2536 | return &cxstack[cxix]; |
1f039d60 FC |
2537 | } |
2538 | ||
dc7f00ca | 2539 | |
1f039d60 FC |
2540 | PP(pp_last) |
2541 | { | |
eb578fdb | 2542 | PERL_CONTEXT *cx; |
5da525e9 | 2543 | OP* nextop; |
9d4ba2ae | 2544 | |
42b5eca0 | 2545 | cx = S_unwind_loop(aTHX); |
4df352a8 | 2546 | |
93661e56 | 2547 | assert(CxTYPE_is_LOOP(cx)); |
1bef65a2 DM |
2548 | PL_stack_sp = PL_stack_base |
2549 | + (CxTYPE(cx) == CXt_LOOP_LIST | |
2550 | ? cx->blk_loop.state_u.stack.basesp | |
2551 | : cx->blk_oldsp | |
2552 | ); | |
a0d0e21e | 2553 | |
a1f49e72 | 2554 | TAINT_NOT; |
f86702cc | 2555 | |
2556 | /* Stack values are safe: */ | |
2f450c1b | 2557 | CX_LEAVE_SCOPE(cx); |
d1b6bf72 | 2558 | cx_poploop(cx); /* release loop vars ... */ |
ed8ff0f3 | 2559 | cx_popblock(cx); |
5da525e9 DM |
2560 | nextop = cx->blk_loop.my_op->op_lastop->op_next; |
2561 | CX_POP(cx); | |
a0d0e21e | 2562 | |
5da525e9 | 2563 | return nextop; |
a0d0e21e LW |
2564 | } |
2565 | ||
2566 | PP(pp_next) | |
2567 | { | |
eb578fdb | 2568 | PERL_CONTEXT *cx; |
a0d0e21e | 2569 | |
cd97dc8d DM |
2570 | /* if not a bare 'next' in the main scope, search for it */ |
2571 | cx = CX_CUR(); | |
2572 | if (!((PL_op->op_flags & OPf_SPECIAL) && CxTYPE_is_LOOP(cx))) | |
2573 | cx = S_unwind_loop(aTHX); | |
a0d0e21e | 2574 | |
ed8ff0f3 | 2575 | cx_topblock(cx); |
3a1b2b9e | 2576 | PL_curcop = cx->blk_oldcop; |
47c9d59f | 2577 | PERL_ASYNC_CHECK(); |
d57ce4df | 2578 | return (cx)->blk_loop.my_op->op_nextop; |
a0d0e21e LW |
2579 | } |
2580 | ||
2581 | PP(pp_redo) | |
2582 | { | |
42b5eca0 | 2583 | PERL_CONTEXT *cx = S_unwind_loop(aTHX); |
dc7f00ca | 2584 | OP* redo_op = cx->blk_loop.my_op->op_redoop; |
a0d0e21e | 2585 | |
a034e688 DM |
2586 | if (redo_op->op_type == OP_ENTER) { |
2587 | /* pop one less context to avoid $x being freed in while (my $x..) */ | |
2588 | cxstack_ix++; | |
dc7f00ca DM |
2589 | cx = CX_CUR(); |
2590 | assert(CxTYPE(cx) == CXt_BLOCK); | |
a034e688 DM |
2591 | redo_op = redo_op->op_next; |
2592 | } | |
2593 | ||
936c78b5 | 2594 | FREETMPS; |
ef588991 | 2595 | CX_LEAVE_SCOPE(cx); |
ed8ff0f3 | 2596 | cx_topblock(cx); |
3a1b2b9e | 2597 | PL_curcop = cx->blk_oldcop; |
47c9d59f | 2598 | PERL_ASYNC_CHECK(); |
a034e688 | 2599 | return redo_op; |
a0d0e21e LW |
2600 | } |
2601 | ||
0824fdcb | 2602 | STATIC OP * |
5db1eb8d | 2603 | S_dofindlabel(pTHX_ OP *o, const char *label, STRLEN len, U32 flags, OP **opstack, OP **oplimit) |
a0d0e21e | 2604 | { |
a0d0e21e | 2605 | OP **ops = opstack; |
a1894d81 | 2606 | static const char* const too_deep = "Target of goto is too deeply nested"; |
a0d0e21e | 2607 | |
7918f24d NC |
2608 | PERL_ARGS_ASSERT_DOFINDLABEL; |
2609 | ||
fc36a67e | 2610 | if (ops >= oplimit) |
0157ef98 | 2611 | Perl_croak(aTHX_ "%s", too_deep); |
11343788 MB |
2612 | if (o->op_type == OP_LEAVE || |
2613 | o->op_type == OP_SCOPE || | |
2614 | o->op_type == OP_LEAVELOOP || | |
33d34e4c | 2615 | o->op_type == OP_LEAVESUB || |
11343788 | 2616 | o->op_type == OP_LEAVETRY) |
fc36a67e | 2617 | { |
5dc0d613 | 2618 | *ops++ = cUNOPo->op_first; |
fc36a67e | 2619 | if (ops >= oplimit) |
0157ef98 | 2620 | Perl_croak(aTHX_ "%s", too_deep); |
fc36a67e | 2621 | } |
c4aa4e48 | 2622 | *ops = 0; |
11343788 | 2623 | if (o->op_flags & OPf_KIDS) { |
aec46f14 | 2624 | OP *kid; |
a0d0e21e | 2625 | /* First try all the kids at this level, since that's likeliest. */ |
e6dae479 | 2626 | for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) { |
7e8f1eac | 2627 | if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) { |
5db1eb8d BF |
2628 | STRLEN kid_label_len; |
2629 | U32 kid_label_flags; | |
2630 | const char *kid_label = CopLABEL_len_flags(kCOP, | |
2631 | &kid_label_len, &kid_label_flags); | |
2632 | if (kid_label && ( | |
2633 | ( (kid_label_flags & SVf_UTF8) != (flags & SVf_UTF8) ) ? | |
2634 | (flags & SVf_UTF8) | |
2635 | ? (bytes_cmp_utf8( | |
2636 | (const U8*)kid_label, kid_label_len, | |
2637 | (const U8*)label, len) == 0) | |
2638 | : (bytes_cmp_utf8( | |
2639 | (const U8*)label, len, | |
2640 | (const U8*)kid_label, kid_label_len) == 0) | |
eade7155 BF |
2641 | : ( len == kid_label_len && ((kid_label == label) |
2642 | || memEQ(kid_label, label, len))))) | |
7e8f1eac AD |
2643 | return kid; |
2644 | } | |
a0d0e21e | 2645 | } |
e6dae479 | 2646 | for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) { |
3280af22 | 2647 | if (kid == PL_lastgotoprobe) |
a0d0e21e | 2648 | continue; |
ed8d0fe2 SM |
2649 | if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) { |
2650 | if (ops == opstack) | |
2651 | *ops++ = kid; | |
2652 | else if (ops[-1]->op_type == OP_NEXTSTATE || | |
2653 | ops[-1]->op_type == OP_DBSTATE) | |
2654 | ops[-1] = kid; | |
2655 | else | |
2656 | *ops++ = kid; | |
2657 | } | |
5db1eb8d | 2658 | if ((o = dofindlabel(kid, label, len, flags, ops, oplimit))) |
11343788 | 2659 | return o; |
a0d0e21e LW |
2660 | } |
2661 | } | |
c4aa4e48 | 2662 | *ops = 0; |
a0d0e21e LW |
2663 | return 0; |
2664 | } | |
2665 | ||
b1c05ba5 DM |
2666 | |
2667 | /* also used for: pp_dump() */ | |
2668 | ||
2669 | PP(pp_goto) | |
a0d0e21e | 2670 | { |
27da23d5 | 2671 | dVAR; dSP; |
cbbf8932 | 2672 | OP *retop = NULL; |
a0d0e21e | 2673 | I32 ix; |
eb578fdb | 2674 | PERL_CONTEXT *cx; |
fc36a67e | 2675 | #define GOTO_DEPTH 64 |
2676 | OP *enterops[GOTO_DEPTH]; | |
cbbf8932 | 2677 | const char *label = NULL; |
5db1eb8d BF |
2678 | STRLEN label_len = 0; |
2679 | U32 label_flags = 0; | |
bfed75c6 | 2680 | const bool do_dump = (PL_op->op_type == OP_DUMP); |
a1894d81 | 2681 | static const char* const must_have_label = "goto must have label"; |
a0d0e21e | 2682 | |
533c011a | 2683 | if (PL_op->op_flags & OPf_STACKED) { |
7d1d69cb DM |
2684 | /* goto EXPR or goto &foo */ |
2685 | ||
9d4ba2ae | 2686 | SV * const sv = POPs; |
55b37f1c | 2687 | SvGETMAGIC(sv); |
a0d0e21e | 2688 | |
a0d0e21e | 2689 | if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) { |
0fa3d31d | 2690 | /* This egregious kludge implements goto &subroutine */ |
a0d0e21e | 2691 | I32 cxix; |
eb578fdb | 2692 | PERL_CONTEXT *cx; |
ea726b52 | 2693 | CV *cv = MUTABLE_CV(SvRV(sv)); |
049bd5ff | 2694 | AV *arg = GvAV(PL_defgv); |
a0d0e21e | 2695 | |
5d52e310 | 2696 | while (!CvROOT(cv) && !CvXSUB(cv)) { |
7fc63493 | 2697 | const GV * const gv = CvGV(cv); |
e8f7dd13 | 2698 | if (gv) { |
7fc63493 | 2699 | GV *autogv; |
e8f7dd13 GS |
2700 | SV *tmpstr; |
2701 | /* autoloaded stub? */ | |
2702 | if (cv != GvCV(gv) && (cv = GvCV(gv))) | |
5d52e310 | 2703 | continue; |
c271df94 BF |
2704 | autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv), |
2705 | GvNAMELEN(gv), | |
2706 | GvNAMEUTF8(gv) ? SVf_UTF8 : 0); | |
e8f7dd13 | 2707 | if (autogv && (cv = GvCV(autogv))) |
5d52e310 | 2708 | continue; |
e8f7dd13 | 2709 | tmpstr = sv_newmortal(); |
c445ea15 | 2710 | gv_efullname3(tmpstr, gv, NULL); |
be2597df | 2711 | DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr)); |
4aa0a1f7 | 2712 | } |
cea2e8a9 | 2713 | DIE(aTHX_ "Goto undefined subroutine"); |
4aa0a1f7 AD |
2714 | } |
2715 | ||
a0d0e21e | 2716 | cxix = dopoptosub(cxstack_ix); |
d338c0c2 DM |
2717 | if (cxix < 0) { |
2718 | DIE(aTHX_ "Can't goto subroutine outside a subroutine"); | |
8da3792e | 2719 | } |
d338c0c2 | 2720 | cx = &cxstack[cxix]; |
564abe23 | 2721 | /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */ |
2d43a17f | 2722 | if (CxTYPE(cx) == CXt_EVAL) { |
c74ace89 | 2723 | if (CxREALEVAL(cx)) |
00455a92 | 2724 | /* diag_listed_as: Can't goto subroutine from an eval-%s */ |
c74ace89 DM |
2725 | DIE(aTHX_ "Can't goto subroutine from an eval-string"); |
2726 | else | |
00455a92 | 2727 | /* diag_listed_as: Can't goto subroutine from an eval-%s */ |
c74ace89 | 2728 | DIE(aTHX_ "Can't goto subroutine from an eval-block"); |
2d43a17f | 2729 | } |
9850bf21 RH |
2730 | else if (CxMULTICALL(cx)) |
2731 | DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)"); | |
d338c0c2 DM |
2732 | |
2733 | /* First do some returnish stuff. */ | |
2734 | ||
2735 | SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */ | |
2736 | FREETMPS; | |
2737 | if (cxix < cxstack_ix) { | |
2738 | dounwind(cxix); | |
2739 | } | |
7e637ba4 | 2740 | cx = CX_CUR(); |
ed8ff0f3 | 2741 | cx_topblock(cx); |
d338c0c2 | 2742 | SPAGAIN; |
39de75fd | 2743 | |
8ae997c5 DM |
2744 | /* protect @_ during save stack unwind. */ |
2745 | if (arg) | |
2746 | SvREFCNT_inc_NN(sv_2mortal(MUTABLE_SV(arg))); | |
2747 | ||
2748 | assert(PL_scopestack_ix == cx->blk_oldscopesp); | |
dfe0f39b | 2749 | CX_LEAVE_SCOPE(cx); |
8ae997c5 | 2750 | |
bafb2adc | 2751 | if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) { |
a73d8813 | 2752 | /* this is part of cx_popsub_args() */ |
9513529b | 2753 | AV* av = MUTABLE_AV(PAD_SVl(0)); |
e2657e18 DM |
2754 | assert(AvARRAY(MUTABLE_AV( |
2755 | PadlistARRAY(CvPADLIST(cx->blk_sub.cv))[ | |
2756 | CvDEPTH(cx->blk_sub.cv)])) == PL_curpad); | |
2757 | ||
f72bdec3 DM |
2758 | /* we are going to donate the current @_ from the old sub |
2759 | * to the new sub. This first part of the donation puts a | |
2760 | * new empty AV in the pad[0] slot of the old sub, | |
2761 | * unless pad[0] and @_ differ (e.g. if the old sub did | |
2762 | * local *_ = []); in which case clear the old pad[0] | |
2763 | * array in the usual way */ | |
95b2f486 DM |
2764 | if (av == arg || AvREAL(av)) |
2765 | clear_defarray(av, av == arg); | |
049bd5ff | 2766 | else CLEAR_ARGARRAY(av); |
a0d0e21e | 2767 | } |
88c11d84 | 2768 | |
b1e25d05 DM |
2769 | /* don't restore PL_comppad here. It won't be needed if the |
2770 | * sub we're going to is non-XS, but restoring it early then | |
2771 | * croaking (e.g. the "Goto undefined subroutine" below) | |
2772 | * means the CX block gets processed again in dounwind, | |
2773 | * but this time with the wrong PL_comppad */ | |
88c11d84 | 2774 | |
1d59c038 FC |
2775 | /* A destructor called during LEAVE_SCOPE could have undefined |
2776 | * our precious cv. See bug #99850. */ | |
2777 | if (!CvROOT(cv) && !CvXSUB(cv)) { | |
2778 | const GV * const gv = CvGV(cv); | |
2779 | if (gv) { | |
2780 | SV * const tmpstr = sv_newmortal(); | |
2781 | gv_efullname3(tmpstr, gv, NULL); | |
2782 | DIE(aTHX_ "Goto undefined subroutine &%"SVf"", | |
2783 | SVfARG(tmpstr)); | |
2784 | } | |
2785 | DIE(aTHX_ "Goto undefined subroutine"); | |
2786 | } | |
2787 | ||
cd17cc2e DM |
2788 | if (CxTYPE(cx) == CXt_SUB) { |
2789 | CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth; | |
2790 | SvREFCNT_dec_NN(cx->blk_sub.cv); | |
2791 | } | |
2792 | ||
a0d0e21e | 2793 | /* Now do some callish stuff. */ |
aed2304a | 2794 | if (CvISXSUB(cv)) { |
ad39f3a2 | 2795 | const SSize_t items = arg ? AvFILL(arg) + 1 : 0; |
cd313eb4 | 2796 | const bool m = arg ? cBOOL(SvRMAGICAL(arg)) : 0; |
049bd5ff FC |
2797 | SV** mark; |
2798 | ||
8ae997c5 | 2799 | ENTER; |
80774f05 DM |
2800 | SAVETMPS; |
2801 | SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */ | |
2802 | ||
049bd5ff | 2803 | /* put GvAV(defgv) back onto stack */ |
8c9d3376 FC |
2804 | if (items) { |
2805 | EXTEND(SP, items+1); /* @_ could have been extended. */ | |
8c9d3376 | 2806 | } |
049bd5ff | 2807 | mark = SP; |
ad39f3a2 | 2808 | if (items) { |
de935cc9 | 2809 | SSize_t index; |
ad39f3a2 | 2810 | bool r = cBOOL(AvREAL(arg)); |
b1464ded | 2811 | for (index=0; index<items; index++) |
ad39f3a2 FC |
2812 | { |
2813 | SV *sv; | |
2814 | if (m) { | |
2815 | SV ** const svp = av_fetch(arg, index, 0); | |
2816 | sv = svp ? *svp : NULL; | |
dd2a7f90 | 2817 | } |
ad39f3a2 FC |
2818 | else sv = AvARRAY(arg)[index]; |
2819 | SP[index+1] = sv | |
2820 | ? r ? SvREFCNT_inc_NN(sv_2mortal(sv)) : sv | |
2821 | : sv_2mortal(newSVavdefelem(arg, index, 1)); | |
2822 | } | |
049bd5ff | 2823 | } |
ad39f3a2 | 2824 | SP += items; |
049bd5ff FC |
2825 | if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) { |
2826 | /* Restore old @_ */ | |
b405d38b | 2827 | CX_POP_SAVEARRAY(cx); |
b1464ded | 2828 | } |
1fa4e549 | 2829 | |
51eb35b5 | 2830 | retop = cx->blk_sub.retop; |
b1e25d05 DM |
2831 | PL_comppad = cx->blk_sub.prevcomppad; |
2832 | PL_curpad = LIKELY(PL_comppad) ? AvARRAY(PL_comppad) : NULL; | |
8ae997c5 DM |
2833 | |
2834 | /* XS subs don't have a CXt_SUB, so pop it; | |
ed8ff0f3 DM |
2835 | * this is a cx_popblock(), less all the stuff we already did |
2836 | * for cx_topblock() earlier */ | |
8ae997c5 | 2837 | PL_curcop = cx->blk_oldcop; |
5da525e9 | 2838 | CX_POP(cx); |
8ae997c5 | 2839 | |
b37c2d43 AL |
2840 | /* Push a mark for the start of arglist */ |
2841 | PUSHMARK(mark); | |
2842 | PUTBACK; | |
2843 | (void)(*CvXSUB(cv))(aTHX_ cv); | |
a57c6685 | 2844 | LEAVE; |
51eb35b5 | 2845 | goto _return; |
a0d0e21e LW |
2846 | } |
2847 | else { | |
b70d5558 | 2848 | PADLIST * const padlist = CvPADLIST(cv); |
39de75fd | 2849 | |
80774f05 DM |
2850 | SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */ |
2851 | ||
a73d8813 | 2852 | /* partial unrolled cx_pushsub(): */ |
39de75fd | 2853 | |
a0d0e21e | 2854 | cx->blk_sub.cv = cv; |
1a5b3db4 | 2855 | cx->blk_sub.olddepth = CvDEPTH(cv); |
dd2155a4 | 2856 | |
a0d0e21e | 2857 | CvDEPTH(cv)++; |
2c50b7ed DM |
2858 | SvREFCNT_inc_simple_void_NN(cv); |
2859 | if (CvDEPTH(cv) > 1) { | |
2b9dff67 | 2860 | if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION)) |
44a8e56a | 2861 | sub_crush_depth(cv); |
26019298 | 2862 | pad_push(padlist, CvDEPTH(cv)); |
a0d0e21e | 2863 | } |
426a09cd | 2864 | PL_curcop = cx->blk_oldcop; |
fd617465 | 2865 | PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv)); |
bafb2adc | 2866 | if (CxHASARGS(cx)) |
6d4ff0d2 | 2867 | { |
f72bdec3 DM |
2868 | /* second half of donating @_ from the old sub to the |
2869 | * new sub: abandon the original pad[0] AV in the | |
2870 | * new sub, and replace it with the donated @_. | |
2871 | * pad[0] takes ownership of the extra refcount | |
2872 | * we gave arg earlier */ | |
bfa371b6 FC |
2873 | if (arg) { |
2874 | SvREFCNT_dec(PAD_SVl(0)); | |
fed4514a | 2875 | PAD_SVl(0) = (SV *)arg; |
13122036 | 2876 | SvREFCNT_inc_simple_void_NN(arg); |
bfa371b6 | 2877 | } |
049bd5ff FC |
2878 | |
2879 | /* GvAV(PL_defgv) might have been modified on scope | |
f72bdec3 | 2880 | exit, so point it at arg again. */ |
049bd5ff FC |
2881 | if (arg != GvAV(PL_defgv)) { |
2882 | AV * const av = GvAV(PL_defgv); | |
2883 | GvAV(PL_defgv) = (AV *)SvREFCNT_inc_simple(arg); | |
2884 | SvREFCNT_dec(av); | |
a0d0e21e LW |
2885 | } |
2886 | } | |
13122036 | 2887 | |
491527d0 | 2888 | if (PERLDB_SUB) { /* Checking curstash breaks DProf. */ |
005a8a35 | 2889 | Perl_get_db_sub(aTHX_ NULL, cv); |
b37c2d43 | 2890 | if (PERLDB_GOTO) { |
b96d8cd9 | 2891 | CV * const gotocv = get_cvs("DB::goto", 0); |
b37c2d43 AL |
2892 | if (gotocv) { |
2893 | PUSHMARK( PL_stack_sp ); | |
ad64d0ec | 2894 | call_sv(MUTABLE_SV(gotocv), G_SCALAR | G_NODEBUG); |
b37c2d43 AL |
2895 | PL_stack_sp--; |
2896 | } | |
491527d0 | 2897 | } |
1ce6579f | 2898 | } |
51eb35b5 DD |
2899 | retop = CvSTART(cv); |
2900 | goto putback_return; | |
a0d0e21e LW |
2901 | } |
2902 | } | |
1614b0e3 | 2903 | else { |
7d1d69cb | 2904 | /* goto EXPR */ |
55b37f1c | 2905 | label = SvPV_nomg_const(sv, label_len); |
5db1eb8d | 2906 | label_flags = SvUTF8(sv); |
1614b0e3 | 2907 | } |
a0d0e21e | 2908 | } |
2fc690dc | 2909 | else if (!(PL_op->op_flags & OPf_SPECIAL)) { |
7d1d69cb | 2910 | /* goto LABEL or dump LABEL */ |
5db1eb8d BF |
2911 | label = cPVOP->op_pv; |
2912 | label_flags = (cPVOP->op_private & OPpPV_IS_UTF8) ? SVf_UTF8 : 0; | |
2913 | label_len = strlen(label); | |
2914 | } | |
0157ef98 | 2915 | if (!(do_dump || label_len)) DIE(aTHX_ "%s", must_have_label); |
a0d0e21e | 2916 | |
f410a211 NC |
2917 | PERL_ASYNC_CHECK(); |
2918 | ||
3532f34a | 2919 | if (label_len) { |
cbbf8932 | 2920 | OP *gotoprobe = NULL; |
3b2447bc | 2921 | bool leaving_eval = FALSE; |
33d34e4c | 2922 | bool in_block = FALSE; |
cbbf8932 | 2923 | PERL_CONTEXT *last_eval_cx = NULL; |
a0d0e21e LW |
2924 | |
2925 | /* find label */ | |
2926 | ||
d4c19fe8 | 2927 | PL_lastgotoprobe = NULL; |
a0d0e21e LW |
2928 | *enterops = 0; |
2929 | for (ix = cxstack_ix; ix >= 0; ix--) { | |
2930 | cx = &cxstack[ix]; | |
6b35e009 | 2931 | switch (CxTYPE(cx)) { |
a0d0e21e | 2932 | case CXt_EVAL: |
3b2447bc | 2933 | leaving_eval = TRUE; |
971ecbe6 | 2934 | if (!CxTRYBLOCK(cx)) { |
a4f3a277 RH |
2935 | gotoprobe = (last_eval_cx ? |
2936 | last_eval_cx->blk_eval.old_eval_root : | |
2937 | PL_eval_root); | |
2938 | last_eval_cx = cx; | |
9c5794fe RH |
2939 | break; |
2940 | } | |
2941 | /* else fall through */ | |
93661e56 DM |
2942 | case CXt_LOOP_PLAIN: |
2943 | case CXt_LOOP_LAZYIV: | |
2944 | case CXt_LOOP_LAZYSV: | |
2945 | case CXt_LOOP_LIST: | |
2946 | case CXt_LOOP_ARY: | |
bb5aedc1 VP |
2947 | case CXt_GIVEN: |
2948 | case CXt_WHEN: | |
e6dae479 | 2949 | gotoprobe = OpSIBLING(cx->blk_oldcop); |
a0d0e21e LW |
2950 | break; |
2951 | case CXt_SUBST: | |
2952 | continue; | |
2953 | case CXt_BLOCK: | |
33d34e4c | 2954 | if (ix) { |
e6dae479 | 2955 | gotoprobe = OpSIBLING(cx->blk_oldcop); |
33d34e4c AE |
2956 | in_block = TRUE; |
2957 | } else | |
3280af22 | 2958 | gotoprobe = PL_main_root; |
a0d0e21e | 2959 | break; |
b3933176 | 2960 | case CXt_SUB: |
9850bf21 | 2961 | if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) { |
b3933176 CS |
2962 | gotoprobe = CvROOT(cx->blk_sub.cv); |
2963 | break; | |
2964 | } | |
924ba076 | 2965 | /* FALLTHROUGH */ |
7766f137 | 2966 | case CXt_FORMAT: |
0a753a76 | 2967 | case CXt_NULL: |
a651a37d | 2968 | DIE(aTHX_ "Can't \"goto\" out of a pseudo block"); |
a0d0e21e LW |
2969 | default: |
2970 | if (ix) | |
5637ef5b NC |
2971 | DIE(aTHX_ "panic: goto, type=%u, ix=%ld", |
2972 | CxTYPE(cx), (long) ix); | |
3280af22 | 2973 | gotoprobe = PL_main_root; |
a0d0e21e LW |
2974 | break; |
2975 | } | |
2b597662 | 2976 | if (gotoprobe) { |
29e61fd9 DM |
2977 | OP *sibl1, *sibl2; |
2978 | ||
5db1eb8d | 2979 | retop = dofindlabel(gotoprobe, label, label_len, label_flags, |
2b597662 GS |
2980 | enterops, enterops + GOTO_DEPTH); |
2981 | if (retop) | |
2982 | break; | |
e6dae479 | 2983 | if ( (sibl1 = OpSIBLING(gotoprobe)) && |
29e61fd9 | 2984 | sibl1->op_type == OP_UNSTACK && |
e6dae479 | 2985 | (sibl2 = OpSIBLING(sibl1))) |
29e61fd9 DM |
2986 | { |
2987 | retop = dofindlabel(sibl2, | |
5db1eb8d BF |
2988 | label, label_len, label_flags, enterops, |
2989 | enterops + GOTO_DEPTH); | |
eae48c89 Z |
2990 | if (retop) |
2991 | break; | |
2992 | } | |
2b597662 | 2993 | } |
3280af22 | 2994 | PL_lastgotoprobe = gotoprobe; |
a0d0e21e LW |
2995 | } |
2996 | if (!retop) | |
b17a0679 FC |
2997 | DIE(aTHX_ "Can't find label %"UTF8f, |
2998 | UTF8fARG(label_flags, label_len, label)); | |
a0d0e21e | 2999 | |
3b2447bc RH |
3000 | /* if we're leaving an eval, check before we pop any frames |
3001 | that we're not going to punt, otherwise the error | |
3002 | won't be caught */ | |
3003 | ||
3004 | if (leaving_eval && *enterops && enterops[1]) { | |
3005 | I32 i; | |
3006 | for (i = 1; enterops[i]; i++) | |
3007 | if (enterops[i]->op_type == OP_ENTERITER) | |
3008 | DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop"); | |
3009 | } | |
3010 | ||
b500e03b GG |
3011 | if (*enterops && enterops[1]) { |
3012 | I32 i = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1; | |
3013 | if (enterops[i]) | |
3014 | deprecate("\"goto\" to jump into a construct"); | |
3015 | } | |
3016 | ||
a0d0e21e LW |
3017 | /* pop unwanted frames */ |
3018 | ||
3019 | if (ix < cxstack_ix) { | |
a0d0e21e | 3020 | if (ix < 0) |
5edb7975 | 3021 | DIE(aTHX_ "panic: docatch: illegal ix=%ld", (long)ix); |
a0d0e21e | 3022 | dounwind(ix); |
7e637ba4 | 3023 | cx = CX_CUR(); |
ed8ff0f3 | 3024 | cx_topblock(cx); |
a0d0e21e LW |
3025 | } |
3026 | ||
3027 | /* push wanted frames */ | |
3028 | ||
748a9306 | 3029 | if (*enterops && enterops[1]) { |
0bd48802 | 3030 | OP * const oldop = PL_op; |
33d34e4c AE |
3031 | ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1; |
3032 | for (; enterops[ix]; ix++) { | |
533c011a | 3033 | PL_op = enterops[ix]; |
84902520 TB |
3034 | /* Eventually we may want to stack the needed arguments |
3035 | * for each op. For now, we punt on the hard ones. */ | |
533c011a | 3036 | if (PL_op->op_type == OP_ENTERITER) |
894356b3 | 3037 | DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop"); |
16c91539 | 3038 | PL_op->op_ppaddr(aTHX); |
a0d0e21e | 3039 | } |
533c011a | 3040 | PL_op = oldop; |
a0d0e21e LW |
3041 | } |
3042 | } | |
3043 | ||
2631bbca | 3044 | if (do_dump) { |
a5f75d66 | 3045 | #ifdef VMS |
6b88bc9c | 3046 | if (!retop) retop = PL_main_start; |
a5f75d66 | 3047 | #endif |
3280af22 NIS |
3048 | PL_restartop = retop; |
3049 | PL_do_undump = TRUE; | |
a0d0e21e LW |
3050 | |
3051 | my_unexec(); | |
3052 | ||
3280af22 NIS |
3053 | PL_restartop = 0; /* hmm, must be GNU unexec().. */ |
3054 | PL_do_undump = FALSE; | |
a0d0e21e LW |
3055 | } |
3056 | ||
51eb35b5 DD |
3057 | putback_return: |
3058 | PL_stack_sp = sp; | |
3059 | _return: | |
47c9d59f | 3060 | PERL_ASYNC_CHECK(); |
51eb35b5 | 3061 | return retop; |
a0d0e21e LW |
3062 | } |
3063 | ||
3064 | PP(pp_exit) | |
3065 | { | |
39644a26 | 3066 | dSP; |
a0d0e21e LW |
3067 | I32 anum; |
3068 | ||
3069 | if (MAXARG < 1) | |
3070 | anum = 0; | |
9d3c658e FC |
3071 | else if (!TOPs) { |
3072 | anum = 0; (void)POPs; | |
3073 | } | |
ff0cee69 | 3074 | else { |
a0d0e21e | 3075 | anum = SvIVx(POPs); |
d98f61e7 | 3076 | #ifdef VMS |
5450b4d8 FC |
3077 | if (anum == 1 |
3078 | && SvTRUE(cop_hints_fetch_pvs(PL_curcop, "vmsish_exit", 0))) | |
ff0cee69 | 3079 | anum = 0; |
97124ef6 FC |
3080 | VMSISH_HUSHED = |
3081 | VMSISH_HUSHED || (PL_curcop->op_private & OPpHUSH_VMSISH); | |
ff0cee69 | 3082 | #endif |
3083 | } | |
cc3604b1 | 3084 | PL_exit_flags |= PERL_EXIT_EXPECTED; |
a0d0e21e | 3085 | my_exit(anum); |
3280af22 | 3086 | PUSHs(&PL_sv_undef); |
a0d0e21e LW |
3087 | RETURN; |
3088 | } | |
3089 | ||
a0d0e21e LW |
3090 | /* Eval. */ |
3091 | ||
0824fdcb | 3092 | STATIC void |
cea2e8a9 | 3093 | S_save_lines(pTHX_ AV *array, SV *sv) |
a0d0e21e | 3094 | { |
504618e9 | 3095 | const char *s = SvPVX_const(sv); |
890ce7af | 3096 | const char * const send = SvPVX_const(sv) + SvCUR(sv); |
504618e9 | 3097 | I32 line = 1; |
a0d0e21e | 3098 | |
7918f24d NC |
3099 | PERL_ARGS_ASSERT_SAVE_LINES; |
3100 | ||
a0d0e21e | 3101 | while (s && s < send) { |
f54cb97a | 3102 | const char *t; |
b9f83d2f | 3103 | SV * const tmpstr = newSV_type(SVt_PVMG); |
a0d0e21e | 3104 | |
1d963ff3 | 3105 | t = (const char *)memchr(s, '\n', send - s); |
a0d0e21e LW |
3106 | if (t) |
3107 | t++; | |
3108 | else | |
3109 | t = send; | |
3110 | ||
3111 | sv_setpvn(tmpstr, s, t - s); | |
3112 | av_store(array, line++, tmpstr); | |
3113 | s = t; | |
3114 | } | |
3115 | } | |
3116 | ||
22f16304 RU |
3117 | /* |
3118 | =for apidoc docatch | |
3119 | ||
3120 | Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context. | |
3121 | ||
3122 | 0 is used as continue inside eval, | |
3123 | ||
3124 | 3 is used for a die caught by an inner eval - continue inner loop | |
3125 | ||
75af9d73 | 3126 | See F<cop.h>: je_mustcatch, when set at any runlevel to TRUE, means eval ops must |
22f16304 RU |
3127 | establish a local jmpenv to handle exception traps. |
3128 | ||
3129 | =cut | |
3130 | */ | |
0824fdcb | 3131 | STATIC OP * |
cea2e8a9 | 3132 | S_docatch(pTHX_ OP *o) |
1e422769 | 3133 | { |
6224f72b | 3134 | int ret; |
06b5626a | 3135 | OP * const oldop = PL_op; |
db36c5a1 | 3136 | dJMPENV; |
1e422769 | 3137 | |
1e422769 | 3138 | #ifdef DEBUGGING |
54310121 | 3139 | assert(CATCH_GET == TRUE); |
1e422769 | 3140 | #endif |
312caa8e | 3141 | PL_op = o; |
8bffa5f8 | 3142 | |
14dd3ad8 | 3143 | JMPENV_PUSH(ret); |
6224f72b | 3144 | switch (ret) { |
312caa8e | 3145 | case 0: |
abd70938 | 3146 | assert(cxstack_ix >= 0); |
4ebe6e95 DM |
3147 | assert(CxTYPE(CX_CUR()) == CXt_EVAL); |
3148 | CX_CUR()->blk_eval.cur_top_env = PL_top_env; | |
14dd3ad8 | 3149 | redo_body: |
85aaa934 | 3150 | CALLRUNOPS(aTHX); |
312caa8e CS |
3151 | break; |
3152 | case 3: | |
8bffa5f8 | 3153 | /* die caught by an inner eval - continue inner loop */ |
febb3a6d Z |
3154 | if (PL_restartop && PL_restartjmpenv == PL_top_env) { |
3155 | PL_restartjmpenv = NULL; | |
312caa8e CS |
3156 | PL_op = PL_restartop; |
3157 | PL_restartop = 0; | |
3158 | goto redo_body; | |
3159 | } | |
924ba076 | 3160 | /* FALLTHROUGH */ |
312caa8e | 3161 | default: |
14dd3ad8 | 3162 | JMPENV_POP; |
533c011a | 3163 | PL_op = oldop; |
6224f72b | 3164 | JMPENV_JUMP(ret); |
e5964223 | 3165 | NOT_REACHED; /* NOTREACHED */ |
1e422769 | 3166 | } |
14dd3ad8 | 3167 | JMPENV_POP; |
533c011a | 3168 | PL_op = oldop; |
5f66b61c | 3169 | return NULL; |
1e422769 | 3170 | } |
3171 | ||
a3985cdc DM |
3172 | |
3173 | /* | |
3174 | =for apidoc find_runcv | |
3175 | ||
3176 | Locate the CV corresponding to the currently executing sub or eval. | |
796b6530 KW |
3177 | If C<db_seqp> is non_null, skip CVs that are in the DB package and populate |
3178 | C<*db_seqp> with the cop sequence number at the point that the DB:: code was | |
72d33970 FC |
3179 | entered. (This allows debuggers to eval in the scope of the breakpoint |
3180 | rather than in the scope of the debugger itself.) | |
a3985cdc DM |
3181 | |
3182 | =cut | |
3183 | */ | |
3184 | ||
3185 | CV* | |
d819b83a | 3186 | Perl_find_runcv(pTHX_ U32 *db_seqp) |
a3985cdc | 3187 | { |
db4cf31d | 3188 | return Perl_find_runcv_where(aTHX_ 0, 0, db_seqp); |
70794f7b FC |
3189 | } |
3190 | ||
3191 | /* If this becomes part of the API, it might need a better name. */ | |
3192 | CV * | |
db4cf31d | 3193 | Perl_find_runcv_where(pTHX_ U8 cond, IV arg, U32 *db_seqp) |
70794f7b | 3194 | { |
a3985cdc | 3195 | PERL_SI *si; |
b4b0692a | 3196 | int level = 0; |
a3985cdc | 3197 | |
d819b83a | 3198 | if (db_seqp) |
c3923c33 DM |
3199 | *db_seqp = |
3200 | PL_curcop == &PL_compiling | |
3201 | ? PL_cop_seqmax | |
3202 | : PL_curcop->cop_seq; | |
3203 | ||
a3985cdc | 3204 | for (si = PL_curstackinfo; si; si = si->si_prev) { |
06b5626a | 3205 | I32 ix; |
a3985cdc | 3206 | for (ix = si->si_cxix; ix >= 0; ix--) { |
06b5626a | 3207 | const PERL_CONTEXT *cx = &(si->si_cxstack[ix]); |
70794f7b | 3208 | CV *cv = NULL; |
d819b83a | 3209 | if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) { |
70794f7b | 3210 | cv = cx->blk_sub.cv; |
d819b83a DM |
3211 | /* skip DB:: code */ |
3212 | if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) { | |
3213 | *db_seqp = cx->blk_oldcop->cop_seq; | |
3214 | continue; | |
3215 | } | |
a453e28a DM |
3216 | if (cx->cx_type & CXp_SUB_RE) |
3217 | continue; | |
d819b83a | 3218 | } |
a3985cdc | 3219 | else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx)) |
70794f7b FC |
3220 | cv = cx->blk_eval.cv; |
3221 | if (cv) { | |
3222 | switch (cond) { | |
db4cf31d FC |
3223 | case FIND_RUNCV_padid_eq: |
3224 | if (!CvPADLIST(cv) | |
b4db5868 | 3225 | || CvPADLIST(cv)->xpadl_id != (U32)arg) |
8771da69 | 3226 | continue; |
b4b0692a FC |
3227 | return cv; |
3228 | case FIND_RUNCV_level_eq: | |
db4cf31d | 3229 | if (level++ != arg) continue; |
70794f7b FC |
3230 | /* GERONIMO! */ |
3231 | default: | |
3232 | return cv; | |
3233 | } | |
3234 | } | |
a3985cdc DM |
3235 | } |
3236 | } | |
db4cf31d | 3237 | return cond == FIND_RUNCV_padid_eq ? NULL : PL_main_cv; |
a3985cdc DM |
3238 | } |
3239 | ||
3240 | ||
27e90453 DM |
3241 | /* Run yyparse() in a setjmp wrapper. Returns: |
3242 | * 0: yyparse() successful | |
3243 | * 1: yyparse() failed | |
3244 | * 3: yyparse() died | |
3245 | */ | |
3246 | STATIC int | |
28ac2b49 | 3247 | S_try_yyparse(pTHX_ int gramtype) |
27e90453 DM |
3248 | { |
3249 | int ret; | |
3250 | dJMPENV; | |
3251 | ||
4ebe6e95 | 3252 | assert(CxTYPE(CX_CUR()) == CXt_EVAL); |
27e90453 DM |
3253 | JMPENV_PUSH(ret); |
3254 | switch (ret) { | |
3255 | case 0: | |
28ac2b49 | 3256 | ret = yyparse(gramtype) ? 1 : 0; |
27e90453 DM |
3257 | break; |
3258 | case 3: | |
3259 | break; | |
3260 | default: | |
3261 | JMPENV_POP; | |
3262 | JMPENV_JUMP(ret); | |
e5964223 | 3263 | NOT_REACHED; /* NOTREACHED */ |
27e90453 DM |
3264 | } |
3265 | JMPENV_POP; | |
3266 | return ret; | |
3267 | } | |
3268 | ||
3269 | ||
104a8185 DM |
3270 | /* Compile a require/do or an eval ''. |
3271 | * | |
a3985cdc | 3272 | * outside is the lexically enclosing CV (if any) that invoked us. |
104a8185 DM |
3273 | * seq is the current COP scope value. |
3274 | * hh is the saved hints hash, if any. | |
3275 | * | |
410be5db | 3276 | * Returns a bool indicating whether the compile was successful; if so, |
104a8185 DM |
3277 | * PL_eval_start contains the first op of the compiled code; otherwise, |
3278 | * pushes undef. | |
3279 | * | |
3280 | * This function is called from two places: pp_require and pp_entereval. | |
3281 | * These can be distinguished by whether PL_op is entereval. | |
7d116edc FC |
3282 | */ |
3283 | ||
410be5db | 3284 | STATIC bool |
1c23e2bd | 3285 | S_doeval_compile(pTHX_ U8 gimme, CV* outside, U32 seq, HV *hh) |
a0d0e21e | 3286 | { |
20b7effb | 3287 | dSP; |
46c461b5 | 3288 | OP * const saveop = PL_op; |
104a8185 | 3289 | bool clear_hints = saveop->op_type != OP_ENTEREVAL; |
f45b078d | 3290 | COP * const oldcurcop = PL_curcop; |
26c9400e | 3291 | bool in_require = (saveop->op_type == OP_REQUIRE); |
27e90453 | 3292 | int yystatus; |
676a678a | 3293 | CV *evalcv; |
a0d0e21e | 3294 | |
27e90453 | 3295 | PL_in_eval = (in_require |
6dc8a9e4 | 3296 | ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL)) |
a1941760 DM |
3297 | : (EVAL_INEVAL | |
3298 | ((PL_op->op_private & OPpEVAL_RE_REPARSING) | |
3299 | ? EVAL_RE_REPARSING : 0))); | |
a0d0e21e | 3300 | |
1ce6579f | 3301 | PUSHMARK(SP); |
3302 | ||
676a678a Z |
3303 | evalcv = MUTABLE_CV(newSV_type(SVt_PVCV)); |
3304 | CvEVAL_on(evalcv); | |
4ebe6e95 DM |
3305 | assert(CxTYPE(CX_CUR()) == CXt_EVAL); |
3306 | CX_CUR()->blk_eval.cv = evalcv; | |
3307 | CX_CUR()->blk_gimme = gimme; | |
2090ab20 | 3308 | |
676a678a Z |
3309 | CvOUTSIDE_SEQ(evalcv) = seq; |
3310 | CvOUTSIDE(evalcv) = MUTABLE_CV(SvREFCNT_inc_simple(outside)); | |
a3985cdc | 3311 | |
dd2155a4 | 3312 | /* set up a scratch pad */ |
a0d0e21e | 3313 | |
eacbb379 | 3314 | CvPADLIST_set(evalcv, pad_new(padnew_SAVE)); |
cecbe010 | 3315 | PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */ |
2c05e328 | 3316 | |
07055b4c | 3317 | |
b5bbe64a | 3318 | SAVEMORTALIZESV(evalcv); /* must remain until end of current statement */ |
748a9306 | 3319 | |
a0d0e21e LW |
3320 | /* make sure we compile in the right package */ |
3321 | ||
ed094faf | 3322 | if (CopSTASH_ne(PL_curcop, PL_curstash)) { |
03d9f026 | 3323 | SAVEGENERICSV(PL_curstash); |
cb1ad50e FC |
3324 | PL_curstash = (HV *)CopSTASH(PL_curcop); |
3325 | if (SvTYPE(PL_curstash) != SVt_PVHV) PL_curstash = NULL; | |
3326 | else SvREFCNT_inc_simple_void(PL_curstash); | |
a0d0e21e | 3327 | } |
3c10abe3 | 3328 | /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */ |
3280af22 NIS |
3329 | SAVESPTR(PL_beginav); |
3330 | PL_beginav = newAV(); | |
3331 | SAVEFREESV(PL_beginav); | |
3c10abe3 AG |
3332 | SAVESPTR(PL_unitcheckav); |
3333 | PL_unitcheckav = newAV(); | |
3334 | SAVEFREESV(PL_unitcheckav); | |
a0d0e21e | 3335 | |
81d86705 | 3336 | |
104a8185 | 3337 | ENTER_with_name("evalcomp"); |
676a678a Z |
3338 | SAVESPTR(PL_compcv); |
3339 | PL_compcv = evalcv; | |
3340 | ||
a0d0e21e LW |
3341 | /* try to compile it */ |
3342 | ||
5f66b61c | 3343 | PL_eval_root = NULL; |
3280af22 | 3344 | PL_curcop = &PL_compiling; |
26c9400e | 3345 | if ((saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL)) |
faef0170 | 3346 | PL_in_eval |= EVAL_KEEPERR; |
ab69dbc2 RGS |
3347 | else |
3348 | CLEAR_ERRSV(); | |
27e90453 | 3349 | |
377b5421 DM |
3350 | SAVEHINTS(); |
3351 | if (clear_hints) { | |
3352 | PL_hints = 0; | |
3353 | hv_clear(GvHV(PL_hintgv)); | |
3354 | } | |
3355 | else { | |
3356 | PL_hints = saveop->op_private & OPpEVAL_COPHH | |
3357 | ? oldcurcop->cop_hints : saveop->op_targ; | |
4f3e2518 DM |
3358 | |
3359 | /* making 'use re eval' not be in scope when compiling the | |
3360 | * qr/mabye_has_runtime_code_block/ ensures that we don't get | |
3361 | * infinite recursion when S_has_runtime_code() gives a false | |
3362 | * positive: the second time round, HINT_RE_EVAL isn't set so we | |
3363 | * don't bother calling S_has_runtime_code() */ | |
3364 | if (PL_in_eval & EVAL_RE_REPARSING) | |
3365 | PL_hints &= ~HINT_RE_EVAL; | |
3366 | ||
377b5421 DM |
3367 | if (hh) { |
3368 | /* SAVEHINTS created a new HV in PL_hintgv, which we need to GC */ | |
3369 | SvREFCNT_dec(GvHV(PL_hintgv)); | |
3370 | GvHV(PL_hintgv) = hh; | |
3371 | } | |
3372 | } | |
3373 | SAVECOMPILEWARNINGS(); | |
3374 | if (clear_hints) { | |
3375 | if (PL_dowarn & G_WARN_ALL_ON) | |
3376 | PL_compiling.cop_warnings = pWARN_ALL ; | |
3377 | else if (PL_dowarn & G_WARN_ALL_OFF) | |
3378 | PL_compiling.cop_warnings = pWARN_NONE ; | |
3379 | else | |
3380 | PL_compiling.cop_warnings = pWARN_STD ; | |
3381 | } | |
3382 | else { | |
3383 | PL_compiling.cop_warnings = | |
3384 | DUP_WARNINGS(oldcurcop->cop_warnings); | |
3385 | cophh_free(CopHINTHASH_get(&PL_compiling)); | |
3386 | if (Perl_cop_fetch_label(aTHX_ oldcurcop, NULL, NULL)) { | |
3387 | /* The label, if present, is the first entry on the chain. So rather | |
3388 | than writing a blank label in front of it (which involves an | |
3389 | allocation), just use the next entry in the chain. */ | |
3390 | PL_compiling.cop_hints_hash | |
3391 | = cophh_copy(oldcurcop->cop_hints_hash->refcounted_he_next); | |
3392 | /* Check the assumption that this removed the label. */ | |
3393 | assert(Perl_cop_fetch_label(aTHX_ &PL_compiling, NULL, NULL) == NULL); | |
f45b078d | 3394 | } |
377b5421 DM |
3395 | else |
3396 | PL_compiling.cop_hints_hash = cophh_copy(oldcurcop->cop_hints_hash); | |
3397 | } | |
f45b078d | 3398 | |
a88d97bf | 3399 | CALL_BLOCK_HOOKS(bhk_eval, saveop); |
52db365a | 3400 | |
27e90453 DM |
3401 | /* note that yyparse() may raise an exception, e.g. C<BEGIN{die}>, |
3402 | * so honour CATCH_GET and trap it here if necessary */ | |
3403 | ||
fc69996c DM |
3404 | |
3405 | /* compile the code */ | |
28ac2b49 | 3406 | yystatus = (!in_require && CATCH_GET) ? S_try_yyparse(aTHX_ GRAMPROG) : yyparse(GRAMPROG); |
27e90453 DM |
3407 | |
3408 | if (yystatus || PL_parser->error_count || !PL_eval_root) { | |
d164302a | 3409 | PERL_CONTEXT *cx; |
d308a779 | 3410 | SV *errsv; |
bfed75c6 | 3411 | |
d308a779 | 3412 | PL_op = saveop; |
fc69996c DM |
3413 | /* note that if yystatus == 3, then the require/eval died during |
3414 | * compilation, so the EVAL CX block has already been popped, and | |
3415 | * various vars restored */ | |
27e90453 | 3416 | if (yystatus != 3) { |
c86ffc32 DM |
3417 | if (PL_eval_root) { |
3418 | op_free(PL_eval_root); | |
3419 | PL_eval_root = NULL; | |
3420 | } | |
27e90453 | 3421 | SP = PL_stack_base + POPMARK; /* pop original mark */ |
4ebe6e95 | 3422 | cx = CX_CUR(); |
06a7bc17 DM |
3423 | assert(CxTYPE(cx) == CXt_EVAL); |
3424 | /* pop the CXt_EVAL, and if was a require, croak */ | |
3425 | S_pop_eval_context_maybe_croak(aTHX_ cx, ERRSV, 2); | |
9d7f88dd | 3426 | } |
d308a779 | 3427 | |
03e81cd3 DM |
3428 | /* die_unwind() re-croaks when in require, having popped the |
3429 | * require EVAL context. So we should never catch a require | |
3430 | * exception here */ | |
3431 | assert(!in_require); | |
3432 | ||
3433 | errsv = ERRSV; | |
d308a779 DM |
3434 | if (!*(SvPV_nolen_const(errsv))) |
3435 | sv_setpvs(errsv, "Compilation error"); | |
3436 | ||
2bf54cc6 | 3437 | if (gimme != G_ARRAY) PUSHs(&PL_sv_undef); |
410be5db DM |
3438 | PUTBACK; |
3439 | return FALSE; | |
a0d0e21e | 3440 | } |
fc69996c DM |
3441 | |
3442 | /* Compilation successful. Now clean up */ | |
3443 | ||
3444 | LEAVE_with_name("evalcomp"); | |
104a8185 | 3445 | |
57843af0 | 3446 | CopLINE_set(&PL_compiling, 0); |
104a8185 | 3447 | SAVEFREEOP(PL_eval_root); |
8be227ab | 3448 | cv_forget_slab(evalcv); |
0c58d367 | 3449 | |
a0d0e21e LW |
3450 | DEBUG_x(dump_eval()); |
3451 | ||
55497cff | 3452 | /* Register with debugger: */ |
26c9400e | 3453 | if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) { |
b96d8cd9 | 3454 | CV * const cv = get_cvs("DB::postponed", 0); |
55497cff | 3455 | if (cv) { |
3456 | dSP; | |
924508f0 | 3457 | PUSHMARK(SP); |
ad64d0ec | 3458 | XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling))); |
55497cff | 3459 | PUTBACK; |
ad64d0ec | 3460 | call_sv(MUTABLE_SV(cv), G_DISCARD); |
55497cff | 3461 | } |
3462 | } | |
3463 | ||
8ed49485 FC |
3464 | if (PL_unitcheckav) { |
3465 | OP *es = PL_eval_start; | |
3c10abe3 | 3466 | call_list(PL_scopestack_ix, PL_unitcheckav); |
8ed49485 FC |
3467 | PL_eval_start = es; |
3468 | } | |
3c10abe3 | 3469 | |
676a678a | 3470 | CvDEPTH(evalcv) = 1; |
3280af22 | 3471 | SP = PL_stack_base + POPMARK; /* pop original mark */ |
533c011a | 3472 | PL_op = saveop; /* The caller may need it. */ |
bc177e6b | 3473 | PL_parser->lex_state = LEX_NOTPARSING; /* $^S needs this. */ |
5dc0d613 | 3474 | |
410be5db DM |
3475 | PUTBACK; |
3476 | return TRUE; | |
a0d0e21e LW |
3477 | } |
3478 | ||
fc69996c | 3479 | |
a6c40364 | 3480 | STATIC PerlIO * |
282b29ee | 3481 | S_check_type_and_open(pTHX_ SV *name) |
ce8abf5f SP |
3482 | { |
3483 | Stat_t st; | |
41188aa0 | 3484 | STRLEN len; |
d345f487 | 3485 | PerlIO * retio; |
41188aa0 | 3486 | const char *p = SvPV_const(name, len); |
c8028aa6 | 3487 | int st_rc; |
df528165 | 3488 | |
7918f24d NC |
3489 | PERL_ARGS_ASSERT_CHECK_TYPE_AND_OPEN; |
3490 | ||
c8028aa6 TC |
3491 | /* checking here captures a reasonable error message when |
3492 | * PERL_DISABLE_PMC is true, but when PMC checks are enabled, the | |
3493 | * user gets a confusing message about looking for the .pmc file | |
1e777496 DD |
3494 | * rather than for the .pm file so do the check in S_doopen_pm when |
3495 | * PMC is on instead of here. S_doopen_pm calls this func. | |
c8028aa6 TC |
3496 | * This check prevents a \0 in @INC causing problems. |
3497 | */ | |
1e777496 | 3498 | #ifdef PERL_DISABLE_PMC |
41188aa0 | 3499 | if (!IS_SAFE_PATHNAME(p, len, "require")) |
c8028aa6 | 3500 | return NULL; |
1e777496 | 3501 | #endif |
c8028aa6 | 3502 | |
d345f487 DD |
3503 | /* on Win32 stat is expensive (it does an open() and close() twice and |
3504 | a couple other IO calls), the open will fail with a dir on its own with | |
3505 | errno EACCES, so only do a stat to separate a dir from a real EACCES | |
3506 | caused by user perms */ | |
3507 | #ifndef WIN32 | |
b2da7ead DM |
3508 | /* we use the value of errno later to see how stat() or open() failed. |
3509 | * We don't want it set if the stat succeeded but we still failed, | |
3510 | * such as if the name exists, but is a directory */ | |
3511 | errno = 0; | |
3512 | ||
c8028aa6 TC |
3513 | st_rc = PerlLIO_stat(p, &st); |
3514 | ||
6b845e56 | 3515 | if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) { |
4608196e | 3516 | return NULL; |
ce8abf5f | 3517 | } |
d345f487 | 3518 | #endif |
ce8abf5f | 3519 | |
d345f487 | 3520 | retio = PerlIO_openn(aTHX_ ":", PERL_SCRIPT_MODE, -1, 0, 0, NULL, 1, &name); |
d345f487 DD |
3521 | #ifdef WIN32 |
3522 | /* EACCES stops the INC search early in pp_require to implement | |
3523 | feature RT #113422 */ | |
3524 | if(!retio && errno == EACCES) { /* exists but probably a directory */ | |
3525 | int eno; | |
3526 | st_rc = PerlLIO_stat(p, &st); | |
3527 | if (st_rc >= 0) { | |
3528 | if(S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) | |
3529 | eno = 0; | |
3530 | else | |
3531 | eno = EACCES; | |
3532 | errno = eno; | |
3533 | } | |
3534 | } | |
ccb84406 | 3535 | #endif |
d345f487 | 3536 | return retio; |
ce8abf5f SP |
3537 | } |
3538 | ||
75c20bac | 3539 | #ifndef PERL_DISABLE_PMC |
ce8abf5f | 3540 | STATIC PerlIO * |
282b29ee | 3541 | S_doopen_pm(pTHX_ SV *name) |
b295d113 | 3542 | { |
282b29ee NC |
3543 | STRLEN namelen; |
3544 | const char *p = SvPV_const(name, namelen); | |
b295d113 | 3545 | |
7918f24d NC |
3546 | PERL_ARGS_ASSERT_DOOPEN_PM; |
3547 | ||
c8028aa6 TC |
3548 | /* check the name before trying for the .pmc name to avoid the |
3549 | * warning referring to the .pmc which the user probably doesn't | |
3550 | * know or care about | |
3551 | */ | |
41188aa0 | 3552 | if (!IS_SAFE_PATHNAME(p, namelen, "require")) |
c8028aa6 TC |
3553 | return NULL; |
3554 | ||
282b29ee | 3555 | if (namelen > 3 && memEQs(p + namelen - 3, 3, ".pm")) { |
eb70bb4a | 3556 | SV *const pmcsv = sv_newmortal(); |
1e777496 | 3557 | PerlIO * pmcio; |
50b8ed39 | 3558 | |
eb70bb4a | 3559 | SvSetSV_nosteal(pmcsv,name); |
46e2868e | 3560 | sv_catpvs(pmcsv, "c"); |
50b8ed39 | 3561 | |
1e777496 DD |
3562 | pmcio = check_type_and_open(pmcsv); |
3563 | if (pmcio) | |
3564 | return pmcio; | |
a6c40364 | 3565 | } |
282b29ee | 3566 | return check_type_and_open(name); |
75c20bac | 3567 | } |
7925835c | 3568 | #else |
282b29ee | 3569 | # define doopen_pm(name) check_type_and_open(name) |
7925835c | 3570 | #endif /* !PERL_DISABLE_PMC */ |
b295d113 | 3571 | |
511712dc | 3572 | /* require doesn't search for absolute names, or when the name is |
f6bab5f6 | 3573 | explicitly relative the current directory */ |
511712dc TC |
3574 | PERL_STATIC_INLINE bool |
3575 | S_path_is_searchable(const char *name) | |
3576 | { | |
3577 | PERL_ARGS_ASSERT_PATH_IS_SEARCHABLE; | |
3578 | ||
3579 | if (PERL_FILE_IS_ABSOLUTE(name) | |
3580 | #ifdef WIN32 | |
3581 | || (*name == '.' && ((name[1] == '/' || | |
3582 | (name[1] == '.' && name[2] == '/')) | |
3583 | || (name[1] == '\\' || | |
3584 | ( name[1] == '.' && name[2] == '\\'))) | |
3585 | ) | |
3586 | #else | |
3587 | || (*name == '.' && (name[1] == '/' || | |
3588 | (name[1] == '.' && name[2] == '/'))) | |
3589 | #endif | |
3590 | ) | |
3591 | { | |
3592 | return FALSE; | |
3593 | } | |
3594 | else | |
3595 | return TRUE; | |
3596 | } | |
3597 | ||
b1c05ba5 | 3598 | |
5fb41388 | 3599 | /* implement 'require 5.010001' */ |
b1c05ba5 | 3600 | |
5fb41388 DM |
3601 | static OP * |
3602 | S_require_version(pTHX_ SV *sv) | |
a0d0e21e | 3603 | { |
5fb41388 | 3604 | dVAR; dSP; |
a0d0e21e | 3605 | |
9cdec136 DM |
3606 | sv = sv_2mortal(new_version(sv)); |
3607 | if (!Perl_sv_derived_from_pvn(aTHX_ PL_patchlevel, STR_WITH_LEN("version"), 0)) | |
3608 | upg_version(PL_patchlevel, TRUE); | |
3609 | if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) { | |
3610 | if ( vcmp(sv,PL_patchlevel) <= 0 ) | |
3611 | DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped", | |
3612 | SVfARG(sv_2mortal(vnormal(sv))), | |
3613 | SVfARG(sv_2mortal(vnormal(PL_patchlevel))) | |
3614 | ); | |
3615 | } | |
3616 | else { | |
3617 | if ( vcmp(sv,PL_patchlevel) > 0 ) { | |
3618 | I32 first = 0; | |
3619 | AV *lav; | |
3620 | SV * const req = SvRV(sv); | |
3621 | SV * const pv = *hv_fetchs(MUTABLE_HV(req), "original", FALSE); | |
3622 | ||
3623 | /* get the left hand term */ | |
3624 | lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(req), "version", FALSE))); | |
3625 | ||
3626 | first = SvIV(*av_fetch(lav,0,0)); | |
3627 | if ( first > (int)PERL_REVISION /* probably 'use 6.0' */ | |
3628 | || hv_exists(MUTABLE_HV(req), "qv", 2 ) /* qv style */ | |
3629 | || av_tindex(lav) > 1 /* FP with > 3 digits */ | |
3630 | || strstr(SvPVX(pv),".0") /* FP with leading 0 */ | |
3631 | ) { | |
3632 | DIE(aTHX_ "Perl %"SVf" required--this is only " | |
3633 | "%"SVf", stopped", | |
3634 | SVfARG(sv_2mortal(vnormal(req))), | |
3635 | SVfARG(sv_2mortal(vnormal(PL_patchlevel))) | |
3636 | ); | |
3637 | } | |
3638 | else { /* probably 'use 5.10' or 'use 5.8' */ | |
3639 | SV *hintsv; | |
3640 | I32 second = 0; | |
3641 | ||
3642 | if (av_tindex(lav)>=1) | |
3643 | second = SvIV(*av_fetch(lav,1,0)); | |
3644 | ||
3645 | second /= second >= 600 ? 100 : 10; | |
3646 | hintsv = Perl_newSVpvf(aTHX_ "v%d.%d.0", | |
3647 | (int)first, (int)second); | |
3648 | upg_version(hintsv, TRUE); | |
3649 | ||
3650 | DIE(aTHX_ "Perl %"SVf" required (did you mean %"SVf"?)" | |
3651 | "--this is only %"SVf", stopped", | |
3652 | SVfARG(sv_2mortal(vnormal(req))), | |
3653 | SVfARG(sv_2mortal(vnormal(sv_2mortal(hintsv)))), | |
3654 | SVfARG(sv_2mortal(vnormal(PL_patchlevel))) | |
3655 | ); | |
3656 | } | |
3657 | } | |
3658 | } | |
d7aa5382 | 3659 | |
9cdec136 | 3660 | RETPUSHYES; |
5fb41388 DM |
3661 | } |
3662 | ||
3663 | /* Handle C<require Foo::Bar>, C<require "Foo/Bar.pm"> and C<do "Foo.pm">. | |
3664 | * The first form will have already been converted at compile time to | |
3665 | * the second form */ | |
3666 | ||
3667 | static OP * | |
3668 | S_require_file(pTHX_ SV *const sv) | |
3669 | { | |
3670 | dVAR; dSP; | |
3671 | ||
3672 | PERL_CONTEXT *cx; | |
3673 | const char *name; | |
3674 | STRLEN len; | |
3675 | char * unixname; | |
3676 | STRLEN unixlen; | |
3677 | #ifdef VMS | |
3678 | int vms_unixname = 0; | |
3679 | char *unixdir; | |
3680 | #endif | |
3681 | const char *tryname = NULL; | |
3682 | SV *namesv = NULL; | |
3683 | const U8 gimme = GIMME_V; | |
3684 | int filter_has_file = 0; | |
3685 | PerlIO *tryrsfp = NULL; | |
3686 | SV *filter_cache = NULL; | |
3687 | SV *filter_state = NULL; | |
3688 | SV *filter_sub = NULL; | |
3689 | SV *hook_sv = NULL; | |
3690 | OP *op; | |
3691 | int saved_errno; | |
3692 | bool path_searchable; | |
3693 | I32 old_savestack_ix; | |
3694 | ||
f04d2c34 YO |
3695 | if (!SvOK(sv)) |
3696 | DIE(aTHX_ "Missing or undefined argument to require"); | |
672794ca | 3697 | name = SvPV_nomg_const(sv, len); |
6132ea6c | 3698 | if (!(name && len > 0 && *name)) |
f04d2c34 YO |
3699 | DIE(aTHX_ "Missing or undefined argument to require"); |
3700 | ||
41188aa0 | 3701 | if (!IS_SAFE_PATHNAME(name, len, "require")) { |
c8028aa6 | 3702 | DIE(aTHX_ "Can't locate %s: %s", |
08f800f8 FC |
3703 | pv_escape(newSVpvs_flags("",SVs_TEMP),name,len,len*2, |
3704 | NULL, SvUTF8(sv)?PERL_PV_ESCAPE_UNI:0), | |
c8028aa6 TC |
3705 | Strerror(ENOENT)); |
3706 | } | |
4633a7c4 | 3707 | TAINT_PROPER("require"); |
4492be7a | 3708 | |
511712dc | 3709 | path_searchable = path_is_searchable(name); |
4492be7a JM |
3710 | |
3711 | #ifdef VMS | |
3712 | /* The key in the %ENV hash is in the syntax of file passed as the argument | |
3713 | * usually this is in UNIX format, but sometimes in VMS format, which | |
3714 | * can result in a module being pulled in more than once. | |
3715 | * To prevent this, the key must be stored in UNIX format if the VMS | |
3716 | * name can be translated to UNIX. | |
3717 | */ | |
155f4c25 | 3718 | |
8de90695 FC |
3719 | if ((unixname = |
3720 | tounixspec(name, SvPVX(sv_2mortal(newSVpv("", VMS_MAXRSS-1))))) | |
3721 | != NULL) { | |
4492be7a JM |
3722 | unixlen = strlen(unixname); |
3723 | vms_unixname = 1; | |
3724 | } | |
3725 | else | |
3726 | #endif | |
3727 | { | |
3728 | /* if not VMS or VMS name can not be translated to UNIX, pass it | |
3729 | * through. | |
3730 | */ | |
3731 | unixname = (char *) name; | |
3732 | unixlen = len; | |
3733 | } | |
44f8325f | 3734 | if (PL_op->op_type == OP_REQUIRE) { |
4492be7a JM |
3735 | SV * const * const svp = hv_fetch(GvHVn(PL_incgv), |
3736 | unixname, unixlen, 0); | |
44f8325f AL |
3737 | if ( svp ) { |
3738 | if (*svp != &PL_sv_undef) | |
3739 | RETPUSHYES; | |
3740 | else | |
087b5369 RD |
3741 | DIE(aTHX_ "Attempt to reload %s aborted.\n" |
3742 | "Compilation failed in require", unixname); | |
44f8325f | 3743 | } |
a52f2cce NC |
3744 | |
3745 | if (PL_op->op_flags & OPf_KIDS) { | |
3746 | SVOP * const kid = (SVOP*)cUNOP->op_first; | |
3747 | ||
3748 | if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) { | |
3749 | /* require foo (or use foo) with a bareword. | |
3750 | Perl_load_module fakes up the identical optree, but its | |
3751 | arguments aren't restricted by the parser to real barewords. | |
3752 | */ | |
3753 | const STRLEN package_len = len - 3; | |
3754 | const char slashdot[2] = {'/', '.'}; | |
3755 | #ifdef DOSISH | |
3756 | const char backslashdot[2] = {'\\', '.'}; | |
3757 | #endif | |
3758 | ||
3759 | /* Disallow *purported* barewords that map to absolute | |
3760 | filenames, filenames relative to the current or parent | |
3761 | directory, or (*nix) hidden filenames. Also sanity check | |
3762 | that the generated filename ends .pm */ | |
3763 | if (!path_searchable || len < 3 || name[0] == '.' | |
3764 | || !memEQ(name + package_len, ".pm", 3)) | |
3765 | DIE(aTHX_ "Bareword in require maps to disallowed filename \"%"SVf"\"", sv); | |
3766 | if (memchr(name, 0, package_len)) { | |
3767 | /* diag_listed_as: Bareword in require contains "%s" */ | |
3768 | DIE(aTHX_ "Bareword in require contains \"\\0\""); | |
3769 | } | |
3770 | if (ninstr(name, name + package_len, slashdot, | |
3771 | slashdot + sizeof(slashdot))) { | |
3772 | /* diag_listed_as: Bareword in require contains "%s" */ | |
3773 | DIE(aTHX_ "Bareword in require contains \"/.\""); | |
3774 | } | |
3775 | #ifdef DOSISH | |
3776 | if (ninstr(name, name + package_len, backslashdot, | |
3777 | backslashdot + sizeof(backslashdot))) { | |
3778 | /* diag_listed_as: Bareword in require contains "%s" */ | |
3779 | DIE(aTHX_ "Bareword in require contains \"\\.\""); | |
3780 | } | |
3781 | #endif | |
3782 | } | |
3783 | } | |
4d8b06f1 | 3784 | } |
a0d0e21e | 3785 | |
3f6bd23a | 3786 | PERL_DTRACE_PROBE_FILE_LOADING(unixname); |
32aeab29 | 3787 | |
a0d0e21e LW |
3788 | /* prepare to compile file */ |
3789 | ||
511712dc | 3790 | if (!path_searchable) { |
282b29ee | 3791 | /* At this point, name is SvPVX(sv) */ |
46fc3d4c | 3792 | tryname = name; |
282b29ee | 3793 | tryrsfp = doopen_pm(sv); |
bf4acbe4 | 3794 | } |
511712dc | 3795 | if (!tryrsfp && !(errno == EACCES && !path_searchable)) { |
44f8325f | 3796 | AV * const ar = GvAVn(PL_incgv); |
c70927a6 | 3797 | SSize_t i; |
748a9306 | 3798 | #ifdef VMS |
4492be7a | 3799 | if (vms_unixname) |
46fc3d4c | 3800 | #endif |
3801 | { | |
9ffd39ab | 3802 | SV *nsv = sv; |
d0328fd7 | 3803 | namesv = newSV_type(SVt_PV); |
46fc3d4c | 3804 | for (i = 0; i <= AvFILL(ar); i++) { |
df528165 | 3805 | SV * const dirsv = *av_fetch(ar, i, TRUE); |
bbed91b5 | 3806 | |
6567ce24 | 3807 | SvGETMAGIC(dirsv); |
bbed91b5 KF |
3808 | if (SvROK(dirsv)) { |
3809 | int count; | |
a3b58a99 | 3810 | SV **svp; |
bbed91b5 KF |
3811 | SV *loader = dirsv; |
3812 | ||
e14e2dc8 | 3813 | if (SvTYPE(SvRV(loader)) == SVt_PVAV |
6567ce24 | 3814 | && !SvOBJECT(SvRV(loader))) |
e14e2dc8 | 3815 | { |
502c6561 | 3816 | loader = *av_fetch(MUTABLE_AV(SvRV(loader)), 0, TRUE); |
6567ce24 | 3817 | SvGETMAGIC(loader); |
bbed91b5 KF |
3818 | } |
3819 | ||
b900a521 | 3820 | Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s", |
44f0be63 | 3821 | PTR2UV(SvRV(dirsv)), name); |
349d4f2f | 3822 | tryname = SvPVX_const(namesv); |
c445ea15 | 3823 | tryrsfp = NULL; |
bbed91b5 | 3824 | |
9ffd39ab FC |
3825 | if (SvPADTMP(nsv)) { |
3826 | nsv = sv_newmortal(); | |
3827 | SvSetSV_nosteal(nsv,sv); | |
3828 | } | |
901ee108 FC |
3829 | |
3830 | ENTER_with_name("call_INC"); | |
3831 | SAVETMPS; | |
bbed91b5 KF |
3832 | EXTEND(SP, 2); |
3833 | ||
3834 | PUSHMARK(SP); | |
3835 | PUSHs(dirsv); | |
9ffd39ab | 3836 | PUSHs(nsv); |
bbed91b5 | 3837 | PUTBACK; |
6567ce24 FC |
3838 | if (SvGMAGICAL(loader)) { |
3839 | SV *l = sv_newmortal(); | |
3840 | sv_setsv_nomg(l, loader); | |
3841 | loader = l; | |
3842 | } | |
e982885c NC |
3843 | if (sv_isobject(loader)) |
3844 | count = call_method("INC", G_ARRAY); | |
3845 | else | |
3846 | count = call_sv(loader, G_ARRAY); | |
bbed91b5 KF |
3847 | SPAGAIN; |
3848 | ||
3849 | if (count > 0) { | |
3850 | int i = 0; | |
3851 | SV *arg; | |
3852 | ||
3853 | SP -= count - 1; | |
3854 | arg = SP[i++]; | |
3855 | ||
34113e50 NC |
3856 | if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV) |
3857 | && !isGV_with_GP(SvRV(arg))) { | |
3858 | filter_cache = SvRV(arg); | |
34113e50 NC |
3859 | |
3860 | if (i < count) { | |
3861 | arg = SP[i++]; | |
3862 | } | |
3863 | } | |
3864 | ||
6e592b3a | 3865 | if (SvROK(arg) && isGV_with_GP(SvRV(arg))) { |
bbed91b5 KF |
3866 | arg = SvRV(arg); |
3867 | } | |
3868 | ||
6e592b3a | 3869 | if (isGV_with_GP(arg)) { |
159b6efe | 3870 | IO * const io = GvIO((const GV *)arg); |
bbed91b5 KF |
3871 | |
3872 | ++filter_has_file; | |
3873 | ||
3874 | if (io) { | |
3875 | tryrsfp = IoIFP(io); | |
0f7de14d NC |
3876 | if (IoOFP(io) && IoOFP(io) != IoIFP(io)) { |
3877 | PerlIO_close(IoOFP(io)); | |
bbed91b5 | 3878 | } |
0f7de14d NC |
3879 | IoIFP(io) = NULL; |
3880 | IoOFP(io) = NULL; | |
bbed91b5 KF |
3881 | } |
3882 | ||
3883 | if (i < count) { | |
3884 | arg = SP[i++]; | |
3885 | } | |
3886 | } | |
3887 | ||
3888 | if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) { | |
3889 | filter_sub = arg; | |
74c765eb | 3890 | SvREFCNT_inc_simple_void_NN(filter_sub); |
bbed91b5 KF |
3891 | |
3892 | if (i < count) { | |
3893 | filter_state = SP[i]; | |
b37c2d43 | 3894 | SvREFCNT_inc_simple_void(filter_state); |
bbed91b5 | 3895 | } |
34113e50 | 3896 | } |
bbed91b5 | 3897 | |
34113e50 NC |
3898 | if (!tryrsfp && (filter_cache || filter_sub)) { |
3899 | tryrsfp = PerlIO_open(BIT_BUCKET, | |
3900 | PERL_SCRIPT_MODE); | |
bbed91b5 | 3901 | } |
1d06aecd | 3902 | SP--; |
bbed91b5 KF |
3903 | } |
3904 | ||
c39fcc09 FC |
3905 | /* FREETMPS may free our filter_cache */ |
3906 | SvREFCNT_inc_simple_void(filter_cache); | |
3907 | ||
bbed91b5 KF |
3908 | PUTBACK; |
3909 | FREETMPS; | |
d343c3ef | 3910 | LEAVE_with_name("call_INC"); |
bbed91b5 | 3911 | |
c39fcc09 FC |
3912 | /* Now re-mortalize it. */ |
3913 | sv_2mortal(filter_cache); | |
3914 | ||
c5f55552 NC |
3915 | /* Adjust file name if the hook has set an %INC entry. |
3916 | This needs to happen after the FREETMPS above. */ | |
3917 | svp = hv_fetch(GvHVn(PL_incgv), name, len, 0); | |
3918 | if (svp) | |
3919 | tryname = SvPV_nolen_const(*svp); | |
3920 | ||
bbed91b5 | 3921 | if (tryrsfp) { |
89ccab8c | 3922 | hook_sv = dirsv; |
bbed91b5 KF |
3923 | break; |
3924 | } | |
3925 | ||
3926 | filter_has_file = 0; | |
9b7d7782 | 3927 | filter_cache = NULL; |
bbed91b5 | 3928 | if (filter_state) { |
762333d9 | 3929 | SvREFCNT_dec_NN(filter_state); |
c445ea15 | 3930 | filter_state = NULL; |
bbed91b5 KF |
3931 | } |
3932 | if (filter_sub) { | |
762333d9 | 3933 | SvREFCNT_dec_NN(filter_sub); |
c445ea15 | 3934 | filter_sub = NULL; |
bbed91b5 KF |
3935 | } |
3936 | } | |
3937 | else { | |
511712dc | 3938 | if (path_searchable) { |
b640a14a NC |
3939 | const char *dir; |
3940 | STRLEN dirlen; | |
3941 | ||
3942 | if (SvOK(dirsv)) { | |
6567ce24 | 3943 | dir = SvPV_nomg_const(dirsv, dirlen); |
b640a14a NC |
3944 | } else { |
3945 | dir = ""; | |
3946 | dirlen = 0; | |
3947 | } | |
3948 | ||
ddc65b67 CB |
3949 | if (!IS_SAFE_SYSCALL(dir, dirlen, "@INC entry", "require")) |
3950 | continue; | |
e37778c2 | 3951 | #ifdef VMS |
8de90695 FC |
3952 | if ((unixdir = |
3953 | tounixpath(dir, SvPVX(sv_2mortal(newSVpv("", VMS_MAXRSS-1))))) | |
3954 | == NULL) | |
bbed91b5 KF |
3955 | continue; |
3956 | sv_setpv(namesv, unixdir); | |
3957 | sv_catpv(namesv, unixname); | |
e37778c2 NC |
3958 | #else |
3959 | # ifdef __SYMBIAN32__ | |
27da23d5 JH |
3960 | if (PL_origfilename[0] && |
3961 | PL_origfilename[1] == ':' && | |
3962 | !(dir[0] && dir[1] == ':')) | |
3963 | Perl_sv_setpvf(aTHX_ namesv, | |
3964 | "%c:%s\\%s", | |
3965 | PL_origfilename[0], | |
3966 | dir, name); | |
3967 | else | |
3968 | Perl_sv_setpvf(aTHX_ namesv, | |
3969 | "%s\\%s", | |
3970 | dir, name); | |
e37778c2 | 3971 | # else |
b640a14a NC |
3972 | /* The equivalent of |
3973 | Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name); | |
3974 | but without the need to parse the format string, or | |
3975 | call strlen on either pointer, and with the correct | |
3976 | allocation up front. */ | |
3977 | { | |
3978 | char *tmp = SvGROW(namesv, dirlen + len + 2); | |
3979 | ||
3980 | memcpy(tmp, dir, dirlen); | |
3981 | tmp +=dirlen; | |
6b0bdd7f MH |
3982 | |
3983 | /* Avoid '<dir>//<file>' */ | |
3984 | if (!dirlen || *(tmp-1) != '/') { | |
3985 | *tmp++ = '/'; | |
9fdd5a7a MH |
3986 | } else { |
3987 | /* So SvCUR_set reports the correct length below */ | |
3988 | dirlen--; | |
6b0bdd7f MH |
3989 | } |
3990 | ||
b640a14a NC |
3991 | /* name came from an SV, so it will have a '\0' at the |
3992 | end that we can copy as part of this memcpy(). */ | |
3993 | memcpy(tmp, name, len + 1); | |
3994 | ||
3995 | SvCUR_set(namesv, dirlen + len + 1); | |
282b29ee | 3996 | SvPOK_on(namesv); |
b640a14a | 3997 | } |
27da23d5 | 3998 | # endif |
bf4acbe4 | 3999 | #endif |
bbed91b5 | 4000 | TAINT_PROPER("require"); |
349d4f2f | 4001 | tryname = SvPVX_const(namesv); |
282b29ee | 4002 | tryrsfp = doopen_pm(namesv); |
bbed91b5 | 4003 | if (tryrsfp) { |
e63be746 RGS |
4004 | if (tryname[0] == '.' && tryname[1] == '/') { |
4005 | ++tryname; | |
4910606a | 4006 | while (*++tryname == '/') {} |
e63be746 | 4007 | } |
bbed91b5 KF |
4008 | break; |
4009 | } | |
2433d39e BF |
4010 | else if (errno == EMFILE || errno == EACCES) { |
4011 | /* no point in trying other paths if out of handles; | |
4012 | * on the other hand, if we couldn't open one of the | |
4013 | * files, then going on with the search could lead to | |
4014 | * unexpected results; see perl #113422 | |
4015 | */ | |
4016 | break; | |
4017 | } | |
be4b629d | 4018 | } |
46fc3d4c | 4019 | } |
a0d0e21e LW |
4020 | } |
4021 | } | |
4022 | } | |
83b195e4 | 4023 | saved_errno = errno; /* sv_2mortal can realloc things */ |
b2ef6d44 | 4024 | sv_2mortal(namesv); |
a0d0e21e | 4025 | if (!tryrsfp) { |
533c011a | 4026 | if (PL_op->op_type == OP_REQUIRE) { |
83b195e4 | 4027 | if(saved_errno == EMFILE || saved_errno == EACCES) { |
c9d5e35e | 4028 | /* diag_listed_as: Can't locate %s */ |
e2ce0950 P |
4029 | DIE(aTHX_ "Can't locate %s: %s: %s", |
4030 | name, tryname, Strerror(saved_errno)); | |
e31de809 SP |
4031 | } else { |
4032 | if (namesv) { /* did we lookup @INC? */ | |
44f8325f | 4033 | AV * const ar = GvAVn(PL_incgv); |
c70927a6 | 4034 | SSize_t i; |
1e5f02b3 | 4035 | SV *const msg = newSVpvs_flags("", SVs_TEMP); |
c9d5e35e NC |
4036 | SV *const inc = newSVpvs_flags("", SVs_TEMP); |
4037 | for (i = 0; i <= AvFILL(ar); i++) { | |
4038 | sv_catpvs(inc, " "); | |
4039 | sv_catsv(inc, *av_fetch(ar, i, TRUE)); | |
4040 | } | |
f7ee53b5 PJ |
4041 | if (len >= 4 && memEQ(name + len - 3, ".pm", 4)) { |
4042 | const char *c, *e = name + len - 3; | |
4043 | sv_catpv(msg, " (you may need to install the "); | |
4044 | for (c = name; c < e; c++) { | |
4045 | if (*c == '/') { | |
46e2868e | 4046 | sv_catpvs(msg, "::"); |
f7ee53b5 PJ |
4047 | } |
4048 | else { | |
4049 | sv_catpvn(msg, c, 1); | |
4050 | } | |
4051 | } | |
4052 | sv_catpv(msg, " module)"); | |
4053 | } | |
4054 | else if (len >= 2 && memEQ(name + len - 2, ".h", 3)) { | |
4055 | sv_catpv(msg, " (change .h to .ph maybe?) (did you run h2ph?)"); | |
4056 | } | |
4057 | else if (len >= 3 && memEQ(name + len - 3, ".ph", 4)) { | |
4058 | sv_catpv(msg, " (did you run h2ph?)"); | |
4059 | } | |
c9d5e35e NC |
4060 | |
4061 | /* diag_listed_as: Can't locate %s */ | |
4062 | DIE(aTHX_ | |
f7ee53b5 PJ |
4063 | "Can't locate %s in @INC%" SVf " (@INC contains:%" SVf ")", |
4064 | name, msg, inc); | |
c9d5e35e | 4065 | } |
2683423c | 4066 | } |
c9d5e35e | 4067 | DIE(aTHX_ "Can't locate %s", name); |
a0d0e21e LW |
4068 | } |
4069 | ||
a3ff80c1 | 4070 | CLEAR_ERRSV(); |
a0d0e21e LW |
4071 | RETPUSHUNDEF; |
4072 | } | |
d8bfb8bd | 4073 | else |
93189314 | 4074 | SETERRNO(0, SS_NORMAL); |
a0d0e21e LW |
4075 | |
4076 | /* Assume success here to prevent recursive requirement. */ | |
238d24b4 | 4077 | /* name is never assigned to again, so len is still strlen(name) */ |
d3a4e64e | 4078 | /* Check whether a hook in @INC has already filled %INC */ |
44f8325f | 4079 | if (!hook_sv) { |
4492be7a | 4080 | (void)hv_store(GvHVn(PL_incgv), |
b2ef6d44 | 4081 | unixname, unixlen, newSVpv(tryname,0),0); |
44f8325f | 4082 | } else { |
4492be7a | 4083 | SV** const svp = hv_fetch(GvHVn(PL_incgv), unixname, unixlen, 0); |
44f8325f | 4084 | if (!svp) |
4492be7a JM |
4085 | (void)hv_store(GvHVn(PL_incgv), |
4086 | unixname, unixlen, SvREFCNT_inc_simple(hook_sv), 0 ); | |
d3a4e64e | 4087 | } |
a0d0e21e | 4088 | |
adcbf118 | 4089 | old_savestack_ix = PL_savestack_ix; |
b2ef6d44 FC |
4090 | SAVECOPFILE_FREE(&PL_compiling); |
4091 | CopFILE_set(&PL_compiling, tryname); | |
8eaa0acf | 4092 | lex_start(NULL, tryrsfp, 0); |
e50aee73 | 4093 | |
34113e50 | 4094 | if (filter_sub || filter_cache) { |
4464f08e NC |
4095 | /* We can use the SvPV of the filter PVIO itself as our cache, rather |
4096 | than hanging another SV from it. In turn, filter_add() optionally | |
4097 | takes the SV to use as the filter (or creates a new SV if passed | |
4098 | NULL), so simply pass in whatever value filter_cache has. */ | |
9b7d7782 FC |
4099 | SV * const fc = filter_cache ? newSV(0) : NULL; |
4100 | SV *datasv; | |
4101 | if (fc) sv_copypv(fc, filter_cache); | |
4102 | datasv = filter_add(S_run_user_filter, fc); | |
bbed91b5 | 4103 | IoLINES(datasv) = filter_has_file; |
159b6efe NC |
4104 | IoTOP_GV(datasv) = MUTABLE_GV(filter_state); |
4105 | IoBOTTOM_GV(datasv) = MUTABLE_GV(filter_sub); | |
bbed91b5 KF |
4106 | } |
4107 | ||
4108 | /* switch to eval mode */ | |
ed8ff0f3 | 4109 | cx = cx_pushblock(CXt_EVAL, gimme, SP, old_savestack_ix); |
13febba5 | 4110 | cx_pusheval(cx, PL_op->op_next, newSVpv(name, 0)); |
a0d0e21e | 4111 | |
57843af0 GS |
4112 | SAVECOPLINE(&PL_compiling); |
4113 | CopLINE_set(&PL_compiling, 0); | |
a0d0e21e LW |
4114 | |
4115 | PUTBACK; | |
6ec9efec | 4116 | |
9aba0c93 | 4117 | if (doeval_compile(gimme, NULL, PL_curcop->cop_seq, NULL)) |
410be5db DM |
4118 | op = DOCATCH(PL_eval_start); |
4119 | else | |
4120 | op = PL_op->op_next; | |
bfed75c6 | 4121 | |
3f6bd23a | 4122 | PERL_DTRACE_PROBE_FILE_LOADED(unixname); |
32aeab29 | 4123 | |
6ec9efec | 4124 | return op; |
a0d0e21e LW |
4125 | } |
4126 | ||
5fb41388 DM |
4127 | |
4128 | /* also used for: pp_dofile() */ | |
4129 | ||
4130 | PP(pp_require) | |
4131 | { | |
4132 | dSP; | |
4133 | SV *sv = POPs; | |
4134 | SvGETMAGIC(sv); | |
4135 | PUTBACK; | |
4136 | return ((SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) | |
4137 | ? S_require_version(aTHX_ sv) | |
4138 | : S_require_file(aTHX_ sv); | |
4139 | } | |
4140 | ||
4141 | ||
996c9baa VP |
4142 | /* This is a op added to hold the hints hash for |
4143 | pp_entereval. The hash can be modified by the code | |
4144 | being eval'ed, so we return a copy instead. */ | |
4145 | ||
4146 | PP(pp_hintseval) | |
4147 | { | |
996c9baa | 4148 | dSP; |
defdfed5 | 4149 | mXPUSHs(MUTABLE_SV(hv_copy_hints_hv(MUTABLE_HV(cSVOP_sv)))); |
996c9baa VP |
4150 | RETURN; |
4151 | } | |
4152 | ||
4153 | ||
a0d0e21e LW |
4154 | PP(pp_entereval) |
4155 | { | |
20b7effb | 4156 | dSP; |
eb578fdb | 4157 | PERL_CONTEXT *cx; |
0d863452 | 4158 | SV *sv; |
1c23e2bd | 4159 | const U8 gimme = GIMME_V; |
fd06b02c | 4160 | const U32 was = PL_breakable_sub_gen; |
83ee9e09 | 4161 | char tbuf[TYPE_DIGITS(long) + 12]; |
78da7625 | 4162 | bool saved_delete = FALSE; |
83ee9e09 | 4163 | char *tmpbuf = tbuf; |
a0d0e21e | 4164 | STRLEN len; |
a3985cdc | 4165 | CV* runcv; |
0abcdfa4 | 4166 | U32 seq, lex_flags = 0; |
c445ea15 | 4167 | HV *saved_hh = NULL; |
60d63348 | 4168 | const bool bytes = PL_op->op_private & OPpEVAL_BYTES; |
adcbf118 | 4169 | I32 old_savestack_ix; |
e389bba9 | 4170 | |
0d863452 | 4171 | if (PL_op->op_private & OPpEVAL_HAS_HH) { |
85fbaab2 | 4172 | saved_hh = MUTABLE_HV(SvREFCNT_inc(POPs)); |
0d863452 | 4173 | } |
bc344123 FC |
4174 | else if (PL_hints & HINT_LOCALIZE_HH || ( |
4175 | PL_op->op_private & OPpEVAL_COPHH | |
4176 | && PL_curcop->cop_hints & HINT_LOCALIZE_HH | |
4177 | )) { | |
7d789282 FC |
4178 | saved_hh = cop_hints_2hv(PL_curcop, 0); |
4179 | hv_magic(saved_hh, NULL, PERL_MAGIC_hints); | |
4180 | } | |
0d863452 | 4181 | sv = POPs; |
895b760f DM |
4182 | if (!SvPOK(sv)) { |
4183 | /* make sure we've got a plain PV (no overload etc) before testing | |
4184 | * for taint. Making a copy here is probably overkill, but better | |
4185 | * safe than sorry */ | |
0479a84a NC |
4186 | STRLEN len; |
4187 | const char * const p = SvPV_const(sv, len); | |
4188 | ||
4189 | sv = newSVpvn_flags(p, len, SVs_TEMP | SvUTF8(sv)); | |
0abcdfa4 | 4190 | lex_flags |= LEX_START_COPIED; |
7d789282 | 4191 | |
60d63348 | 4192 | if (bytes && SvUTF8(sv)) |
7d789282 FC |
4193 | SvPVbyte_force(sv, len); |
4194 | } | |
60d63348 | 4195 | else if (bytes && SvUTF8(sv)) { |
e1fa07e3 | 4196 | /* Don't modify someone else's scalar */ |
7d789282 FC |
4197 | STRLEN len; |
4198 | sv = newSVsv(sv); | |
5cefc8c1 | 4199 | (void)sv_2mortal(sv); |
7d789282 | 4200 | SvPVbyte_force(sv,len); |
0abcdfa4 | 4201 | lex_flags |= LEX_START_COPIED; |
895b760f | 4202 | } |
a0d0e21e | 4203 | |
af2d3def | 4204 | TAINT_IF(SvTAINTED(sv)); |
748a9306 | 4205 | TAINT_PROPER("eval"); |
a0d0e21e | 4206 | |
adcbf118 DM |
4207 | old_savestack_ix = PL_savestack_ix; |
4208 | ||
0abcdfa4 | 4209 | lex_start(sv, NULL, lex_flags | (PL_op->op_private & OPpEVAL_UNICODE |
60d63348 FC |
4210 | ? LEX_IGNORE_UTF8_HINTS |
4211 | : bytes ? LEX_EVALBYTES : LEX_START_SAME_FILTER | |
0abcdfa4 | 4212 | ) |
60d63348 | 4213 | ); |
ac27b0f5 | 4214 | |
a0d0e21e LW |
4215 | /* switch to eval mode */ |
4216 | ||
83ee9e09 | 4217 | if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) { |
8b38226b AL |
4218 | SV * const temp_sv = sv_newmortal(); |
4219 | Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]", | |
83ee9e09 GS |
4220 | (unsigned long)++PL_evalseq, |
4221 | CopFILE(PL_curcop), (IV)CopLINE(PL_curcop)); | |
8b38226b AL |
4222 | tmpbuf = SvPVX(temp_sv); |
4223 | len = SvCUR(temp_sv); | |
83ee9e09 GS |
4224 | } |
4225 | else | |
d9fad198 | 4226 | len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq); |
f4dd75d9 | 4227 | SAVECOPFILE_FREE(&PL_compiling); |
57843af0 | 4228 | CopFILE_set(&PL_compiling, tmpbuf+2); |
f4dd75d9 | 4229 | SAVECOPLINE(&PL_compiling); |
57843af0 | 4230 | CopLINE_set(&PL_compiling, 1); |
d819b83a DM |
4231 | /* special case: an eval '' executed within the DB package gets lexically |
4232 | * placed in the first non-DB CV rather than the current CV - this | |
4233 | * allows the debugger to execute code, find lexicals etc, in the | |
4234 | * scope of the code being debugged. Passing &seq gets find_runcv | |
4235 | * to do the dirty work for us */ | |
4236 | runcv = find_runcv(&seq); | |
a0d0e21e | 4237 | |
ed8ff0f3 | 4238 | cx = cx_pushblock((CXt_EVAL|CXp_REAL), gimme, SP, old_savestack_ix); |
13febba5 | 4239 | cx_pusheval(cx, PL_op->op_next, NULL); |
a0d0e21e LW |
4240 | |
4241 | /* prepare to compile string */ | |
4242 | ||
c7a622b3 | 4243 | if (PERLDB_LINE_OR_SAVESRC && PL_curstash != PL_debstash) |
bdc0bf6f | 4244 | save_lines(CopFILEAV(&PL_compiling), PL_parser->linestr); |
78da7625 | 4245 | else { |
c8cb8d55 FC |
4246 | /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up |
4247 | deleting the eval's FILEGV from the stash before gv_check() runs | |
4248 | (i.e. before run-time proper). To work around the coredump that | |
4249 | ensues, we always turn GvMULTI_on for any globals that were | |
4250 | introduced within evals. See force_ident(). GSAR 96-10-12 */ | |
78da7625 FC |
4251 | char *const safestr = savepvn(tmpbuf, len); |
4252 | SAVEDELETE(PL_defstash, safestr, len); | |
4253 | saved_delete = TRUE; | |
4254 | } | |
4255 | ||
a0d0e21e | 4256 | PUTBACK; |
f9bddea7 | 4257 | |
9aba0c93 | 4258 | if (doeval_compile(gimme, runcv, seq, saved_hh)) { |
f9bddea7 | 4259 | if (was != PL_breakable_sub_gen /* Some subs defined here. */ |
c7a622b3 | 4260 | ? PERLDB_LINE_OR_SAVESRC |
f9bddea7 NC |
4261 | : PERLDB_SAVESRC_NOSUBS) { |
4262 | /* Retain the filegv we created. */ | |
78da7625 | 4263 | } else if (!saved_delete) { |
f9bddea7 NC |
4264 | char *const safestr = savepvn(tmpbuf, len); |
4265 | SAVEDELETE(PL_defstash, safestr, len); | |
4266 | } | |
4267 | return DOCATCH(PL_eval_start); | |
4268 | } else { | |
486ec47a | 4269 | /* We have already left the scope set up earlier thanks to the LEAVE |
9aba0c93 | 4270 | in doeval_compile(). */ |
eb044b10 | 4271 | if (was != PL_breakable_sub_gen /* Some subs defined here. */ |
c7a622b3 | 4272 | ? PERLDB_LINE_OR_SAVESRC |
eb044b10 | 4273 | : PERLDB_SAVESRC_INVALID) { |
f9bddea7 | 4274 | /* Retain the filegv we created. */ |
7857f360 | 4275 | } else if (!saved_delete) { |
f9bddea7 NC |
4276 | (void)hv_delete(PL_defstash, tmpbuf, len, G_DISCARD); |
4277 | } | |
4278 | return PL_op->op_next; | |
4279 | } | |
a0d0e21e LW |
4280 | } |
4281 | ||
c349b9a0 DM |
4282 | |
4283 | /* also tail-called by pp_return */ | |
4284 | ||
a0d0e21e LW |
4285 | PP(pp_leaveeval) |
4286 | { | |
f5ddd604 | 4287 | SV **oldsp; |
1c23e2bd | 4288 | U8 gimme; |
eb578fdb | 4289 | PERL_CONTEXT *cx; |
a0d0e21e | 4290 | OP *retop; |
06a7bc17 | 4291 | int failed; |
676a678a | 4292 | CV *evalcv; |
06a7bc17 | 4293 | bool keep; |
a0d0e21e | 4294 | |
011c3814 | 4295 | PERL_ASYNC_CHECK(); |
61d3b95a | 4296 | |
4ebe6e95 | 4297 | cx = CX_CUR(); |
61d3b95a | 4298 | assert(CxTYPE(cx) == CXt_EVAL); |
2aabfe8a | 4299 | |
f5ddd604 | 4300 | oldsp = PL_stack_base + cx->blk_oldsp; |
61d3b95a DM |
4301 | gimme = cx->blk_gimme; |
4302 | ||
2aabfe8a | 4303 | /* did require return a false value? */ |
06a7bc17 DM |
4304 | failed = CxOLD_OP_TYPE(cx) == OP_REQUIRE |
4305 | && !(gimme == G_SCALAR | |
2aabfe8a | 4306 | ? SvTRUE(*PL_stack_sp) |
06a7bc17 | 4307 | : PL_stack_sp > oldsp); |
2aabfe8a | 4308 | |
cc040a9b | 4309 | if (gimme == G_VOID) |
f5ddd604 | 4310 | PL_stack_sp = oldsp; |
2aabfe8a | 4311 | else |
f5ddd604 | 4312 | leave_adjust_stacks(oldsp, oldsp, gimme, 0); |
2aabfe8a | 4313 | |
13febba5 | 4314 | /* the cx_popeval does a leavescope, which frees the optree associated |
4df352a8 DM |
4315 | * with eval, which if it frees the nextstate associated with |
4316 | * PL_curcop, sets PL_curcop to NULL. Which can mess up freeing a | |
4317 | * regex when running under 'use re Debug' because it needs PL_curcop | |
4318 | * to get the current hints. So restore it early. | |
4319 | */ | |
4320 | PL_curcop = cx->blk_oldcop; | |
2aabfe8a | 4321 | |
06a7bc17 DM |
4322 | /* grab this value before cx_popeval restores the old PL_in_eval */ |
4323 | keep = cBOOL(PL_in_eval & EVAL_KEEPERR); | |
f39bc417 | 4324 | retop = cx->blk_eval.retop; |
676a678a | 4325 | evalcv = cx->blk_eval.cv; |
4fdae800 | 4326 | #ifdef DEBUGGING |
676a678a | 4327 | assert(CvDEPTH(evalcv) == 1); |
4fdae800 | 4328 | #endif |
676a678a | 4329 | CvDEPTH(evalcv) = 0; |
4fdae800 | 4330 | |
06a7bc17 DM |
4331 | /* pop the CXt_EVAL, and if a require failed, croak */ |
4332 | S_pop_eval_context_maybe_croak(aTHX_ cx, NULL, failed); | |
a0d0e21e | 4333 | |
d308a779 DM |
4334 | if (!keep) |
4335 | CLEAR_ERRSV(); | |
4336 | ||
2aabfe8a | 4337 | return retop; |
a0d0e21e LW |
4338 | } |
4339 | ||
edb2152a NC |
4340 | /* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it |
4341 | close to the related Perl_create_eval_scope. */ | |
4342 | void | |
4343 | Perl_delete_eval_scope(pTHX) | |
a0d0e21e | 4344 | { |
eb578fdb | 4345 | PERL_CONTEXT *cx; |
edb2152a | 4346 | |
4ebe6e95 | 4347 | cx = CX_CUR(); |
2f450c1b | 4348 | CX_LEAVE_SCOPE(cx); |
13febba5 | 4349 | cx_popeval(cx); |
ed8ff0f3 | 4350 | cx_popblock(cx); |
5da525e9 | 4351 | CX_POP(cx); |
edb2152a | 4352 | } |
a0d0e21e | 4353 | |
edb2152a NC |
4354 | /* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was |
4355 | also needed by Perl_fold_constants. */ | |
274ed8ae DM |
4356 | void |
4357 | Perl_create_eval_scope(pTHX_ OP *retop, U32 flags) | |
edb2152a NC |
4358 | { |
4359 | PERL_CONTEXT *cx; | |
1c23e2bd | 4360 | const U8 gimme = GIMME_V; |
edb2152a | 4361 | |
ed8ff0f3 | 4362 | cx = cx_pushblock((CXt_EVAL|CXp_TRYBLOCK), gimme, |
490576d1 | 4363 | PL_stack_sp, PL_savestack_ix); |
13febba5 | 4364 | cx_pusheval(cx, retop, NULL); |
a0d0e21e | 4365 | |
faef0170 | 4366 | PL_in_eval = EVAL_INEVAL; |
edb2152a NC |
4367 | if (flags & G_KEEPERR) |
4368 | PL_in_eval |= EVAL_KEEPERR; | |
ab69dbc2 RGS |
4369 | else |
4370 | CLEAR_ERRSV(); | |
edb2152a NC |
4371 | if (flags & G_FAKINGEVAL) { |
4372 | PL_eval_root = PL_op; /* Only needed so that goto works right. */ | |
4373 | } | |
edb2152a NC |
4374 | } |
4375 | ||
4376 | PP(pp_entertry) | |
4377 | { | |
274ed8ae | 4378 | create_eval_scope(cLOGOP->op_other->op_next, 0); |
533c011a | 4379 | return DOCATCH(PL_op->op_next); |
a0d0e21e LW |
4380 | } |
4381 | ||
c349b9a0 DM |
4382 | |
4383 | /* also tail-called by pp_return */ | |
4384 | ||
a0d0e21e LW |
4385 | PP(pp_leavetry) |
4386 | { | |
f5ddd604 | 4387 | SV **oldsp; |
1c23e2bd | 4388 | U8 gimme; |
eb578fdb | 4389 | PERL_CONTEXT *cx; |
334ea179 | 4390 | OP *retop; |
a0d0e21e | 4391 | |
011c3814 | 4392 | PERL_ASYNC_CHECK(); |
61d3b95a | 4393 | |
4ebe6e95 | 4394 | cx = CX_CUR(); |
61d3b95a | 4395 | assert(CxTYPE(cx) == CXt_EVAL); |
f5ddd604 | 4396 | oldsp = PL_stack_base + cx->blk_oldsp; |
61d3b95a DM |
4397 | gimme = cx->blk_gimme; |
4398 | ||
cc040a9b | 4399 | if (gimme == G_VOID) |
f5ddd604 | 4400 | PL_stack_sp = oldsp; |
0663a8f8 | 4401 | else |
f5ddd604 | 4402 | leave_adjust_stacks(oldsp, oldsp, gimme, 1); |
2f450c1b | 4403 | CX_LEAVE_SCOPE(cx); |
13febba5 | 4404 | cx_popeval(cx); |
ed8ff0f3 | 4405 | cx_popblock(cx); |
61d3b95a | 4406 | retop = cx->blk_eval.retop; |
5da525e9 | 4407 | CX_POP(cx); |
67f63db7 | 4408 | |
ab69dbc2 | 4409 | CLEAR_ERRSV(); |
0663a8f8 | 4410 | return retop; |
a0d0e21e LW |
4411 | } |
4412 | ||
0d863452 RH |
4413 | PP(pp_entergiven) |
4414 | { | |
20b7effb | 4415 | dSP; |
eb578fdb | 4416 | PERL_CONTEXT *cx; |
1c23e2bd | 4417 | const U8 gimme = GIMME_V; |
b95eccd3 DM |
4418 | SV *origsv = DEFSV; |
4419 | SV *newsv = POPs; | |
0d863452 | 4420 | |
5d051ee0 | 4421 | assert(!PL_op->op_targ); /* used to be set for lexical $_ */ |
b95eccd3 | 4422 | GvSV(PL_defgv) = SvREFCNT_inc(newsv); |
0d863452 | 4423 | |
ed8ff0f3 | 4424 | cx = cx_pushblock(CXt_GIVEN, gimme, SP, PL_savestack_ix); |
2a7b7c61 | 4425 | cx_pushgiven(cx, origsv); |
0d863452 RH |
4426 | |
4427 | RETURN; | |
4428 | } | |
4429 | ||
4430 | PP(pp_leavegiven) | |
4431 | { | |
eb578fdb | 4432 | PERL_CONTEXT *cx; |
1c23e2bd | 4433 | U8 gimme; |
f5ddd604 | 4434 | SV **oldsp; |
96a5add6 | 4435 | PERL_UNUSED_CONTEXT; |
0d863452 | 4436 | |
4ebe6e95 | 4437 | cx = CX_CUR(); |
61d3b95a | 4438 | assert(CxTYPE(cx) == CXt_GIVEN); |
f5ddd604 | 4439 | oldsp = PL_stack_base + cx->blk_oldsp; |
61d3b95a DM |
4440 | gimme = cx->blk_gimme; |
4441 | ||
0663a8f8 | 4442 | if (gimme == G_VOID) |
f5ddd604 | 4443 | PL_stack_sp = oldsp; |
0663a8f8 | 4444 | else |
f5ddd604 | 4445 | leave_adjust_stacks(oldsp, oldsp, gimme, 1); |
2f450c1b DM |
4446 | |
4447 | CX_LEAVE_SCOPE(cx); | |
2a7b7c61 | 4448 | cx_popgiven(cx); |
ed8ff0f3 | 4449 | cx_popblock(cx); |
5da525e9 | 4450 | CX_POP(cx); |
0d863452 | 4451 | |
0663a8f8 | 4452 | return NORMAL; |
0d863452 RH |
4453 | } |
4454 | ||
4455 | /* Helper routines used by pp_smartmatch */ | |
4136a0f7 | 4456 | STATIC PMOP * |
84679df5 | 4457 | S_make_matcher(pTHX_ REGEXP *re) |
0d863452 RH |
4458 | { |
4459 | PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED); | |
7918f24d NC |
4460 | |
4461 | PERL_ARGS_ASSERT_MAKE_MATCHER; | |
4462 | ||
d6106309 | 4463 | PM_SETRE(matcher, ReREFCNT_inc(re)); |
7918f24d | 4464 | |
0d863452 | 4465 | SAVEFREEOP((OP *) matcher); |
d343c3ef | 4466 | ENTER_with_name("matcher"); SAVETMPS; |
0d863452 RH |
4467 | SAVEOP(); |
4468 | return matcher; | |
4469 | } | |
4470 | ||
4136a0f7 | 4471 | STATIC bool |
0d863452 RH |
4472 | S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv) |
4473 | { | |
4474 | dSP; | |
72e5fb63 | 4475 | bool result; |
7918f24d NC |
4476 | |
4477 | PERL_ARGS_ASSERT_MATCHER_MATCHES_SV; | |
0d863452 RH |
4478 | |
4479 | PL_op = (OP *) matcher; | |
4480 | XPUSHs(sv); | |
4481 | PUTBACK; | |
897d3989 | 4482 | (void) Perl_pp_match(aTHX); |
0d863452 | 4483 | SPAGAIN; |
72e5fb63 TC |
4484 | result = SvTRUEx(POPs); |
4485 | PUTBACK; | |
4486 | ||
4487 | return result; | |
0d863452 RH |
4488 | } |
4489 | ||
4136a0f7 | 4490 | STATIC void |
0d863452 RH |
4491 | S_destroy_matcher(pTHX_ PMOP *matcher) |
4492 | { | |
7918f24d | 4493 | PERL_ARGS_ASSERT_DESTROY_MATCHER; |
0d863452 | 4494 | PERL_UNUSED_ARG(matcher); |
7918f24d | 4495 | |
0d863452 | 4496 | FREETMPS; |
d343c3ef | 4497 | LEAVE_with_name("matcher"); |
0d863452 RH |
4498 | } |
4499 | ||
4500 | /* Do a smart match */ | |
4501 | PP(pp_smartmatch) | |
4502 | { | |
d7c0d282 | 4503 | DEBUG_M(Perl_deb(aTHX_ "Starting smart match resolution\n")); |
be88a5c3 | 4504 | return do_smartmatch(NULL, NULL, 0); |
0d863452 RH |
4505 | } |
4506 | ||
4b021f5f RGS |
4507 | /* This version of do_smartmatch() implements the |
4508 | * table of smart matches that is found in perlsyn. | |
0d863452 | 4509 | */ |
4136a0f7 | 4510 | STATIC OP * |
be88a5c3 | 4511 | S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other, const bool copied) |
0d863452 RH |
4512 | { |
4513 | dSP; | |
4514 | ||
41e726ac | 4515 | bool object_on_left = FALSE; |
0d863452 RH |
4516 | SV *e = TOPs; /* e is for 'expression' */ |
4517 | SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */ | |
a566f585 | 4518 | |
6f1401dc DM |
4519 | /* Take care only to invoke mg_get() once for each argument. |
4520 | * Currently we do this by copying the SV if it's magical. */ | |
4521 | if (d) { | |
be88a5c3 | 4522 | if (!copied && SvGMAGICAL(d)) |
6f1401dc DM |
4523 | d = sv_mortalcopy(d); |
4524 | } | |
4525 | else | |
4526 | d = &PL_sv_undef; | |
4527 | ||
4528 | assert(e); | |
4529 | if (SvGMAGICAL(e)) | |
4530 | e = sv_mortalcopy(e); | |
4531 | ||
2c9d2554 | 4532 | /* First of all, handle overload magic of the rightmost argument */ |
6d743019 | 4533 | if (SvAMAGIC(e)) { |
d7c0d282 DM |
4534 | SV * tmpsv; |
4535 | DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n")); | |
4536 | DEBUG_M(Perl_deb(aTHX_ " attempting overload\n")); | |
4537 | ||
b900a653 | 4538 | tmpsv = amagic_call(d, e, smart_amg, AMGf_noleft); |
7c41e62e RGS |
4539 | if (tmpsv) { |
4540 | SPAGAIN; | |
4541 | (void)POPs; | |
4542 | SETs(tmpsv); | |
4543 | RETURN; | |
4544 | } | |
d7c0d282 | 4545 | DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; continuing...\n")); |
7c41e62e | 4546 | } |
62ec5f58 | 4547 | |
0d863452 | 4548 | SP -= 2; /* Pop the values */ |
e8fe1b7c | 4549 | PUTBACK; |
0d863452 | 4550 | |
b0138e99 | 4551 | /* ~~ undef */ |
62ec5f58 | 4552 | if (!SvOK(e)) { |
d7c0d282 | 4553 | DEBUG_M(Perl_deb(aTHX_ " applying rule Any-undef\n")); |
62ec5f58 | 4554 | if (SvOK(d)) |
33570f8b RGS |
4555 | RETPUSHNO; |
4556 | else | |
62ec5f58 | 4557 | RETPUSHYES; |
33570f8b | 4558 | } |
e67b97bd | 4559 | |
4b523e79 | 4560 | if (SvROK(e) && SvOBJECT(SvRV(e)) && (SvTYPE(SvRV(e)) != SVt_REGEXP)) { |
d7c0d282 | 4561 | DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Object\n")); |
62ec5f58 | 4562 | Perl_croak(aTHX_ "Smart matching a non-overloaded object breaks encapsulation"); |
d7c0d282 | 4563 | } |
4b523e79 | 4564 | if (SvROK(d) && SvOBJECT(SvRV(d)) && (SvTYPE(SvRV(d)) != SVt_REGEXP)) |
41e726ac | 4565 | object_on_left = TRUE; |
62ec5f58 | 4566 | |
b0138e99 | 4567 | /* ~~ sub */ |
a4a197da | 4568 | if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVCV) { |
0d863452 | 4569 | I32 c; |
41e726ac RGS |
4570 | if (object_on_left) { |
4571 | goto sm_any_sub; /* Treat objects like scalars */ | |
4572 | } | |
4573 | else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) { | |
a4a197da RGS |
4574 | /* Test sub truth for each key */ |
4575 | HE *he; | |
4576 | bool andedresults = TRUE; | |
4577 | HV *hv = (HV*) SvRV(d); | |
168ff818 | 4578 | I32 numkeys = hv_iterinit(hv); |
d7c0d282 | 4579 | DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-CodeRef\n")); |
168ff818 | 4580 | if (numkeys == 0) |
07edf497 | 4581 | RETPUSHYES; |
a4a197da | 4582 | while ( (he = hv_iternext(hv)) ) { |
d7c0d282 | 4583 | DEBUG_M(Perl_deb(aTHX_ " testing hash key...\n")); |
d343c3ef | 4584 | ENTER_with_name("smartmatch_hash_key_test"); |
a4a197da RGS |
4585 | SAVETMPS; |
4586 | PUSHMARK(SP); | |
4587 | PUSHs(hv_iterkeysv(he)); | |
4588 | PUTBACK; | |
4589 | c = call_sv(e, G_SCALAR); | |
4590 | SPAGAIN; | |
4591 | if (c == 0) | |
4592 | andedresults = FALSE; | |
4593 | else | |
4594 | andedresults = SvTRUEx(POPs) && andedresults; | |
4595 | FREETMPS; | |
d343c3ef | 4596 | LEAVE_with_name("smartmatch_hash_key_test"); |
a4a197da RGS |
4597 | } |
4598 | if (andedresults) | |
4599 | RETPUSHYES; | |
4600 | else | |
4601 | RETPUSHNO; | |
4602 | } | |
4603 | else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) { | |
4604 | /* Test sub truth for each element */ | |
c70927a6 | 4605 | SSize_t i; |
a4a197da RGS |
4606 | bool andedresults = TRUE; |
4607 | AV *av = (AV*) SvRV(d); | |
b9f2b683 | 4608 | const I32 len = av_tindex(av); |
d7c0d282 | 4609 | DEBUG_M(Perl_deb(aTHX_ " applying rule Array-CodeRef\n")); |
168ff818 | 4610 | if (len == -1) |
07edf497 | 4611 | RETPUSHYES; |
a4a197da RGS |
4612 | for (i = 0; i <= len; ++i) { |
4613 | SV * const * const svp = av_fetch(av, i, FALSE); | |
d7c0d282 | 4614 | DEBUG_M(Perl_deb(aTHX_ " testing array element...\n")); |
d343c3ef | 4615 | ENTER_with_name("smartmatch_array_elem_test"); |
a4a197da RGS |
4616 | SAVETMPS; |
4617 | PUSHMARK(SP); | |
4618 | if (svp) | |
4619 | PUSHs(*svp); | |
4620 | PUTBACK; | |
4621 | c = call_sv(e, G_SCALAR); | |
4622 | SPAGAIN; | |
4623 | if (c == 0) | |
4624 | andedresults = FALSE; | |
4625 | else | |
4626 | andedresults = SvTRUEx(POPs) && andedresults; | |
4627 | FREETMPS; | |
d343c3ef | 4628 | LEAVE_with_name("smartmatch_array_elem_test"); |
a4a197da RGS |
4629 | } |
4630 | if (andedresults) | |
4631 | RETPUSHYES; | |
4632 | else | |
4633 | RETPUSHNO; | |
4634 | } | |
4635 | else { | |
41e726ac | 4636 | sm_any_sub: |
d7c0d282 | 4637 | DEBUG_M(Perl_deb(aTHX_ " applying rule Any-CodeRef\n")); |
d343c3ef | 4638 | ENTER_with_name("smartmatch_coderef"); |
a4a197da RGS |
4639 | SAVETMPS; |
4640 | PUSHMARK(SP); | |
4641 | PUSHs(d); | |
4642 | PUTBACK; | |
4643 | c = call_sv(e, G_SCALAR); | |
4644 | SPAGAIN; | |
4645 | if (c == 0) | |
4646 | PUSHs(&PL_sv_no); | |
4647 | else if (SvTEMP(TOPs)) | |
4648 | SvREFCNT_inc_void(TOPs); | |
4649 | FREETMPS; | |
d343c3ef | 4650 | LEAVE_with_name("smartmatch_coderef"); |
a4a197da RGS |
4651 | RETURN; |
4652 | } | |
0d863452 | 4653 | } |
b0138e99 | 4654 | /* ~~ %hash */ |
61a621c6 | 4655 | else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVHV) { |
41e726ac RGS |
4656 | if (object_on_left) { |
4657 | goto sm_any_hash; /* Treat objects like scalars */ | |
4658 | } | |
4659 | else if (!SvOK(d)) { | |
d7c0d282 | 4660 | DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash ($a undef)\n")); |
61a621c6 RGS |
4661 | RETPUSHNO; |
4662 | } | |
4663 | else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) { | |
0d863452 RH |
4664 | /* Check that the key-sets are identical */ |
4665 | HE *he; | |
61a621c6 | 4666 | HV *other_hv = MUTABLE_HV(SvRV(d)); |
6bb3f245 DD |
4667 | bool tied; |
4668 | bool other_tied; | |
0d863452 RH |
4669 | U32 this_key_count = 0, |
4670 | other_key_count = 0; | |
33ed63a2 | 4671 | HV *hv = MUTABLE_HV(SvRV(e)); |
d7c0d282 DM |
4672 | |
4673 | DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Hash\n")); | |
0d863452 | 4674 | /* Tied hashes don't know how many keys they have. */ |
6bb3f245 DD |
4675 | tied = cBOOL(SvTIED_mg((SV*)hv, PERL_MAGIC_tied)); |
4676 | other_tied = cBOOL(SvTIED_mg((const SV *)other_hv, PERL_MAGIC_tied)); | |
4677 | if (!tied ) { | |
4678 | if(other_tied) { | |
4679 | /* swap HV sides */ | |
4680 | HV * const temp = other_hv; | |
4681 | other_hv = hv; | |
4682 | hv = temp; | |
4683 | tied = TRUE; | |
4684 | other_tied = FALSE; | |
4685 | } | |
4686 | else if(HvUSEDKEYS((const HV *) hv) != HvUSEDKEYS(other_hv)) | |
4687 | RETPUSHNO; | |
0d863452 | 4688 | } |
0d863452 RH |
4689 | |
4690 | /* The hashes have the same number of keys, so it suffices | |
4691 | to check that one is a subset of the other. */ | |
33ed63a2 RGS |
4692 | (void) hv_iterinit(hv); |
4693 | while ( (he = hv_iternext(hv)) ) { | |
b15feb55 | 4694 | SV *key = hv_iterkeysv(he); |
d7c0d282 DM |
4695 | |
4696 | DEBUG_M(Perl_deb(aTHX_ " comparing hash key...\n")); | |
0d863452 RH |
4697 | ++ this_key_count; |
4698 | ||
b15feb55 | 4699 | if(!hv_exists_ent(other_hv, key, 0)) { |
33ed63a2 | 4700 | (void) hv_iterinit(hv); /* reset iterator */ |
0d863452 RH |
4701 | RETPUSHNO; |
4702 | } | |
4703 | } | |
4704 | ||
4705 | if (other_tied) { | |
4706 | (void) hv_iterinit(other_hv); | |
4707 | while ( hv_iternext(other_hv) ) | |
4708 | ++other_key_count; | |
4709 | } | |
4710 | else | |
4711 | other_key_count = HvUSEDKEYS(other_hv); | |
4712 | ||
4713 | if (this_key_count != other_key_count) | |
4714 | RETPUSHNO; | |
4715 | else | |
4716 | RETPUSHYES; | |
4717 | } | |
61a621c6 RGS |
4718 | else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) { |
4719 | AV * const other_av = MUTABLE_AV(SvRV(d)); | |
b9f2b683 | 4720 | const SSize_t other_len = av_tindex(other_av) + 1; |
c70927a6 | 4721 | SSize_t i; |
33ed63a2 | 4722 | HV *hv = MUTABLE_HV(SvRV(e)); |
71b0fb34 | 4723 | |
d7c0d282 | 4724 | DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Hash\n")); |
71b0fb34 | 4725 | for (i = 0; i < other_len; ++i) { |
c445ea15 | 4726 | SV ** const svp = av_fetch(other_av, i, FALSE); |
d7c0d282 | 4727 | DEBUG_M(Perl_deb(aTHX_ " checking for key existence...\n")); |
71b0fb34 | 4728 | if (svp) { /* ??? When can this not happen? */ |
b15feb55 | 4729 | if (hv_exists_ent(hv, *svp, 0)) |
71b0fb34 DK |
4730 | RETPUSHYES; |
4731 | } | |
0d863452 | 4732 | } |
71b0fb34 | 4733 | RETPUSHNO; |
0d863452 | 4734 | } |
a566f585 | 4735 | else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) { |
d7c0d282 | 4736 | DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Hash\n")); |
ea0c2dbd RGS |
4737 | sm_regex_hash: |
4738 | { | |
4739 | PMOP * const matcher = make_matcher((REGEXP*) SvRV(d)); | |
4740 | HE *he; | |
4741 | HV *hv = MUTABLE_HV(SvRV(e)); | |
4742 | ||
4743 | (void) hv_iterinit(hv); | |
4744 | while ( (he = hv_iternext(hv)) ) { | |
d7c0d282 | 4745 | DEBUG_M(Perl_deb(aTHX_ " testing key against pattern...\n")); |
e8fe1b7c | 4746 | PUTBACK; |
ea0c2dbd | 4747 | if (matcher_matches_sv(matcher, hv_iterkeysv(he))) { |
e8fe1b7c | 4748 | SPAGAIN; |
ea0c2dbd RGS |
4749 | (void) hv_iterinit(hv); |
4750 | destroy_matcher(matcher); | |
4751 | RETPUSHYES; | |
4752 | } | |
e8fe1b7c | 4753 | SPAGAIN; |
0d863452 | 4754 | } |
ea0c2dbd RGS |
4755 | destroy_matcher(matcher); |
4756 | RETPUSHNO; | |
0d863452 | 4757 | } |
0d863452 RH |
4758 | } |
4759 | else { | |
41e726ac | 4760 | sm_any_hash: |
d7c0d282 | 4761 | DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Hash\n")); |
61a621c6 | 4762 | if (hv_exists_ent(MUTABLE_HV(SvRV(e)), d, 0)) |
0d863452 RH |
4763 | RETPUSHYES; |
4764 | else | |
4765 | RETPUSHNO; | |
4766 | } | |
4767 | } | |
b0138e99 RGS |
4768 | /* ~~ @array */ |
4769 | else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_PVAV) { | |
41e726ac RGS |
4770 | if (object_on_left) { |
4771 | goto sm_any_array; /* Treat objects like scalars */ | |
4772 | } | |
4773 | else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) { | |
b0138e99 | 4774 | AV * const other_av = MUTABLE_AV(SvRV(e)); |
b9f2b683 | 4775 | const SSize_t other_len = av_tindex(other_av) + 1; |
c70927a6 | 4776 | SSize_t i; |
b0138e99 | 4777 | |
d7c0d282 | 4778 | DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Array\n")); |
b0138e99 RGS |
4779 | for (i = 0; i < other_len; ++i) { |
4780 | SV ** const svp = av_fetch(other_av, i, FALSE); | |
d7c0d282 DM |
4781 | |
4782 | DEBUG_M(Perl_deb(aTHX_ " testing for key existence...\n")); | |
b0138e99 | 4783 | if (svp) { /* ??? When can this not happen? */ |
b15feb55 | 4784 | if (hv_exists_ent(MUTABLE_HV(SvRV(d)), *svp, 0)) |
b0138e99 RGS |
4785 | RETPUSHYES; |
4786 | } | |
4787 | } | |
4788 | RETPUSHNO; | |
4789 | } | |
4790 | if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) { | |
4791 | AV *other_av = MUTABLE_AV(SvRV(d)); | |
d7c0d282 | 4792 | DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Array\n")); |
b9f2b683 | 4793 | if (av_tindex(MUTABLE_AV(SvRV(e))) != av_tindex(other_av)) |
0d863452 RH |
4794 | RETPUSHNO; |
4795 | else { | |
c70927a6 | 4796 | SSize_t i; |
b9f2b683 | 4797 | const SSize_t other_len = av_tindex(other_av); |
0d863452 | 4798 | |
a0714e2c | 4799 | if (NULL == seen_this) { |
0d863452 | 4800 | seen_this = newHV(); |
ad64d0ec | 4801 | (void) sv_2mortal(MUTABLE_SV(seen_this)); |
0d863452 | 4802 | } |
a0714e2c | 4803 | if (NULL == seen_other) { |
6bc991bf | 4804 | seen_other = newHV(); |
ad64d0ec | 4805 | (void) sv_2mortal(MUTABLE_SV(seen_other)); |
0d863452 RH |
4806 | } |
4807 | for(i = 0; i <= other_len; ++i) { | |
b0138e99 | 4808 | SV * const * const this_elem = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE); |
c445ea15 AL |
4809 | SV * const * const other_elem = av_fetch(other_av, i, FALSE); |
4810 | ||
0d863452 | 4811 | if (!this_elem || !other_elem) { |
69c3dccf RGS |
4812 | if ((this_elem && SvOK(*this_elem)) |
4813 | || (other_elem && SvOK(*other_elem))) | |
0d863452 RH |
4814 | RETPUSHNO; |
4815 | } | |
365c4e3d RGS |
4816 | else if (hv_exists_ent(seen_this, |
4817 | sv_2mortal(newSViv(PTR2IV(*this_elem))), 0) || | |
4818 | hv_exists_ent(seen_other, | |
4819 | sv_2mortal(newSViv(PTR2IV(*other_elem))), 0)) | |
0d863452 RH |
4820 | { |
4821 | if (*this_elem != *other_elem) | |
4822 | RETPUSHNO; | |
4823 | } | |
4824 | else { | |
04fe65b0 RGS |
4825 | (void)hv_store_ent(seen_this, |
4826 | sv_2mortal(newSViv(PTR2IV(*this_elem))), | |
4827 | &PL_sv_undef, 0); | |
4828 | (void)hv_store_ent(seen_other, | |
4829 | sv_2mortal(newSViv(PTR2IV(*other_elem))), | |
4830 | &PL_sv_undef, 0); | |
0d863452 | 4831 | PUSHs(*other_elem); |
a566f585 | 4832 | PUSHs(*this_elem); |
0d863452 RH |
4833 | |
4834 | PUTBACK; | |
d7c0d282 | 4835 | DEBUG_M(Perl_deb(aTHX_ " recursively comparing array element...\n")); |
be88a5c3 | 4836 | (void) do_smartmatch(seen_this, seen_other, 0); |
0d863452 | 4837 | SPAGAIN; |
d7c0d282 | 4838 | DEBUG_M(Perl_deb(aTHX_ " recursion finished\n")); |
0d863452 RH |
4839 | |
4840 | if (!SvTRUEx(POPs)) | |
4841 | RETPUSHNO; | |
4842 | } | |
4843 | } | |
4844 | RETPUSHYES; | |
4845 | } | |
4846 | } | |
a566f585 | 4847 | else if (SvROK(d) && SvTYPE(SvRV(d)) == SVt_REGEXP) { |
d7c0d282 | 4848 | DEBUG_M(Perl_deb(aTHX_ " applying rule Regex-Array\n")); |
ea0c2dbd RGS |
4849 | sm_regex_array: |
4850 | { | |
4851 | PMOP * const matcher = make_matcher((REGEXP*) SvRV(d)); | |
b9f2b683 | 4852 | const SSize_t this_len = av_tindex(MUTABLE_AV(SvRV(e))); |
c70927a6 | 4853 | SSize_t i; |
0d863452 | 4854 | |
ea0c2dbd RGS |
4855 | for(i = 0; i <= this_len; ++i) { |
4856 | SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE); | |
d7c0d282 | 4857 | DEBUG_M(Perl_deb(aTHX_ " testing element against pattern...\n")); |
e8fe1b7c | 4858 | PUTBACK; |
ea0c2dbd | 4859 | if (svp && matcher_matches_sv(matcher, *svp)) { |
e8fe1b7c | 4860 | SPAGAIN; |
ea0c2dbd RGS |
4861 | destroy_matcher(matcher); |
4862 | RETPUSHYES; | |
4863 | } | |
e8fe1b7c | 4864 | SPAGAIN; |
0d863452 | 4865 | } |
ea0c2dbd RGS |
4866 | destroy_matcher(matcher); |
4867 | RETPUSHNO; | |
0d863452 | 4868 | } |
0d863452 | 4869 | } |
015eb7b9 RGS |
4870 | else if (!SvOK(d)) { |
4871 | /* undef ~~ array */ | |
b9f2b683 | 4872 | const SSize_t this_len = av_tindex(MUTABLE_AV(SvRV(e))); |
c70927a6 | 4873 | SSize_t i; |
0d863452 | 4874 | |
d7c0d282 | 4875 | DEBUG_M(Perl_deb(aTHX_ " applying rule Undef-Array\n")); |
015eb7b9 | 4876 | for (i = 0; i <= this_len; ++i) { |
b0138e99 | 4877 | SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE); |
d7c0d282 | 4878 | DEBUG_M(Perl_deb(aTHX_ " testing for undef element...\n")); |
015eb7b9 | 4879 | if (!svp || !SvOK(*svp)) |
0d863452 RH |
4880 | RETPUSHYES; |
4881 | } | |
4882 | RETPUSHNO; | |
4883 | } | |
015eb7b9 | 4884 | else { |
41e726ac RGS |
4885 | sm_any_array: |
4886 | { | |
c70927a6 | 4887 | SSize_t i; |
b9f2b683 | 4888 | const SSize_t this_len = av_tindex(MUTABLE_AV(SvRV(e))); |
0d863452 | 4889 | |
d7c0d282 | 4890 | DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Array\n")); |
41e726ac RGS |
4891 | for (i = 0; i <= this_len; ++i) { |
4892 | SV * const * const svp = av_fetch(MUTABLE_AV(SvRV(e)), i, FALSE); | |
4893 | if (!svp) | |
4894 | continue; | |
015eb7b9 | 4895 | |
41e726ac RGS |
4896 | PUSHs(d); |
4897 | PUSHs(*svp); | |
4898 | PUTBACK; | |
4899 | /* infinite recursion isn't supposed to happen here */ | |
d7c0d282 | 4900 | DEBUG_M(Perl_deb(aTHX_ " recursively testing array element...\n")); |
be88a5c3 | 4901 | (void) do_smartmatch(NULL, NULL, 1); |
41e726ac | 4902 | SPAGAIN; |
d7c0d282 | 4903 | DEBUG_M(Perl_deb(aTHX_ " recursion finished\n")); |
41e726ac RGS |
4904 | if (SvTRUEx(POPs)) |
4905 | RETPUSHYES; | |
4906 | } | |
4907 | RETPUSHNO; | |
0d863452 | 4908 | } |
0d863452 RH |
4909 | } |
4910 | } | |
b0138e99 | 4911 | /* ~~ qr// */ |
a566f585 | 4912 | else if (SvROK(e) && SvTYPE(SvRV(e)) == SVt_REGEXP) { |
ea0c2dbd RGS |
4913 | if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVHV) { |
4914 | SV *t = d; d = e; e = t; | |
d7c0d282 | 4915 | DEBUG_M(Perl_deb(aTHX_ " applying rule Hash-Regex\n")); |
ea0c2dbd RGS |
4916 | goto sm_regex_hash; |
4917 | } | |
4918 | else if (!object_on_left && SvROK(d) && SvTYPE(SvRV(d)) == SVt_PVAV) { | |
4919 | SV *t = d; d = e; e = t; | |
d7c0d282 | 4920 | DEBUG_M(Perl_deb(aTHX_ " applying rule Array-Regex\n")); |
ea0c2dbd RGS |
4921 | goto sm_regex_array; |
4922 | } | |
4923 | else { | |
4924 | PMOP * const matcher = make_matcher((REGEXP*) SvRV(e)); | |
e8fe1b7c | 4925 | bool result; |
0d863452 | 4926 | |
d7c0d282 | 4927 | DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Regex\n")); |
ea0c2dbd | 4928 | PUTBACK; |
e8fe1b7c DM |
4929 | result = matcher_matches_sv(matcher, d); |
4930 | SPAGAIN; | |
4931 | PUSHs(result ? &PL_sv_yes : &PL_sv_no); | |
ea0c2dbd RGS |
4932 | destroy_matcher(matcher); |
4933 | RETURN; | |
4934 | } | |
0d863452 | 4935 | } |
b0138e99 | 4936 | /* ~~ scalar */ |
2c9d2554 RGS |
4937 | /* See if there is overload magic on left */ |
4938 | else if (object_on_left && SvAMAGIC(d)) { | |
4939 | SV *tmpsv; | |
d7c0d282 DM |
4940 | DEBUG_M(Perl_deb(aTHX_ " applying rule Object-Any\n")); |
4941 | DEBUG_M(Perl_deb(aTHX_ " attempting overload\n")); | |
2c9d2554 RGS |
4942 | PUSHs(d); PUSHs(e); |
4943 | PUTBACK; | |
4944 | tmpsv = amagic_call(d, e, smart_amg, AMGf_noright); | |
4945 | if (tmpsv) { | |
4946 | SPAGAIN; | |
4947 | (void)POPs; | |
4948 | SETs(tmpsv); | |
4949 | RETURN; | |
4950 | } | |
4951 | SP -= 2; | |
d7c0d282 | 4952 | DEBUG_M(Perl_deb(aTHX_ " failed to run overload method; falling back...\n")); |
2c9d2554 RGS |
4953 | goto sm_any_scalar; |
4954 | } | |
fb51372e RGS |
4955 | else if (!SvOK(d)) { |
4956 | /* undef ~~ scalar ; we already know that the scalar is SvOK */ | |
d7c0d282 | 4957 | DEBUG_M(Perl_deb(aTHX_ " applying rule undef-Any\n")); |
fb51372e RGS |
4958 | RETPUSHNO; |
4959 | } | |
2c9d2554 RGS |
4960 | else |
4961 | sm_any_scalar: | |
4962 | if (SvNIOK(e) || (SvPOK(e) && looks_like_number(e) && SvNIOK(d))) { | |
d7c0d282 DM |
4963 | DEBUG_M(if (SvNIOK(e)) |
4964 | Perl_deb(aTHX_ " applying rule Any-Num\n"); | |
4965 | else | |
4966 | Perl_deb(aTHX_ " applying rule Num-numish\n"); | |
4967 | ); | |
33ed63a2 | 4968 | /* numeric comparison */ |
0d863452 RH |
4969 | PUSHs(d); PUSHs(e); |
4970 | PUTBACK; | |
a98fe34d | 4971 | if (CopHINTS_get(PL_curcop) & HINT_INTEGER) |
897d3989 | 4972 | (void) Perl_pp_i_eq(aTHX); |
0d863452 | 4973 | else |
897d3989 | 4974 | (void) Perl_pp_eq(aTHX); |
0d863452 RH |
4975 | SPAGAIN; |
4976 | if (SvTRUEx(POPs)) | |
4977 | RETPUSHYES; | |
4978 | else | |
4979 | RETPUSHNO; | |
4980 | } | |
4981 | ||
4982 | /* As a last resort, use string comparison */ | |
d7c0d282 | 4983 | DEBUG_M(Perl_deb(aTHX_ " applying rule Any-Any\n")); |
0d863452 RH |
4984 | PUSHs(d); PUSHs(e); |
4985 | PUTBACK; | |
897d3989 | 4986 | return Perl_pp_seq(aTHX); |
0d863452 RH |
4987 | } |
4988 | ||
4989 | PP(pp_enterwhen) | |
4990 | { | |
20b7effb | 4991 | dSP; |
eb578fdb | 4992 | PERL_CONTEXT *cx; |
1c23e2bd | 4993 | const U8 gimme = GIMME_V; |
0d863452 RH |
4994 | |
4995 | /* This is essentially an optimization: if the match | |
4996 | fails, we don't want to push a context and then | |
4997 | pop it again right away, so we skip straight | |
4998 | to the op that follows the leavewhen. | |
25b991bf | 4999 | RETURNOP calls PUTBACK which restores the stack pointer after the POPs. |
0d863452 | 5000 | */ |
d4ce7588 | 5001 | if (!(PL_op->op_flags & OPf_SPECIAL) && !SvTRUEx(POPs)) |
25b991bf | 5002 | RETURNOP(cLOGOP->op_other->op_next); |
0d863452 | 5003 | |
ed8ff0f3 | 5004 | cx = cx_pushblock(CXt_WHEN, gimme, SP, PL_savestack_ix); |
2a7b7c61 | 5005 | cx_pushwhen(cx); |
0d863452 RH |
5006 | |
5007 | RETURN; | |
5008 | } | |
5009 | ||
5010 | PP(pp_leavewhen) | |
5011 | { | |
c08f093b | 5012 | I32 cxix; |
eb578fdb | 5013 | PERL_CONTEXT *cx; |
1c23e2bd | 5014 | U8 gimme; |
f5ddd604 | 5015 | SV **oldsp; |
8aef2117 | 5016 | |
4ebe6e95 | 5017 | cx = CX_CUR(); |
8aef2117 DM |
5018 | assert(CxTYPE(cx) == CXt_WHEN); |
5019 | gimme = cx->blk_gimme; | |
0d863452 | 5020 | |
97f2561e | 5021 | cxix = dopoptogivenfor(cxstack_ix); |
c08f093b | 5022 | if (cxix < 0) |
fc7debfb FC |
5023 | /* diag_listed_as: Can't "when" outside a topicalizer */ |
5024 | DIE(aTHX_ "Can't \"%s\" outside a topicalizer", | |
5025 | PL_op->op_flags & OPf_SPECIAL ? "default" : "when"); | |
c08f093b | 5026 | |
f5ddd604 | 5027 | oldsp = PL_stack_base + cx->blk_oldsp; |
0663a8f8 | 5028 | if (gimme == G_VOID) |
f5ddd604 | 5029 | PL_stack_sp = oldsp; |
0663a8f8 | 5030 | else |
f5ddd604 | 5031 | leave_adjust_stacks(oldsp, oldsp, gimme, 1); |
75bc488d | 5032 | |
8aef2117 DM |
5033 | /* pop the WHEN, BLOCK and anything else before the GIVEN/FOR */ |
5034 | assert(cxix < cxstack_ix); | |
5035 | dounwind(cxix); | |
c08f093b VP |
5036 | |
5037 | cx = &cxstack[cxix]; | |
5038 | ||
5039 | if (CxFOREACH(cx)) { | |
590529d8 DM |
5040 | /* emulate pp_next. Note that any stack(s) cleanup will be |
5041 | * done by the pp_unstack which op_nextop should point to */ | |
7e637ba4 | 5042 | cx = CX_CUR(); |
ed8ff0f3 | 5043 | cx_topblock(cx); |
c08f093b | 5044 | PL_curcop = cx->blk_oldcop; |
c08f093b VP |
5045 | return cx->blk_loop.my_op->op_nextop; |
5046 | } | |
47c9d59f NC |
5047 | else { |
5048 | PERL_ASYNC_CHECK(); | |
8aef2117 | 5049 | assert(cx->blk_givwhen.leave_op->op_type == OP_LEAVEGIVEN); |
0663a8f8 | 5050 | return cx->blk_givwhen.leave_op; |
47c9d59f | 5051 | } |
0d863452 RH |
5052 | } |
5053 | ||
5054 | PP(pp_continue) | |
5055 | { | |
0d863452 | 5056 | I32 cxix; |
eb578fdb | 5057 | PERL_CONTEXT *cx; |
5da525e9 | 5058 | OP *nextop; |
0d863452 RH |
5059 | |
5060 | cxix = dopoptowhen(cxstack_ix); | |
5061 | if (cxix < 0) | |
5062 | DIE(aTHX_ "Can't \"continue\" outside a when block"); | |
c08f093b | 5063 | |
0d863452 RH |
5064 | if (cxix < cxstack_ix) |
5065 | dounwind(cxix); | |
5066 | ||
4ebe6e95 | 5067 | cx = CX_CUR(); |
c08f093b | 5068 | assert(CxTYPE(cx) == CXt_WHEN); |
4df352a8 | 5069 | PL_stack_sp = PL_stack_base + cx->blk_oldsp; |
2f450c1b | 5070 | CX_LEAVE_SCOPE(cx); |
2a7b7c61 | 5071 | cx_popwhen(cx); |
ed8ff0f3 | 5072 | cx_popblock(cx); |
5da525e9 DM |
5073 | nextop = cx->blk_givwhen.leave_op->op_next; |
5074 | CX_POP(cx); | |
c08f093b | 5075 | |
5da525e9 | 5076 | return nextop; |
0d863452 RH |
5077 | } |
5078 | ||
5079 | PP(pp_break) | |
5080 | { | |
0d863452 | 5081 | I32 cxix; |
eb578fdb | 5082 | PERL_CONTEXT *cx; |
25b991bf | 5083 | |
97f2561e | 5084 | cxix = dopoptogivenfor(cxstack_ix); |
c08f093b VP |
5085 | if (cxix < 0) |
5086 | DIE(aTHX_ "Can't \"break\" outside a given block"); | |
5087 | ||
5088 | cx = &cxstack[cxix]; | |
5089 | if (CxFOREACH(cx)) | |
0d863452 RH |
5090 | DIE(aTHX_ "Can't \"break\" in a loop topicalizer"); |
5091 | ||
5092 | if (cxix < cxstack_ix) | |
5093 | dounwind(cxix); | |
0d863452 | 5094 | |
0787ea8a | 5095 | /* Restore the sp at the time we entered the given block */ |
7e637ba4 | 5096 | cx = CX_CUR(); |
7e09e582 | 5097 | PL_stack_sp = PL_stack_base + cx->blk_oldsp; |
0787ea8a | 5098 | |
c08f093b | 5099 | return cx->blk_givwhen.leave_op; |
0d863452 RH |
5100 | } |
5101 | ||
74e0ddf7 | 5102 | static MAGIC * |
cea2e8a9 | 5103 | S_doparseform(pTHX_ SV *sv) |
a0d0e21e LW |
5104 | { |
5105 | STRLEN len; | |
eb578fdb KW |
5106 | char *s = SvPV(sv, len); |
5107 | char *send; | |
5108 | char *base = NULL; /* start of current field */ | |
5109 | I32 skipspaces = 0; /* number of contiguous spaces seen */ | |
086b26f3 DM |
5110 | bool noblank = FALSE; /* ~ or ~~ seen on this line */ |
5111 | bool repeat = FALSE; /* ~~ seen on this line */ | |
5112 | bool postspace = FALSE; /* a text field may need right padding */ | |
dea28490 | 5113 | U32 *fops; |
eb578fdb | 5114 | U32 *fpc; |
086b26f3 | 5115 | U32 *linepc = NULL; /* position of last FF_LINEMARK */ |
eb578fdb | 5116 | I32 arg; |
086b26f3 DM |
5117 | bool ischop; /* it's a ^ rather than a @ */ |
5118 | bool unchopnum = FALSE; /* at least one @ (i.e. non-chop) num field seen */ | |
a1b95068 | 5119 | int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */ |
3808a683 DM |
5120 | MAGIC *mg = NULL; |
5121 | SV *sv_copy; | |
a0d0e21e | 5122 | |
7918f24d NC |
5123 | PERL_ARGS_ASSERT_DOPARSEFORM; |
5124 | ||
55497cff | 5125 | if (len == 0) |
cea2e8a9 | 5126 | Perl_croak(aTHX_ "Null picture in formline"); |
ac27b0f5 | 5127 | |
3808a683 DM |
5128 | if (SvTYPE(sv) >= SVt_PVMG) { |
5129 | /* This might, of course, still return NULL. */ | |
5130 | mg = mg_find(sv, PERL_MAGIC_fm); | |
5131 | } else { | |
5132 | sv_upgrade(sv, SVt_PVMG); | |
5133 | } | |
5134 | ||
5135 | if (mg) { | |
5136 | /* still the same as previously-compiled string? */ | |
5137 | SV *old = mg->mg_obj; | |
5138 | if ( !(!!SvUTF8(old) ^ !!SvUTF8(sv)) | |
5139 | && len == SvCUR(old) | |
5140 | && strnEQ(SvPVX(old), SvPVX(sv), len) | |
b57b1734 DM |
5141 | ) { |
5142 | DEBUG_f(PerlIO_printf(Perl_debug_log,"Re-using compiled format\n")); | |
3808a683 | 5143 | return mg; |
b57b1734 | 5144 | } |
3808a683 | 5145 | |
b57b1734 | 5146 | DEBUG_f(PerlIO_printf(Perl_debug_log, "Re-compiling format\n")); |
3808a683 DM |
5147 | Safefree(mg->mg_ptr); |
5148 | mg->mg_ptr = NULL; | |
5149 | SvREFCNT_dec(old); | |
5150 | mg->mg_obj = NULL; | |
5151 | } | |
b57b1734 DM |
5152 | else { |
5153 | DEBUG_f(PerlIO_printf(Perl_debug_log, "Compiling format\n")); | |
3808a683 | 5154 | mg = sv_magicext(sv, NULL, PERL_MAGIC_fm, &PL_vtbl_fm, NULL, 0); |
b57b1734 | 5155 | } |
3808a683 DM |
5156 | |
5157 | sv_copy = newSVpvn_utf8(s, len, SvUTF8(sv)); | |
5158 | s = SvPV(sv_copy, len); /* work on the copy, not the original */ | |
5159 | send = s + len; | |
5160 | ||
5161 | ||
815f25c6 DM |
5162 | /* estimate the buffer size needed */ |
5163 | for (base = s; s <= send; s++) { | |
a1b95068 | 5164 | if (*s == '\n' || *s == '@' || *s == '^') |
815f25c6 DM |
5165 | maxops += 10; |
5166 | } | |
5167 | s = base; | |
c445ea15 | 5168 | base = NULL; |
815f25c6 | 5169 | |
a02a5408 | 5170 | Newx(fops, maxops, U32); |
a0d0e21e LW |
5171 | fpc = fops; |
5172 | ||
5173 | if (s < send) { | |
5174 | linepc = fpc; | |
5175 | *fpc++ = FF_LINEMARK; | |
5176 | noblank = repeat = FALSE; | |
5177 | base = s; | |
5178 | } | |
5179 | ||
5180 | while (s <= send) { | |
5181 | switch (*s++) { | |
5182 | default: | |
5183 | skipspaces = 0; | |
5184 | continue; | |
5185 | ||
5186 | case '~': | |
5187 | if (*s == '~') { | |
5188 | repeat = TRUE; | |
b57b1734 DM |
5189 | skipspaces++; |
5190 | s++; | |
a0d0e21e LW |
5191 | } |
5192 | noblank = TRUE; | |
924ba076 | 5193 | /* FALLTHROUGH */ |
a0d0e21e LW |
5194 | case ' ': case '\t': |
5195 | skipspaces++; | |
5196 | continue; | |
a1b95068 WL |
5197 | case 0: |
5198 | if (s < send) { | |
5199 | skipspaces = 0; | |
5200 | continue; | |
5201 | } /* else FALL THROUGH */ | |
5202 | case '\n': | |
a0d0e21e LW |
5203 | arg = s - base; |
5204 | skipspaces++; | |
5205 | arg -= skipspaces; | |
5206 | if (arg) { | |
5f05dabc | 5207 | if (postspace) |
a0d0e21e | 5208 | *fpc++ = FF_SPACE; |
a0d0e21e | 5209 | *fpc++ = FF_LITERAL; |
76912796 | 5210 | *fpc++ = (U32)arg; |
a0d0e21e | 5211 | } |
5f05dabc | 5212 | postspace = FALSE; |
a0d0e21e LW |
5213 | if (s <= send) |
5214 | skipspaces--; | |
5215 | if (skipspaces) { | |
5216 | *fpc++ = FF_SKIP; | |
76912796 | 5217 | *fpc++ = (U32)skipspaces; |
a0d0e21e LW |
5218 | } |
5219 | skipspaces = 0; | |
5220 | if (s <= send) | |
5221 | *fpc++ = FF_NEWLINE; | |
5222 | if (noblank) { | |
5223 | *fpc++ = FF_BLANK; | |
5224 | if (repeat) | |
5225 | arg = fpc - linepc + 1; | |
5226 | else | |
5227 | arg = 0; | |
76912796 | 5228 | *fpc++ = (U32)arg; |
a0d0e21e LW |
5229 | } |
5230 | if (s < send) { | |
5231 | linepc = fpc; | |
5232 | *fpc++ = FF_LINEMARK; | |
5233 | noblank = repeat = FALSE; | |
5234 | base = s; | |
5235 | } | |
5236 | else | |
5237 | s++; | |
5238 | continue; | |
5239 | ||
5240 | case '@': | |
5241 | case '^': | |
5242 | ischop = s[-1] == '^'; | |
5243 | ||
5244 | if (postspace) { | |
5245 | *fpc++ = FF_SPACE; | |
5246 | postspace = FALSE; | |
5247 | } | |
5248 | arg = (s - base) - 1; | |
5249 | if (arg) { | |
5250 | *fpc++ = FF_LITERAL; | |
76912796 | 5251 | *fpc++ = (U32)arg; |
a0d0e21e LW |
5252 | } |
5253 | ||
5254 | base = s - 1; | |
5255 | *fpc++ = FF_FETCH; | |
086b26f3 | 5256 | if (*s == '*') { /* @* or ^* */ |
a0d0e21e | 5257 | s++; |
a1b95068 WL |
5258 | *fpc++ = 2; /* skip the @* or ^* */ |
5259 | if (ischop) { | |
5260 | *fpc++ = FF_LINESNGL; | |
5261 | *fpc++ = FF_CHOP; | |
5262 | } else | |
5263 | *fpc++ = FF_LINEGLOB; | |
a0d0e21e | 5264 | } |
086b26f3 | 5265 | else if (*s == '#' || (*s == '.' && s[1] == '#')) { /* @###, ^### */ |
a701009a | 5266 | arg = ischop ? FORM_NUM_BLANK : 0; |
a0d0e21e LW |
5267 | base = s - 1; |
5268 | while (*s == '#') | |
5269 | s++; | |
5270 | if (*s == '.') { | |
06b5626a | 5271 | const char * const f = ++s; |
a0d0e21e LW |
5272 | while (*s == '#') |
5273 | s++; | |
a701009a | 5274 | arg |= FORM_NUM_POINT + (s - f); |
a0d0e21e LW |
5275 | } |
5276 | *fpc++ = s - base; /* fieldsize for FETCH */ | |
5277 | *fpc++ = FF_DECIMAL; | |
76912796 | 5278 | *fpc++ = (U32)arg; |
a1b95068 | 5279 | unchopnum |= ! ischop; |
784707d5 JP |
5280 | } |
5281 | else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */ | |
a701009a | 5282 | arg = ischop ? FORM_NUM_BLANK : 0; |
784707d5 JP |
5283 | base = s - 1; |
5284 | s++; /* skip the '0' first */ | |
5285 | while (*s == '#') | |
5286 | s++; | |
5287 | if (*s == '.') { | |
06b5626a | 5288 | const char * const f = ++s; |
784707d5 JP |
5289 | while (*s == '#') |
5290 | s++; | |
a701009a | 5291 | arg |= FORM_NUM_POINT + (s - f); |
784707d5 JP |
5292 | } |
5293 | *fpc++ = s - base; /* fieldsize for FETCH */ | |
5294 | *fpc++ = FF_0DECIMAL; | |
76912796 | 5295 | *fpc++ = (U32)arg; |
a1b95068 | 5296 | unchopnum |= ! ischop; |
a0d0e21e | 5297 | } |
086b26f3 | 5298 | else { /* text field */ |
a0d0e21e LW |
5299 | I32 prespace = 0; |
5300 | bool ismore = FALSE; | |
5301 | ||
5302 | if (*s == '>') { | |
5303 | while (*++s == '>') ; | |
5304 | prespace = FF_SPACE; | |
5305 | } | |
5306 | else if (*s == '|') { | |
5307 | while (*++s == '|') ; | |
5308 | prespace = FF_HALFSPACE; | |
5309 | postspace = TRUE; | |
5310 | } | |
5311 | else { | |
5312 | if (*s == '<') | |
5313 | while (*++s == '<') ; | |
5314 | postspace = TRUE; | |
5315 | } | |
5316 | if (*s == '.' && s[1] == '.' && s[2] == '.') { | |
5317 | s += 3; | |
5318 | ismore = TRUE; | |
5319 | } | |
5320 | *fpc++ = s - base; /* fieldsize for FETCH */ | |
5321 | ||
5322 | *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL; | |
5323 | ||
5324 | if (prespace) | |
76912796 | 5325 | *fpc++ = (U32)prespace; /* add SPACE or HALFSPACE */ |
a0d0e21e LW |
5326 | *fpc++ = FF_ITEM; |
5327 | if (ismore) | |
5328 | *fpc++ = FF_MORE; | |
5329 | if (ischop) | |
5330 | *fpc++ = FF_CHOP; | |
5331 | } | |
5332 | base = s; | |
5333 | skipspaces = 0; | |
5334 | continue; | |
5335 | } | |
5336 | } | |
5337 | *fpc++ = FF_END; | |
5338 | ||
815f25c6 | 5339 | assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */ |
a0d0e21e | 5340 | arg = fpc - fops; |
74e0ddf7 | 5341 | |
3808a683 | 5342 | mg->mg_ptr = (char *) fops; |
74e0ddf7 | 5343 | mg->mg_len = arg * sizeof(U32); |
3808a683 DM |
5344 | mg->mg_obj = sv_copy; |
5345 | mg->mg_flags |= MGf_REFCOUNTED; | |
a1b95068 | 5346 | |
bfed75c6 | 5347 | if (unchopnum && repeat) |
75f63940 | 5348 | Perl_die(aTHX_ "Repeated format line will never terminate (~~ and @#)"); |
74e0ddf7 NC |
5349 | |
5350 | return mg; | |
a1b95068 WL |
5351 | } |
5352 | ||
5353 | ||
5354 | STATIC bool | |
5355 | S_num_overflow(NV value, I32 fldsize, I32 frcsize) | |
5356 | { | |
5357 | /* Can value be printed in fldsize chars, using %*.*f ? */ | |
5358 | NV pwr = 1; | |
5359 | NV eps = 0.5; | |
5360 | bool res = FALSE; | |
5361 | int intsize = fldsize - (value < 0 ? 1 : 0); | |
5362 | ||
a701009a | 5363 | if (frcsize & FORM_NUM_POINT) |
a1b95068 | 5364 | intsize--; |
a701009a | 5365 | frcsize &= ~(FORM_NUM_POINT|FORM_NUM_BLANK); |
a1b95068 WL |
5366 | intsize -= frcsize; |
5367 | ||
5368 | while (intsize--) pwr *= 10.0; | |
5369 | while (frcsize--) eps /= 10.0; | |
5370 | ||
5371 | if( value >= 0 ){ | |
5372 | if (value + eps >= pwr) | |
5373 | res = TRUE; | |
5374 | } else { | |
5375 | if (value - eps <= -pwr) | |
5376 | res = TRUE; | |
5377 | } | |
5378 | return res; | |
a0d0e21e | 5379 | } |
4e35701f | 5380 | |
bbed91b5 | 5381 | static I32 |
0bd48802 | 5382 | S_run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen) |
bbed91b5 | 5383 | { |
0bd48802 | 5384 | SV * const datasv = FILTER_DATA(idx); |
504618e9 | 5385 | const int filter_has_file = IoLINES(datasv); |
ad64d0ec NC |
5386 | SV * const filter_state = MUTABLE_SV(IoTOP_GV(datasv)); |
5387 | SV * const filter_sub = MUTABLE_SV(IoBOTTOM_GV(datasv)); | |
941a98a0 | 5388 | int status = 0; |
ec0b63d7 | 5389 | SV *upstream; |
941a98a0 | 5390 | STRLEN got_len; |
162177c1 Z |
5391 | char *got_p = NULL; |
5392 | char *prune_from = NULL; | |
34113e50 | 5393 | bool read_from_cache = FALSE; |
bb7a0f54 | 5394 | STRLEN umaxlen; |
d60d2019 | 5395 | SV *err = NULL; |
bb7a0f54 | 5396 | |
7918f24d NC |
5397 | PERL_ARGS_ASSERT_RUN_USER_FILTER; |
5398 | ||
bb7a0f54 MHM |
5399 | assert(maxlen >= 0); |
5400 | umaxlen = maxlen; | |
5675696b | 5401 | |
bbed91b5 | 5402 | /* I was having segfault trouble under Linux 2.2.5 after a |
f6bab5f6 | 5403 | parse error occurred. (Had to hack around it with a test |
13765c85 | 5404 | for PL_parser->error_count == 0.) Solaris doesn't segfault -- |
bbed91b5 KF |
5405 | not sure where the trouble is yet. XXX */ |
5406 | ||
4464f08e NC |
5407 | { |
5408 | SV *const cache = datasv; | |
937b367d NC |
5409 | if (SvOK(cache)) { |
5410 | STRLEN cache_len; | |
5411 | const char *cache_p = SvPV(cache, cache_len); | |
941a98a0 NC |
5412 | STRLEN take = 0; |
5413 | ||
bb7a0f54 | 5414 | if (umaxlen) { |
941a98a0 NC |
5415 | /* Running in block mode and we have some cached data already. |
5416 | */ | |
bb7a0f54 | 5417 | if (cache_len >= umaxlen) { |
941a98a0 NC |
5418 | /* In fact, so much data we don't even need to call |
5419 | filter_read. */ | |
bb7a0f54 | 5420 | take = umaxlen; |
941a98a0 NC |
5421 | } |
5422 | } else { | |
10edeb5d JH |
5423 | const char *const first_nl = |
5424 | (const char *)memchr(cache_p, '\n', cache_len); | |
941a98a0 NC |
5425 | if (first_nl) { |
5426 | take = first_nl + 1 - cache_p; | |
5427 | } | |
5428 | } | |
5429 | if (take) { | |
5430 | sv_catpvn(buf_sv, cache_p, take); | |
5431 | sv_chop(cache, cache_p + take); | |
486ec47a | 5432 | /* Definitely not EOF */ |
937b367d NC |
5433 | return 1; |
5434 | } | |
941a98a0 | 5435 | |
937b367d | 5436 | sv_catsv(buf_sv, cache); |
bb7a0f54 MHM |
5437 | if (umaxlen) { |
5438 | umaxlen -= cache_len; | |
941a98a0 | 5439 | } |
937b367d | 5440 | SvOK_off(cache); |
34113e50 | 5441 | read_from_cache = TRUE; |
937b367d NC |
5442 | } |
5443 | } | |
ec0b63d7 | 5444 | |
34113e50 NC |
5445 | /* Filter API says that the filter appends to the contents of the buffer. |
5446 | Usually the buffer is "", so the details don't matter. But if it's not, | |
5447 | then clearly what it contains is already filtered by this filter, so we | |
5448 | don't want to pass it in a second time. | |
5449 | I'm going to use a mortal in case the upstream filter croaks. */ | |
ec0b63d7 NC |
5450 | upstream = ((SvOK(buf_sv) && sv_len(buf_sv)) || SvGMAGICAL(buf_sv)) |
5451 | ? sv_newmortal() : buf_sv; | |
5452 | SvUPGRADE(upstream, SVt_PV); | |
937b367d | 5453 | |
bbed91b5 | 5454 | if (filter_has_file) { |
67e70b33 | 5455 | status = FILTER_READ(idx+1, upstream, 0); |
bbed91b5 KF |
5456 | } |
5457 | ||
34113e50 | 5458 | if (filter_sub && status >= 0) { |
39644a26 | 5459 | dSP; |
bbed91b5 KF |
5460 | int count; |
5461 | ||
d343c3ef | 5462 | ENTER_with_name("call_filter_sub"); |
55b5114f | 5463 | SAVE_DEFSV; |
bbed91b5 KF |
5464 | SAVETMPS; |
5465 | EXTEND(SP, 2); | |
5466 | ||
414bf5ae | 5467 | DEFSV_set(upstream); |
bbed91b5 | 5468 | PUSHMARK(SP); |
6e449a3a | 5469 | mPUSHi(0); |
bbed91b5 KF |
5470 | if (filter_state) { |
5471 | PUSHs(filter_state); | |
5472 | } | |
5473 | PUTBACK; | |
d60d2019 | 5474 | count = call_sv(filter_sub, G_SCALAR|G_EVAL); |
bbed91b5 KF |
5475 | SPAGAIN; |
5476 | ||
5477 | if (count > 0) { | |
5478 | SV *out = POPs; | |
2e8409ad | 5479 | SvGETMAGIC(out); |
bbed91b5 | 5480 | if (SvOK(out)) { |
941a98a0 | 5481 | status = SvIV(out); |
bbed91b5 | 5482 | } |
eed484f9 DD |
5483 | else { |
5484 | SV * const errsv = ERRSV; | |
5485 | if (SvTRUE_NN(errsv)) | |
5486 | err = newSVsv(errsv); | |
d60d2019 | 5487 | } |
bbed91b5 KF |
5488 | } |
5489 | ||
5490 | PUTBACK; | |
5491 | FREETMPS; | |
d343c3ef | 5492 | LEAVE_with_name("call_filter_sub"); |
bbed91b5 KF |
5493 | } |
5494 | ||
536ac391 FC |
5495 | if (SvGMAGICAL(upstream)) { |
5496 | mg_get(upstream); | |
5497 | if (upstream == buf_sv) mg_free(buf_sv); | |
5498 | } | |
b68108d9 | 5499 | if (SvIsCOW(upstream)) sv_force_normal(upstream); |
d60d2019 | 5500 | if(!err && SvOK(upstream)) { |
536ac391 | 5501 | got_p = SvPV_nomg(upstream, got_len); |
bb7a0f54 MHM |
5502 | if (umaxlen) { |
5503 | if (got_len > umaxlen) { | |
5504 | prune_from = got_p + umaxlen; | |
937b367d | 5505 | } |
941a98a0 | 5506 | } else { |
162177c1 | 5507 | char *const first_nl = (char *)memchr(got_p, '\n', got_len); |
941a98a0 NC |
5508 | if (first_nl && first_nl + 1 < got_p + got_len) { |
5509 | /* There's a second line here... */ | |
5510 | prune_from = first_nl + 1; | |
937b367d | 5511 | } |
937b367d NC |
5512 | } |
5513 | } | |
d60d2019 | 5514 | if (!err && prune_from) { |
941a98a0 NC |
5515 | /* Oh. Too long. Stuff some in our cache. */ |
5516 | STRLEN cached_len = got_p + got_len - prune_from; | |
4464f08e | 5517 | SV *const cache = datasv; |
941a98a0 | 5518 | |
4464f08e | 5519 | if (SvOK(cache)) { |
941a98a0 NC |
5520 | /* Cache should be empty. */ |
5521 | assert(!SvCUR(cache)); | |
5522 | } | |
5523 | ||
5524 | sv_setpvn(cache, prune_from, cached_len); | |
5525 | /* If you ask for block mode, you may well split UTF-8 characters. | |
5526 | "If it breaks, you get to keep both parts" | |
5527 | (Your code is broken if you don't put them back together again | |
5528 | before something notices.) */ | |
5529 | if (SvUTF8(upstream)) { | |
5530 | SvUTF8_on(cache); | |
5531 | } | |
00752fe1 FC |
5532 | if (SvPOK(upstream)) SvCUR_set(upstream, got_len - cached_len); |
5533 | else | |
5534 | /* Cannot just use sv_setpvn, as that could free the buffer | |
5535 | before we have a chance to assign it. */ | |
5536 | sv_usepvn(upstream, savepvn(got_p, got_len - cached_len), | |
5537 | got_len - cached_len); | |
162177c1 | 5538 | *prune_from = 0; |
941a98a0 NC |
5539 | /* Can't yet be EOF */ |
5540 | if (status == 0) | |
5541 | status = 1; | |
5542 | } | |
937b367d | 5543 | |
34113e50 NC |
5544 | /* If they are at EOF but buf_sv has something in it, then they may never |
5545 | have touched the SV upstream, so it may be undefined. If we naively | |
5546 | concatenate it then we get a warning about use of uninitialised value. | |
5547 | */ | |
d60d2019 | 5548 | if (!err && upstream != buf_sv && |
dc423e96 | 5549 | SvOK(upstream)) { |
536ac391 | 5550 | sv_catsv_nomg(buf_sv, upstream); |
937b367d | 5551 | } |
ae2c96ed | 5552 | else if (SvOK(upstream)) (void)SvPV_force_nolen(buf_sv); |
937b367d | 5553 | |
941a98a0 | 5554 | if (status <= 0) { |
bbed91b5 | 5555 | IoLINES(datasv) = 0; |
bbed91b5 KF |
5556 | if (filter_state) { |
5557 | SvREFCNT_dec(filter_state); | |
a0714e2c | 5558 | IoTOP_GV(datasv) = NULL; |
bbed91b5 KF |
5559 | } |
5560 | if (filter_sub) { | |
5561 | SvREFCNT_dec(filter_sub); | |
a0714e2c | 5562 | IoBOTTOM_GV(datasv) = NULL; |
bbed91b5 | 5563 | } |
0bd48802 | 5564 | filter_del(S_run_user_filter); |
bbed91b5 | 5565 | } |
d60d2019 JL |
5566 | |
5567 | if (err) | |
5568 | croak_sv(err); | |
5569 | ||
34113e50 NC |
5570 | if (status == 0 && read_from_cache) { |
5571 | /* If we read some data from the cache (and by getting here it implies | |
5572 | that we emptied the cache) then we aren't yet at EOF, and mustn't | |
5573 | report that to our caller. */ | |
5574 | return 1; | |
5575 | } | |
941a98a0 | 5576 | return status; |
bbed91b5 | 5577 | } |
84d4ea48 | 5578 | |
241d1a3b | 5579 | /* |
14d04a33 | 5580 | * ex: set ts=8 sts=4 sw=4 et: |
37442d52 | 5581 | */ |