Commit | Line | Data |
---|---|---|
a0d0e21e LW |
1 | /* pp_hot.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 | /* | |
12 | * Then he heard Merry change the note, and up went the Horn-cry of Buckland, | |
13 | * shaking the air. | |
14 | * | |
4ac71550 TC |
15 | * Awake! Awake! Fear, Fire, Foes! Awake! |
16 | * Fire, Foes! Awake! | |
17 | * | |
18 | * [p.1007 of _The Lord of the Rings_, VI/viii: "The Scouring of the Shire"] | |
a0d0e21e LW |
19 | */ |
20 | ||
166f8a29 DM |
21 | /* This file contains 'hot' pp ("push/pop") functions that |
22 | * execute the opcodes that make up a perl program. A typical pp function | |
23 | * expects to find its arguments on the stack, and usually pushes its | |
24 | * results onto the stack, hence the 'pp' terminology. Each OP structure | |
25 | * contains a pointer to the relevant pp_foo() function. | |
26 | * | |
27 | * By 'hot', we mean common ops whose execution speed is critical. | |
28 | * By gathering them together into a single file, we encourage | |
29 | * CPU cache hits on hot code. Also it could be taken as a warning not to | |
30 | * change any code in this file unless you're sure it won't affect | |
31 | * performance. | |
32 | */ | |
33 | ||
a0d0e21e | 34 | #include "EXTERN.h" |
864dbfa3 | 35 | #define PERL_IN_PP_HOT_C |
a0d0e21e LW |
36 | #include "perl.h" |
37 | ||
38 | /* Hot code. */ | |
39 | ||
40 | PP(pp_const) | |
41 | { | |
39644a26 | 42 | dSP; |
996c9baa | 43 | XPUSHs(cSVOP_sv); |
a0d0e21e LW |
44 | RETURN; |
45 | } | |
46 | ||
47 | PP(pp_nextstate) | |
48 | { | |
533c011a | 49 | PL_curcop = (COP*)PL_op; |
a0d0e21e | 50 | TAINT_NOT; /* Each statement is presumed innocent */ |
3280af22 | 51 | PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; |
a0d0e21e | 52 | FREETMPS; |
f410a211 | 53 | PERL_ASYNC_CHECK(); |
a0d0e21e LW |
54 | return NORMAL; |
55 | } | |
56 | ||
57 | PP(pp_gvsv) | |
58 | { | |
39644a26 | 59 | dSP; |
924508f0 | 60 | EXTEND(SP,1); |
5d9574c1 | 61 | if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) |
1d7c1841 | 62 | PUSHs(save_scalar(cGVOP_gv)); |
a0d0e21e | 63 | else |
c69033f2 | 64 | PUSHs(GvSVn(cGVOP_gv)); |
a0d0e21e LW |
65 | RETURN; |
66 | } | |
67 | ||
b1c05ba5 DM |
68 | |
69 | /* also used for: pp_lineseq() pp_regcmaybe() pp_scalar() pp_scope() */ | |
70 | ||
a0d0e21e LW |
71 | PP(pp_null) |
72 | { | |
73 | return NORMAL; | |
74 | } | |
75 | ||
3dd9d4e4 FC |
76 | /* This is sometimes called directly by pp_coreargs, pp_grepstart and |
77 | amagic_call. */ | |
a0d0e21e LW |
78 | PP(pp_pushmark) |
79 | { | |
3280af22 | 80 | PUSHMARK(PL_stack_sp); |
a0d0e21e LW |
81 | return NORMAL; |
82 | } | |
83 | ||
84 | PP(pp_stringify) | |
85 | { | |
20b7effb | 86 | dSP; dTARGET; |
4cc783ef DD |
87 | SV * const sv = TOPs; |
88 | SETs(TARG); | |
89 | sv_copypv(TARG, sv); | |
90 | SvSETMAGIC(TARG); | |
91 | /* no PUTBACK, SETs doesn't inc/dec SP */ | |
92 | return NORMAL; | |
a0d0e21e LW |
93 | } |
94 | ||
95 | PP(pp_gv) | |
96 | { | |
20b7effb | 97 | dSP; |
ad64d0ec | 98 | XPUSHs(MUTABLE_SV(cGVOP_gv)); |
a0d0e21e LW |
99 | RETURN; |
100 | } | |
101 | ||
b1c05ba5 DM |
102 | |
103 | /* also used for: pp_andassign() */ | |
104 | ||
a0d0e21e LW |
105 | PP(pp_and) |
106 | { | |
f410a211 | 107 | PERL_ASYNC_CHECK(); |
4cc783ef DD |
108 | { |
109 | /* SP is not used to remove a variable that is saved across the | |
110 | sv_2bool_flags call in SvTRUE_NN, if a RISC/CISC or low/high machine | |
111 | register or load/store vs direct mem ops macro is introduced, this | |
112 | should be a define block between direct PL_stack_sp and dSP operations, | |
113 | presently, using PL_stack_sp is bias towards CISC cpus */ | |
114 | SV * const sv = *PL_stack_sp; | |
115 | if (!SvTRUE_NN(sv)) | |
116 | return NORMAL; | |
117 | else { | |
118 | if (PL_op->op_type == OP_AND) | |
119 | --PL_stack_sp; | |
120 | return cLOGOP->op_other; | |
121 | } | |
a0d0e21e LW |
122 | } |
123 | } | |
124 | ||
125 | PP(pp_sassign) | |
126 | { | |
20b7effb | 127 | dSP; |
3e75a3c4 RU |
128 | /* sassign keeps its args in the optree traditionally backwards. |
129 | So we pop them differently. | |
130 | */ | |
131 | SV *left = POPs; SV *right = TOPs; | |
748a9306 | 132 | |
533c011a | 133 | if (PL_op->op_private & OPpASSIGN_BACKWARDS) { |
0bd48802 AL |
134 | SV * const temp = left; |
135 | left = right; right = temp; | |
a0d0e21e | 136 | } |
d48c660d DM |
137 | assert(TAINTING_get || !TAINT_get); |
138 | if (UNLIKELY(TAINT_get) && !SvTAINTED(right)) | |
a0d0e21e | 139 | TAINT_NOT; |
5d9574c1 DM |
140 | if (UNLIKELY(PL_op->op_private & OPpASSIGN_CV_TO_GV)) { |
141 | /* *foo =\&bar */ | |
3e75a3c4 | 142 | SV * const cv = SvRV(right); |
e26df76a | 143 | const U32 cv_type = SvTYPE(cv); |
3e75a3c4 | 144 | const bool is_gv = isGV_with_GP(left); |
6136c704 | 145 | const bool got_coderef = cv_type == SVt_PVCV || cv_type == SVt_PVFM; |
e26df76a NC |
146 | |
147 | if (!got_coderef) { | |
148 | assert(SvROK(cv)); | |
149 | } | |
150 | ||
3e75a3c4 RU |
151 | /* Can do the optimisation if left (LVALUE) is not a typeglob, |
152 | right (RVALUE) is a reference to something, and we're in void | |
e26df76a | 153 | context. */ |
13be902c | 154 | if (!got_coderef && !is_gv && GIMME_V == G_VOID) { |
e26df76a | 155 | /* Is the target symbol table currently empty? */ |
3e75a3c4 | 156 | GV * const gv = gv_fetchsv_nomg(left, GV_NOINIT, SVt_PVGV); |
bb112e5a | 157 | if (SvTYPE(gv) != SVt_PVGV && !SvOK(gv)) { |
e26df76a NC |
158 | /* Good. Create a new proxy constant subroutine in the target. |
159 | The gv becomes a(nother) reference to the constant. */ | |
160 | SV *const value = SvRV(cv); | |
161 | ||
ad64d0ec | 162 | SvUPGRADE(MUTABLE_SV(gv), SVt_IV); |
1ccdb730 | 163 | SvPCS_IMPORTED_on(gv); |
e26df76a | 164 | SvRV_set(gv, value); |
b37c2d43 | 165 | SvREFCNT_inc_simple_void(value); |
3e75a3c4 | 166 | SETs(left); |
e26df76a NC |
167 | RETURN; |
168 | } | |
169 | } | |
170 | ||
171 | /* Need to fix things up. */ | |
13be902c | 172 | if (!is_gv) { |
e26df76a | 173 | /* Need to fix GV. */ |
3e75a3c4 | 174 | left = MUTABLE_SV(gv_fetchsv_nomg(left,GV_ADD, SVt_PVGV)); |
e26df76a NC |
175 | } |
176 | ||
177 | if (!got_coderef) { | |
178 | /* We've been returned a constant rather than a full subroutine, | |
179 | but they expect a subroutine reference to apply. */ | |
53a42478 | 180 | if (SvROK(cv)) { |
d343c3ef | 181 | ENTER_with_name("sassign_coderef"); |
53a42478 NC |
182 | SvREFCNT_inc_void(SvRV(cv)); |
183 | /* newCONSTSUB takes a reference count on the passed in SV | |
184 | from us. We set the name to NULL, otherwise we get into | |
185 | all sorts of fun as the reference to our new sub is | |
186 | donated to the GV that we're about to assign to. | |
187 | */ | |
3e75a3c4 | 188 | SvRV_set(right, MUTABLE_SV(newCONSTSUB(GvSTASH(left), NULL, |
ad64d0ec | 189 | SvRV(cv)))); |
fc2b2dca | 190 | SvREFCNT_dec_NN(cv); |
d343c3ef | 191 | LEAVE_with_name("sassign_coderef"); |
53a42478 NC |
192 | } else { |
193 | /* What can happen for the corner case *{"BONK"} = \&{"BONK"}; | |
194 | is that | |
195 | First: ops for \&{"BONK"}; return us the constant in the | |
196 | symbol table | |
197 | Second: ops for *{"BONK"} cause that symbol table entry | |
198 | (and our reference to it) to be upgraded from RV | |
199 | to typeblob) | |
200 | Thirdly: We get here. cv is actually PVGV now, and its | |
201 | GvCV() is actually the subroutine we're looking for | |
202 | ||
203 | So change the reference so that it points to the subroutine | |
204 | of that typeglob, as that's what they were after all along. | |
205 | */ | |
159b6efe | 206 | GV *const upgraded = MUTABLE_GV(cv); |
53a42478 NC |
207 | CV *const source = GvCV(upgraded); |
208 | ||
209 | assert(source); | |
210 | assert(CvFLAGS(source) & CVf_CONST); | |
211 | ||
0ad694a7 | 212 | SvREFCNT_inc_simple_void_NN(source); |
fc2b2dca | 213 | SvREFCNT_dec_NN(upgraded); |
3e75a3c4 | 214 | SvRV_set(right, MUTABLE_SV(source)); |
53a42478 | 215 | } |
e26df76a | 216 | } |
53a42478 | 217 | |
e26df76a | 218 | } |
8fe85e3f | 219 | if ( |
5d9574c1 | 220 | UNLIKELY(SvTEMP(left)) && !SvSMAGICAL(left) && SvREFCNT(left) == 1 && |
3e75a3c4 | 221 | (!isGV_with_GP(left) || SvFAKE(left)) && ckWARN(WARN_MISC) |
8fe85e3f FC |
222 | ) |
223 | Perl_warner(aTHX_ | |
224 | packWARN(WARN_MISC), "Useless assignment to a temporary" | |
225 | ); | |
3e75a3c4 RU |
226 | SvSetMagicSV(left, right); |
227 | SETs(left); | |
a0d0e21e LW |
228 | RETURN; |
229 | } | |
230 | ||
231 | PP(pp_cond_expr) | |
232 | { | |
20b7effb | 233 | dSP; |
f410a211 | 234 | PERL_ASYNC_CHECK(); |
a0d0e21e | 235 | if (SvTRUEx(POPs)) |
1a67a97c | 236 | RETURNOP(cLOGOP->op_other); |
a0d0e21e | 237 | else |
1a67a97c | 238 | RETURNOP(cLOGOP->op_next); |
a0d0e21e LW |
239 | } |
240 | ||
241 | PP(pp_unstack) | |
242 | { | |
8f3964af | 243 | PERL_ASYNC_CHECK(); |
a0d0e21e | 244 | TAINT_NOT; /* Each statement is presumed innocent */ |
3280af22 | 245 | PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; |
a0d0e21e | 246 | FREETMPS; |
eae48c89 Z |
247 | if (!(PL_op->op_flags & OPf_SPECIAL)) { |
248 | I32 oldsave = PL_scopestack[PL_scopestack_ix - 1]; | |
249 | LEAVE_SCOPE(oldsave); | |
250 | } | |
a0d0e21e LW |
251 | return NORMAL; |
252 | } | |
253 | ||
a0d0e21e LW |
254 | PP(pp_concat) |
255 | { | |
20b7effb | 256 | dSP; dATARGET; tryAMAGICbin_MG(concat_amg, AMGf_assign); |
748a9306 LW |
257 | { |
258 | dPOPTOPssrl; | |
8d6d96c1 HS |
259 | bool lbyte; |
260 | STRLEN rlen; | |
d4c19fe8 | 261 | const char *rpv = NULL; |
a6b599c7 | 262 | bool rbyte = FALSE; |
a9c4fd4e | 263 | bool rcopied = FALSE; |
8d6d96c1 | 264 | |
6f1401dc DM |
265 | if (TARG == right && right != left) { /* $r = $l.$r */ |
266 | rpv = SvPV_nomg_const(right, rlen); | |
c75ab21a | 267 | rbyte = !DO_UTF8(right); |
59cd0e26 | 268 | right = newSVpvn_flags(rpv, rlen, SVs_TEMP); |
349d4f2f | 269 | rpv = SvPV_const(right, rlen); /* no point setting UTF-8 here */ |
db79b45b | 270 | rcopied = TRUE; |
8d6d96c1 | 271 | } |
7889fe52 | 272 | |
89734059 | 273 | if (TARG != left) { /* not $l .= $r */ |
a9c4fd4e | 274 | STRLEN llen; |
6f1401dc | 275 | const char* const lpv = SvPV_nomg_const(left, llen); |
90f5826e | 276 | lbyte = !DO_UTF8(left); |
8d6d96c1 HS |
277 | sv_setpvn(TARG, lpv, llen); |
278 | if (!lbyte) | |
279 | SvUTF8_on(TARG); | |
280 | else | |
281 | SvUTF8_off(TARG); | |
282 | } | |
18ea7bf2 S |
283 | else { /* $l .= $r and left == TARG */ |
284 | if (!SvOK(left)) { | |
89734059 | 285 | if (left == right && ckWARN(WARN_UNINITIALIZED)) /* $l .= $l */ |
c75ab21a | 286 | report_uninit(right); |
76f68e9b | 287 | sv_setpvs(left, ""); |
c75ab21a | 288 | } |
18ea7bf2 S |
289 | else { |
290 | SvPV_force_nomg_nolen(left); | |
291 | } | |
583a5589 | 292 | lbyte = !DO_UTF8(left); |
90f5826e | 293 | if (IN_BYTES) |
18ea7bf2 | 294 | SvUTF8_off(left); |
8d6d96c1 | 295 | } |
a12c0f56 | 296 | |
c75ab21a | 297 | if (!rcopied) { |
6f1401dc | 298 | rpv = SvPV_nomg_const(right, rlen); |
c75ab21a RH |
299 | rbyte = !DO_UTF8(right); |
300 | } | |
8d6d96c1 HS |
301 | if (lbyte != rbyte) { |
302 | if (lbyte) | |
303 | sv_utf8_upgrade_nomg(TARG); | |
304 | else { | |
db79b45b | 305 | if (!rcopied) |
59cd0e26 | 306 | right = newSVpvn_flags(rpv, rlen, SVs_TEMP); |
8d6d96c1 | 307 | sv_utf8_upgrade_nomg(right); |
6f1401dc | 308 | rpv = SvPV_nomg_const(right, rlen); |
69b47968 | 309 | } |
a0d0e21e | 310 | } |
8d6d96c1 | 311 | sv_catpvn_nomg(TARG, rpv, rlen); |
43ebc500 | 312 | |
a0d0e21e LW |
313 | SETTARG; |
314 | RETURN; | |
748a9306 | 315 | } |
a0d0e21e LW |
316 | } |
317 | ||
d5524600 DM |
318 | /* push the elements of av onto the stack. |
319 | * XXX Note that padav has similar code but without the mg_get(). | |
320 | * I suspect that the mg_get is no longer needed, but while padav | |
321 | * differs, it can't share this function */ | |
322 | ||
f9ae8fb6 | 323 | STATIC void |
d5524600 DM |
324 | S_pushav(pTHX_ AV* const av) |
325 | { | |
326 | dSP; | |
c70927a6 | 327 | const SSize_t maxarg = AvFILL(av) + 1; |
d5524600 | 328 | EXTEND(SP, maxarg); |
5d9574c1 | 329 | if (UNLIKELY(SvRMAGICAL(av))) { |
c70927a6 FC |
330 | PADOFFSET i; |
331 | for (i=0; i < (PADOFFSET)maxarg; i++) { | |
d5524600 DM |
332 | SV ** const svp = av_fetch(av, i, FALSE); |
333 | /* See note in pp_helem, and bug id #27839 */ | |
334 | SP[i+1] = svp | |
335 | ? SvGMAGICAL(*svp) ? (mg_get(*svp), *svp) : *svp | |
336 | : &PL_sv_undef; | |
337 | } | |
338 | } | |
339 | else { | |
c70927a6 FC |
340 | PADOFFSET i; |
341 | for (i=0; i < (PADOFFSET)maxarg; i++) { | |
ce0d59fd | 342 | SV * const sv = AvARRAY(av)[i]; |
5d9574c1 | 343 | SP[i+1] = LIKELY(sv) ? sv : &PL_sv_undef; |
ce0d59fd | 344 | } |
d5524600 DM |
345 | } |
346 | SP += maxarg; | |
347 | PUTBACK; | |
348 | } | |
349 | ||
350 | ||
a7fd8ef6 DM |
351 | /* ($lex1,@lex2,...) or my ($lex1,@lex2,...) */ |
352 | ||
353 | PP(pp_padrange) | |
354 | { | |
20b7effb | 355 | dSP; |
a7fd8ef6 DM |
356 | PADOFFSET base = PL_op->op_targ; |
357 | int count = (int)(PL_op->op_private) & OPpPADRANGE_COUNTMASK; | |
358 | int i; | |
d5524600 DM |
359 | if (PL_op->op_flags & OPf_SPECIAL) { |
360 | /* fake the RHS of my ($x,$y,..) = @_ */ | |
361 | PUSHMARK(SP); | |
362 | S_pushav(aTHX_ GvAVn(PL_defgv)); | |
363 | SPAGAIN; | |
364 | } | |
365 | ||
a7fd8ef6 DM |
366 | /* note, this is only skipped for compile-time-known void cxt */ |
367 | if ((PL_op->op_flags & OPf_WANT) != OPf_WANT_VOID) { | |
368 | EXTEND(SP, count); | |
369 | PUSHMARK(SP); | |
370 | for (i = 0; i <count; i++) | |
371 | *++SP = PAD_SV(base+i); | |
372 | } | |
373 | if (PL_op->op_private & OPpLVAL_INTRO) { | |
4e09461c DM |
374 | SV **svp = &(PAD_SVl(base)); |
375 | const UV payload = (UV)( | |
376 | (base << (OPpPADRANGE_COUNTSHIFT + SAVE_TIGHT_SHIFT)) | |
377 | | (count << SAVE_TIGHT_SHIFT) | |
378 | | SAVEt_CLEARPADRANGE); | |
6d59e610 | 379 | STATIC_ASSERT_STMT(OPpPADRANGE_COUNTMASK + 1 == (1 << OPpPADRANGE_COUNTSHIFT)); |
4e09461c | 380 | assert((payload >> (OPpPADRANGE_COUNTSHIFT+SAVE_TIGHT_SHIFT)) == base); |
a3444cc5 DM |
381 | { |
382 | dSS_ADD; | |
383 | SS_ADD_UV(payload); | |
384 | SS_ADD_END(1); | |
385 | } | |
4e09461c | 386 | |
a7fd8ef6 | 387 | for (i = 0; i <count; i++) |
4e09461c | 388 | SvPADSTALE_off(*svp++); /* mark lexical as active */ |
a7fd8ef6 DM |
389 | } |
390 | RETURN; | |
391 | } | |
392 | ||
393 | ||
a0d0e21e LW |
394 | PP(pp_padsv) |
395 | { | |
20b7effb | 396 | dSP; |
6c28b496 DD |
397 | EXTEND(SP, 1); |
398 | { | |
399 | OP * const op = PL_op; | |
400 | /* access PL_curpad once */ | |
401 | SV ** const padentry = &(PAD_SVl(op->op_targ)); | |
402 | { | |
403 | dTARG; | |
404 | TARG = *padentry; | |
405 | PUSHs(TARG); | |
406 | PUTBACK; /* no pop/push after this, TOPs ok */ | |
8ec5e241 | 407 | } |
6c28b496 DD |
408 | if (op->op_flags & OPf_MOD) { |
409 | if (op->op_private & OPpLVAL_INTRO) | |
410 | if (!(op->op_private & OPpPAD_STATE)) | |
411 | save_clearsv(padentry); | |
412 | if (op->op_private & OPpDEREF) { | |
8f90a16d FC |
413 | /* TOPs is equivalent to TARG here. Using TOPs (SP) rather |
414 | than TARG reduces the scope of TARG, so it does not | |
415 | span the call to save_clearsv, resulting in smaller | |
416 | machine code. */ | |
6c28b496 DD |
417 | TOPs = vivify_ref(TOPs, op->op_private & OPpDEREF); |
418 | } | |
419 | } | |
420 | return op->op_next; | |
4633a7c4 | 421 | } |
a0d0e21e LW |
422 | } |
423 | ||
424 | PP(pp_readline) | |
425 | { | |
30901a8a FC |
426 | dSP; |
427 | if (TOPs) { | |
428 | SvGETMAGIC(TOPs); | |
fc99edcf | 429 | tryAMAGICunTARGETlist(iter_amg, 0); |
30901a8a FC |
430 | PL_last_in_gv = MUTABLE_GV(*PL_stack_sp--); |
431 | } | |
432 | else PL_last_in_gv = PL_argvgv, PL_stack_sp--; | |
6e592b3a BM |
433 | if (!isGV_with_GP(PL_last_in_gv)) { |
434 | if (SvROK(PL_last_in_gv) && isGV_with_GP(SvRV(PL_last_in_gv))) | |
159b6efe | 435 | PL_last_in_gv = MUTABLE_GV(SvRV(PL_last_in_gv)); |
8efb3254 | 436 | else { |
f5284f61 | 437 | dSP; |
ad64d0ec | 438 | XPUSHs(MUTABLE_SV(PL_last_in_gv)); |
f5284f61 | 439 | PUTBACK; |
897d3989 | 440 | Perl_pp_rv2gv(aTHX); |
159b6efe | 441 | PL_last_in_gv = MUTABLE_GV(*PL_stack_sp--); |
84ee769f FC |
442 | if (PL_last_in_gv == (GV *)&PL_sv_undef) |
443 | PL_last_in_gv = NULL; | |
444 | else | |
445 | assert(isGV_with_GP(PL_last_in_gv)); | |
f5284f61 IZ |
446 | } |
447 | } | |
a0d0e21e LW |
448 | return do_readline(); |
449 | } | |
450 | ||
451 | PP(pp_eq) | |
452 | { | |
20b7effb | 453 | dSP; |
33efebe6 DM |
454 | SV *left, *right; |
455 | ||
a42d0242 | 456 | tryAMAGICbin_MG(eq_amg, AMGf_set|AMGf_numeric); |
33efebe6 DM |
457 | right = POPs; |
458 | left = TOPs; | |
459 | SETs(boolSV( | |
460 | (SvIOK_notUV(left) && SvIOK_notUV(right)) | |
461 | ? (SvIVX(left) == SvIVX(right)) | |
462 | : ( do_ncmp(left, right) == 0) | |
463 | )); | |
464 | RETURN; | |
a0d0e21e LW |
465 | } |
466 | ||
b1c05ba5 | 467 | |
4c2c3128 | 468 | /* also used for: pp_i_preinc() */ |
b1c05ba5 | 469 | |
a0d0e21e LW |
470 | PP(pp_preinc) |
471 | { | |
4c2c3128 DM |
472 | SV *sv = *PL_stack_sp; |
473 | ||
474 | if (LIKELY(((sv->sv_flags & | |
475 | (SVf_THINKFIRST|SVs_GMG|SVf_IVisUV| | |
476 | SVf_IOK|SVf_NOK|SVf_POK|SVp_NOK|SVp_POK|SVf_ROK)) | |
477 | == SVf_IOK)) | |
478 | && SvIVX(sv) != IV_MAX) | |
479 | { | |
480 | SvIV_set(sv, SvIVX(sv) + 1); | |
481 | } | |
482 | else /* Do all the PERL_PRESERVE_IVUV and hard cases in sv_inc */ | |
483 | sv_inc(sv); | |
484 | SvSETMAGIC(sv); | |
485 | return NORMAL; | |
486 | } | |
487 | ||
488 | ||
489 | /* also used for: pp_i_predec() */ | |
490 | ||
491 | PP(pp_predec) | |
492 | { | |
493 | SV *sv = *PL_stack_sp; | |
494 | ||
495 | if (LIKELY(((sv->sv_flags & | |
496 | (SVf_THINKFIRST|SVs_GMG|SVf_IVisUV| | |
497 | SVf_IOK|SVf_NOK|SVf_POK|SVp_NOK|SVp_POK|SVf_ROK)) | |
498 | == SVf_IOK)) | |
499 | && SvIVX(sv) != IV_MIN) | |
55497cff | 500 | { |
4c2c3128 | 501 | SvIV_set(sv, SvIVX(sv) - 1); |
748a9306 | 502 | } |
4c2c3128 DM |
503 | else /* Do all the PERL_PRESERVE_IVUV and hard cases in sv_dec */ |
504 | sv_dec(sv); | |
505 | SvSETMAGIC(sv); | |
a0d0e21e LW |
506 | return NORMAL; |
507 | } | |
508 | ||
b1c05ba5 DM |
509 | |
510 | /* also used for: pp_orassign() */ | |
511 | ||
a0d0e21e LW |
512 | PP(pp_or) |
513 | { | |
20b7effb | 514 | dSP; |
f410a211 | 515 | PERL_ASYNC_CHECK(); |
a0d0e21e LW |
516 | if (SvTRUE(TOPs)) |
517 | RETURN; | |
518 | else { | |
c960fc3b SP |
519 | if (PL_op->op_type == OP_OR) |
520 | --SP; | |
a0d0e21e LW |
521 | RETURNOP(cLOGOP->op_other); |
522 | } | |
523 | } | |
524 | ||
b1c05ba5 DM |
525 | |
526 | /* also used for: pp_dor() pp_dorassign() */ | |
527 | ||
25a55bd7 | 528 | PP(pp_defined) |
c963b151 | 529 | { |
20b7effb | 530 | dSP; |
eb578fdb | 531 | SV* sv; |
6136c704 | 532 | bool defined; |
25a55bd7 | 533 | const int op_type = PL_op->op_type; |
ea5195b7 | 534 | const bool is_dor = (op_type == OP_DOR || op_type == OP_DORASSIGN); |
c963b151 | 535 | |
6136c704 | 536 | if (is_dor) { |
f410a211 | 537 | PERL_ASYNC_CHECK(); |
25a55bd7 | 538 | sv = TOPs; |
5d9574c1 | 539 | if (UNLIKELY(!sv || !SvANY(sv))) { |
2bd49cfc NC |
540 | if (op_type == OP_DOR) |
541 | --SP; | |
25a55bd7 SP |
542 | RETURNOP(cLOGOP->op_other); |
543 | } | |
b7c44293 RGS |
544 | } |
545 | else { | |
546 | /* OP_DEFINED */ | |
25a55bd7 | 547 | sv = POPs; |
5d9574c1 | 548 | if (UNLIKELY(!sv || !SvANY(sv))) |
25a55bd7 | 549 | RETPUSHNO; |
b7c44293 | 550 | } |
25a55bd7 | 551 | |
6136c704 | 552 | defined = FALSE; |
c963b151 BD |
553 | switch (SvTYPE(sv)) { |
554 | case SVt_PVAV: | |
555 | if (AvMAX(sv) >= 0 || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied))) | |
25a55bd7 | 556 | defined = TRUE; |
c963b151 BD |
557 | break; |
558 | case SVt_PVHV: | |
559 | if (HvARRAY(sv) || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied))) | |
25a55bd7 | 560 | defined = TRUE; |
c963b151 BD |
561 | break; |
562 | case SVt_PVCV: | |
563 | if (CvROOT(sv) || CvXSUB(sv)) | |
25a55bd7 | 564 | defined = TRUE; |
c963b151 BD |
565 | break; |
566 | default: | |
5b295bef | 567 | SvGETMAGIC(sv); |
c963b151 | 568 | if (SvOK(sv)) |
25a55bd7 | 569 | defined = TRUE; |
6136c704 | 570 | break; |
c963b151 | 571 | } |
6136c704 AL |
572 | |
573 | if (is_dor) { | |
c960fc3b SP |
574 | if(defined) |
575 | RETURN; | |
576 | if(op_type == OP_DOR) | |
577 | --SP; | |
25a55bd7 | 578 | RETURNOP(cLOGOP->op_other); |
25a55bd7 | 579 | } |
d9aa96a4 SP |
580 | /* assuming OP_DEFINED */ |
581 | if(defined) | |
582 | RETPUSHYES; | |
583 | RETPUSHNO; | |
c963b151 BD |
584 | } |
585 | ||
230ee21f DM |
586 | |
587 | ||
a0d0e21e LW |
588 | PP(pp_add) |
589 | { | |
20b7effb | 590 | dSP; dATARGET; bool useleft; SV *svl, *svr; |
230ee21f | 591 | |
6f1401dc DM |
592 | tryAMAGICbin_MG(add_amg, AMGf_assign|AMGf_numeric); |
593 | svr = TOPs; | |
594 | svl = TOPm1s; | |
595 | ||
28e5dec8 | 596 | #ifdef PERL_PRESERVE_IVUV |
230ee21f DM |
597 | |
598 | /* special-case some simple common cases */ | |
599 | if (!((svl->sv_flags|svr->sv_flags) & (SVf_IVisUV|SVs_GMG))) { | |
600 | IV il, ir; | |
601 | U32 flags = (svl->sv_flags & svr->sv_flags); | |
602 | if (flags & SVf_IOK) { | |
603 | /* both args are simple IVs */ | |
604 | UV topl, topr; | |
605 | il = SvIVX(svl); | |
606 | ir = SvIVX(svr); | |
607 | do_iv: | |
608 | topl = ((UV)il) >> (UVSIZE * 8 - 2); | |
609 | topr = ((UV)ir) >> (UVSIZE * 8 - 2); | |
610 | ||
611 | /* if both are in a range that can't under/overflow, do a | |
612 | * simple integer add: if the top of both numbers | |
613 | * are 00 or 11, then it's safe */ | |
614 | if (!( ((topl+1) | (topr+1)) & 2)) { | |
615 | SP--; | |
616 | TARGi(il + ir, 0); /* args not GMG, so can't be tainted */ | |
617 | SETs(TARG); | |
618 | RETURN; | |
619 | } | |
620 | goto generic; | |
621 | } | |
622 | else if (flags & SVf_NOK) { | |
623 | /* both args are NVs */ | |
624 | NV nl = SvNVX(svl); | |
625 | NV nr = SvNVX(svr); | |
626 | ||
627 | il = (IV)nl; | |
628 | ir = (IV)nr; | |
629 | if (nl == (NV)il && nr == (NV)ir) | |
630 | /* nothing was lost by converting to IVs */ | |
631 | goto do_iv; | |
632 | SP--; | |
633 | TARGn(nl + nr, 0); /* args not GMG, so can't be tainted */ | |
634 | SETs(TARG); | |
635 | RETURN; | |
636 | } | |
637 | } | |
638 | ||
639 | generic: | |
640 | ||
641 | useleft = USE_LEFT(svl); | |
28e5dec8 JH |
642 | /* We must see if we can perform the addition with integers if possible, |
643 | as the integer code detects overflow while the NV code doesn't. | |
644 | If either argument hasn't had a numeric conversion yet attempt to get | |
645 | the IV. It's important to do this now, rather than just assuming that | |
646 | it's not IOK as a PV of "9223372036854775806" may not take well to NV | |
647 | addition, and an SV which is NOK, NV=6.0 ought to be coerced to | |
648 | integer in case the second argument is IV=9223372036854775806 | |
649 | We can (now) rely on sv_2iv to do the right thing, only setting the | |
650 | public IOK flag if the value in the NV (or PV) slot is truly integer. | |
651 | ||
652 | A side effect is that this also aggressively prefers integer maths over | |
7dca457a NC |
653 | fp maths for integer values. |
654 | ||
a00b5bd3 | 655 | How to detect overflow? |
7dca457a NC |
656 | |
657 | C 99 section 6.2.6.1 says | |
658 | ||
659 | The range of nonnegative values of a signed integer type is a subrange | |
660 | of the corresponding unsigned integer type, and the representation of | |
661 | the same value in each type is the same. A computation involving | |
662 | unsigned operands can never overflow, because a result that cannot be | |
663 | represented by the resulting unsigned integer type is reduced modulo | |
664 | the number that is one greater than the largest value that can be | |
665 | represented by the resulting type. | |
666 | ||
667 | (the 9th paragraph) | |
668 | ||
669 | which I read as "unsigned ints wrap." | |
670 | ||
671 | signed integer overflow seems to be classed as "exception condition" | |
672 | ||
673 | If an exceptional condition occurs during the evaluation of an | |
674 | expression (that is, if the result is not mathematically defined or not | |
675 | in the range of representable values for its type), the behavior is | |
676 | undefined. | |
677 | ||
678 | (6.5, the 5th paragraph) | |
679 | ||
680 | I had assumed that on 2s complement machines signed arithmetic would | |
681 | wrap, hence coded pp_add and pp_subtract on the assumption that | |
682 | everything perl builds on would be happy. After much wailing and | |
683 | gnashing of teeth it would seem that irix64 knows its ANSI spec well, | |
684 | knows that it doesn't need to, and doesn't. Bah. Anyway, the all- | |
685 | unsigned code below is actually shorter than the old code. :-) | |
686 | */ | |
687 | ||
01f91bf2 | 688 | if (SvIV_please_nomg(svr)) { |
28e5dec8 JH |
689 | /* Unless the left argument is integer in range we are going to have to |
690 | use NV maths. Hence only attempt to coerce the right argument if | |
691 | we know the left is integer. */ | |
eb578fdb | 692 | UV auv = 0; |
9c5ffd7c | 693 | bool auvok = FALSE; |
7dca457a NC |
694 | bool a_valid = 0; |
695 | ||
28e5dec8 | 696 | if (!useleft) { |
7dca457a NC |
697 | auv = 0; |
698 | a_valid = auvok = 1; | |
699 | /* left operand is undef, treat as zero. + 0 is identity, | |
700 | Could SETi or SETu right now, but space optimise by not adding | |
701 | lots of code to speed up what is probably a rarish case. */ | |
702 | } else { | |
703 | /* Left operand is defined, so is it IV? */ | |
01f91bf2 | 704 | if (SvIV_please_nomg(svl)) { |
800401ee JH |
705 | if ((auvok = SvUOK(svl))) |
706 | auv = SvUVX(svl); | |
7dca457a | 707 | else { |
eb578fdb | 708 | const IV aiv = SvIVX(svl); |
7dca457a NC |
709 | if (aiv >= 0) { |
710 | auv = aiv; | |
711 | auvok = 1; /* Now acting as a sign flag. */ | |
53e2bfb7 DM |
712 | } else { |
713 | auv = (aiv == IV_MIN) ? (UV)aiv : (UV)(-aiv); | |
7dca457a NC |
714 | } |
715 | } | |
716 | a_valid = 1; | |
28e5dec8 JH |
717 | } |
718 | } | |
7dca457a NC |
719 | if (a_valid) { |
720 | bool result_good = 0; | |
721 | UV result; | |
eb578fdb | 722 | UV buv; |
800401ee | 723 | bool buvok = SvUOK(svr); |
a00b5bd3 | 724 | |
7dca457a | 725 | if (buvok) |
800401ee | 726 | buv = SvUVX(svr); |
7dca457a | 727 | else { |
eb578fdb | 728 | const IV biv = SvIVX(svr); |
7dca457a NC |
729 | if (biv >= 0) { |
730 | buv = biv; | |
731 | buvok = 1; | |
732 | } else | |
53e2bfb7 | 733 | buv = (biv == IV_MIN) ? (UV)biv : (UV)(-biv); |
7dca457a NC |
734 | } |
735 | /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve, | |
602f51c4 | 736 | else "IV" now, independent of how it came in. |
7dca457a NC |
737 | if a, b represents positive, A, B negative, a maps to -A etc |
738 | a + b => (a + b) | |
739 | A + b => -(a - b) | |
740 | a + B => (a - b) | |
741 | A + B => -(a + b) | |
742 | all UV maths. negate result if A negative. | |
743 | add if signs same, subtract if signs differ. */ | |
744 | ||
745 | if (auvok ^ buvok) { | |
746 | /* Signs differ. */ | |
747 | if (auv >= buv) { | |
748 | result = auv - buv; | |
749 | /* Must get smaller */ | |
750 | if (result <= auv) | |
751 | result_good = 1; | |
752 | } else { | |
753 | result = buv - auv; | |
754 | if (result <= buv) { | |
755 | /* result really should be -(auv-buv). as its negation | |
756 | of true value, need to swap our result flag */ | |
757 | auvok = !auvok; | |
758 | result_good = 1; | |
28e5dec8 JH |
759 | } |
760 | } | |
7dca457a NC |
761 | } else { |
762 | /* Signs same */ | |
763 | result = auv + buv; | |
764 | if (result >= auv) | |
765 | result_good = 1; | |
766 | } | |
767 | if (result_good) { | |
768 | SP--; | |
769 | if (auvok) | |
28e5dec8 | 770 | SETu( result ); |
7dca457a NC |
771 | else { |
772 | /* Negate result */ | |
773 | if (result <= (UV)IV_MIN) | |
53e2bfb7 DM |
774 | SETi(result == (UV)IV_MIN |
775 | ? IV_MIN : -(IV)result); | |
7dca457a NC |
776 | else { |
777 | /* result valid, but out of range for IV. */ | |
778 | SETn( -(NV)result ); | |
28e5dec8 JH |
779 | } |
780 | } | |
7dca457a NC |
781 | RETURN; |
782 | } /* Overflow, drop through to NVs. */ | |
28e5dec8 JH |
783 | } |
784 | } | |
230ee21f DM |
785 | |
786 | #else | |
787 | useleft = USE_LEFT(svl); | |
28e5dec8 | 788 | #endif |
230ee21f | 789 | |
a0d0e21e | 790 | { |
6f1401dc | 791 | NV value = SvNV_nomg(svr); |
4efa5a16 | 792 | (void)POPs; |
28e5dec8 JH |
793 | if (!useleft) { |
794 | /* left operand is undef, treat as zero. + 0.0 is identity. */ | |
795 | SETn(value); | |
796 | RETURN; | |
797 | } | |
6f1401dc | 798 | SETn( value + SvNV_nomg(svl) ); |
28e5dec8 | 799 | RETURN; |
a0d0e21e LW |
800 | } |
801 | } | |
802 | ||
b1c05ba5 DM |
803 | |
804 | /* also used for: pp_aelemfast_lex() */ | |
805 | ||
a0d0e21e LW |
806 | PP(pp_aelemfast) |
807 | { | |
20b7effb | 808 | dSP; |
93bad3fd | 809 | AV * const av = PL_op->op_type == OP_AELEMFAST_LEX |
8f878375 | 810 | ? MUTABLE_AV(PAD_SV(PL_op->op_targ)) : GvAVn(cGVOP_gv); |
a3b680e6 | 811 | const U32 lval = PL_op->op_flags & OPf_MOD; |
b024352e | 812 | SV** const svp = av_fetch(av, (I8)PL_op->op_private, lval); |
3280af22 | 813 | SV *sv = (svp ? *svp : &PL_sv_undef); |
b024352e DM |
814 | |
815 | if (UNLIKELY(!svp && lval)) | |
816 | DIE(aTHX_ PL_no_aelem, (int)(I8)PL_op->op_private); | |
817 | ||
6ff81951 | 818 | EXTEND(SP, 1); |
39cf747a | 819 | if (!lval && SvRMAGICAL(av) && SvGMAGICAL(sv)) /* see note in pp_helem() */ |
fd69380d | 820 | mg_get(sv); |
be6c24e0 | 821 | PUSHs(sv); |
a0d0e21e LW |
822 | RETURN; |
823 | } | |
824 | ||
825 | PP(pp_join) | |
826 | { | |
20b7effb | 827 | dSP; dMARK; dTARGET; |
a0d0e21e LW |
828 | MARK++; |
829 | do_join(TARG, *MARK, MARK, SP); | |
830 | SP = MARK; | |
831 | SETs(TARG); | |
832 | RETURN; | |
833 | } | |
834 | ||
835 | PP(pp_pushre) | |
836 | { | |
20b7effb | 837 | dSP; |
44a8e56a | 838 | #ifdef DEBUGGING |
839 | /* | |
840 | * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs | |
841 | * will be enough to hold an OP*. | |
842 | */ | |
c4420975 | 843 | SV* const sv = sv_newmortal(); |
44a8e56a | 844 | sv_upgrade(sv, SVt_PVLV); |
845 | LvTYPE(sv) = '/'; | |
533c011a | 846 | Copy(&PL_op, &LvTARGOFF(sv), 1, OP*); |
44a8e56a | 847 | XPUSHs(sv); |
848 | #else | |
ad64d0ec | 849 | XPUSHs(MUTABLE_SV(PL_op)); |
44a8e56a | 850 | #endif |
a0d0e21e LW |
851 | RETURN; |
852 | } | |
853 | ||
854 | /* Oversized hot code. */ | |
855 | ||
b1c05ba5 DM |
856 | /* also used for: pp_say() */ |
857 | ||
a0d0e21e LW |
858 | PP(pp_print) |
859 | { | |
20b7effb | 860 | dSP; dMARK; dORIGMARK; |
eb578fdb | 861 | PerlIO *fp; |
236988e4 | 862 | MAGIC *mg; |
159b6efe NC |
863 | GV * const gv |
864 | = (PL_op->op_flags & OPf_STACKED) ? MUTABLE_GV(*++MARK) : PL_defoutgv; | |
9c9f25b8 | 865 | IO *io = GvIO(gv); |
5b468f54 | 866 | |
9c9f25b8 | 867 | if (io |
ad64d0ec | 868 | && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar))) |
5b468f54 | 869 | { |
01bb7c6d | 870 | had_magic: |
68dc0745 | 871 | if (MARK == ORIGMARK) { |
1c846c1f | 872 | /* If using default handle then we need to make space to |
a60c0954 NIS |
873 | * pass object as 1st arg, so move other args up ... |
874 | */ | |
4352c267 | 875 | MEXTEND(SP, 1); |
68dc0745 | 876 | ++MARK; |
877 | Move(MARK, MARK + 1, (SP - MARK) + 1, SV*); | |
878 | ++SP; | |
879 | } | |
3e0cb5de | 880 | return Perl_tied_method(aTHX_ SV_CONST(PRINT), mark - 1, MUTABLE_SV(io), |
94bc412f NC |
881 | mg, |
882 | (G_SCALAR | TIED_METHOD_ARGUMENTS_ON_STACK | |
883 | | (PL_op->op_type == OP_SAY | |
884 | ? TIED_METHOD_SAY : 0)), sp - mark); | |
236988e4 | 885 | } |
9c9f25b8 | 886 | if (!io) { |
68b590d9 | 887 | if ( gv && GvEGVx(gv) && (io = GvIO(GvEGV(gv))) |
ad64d0ec | 888 | && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar))) |
01bb7c6d | 889 | goto had_magic; |
51087808 | 890 | report_evil_fh(gv); |
93189314 | 891 | SETERRNO(EBADF,RMS_IFI); |
a0d0e21e LW |
892 | goto just_say_no; |
893 | } | |
894 | else if (!(fp = IoOFP(io))) { | |
7716c5c5 NC |
895 | if (IoIFP(io)) |
896 | report_wrongway_fh(gv, '<'); | |
51087808 | 897 | else |
7716c5c5 | 898 | report_evil_fh(gv); |
93189314 | 899 | SETERRNO(EBADF,IoIFP(io)?RMS_FAC:RMS_IFI); |
a0d0e21e LW |
900 | goto just_say_no; |
901 | } | |
902 | else { | |
e23d9e2f | 903 | SV * const ofs = GvSV(PL_ofsgv); /* $, */ |
a0d0e21e | 904 | MARK++; |
e23d9e2f | 905 | if (ofs && (SvGMAGICAL(ofs) || SvOK(ofs))) { |
a0d0e21e LW |
906 | while (MARK <= SP) { |
907 | if (!do_print(*MARK, fp)) | |
908 | break; | |
909 | MARK++; | |
910 | if (MARK <= SP) { | |
e23d9e2f CS |
911 | /* don't use 'ofs' here - it may be invalidated by magic callbacks */ |
912 | if (!do_print(GvSV(PL_ofsgv), fp)) { | |
a0d0e21e LW |
913 | MARK--; |
914 | break; | |
915 | } | |
916 | } | |
917 | } | |
918 | } | |
919 | else { | |
920 | while (MARK <= SP) { | |
921 | if (!do_print(*MARK, fp)) | |
922 | break; | |
923 | MARK++; | |
924 | } | |
925 | } | |
926 | if (MARK <= SP) | |
927 | goto just_say_no; | |
928 | else { | |
cfc4a7da GA |
929 | if (PL_op->op_type == OP_SAY) { |
930 | if (PerlIO_write(fp, "\n", 1) == 0 || PerlIO_error(fp)) | |
931 | goto just_say_no; | |
932 | } | |
933 | else if (PL_ors_sv && SvOK(PL_ors_sv)) | |
7889fe52 | 934 | if (!do_print(PL_ors_sv, fp)) /* $\ */ |
a0d0e21e LW |
935 | goto just_say_no; |
936 | ||
937 | if (IoFLAGS(io) & IOf_FLUSH) | |
760ac839 | 938 | if (PerlIO_flush(fp) == EOF) |
a0d0e21e LW |
939 | goto just_say_no; |
940 | } | |
941 | } | |
942 | SP = ORIGMARK; | |
e52fd6f4 | 943 | XPUSHs(&PL_sv_yes); |
a0d0e21e LW |
944 | RETURN; |
945 | ||
946 | just_say_no: | |
947 | SP = ORIGMARK; | |
e52fd6f4 | 948 | XPUSHs(&PL_sv_undef); |
a0d0e21e LW |
949 | RETURN; |
950 | } | |
951 | ||
b1c05ba5 DM |
952 | |
953 | /* also used for: pp_rv2hv() */ | |
bdaf10a5 | 954 | /* also called directly by pp_lvavref */ |
b1c05ba5 | 955 | |
a0d0e21e LW |
956 | PP(pp_rv2av) |
957 | { | |
20b7effb | 958 | dSP; dTOPss; |
cde874ca | 959 | const I32 gimme = GIMME_V; |
13c59d41 MH |
960 | static const char an_array[] = "an ARRAY"; |
961 | static const char a_hash[] = "a HASH"; | |
bdaf10a5 FC |
962 | const bool is_pp_rv2av = PL_op->op_type == OP_RV2AV |
963 | || PL_op->op_type == OP_LVAVREF; | |
d83b45b8 | 964 | const svtype type = is_pp_rv2av ? SVt_PVAV : SVt_PVHV; |
a0d0e21e | 965 | |
9026059d | 966 | SvGETMAGIC(sv); |
a0d0e21e | 967 | if (SvROK(sv)) { |
5d9574c1 | 968 | if (UNLIKELY(SvAMAGIC(sv))) { |
93d7320b | 969 | sv = amagic_deref_call(sv, is_pp_rv2av ? to_av_amg : to_hv_amg); |
93d7320b | 970 | } |
17ab7946 | 971 | sv = SvRV(sv); |
5d9574c1 | 972 | if (UNLIKELY(SvTYPE(sv) != type)) |
dcbac5bb | 973 | /* diag_listed_as: Not an ARRAY reference */ |
13c59d41 | 974 | DIE(aTHX_ "Not %s reference", is_pp_rv2av ? an_array : a_hash); |
5d9574c1 DM |
975 | else if (UNLIKELY(PL_op->op_flags & OPf_MOD |
976 | && PL_op->op_private & OPpLVAL_INTRO)) | |
3da99855 | 977 | Perl_croak(aTHX_ "%s", PL_no_localize_ref); |
a0d0e21e | 978 | } |
5d9574c1 | 979 | else if (UNLIKELY(SvTYPE(sv) != type)) { |
67955e0c | 980 | GV *gv; |
1c846c1f | 981 | |
6e592b3a | 982 | if (!isGV_with_GP(sv)) { |
13c59d41 | 983 | gv = Perl_softref2xv(aTHX_ sv, is_pp_rv2av ? an_array : a_hash, |
dc3c76f8 NC |
984 | type, &sp); |
985 | if (!gv) | |
986 | RETURN; | |
35cd451c GS |
987 | } |
988 | else { | |
159b6efe | 989 | gv = MUTABLE_GV(sv); |
a0d0e21e | 990 | } |
ad64d0ec | 991 | sv = is_pp_rv2av ? MUTABLE_SV(GvAVn(gv)) : MUTABLE_SV(GvHVn(gv)); |
533c011a | 992 | if (PL_op->op_private & OPpLVAL_INTRO) |
ad64d0ec | 993 | sv = is_pp_rv2av ? MUTABLE_SV(save_ary(gv)) : MUTABLE_SV(save_hash(gv)); |
9f527363 FC |
994 | } |
995 | if (PL_op->op_flags & OPf_REF) { | |
17ab7946 | 996 | SETs(sv); |
a0d0e21e | 997 | RETURN; |
9f527363 | 998 | } |
5d9574c1 | 999 | else if (UNLIKELY(PL_op->op_private & OPpMAYBE_LVSUB)) { |
40c94d11 FC |
1000 | const I32 flags = is_lvalue_sub(); |
1001 | if (flags && !(flags & OPpENTERSUB_INARGS)) { | |
cde874ca | 1002 | if (gimme != G_ARRAY) |
042560a6 | 1003 | goto croak_cant_return; |
17ab7946 | 1004 | SETs(sv); |
78f9721b | 1005 | RETURN; |
40c94d11 | 1006 | } |
a0d0e21e LW |
1007 | } |
1008 | ||
17ab7946 | 1009 | if (is_pp_rv2av) { |
502c6561 | 1010 | AV *const av = MUTABLE_AV(sv); |
636fe681 | 1011 | /* The guts of pp_rv2av */ |
96913b52 | 1012 | if (gimme == G_ARRAY) { |
d5524600 DM |
1013 | SP--; |
1014 | PUTBACK; | |
1015 | S_pushav(aTHX_ av); | |
1016 | SPAGAIN; | |
1c846c1f | 1017 | } |
96913b52 VP |
1018 | else if (gimme == G_SCALAR) { |
1019 | dTARGET; | |
c70927a6 | 1020 | const SSize_t maxarg = AvFILL(av) + 1; |
96913b52 | 1021 | SETi(maxarg); |
93965878 | 1022 | } |
17ab7946 NC |
1023 | } else { |
1024 | /* The guts of pp_rv2hv */ | |
96913b52 VP |
1025 | if (gimme == G_ARRAY) { /* array wanted */ |
1026 | *PL_stack_sp = sv; | |
981b7185 | 1027 | return Perl_do_kv(aTHX); |
96913b52 | 1028 | } |
c8fe3bdf | 1029 | else if ((PL_op->op_private & OPpTRUEBOOL |
adc42c31 | 1030 | || ( PL_op->op_private & OPpMAYBE_TRUEBOOL |
c8fe3bdf FC |
1031 | && block_gimme() == G_VOID )) |
1032 | && (!SvRMAGICAL(sv) || !mg_find(sv, PERL_MAGIC_tied))) | |
1033 | SETs(HvUSEDKEYS(sv) ? &PL_sv_yes : sv_2mortal(newSViv(0))); | |
96913b52 | 1034 | else if (gimme == G_SCALAR) { |
1a8bdda9 | 1035 | dTARG; |
96913b52 | 1036 | TARG = Perl_hv_scalar(aTHX_ MUTABLE_HV(sv)); |
96913b52 VP |
1037 | SETTARG; |
1038 | } | |
17ab7946 | 1039 | } |
be85d344 | 1040 | RETURN; |
042560a6 NC |
1041 | |
1042 | croak_cant_return: | |
1043 | Perl_croak(aTHX_ "Can't return %s to lvalue scalar context", | |
1044 | is_pp_rv2av ? "array" : "hash"); | |
77e217c6 | 1045 | RETURN; |
a0d0e21e LW |
1046 | } |
1047 | ||
10c8fecd | 1048 | STATIC void |
fb8f4cf8 | 1049 | S_do_oddball(pTHX_ SV **oddkey, SV **firstkey) |
10c8fecd | 1050 | { |
7918f24d NC |
1051 | PERL_ARGS_ASSERT_DO_ODDBALL; |
1052 | ||
fb8f4cf8 | 1053 | if (*oddkey) { |
6d822dc4 | 1054 | if (ckWARN(WARN_MISC)) { |
a3b680e6 | 1055 | const char *err; |
fb8f4cf8 RZ |
1056 | if (oddkey == firstkey && |
1057 | SvROK(*oddkey) && | |
1058 | (SvTYPE(SvRV(*oddkey)) == SVt_PVAV || | |
1059 | SvTYPE(SvRV(*oddkey)) == SVt_PVHV)) | |
10c8fecd | 1060 | { |
a3b680e6 | 1061 | err = "Reference found where even-sized list expected"; |
10c8fecd GS |
1062 | } |
1063 | else | |
a3b680e6 | 1064 | err = "Odd number of elements in hash assignment"; |
f1f66076 | 1065 | Perl_warner(aTHX_ packWARN(WARN_MISC), "%s", err); |
10c8fecd | 1066 | } |
6d822dc4 | 1067 | |
10c8fecd GS |
1068 | } |
1069 | } | |
1070 | ||
a5f48505 DM |
1071 | |
1072 | /* Do a mark and sweep with the SVf_BREAK flag to detect elements which | |
1073 | * are common to both the LHS and RHS of an aassign, and replace them | |
1074 | * with copies. All these copies are made before the actual list assign is | |
1075 | * done. | |
1076 | * | |
1077 | * For example in ($a,$b) = ($b,$a), assigning the value of the first RHS | |
1078 | * element ($b) to the first LH element ($a), modifies $a; when the | |
1079 | * second assignment is done, the second RH element now has the wrong | |
1080 | * value. So we initially replace the RHS with ($b, mortalcopy($a)). | |
1081 | * Note that we don't need to make a mortal copy of $b. | |
1082 | * | |
1083 | * The algorithm below works by, for every RHS element, mark the | |
1084 | * corresponding LHS target element with SVf_BREAK. Then if the RHS | |
1085 | * element is found with SVf_BREAK set, it means it would have been | |
1086 | * modified, so make a copy. | |
1087 | * Note that by scanning both LHS and RHS in lockstep, we avoid | |
1088 | * unnecessary copies (like $b above) compared with a naive | |
1089 | * "mark all LHS; copy all marked RHS; unmark all LHS". | |
1090 | * | |
1091 | * If the LHS element is a 'my' declaration' and has a refcount of 1, then | |
1092 | * it can't be common and can be skipped. | |
ebc643ce DM |
1093 | * |
1094 | * On DEBUGGING builds it takes an extra boolean, fake. If true, it means | |
1095 | * that we thought we didn't need to call S_aassign_copy_common(), but we | |
1096 | * have anyway for sanity checking. If we find we need to copy, then panic. | |
a5f48505 DM |
1097 | */ |
1098 | ||
1099 | PERL_STATIC_INLINE void | |
1100 | S_aassign_copy_common(pTHX_ SV **firstlelem, SV **lastlelem, | |
ebc643ce DM |
1101 | SV **firstrelem, SV **lastrelem |
1102 | #ifdef DEBUGGING | |
1103 | , bool fake | |
1104 | #endif | |
1105 | ) | |
a5f48505 DM |
1106 | { |
1107 | dVAR; | |
1108 | SV **relem; | |
1109 | SV **lelem; | |
1110 | SSize_t lcount = lastlelem - firstlelem + 1; | |
1111 | bool marked = FALSE; /* have we marked any LHS with SVf_BREAK ? */ | |
1112 | bool const do_rc1 = cBOOL(PL_op->op_private & OPpASSIGN_COMMON_RC1); | |
1113 | ||
1114 | assert(!PL_in_clean_all); /* SVf_BREAK not already in use */ | |
1115 | assert(firstlelem < lastlelem); /* at least 2 LH elements */ | |
1116 | assert(firstrelem < lastrelem); /* at least 2 RH elements */ | |
1117 | ||
ebc643ce DM |
1118 | |
1119 | lelem = firstlelem; | |
a5f48505 DM |
1120 | /* we never have to copy the first RH element; it can't be corrupted |
1121 | * by assigning something to the corresponding first LH element. | |
1122 | * So this scan does in a loop: mark LHS[N]; test RHS[N+1] | |
1123 | */ | |
ebc643ce | 1124 | relem = firstrelem + 1; |
a5f48505 DM |
1125 | |
1126 | for (; relem <= lastrelem; relem++) { | |
1127 | SV *svr; | |
1128 | ||
1129 | /* mark next LH element */ | |
1130 | ||
1131 | if (--lcount >= 0) { | |
1132 | SV *svl = *lelem++; | |
1133 | ||
1134 | if (UNLIKELY(!svl)) {/* skip AV alias marker */ | |
1135 | assert (lelem <= lastlelem); | |
1136 | svl = *lelem++; | |
1137 | lcount--; | |
1138 | } | |
1139 | ||
1140 | assert(svl); | |
1141 | if (SvTYPE(svl) == SVt_PVAV || SvTYPE(svl) == SVt_PVHV) { | |
1142 | if (!marked) | |
1143 | return; | |
1144 | /* this LH element will consume all further args; | |
1145 | * no need to mark any further LH elements (if any). | |
1146 | * But we still need to scan any remaining RHS elements; | |
1147 | * set lcount negative to distinguish from lcount == 0, | |
1148 | * so the loop condition continues being true | |
1149 | */ | |
1150 | lcount = -1; | |
1151 | lelem--; /* no need to unmark this element */ | |
1152 | } | |
1153 | else if (!(do_rc1 && SvREFCNT(svl) == 1) && svl != &PL_sv_undef) { | |
1154 | assert(!SvIMMORTAL(svl)); | |
1155 | SvFLAGS(svl) |= SVf_BREAK; | |
1156 | marked = TRUE; | |
1157 | } | |
1158 | else if (!marked) { | |
1159 | /* don't check RH element if no SVf_BREAK flags set yet */ | |
1160 | if (!lcount) | |
1161 | break; | |
1162 | continue; | |
1163 | } | |
1164 | } | |
1165 | ||
1166 | /* see if corresponding RH element needs copying */ | |
1167 | ||
1168 | assert(marked); | |
1169 | svr = *relem; | |
1170 | assert(svr); | |
1171 | ||
1172 | if (UNLIKELY(SvFLAGS(svr) & SVf_BREAK)) { | |
1173 | ||
ebc643ce DM |
1174 | #ifdef DEBUGGING |
1175 | if (fake) { | |
9ae0115f | 1176 | /* op_dump(PL_op); */ |
ebc643ce DM |
1177 | Perl_croak(aTHX_ |
1178 | "panic: aassign skipped needed copy of common RH elem %" | |
1179 | UVuf, (UV)(relem - firstrelem)); | |
1180 | } | |
1181 | #endif | |
1182 | ||
a5f48505 DM |
1183 | TAINT_NOT; /* Each item is independent */ |
1184 | ||
1185 | /* Dear TODO test in t/op/sort.t, I love you. | |
1186 | (It's relying on a panic, not a "semi-panic" from newSVsv() | |
1187 | and then an assertion failure below.) */ | |
1188 | if (UNLIKELY(SvIS_FREED(svr))) { | |
1189 | Perl_croak(aTHX_ "panic: attempt to copy freed scalar %p", | |
1190 | (void*)svr); | |
1191 | } | |
1192 | /* avoid break flag while copying; otherwise COW etc | |
1193 | * disabled... */ | |
1194 | SvFLAGS(svr) &= ~SVf_BREAK; | |
1195 | /* Not newSVsv(), as it does not allow copy-on-write, | |
8c1e192f DM |
1196 | resulting in wasteful copies. |
1197 | Also, we use SV_NOSTEAL in case the SV is used more than | |
1198 | once, e.g. (...) = (f())[0,0] | |
1199 | Where the same SV appears twice on the RHS without a ref | |
1200 | count bump. (Although I suspect that the SV won't be | |
1201 | stealable here anyway - DAPM). | |
1202 | */ | |
a5f48505 DM |
1203 | *relem = sv_mortalcopy_flags(svr, |
1204 | SV_GMAGIC|SV_DO_COW_SVSETSV|SV_NOSTEAL); | |
1205 | /* ... but restore afterwards in case it's needed again, | |
1206 | * e.g. ($a,$b,$c) = (1,$a,$a) | |
1207 | */ | |
1208 | SvFLAGS(svr) |= SVf_BREAK; | |
1209 | } | |
1210 | ||
1211 | if (!lcount) | |
1212 | break; | |
1213 | } | |
1214 | ||
1215 | if (!marked) | |
1216 | return; | |
1217 | ||
1218 | /*unmark LHS */ | |
1219 | ||
1220 | while (lelem > firstlelem) { | |
1221 | SV * const svl = *(--lelem); | |
1222 | if (svl) | |
1223 | SvFLAGS(svl) &= ~SVf_BREAK; | |
1224 | } | |
1225 | } | |
1226 | ||
1227 | ||
1228 | ||
a0d0e21e LW |
1229 | PP(pp_aassign) |
1230 | { | |
27da23d5 | 1231 | dVAR; dSP; |
3280af22 NIS |
1232 | SV **lastlelem = PL_stack_sp; |
1233 | SV **lastrelem = PL_stack_base + POPMARK; | |
1234 | SV **firstrelem = PL_stack_base + POPMARK + 1; | |
a0d0e21e LW |
1235 | SV **firstlelem = lastrelem + 1; |
1236 | ||
eb578fdb KW |
1237 | SV **relem; |
1238 | SV **lelem; | |
a0d0e21e | 1239 | |
eb578fdb KW |
1240 | SV *sv; |
1241 | AV *ary; | |
a0d0e21e | 1242 | |
54310121 | 1243 | I32 gimme; |
a0d0e21e | 1244 | HV *hash; |
c70927a6 | 1245 | SSize_t i; |
a0d0e21e | 1246 | int magic; |
a5f48505 | 1247 | U32 lval; |
a68090fe DM |
1248 | /* PL_delaymagic is restored by JUMPENV_POP on dieing, so we |
1249 | * only need to save locally, not on the save stack */ | |
1250 | U16 old_delaymagic = PL_delaymagic; | |
ebc643ce DM |
1251 | #ifdef DEBUGGING |
1252 | bool fake = 0; | |
1253 | #endif | |
5637b936 | 1254 | |
3280af22 | 1255 | PL_delaymagic = DM_DELAY; /* catch simultaneous items */ |
a0d0e21e LW |
1256 | |
1257 | /* If there's a common identifier on both sides we have to take | |
1258 | * special care that assigning the identifier on the left doesn't | |
1259 | * clobber a value on the right that's used later in the list. | |
1260 | */ | |
acdea6f0 | 1261 | |
a5f48505 DM |
1262 | if ( (PL_op->op_private & (OPpASSIGN_COMMON_SCALAR|OPpASSIGN_COMMON_RC1)) |
1263 | /* at least 2 LH and RH elements, or commonality isn't an issue */ | |
1264 | && (firstlelem < lastlelem && firstrelem < lastrelem) | |
acdea6f0 | 1265 | ) { |
a5f48505 DM |
1266 | if (PL_op->op_private & OPpASSIGN_COMMON_RC1) { |
1267 | /* skip the scan if all scalars have a ref count of 1 */ | |
1268 | for (lelem = firstlelem; lelem <= lastlelem; lelem++) { | |
1269 | sv = *lelem; | |
1270 | if (!sv || SvREFCNT(sv) == 1) | |
1271 | continue; | |
1272 | if (SvTYPE(sv) != SVt_PVAV && SvTYPE(sv) != SVt_PVAV) | |
1273 | goto do_scan; | |
1274 | break; | |
1275 | } | |
1276 | } | |
1277 | else { | |
1278 | do_scan: | |
1279 | S_aassign_copy_common(aTHX_ | |
ebc643ce DM |
1280 | firstlelem, lastlelem, firstrelem, lastrelem |
1281 | #ifdef DEBUGGING | |
1282 | , fake | |
1283 | #endif | |
1284 | ); | |
a5f48505 | 1285 | } |
a0d0e21e | 1286 | } |
ebc643ce DM |
1287 | #ifdef DEBUGGING |
1288 | else { | |
1289 | /* on debugging builds, do the scan even if we've concluded we | |
1290 | * don't need to, then panic if we find commonality. Note that the | |
1291 | * scanner assumes at least 2 elements */ | |
1292 | if (firstlelem < lastlelem && firstrelem < lastrelem) { | |
1293 | fake = 1; | |
1294 | goto do_scan; | |
1295 | } | |
1296 | } | |
1297 | #endif | |
a0d0e21e | 1298 | |
a5f48505 DM |
1299 | gimme = GIMME_V; |
1300 | lval = (gimme == G_ARRAY) ? (PL_op->op_flags & OPf_MOD || LVRET) : 0; | |
1301 | ||
a0d0e21e LW |
1302 | relem = firstrelem; |
1303 | lelem = firstlelem; | |
4608196e RGS |
1304 | ary = NULL; |
1305 | hash = NULL; | |
10c8fecd | 1306 | |
5d9574c1 | 1307 | while (LIKELY(lelem <= lastlelem)) { |
bdaf10a5 | 1308 | bool alias = FALSE; |
bbce6d69 | 1309 | TAINT_NOT; /* Each item stands on its own, taintwise. */ |
a0d0e21e | 1310 | sv = *lelem++; |
bdaf10a5 FC |
1311 | if (UNLIKELY(!sv)) { |
1312 | alias = TRUE; | |
1313 | sv = *lelem++; | |
1314 | ASSUME(SvTYPE(sv) == SVt_PVAV); | |
1315 | } | |
a0d0e21e | 1316 | switch (SvTYPE(sv)) { |
a5f48505 DM |
1317 | case SVt_PVAV: { |
1318 | bool already_copied = FALSE; | |
60edcf09 | 1319 | ary = MUTABLE_AV(sv); |
748a9306 | 1320 | magic = SvMAGICAL(ary) != 0; |
60edcf09 FC |
1321 | ENTER; |
1322 | SAVEFREESV(SvREFCNT_inc_simple_NN(sv)); | |
a5f48505 DM |
1323 | |
1324 | /* We need to clear ary. The is a danger that if we do this, | |
1325 | * elements on the RHS may be prematurely freed, e.g. | |
1326 | * @a = ($a[0]); | |
1327 | * In the case of possible commonality, make a copy of each | |
1328 | * RHS SV *before* clearing the array, and add a reference | |
1329 | * from the tmps stack, so that it doesn't leak on death. | |
1330 | * Otherwise, make a copy of each RHS SV only as we're storing | |
1331 | * it into the array - that way we don't have to worry about | |
1332 | * it being leaked if we die, but don't incur the cost of | |
1333 | * mortalising everything. | |
1334 | */ | |
1335 | ||
1336 | if ( (PL_op->op_private & OPpASSIGN_COMMON_AGG) | |
1337 | && (relem <= lastrelem) | |
1338 | && (magic || AvFILL(ary) != -1)) | |
1339 | { | |
1340 | SV **svp; | |
1341 | EXTEND_MORTAL(lastrelem - relem + 1); | |
1342 | for (svp = relem; svp <= lastrelem; svp++) { | |
8c1e192f | 1343 | /* see comment in S_aassign_copy_common about SV_NOSTEAL */ |
a5f48505 DM |
1344 | *svp = sv_mortalcopy_flags(*svp, |
1345 | SV_GMAGIC|SV_DO_COW_SVSETSV|SV_NOSTEAL); | |
1346 | TAINT_NOT; | |
1347 | } | |
1348 | already_copied = TRUE; | |
1349 | } | |
1350 | ||
1351 | av_clear(ary); | |
6768377c DM |
1352 | if (relem <= lastrelem) |
1353 | av_extend(ary, lastrelem - relem); | |
1354 | ||
a0d0e21e LW |
1355 | i = 0; |
1356 | while (relem <= lastrelem) { /* gobble up all the rest */ | |
5117ca91 | 1357 | SV **didstore; |
bdaf10a5 | 1358 | if (LIKELY(!alias)) { |
a5f48505 DM |
1359 | if (already_copied) |
1360 | sv = *relem; | |
1361 | else { | |
1362 | if (LIKELY(*relem)) | |
1363 | /* before newSV, in case it dies */ | |
1364 | SvGETMAGIC(*relem); | |
1365 | sv = newSV(0); | |
8c1e192f DM |
1366 | /* see comment in S_aassign_copy_common about |
1367 | * SV_NOSTEAL */ | |
1368 | sv_setsv_flags(sv, *relem, | |
1369 | (SV_DO_COW_SVSETSV|SV_NOSTEAL)); | |
a5f48505 DM |
1370 | *relem = sv; |
1371 | } | |
bdaf10a5 FC |
1372 | } |
1373 | else { | |
a5f48505 DM |
1374 | if (!already_copied) |
1375 | SvGETMAGIC(*relem); | |
bdaf10a5 FC |
1376 | if (!SvROK(*relem)) |
1377 | DIE(aTHX_ "Assigned value is not a reference"); | |
1378 | if (SvTYPE(SvRV(*relem)) > SVt_PVLV) | |
1379 | /* diag_listed_as: Assigned value is not %s reference */ | |
1380 | DIE(aTHX_ | |
1381 | "Assigned value is not a SCALAR reference"); | |
a5f48505 | 1382 | if (lval && !already_copied) |
bdaf10a5 FC |
1383 | *relem = sv_mortalcopy(*relem); |
1384 | /* XXX else check for weak refs? */ | |
0ad694a7 | 1385 | sv = SvREFCNT_inc_NN(SvRV(*relem)); |
bdaf10a5 FC |
1386 | } |
1387 | relem++; | |
a5f48505 | 1388 | if (already_copied) |
0ad694a7 | 1389 | SvREFCNT_inc_simple_void_NN(sv); /* undo mortal free */ |
5117ca91 GS |
1390 | didstore = av_store(ary,i++,sv); |
1391 | if (magic) { | |
18024492 FC |
1392 | if (!didstore) |
1393 | sv_2mortal(sv); | |
8ef24240 | 1394 | if (SvSMAGICAL(sv)) |
fb73857a | 1395 | mg_set(sv); |
5117ca91 | 1396 | } |
bbce6d69 | 1397 | TAINT_NOT; |
a0d0e21e | 1398 | } |
5d9574c1 | 1399 | if (UNLIKELY(PL_delaymagic & DM_ARRAY_ISA)) |
ad64d0ec | 1400 | SvSETMAGIC(MUTABLE_SV(ary)); |
60edcf09 | 1401 | LEAVE; |
a0d0e21e | 1402 | break; |
a5f48505 DM |
1403 | } |
1404 | ||
10c8fecd | 1405 | case SVt_PVHV: { /* normal hash */ |
a0d0e21e | 1406 | SV *tmpstr; |
1c4ea384 RZ |
1407 | int odd; |
1408 | int duplicates = 0; | |
45960564 | 1409 | SV** topelem = relem; |
1c4ea384 | 1410 | SV **firsthashrelem = relem; |
a5f48505 | 1411 | bool already_copied = FALSE; |
a0d0e21e | 1412 | |
60edcf09 | 1413 | hash = MUTABLE_HV(sv); |
748a9306 | 1414 | magic = SvMAGICAL(hash) != 0; |
1c4ea384 RZ |
1415 | |
1416 | odd = ((lastrelem - firsthashrelem)&1)? 0 : 1; | |
5d9574c1 | 1417 | if (UNLIKELY(odd)) { |
fb8f4cf8 | 1418 | do_oddball(lastrelem, firsthashrelem); |
1d2b3927 HS |
1419 | /* we have firstlelem to reuse, it's not needed anymore |
1420 | */ | |
1c4ea384 RZ |
1421 | *(lastrelem+1) = &PL_sv_undef; |
1422 | } | |
1423 | ||
60edcf09 FC |
1424 | ENTER; |
1425 | SAVEFREESV(SvREFCNT_inc_simple_NN(sv)); | |
a5f48505 DM |
1426 | |
1427 | /* We need to clear hash. The is a danger that if we do this, | |
1428 | * elements on the RHS may be prematurely freed, e.g. | |
1429 | * %h = (foo => $h{bar}); | |
1430 | * In the case of possible commonality, make a copy of each | |
1431 | * RHS SV *before* clearing the hash, and add a reference | |
1432 | * from the tmps stack, so that it doesn't leak on death. | |
1433 | */ | |
1434 | ||
1435 | if ( (PL_op->op_private & OPpASSIGN_COMMON_AGG) | |
1436 | && (relem <= lastrelem) | |
1437 | && (magic || HvUSEDKEYS(hash))) | |
1438 | { | |
1439 | SV **svp; | |
1440 | EXTEND_MORTAL(lastrelem - relem + 1); | |
1441 | for (svp = relem; svp <= lastrelem; svp++) { | |
1442 | *svp = sv_mortalcopy_flags(*svp, | |
1443 | SV_GMAGIC|SV_DO_COW_SVSETSV|SV_NOSTEAL); | |
1444 | TAINT_NOT; | |
1445 | } | |
1446 | already_copied = TRUE; | |
1447 | } | |
1448 | ||
a0d0e21e | 1449 | hv_clear(hash); |
a5f48505 | 1450 | |
5d9574c1 | 1451 | while (LIKELY(relem < lastrelem+odd)) { /* gobble up all the rest */ |
5117ca91 | 1452 | HE *didstore; |
1c4ea384 | 1453 | assert(*relem); |
632b9d6f FC |
1454 | /* Copy the key if aassign is called in lvalue context, |
1455 | to avoid having the next op modify our rhs. Copy | |
1456 | it also if it is gmagical, lest it make the | |
1457 | hv_store_ent call below croak, leaking the value. */ | |
a5f48505 | 1458 | sv = (lval || SvGMAGICAL(*relem)) && !already_copied |
632b9d6f FC |
1459 | ? sv_mortalcopy(*relem) |
1460 | : *relem; | |
45960564 | 1461 | relem++; |
1c4ea384 | 1462 | assert(*relem); |
a5f48505 DM |
1463 | if (already_copied) |
1464 | tmpstr = *relem++; | |
1465 | else { | |
1466 | SvGETMAGIC(*relem); | |
1467 | tmpstr = newSV(0); | |
1468 | sv_setsv_nomg(tmpstr,*relem++); /* value */ | |
1469 | } | |
1470 | ||
a88bf2bc | 1471 | if (gimme == G_ARRAY) { |
45960564 DM |
1472 | if (hv_exists_ent(hash, sv, 0)) |
1473 | /* key overwrites an existing entry */ | |
1474 | duplicates += 2; | |
a88bf2bc | 1475 | else { |
45960564 | 1476 | /* copy element back: possibly to an earlier |
1d2b3927 HS |
1477 | * stack location if we encountered dups earlier, |
1478 | * possibly to a later stack location if odd */ | |
45960564 DM |
1479 | *topelem++ = sv; |
1480 | *topelem++ = tmpstr; | |
1481 | } | |
1482 | } | |
a5f48505 | 1483 | if (already_copied) |
0ad694a7 | 1484 | SvREFCNT_inc_simple_void_NN(tmpstr); /* undo mortal free */ |
5117ca91 | 1485 | didstore = hv_store_ent(hash,sv,tmpstr,0); |
632b9d6f FC |
1486 | if (magic) { |
1487 | if (!didstore) sv_2mortal(tmpstr); | |
1488 | SvSETMAGIC(tmpstr); | |
1489 | } | |
bbce6d69 | 1490 | TAINT_NOT; |
8e07c86e | 1491 | } |
60edcf09 | 1492 | LEAVE; |
1c4ea384 RZ |
1493 | if (duplicates && gimme == G_ARRAY) { |
1494 | /* at this point we have removed the duplicate key/value | |
1495 | * pairs from the stack, but the remaining values may be | |
1496 | * wrong; i.e. with (a 1 a 2 b 3) on the stack we've removed | |
1497 | * the (a 2), but the stack now probably contains | |
1498 | * (a <freed> b 3), because { hv_save(a,1); hv_save(a,2) } | |
1499 | * obliterates the earlier key. So refresh all values. */ | |
1500 | lastrelem -= duplicates; | |
1501 | relem = firsthashrelem; | |
1502 | while (relem < lastrelem+odd) { | |
1503 | HE *he; | |
1504 | he = hv_fetch_ent(hash, *relem++, 0, 0); | |
1505 | *relem++ = (he ? HeVAL(he) : &PL_sv_undef); | |
1506 | } | |
1507 | } | |
1508 | if (odd && gimme == G_ARRAY) lastrelem++; | |
a0d0e21e LW |
1509 | } |
1510 | break; | |
1511 | default: | |
6fc92669 GS |
1512 | if (SvIMMORTAL(sv)) { |
1513 | if (relem <= lastrelem) | |
1514 | relem++; | |
1515 | break; | |
a0d0e21e LW |
1516 | } |
1517 | if (relem <= lastrelem) { | |
5d9574c1 | 1518 | if (UNLIKELY( |
1c70fb82 FC |
1519 | SvTEMP(sv) && !SvSMAGICAL(sv) && SvREFCNT(sv) == 1 && |
1520 | (!isGV_with_GP(sv) || SvFAKE(sv)) && ckWARN(WARN_MISC) | |
5d9574c1 | 1521 | )) |
1c70fb82 FC |
1522 | Perl_warner(aTHX_ |
1523 | packWARN(WARN_MISC), | |
1524 | "Useless assignment to a temporary" | |
1525 | ); | |
a0d0e21e LW |
1526 | sv_setsv(sv, *relem); |
1527 | *(relem++) = sv; | |
1528 | } | |
1529 | else | |
3280af22 | 1530 | sv_setsv(sv, &PL_sv_undef); |
8ef24240 | 1531 | SvSETMAGIC(sv); |
a0d0e21e LW |
1532 | break; |
1533 | } | |
1534 | } | |
5d9574c1 | 1535 | if (UNLIKELY(PL_delaymagic & ~DM_DELAY)) { |
985213f2 | 1536 | /* Will be used to set PL_tainting below */ |
dfff4baf BF |
1537 | Uid_t tmp_uid = PerlProc_getuid(); |
1538 | Uid_t tmp_euid = PerlProc_geteuid(); | |
1539 | Gid_t tmp_gid = PerlProc_getgid(); | |
1540 | Gid_t tmp_egid = PerlProc_getegid(); | |
985213f2 | 1541 | |
b469f1e0 | 1542 | /* XXX $> et al currently silently ignore failures */ |
3280af22 | 1543 | if (PL_delaymagic & DM_UID) { |
a0d0e21e | 1544 | #ifdef HAS_SETRESUID |
b469f1e0 JH |
1545 | PERL_UNUSED_RESULT( |
1546 | setresuid((PL_delaymagic & DM_RUID) ? PL_delaymagic_uid : (Uid_t)-1, | |
1547 | (PL_delaymagic & DM_EUID) ? PL_delaymagic_euid : (Uid_t)-1, | |
1548 | (Uid_t)-1)); | |
56febc5e AD |
1549 | #else |
1550 | # ifdef HAS_SETREUID | |
b469f1e0 JH |
1551 | PERL_UNUSED_RESULT( |
1552 | setreuid((PL_delaymagic & DM_RUID) ? PL_delaymagic_uid : (Uid_t)-1, | |
1553 | (PL_delaymagic & DM_EUID) ? PL_delaymagic_euid : (Uid_t)-1)); | |
56febc5e AD |
1554 | # else |
1555 | # ifdef HAS_SETRUID | |
b28d0864 | 1556 | if ((PL_delaymagic & DM_UID) == DM_RUID) { |
b469f1e0 | 1557 | PERL_UNUSED_RESULT(setruid(PL_delaymagic_uid)); |
b28d0864 | 1558 | PL_delaymagic &= ~DM_RUID; |
a0d0e21e | 1559 | } |
56febc5e AD |
1560 | # endif /* HAS_SETRUID */ |
1561 | # ifdef HAS_SETEUID | |
b28d0864 | 1562 | if ((PL_delaymagic & DM_UID) == DM_EUID) { |
b469f1e0 | 1563 | PERL_UNUSED_RESULT(seteuid(PL_delaymagic_euid)); |
b28d0864 | 1564 | PL_delaymagic &= ~DM_EUID; |
a0d0e21e | 1565 | } |
56febc5e | 1566 | # endif /* HAS_SETEUID */ |
b28d0864 | 1567 | if (PL_delaymagic & DM_UID) { |
985213f2 | 1568 | if (PL_delaymagic_uid != PL_delaymagic_euid) |
cea2e8a9 | 1569 | DIE(aTHX_ "No setreuid available"); |
b469f1e0 | 1570 | PERL_UNUSED_RESULT(PerlProc_setuid(PL_delaymagic_uid)); |
a0d0e21e | 1571 | } |
56febc5e AD |
1572 | # endif /* HAS_SETREUID */ |
1573 | #endif /* HAS_SETRESUID */ | |
04783dc7 | 1574 | |
985213f2 AB |
1575 | tmp_uid = PerlProc_getuid(); |
1576 | tmp_euid = PerlProc_geteuid(); | |
a0d0e21e | 1577 | } |
b469f1e0 | 1578 | /* XXX $> et al currently silently ignore failures */ |
3280af22 | 1579 | if (PL_delaymagic & DM_GID) { |
a0d0e21e | 1580 | #ifdef HAS_SETRESGID |
b469f1e0 JH |
1581 | PERL_UNUSED_RESULT( |
1582 | setresgid((PL_delaymagic & DM_RGID) ? PL_delaymagic_gid : (Gid_t)-1, | |
1583 | (PL_delaymagic & DM_EGID) ? PL_delaymagic_egid : (Gid_t)-1, | |
1584 | (Gid_t)-1)); | |
56febc5e AD |
1585 | #else |
1586 | # ifdef HAS_SETREGID | |
b469f1e0 JH |
1587 | PERL_UNUSED_RESULT( |
1588 | setregid((PL_delaymagic & DM_RGID) ? PL_delaymagic_gid : (Gid_t)-1, | |
1589 | (PL_delaymagic & DM_EGID) ? PL_delaymagic_egid : (Gid_t)-1)); | |
56febc5e AD |
1590 | # else |
1591 | # ifdef HAS_SETRGID | |
b28d0864 | 1592 | if ((PL_delaymagic & DM_GID) == DM_RGID) { |
b469f1e0 | 1593 | PERL_UNUSED_RESULT(setrgid(PL_delaymagic_gid)); |
b28d0864 | 1594 | PL_delaymagic &= ~DM_RGID; |
a0d0e21e | 1595 | } |
56febc5e AD |
1596 | # endif /* HAS_SETRGID */ |
1597 | # ifdef HAS_SETEGID | |
b28d0864 | 1598 | if ((PL_delaymagic & DM_GID) == DM_EGID) { |
b469f1e0 | 1599 | PERL_UNUSED_RESULT(setegid(PL_delaymagic_egid)); |
b28d0864 | 1600 | PL_delaymagic &= ~DM_EGID; |
a0d0e21e | 1601 | } |
56febc5e | 1602 | # endif /* HAS_SETEGID */ |
b28d0864 | 1603 | if (PL_delaymagic & DM_GID) { |
985213f2 | 1604 | if (PL_delaymagic_gid != PL_delaymagic_egid) |
cea2e8a9 | 1605 | DIE(aTHX_ "No setregid available"); |
b469f1e0 | 1606 | PERL_UNUSED_RESULT(PerlProc_setgid(PL_delaymagic_gid)); |
a0d0e21e | 1607 | } |
56febc5e AD |
1608 | # endif /* HAS_SETREGID */ |
1609 | #endif /* HAS_SETRESGID */ | |
04783dc7 | 1610 | |
985213f2 AB |
1611 | tmp_gid = PerlProc_getgid(); |
1612 | tmp_egid = PerlProc_getegid(); | |
a0d0e21e | 1613 | } |
284167a5 | 1614 | TAINTING_set( TAINTING_get | (tmp_uid && (tmp_euid != tmp_uid || tmp_egid != tmp_gid)) ); |
9a9b5ec9 DM |
1615 | #ifdef NO_TAINT_SUPPORT |
1616 | PERL_UNUSED_VAR(tmp_uid); | |
1617 | PERL_UNUSED_VAR(tmp_euid); | |
1618 | PERL_UNUSED_VAR(tmp_gid); | |
1619 | PERL_UNUSED_VAR(tmp_egid); | |
1620 | #endif | |
a0d0e21e | 1621 | } |
a68090fe | 1622 | PL_delaymagic = old_delaymagic; |
54310121 | 1623 | |
54310121 | 1624 | if (gimme == G_VOID) |
1625 | SP = firstrelem - 1; | |
1626 | else if (gimme == G_SCALAR) { | |
1627 | dTARGET; | |
1628 | SP = firstrelem; | |
231cbeb2 | 1629 | SETi(lastrelem - firstrelem + 1); |
54310121 | 1630 | } |
1631 | else { | |
1c4ea384 | 1632 | if (ary || hash) |
1d2b3927 HS |
1633 | /* note that in this case *firstlelem may have been overwritten |
1634 | by sv_undef in the odd hash case */ | |
a0d0e21e | 1635 | SP = lastrelem; |
1c4ea384 | 1636 | else { |
a0d0e21e | 1637 | SP = firstrelem + (lastlelem - firstlelem); |
1c4ea384 RZ |
1638 | lelem = firstlelem + (relem - firstrelem); |
1639 | while (relem <= SP) | |
1640 | *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef; | |
1641 | } | |
a0d0e21e | 1642 | } |
08aeb9f7 | 1643 | |
54310121 | 1644 | RETURN; |
a0d0e21e LW |
1645 | } |
1646 | ||
8782bef2 GB |
1647 | PP(pp_qr) |
1648 | { | |
20b7effb | 1649 | dSP; |
eb578fdb | 1650 | PMOP * const pm = cPMOP; |
fe578d7f | 1651 | REGEXP * rx = PM_GETRE(pm); |
10599a69 | 1652 | SV * const pkg = rx ? CALLREG_PACKAGE(rx) : NULL; |
c4420975 | 1653 | SV * const rv = sv_newmortal(); |
d63c20f2 DM |
1654 | CV **cvp; |
1655 | CV *cv; | |
288b8c02 NC |
1656 | |
1657 | SvUPGRADE(rv, SVt_IV); | |
c2123ae3 NC |
1658 | /* For a subroutine describing itself as "This is a hacky workaround" I'm |
1659 | loathe to use it here, but it seems to be the right fix. Or close. | |
1660 | The key part appears to be that it's essential for pp_qr to return a new | |
1661 | object (SV), which implies that there needs to be an effective way to | |
1662 | generate a new SV from the existing SV that is pre-compiled in the | |
1663 | optree. */ | |
1664 | SvRV_set(rv, MUTABLE_SV(reg_temp_copy(NULL, rx))); | |
288b8c02 NC |
1665 | SvROK_on(rv); |
1666 | ||
8d919b0a | 1667 | cvp = &( ReANY((REGEXP *)SvRV(rv))->qr_anoncv); |
5d9574c1 | 1668 | if (UNLIKELY((cv = *cvp) && CvCLONE(*cvp))) { |
d63c20f2 | 1669 | *cvp = cv_clone(cv); |
fc2b2dca | 1670 | SvREFCNT_dec_NN(cv); |
d63c20f2 DM |
1671 | } |
1672 | ||
288b8c02 | 1673 | if (pkg) { |
f815daf2 | 1674 | HV *const stash = gv_stashsv(pkg, GV_ADD); |
fc2b2dca | 1675 | SvREFCNT_dec_NN(pkg); |
288b8c02 NC |
1676 | (void)sv_bless(rv, stash); |
1677 | } | |
1678 | ||
5d9574c1 | 1679 | if (UNLIKELY(RX_ISTAINTED(rx))) { |
e08e52cf | 1680 | SvTAINTED_on(rv); |
9274aefd DM |
1681 | SvTAINTED_on(SvRV(rv)); |
1682 | } | |
c8c13c22 JB |
1683 | XPUSHs(rv); |
1684 | RETURN; | |
8782bef2 GB |
1685 | } |
1686 | ||
a0d0e21e LW |
1687 | PP(pp_match) |
1688 | { | |
20b7effb | 1689 | dSP; dTARG; |
eb578fdb | 1690 | PMOP *pm = cPMOP; |
d65afb4b | 1691 | PMOP *dynpm = pm; |
eb578fdb | 1692 | const char *s; |
5c144d81 | 1693 | const char *strend; |
99a90e59 | 1694 | SSize_t curpos = 0; /* initial pos() or current $+[0] */ |
a0d0e21e | 1695 | I32 global; |
7fadf4a7 | 1696 | U8 r_flags = 0; |
5c144d81 | 1697 | const char *truebase; /* Start of string */ |
eb578fdb | 1698 | REGEXP *rx = PM_GETRE(pm); |
b3eb6a9b | 1699 | bool rxtainted; |
82334630 | 1700 | const I32 gimme = GIMME_V; |
a0d0e21e | 1701 | STRLEN len; |
a3b680e6 | 1702 | const I32 oldsave = PL_savestack_ix; |
e60df1fa | 1703 | I32 had_zerolen = 0; |
b1422d62 | 1704 | MAGIC *mg = NULL; |
a0d0e21e | 1705 | |
533c011a | 1706 | if (PL_op->op_flags & OPf_STACKED) |
a0d0e21e | 1707 | TARG = POPs; |
6ffceeb7 | 1708 | else if (ARGTARG) |
59f00321 | 1709 | GETTARGET; |
a0d0e21e | 1710 | else { |
54b9620d | 1711 | TARG = DEFSV; |
a0d0e21e LW |
1712 | EXTEND(SP,1); |
1713 | } | |
d9f424b2 | 1714 | |
c277df42 | 1715 | PUTBACK; /* EVAL blocks need stack_sp. */ |
69dc4b30 FC |
1716 | /* Skip get-magic if this is a qr// clone, because regcomp has |
1717 | already done it. */ | |
f1d31338 | 1718 | truebase = ReANY(rx)->mother_re |
69dc4b30 FC |
1719 | ? SvPV_nomg_const(TARG, len) |
1720 | : SvPV_const(TARG, len); | |
f1d31338 | 1721 | if (!truebase) |
2269b42e | 1722 | DIE(aTHX_ "panic: pp_match"); |
f1d31338 | 1723 | strend = truebase + len; |
284167a5 S |
1724 | rxtainted = (RX_ISTAINTED(rx) || |
1725 | (TAINT_get && (pm->op_pmflags & PMf_RETAINT))); | |
9212bbba | 1726 | TAINT_NOT; |
a0d0e21e | 1727 | |
6c864ec2 | 1728 | /* We need to know this in case we fail out early - pos() must be reset */ |
de0df3c0 MH |
1729 | global = dynpm->op_pmflags & PMf_GLOBAL; |
1730 | ||
d65afb4b | 1731 | /* PMdf_USED is set after a ?? matches once */ |
c737faaf YO |
1732 | if ( |
1733 | #ifdef USE_ITHREADS | |
1734 | SvREADONLY(PL_regex_pad[pm->op_pmoffset]) | |
1735 | #else | |
1736 | pm->op_pmflags & PMf_USED | |
1737 | #endif | |
1738 | ) { | |
e5dc5375 | 1739 | DEBUG_r(PerlIO_printf(Perl_debug_log, "?? already matched once")); |
de0df3c0 | 1740 | goto nope; |
a0d0e21e LW |
1741 | } |
1742 | ||
7e313637 FC |
1743 | /* empty pattern special-cased to use last successful pattern if |
1744 | possible, except for qr// */ | |
8d919b0a | 1745 | if (!ReANY(rx)->mother_re && !RX_PRELEN(rx) |
7e313637 | 1746 | && PL_curpm) { |
3280af22 | 1747 | pm = PL_curpm; |
aaa362c4 | 1748 | rx = PM_GETRE(pm); |
a0d0e21e | 1749 | } |
d65afb4b | 1750 | |
389ecb56 | 1751 | if (RX_MINLEN(rx) >= 0 && (STRLEN)RX_MINLEN(rx) > len) { |
75d43e96 FC |
1752 | DEBUG_r(PerlIO_printf(Perl_debug_log, "String shorter than min possible regex match (%" |
1753 | UVuf" < %"IVdf")\n", | |
1754 | (UV)len, (IV)RX_MINLEN(rx))); | |
de0df3c0 | 1755 | goto nope; |
e5dc5375 | 1756 | } |
c277df42 | 1757 | |
8ef97b0e | 1758 | /* get pos() if //g */ |
de0df3c0 | 1759 | if (global) { |
b1422d62 | 1760 | mg = mg_find_mglob(TARG); |
8ef97b0e | 1761 | if (mg && mg->mg_len >= 0) { |
25fdce4a | 1762 | curpos = MgBYTEPOS(mg, TARG, truebase, len); |
8ef97b0e DM |
1763 | /* last time pos() was set, it was zero-length match */ |
1764 | if (mg->mg_flags & MGf_MINMATCH) | |
1765 | had_zerolen = 1; | |
1766 | } | |
a0d0e21e | 1767 | } |
8ef97b0e | 1768 | |
6e240d0b | 1769 | #ifdef PERL_SAWAMPERSAND |
a41aa44d | 1770 | if ( RX_NPARENS(rx) |
6502e081 | 1771 | || PL_sawampersand |
6502e081 | 1772 | || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY)) |
5b0e71e9 | 1773 | || (dynpm->op_pmflags & PMf_KEEPCOPY) |
6e240d0b FC |
1774 | ) |
1775 | #endif | |
1776 | { | |
6502e081 DM |
1777 | r_flags |= (REXEC_COPY_STR|REXEC_COPY_SKIP_PRE); |
1778 | /* in @a =~ /(.)/g, we iterate multiple times, but copy the buffer | |
1779 | * only on the first iteration. Therefore we need to copy $' as well | |
1780 | * as $&, to make the rest of the string available for captures in | |
1781 | * subsequent iterations */ | |
1782 | if (! (global && gimme == G_ARRAY)) | |
1783 | r_flags |= REXEC_COPY_SKIP_POST; | |
1784 | }; | |
5b0e71e9 DM |
1785 | #ifdef PERL_SAWAMPERSAND |
1786 | if (dynpm->op_pmflags & PMf_KEEPCOPY) | |
1787 | /* handle KEEPCOPY in pmop but not rx, eg $r=qr/a/; /$r/p */ | |
1788 | r_flags &= ~(REXEC_COPY_SKIP_PRE|REXEC_COPY_SKIP_POST); | |
1789 | #endif | |
22e551b9 | 1790 | |
f1d31338 DM |
1791 | s = truebase; |
1792 | ||
d7be1480 | 1793 | play_it_again: |
985afbc1 | 1794 | if (global) |
03c83e26 | 1795 | s = truebase + curpos; |
f722798b | 1796 | |
77da2310 | 1797 | if (!CALLREGEXEC(rx, (char*)s, (char *)strend, (char*)truebase, |
03c83e26 | 1798 | had_zerolen, TARG, NULL, r_flags)) |
03b6c93d | 1799 | goto nope; |
77da2310 NC |
1800 | |
1801 | PL_curpm = pm; | |
985afbc1 | 1802 | if (dynpm->op_pmflags & PMf_ONCE) |
c737faaf | 1803 | #ifdef USE_ITHREADS |
77da2310 | 1804 | SvREADONLY_on(PL_regex_pad[dynpm->op_pmoffset]); |
c737faaf | 1805 | #else |
77da2310 | 1806 | dynpm->op_pmflags |= PMf_USED; |
c737faaf | 1807 | #endif |
a0d0e21e | 1808 | |
72311751 GS |
1809 | if (rxtainted) |
1810 | RX_MATCH_TAINTED_on(rx); | |
1811 | TAINT_IF(RX_MATCH_TAINTED(rx)); | |
35c2ccc3 DM |
1812 | |
1813 | /* update pos */ | |
1814 | ||
1815 | if (global && (gimme != G_ARRAY || (dynpm->op_pmflags & PMf_CONTINUE))) { | |
b1422d62 | 1816 | if (!mg) |
35c2ccc3 | 1817 | mg = sv_magicext_mglob(TARG); |
25fdce4a | 1818 | MgBYTEPOS_set(mg, TARG, truebase, RX_OFFS(rx)[0].end); |
adf51885 DM |
1819 | if (RX_ZERO_LEN(rx)) |
1820 | mg->mg_flags |= MGf_MINMATCH; | |
1821 | else | |
1822 | mg->mg_flags &= ~MGf_MINMATCH; | |
35c2ccc3 DM |
1823 | } |
1824 | ||
bf9dff51 DM |
1825 | if ((!RX_NPARENS(rx) && !global) || gimme != G_ARRAY) { |
1826 | LEAVE_SCOPE(oldsave); | |
1827 | RETPUSHYES; | |
1828 | } | |
1829 | ||
88ab22af DM |
1830 | /* push captures on stack */ |
1831 | ||
bf9dff51 | 1832 | { |
07bc277f | 1833 | const I32 nparens = RX_NPARENS(rx); |
a3b680e6 | 1834 | I32 i = (global && !nparens) ? 1 : 0; |
a0d0e21e | 1835 | |
c277df42 | 1836 | SPAGAIN; /* EVAL blocks could move the stack. */ |
ffc61ed2 JH |
1837 | EXTEND(SP, nparens + i); |
1838 | EXTEND_MORTAL(nparens + i); | |
1839 | for (i = !i; i <= nparens; i++) { | |
a0d0e21e | 1840 | PUSHs(sv_newmortal()); |
5d9574c1 DM |
1841 | if (LIKELY((RX_OFFS(rx)[i].start != -1) |
1842 | && RX_OFFS(rx)[i].end != -1 )) | |
1843 | { | |
07bc277f | 1844 | const I32 len = RX_OFFS(rx)[i].end - RX_OFFS(rx)[i].start; |
f1d31338 | 1845 | const char * const s = RX_OFFS(rx)[i].start + truebase; |
5d9574c1 DM |
1846 | if (UNLIKELY(RX_OFFS(rx)[i].end < 0 || RX_OFFS(rx)[i].start < 0 |
1847 | || len < 0 || len > strend - s)) | |
5637ef5b NC |
1848 | DIE(aTHX_ "panic: pp_match start/end pointers, i=%ld, " |
1849 | "start=%ld, end=%ld, s=%p, strend=%p, len=%"UVuf, | |
1850 | (long) i, (long) RX_OFFS(rx)[i].start, | |
1851 | (long)RX_OFFS(rx)[i].end, s, strend, (UV) len); | |
a0d0e21e | 1852 | sv_setpvn(*SP, s, len); |
cce850e4 | 1853 | if (DO_UTF8(TARG) && is_utf8_string((U8*)s, len)) |
a197cbdd | 1854 | SvUTF8_on(*SP); |
a0d0e21e LW |
1855 | } |
1856 | } | |
1857 | if (global) { | |
0e0b3e82 | 1858 | curpos = (UV)RX_OFFS(rx)[0].end; |
03c83e26 | 1859 | had_zerolen = RX_ZERO_LEN(rx); |
c277df42 | 1860 | PUTBACK; /* EVAL blocks may use stack */ |
cf93c79d | 1861 | r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST; |
a0d0e21e LW |
1862 | goto play_it_again; |
1863 | } | |
4633a7c4 | 1864 | LEAVE_SCOPE(oldsave); |
a0d0e21e LW |
1865 | RETURN; |
1866 | } | |
e5964223 | 1867 | NOT_REACHED; /* NOTREACHED */ |
a0d0e21e | 1868 | |
7b52d656 | 1869 | nope: |
d65afb4b | 1870 | if (global && !(dynpm->op_pmflags & PMf_CONTINUE)) { |
b1422d62 DM |
1871 | if (!mg) |
1872 | mg = mg_find_mglob(TARG); | |
1873 | if (mg) | |
1874 | mg->mg_len = -1; | |
a0d0e21e | 1875 | } |
4633a7c4 | 1876 | LEAVE_SCOPE(oldsave); |
a0d0e21e LW |
1877 | if (gimme == G_ARRAY) |
1878 | RETURN; | |
1879 | RETPUSHNO; | |
1880 | } | |
1881 | ||
1882 | OP * | |
864dbfa3 | 1883 | Perl_do_readline(pTHX) |
a0d0e21e | 1884 | { |
20b7effb | 1885 | dSP; dTARGETSTACKED; |
eb578fdb | 1886 | SV *sv; |
a0d0e21e LW |
1887 | STRLEN tmplen = 0; |
1888 | STRLEN offset; | |
760ac839 | 1889 | PerlIO *fp; |
eb578fdb KW |
1890 | IO * const io = GvIO(PL_last_in_gv); |
1891 | const I32 type = PL_op->op_type; | |
a3b680e6 | 1892 | const I32 gimme = GIMME_V; |
a0d0e21e | 1893 | |
6136c704 | 1894 | if (io) { |
50db69d8 | 1895 | const MAGIC *const mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar); |
6136c704 | 1896 | if (mg) { |
3e0cb5de | 1897 | Perl_tied_method(aTHX_ SV_CONST(READLINE), SP, MUTABLE_SV(io), mg, gimme, 0); |
6136c704 | 1898 | if (gimme == G_SCALAR) { |
50db69d8 NC |
1899 | SPAGAIN; |
1900 | SvSetSV_nosteal(TARG, TOPs); | |
1901 | SETTARG; | |
6136c704 | 1902 | } |
50db69d8 | 1903 | return NORMAL; |
0b7c7b4f | 1904 | } |
e79b0511 | 1905 | } |
4608196e | 1906 | fp = NULL; |
a0d0e21e LW |
1907 | if (io) { |
1908 | fp = IoIFP(io); | |
1909 | if (!fp) { | |
1910 | if (IoFLAGS(io) & IOf_ARGV) { | |
1911 | if (IoFLAGS(io) & IOf_START) { | |
a0d0e21e | 1912 | IoLINES(io) = 0; |
b9f2b683 | 1913 | if (av_tindex(GvAVn(PL_last_in_gv)) < 0) { |
1d7c1841 | 1914 | IoFLAGS(io) &= ~IOf_START; |
d5eb9a46 | 1915 | do_open6(PL_last_in_gv, "-", 1, NULL, NULL, 0); |
4bac9ae4 | 1916 | SvTAINTED_off(GvSVn(PL_last_in_gv)); /* previous tainting irrelevant */ |
76f68e9b | 1917 | sv_setpvs(GvSVn(PL_last_in_gv), "-"); |
3280af22 | 1918 | SvSETMAGIC(GvSV(PL_last_in_gv)); |
a2008d6d GS |
1919 | fp = IoIFP(io); |
1920 | goto have_fp; | |
a0d0e21e LW |
1921 | } |
1922 | } | |
157fb5a1 | 1923 | fp = nextargv(PL_last_in_gv, PL_op->op_flags & OPf_SPECIAL); |
a0d0e21e | 1924 | if (!fp) { /* Note: fp != IoIFP(io) */ |
3280af22 | 1925 | (void)do_close(PL_last_in_gv, FALSE); /* now it does*/ |
a0d0e21e LW |
1926 | } |
1927 | } | |
0d44d22b NC |
1928 | else if (type == OP_GLOB) |
1929 | fp = Perl_start_glob(aTHX_ POPs, io); | |
a0d0e21e LW |
1930 | } |
1931 | else if (type == OP_GLOB) | |
1932 | SP--; | |
7716c5c5 | 1933 | else if (IoTYPE(io) == IoTYPE_WRONLY) { |
a5390457 | 1934 | report_wrongway_fh(PL_last_in_gv, '>'); |
a00b5bd3 | 1935 | } |
a0d0e21e LW |
1936 | } |
1937 | if (!fp) { | |
041457d9 | 1938 | if ((!io || !(IoFLAGS(io) & IOf_START)) |
de7dabb6 TC |
1939 | && ckWARN(WARN_CLOSED) |
1940 | && type != OP_GLOB) | |
041457d9 | 1941 | { |
de7dabb6 | 1942 | report_evil_fh(PL_last_in_gv); |
3f4520fe | 1943 | } |
54310121 | 1944 | if (gimme == G_SCALAR) { |
79628082 | 1945 | /* undef TARG, and push that undefined value */ |
ba92458f | 1946 | if (type != OP_RCATLINE) { |
aab1202a | 1947 | sv_setsv(TARG,NULL); |
ba92458f | 1948 | } |
a0d0e21e LW |
1949 | PUSHTARG; |
1950 | } | |
1951 | RETURN; | |
1952 | } | |
a2008d6d | 1953 | have_fp: |
54310121 | 1954 | if (gimme == G_SCALAR) { |
a0d0e21e | 1955 | sv = TARG; |
0f722b55 RGS |
1956 | if (type == OP_RCATLINE && SvGMAGICAL(sv)) |
1957 | mg_get(sv); | |
48de12d9 RGS |
1958 | if (SvROK(sv)) { |
1959 | if (type == OP_RCATLINE) | |
5668452f | 1960 | SvPV_force_nomg_nolen(sv); |
48de12d9 RGS |
1961 | else |
1962 | sv_unref(sv); | |
1963 | } | |
f7877b28 | 1964 | else if (isGV_with_GP(sv)) { |
5668452f | 1965 | SvPV_force_nomg_nolen(sv); |
f7877b28 | 1966 | } |
862a34c6 | 1967 | SvUPGRADE(sv, SVt_PV); |
a0d0e21e | 1968 | tmplen = SvLEN(sv); /* remember if already alloced */ |
e3918bb7 | 1969 | if (!tmplen && !SvREADONLY(sv) && !SvIsCOW(sv)) { |
f72e8700 JJ |
1970 | /* try short-buffering it. Please update t/op/readline.t |
1971 | * if you change the growth length. | |
1972 | */ | |
1973 | Sv_Grow(sv, 80); | |
1974 | } | |
2b5e58c4 AMS |
1975 | offset = 0; |
1976 | if (type == OP_RCATLINE && SvOK(sv)) { | |
1977 | if (!SvPOK(sv)) { | |
5668452f | 1978 | SvPV_force_nomg_nolen(sv); |
2b5e58c4 | 1979 | } |
a0d0e21e | 1980 | offset = SvCUR(sv); |
2b5e58c4 | 1981 | } |
a0d0e21e | 1982 | } |
54310121 | 1983 | else { |
561b68a9 | 1984 | sv = sv_2mortal(newSV(80)); |
54310121 | 1985 | offset = 0; |
1986 | } | |
fbad3eb5 | 1987 | |
3887d568 AP |
1988 | /* This should not be marked tainted if the fp is marked clean */ |
1989 | #define MAYBE_TAINT_LINE(io, sv) \ | |
1990 | if (!(IoFLAGS(io) & IOf_UNTAINT)) { \ | |
1991 | TAINT; \ | |
1992 | SvTAINTED_on(sv); \ | |
1993 | } | |
1994 | ||
684bef36 | 1995 | /* delay EOF state for a snarfed empty file */ |
fbad3eb5 | 1996 | #define SNARF_EOF(gimme,rs,io,sv) \ |
684bef36 | 1997 | (gimme != G_SCALAR || SvCUR(sv) \ |
b9fee9ba | 1998 | || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs)) |
fbad3eb5 | 1999 | |
a0d0e21e | 2000 | for (;;) { |
09e8efcc | 2001 | PUTBACK; |
fbad3eb5 | 2002 | if (!sv_gets(sv, fp, offset) |
2d726892 TF |
2003 | && (type == OP_GLOB |
2004 | || SNARF_EOF(gimme, PL_rs, io, sv) | |
2005 | || PerlIO_error(fp))) | |
fbad3eb5 | 2006 | { |
760ac839 | 2007 | PerlIO_clearerr(fp); |
a0d0e21e | 2008 | if (IoFLAGS(io) & IOf_ARGV) { |
157fb5a1 | 2009 | fp = nextargv(PL_last_in_gv, PL_op->op_flags & OPf_SPECIAL); |
a0d0e21e LW |
2010 | if (fp) |
2011 | continue; | |
3280af22 | 2012 | (void)do_close(PL_last_in_gv, FALSE); |
a0d0e21e LW |
2013 | } |
2014 | else if (type == OP_GLOB) { | |
a2a5de95 NC |
2015 | if (!do_close(PL_last_in_gv, FALSE)) { |
2016 | Perl_ck_warner(aTHX_ packWARN(WARN_GLOB), | |
2017 | "glob failed (child exited with status %d%s)", | |
2018 | (int)(STATUS_CURRENT >> 8), | |
2019 | (STATUS_CURRENT & 0x80) ? ", core dumped" : ""); | |
4eb79ab5 | 2020 | } |
a0d0e21e | 2021 | } |
54310121 | 2022 | if (gimme == G_SCALAR) { |
ba92458f AE |
2023 | if (type != OP_RCATLINE) { |
2024 | SV_CHECK_THINKFIRST_COW_DROP(TARG); | |
0c34ef67 | 2025 | SvOK_off(TARG); |
ba92458f | 2026 | } |
09e8efcc | 2027 | SPAGAIN; |
a0d0e21e LW |
2028 | PUSHTARG; |
2029 | } | |
3887d568 | 2030 | MAYBE_TAINT_LINE(io, sv); |
a0d0e21e LW |
2031 | RETURN; |
2032 | } | |
3887d568 | 2033 | MAYBE_TAINT_LINE(io, sv); |
a0d0e21e | 2034 | IoLINES(io)++; |
b9fee9ba | 2035 | IoFLAGS(io) |= IOf_NOLINE; |
71be2cbc | 2036 | SvSETMAGIC(sv); |
09e8efcc | 2037 | SPAGAIN; |
a0d0e21e | 2038 | XPUSHs(sv); |
a0d0e21e | 2039 | if (type == OP_GLOB) { |
349d4f2f | 2040 | const char *t1; |
45a23732 | 2041 | Stat_t statbuf; |
a0d0e21e | 2042 | |
3280af22 | 2043 | if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) { |
6136c704 | 2044 | char * const tmps = SvEND(sv) - 1; |
aa07b2f6 | 2045 | if (*tmps == *SvPVX_const(PL_rs)) { |
c07a80fd | 2046 | *tmps = '\0'; |
b162af07 | 2047 | SvCUR_set(sv, SvCUR(sv) - 1); |
c07a80fd | 2048 | } |
2049 | } | |
349d4f2f | 2050 | for (t1 = SvPVX_const(sv); *t1; t1++) |
b51c3e77 CB |
2051 | #ifdef __VMS |
2052 | if (strchr("*%?", *t1)) | |
2053 | #else | |
7ad1e72d | 2054 | if (strchr("$&*(){}[]'\";\\|?<>~`", *t1)) |
b51c3e77 | 2055 | #endif |
a0d0e21e | 2056 | break; |
45a23732 | 2057 | if (*t1 && PerlLIO_lstat(SvPVX_const(sv), &statbuf) < 0) { |
a0d0e21e LW |
2058 | (void)POPs; /* Unmatched wildcard? Chuck it... */ |
2059 | continue; | |
2060 | } | |
2d79bf7f | 2061 | } else if (SvUTF8(sv)) { /* OP_READLINE, OP_RCATLINE */ |
d4c19fe8 AL |
2062 | if (ckWARN(WARN_UTF8)) { |
2063 | const U8 * const s = (const U8*)SvPVX_const(sv) + offset; | |
2064 | const STRLEN len = SvCUR(sv) - offset; | |
2065 | const U8 *f; | |
2066 | ||
2067 | if (!is_utf8_string_loc(s, len, &f)) | |
2068 | /* Emulate :encoding(utf8) warning in the same case. */ | |
2069 | Perl_warner(aTHX_ packWARN(WARN_UTF8), | |
2070 | "utf8 \"\\x%02X\" does not map to Unicode", | |
2071 | f < (U8*)SvEND(sv) ? *f : 0); | |
2072 | } | |
a0d0e21e | 2073 | } |
54310121 | 2074 | if (gimme == G_ARRAY) { |
a0d0e21e | 2075 | if (SvLEN(sv) - SvCUR(sv) > 20) { |
1da4ca5f | 2076 | SvPV_shrink_to_cur(sv); |
a0d0e21e | 2077 | } |
561b68a9 | 2078 | sv = sv_2mortal(newSV(80)); |
a0d0e21e LW |
2079 | continue; |
2080 | } | |
54310121 | 2081 | else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) { |
a0d0e21e | 2082 | /* try to reclaim a bit of scalar space (only on 1st alloc) */ |
d5b5861b NC |
2083 | const STRLEN new_len |
2084 | = SvCUR(sv) < 60 ? 80 : SvCUR(sv)+40; /* allow some slop */ | |
1da4ca5f | 2085 | SvPV_renew(sv, new_len); |
a0d0e21e LW |
2086 | } |
2087 | RETURN; | |
2088 | } | |
2089 | } | |
2090 | ||
a0d0e21e LW |
2091 | PP(pp_helem) |
2092 | { | |
20b7effb | 2093 | dSP; |
760ac839 | 2094 | HE* he; |
ae77835f | 2095 | SV **svp; |
c445ea15 | 2096 | SV * const keysv = POPs; |
85fbaab2 | 2097 | HV * const hv = MUTABLE_HV(POPs); |
a3b680e6 AL |
2098 | const U32 lval = PL_op->op_flags & OPf_MOD || LVRET; |
2099 | const U32 defer = PL_op->op_private & OPpLVAL_DEFER; | |
be6c24e0 | 2100 | SV *sv; |
92970b93 | 2101 | const bool localizing = PL_op->op_private & OPpLVAL_INTRO; |
d30e492c | 2102 | bool preeminent = TRUE; |
a0d0e21e | 2103 | |
6dfc73ea S |
2104 | if (SvTYPE(hv) != SVt_PVHV) |
2105 | RETPUSHUNDEF; | |
d4c19fe8 | 2106 | |
92970b93 | 2107 | if (localizing) { |
d4c19fe8 AL |
2108 | MAGIC *mg; |
2109 | HV *stash; | |
d30e492c VP |
2110 | |
2111 | /* If we can determine whether the element exist, | |
2112 | * Try to preserve the existenceness of a tied hash | |
2113 | * element by using EXISTS and DELETE if possible. | |
2114 | * Fallback to FETCH and STORE otherwise. */ | |
2c5f48c2 | 2115 | if (SvCANEXISTDELETE(hv)) |
d30e492c | 2116 | preeminent = hv_exists_ent(hv, keysv, 0); |
d4c19fe8 | 2117 | } |
d30e492c | 2118 | |
5f9d7e2b | 2119 | he = hv_fetch_ent(hv, keysv, lval && !defer, 0); |
d4c19fe8 | 2120 | svp = he ? &HeVAL(he) : NULL; |
a0d0e21e | 2121 | if (lval) { |
746f6409 | 2122 | if (!svp || !*svp || *svp == &PL_sv_undef) { |
68dc0745 | 2123 | SV* lv; |
2124 | SV* key2; | |
2d8e6c8d | 2125 | if (!defer) { |
be2597df | 2126 | DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv)); |
2d8e6c8d | 2127 | } |
68dc0745 | 2128 | lv = sv_newmortal(); |
2129 | sv_upgrade(lv, SVt_PVLV); | |
2130 | LvTYPE(lv) = 'y'; | |
6136c704 | 2131 | sv_magic(lv, key2 = newSVsv(keysv), PERL_MAGIC_defelem, NULL, 0); |
fc2b2dca | 2132 | SvREFCNT_dec_NN(key2); /* sv_magic() increments refcount */ |
0ad694a7 | 2133 | LvTARG(lv) = SvREFCNT_inc_simple_NN(hv); |
68dc0745 | 2134 | LvTARGLEN(lv) = 1; |
2135 | PUSHs(lv); | |
2136 | RETURN; | |
2137 | } | |
92970b93 | 2138 | if (localizing) { |
bfcb3514 | 2139 | if (HvNAME_get(hv) && isGV(*svp)) |
159b6efe | 2140 | save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL)); |
47cfc530 VP |
2141 | else if (preeminent) |
2142 | save_helem_flags(hv, keysv, svp, | |
2143 | (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC); | |
2144 | else | |
2145 | SAVEHDELETE(hv, keysv); | |
5f05dabc | 2146 | } |
9026059d GG |
2147 | else if (PL_op->op_private & OPpDEREF) { |
2148 | PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF)); | |
2149 | RETURN; | |
2150 | } | |
a0d0e21e | 2151 | } |
746f6409 | 2152 | sv = (svp && *svp ? *svp : &PL_sv_undef); |
fd69380d DM |
2153 | /* Originally this did a conditional C<sv = sv_mortalcopy(sv)>; this |
2154 | * was to make C<local $tied{foo} = $tied{foo}> possible. | |
2155 | * However, it seems no longer to be needed for that purpose, and | |
2156 | * introduced a new bug: stuff like C<while ($hash{taintedval} =~ /.../g> | |
2157 | * would loop endlessly since the pos magic is getting set on the | |
2158 | * mortal copy and lost. However, the copy has the effect of | |
2159 | * triggering the get magic, and losing it altogether made things like | |
2160 | * c<$tied{foo};> in void context no longer do get magic, which some | |
2161 | * code relied on. Also, delayed triggering of magic on @+ and friends | |
2162 | * meant the original regex may be out of scope by now. So as a | |
2163 | * compromise, do the get magic here. (The MGf_GSKIP flag will stop it | |
2164 | * being called too many times). */ | |
39cf747a | 2165 | if (!lval && SvRMAGICAL(hv) && SvGMAGICAL(sv)) |
fd69380d | 2166 | mg_get(sv); |
be6c24e0 | 2167 | PUSHs(sv); |
a0d0e21e LW |
2168 | RETURN; |
2169 | } | |
2170 | ||
fedf30e1 DM |
2171 | |
2172 | /* a stripped-down version of Perl_softref2xv() for use by | |
2173 | * pp_multideref(), which doesn't use PL_op->op_flags */ | |
2174 | ||
2175 | GV * | |
2176 | S_softref2xv_lite(pTHX_ SV *const sv, const char *const what, | |
2177 | const svtype type) | |
2178 | { | |
2179 | if (PL_op->op_private & HINT_STRICT_REFS) { | |
2180 | if (SvOK(sv)) | |
2181 | Perl_die(aTHX_ PL_no_symref_sv, sv, | |
2182 | (SvPOKp(sv) && SvCUR(sv)>32 ? "..." : ""), what); | |
2183 | else | |
2184 | Perl_die(aTHX_ PL_no_usym, what); | |
2185 | } | |
2186 | if (!SvOK(sv)) | |
2187 | Perl_die(aTHX_ PL_no_usym, what); | |
2188 | return gv_fetchsv_nomg(sv, GV_ADD, type); | |
2189 | } | |
2190 | ||
2191 | ||
79815f56 DM |
2192 | /* Handle one or more aggregate derefs and array/hash indexings, e.g. |
2193 | * $h->{foo} or $a[0]{$key}[$i] or f()->[1] | |
fedf30e1 DM |
2194 | * |
2195 | * op_aux points to an array of unions of UV / IV / SV* / PADOFFSET. | |
79815f56 DM |
2196 | * Each of these either contains a set of actions, or an argument, such as |
2197 | * an IV to use as an array index, or a lexical var to retrieve. | |
2198 | * Several actions re stored per UV; we keep shifting new actions off the | |
2199 | * one UV, and only reload when it becomes zero. | |
fedf30e1 DM |
2200 | */ |
2201 | ||
2202 | PP(pp_multideref) | |
2203 | { | |
2204 | SV *sv = NULL; /* init to avoid spurious 'may be used uninitialized' */ | |
2205 | UNOP_AUX_item *items = cUNOP_AUXx(PL_op)->op_aux; | |
2206 | UV actions = items->uv; | |
2207 | ||
2208 | assert(actions); | |
2209 | /* this tells find_uninit_var() where we're up to */ | |
2210 | PL_multideref_pc = items; | |
2211 | ||
2212 | while (1) { | |
2213 | /* there are three main classes of action; the first retrieve | |
2214 | * the initial AV or HV from a variable or the stack; the second | |
2215 | * does the equivalent of an unrolled (/DREFAV, rv2av, aelem), | |
2216 | * the third an unrolled (/DREFHV, rv2hv, helem). | |
2217 | */ | |
2218 | switch (actions & MDEREF_ACTION_MASK) { | |
2219 | ||
2220 | case MDEREF_reload: | |
2221 | actions = (++items)->uv; | |
2222 | continue; | |
2223 | ||
2224 | case MDEREF_AV_padav_aelem: /* $lex[...] */ | |
2225 | sv = PAD_SVl((++items)->pad_offset); | |
2226 | goto do_AV_aelem; | |
2227 | ||
2228 | case MDEREF_AV_gvav_aelem: /* $pkg[...] */ | |
2229 | sv = UNOP_AUX_item_sv(++items); | |
2230 | assert(isGV_with_GP(sv)); | |
2231 | sv = (SV*)GvAVn((GV*)sv); | |
2232 | goto do_AV_aelem; | |
2233 | ||
2234 | case MDEREF_AV_pop_rv2av_aelem: /* expr->[...] */ | |
2235 | { | |
2236 | dSP; | |
2237 | sv = POPs; | |
2238 | PUTBACK; | |
2239 | goto do_AV_rv2av_aelem; | |
2240 | } | |
2241 | ||
2242 | case MDEREF_AV_gvsv_vivify_rv2av_aelem: /* $pkg->[...] */ | |
2243 | sv = UNOP_AUX_item_sv(++items); | |
2244 | assert(isGV_with_GP(sv)); | |
2245 | sv = GvSVn((GV*)sv); | |
2246 | goto do_AV_vivify_rv2av_aelem; | |
2247 | ||
2248 | case MDEREF_AV_padsv_vivify_rv2av_aelem: /* $lex->[...] */ | |
2249 | sv = PAD_SVl((++items)->pad_offset); | |
2250 | /* FALLTHROUGH */ | |
2251 | ||
2252 | do_AV_vivify_rv2av_aelem: | |
2253 | case MDEREF_AV_vivify_rv2av_aelem: /* vivify, ->[...] */ | |
2254 | /* this is the OPpDEREF action normally found at the end of | |
2255 | * ops like aelem, helem, rv2sv */ | |
2256 | sv = vivify_ref(sv, OPpDEREF_AV); | |
2257 | /* FALLTHROUGH */ | |
2258 | ||
2259 | do_AV_rv2av_aelem: | |
2260 | /* this is basically a copy of pp_rv2av when it just has the | |
2261 | * sKR/1 flags */ | |
2262 | SvGETMAGIC(sv); | |
2263 | if (LIKELY(SvROK(sv))) { | |
2264 | if (UNLIKELY(SvAMAGIC(sv))) { | |
2265 | sv = amagic_deref_call(sv, to_av_amg); | |
2266 | } | |
2267 | sv = SvRV(sv); | |
2268 | if (UNLIKELY(SvTYPE(sv) != SVt_PVAV)) | |
2269 | DIE(aTHX_ "Not an ARRAY reference"); | |
2270 | } | |
2271 | else if (SvTYPE(sv) != SVt_PVAV) { | |
2272 | if (!isGV_with_GP(sv)) | |
2273 | sv = (SV*)S_softref2xv_lite(aTHX_ sv, "an ARRAY", SVt_PVAV); | |
2274 | sv = MUTABLE_SV(GvAVn((GV*)sv)); | |
2275 | } | |
2276 | /* FALLTHROUGH */ | |
2277 | ||
2278 | do_AV_aelem: | |
2279 | { | |
2280 | /* retrieve the key; this may be either a lexical or package | |
2281 | * var (whose index/ptr is stored as an item) or a signed | |
2282 | * integer constant stored as an item. | |
2283 | */ | |
2284 | SV *elemsv; | |
2285 | IV elem = 0; /* to shut up stupid compiler warnings */ | |
2286 | ||
2287 | ||
2288 | assert(SvTYPE(sv) == SVt_PVAV); | |
2289 | ||
2290 | switch (actions & MDEREF_INDEX_MASK) { | |
2291 | case MDEREF_INDEX_none: | |
2292 | goto finish; | |
2293 | case MDEREF_INDEX_const: | |
2294 | elem = (++items)->iv; | |
2295 | break; | |
2296 | case MDEREF_INDEX_padsv: | |
2297 | elemsv = PAD_SVl((++items)->pad_offset); | |
2298 | goto check_elem; | |
2299 | case MDEREF_INDEX_gvsv: | |
2300 | elemsv = UNOP_AUX_item_sv(++items); | |
2301 | assert(isGV_with_GP(elemsv)); | |
2302 | elemsv = GvSVn((GV*)elemsv); | |
2303 | check_elem: | |
2304 | if (UNLIKELY(SvROK(elemsv) && !SvGAMAGIC(elemsv) | |
2305 | && ckWARN(WARN_MISC))) | |
2306 | Perl_warner(aTHX_ packWARN(WARN_MISC), | |
2307 | "Use of reference \"%"SVf"\" as array index", | |
2308 | SVfARG(elemsv)); | |
2309 | /* the only time that S_find_uninit_var() needs this | |
2310 | * is to determine which index value triggered the | |
2311 | * undef warning. So just update it here. Note that | |
2312 | * since we don't save and restore this var (e.g. for | |
2313 | * tie or overload execution), its value will be | |
2314 | * meaningless apart from just here */ | |
2315 | PL_multideref_pc = items; | |
2316 | elem = SvIV(elemsv); | |
2317 | break; | |
2318 | } | |
2319 | ||
2320 | ||
2321 | /* this is basically a copy of pp_aelem with OPpDEREF skipped */ | |
2322 | ||
2323 | if (!(actions & MDEREF_FLAG_last)) { | |
2324 | SV** svp = av_fetch((AV*)sv, elem, 1); | |
2325 | if (!svp || ! (sv=*svp)) | |
2326 | DIE(aTHX_ PL_no_aelem, elem); | |
2327 | break; | |
2328 | } | |
2329 | ||
2330 | if (PL_op->op_private & | |
2331 | (OPpMULTIDEREF_EXISTS|OPpMULTIDEREF_DELETE)) | |
2332 | { | |
2333 | if (PL_op->op_private & OPpMULTIDEREF_EXISTS) { | |
2334 | sv = av_exists((AV*)sv, elem) ? &PL_sv_yes : &PL_sv_no; | |
2335 | } | |
2336 | else { | |
2337 | I32 discard = (GIMME_V == G_VOID) ? G_DISCARD : 0; | |
2338 | sv = av_delete((AV*)sv, elem, discard); | |
2339 | if (discard) | |
2340 | return NORMAL; | |
2341 | if (!sv) | |
2342 | sv = &PL_sv_undef; | |
2343 | } | |
2344 | } | |
2345 | else { | |
2346 | const U32 lval = PL_op->op_flags & OPf_MOD || LVRET; | |
2347 | const U32 defer = PL_op->op_private & OPpLVAL_DEFER; | |
2348 | const bool localizing = PL_op->op_private & OPpLVAL_INTRO; | |
2349 | bool preeminent = TRUE; | |
2350 | AV *const av = (AV*)sv; | |
2351 | SV** svp; | |
2352 | ||
2353 | if (UNLIKELY(localizing)) { | |
2354 | MAGIC *mg; | |
2355 | HV *stash; | |
2356 | ||
2357 | /* If we can determine whether the element exist, | |
2358 | * Try to preserve the existenceness of a tied array | |
2359 | * element by using EXISTS and DELETE if possible. | |
2360 | * Fallback to FETCH and STORE otherwise. */ | |
2361 | if (SvCANEXISTDELETE(av)) | |
2362 | preeminent = av_exists(av, elem); | |
2363 | } | |
2364 | ||
2365 | svp = av_fetch(av, elem, lval && !defer); | |
2366 | ||
2367 | if (lval) { | |
2368 | if (!svp || !(sv = *svp)) { | |
2369 | IV len; | |
2370 | if (!defer) | |
2371 | DIE(aTHX_ PL_no_aelem, elem); | |
2372 | len = av_tindex(av); | |
2373 | sv = sv_2mortal(newSVavdefelem(av, | |
2374 | /* Resolve a negative index now, unless it points | |
2375 | * before the beginning of the array, in which | |
2376 | * case record it for error reporting in | |
2377 | * magic_setdefelem. */ | |
2378 | elem < 0 && len + elem >= 0 | |
2379 | ? len + elem : elem, 1)); | |
2380 | } | |
2381 | else { | |
2382 | if (UNLIKELY(localizing)) { | |
2383 | if (preeminent) { | |
2384 | save_aelem(av, elem, svp); | |
2385 | sv = *svp; /* may have changed */ | |
2386 | } | |
2387 | else | |
2388 | SAVEADELETE(av, elem); | |
2389 | } | |
2390 | } | |
2391 | } | |
2392 | else { | |
2393 | sv = (svp ? *svp : &PL_sv_undef); | |
2394 | /* see note in pp_helem() */ | |
2395 | if (SvRMAGICAL(av) && SvGMAGICAL(sv)) | |
2396 | mg_get(sv); | |
2397 | } | |
2398 | } | |
2399 | ||
2400 | } | |
2401 | finish: | |
2402 | { | |
2403 | dSP; | |
2404 | XPUSHs(sv); | |
2405 | RETURN; | |
2406 | } | |
2407 | /* NOTREACHED */ | |
2408 | ||
2409 | ||
2410 | ||
2411 | ||
2412 | case MDEREF_HV_padhv_helem: /* $lex{...} */ | |
2413 | sv = PAD_SVl((++items)->pad_offset); | |
2414 | goto do_HV_helem; | |
2415 | ||
2416 | case MDEREF_HV_gvhv_helem: /* $pkg{...} */ | |
2417 | sv = UNOP_AUX_item_sv(++items); | |
2418 | assert(isGV_with_GP(sv)); | |
2419 | sv = (SV*)GvHVn((GV*)sv); | |
2420 | goto do_HV_helem; | |
2421 | ||
2422 | case MDEREF_HV_pop_rv2hv_helem: /* expr->{...} */ | |
2423 | { | |
2424 | dSP; | |
2425 | sv = POPs; | |
2426 | PUTBACK; | |
2427 | goto do_HV_rv2hv_helem; | |
2428 | } | |
2429 | ||
2430 | case MDEREF_HV_gvsv_vivify_rv2hv_helem: /* $pkg->{...} */ | |
2431 | sv = UNOP_AUX_item_sv(++items); | |
2432 | assert(isGV_with_GP(sv)); | |
2433 | sv = GvSVn((GV*)sv); | |
2434 | goto do_HV_vivify_rv2hv_helem; | |
2435 | ||
2436 | case MDEREF_HV_padsv_vivify_rv2hv_helem: /* $lex->{...} */ | |
2437 | sv = PAD_SVl((++items)->pad_offset); | |
2438 | /* FALLTHROUGH */ | |
2439 | ||
2440 | do_HV_vivify_rv2hv_helem: | |
2441 | case MDEREF_HV_vivify_rv2hv_helem: /* vivify, ->{...} */ | |
2442 | /* this is the OPpDEREF action normally found at the end of | |
2443 | * ops like aelem, helem, rv2sv */ | |
2444 | sv = vivify_ref(sv, OPpDEREF_HV); | |
2445 | /* FALLTHROUGH */ | |
2446 | ||
2447 | do_HV_rv2hv_helem: | |
2448 | /* this is basically a copy of pp_rv2hv when it just has the | |
2449 | * sKR/1 flags (and pp_rv2hv is aliased to pp_rv2av) */ | |
2450 | ||
2451 | SvGETMAGIC(sv); | |
2452 | if (LIKELY(SvROK(sv))) { | |
2453 | if (UNLIKELY(SvAMAGIC(sv))) { | |
2454 | sv = amagic_deref_call(sv, to_hv_amg); | |
2455 | } | |
2456 | sv = SvRV(sv); | |
2457 | if (UNLIKELY(SvTYPE(sv) != SVt_PVHV)) | |
2458 | DIE(aTHX_ "Not a HASH reference"); | |
2459 | } | |
2460 | else if (SvTYPE(sv) != SVt_PVHV) { | |
2461 | if (!isGV_with_GP(sv)) | |
2462 | sv = (SV*)S_softref2xv_lite(aTHX_ sv, "a HASH", SVt_PVHV); | |
2463 | sv = MUTABLE_SV(GvHVn((GV*)sv)); | |
2464 | } | |
2465 | /* FALLTHROUGH */ | |
2466 | ||
2467 | do_HV_helem: | |
2468 | { | |
2469 | /* retrieve the key; this may be either a lexical / package | |
2470 | * var or a string constant, whose index/ptr is stored as an | |
2471 | * item | |
2472 | */ | |
2473 | SV *keysv = NULL; /* to shut up stupid compiler warnings */ | |
2474 | ||
2475 | assert(SvTYPE(sv) == SVt_PVHV); | |
2476 | ||
2477 | switch (actions & MDEREF_INDEX_MASK) { | |
2478 | case MDEREF_INDEX_none: | |
2479 | goto finish; | |
2480 | ||
2481 | case MDEREF_INDEX_const: | |
2482 | keysv = UNOP_AUX_item_sv(++items); | |
2483 | break; | |
2484 | ||
2485 | case MDEREF_INDEX_padsv: | |
2486 | keysv = PAD_SVl((++items)->pad_offset); | |
2487 | break; | |
2488 | ||
2489 | case MDEREF_INDEX_gvsv: | |
2490 | keysv = UNOP_AUX_item_sv(++items); | |
2491 | keysv = GvSVn((GV*)keysv); | |
2492 | break; | |
2493 | } | |
2494 | ||
2495 | /* see comment above about setting this var */ | |
2496 | PL_multideref_pc = items; | |
2497 | ||
2498 | ||
2499 | /* ensure that candidate CONSTs have been HEKified */ | |
2500 | assert( ((actions & MDEREF_INDEX_MASK) != MDEREF_INDEX_const) | |
2501 | || SvTYPE(keysv) >= SVt_PVMG | |
2502 | || !SvOK(keysv) | |
2503 | || SvROK(keysv) | |
2504 | || SvIsCOW_shared_hash(keysv)); | |
2505 | ||
2506 | /* this is basically a copy of pp_helem with OPpDEREF skipped */ | |
2507 | ||
2508 | if (!(actions & MDEREF_FLAG_last)) { | |
2509 | HE *he = hv_fetch_ent((HV*)sv, keysv, 1, 0); | |
2510 | if (!he || !(sv=HeVAL(he)) || sv == &PL_sv_undef) | |
2511 | DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv)); | |
2512 | break; | |
2513 | } | |
2514 | ||
2515 | if (PL_op->op_private & | |
2516 | (OPpMULTIDEREF_EXISTS|OPpMULTIDEREF_DELETE)) | |
2517 | { | |
2518 | if (PL_op->op_private & OPpMULTIDEREF_EXISTS) { | |
2519 | sv = hv_exists_ent((HV*)sv, keysv, 0) | |
2520 | ? &PL_sv_yes : &PL_sv_no; | |
2521 | } | |
2522 | else { | |
2523 | I32 discard = (GIMME_V == G_VOID) ? G_DISCARD : 0; | |
2524 | sv = hv_delete_ent((HV*)sv, keysv, discard, 0); | |
2525 | if (discard) | |
2526 | return NORMAL; | |
2527 | if (!sv) | |
2528 | sv = &PL_sv_undef; | |
2529 | } | |
2530 | } | |
2531 | else { | |
2532 | const U32 lval = PL_op->op_flags & OPf_MOD || LVRET; | |
2533 | const U32 defer = PL_op->op_private & OPpLVAL_DEFER; | |
2534 | const bool localizing = PL_op->op_private & OPpLVAL_INTRO; | |
2535 | bool preeminent = TRUE; | |
2536 | SV **svp; | |
2537 | HV * const hv = (HV*)sv; | |
2538 | HE* he; | |
2539 | ||
2540 | if (UNLIKELY(localizing)) { | |
2541 | MAGIC *mg; | |
2542 | HV *stash; | |
2543 | ||
2544 | /* If we can determine whether the element exist, | |
2545 | * Try to preserve the existenceness of a tied hash | |
2546 | * element by using EXISTS and DELETE if possible. | |
2547 | * Fallback to FETCH and STORE otherwise. */ | |
2548 | if (SvCANEXISTDELETE(hv)) | |
2549 | preeminent = hv_exists_ent(hv, keysv, 0); | |
2550 | } | |
2551 | ||
2552 | he = hv_fetch_ent(hv, keysv, lval && !defer, 0); | |
2553 | svp = he ? &HeVAL(he) : NULL; | |
2554 | ||
2555 | ||
2556 | if (lval) { | |
2557 | if (!svp || !(sv = *svp) || sv == &PL_sv_undef) { | |
2558 | SV* lv; | |
2559 | SV* key2; | |
2560 | if (!defer) | |
2561 | DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv)); | |
2562 | lv = sv_newmortal(); | |
2563 | sv_upgrade(lv, SVt_PVLV); | |
2564 | LvTYPE(lv) = 'y'; | |
2565 | sv_magic(lv, key2 = newSVsv(keysv), | |
2566 | PERL_MAGIC_defelem, NULL, 0); | |
2567 | /* sv_magic() increments refcount */ | |
2568 | SvREFCNT_dec_NN(key2); | |
0ad694a7 | 2569 | LvTARG(lv) = SvREFCNT_inc_simple_NN(hv); |
fedf30e1 DM |
2570 | LvTARGLEN(lv) = 1; |
2571 | sv = lv; | |
2572 | } | |
2573 | else { | |
2574 | if (localizing) { | |
2575 | if (HvNAME_get(hv) && isGV(sv)) | |
2576 | save_gp(MUTABLE_GV(sv), | |
2577 | !(PL_op->op_flags & OPf_SPECIAL)); | |
2578 | else if (preeminent) { | |
2579 | save_helem_flags(hv, keysv, svp, | |
2580 | (PL_op->op_flags & OPf_SPECIAL) | |
2581 | ? 0 : SAVEf_SETMAGIC); | |
2582 | sv = *svp; /* may have changed */ | |
2583 | } | |
2584 | else | |
2585 | SAVEHDELETE(hv, keysv); | |
2586 | } | |
2587 | } | |
2588 | } | |
2589 | else { | |
2590 | sv = (svp && *svp ? *svp : &PL_sv_undef); | |
2591 | /* see note in pp_helem() */ | |
2592 | if (SvRMAGICAL(hv) && SvGMAGICAL(sv)) | |
2593 | mg_get(sv); | |
2594 | } | |
2595 | } | |
2596 | goto finish; | |
2597 | } | |
2598 | ||
2599 | } /* switch */ | |
2600 | ||
2601 | actions >>= MDEREF_SHIFT; | |
2602 | } /* while */ | |
2603 | /* NOTREACHED */ | |
2604 | } | |
2605 | ||
2606 | ||
a0d0e21e LW |
2607 | PP(pp_iter) |
2608 | { | |
20b7effb | 2609 | dSP; |
eb578fdb | 2610 | PERL_CONTEXT *cx; |
7d6c2cef | 2611 | SV *oldsv; |
1d7c1841 | 2612 | SV **itersvp; |
a0d0e21e | 2613 | |
924508f0 | 2614 | EXTEND(SP, 1); |
a0d0e21e | 2615 | cx = &cxstack[cxstack_ix]; |
1d7c1841 | 2616 | itersvp = CxITERVAR(cx); |
a48ce6be DM |
2617 | |
2618 | switch (CxTYPE(cx)) { | |
17c91640 | 2619 | |
b552b52c DM |
2620 | case CXt_LOOP_LAZYSV: /* string increment */ |
2621 | { | |
2622 | SV* cur = cx->blk_loop.state_u.lazysv.cur; | |
2623 | SV *end = cx->blk_loop.state_u.lazysv.end; | |
2624 | /* If the maximum is !SvOK(), pp_enteriter substitutes PL_sv_no. | |
2625 | It has SvPVX of "" and SvCUR of 0, which is what we want. */ | |
2626 | STRLEN maxlen = 0; | |
2627 | const char *max = SvPV_const(end, maxlen); | |
5d9574c1 | 2628 | if (UNLIKELY(SvNIOK(cur) || SvCUR(cur) > maxlen)) |
b552b52c DM |
2629 | RETPUSHNO; |
2630 | ||
2631 | oldsv = *itersvp; | |
5d9574c1 | 2632 | if (LIKELY(SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv))) { |
b552b52c DM |
2633 | /* safe to reuse old SV */ |
2634 | sv_setsv(oldsv, cur); | |
a48ce6be | 2635 | } |
b552b52c DM |
2636 | else |
2637 | { | |
2638 | /* we need a fresh SV every time so that loop body sees a | |
2639 | * completely new SV for closures/references to work as | |
2640 | * they used to */ | |
2641 | *itersvp = newSVsv(cur); | |
fc2b2dca | 2642 | SvREFCNT_dec_NN(oldsv); |
b552b52c DM |
2643 | } |
2644 | if (strEQ(SvPVX_const(cur), max)) | |
2645 | sv_setiv(cur, 0); /* terminate next time */ | |
2646 | else | |
2647 | sv_inc(cur); | |
2648 | break; | |
2649 | } | |
a48ce6be | 2650 | |
fcef60b4 DM |
2651 | case CXt_LOOP_LAZYIV: /* integer increment */ |
2652 | { | |
2653 | IV cur = cx->blk_loop.state_u.lazyiv.cur; | |
5d9574c1 | 2654 | if (UNLIKELY(cur > cx->blk_loop.state_u.lazyiv.end)) |
89ea2908 | 2655 | RETPUSHNO; |
7f61b687 | 2656 | |
fcef60b4 | 2657 | oldsv = *itersvp; |
3db8f154 | 2658 | /* don't risk potential race */ |
5d9574c1 | 2659 | if (LIKELY(SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv))) { |
eaa5c2d6 | 2660 | /* safe to reuse old SV */ |
fcef60b4 | 2661 | sv_setiv(oldsv, cur); |
eaa5c2d6 | 2662 | } |
1c846c1f | 2663 | else |
eaa5c2d6 GA |
2664 | { |
2665 | /* we need a fresh SV every time so that loop body sees a | |
2666 | * completely new SV for closures/references to work as they | |
2667 | * used to */ | |
fcef60b4 | 2668 | *itersvp = newSViv(cur); |
fc2b2dca | 2669 | SvREFCNT_dec_NN(oldsv); |
eaa5c2d6 | 2670 | } |
a2309040 | 2671 | |
5d9574c1 | 2672 | if (UNLIKELY(cur == IV_MAX)) { |
cdc1aa42 NC |
2673 | /* Handle end of range at IV_MAX */ |
2674 | cx->blk_loop.state_u.lazyiv.end = IV_MIN; | |
2675 | } else | |
2676 | ++cx->blk_loop.state_u.lazyiv.cur; | |
a48ce6be | 2677 | break; |
fcef60b4 | 2678 | } |
a48ce6be | 2679 | |
b552b52c | 2680 | case CXt_LOOP_FOR: /* iterate array */ |
7d6c2cef | 2681 | { |
89ea2908 | 2682 | |
7d6c2cef DM |
2683 | AV *av = cx->blk_loop.state_u.ary.ary; |
2684 | SV *sv; | |
2685 | bool av_is_stack = FALSE; | |
a8a20bb6 | 2686 | IV ix; |
7d6c2cef | 2687 | |
de080daa DM |
2688 | if (!av) { |
2689 | av_is_stack = TRUE; | |
2690 | av = PL_curstack; | |
2691 | } | |
2692 | if (PL_op->op_private & OPpITER_REVERSED) { | |
a8a20bb6 | 2693 | ix = --cx->blk_loop.state_u.ary.ix; |
5d9574c1 | 2694 | if (UNLIKELY(ix <= (av_is_stack ? cx->blk_loop.resetsp : -1))) |
de080daa | 2695 | RETPUSHNO; |
de080daa DM |
2696 | } |
2697 | else { | |
a8a20bb6 | 2698 | ix = ++cx->blk_loop.state_u.ary.ix; |
5d9574c1 | 2699 | if (UNLIKELY(ix > (av_is_stack ? cx->blk_oldsp : AvFILL(av)))) |
de080daa | 2700 | RETPUSHNO; |
a8a20bb6 | 2701 | } |
de080daa | 2702 | |
5d9574c1 | 2703 | if (UNLIKELY(SvMAGICAL(av) || AvREIFY(av))) { |
a8a20bb6 DM |
2704 | SV * const * const svp = av_fetch(av, ix, FALSE); |
2705 | sv = svp ? *svp : NULL; | |
2706 | } | |
2707 | else { | |
2708 | sv = AvARRAY(av)[ix]; | |
de080daa | 2709 | } |
ef3e5ea9 | 2710 | |
d39c26a6 FC |
2711 | if (UNLIKELY(cx->cx_type & CXp_FOR_LVREF)) { |
2712 | SvSetMagicSV(*itersvp, sv); | |
2713 | break; | |
2714 | } | |
2715 | ||
5d9574c1 DM |
2716 | if (LIKELY(sv)) { |
2717 | if (UNLIKELY(SvIS_FREED(sv))) { | |
f38aa882 DM |
2718 | *itersvp = NULL; |
2719 | Perl_croak(aTHX_ "Use of freed value in iteration"); | |
2720 | } | |
60779a30 | 2721 | if (SvPADTMP(sv)) { |
8e079c2a | 2722 | sv = newSVsv(sv); |
60779a30 | 2723 | } |
8e079c2a FC |
2724 | else { |
2725 | SvTEMP_off(sv); | |
2726 | SvREFCNT_inc_simple_void_NN(sv); | |
2727 | } | |
de080daa | 2728 | } |
a600f7e6 | 2729 | else if (!av_is_stack) { |
199f858d | 2730 | sv = newSVavdefelem(av, ix, 0); |
de080daa | 2731 | } |
a600f7e6 FC |
2732 | else |
2733 | sv = &PL_sv_undef; | |
a0d0e21e | 2734 | |
de080daa DM |
2735 | oldsv = *itersvp; |
2736 | *itersvp = sv; | |
2737 | SvREFCNT_dec(oldsv); | |
de080daa | 2738 | break; |
7d6c2cef | 2739 | } |
a48ce6be DM |
2740 | |
2741 | default: | |
2742 | DIE(aTHX_ "panic: pp_iter, type=%u", CxTYPE(cx)); | |
2743 | } | |
b552b52c | 2744 | RETPUSHYES; |
a0d0e21e LW |
2745 | } |
2746 | ||
ef07e810 DM |
2747 | /* |
2748 | A description of how taint works in pattern matching and substitution. | |
2749 | ||
284167a5 S |
2750 | This is all conditional on NO_TAINT_SUPPORT not being defined. Under |
2751 | NO_TAINT_SUPPORT, taint-related operations should become no-ops. | |
2752 | ||
4e19c54b | 2753 | While the pattern is being assembled/concatenated and then compiled, |
284167a5 S |
2754 | PL_tainted will get set (via TAINT_set) if any component of the pattern |
2755 | is tainted, e.g. /.*$tainted/. At the end of pattern compilation, | |
2756 | the RXf_TAINTED flag is set on the pattern if PL_tainted is set (via | |
1738e041 DM |
2757 | TAINT_get). It will also be set if any component of the pattern matches |
2758 | based on locale-dependent behavior. | |
ef07e810 | 2759 | |
0ab462a6 DM |
2760 | When the pattern is copied, e.g. $r = qr/..../, the SV holding the ref to |
2761 | the pattern is marked as tainted. This means that subsequent usage, such | |
284167a5 S |
2762 | as /x$r/, will set PL_tainted using TAINT_set, and thus RXf_TAINTED, |
2763 | on the new pattern too. | |
ef07e810 | 2764 | |
272d35c9 | 2765 | RXf_TAINTED_SEEN is used post-execution by the get magic code |
ef07e810 DM |
2766 | of $1 et al to indicate whether the returned value should be tainted. |
2767 | It is the responsibility of the caller of the pattern (i.e. pp_match, | |
2768 | pp_subst etc) to set this flag for any other circumstances where $1 needs | |
2769 | to be tainted. | |
2770 | ||
2771 | The taint behaviour of pp_subst (and pp_substcont) is quite complex. | |
2772 | ||
2773 | There are three possible sources of taint | |
2774 | * the source string | |
2775 | * the pattern (both compile- and run-time, RXf_TAINTED / RXf_TAINTED_SEEN) | |
2776 | * the replacement string (or expression under /e) | |
2777 | ||
2778 | There are four destinations of taint and they are affected by the sources | |
2779 | according to the rules below: | |
2780 | ||
2781 | * the return value (not including /r): | |
2782 | tainted by the source string and pattern, but only for the | |
2783 | number-of-iterations case; boolean returns aren't tainted; | |
2784 | * the modified string (or modified copy under /r): | |
2785 | tainted by the source string, pattern, and replacement strings; | |
2786 | * $1 et al: | |
2787 | tainted by the pattern, and under 'use re "taint"', by the source | |
2788 | string too; | |
2789 | * PL_taint - i.e. whether subsequent code (e.g. in a /e block) is tainted: | |
2790 | should always be unset before executing subsequent code. | |
2791 | ||
2792 | The overall action of pp_subst is: | |
2793 | ||
2794 | * at the start, set bits in rxtainted indicating the taint status of | |
2795 | the various sources. | |
2796 | ||
2797 | * After each pattern execution, update the SUBST_TAINT_PAT bit in | |
2798 | rxtainted if RXf_TAINTED_SEEN has been set, to indicate that the | |
2799 | pattern has subsequently become tainted via locale ops. | |
2800 | ||
2801 | * If control is being passed to pp_substcont to execute a /e block, | |
2802 | save rxtainted in the CXt_SUBST block, for future use by | |
2803 | pp_substcont. | |
2804 | ||
2805 | * Whenever control is being returned to perl code (either by falling | |
2806 | off the "end" of pp_subst/pp_substcont, or by entering a /e block), | |
2807 | use the flag bits in rxtainted to make all the appropriate types of | |
0ab462a6 DM |
2808 | destination taint visible; e.g. set RXf_TAINTED_SEEN so that $1 |
2809 | et al will appear tainted. | |
ef07e810 DM |
2810 | |
2811 | pp_match is just a simpler version of the above. | |
2812 | ||
2813 | */ | |
2814 | ||
a0d0e21e LW |
2815 | PP(pp_subst) |
2816 | { | |
20b7effb | 2817 | dSP; dTARG; |
eb578fdb | 2818 | PMOP *pm = cPMOP; |
a0d0e21e | 2819 | PMOP *rpm = pm; |
eb578fdb | 2820 | char *s; |
a0d0e21e | 2821 | char *strend; |
5c144d81 | 2822 | const char *c; |
a0d0e21e | 2823 | STRLEN clen; |
3c6ef0a5 FC |
2824 | SSize_t iters = 0; |
2825 | SSize_t maxiters; | |
a0d0e21e | 2826 | bool once; |
ef07e810 DM |
2827 | U8 rxtainted = 0; /* holds various SUBST_TAINT_* flag bits. |
2828 | See "how taint works" above */ | |
a0d0e21e | 2829 | char *orig; |
1ed74d04 | 2830 | U8 r_flags; |
eb578fdb | 2831 | REGEXP *rx = PM_GETRE(pm); |
a0d0e21e LW |
2832 | STRLEN len; |
2833 | int force_on_match = 0; | |
0bcc34c2 | 2834 | const I32 oldsave = PL_savestack_ix; |
792b2c16 | 2835 | STRLEN slen; |
26a74523 | 2836 | bool doutf8 = FALSE; /* whether replacement is in utf8 */ |
db2c6cb3 | 2837 | #ifdef PERL_ANY_COW |
ed252734 NC |
2838 | bool is_cow; |
2839 | #endif | |
a0714e2c | 2840 | SV *nsv = NULL; |
b770e143 | 2841 | /* known replacement string? */ |
eb578fdb | 2842 | SV *dstr = (pm->op_pmflags & PMf_CONST) ? POPs : NULL; |
a0d0e21e | 2843 | |
f410a211 NC |
2844 | PERL_ASYNC_CHECK(); |
2845 | ||
533c011a | 2846 | if (PL_op->op_flags & OPf_STACKED) |
a0d0e21e | 2847 | TARG = POPs; |
6ffceeb7 | 2848 | else if (ARGTARG) |
59f00321 | 2849 | GETTARGET; |
a0d0e21e | 2850 | else { |
54b9620d | 2851 | TARG = DEFSV; |
a0d0e21e | 2852 | EXTEND(SP,1); |
1c846c1f | 2853 | } |
d9f424b2 | 2854 | |
64534138 | 2855 | SvGETMAGIC(TARG); /* must come before cow check */ |
db2c6cb3 | 2856 | #ifdef PERL_ANY_COW |
ed252734 NC |
2857 | /* Awooga. Awooga. "bool" types that are actually char are dangerous, |
2858 | because they make integers such as 256 "false". */ | |
2859 | is_cow = SvIsCOW(TARG) ? TRUE : FALSE; | |
2860 | #else | |
765f542d NC |
2861 | if (SvIsCOW(TARG)) |
2862 | sv_force_normal_flags(TARG,0); | |
ed252734 | 2863 | #endif |
8ca8a454 | 2864 | if (!(rpm->op_pmflags & PMf_NONDESTRUCT) |
8ca8a454 NC |
2865 | && (SvREADONLY(TARG) |
2866 | || ( ((SvTYPE(TARG) == SVt_PVGV && isGV_with_GP(TARG)) | |
2867 | || SvTYPE(TARG) > SVt_PVLV) | |
2868 | && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))) | |
cb077ed2 | 2869 | Perl_croak_no_modify(); |
8ec5e241 NIS |
2870 | PUTBACK; |
2871 | ||
6ac6605d DM |
2872 | orig = SvPV_nomg(TARG, len); |
2873 | /* note we don't (yet) force the var into being a string; if we fail | |
2874 | * to match, we leave as-is; on successful match howeverm, we *will* | |
2875 | * coerce into a string, then repeat the match */ | |
4499db73 | 2876 | if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV || SvVOK(TARG)) |
a0d0e21e | 2877 | force_on_match = 1; |
20be6587 DM |
2878 | |
2879 | /* only replace once? */ | |
2880 | once = !(rpm->op_pmflags & PMf_GLOBAL); | |
2881 | ||
ef07e810 | 2882 | /* See "how taint works" above */ |
284167a5 | 2883 | if (TAINTING_get) { |
20be6587 DM |
2884 | rxtainted = ( |
2885 | (SvTAINTED(TARG) ? SUBST_TAINT_STR : 0) | |
284167a5 | 2886 | | (RX_ISTAINTED(rx) ? SUBST_TAINT_PAT : 0) |
20be6587 DM |
2887 | | ((pm->op_pmflags & PMf_RETAINT) ? SUBST_TAINT_RETAINT : 0) |
2888 | | ((once && !(rpm->op_pmflags & PMf_NONDESTRUCT)) | |
2889 | ? SUBST_TAINT_BOOLRET : 0)); | |
2890 | TAINT_NOT; | |
2891 | } | |
a12c0f56 | 2892 | |
a0d0e21e | 2893 | force_it: |
6ac6605d DM |
2894 | if (!pm || !orig) |
2895 | DIE(aTHX_ "panic: pp_subst, pm=%p, orig=%p", pm, orig); | |
a0d0e21e | 2896 | |
6ac6605d DM |
2897 | strend = orig + len; |
2898 | slen = DO_UTF8(TARG) ? utf8_length((U8*)orig, (U8*)strend) : len; | |
792b2c16 JH |
2899 | maxiters = 2 * slen + 10; /* We can match twice at each |
2900 | position, once with zero-length, | |
2901 | second time with non-zero. */ | |
a0d0e21e | 2902 | |
6a97c51d | 2903 | if (!RX_PRELEN(rx) && PL_curpm |
8d919b0a | 2904 | && !ReANY(rx)->mother_re) { |
3280af22 | 2905 | pm = PL_curpm; |
aaa362c4 | 2906 | rx = PM_GETRE(pm); |
a0d0e21e | 2907 | } |
6502e081 | 2908 | |
6e240d0b | 2909 | #ifdef PERL_SAWAMPERSAND |
6502e081 DM |
2910 | r_flags = ( RX_NPARENS(rx) |
2911 | || PL_sawampersand | |
6502e081 | 2912 | || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY)) |
5b0e71e9 | 2913 | || (rpm->op_pmflags & PMf_KEEPCOPY) |
6502e081 DM |
2914 | ) |
2915 | ? REXEC_COPY_STR | |
2916 | : 0; | |
6e240d0b FC |
2917 | #else |
2918 | r_flags = REXEC_COPY_STR; | |
2919 | #endif | |
7fba1cd6 | 2920 | |
0395280b | 2921 | if (!CALLREGEXEC(rx, orig, strend, orig, 0, TARG, NULL, r_flags)) |
8b64c330 | 2922 | { |
5e79dfb9 DM |
2923 | SPAGAIN; |
2924 | PUSHs(rpm->op_pmflags & PMf_NONDESTRUCT ? TARG : &PL_sv_no); | |
2925 | LEAVE_SCOPE(oldsave); | |
2926 | RETURN; | |
2927 | } | |
1754320d FC |
2928 | PL_curpm = pm; |
2929 | ||
71be2cbc | 2930 | /* known replacement string? */ |
f272994b | 2931 | if (dstr) { |
8514a05a JH |
2932 | /* replacement needing upgrading? */ |
2933 | if (DO_UTF8(TARG) && !doutf8) { | |
db79b45b | 2934 | nsv = sv_newmortal(); |
4a176938 | 2935 | SvSetSV(nsv, dstr); |
47e13f24 | 2936 | if (IN_ENCODING) |
ad2de1b2 | 2937 | sv_recode_to_utf8(nsv, _get_encoding()); |
8514a05a JH |
2938 | else |
2939 | sv_utf8_upgrade(nsv); | |
5c144d81 | 2940 | c = SvPV_const(nsv, clen); |
4a176938 JH |
2941 | doutf8 = TRUE; |
2942 | } | |
2943 | else { | |
5c144d81 | 2944 | c = SvPV_const(dstr, clen); |
4a176938 | 2945 | doutf8 = DO_UTF8(dstr); |
8514a05a | 2946 | } |
bb933b9b FC |
2947 | |
2948 | if (SvTAINTED(dstr)) | |
2949 | rxtainted |= SUBST_TAINT_REPL; | |
f272994b A |
2950 | } |
2951 | else { | |
6136c704 | 2952 | c = NULL; |
f272994b A |
2953 | doutf8 = FALSE; |
2954 | } | |
2955 | ||
71be2cbc | 2956 | /* can do inplace substitution? */ |
ed252734 | 2957 | if (c |
db2c6cb3 | 2958 | #ifdef PERL_ANY_COW |
ed252734 NC |
2959 | && !is_cow |
2960 | #endif | |
fbfb1899 | 2961 | && (I32)clen <= RX_MINLENRET(rx) |
9cefd268 FC |
2962 | && ( once |
2963 | || !(r_flags & REXEC_COPY_STR) | |
2964 | || (!SvGMAGICAL(dstr) && !(RX_EXTFLAGS(rx) & RXf_EVAL_SEEN)) | |
2965 | ) | |
dbc200c5 | 2966 | && !(RX_EXTFLAGS(rx) & RXf_NO_INPLACE_SUBST) |
8ca8a454 NC |
2967 | && (!doutf8 || SvUTF8(TARG)) |
2968 | && !(rpm->op_pmflags & PMf_NONDESTRUCT)) | |
8b030b38 | 2969 | { |
ec911639 | 2970 | |
db2c6cb3 | 2971 | #ifdef PERL_ANY_COW |
ed252734 | 2972 | if (SvIsCOW(TARG)) { |
f7a8268c | 2973 | if (!force_on_match) |
ed252734 | 2974 | goto have_a_cow; |
f7a8268c | 2975 | assert(SvVOK(TARG)); |
ed252734 NC |
2976 | } |
2977 | #endif | |
71be2cbc | 2978 | if (force_on_match) { |
6ac6605d DM |
2979 | /* redo the first match, this time with the orig var |
2980 | * forced into being a string */ | |
71be2cbc | 2981 | force_on_match = 0; |
6ac6605d | 2982 | orig = SvPV_force_nomg(TARG, len); |
71be2cbc | 2983 | goto force_it; |
2984 | } | |
39b40493 | 2985 | |
71be2cbc | 2986 | if (once) { |
c67ab8f2 | 2987 | char *d, *m; |
20be6587 DM |
2988 | if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */ |
2989 | rxtainted |= SUBST_TAINT_PAT; | |
07bc277f NC |
2990 | m = orig + RX_OFFS(rx)[0].start; |
2991 | d = orig + RX_OFFS(rx)[0].end; | |
71be2cbc | 2992 | s = orig; |
2993 | if (m - s > strend - d) { /* faster to shorten from end */ | |
2ec7214c | 2994 | I32 i; |
71be2cbc | 2995 | if (clen) { |
2996 | Copy(c, m, clen, char); | |
2997 | m += clen; | |
a0d0e21e | 2998 | } |
71be2cbc | 2999 | i = strend - d; |
3000 | if (i > 0) { | |
3001 | Move(d, m, i, char); | |
3002 | m += i; | |
a0d0e21e | 3003 | } |
71be2cbc | 3004 | *m = '\0'; |
3005 | SvCUR_set(TARG, m - s); | |
3006 | } | |
2ec7214c DM |
3007 | else { /* faster from front */ |
3008 | I32 i = m - s; | |
71be2cbc | 3009 | d -= clen; |
2ec7214c DM |
3010 | if (i > 0) |
3011 | Move(s, d - i, i, char); | |
71be2cbc | 3012 | sv_chop(TARG, d-i); |
71be2cbc | 3013 | if (clen) |
c947cd8d | 3014 | Copy(c, d, clen, char); |
71be2cbc | 3015 | } |
8ec5e241 | 3016 | SPAGAIN; |
8ca8a454 | 3017 | PUSHs(&PL_sv_yes); |
71be2cbc | 3018 | } |
3019 | else { | |
c67ab8f2 | 3020 | char *d, *m; |
0395280b | 3021 | d = s = RX_OFFS(rx)[0].start + orig; |
71be2cbc | 3022 | do { |
2b25edcf | 3023 | I32 i; |
5d9574c1 | 3024 | if (UNLIKELY(iters++ > maxiters)) |
cea2e8a9 | 3025 | DIE(aTHX_ "Substitution loop"); |
5d9574c1 | 3026 | if (UNLIKELY(RX_MATCH_TAINTED(rx))) /* run time pattern taint, eg locale */ |
20be6587 | 3027 | rxtainted |= SUBST_TAINT_PAT; |
07bc277f | 3028 | m = RX_OFFS(rx)[0].start + orig; |
155aba94 | 3029 | if ((i = m - s)) { |
71be2cbc | 3030 | if (s != d) |
3031 | Move(s, d, i, char); | |
3032 | d += i; | |
a0d0e21e | 3033 | } |
71be2cbc | 3034 | if (clen) { |
3035 | Copy(c, d, clen, char); | |
3036 | d += clen; | |
3037 | } | |
07bc277f | 3038 | s = RX_OFFS(rx)[0].end + orig; |
7ce41e5c FC |
3039 | } while (CALLREGEXEC(rx, s, strend, orig, |
3040 | s == m, /* don't match same null twice */ | |
f722798b | 3041 | TARG, NULL, |
d5e7783a | 3042 | REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW)); |
71be2cbc | 3043 | if (s != d) { |
2b25edcf | 3044 | I32 i = strend - s; |
aa07b2f6 | 3045 | SvCUR_set(TARG, d - SvPVX_const(TARG) + i); |
71be2cbc | 3046 | Move(s, d, i+1, char); /* include the NUL */ |
a0d0e21e | 3047 | } |
8ec5e241 | 3048 | SPAGAIN; |
3c6ef0a5 | 3049 | mPUSHi(iters); |
a0d0e21e LW |
3050 | } |
3051 | } | |
ff6e92e8 | 3052 | else { |
1754320d | 3053 | bool first; |
c67ab8f2 | 3054 | char *m; |
1754320d | 3055 | SV *repl; |
a0d0e21e | 3056 | if (force_on_match) { |
6ac6605d DM |
3057 | /* redo the first match, this time with the orig var |
3058 | * forced into being a string */ | |
a0d0e21e | 3059 | force_on_match = 0; |
0c1438a1 NC |
3060 | if (rpm->op_pmflags & PMf_NONDESTRUCT) { |
3061 | /* I feel that it should be possible to avoid this mortal copy | |
3062 | given that the code below copies into a new destination. | |
3063 | However, I suspect it isn't worth the complexity of | |
3064 | unravelling the C<goto force_it> for the small number of | |
3065 | cases where it would be viable to drop into the copy code. */ | |
3066 | TARG = sv_2mortal(newSVsv(TARG)); | |
3067 | } | |
6ac6605d | 3068 | orig = SvPV_force_nomg(TARG, len); |
a0d0e21e LW |
3069 | goto force_it; |
3070 | } | |
db2c6cb3 | 3071 | #ifdef PERL_ANY_COW |
ed252734 NC |
3072 | have_a_cow: |
3073 | #endif | |
20be6587 DM |
3074 | if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */ |
3075 | rxtainted |= SUBST_TAINT_PAT; | |
1754320d | 3076 | repl = dstr; |
0395280b DM |
3077 | s = RX_OFFS(rx)[0].start + orig; |
3078 | dstr = newSVpvn_flags(orig, s-orig, | |
3079 | SVs_TEMP | (DO_UTF8(TARG) ? SVf_UTF8 : 0)); | |
a0d0e21e | 3080 | if (!c) { |
eb578fdb | 3081 | PERL_CONTEXT *cx; |
8ec5e241 | 3082 | SPAGAIN; |
0395280b | 3083 | m = orig; |
20be6587 DM |
3084 | /* note that a whole bunch of local vars are saved here for |
3085 | * use by pp_substcont: here's a list of them in case you're | |
3086 | * searching for places in this sub that uses a particular var: | |
3087 | * iters maxiters r_flags oldsave rxtainted orig dstr targ | |
3088 | * s m strend rx once */ | |
a0d0e21e | 3089 | PUSHSUBST(cx); |
20e98b0f | 3090 | RETURNOP(cPMOP->op_pmreplrootu.op_pmreplroot); |
a0d0e21e | 3091 | } |
1754320d | 3092 | first = TRUE; |
a0d0e21e | 3093 | do { |
5d9574c1 | 3094 | if (UNLIKELY(iters++ > maxiters)) |
cea2e8a9 | 3095 | DIE(aTHX_ "Substitution loop"); |
5d9574c1 | 3096 | if (UNLIKELY(RX_MATCH_TAINTED(rx))) |
20be6587 | 3097 | rxtainted |= SUBST_TAINT_PAT; |
07bc277f | 3098 | if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) { |
c67ab8f2 DM |
3099 | char *old_s = s; |
3100 | char *old_orig = orig; | |
6502e081 | 3101 | assert(RX_SUBOFFSET(rx) == 0); |
c67ab8f2 | 3102 | |
07bc277f | 3103 | orig = RX_SUBBEG(rx); |
c67ab8f2 DM |
3104 | s = orig + (old_s - old_orig); |
3105 | strend = s + (strend - old_s); | |
a0d0e21e | 3106 | } |
07bc277f | 3107 | m = RX_OFFS(rx)[0].start + orig; |
64534138 | 3108 | sv_catpvn_nomg_maybeutf8(dstr, s, m - s, DO_UTF8(TARG)); |
07bc277f | 3109 | s = RX_OFFS(rx)[0].end + orig; |
1754320d FC |
3110 | if (first) { |
3111 | /* replacement already stringified */ | |
3112 | if (clen) | |
64534138 | 3113 | sv_catpvn_nomg_maybeutf8(dstr, c, clen, doutf8); |
1754320d FC |
3114 | first = FALSE; |
3115 | } | |
3116 | else { | |
47e13f24 | 3117 | if (IN_ENCODING) { |
1754320d FC |
3118 | if (!nsv) nsv = sv_newmortal(); |
3119 | sv_copypv(nsv, repl); | |
ad2de1b2 | 3120 | if (!DO_UTF8(nsv)) sv_recode_to_utf8(nsv, _get_encoding()); |
1754320d FC |
3121 | sv_catsv(dstr, nsv); |
3122 | } | |
3123 | else sv_catsv(dstr, repl); | |
5d9574c1 | 3124 | if (UNLIKELY(SvTAINTED(repl))) |
bb933b9b | 3125 | rxtainted |= SUBST_TAINT_REPL; |
1754320d | 3126 | } |
a0d0e21e LW |
3127 | if (once) |
3128 | break; | |
ff27773b KW |
3129 | } while (CALLREGEXEC(rx, s, strend, orig, |
3130 | s == m, /* Yields minend of 0 or 1 */ | |
d5e7783a DM |
3131 | TARG, NULL, |
3132 | REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW)); | |
64534138 | 3133 | sv_catpvn_nomg_maybeutf8(dstr, s, strend - s, DO_UTF8(TARG)); |
748a9306 | 3134 | |
8ca8a454 NC |
3135 | if (rpm->op_pmflags & PMf_NONDESTRUCT) { |
3136 | /* From here on down we're using the copy, and leaving the original | |
3137 | untouched. */ | |
3138 | TARG = dstr; | |
3139 | SPAGAIN; | |
3140 | PUSHs(dstr); | |
3141 | } else { | |
db2c6cb3 | 3142 | #ifdef PERL_ANY_COW |
8ca8a454 NC |
3143 | /* The match may make the string COW. If so, brilliant, because |
3144 | that's just saved us one malloc, copy and free - the regexp has | |
3145 | donated the old buffer, and we malloc an entirely new one, rather | |
3146 | than the regexp malloc()ing a buffer and copying our original, | |
3147 | only for us to throw it away here during the substitution. */ | |
3148 | if (SvIsCOW(TARG)) { | |
3149 | sv_force_normal_flags(TARG, SV_COW_DROP_PV); | |
3150 | } else | |
ed252734 | 3151 | #endif |
8ca8a454 NC |
3152 | { |
3153 | SvPV_free(TARG); | |
3154 | } | |
3155 | SvPV_set(TARG, SvPVX(dstr)); | |
3156 | SvCUR_set(TARG, SvCUR(dstr)); | |
3157 | SvLEN_set(TARG, SvLEN(dstr)); | |
64534138 | 3158 | SvFLAGS(TARG) |= SvUTF8(dstr); |
8ca8a454 | 3159 | SvPV_set(dstr, NULL); |
748a9306 | 3160 | |
8ca8a454 | 3161 | SPAGAIN; |
3c6ef0a5 | 3162 | mPUSHi(iters); |
8ca8a454 NC |
3163 | } |
3164 | } | |
3165 | ||
3166 | if (!(rpm->op_pmflags & PMf_NONDESTRUCT)) { | |
3167 | (void)SvPOK_only_UTF8(TARG); | |
a0d0e21e | 3168 | } |
20be6587 | 3169 | |
ef07e810 | 3170 | /* See "how taint works" above */ |
284167a5 | 3171 | if (TAINTING_get) { |
20be6587 DM |
3172 | if ((rxtainted & SUBST_TAINT_PAT) || |
3173 | ((rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT)) == | |
3174 | (SUBST_TAINT_STR|SUBST_TAINT_RETAINT)) | |
3175 | ) | |
3176 | (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */ | |
3177 | ||
3178 | if (!(rxtainted & SUBST_TAINT_BOOLRET) | |
3179 | && (rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT)) | |
3180 | ) | |
3181 | SvTAINTED_on(TOPs); /* taint return value */ | |
3182 | else | |
3183 | SvTAINTED_off(TOPs); /* may have got tainted earlier */ | |
3184 | ||
3185 | /* needed for mg_set below */ | |
284167a5 S |
3186 | TAINT_set( |
3187 | cBOOL(rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL)) | |
3188 | ); | |
20be6587 DM |
3189 | SvTAINT(TARG); |
3190 | } | |
3191 | SvSETMAGIC(TARG); /* PL_tainted must be correctly set for this mg_set */ | |
3192 | TAINT_NOT; | |
f1a76097 DM |
3193 | LEAVE_SCOPE(oldsave); |
3194 | RETURN; | |
a0d0e21e LW |
3195 | } |
3196 | ||
3197 | PP(pp_grepwhile) | |
3198 | { | |
20b7effb | 3199 | dSP; |
a0d0e21e LW |
3200 | |
3201 | if (SvTRUEx(POPs)) | |
3280af22 NIS |
3202 | PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr]; |
3203 | ++*PL_markstack_ptr; | |
b2a2a901 | 3204 | FREETMPS; |
d343c3ef | 3205 | LEAVE_with_name("grep_item"); /* exit inner scope */ |
a0d0e21e LW |
3206 | |
3207 | /* All done yet? */ | |
5d9574c1 | 3208 | if (UNLIKELY(PL_stack_base + *PL_markstack_ptr > SP)) { |
a0d0e21e | 3209 | I32 items; |
c4420975 | 3210 | const I32 gimme = GIMME_V; |
a0d0e21e | 3211 | |
d343c3ef | 3212 | LEAVE_with_name("grep"); /* exit outer scope */ |
a0d0e21e | 3213 | (void)POPMARK; /* pop src */ |
3280af22 | 3214 | items = --*PL_markstack_ptr - PL_markstack_ptr[-1]; |
a0d0e21e | 3215 | (void)POPMARK; /* pop dst */ |
3280af22 | 3216 | SP = PL_stack_base + POPMARK; /* pop original mark */ |
54310121 | 3217 | if (gimme == G_SCALAR) { |
7cc47870 RGS |
3218 | dTARGET; |
3219 | XPUSHi(items); | |
a0d0e21e | 3220 | } |
54310121 | 3221 | else if (gimme == G_ARRAY) |
3222 | SP += items; | |
a0d0e21e LW |
3223 | RETURN; |
3224 | } | |
3225 | else { | |
3226 | SV *src; | |
3227 | ||
d343c3ef | 3228 | ENTER_with_name("grep_item"); /* enter inner scope */ |
1d7c1841 | 3229 | SAVEVPTR(PL_curpm); |
a0d0e21e | 3230 | |
6cae08a8 | 3231 | src = PL_stack_base[TOPMARK]; |
60779a30 | 3232 | if (SvPADTMP(src)) { |
6cae08a8 | 3233 | src = PL_stack_base[TOPMARK] = sv_mortalcopy(src); |
a0ed822e FC |
3234 | PL_tmps_floor++; |
3235 | } | |
a0d0e21e | 3236 | SvTEMP_off(src); |
ffd49c98 | 3237 | DEFSV_set(src); |
a0d0e21e LW |
3238 | |
3239 | RETURNOP(cLOGOP->op_other); | |
3240 | } | |
3241 | } | |
3242 | ||
3243 | PP(pp_leavesub) | |
3244 | { | |
20b7effb | 3245 | dSP; |
a0d0e21e LW |
3246 | SV **mark; |
3247 | SV **newsp; | |
3248 | PMOP *newpm; | |
3249 | I32 gimme; | |
eb578fdb | 3250 | PERL_CONTEXT *cx; |
b0d9ce38 | 3251 | SV *sv; |
a0d0e21e | 3252 | |
1f0ba93b DM |
3253 | if (CxMULTICALL(&cxstack[cxstack_ix])) { |
3254 | /* entry zero of a stack is always PL_sv_undef, which | |
3255 | * simplifies converting a '()' return into undef in scalar context */ | |
3256 | assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); | |
9850bf21 | 3257 | return 0; |
1f0ba93b | 3258 | } |
9850bf21 | 3259 | |
a0d0e21e | 3260 | POPBLOCK(cx,newpm); |
5dd42e15 | 3261 | cxstack_ix++; /* temporarily protect top context */ |
1c846c1f | 3262 | |
a1f49e72 | 3263 | TAINT_NOT; |
a0d0e21e LW |
3264 | if (gimme == G_SCALAR) { |
3265 | MARK = newsp + 1; | |
5d9574c1 | 3266 | if (LIKELY(MARK <= SP)) { |
a8bba7fa | 3267 | if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) { |
6f48390a FC |
3268 | if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1 |
3269 | && !SvMAGICAL(TOPs)) { | |
a29cdaf0 IZ |
3270 | *MARK = SvREFCNT_inc(TOPs); |
3271 | FREETMPS; | |
3272 | sv_2mortal(*MARK); | |
cd06dffe GS |
3273 | } |
3274 | else { | |
959e3673 | 3275 | sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */ |
a29cdaf0 | 3276 | FREETMPS; |
959e3673 | 3277 | *MARK = sv_mortalcopy(sv); |
fc2b2dca | 3278 | SvREFCNT_dec_NN(sv); |
a29cdaf0 | 3279 | } |
cd06dffe | 3280 | } |
6f48390a FC |
3281 | else if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1 |
3282 | && !SvMAGICAL(TOPs)) { | |
767eda44 | 3283 | *MARK = TOPs; |
767eda44 | 3284 | } |
cd06dffe | 3285 | else |
767eda44 | 3286 | *MARK = sv_mortalcopy(TOPs); |
cd06dffe GS |
3287 | } |
3288 | else { | |
f86702cc | 3289 | MEXTEND(MARK, 0); |
3280af22 | 3290 | *MARK = &PL_sv_undef; |
a0d0e21e LW |
3291 | } |
3292 | SP = MARK; | |
3293 | } | |
54310121 | 3294 | else if (gimme == G_ARRAY) { |
f86702cc | 3295 | for (MARK = newsp + 1; MARK <= SP; MARK++) { |
6f48390a FC |
3296 | if (!SvTEMP(*MARK) || SvREFCNT(*MARK) != 1 |
3297 | || SvMAGICAL(*MARK)) { | |
f86702cc | 3298 | *MARK = sv_mortalcopy(*MARK); |
a1f49e72 CS |
3299 | TAINT_NOT; /* Each item is independent */ |
3300 | } | |
f86702cc | 3301 | } |
a0d0e21e | 3302 | } |
f86702cc | 3303 | PUTBACK; |
1c846c1f | 3304 | |
a57c6685 | 3305 | LEAVE; |
b0d9ce38 | 3306 | POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */ |
25375124 | 3307 | cxstack_ix--; |
3280af22 | 3308 | PL_curpm = newpm; /* ... and pop $1 et al */ |
a0d0e21e | 3309 | |
b0d9ce38 | 3310 | LEAVESUB(sv); |
f39bc417 | 3311 | return cx->blk_sub.retop; |
a0d0e21e LW |
3312 | } |
3313 | ||
3314 | PP(pp_entersub) | |
3315 | { | |
20b7effb | 3316 | dSP; dPOPss; |
a0d0e21e | 3317 | GV *gv; |
eb578fdb KW |
3318 | CV *cv; |
3319 | PERL_CONTEXT *cx; | |
5d94fbed | 3320 | I32 gimme; |
a9c4fd4e | 3321 | const bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0; |
a0d0e21e | 3322 | |
f5719c02 | 3323 | if (UNLIKELY(!sv)) |
cea2e8a9 | 3324 | DIE(aTHX_ "Not a CODE reference"); |
f5719c02 DM |
3325 | /* This is overwhelmingly the most common case: */ |
3326 | if (!LIKELY(SvTYPE(sv) == SVt_PVGV && (cv = GvCVu((const GV *)sv)))) { | |
313107ce DM |
3327 | switch (SvTYPE(sv)) { |
3328 | case SVt_PVGV: | |
3329 | we_have_a_glob: | |
3330 | if (!(cv = GvCVu((const GV *)sv))) { | |
3331 | HV *stash; | |
3332 | cv = sv_2cv(sv, &stash, &gv, 0); | |
3333 | } | |
3334 | if (!cv) { | |
3335 | ENTER; | |
3336 | SAVETMPS; | |
3337 | goto try_autoload; | |
3338 | } | |
3339 | break; | |
3340 | case SVt_PVLV: | |
3341 | if(isGV_with_GP(sv)) goto we_have_a_glob; | |
924ba076 | 3342 | /* FALLTHROUGH */ |
313107ce DM |
3343 | default: |
3344 | if (sv == &PL_sv_yes) { /* unfound import, ignore */ | |
3345 | if (hasargs) | |
3346 | SP = PL_stack_base + POPMARK; | |
3347 | else | |
3348 | (void)POPMARK; | |
3349 | RETURN; | |
3350 | } | |
3351 | SvGETMAGIC(sv); | |
3352 | if (SvROK(sv)) { | |
3353 | if (SvAMAGIC(sv)) { | |
3354 | sv = amagic_deref_call(sv, to_cv_amg); | |
3355 | /* Don't SPAGAIN here. */ | |
3356 | } | |
3357 | } | |
3358 | else { | |
3359 | const char *sym; | |
3360 | STRLEN len; | |
3361 | if (!SvOK(sv)) | |
3362 | DIE(aTHX_ PL_no_usym, "a subroutine"); | |
3363 | sym = SvPV_nomg_const(sv, len); | |
3364 | if (PL_op->op_private & HINT_STRICT_REFS) | |
3365 | DIE(aTHX_ "Can't use string (\"%" SVf32 "\"%s) as a subroutine ref while \"strict refs\" in use", sv, len>32 ? "..." : ""); | |
3366 | cv = get_cvn_flags(sym, len, GV_ADD|SvUTF8(sv)); | |
3367 | break; | |
3368 | } | |
3369 | cv = MUTABLE_CV(SvRV(sv)); | |
3370 | if (SvTYPE(cv) == SVt_PVCV) | |
3371 | break; | |
924ba076 | 3372 | /* FALLTHROUGH */ |
313107ce DM |
3373 | case SVt_PVHV: |
3374 | case SVt_PVAV: | |
3375 | DIE(aTHX_ "Not a CODE reference"); | |
3376 | /* This is the second most common case: */ | |
3377 | case SVt_PVCV: | |
3378 | cv = MUTABLE_CV(sv); | |
3379 | break; | |
3380 | } | |
f5719c02 | 3381 | } |
a0d0e21e | 3382 | |
a57c6685 | 3383 | ENTER; |
a0d0e21e LW |
3384 | |
3385 | retry: | |
f5719c02 | 3386 | if (UNLIKELY(CvCLONE(cv) && ! CvCLONED(cv))) |
541ed3a9 | 3387 | DIE(aTHX_ "Closure prototype called"); |
f5719c02 | 3388 | if (UNLIKELY(!CvROOT(cv) && !CvXSUB(cv))) { |
2f349aa0 NC |
3389 | GV* autogv; |
3390 | SV* sub_name; | |
3391 | ||
3392 | /* anonymous or undef'd function leaves us no recourse */ | |
ae77754a FC |
3393 | if (CvLEXICAL(cv) && CvHASGV(cv)) |
3394 | DIE(aTHX_ "Undefined subroutine &%"SVf" called", | |
ecf05a58 | 3395 | SVfARG(cv_name(cv, NULL, 0))); |
ae77754a | 3396 | if (CvANON(cv) || !CvHASGV(cv)) { |
2f349aa0 | 3397 | DIE(aTHX_ "Undefined subroutine called"); |
7d2057d8 | 3398 | } |
2f349aa0 NC |
3399 | |
3400 | /* autoloaded stub? */ | |
ae77754a | 3401 | if (cv != GvCV(gv = CvGV(cv))) { |
2f349aa0 NC |
3402 | cv = GvCV(gv); |
3403 | } | |
3404 | /* should call AUTOLOAD now? */ | |
3405 | else { | |
7b52d656 | 3406 | try_autoload: |
d1089224 BF |
3407 | if ((autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv), |
3408 | GvNAMEUTF8(gv) ? SVf_UTF8 : 0))) | |
2f349aa0 NC |
3409 | { |
3410 | cv = GvCV(autogv); | |
3411 | } | |
2f349aa0 | 3412 | else { |
c220e1a1 | 3413 | sorry: |
2f349aa0 | 3414 | sub_name = sv_newmortal(); |
6136c704 | 3415 | gv_efullname3(sub_name, gv, NULL); |
be2597df | 3416 | DIE(aTHX_ "Undefined subroutine &%"SVf" called", SVfARG(sub_name)); |
2f349aa0 NC |
3417 | } |
3418 | } | |
3419 | if (!cv) | |
c220e1a1 | 3420 | goto sorry; |
2f349aa0 | 3421 | goto retry; |
a0d0e21e LW |
3422 | } |
3423 | ||
f5719c02 DM |
3424 | if (UNLIKELY((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) |
3425 | && !CvNODEBUG(cv))) | |
3426 | { | |
005a8a35 | 3427 | Perl_get_db_sub(aTHX_ &sv, cv); |
a9ef256d NC |
3428 | if (CvISXSUB(cv)) |
3429 | PL_curcopdb = PL_curcop; | |
1ad62f64 BR |
3430 | if (CvLVALUE(cv)) { |
3431 | /* check for lsub that handles lvalue subroutines */ | |
07b605e5 | 3432 | cv = GvCV(gv_fetchpvs("DB::lsub", GV_ADDMULTI, SVt_PVCV)); |
1ad62f64 BR |
3433 | /* if lsub not found then fall back to DB::sub */ |
3434 | if (!cv) cv = GvCV(PL_DBsub); | |
3435 | } else { | |
3436 | cv = GvCV(PL_DBsub); | |
3437 | } | |
a9ef256d | 3438 | |
ccafdc96 RGS |
3439 | if (!cv || (!CvXSUB(cv) && !CvSTART(cv))) |
3440 | DIE(aTHX_ "No DB::sub routine defined"); | |
67caa1fe | 3441 | } |
a0d0e21e | 3442 | |
f5719c02 DM |
3443 | gimme = GIMME_V; |
3444 | ||
aed2304a | 3445 | if (!(CvISXSUB(cv))) { |
f1025168 | 3446 | /* This path taken at least 75% of the time */ |
a0d0e21e | 3447 | dMARK; |
b70d5558 | 3448 | PADLIST * const padlist = CvPADLIST(cv); |
3689ad62 | 3449 | I32 depth; |
f5719c02 | 3450 | |
a0d0e21e LW |
3451 | PUSHBLOCK(cx, CXt_SUB, MARK); |
3452 | PUSHSUB(cx); | |
f39bc417 | 3453 | cx->blk_sub.retop = PL_op->op_next; |
3689ad62 | 3454 | if (UNLIKELY((depth = ++CvDEPTH(cv)) >= 2)) { |
3a76ca88 | 3455 | PERL_STACK_OVERFLOW_CHECK(); |
3689ad62 | 3456 | pad_push(padlist, depth); |
a0d0e21e | 3457 | } |
3a76ca88 | 3458 | SAVECOMPPAD(); |
3689ad62 | 3459 | PAD_SET_CUR_NOSAVE(padlist, depth); |
f5719c02 | 3460 | if (LIKELY(hasargs)) { |
10533ace | 3461 | AV *const av = MUTABLE_AV(PAD_SVl(0)); |
bdf02c57 DM |
3462 | SSize_t items; |
3463 | AV **defavp; | |
3464 | ||
f5719c02 | 3465 | if (UNLIKELY(AvREAL(av))) { |
221373f0 GS |
3466 | /* @_ is normally not REAL--this should only ever |
3467 | * happen when DB::sub() calls things that modify @_ */ | |
3468 | av_clear(av); | |
3469 | AvREAL_off(av); | |
3470 | AvREIFY_on(av); | |
3471 | } | |
bdf02c57 DM |
3472 | defavp = &GvAV(PL_defgv); |
3473 | cx->blk_sub.savearray = *defavp; | |
3474 | *defavp = MUTABLE_AV(SvREFCNT_inc_simple_NN(av)); | |
dd2155a4 | 3475 | CX_CURPAD_SAVE(cx->blk_sub); |
6d4ff0d2 | 3476 | cx->blk_sub.argarray = av; |
bdf02c57 | 3477 | items = SP - MARK; |
a0d0e21e | 3478 | |
f5719c02 | 3479 | if (UNLIKELY(items - 1 > AvMAX(av))) { |
77d27ef6 SF |
3480 | SV **ary = AvALLOC(av); |
3481 | AvMAX(av) = items - 1; | |
3482 | Renew(ary, items, SV*); | |
3483 | AvALLOC(av) = ary; | |
3484 | AvARRAY(av) = ary; | |
3485 | } | |
3486 | ||
bdf02c57 | 3487 | Copy(MARK+1,AvARRAY(av),items,SV*); |
93965878 | 3488 | AvFILLp(av) = items - 1; |
1c846c1f | 3489 | |
b479c9f2 | 3490 | MARK = AvARRAY(av); |
a0d0e21e LW |
3491 | while (items--) { |
3492 | if (*MARK) | |
b479c9f2 | 3493 | { |
60779a30 | 3494 | if (SvPADTMP(*MARK)) { |
b479c9f2 | 3495 | *MARK = sv_mortalcopy(*MARK); |
60779a30 | 3496 | } |
a0d0e21e | 3497 | SvTEMP_off(*MARK); |
b479c9f2 | 3498 | } |
a0d0e21e LW |
3499 | MARK++; |
3500 | } | |
3501 | } | |
b479c9f2 | 3502 | SAVETMPS; |
f5719c02 DM |
3503 | if (UNLIKELY((cx->blk_u16 & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO && |
3504 | !CvLVALUE(cv))) | |
0f948285 DIM |
3505 | DIE(aTHX_ "Can't modify non-lvalue subroutine call of &%"SVf, |
3506 | SVfARG(cv_name(cv, NULL, 0))); | |
4a925ff6 GS |
3507 | /* warning must come *after* we fully set up the context |
3508 | * stuff so that __WARN__ handlers can safely dounwind() | |
3509 | * if they want to | |
3510 | */ | |
3689ad62 | 3511 | if (UNLIKELY(depth == PERL_SUB_DEPTH_WARN |
f5719c02 DM |
3512 | && ckWARN(WARN_RECURSION) |
3513 | && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))) | |
4a925ff6 | 3514 | sub_crush_depth(cv); |
a0d0e21e LW |
3515 | RETURNOP(CvSTART(cv)); |
3516 | } | |
f1025168 | 3517 | else { |
de935cc9 | 3518 | SSize_t markix = TOPMARK; |
f1025168 | 3519 | |
b479c9f2 | 3520 | SAVETMPS; |
3a76ca88 | 3521 | PUTBACK; |
f1025168 | 3522 | |
f5719c02 | 3523 | if (UNLIKELY(((PL_op->op_private |
4587c532 FC |
3524 | & PUSHSUB_GET_LVALUE_MASK(Perl_is_lvalue_sub) |
3525 | ) & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO && | |
f5719c02 | 3526 | !CvLVALUE(cv))) |
0f948285 DIM |
3527 | DIE(aTHX_ "Can't modify non-lvalue subroutine call of &%"SVf, |
3528 | SVfARG(cv_name(cv, NULL, 0))); | |
4587c532 | 3529 | |
f5719c02 | 3530 | if (UNLIKELY(!hasargs && GvAV(PL_defgv))) { |
3a76ca88 RGS |
3531 | /* Need to copy @_ to stack. Alternative may be to |
3532 | * switch stack to @_, and copy return values | |
3533 | * back. This would allow popping @_ in XSUB, e.g.. XXXX */ | |
3534 | AV * const av = GvAV(PL_defgv); | |
ad39f3a2 | 3535 | const SSize_t items = AvFILL(av) + 1; |
3a76ca88 RGS |
3536 | |
3537 | if (items) { | |
dd2a7f90 | 3538 | SSize_t i = 0; |
ad39f3a2 | 3539 | const bool m = cBOOL(SvRMAGICAL(av)); |
3a76ca88 RGS |
3540 | /* Mark is at the end of the stack. */ |
3541 | EXTEND(SP, items); | |
dd2a7f90 | 3542 | for (; i < items; ++i) |
ad39f3a2 FC |
3543 | { |
3544 | SV *sv; | |
3545 | if (m) { | |
3546 | SV ** const svp = av_fetch(av, i, 0); | |
3547 | sv = svp ? *svp : NULL; | |
3548 | } | |
3549 | else sv = AvARRAY(av)[i]; | |
3550 | if (sv) SP[i+1] = sv; | |
dd2a7f90 | 3551 | else { |
199f858d | 3552 | SP[i+1] = newSVavdefelem(av, i, 1); |
dd2a7f90 | 3553 | } |
ad39f3a2 | 3554 | } |
3a76ca88 RGS |
3555 | SP += items; |
3556 | PUTBACK ; | |
3557 | } | |
3558 | } | |
3455055f FC |
3559 | else { |
3560 | SV **mark = PL_stack_base + markix; | |
de935cc9 | 3561 | SSize_t items = SP - mark; |
3455055f FC |
3562 | while (items--) { |
3563 | mark++; | |
60779a30 | 3564 | if (*mark && SvPADTMP(*mark)) { |
3455055f | 3565 | *mark = sv_mortalcopy(*mark); |
60779a30 | 3566 | } |
3455055f FC |
3567 | } |
3568 | } | |
3a76ca88 | 3569 | /* We assume first XSUB in &DB::sub is the called one. */ |
f5719c02 | 3570 | if (UNLIKELY(PL_curcopdb)) { |
3a76ca88 RGS |
3571 | SAVEVPTR(PL_curcop); |
3572 | PL_curcop = PL_curcopdb; | |
3573 | PL_curcopdb = NULL; | |
3574 | } | |
3575 | /* Do we need to open block here? XXXX */ | |
72df79cf GF |
3576 | |
3577 | /* CvXSUB(cv) must not be NULL because newXS() refuses NULL xsub address */ | |
3578 | assert(CvXSUB(cv)); | |
16c91539 | 3579 | CvXSUB(cv)(aTHX_ cv); |
3a76ca88 RGS |
3580 | |
3581 | /* Enforce some sanity in scalar context. */ | |
89a18b40 DM |
3582 | if (gimme == G_SCALAR) { |
3583 | SV **svp = PL_stack_base + markix + 1; | |
3584 | if (svp != PL_stack_sp) { | |
3585 | *svp = svp > PL_stack_sp ? &PL_sv_undef : *PL_stack_sp; | |
3586 | PL_stack_sp = svp; | |
3587 | } | |
3a76ca88 | 3588 | } |
a57c6685 | 3589 | LEAVE; |
f1025168 NC |
3590 | return NORMAL; |
3591 | } | |
a0d0e21e LW |
3592 | } |
3593 | ||
44a8e56a | 3594 | void |
864dbfa3 | 3595 | Perl_sub_crush_depth(pTHX_ CV *cv) |
44a8e56a | 3596 | { |
7918f24d NC |
3597 | PERL_ARGS_ASSERT_SUB_CRUSH_DEPTH; |
3598 | ||
44a8e56a | 3599 | if (CvANON(cv)) |
9014280d | 3600 | Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on anonymous subroutine"); |
44a8e56a | 3601 | else { |
35c1215d | 3602 | Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on subroutine \"%"SVf"\"", |
ecf05a58 | 3603 | SVfARG(cv_name(cv,NULL,0))); |
44a8e56a | 3604 | } |
3605 | } | |
3606 | ||
a0d0e21e LW |
3607 | PP(pp_aelem) |
3608 | { | |
20b7effb | 3609 | dSP; |
a0d0e21e | 3610 | SV** svp; |
a3b680e6 | 3611 | SV* const elemsv = POPs; |
d804643f | 3612 | IV elem = SvIV(elemsv); |
502c6561 | 3613 | AV *const av = MUTABLE_AV(POPs); |
e1ec3a88 | 3614 | const U32 lval = PL_op->op_flags & OPf_MOD || LVRET; |
bbfdc870 | 3615 | const U32 defer = PL_op->op_private & OPpLVAL_DEFER; |
4ad10a0b VP |
3616 | const bool localizing = PL_op->op_private & OPpLVAL_INTRO; |
3617 | bool preeminent = TRUE; | |
be6c24e0 | 3618 | SV *sv; |
a0d0e21e | 3619 | |
5d9574c1 | 3620 | if (UNLIKELY(SvROK(elemsv) && !SvGAMAGIC(elemsv) && ckWARN(WARN_MISC))) |
95b63a38 JH |
3621 | Perl_warner(aTHX_ packWARN(WARN_MISC), |
3622 | "Use of reference \"%"SVf"\" as array index", | |
be2597df | 3623 | SVfARG(elemsv)); |
5d9574c1 | 3624 | if (UNLIKELY(SvTYPE(av) != SVt_PVAV)) |
a0d0e21e | 3625 | RETPUSHUNDEF; |
4ad10a0b | 3626 | |
5d9574c1 | 3627 | if (UNLIKELY(localizing)) { |
4ad10a0b VP |
3628 | MAGIC *mg; |
3629 | HV *stash; | |
3630 | ||
3631 | /* If we can determine whether the element exist, | |
3632 | * Try to preserve the existenceness of a tied array | |
3633 | * element by using EXISTS and DELETE if possible. | |
3634 | * Fallback to FETCH and STORE otherwise. */ | |
3635 | if (SvCANEXISTDELETE(av)) | |
3636 | preeminent = av_exists(av, elem); | |
3637 | } | |
3638 | ||
68dc0745 | 3639 | svp = av_fetch(av, elem, lval && !defer); |
a0d0e21e | 3640 | if (lval) { |
2b573ace | 3641 | #ifdef PERL_MALLOC_WRAP |
2b573ace | 3642 | if (SvUOK(elemsv)) { |
a9c4fd4e | 3643 | const UV uv = SvUV(elemsv); |
2b573ace JH |
3644 | elem = uv > IV_MAX ? IV_MAX : uv; |
3645 | } | |
3646 | else if (SvNOK(elemsv)) | |
3647 | elem = (IV)SvNV(elemsv); | |
a3b680e6 AL |
3648 | if (elem > 0) { |
3649 | static const char oom_array_extend[] = | |
3650 | "Out of memory during array extend"; /* Duplicated in av.c */ | |
2b573ace | 3651 | MEM_WRAP_CHECK_1(elem,SV*,oom_array_extend); |
a3b680e6 | 3652 | } |
2b573ace | 3653 | #endif |
ce0d59fd | 3654 | if (!svp || !*svp) { |
bbfdc870 | 3655 | IV len; |
68dc0745 | 3656 | if (!defer) |
cea2e8a9 | 3657 | DIE(aTHX_ PL_no_aelem, elem); |
b9f2b683 | 3658 | len = av_tindex(av); |
199f858d | 3659 | mPUSHs(newSVavdefelem(av, |
bbfdc870 FC |
3660 | /* Resolve a negative index now, unless it points before the |
3661 | beginning of the array, in which case record it for error | |
3662 | reporting in magic_setdefelem. */ | |
199f858d FC |
3663 | elem < 0 && len + elem >= 0 ? len + elem : elem, |
3664 | 1)); | |
68dc0745 | 3665 | RETURN; |
3666 | } | |
5d9574c1 | 3667 | if (UNLIKELY(localizing)) { |
4ad10a0b VP |
3668 | if (preeminent) |
3669 | save_aelem(av, elem, svp); | |
3670 | else | |
3671 | SAVEADELETE(av, elem); | |
3672 | } | |
9026059d GG |
3673 | else if (PL_op->op_private & OPpDEREF) { |
3674 | PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF)); | |
3675 | RETURN; | |
3676 | } | |
a0d0e21e | 3677 | } |
3280af22 | 3678 | sv = (svp ? *svp : &PL_sv_undef); |
39cf747a | 3679 | if (!lval && SvRMAGICAL(av) && SvGMAGICAL(sv)) /* see note in pp_helem() */ |
fd69380d | 3680 | mg_get(sv); |
be6c24e0 | 3681 | PUSHs(sv); |
a0d0e21e LW |
3682 | RETURN; |
3683 | } | |
3684 | ||
9026059d | 3685 | SV* |
864dbfa3 | 3686 | Perl_vivify_ref(pTHX_ SV *sv, U32 to_what) |
02a9e968 | 3687 | { |
7918f24d NC |
3688 | PERL_ARGS_ASSERT_VIVIFY_REF; |
3689 | ||
5b295bef | 3690 | SvGETMAGIC(sv); |
02a9e968 CS |
3691 | if (!SvOK(sv)) { |
3692 | if (SvREADONLY(sv)) | |
cb077ed2 | 3693 | Perl_croak_no_modify(); |
43230e26 | 3694 | prepare_SV_for_RV(sv); |
68dc0745 | 3695 | switch (to_what) { |
5f05dabc | 3696 | case OPpDEREF_SV: |
561b68a9 | 3697 | SvRV_set(sv, newSV(0)); |
5f05dabc | 3698 | break; |
3699 | case OPpDEREF_AV: | |
ad64d0ec | 3700 | SvRV_set(sv, MUTABLE_SV(newAV())); |
5f05dabc | 3701 | break; |
3702 | case OPpDEREF_HV: | |
ad64d0ec | 3703 | SvRV_set(sv, MUTABLE_SV(newHV())); |
5f05dabc | 3704 | break; |
3705 | } | |
02a9e968 CS |
3706 | SvROK_on(sv); |
3707 | SvSETMAGIC(sv); | |
7e482323 | 3708 | SvGETMAGIC(sv); |
02a9e968 | 3709 | } |
9026059d GG |
3710 | if (SvGMAGICAL(sv)) { |
3711 | /* copy the sv without magic to prevent magic from being | |
3712 | executed twice */ | |
3713 | SV* msv = sv_newmortal(); | |
3714 | sv_setsv_nomg(msv, sv); | |
3715 | return msv; | |
3716 | } | |
3717 | return sv; | |
02a9e968 CS |
3718 | } |
3719 | ||
7d6c333c | 3720 | PERL_STATIC_INLINE HV * |
3721 | S_opmethod_stash(pTHX_ SV* meth) | |
f5d5a27c | 3722 | { |
a0d0e21e | 3723 | SV* ob; |
56304f61 | 3724 | HV* stash; |
b55b14d0 | 3725 | |
d648ffcb | 3726 | SV* const sv = PL_stack_base + TOPMARK == PL_stack_sp |
f226e9be FC |
3727 | ? (Perl_croak(aTHX_ "Can't call method \"%"SVf"\" without a " |
3728 | "package or object reference", SVfARG(meth)), | |
3729 | (SV *)NULL) | |
3730 | : *(PL_stack_base + TOPMARK + 1); | |
f5d5a27c | 3731 | |
7d6c333c | 3732 | PERL_ARGS_ASSERT_OPMETHOD_STASH; |
d648ffcb | 3733 | |
5d9574c1 | 3734 | if (UNLIKELY(!sv)) |
7156e69a | 3735 | undefined: |
a214957f VP |
3736 | Perl_croak(aTHX_ "Can't call method \"%"SVf"\" on an undefined value", |
3737 | SVfARG(meth)); | |
4f1b7578 | 3738 | |
d648ffcb | 3739 | if (UNLIKELY(SvGMAGICAL(sv))) mg_get(sv); |
3740 | else if (SvIsCOW_shared_hash(sv)) { /* MyClass->meth() */ | |
3741 | stash = gv_stashsv(sv, GV_CACHE_ONLY); | |
7d6c333c | 3742 | if (stash) return stash; |
d648ffcb | 3743 | } |
3744 | ||
a0d0e21e | 3745 | if (SvROK(sv)) |
ad64d0ec | 3746 | ob = MUTABLE_SV(SvRV(sv)); |
7156e69a | 3747 | else if (!SvOK(sv)) goto undefined; |
a77c16f7 FC |
3748 | else if (isGV_with_GP(sv)) { |
3749 | if (!GvIO(sv)) | |
3750 | Perl_croak(aTHX_ "Can't call method \"%"SVf"\" " | |
3751 | "without a package or object reference", | |
3752 | SVfARG(meth)); | |
3753 | ob = sv; | |
3754 | if (SvTYPE(ob) == SVt_PVLV && LvTYPE(ob) == 'y') { | |
3755 | assert(!LvTARGLEN(ob)); | |
3756 | ob = LvTARG(ob); | |
3757 | assert(ob); | |
3758 | } | |
3759 | *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV(ob)); | |
3760 | } | |
a0d0e21e | 3761 | else { |
89269094 | 3762 | /* this isn't a reference */ |
a0d0e21e | 3763 | GV* iogv; |
f937af42 | 3764 | STRLEN packlen; |
89269094 | 3765 | const char * const packname = SvPV_nomg_const(sv, packlen); |
d283e876 | 3766 | const U32 packname_utf8 = SvUTF8(sv); |
3767 | stash = gv_stashpvn(packname, packlen, packname_utf8 | GV_CACHE_ONLY); | |
7d6c333c | 3768 | if (stash) return stash; |
081fc587 | 3769 | |
89269094 | 3770 | if (!(iogv = gv_fetchpvn_flags( |
d283e876 | 3771 | packname, packlen, packname_utf8, SVt_PVIO |
da6b625f | 3772 | )) || |
ad64d0ec | 3773 | !(ob=MUTABLE_SV(GvIO(iogv)))) |
a0d0e21e | 3774 | { |
af09ea45 | 3775 | /* this isn't the name of a filehandle either */ |
89269094 | 3776 | if (!packlen) |
834a4ddd | 3777 | { |
7156e69a FC |
3778 | Perl_croak(aTHX_ "Can't call method \"%"SVf"\" " |
3779 | "without a package or object reference", | |
3780 | SVfARG(meth)); | |
834a4ddd | 3781 | } |
af09ea45 | 3782 | /* assume it's a package name */ |
d283e876 | 3783 | stash = gv_stashpvn(packname, packlen, packname_utf8); |
7d6c333c | 3784 | if (stash) return stash; |
3785 | else return MUTABLE_HV(sv); | |
a0d0e21e | 3786 | } |
af09ea45 | 3787 | /* it _is_ a filehandle name -- replace with a reference */ |
ad64d0ec | 3788 | *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV(MUTABLE_SV(iogv))); |
a0d0e21e LW |
3789 | } |
3790 | ||
1f3ffe4c | 3791 | /* if we got here, ob should be an object or a glob */ |
f0d43078 | 3792 | if (!ob || !(SvOBJECT(ob) |
a77c16f7 | 3793 | || (isGV_with_GP(ob) |
159b6efe | 3794 | && (ob = MUTABLE_SV(GvIO((const GV *)ob))) |
f0d43078 GS |
3795 | && SvOBJECT(ob)))) |
3796 | { | |
b375e37b BF |
3797 | Perl_croak(aTHX_ "Can't call method \"%"SVf"\" on unblessed reference", |
3798 | SVfARG((SvSCREAM(meth) && strEQ(SvPV_nolen_const(meth),"isa")) | |
3799 | ? newSVpvs_flags("DOES", SVs_TEMP) | |
3800 | : meth)); | |
f0d43078 | 3801 | } |
a0d0e21e | 3802 | |
7d6c333c | 3803 | return SvSTASH(ob); |
3804 | } | |
3805 | ||
3806 | PP(pp_method) | |
3807 | { | |
3808 | dSP; | |
3809 | GV* gv; | |
3810 | HV* stash; | |
3811 | SV* const meth = TOPs; | |
3812 | ||
3813 | if (SvROK(meth)) { | |
3814 | SV* const rmeth = SvRV(meth); | |
3815 | if (SvTYPE(rmeth) == SVt_PVCV) { | |
3816 | SETs(rmeth); | |
3817 | RETURN; | |
3818 | } | |
3819 | } | |
a0d0e21e | 3820 | |
7d6c333c | 3821 | stash = opmethod_stash(meth); |
af09ea45 | 3822 | |
7d6c333c | 3823 | gv = gv_fetchmethod_sv_flags(stash, meth, GV_AUTOLOAD|GV_CROAK); |
3824 | assert(gv); | |
3825 | ||
3826 | SETs(isGV(gv) ? MUTABLE_SV(GvCV(gv)) : MUTABLE_SV(gv)); | |
3827 | RETURN; | |
3828 | } | |
3829 | ||
810bd8b7 | 3830 | #define METHOD_CHECK_CACHE(stash,cache,meth) \ |
3831 | const HE* const he = hv_fetch_ent(cache, meth, 0, 0); \ | |
3832 | if (he) { \ | |
3833 | gv = MUTABLE_GV(HeVAL(he)); \ | |
3834 | if (isGV(gv) && GvCV(gv) && (!GvCVGEN(gv) || GvCVGEN(gv) \ | |
3835 | == (PL_sub_generation + HvMROMETA(stash)->cache_gen))) \ | |
3836 | { \ | |
3837 | XPUSHs(MUTABLE_SV(GvCV(gv))); \ | |
3838 | RETURN; \ | |
3839 | } \ | |
3840 | } \ | |
3841 | ||
7d6c333c | 3842 | PP(pp_method_named) |
3843 | { | |
3844 | dSP; | |
3845 | GV* gv; | |
3846 | SV* const meth = cMETHOPx_meth(PL_op); | |
3847 | HV* const stash = opmethod_stash(meth); | |
3848 | ||
3849 | if (LIKELY(SvTYPE(stash) == SVt_PVHV)) { | |
810bd8b7 | 3850 | METHOD_CHECK_CACHE(stash, stash, meth); |
f5d5a27c CS |
3851 | } |
3852 | ||
7d6c333c | 3853 | gv = gv_fetchmethod_sv_flags(stash, meth, GV_AUTOLOAD|GV_CROAK); |
256d1bb2 | 3854 | assert(gv); |
9b9d0b15 | 3855 | |
7d6c333c | 3856 | XPUSHs(isGV(gv) ? MUTABLE_SV(GvCV(gv)) : MUTABLE_SV(gv)); |
3857 | RETURN; | |
3858 | } | |
3859 | ||
3860 | PP(pp_method_super) | |
3861 | { | |
3862 | dSP; | |
3863 | GV* gv; | |
3864 | HV* cache; | |
3865 | SV* const meth = cMETHOPx_meth(PL_op); | |
3866 | HV* const stash = CopSTASH(PL_curcop); | |
3867 | /* Actually, SUPER doesn't need real object's (or class') stash at all, | |
3868 | * as it uses CopSTASH. However, we must ensure that object(class) is | |
3869 | * correct (this check is done by S_opmethod_stash) */ | |
3870 | opmethod_stash(meth); | |
3871 | ||
3872 | if ((cache = HvMROMETA(stash)->super)) { | |
810bd8b7 | 3873 | METHOD_CHECK_CACHE(stash, cache, meth); |
3874 | } | |
3875 | ||
3876 | gv = gv_fetchmethod_sv_flags(stash, meth, GV_AUTOLOAD|GV_CROAK|GV_SUPER); | |
3877 | assert(gv); | |
3878 | ||
3879 | XPUSHs(isGV(gv) ? MUTABLE_SV(GvCV(gv)) : MUTABLE_SV(gv)); | |
3880 | RETURN; | |
3881 | } | |
3882 | ||
3883 | PP(pp_method_redir) | |
3884 | { | |
3885 | dSP; | |
3886 | GV* gv; | |
3887 | SV* const meth = cMETHOPx_meth(PL_op); | |
3888 | HV* stash = gv_stashsv(cMETHOPx_rclass(PL_op), 0); | |
3889 | opmethod_stash(meth); /* not used but needed for error checks */ | |
3890 | ||
3891 | if (stash) { METHOD_CHECK_CACHE(stash, stash, meth); } | |
3892 | else stash = MUTABLE_HV(cMETHOPx_rclass(PL_op)); | |
3893 | ||
3894 | gv = gv_fetchmethod_sv_flags(stash, meth, GV_AUTOLOAD|GV_CROAK); | |
3895 | assert(gv); | |
3896 | ||
3897 | XPUSHs(isGV(gv) ? MUTABLE_SV(GvCV(gv)) : MUTABLE_SV(gv)); | |
3898 | RETURN; | |
3899 | } | |
3900 | ||
3901 | PP(pp_method_redir_super) | |
3902 | { | |
3903 | dSP; | |
3904 | GV* gv; | |
3905 | HV* cache; | |
3906 | SV* const meth = cMETHOPx_meth(PL_op); | |
3907 | HV* stash = gv_stashsv(cMETHOPx_rclass(PL_op), 0); | |
3908 | opmethod_stash(meth); /* not used but needed for error checks */ | |
3909 | ||
3910 | if (UNLIKELY(!stash)) stash = MUTABLE_HV(cMETHOPx_rclass(PL_op)); | |
3911 | else if ((cache = HvMROMETA(stash)->super)) { | |
3912 | METHOD_CHECK_CACHE(stash, cache, meth); | |
7d6c333c | 3913 | } |
3914 | ||
3915 | gv = gv_fetchmethod_sv_flags(stash, meth, GV_AUTOLOAD|GV_CROAK|GV_SUPER); | |
3916 | assert(gv); | |
3917 | ||
3918 | XPUSHs(isGV(gv) ? MUTABLE_SV(GvCV(gv)) : MUTABLE_SV(gv)); | |
3919 | RETURN; | |
a0d0e21e | 3920 | } |
241d1a3b NC |
3921 | |
3922 | /* | |
14d04a33 | 3923 | * ex: set ts=8 sts=4 sw=4 et: |
37442d52 | 3924 | */ |