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