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