This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
pp_aassign(): fix ($x,$y) = (undef, $x)
[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;
ebc643ce
DM
1177#ifdef DEBUGGING
1178 bool fake = 0;
1179#endif
5637b936 1180
3280af22 1181 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
a0d0e21e
LW
1182
1183 /* If there's a common identifier on both sides we have to take
1184 * special care that assigning the identifier on the left doesn't
1185 * clobber a value on the right that's used later in the list.
1186 */
acdea6f0 1187
a5f48505
DM
1188 if ( (PL_op->op_private & (OPpASSIGN_COMMON_SCALAR|OPpASSIGN_COMMON_RC1))
1189 /* at least 2 LH and RH elements, or commonality isn't an issue */
1190 && (firstlelem < lastlelem && firstrelem < lastrelem)
acdea6f0 1191 ) {
a5f48505
DM
1192 if (PL_op->op_private & OPpASSIGN_COMMON_RC1) {
1193 /* skip the scan if all scalars have a ref count of 1 */
1194 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
1195 sv = *lelem;
1196 if (!sv || SvREFCNT(sv) == 1)
1197 continue;
1198 if (SvTYPE(sv) != SVt_PVAV && SvTYPE(sv) != SVt_PVAV)
1199 goto do_scan;
1200 break;
1201 }
1202 }
1203 else {
1204 do_scan:
1205 S_aassign_copy_common(aTHX_
ebc643ce
DM
1206 firstlelem, lastlelem, firstrelem, lastrelem
1207#ifdef DEBUGGING
1208 , fake
1209#endif
1210 );
a5f48505 1211 }
a0d0e21e 1212 }
ebc643ce
DM
1213#ifdef DEBUGGING
1214 else {
1215 /* on debugging builds, do the scan even if we've concluded we
1216 * don't need to, then panic if we find commonality. Note that the
1217 * scanner assumes at least 2 elements */
1218 if (firstlelem < lastlelem && firstrelem < lastrelem) {
1219 fake = 1;
1220 goto do_scan;
1221 }
1222 }
1223#endif
a0d0e21e 1224
a5f48505
DM
1225 gimme = GIMME_V;
1226 lval = (gimme == G_ARRAY) ? (PL_op->op_flags & OPf_MOD || LVRET) : 0;
1227
a0d0e21e
LW
1228 relem = firstrelem;
1229 lelem = firstlelem;
4608196e
RGS
1230 ary = NULL;
1231 hash = NULL;
10c8fecd 1232
5d9574c1 1233 while (LIKELY(lelem <= lastlelem)) {
bdaf10a5 1234 bool alias = FALSE;
bbce6d69 1235 TAINT_NOT; /* Each item stands on its own, taintwise. */
a0d0e21e 1236 sv = *lelem++;
bdaf10a5
FC
1237 if (UNLIKELY(!sv)) {
1238 alias = TRUE;
1239 sv = *lelem++;
1240 ASSUME(SvTYPE(sv) == SVt_PVAV);
1241 }
a0d0e21e 1242 switch (SvTYPE(sv)) {
a5f48505
DM
1243 case SVt_PVAV: {
1244 bool already_copied = FALSE;
60edcf09 1245 ary = MUTABLE_AV(sv);
748a9306 1246 magic = SvMAGICAL(ary) != 0;
60edcf09
FC
1247 ENTER;
1248 SAVEFREESV(SvREFCNT_inc_simple_NN(sv));
a5f48505
DM
1249
1250 /* We need to clear ary. The is a danger that if we do this,
1251 * elements on the RHS may be prematurely freed, e.g.
1252 * @a = ($a[0]);
1253 * In the case of possible commonality, make a copy of each
1254 * RHS SV *before* clearing the array, and add a reference
1255 * from the tmps stack, so that it doesn't leak on death.
1256 * Otherwise, make a copy of each RHS SV only as we're storing
1257 * it into the array - that way we don't have to worry about
1258 * it being leaked if we die, but don't incur the cost of
1259 * mortalising everything.
1260 */
1261
1262 if ( (PL_op->op_private & OPpASSIGN_COMMON_AGG)
1263 && (relem <= lastrelem)
1264 && (magic || AvFILL(ary) != -1))
1265 {
1266 SV **svp;
1267 EXTEND_MORTAL(lastrelem - relem + 1);
1268 for (svp = relem; svp <= lastrelem; svp++) {
8c1e192f 1269 /* see comment in S_aassign_copy_common about SV_NOSTEAL */
a5f48505
DM
1270 *svp = sv_mortalcopy_flags(*svp,
1271 SV_GMAGIC|SV_DO_COW_SVSETSV|SV_NOSTEAL);
1272 TAINT_NOT;
1273 }
1274 already_copied = TRUE;
1275 }
1276
1277 av_clear(ary);
7e42bd57 1278 av_extend(ary, lastrelem - relem);
a0d0e21e
LW
1279 i = 0;
1280 while (relem <= lastrelem) { /* gobble up all the rest */
5117ca91 1281 SV **didstore;
bdaf10a5 1282 if (LIKELY(!alias)) {
a5f48505
DM
1283 if (already_copied)
1284 sv = *relem;
1285 else {
1286 if (LIKELY(*relem))
1287 /* before newSV, in case it dies */
1288 SvGETMAGIC(*relem);
1289 sv = newSV(0);
8c1e192f
DM
1290 /* see comment in S_aassign_copy_common about
1291 * SV_NOSTEAL */
1292 sv_setsv_flags(sv, *relem,
1293 (SV_DO_COW_SVSETSV|SV_NOSTEAL));
a5f48505
DM
1294 *relem = sv;
1295 }
bdaf10a5
FC
1296 }
1297 else {
a5f48505
DM
1298 if (!already_copied)
1299 SvGETMAGIC(*relem);
bdaf10a5
FC
1300 if (!SvROK(*relem))
1301 DIE(aTHX_ "Assigned value is not a reference");
1302 if (SvTYPE(SvRV(*relem)) > SVt_PVLV)
1303 /* diag_listed_as: Assigned value is not %s reference */
1304 DIE(aTHX_
1305 "Assigned value is not a SCALAR reference");
a5f48505 1306 if (lval && !already_copied)
bdaf10a5
FC
1307 *relem = sv_mortalcopy(*relem);
1308 /* XXX else check for weak refs? */
1309 sv = SvREFCNT_inc_simple_NN(SvRV(*relem));
1310 }
1311 relem++;
a5f48505
DM
1312 if (already_copied)
1313 SvREFCNT_inc_simple_NN(sv); /* undo mortal free */
5117ca91
GS
1314 didstore = av_store(ary,i++,sv);
1315 if (magic) {
18024492
FC
1316 if (!didstore)
1317 sv_2mortal(sv);
8ef24240 1318 if (SvSMAGICAL(sv))
fb73857a 1319 mg_set(sv);
5117ca91 1320 }
bbce6d69 1321 TAINT_NOT;
a0d0e21e 1322 }
5d9574c1 1323 if (UNLIKELY(PL_delaymagic & DM_ARRAY_ISA))
ad64d0ec 1324 SvSETMAGIC(MUTABLE_SV(ary));
60edcf09 1325 LEAVE;
a0d0e21e 1326 break;
a5f48505
DM
1327 }
1328
10c8fecd 1329 case SVt_PVHV: { /* normal hash */
a0d0e21e 1330 SV *tmpstr;
1c4ea384
RZ
1331 int odd;
1332 int duplicates = 0;
45960564 1333 SV** topelem = relem;
1c4ea384 1334 SV **firsthashrelem = relem;
a5f48505 1335 bool already_copied = FALSE;
a0d0e21e 1336
60edcf09 1337 hash = MUTABLE_HV(sv);
748a9306 1338 magic = SvMAGICAL(hash) != 0;
1c4ea384
RZ
1339
1340 odd = ((lastrelem - firsthashrelem)&1)? 0 : 1;
5d9574c1 1341 if (UNLIKELY(odd)) {
fb8f4cf8 1342 do_oddball(lastrelem, firsthashrelem);
1d2b3927
HS
1343 /* we have firstlelem to reuse, it's not needed anymore
1344 */
1c4ea384
RZ
1345 *(lastrelem+1) = &PL_sv_undef;
1346 }
1347
60edcf09
FC
1348 ENTER;
1349 SAVEFREESV(SvREFCNT_inc_simple_NN(sv));
a5f48505
DM
1350
1351 /* We need to clear hash. The is a danger that if we do this,
1352 * elements on the RHS may be prematurely freed, e.g.
1353 * %h = (foo => $h{bar});
1354 * In the case of possible commonality, make a copy of each
1355 * RHS SV *before* clearing the hash, and add a reference
1356 * from the tmps stack, so that it doesn't leak on death.
1357 */
1358
1359 if ( (PL_op->op_private & OPpASSIGN_COMMON_AGG)
1360 && (relem <= lastrelem)
1361 && (magic || HvUSEDKEYS(hash)))
1362 {
1363 SV **svp;
1364 EXTEND_MORTAL(lastrelem - relem + 1);
1365 for (svp = relem; svp <= lastrelem; svp++) {
1366 *svp = sv_mortalcopy_flags(*svp,
1367 SV_GMAGIC|SV_DO_COW_SVSETSV|SV_NOSTEAL);
1368 TAINT_NOT;
1369 }
1370 already_copied = TRUE;
1371 }
1372
a0d0e21e 1373 hv_clear(hash);
a5f48505 1374
5d9574c1 1375 while (LIKELY(relem < lastrelem+odd)) { /* gobble up all the rest */
5117ca91 1376 HE *didstore;
1c4ea384 1377 assert(*relem);
632b9d6f
FC
1378 /* Copy the key if aassign is called in lvalue context,
1379 to avoid having the next op modify our rhs. Copy
1380 it also if it is gmagical, lest it make the
1381 hv_store_ent call below croak, leaking the value. */
a5f48505 1382 sv = (lval || SvGMAGICAL(*relem)) && !already_copied
632b9d6f
FC
1383 ? sv_mortalcopy(*relem)
1384 : *relem;
45960564 1385 relem++;
1c4ea384 1386 assert(*relem);
a5f48505
DM
1387 if (already_copied)
1388 tmpstr = *relem++;
1389 else {
1390 SvGETMAGIC(*relem);
1391 tmpstr = newSV(0);
1392 sv_setsv_nomg(tmpstr,*relem++); /* value */
1393 }
1394
a88bf2bc 1395 if (gimme == G_ARRAY) {
45960564
DM
1396 if (hv_exists_ent(hash, sv, 0))
1397 /* key overwrites an existing entry */
1398 duplicates += 2;
a88bf2bc 1399 else {
45960564 1400 /* copy element back: possibly to an earlier
1d2b3927
HS
1401 * stack location if we encountered dups earlier,
1402 * possibly to a later stack location if odd */
45960564
DM
1403 *topelem++ = sv;
1404 *topelem++ = tmpstr;
1405 }
1406 }
a5f48505
DM
1407 if (already_copied)
1408 SvREFCNT_inc_simple_NN(tmpstr); /* undo mortal free */
5117ca91 1409 didstore = hv_store_ent(hash,sv,tmpstr,0);
632b9d6f
FC
1410 if (magic) {
1411 if (!didstore) sv_2mortal(tmpstr);
1412 SvSETMAGIC(tmpstr);
1413 }
bbce6d69 1414 TAINT_NOT;
8e07c86e 1415 }
60edcf09 1416 LEAVE;
1c4ea384
RZ
1417 if (duplicates && gimme == G_ARRAY) {
1418 /* at this point we have removed the duplicate key/value
1419 * pairs from the stack, but the remaining values may be
1420 * wrong; i.e. with (a 1 a 2 b 3) on the stack we've removed
1421 * the (a 2), but the stack now probably contains
1422 * (a <freed> b 3), because { hv_save(a,1); hv_save(a,2) }
1423 * obliterates the earlier key. So refresh all values. */
1424 lastrelem -= duplicates;
1425 relem = firsthashrelem;
1426 while (relem < lastrelem+odd) {
1427 HE *he;
1428 he = hv_fetch_ent(hash, *relem++, 0, 0);
1429 *relem++ = (he ? HeVAL(he) : &PL_sv_undef);
1430 }
1431 }
1432 if (odd && gimme == G_ARRAY) lastrelem++;
a0d0e21e
LW
1433 }
1434 break;
1435 default:
6fc92669
GS
1436 if (SvIMMORTAL(sv)) {
1437 if (relem <= lastrelem)
1438 relem++;
1439 break;
a0d0e21e
LW
1440 }
1441 if (relem <= lastrelem) {
5d9574c1 1442 if (UNLIKELY(
1c70fb82
FC
1443 SvTEMP(sv) && !SvSMAGICAL(sv) && SvREFCNT(sv) == 1 &&
1444 (!isGV_with_GP(sv) || SvFAKE(sv)) && ckWARN(WARN_MISC)
5d9574c1 1445 ))
1c70fb82
FC
1446 Perl_warner(aTHX_
1447 packWARN(WARN_MISC),
1448 "Useless assignment to a temporary"
1449 );
a0d0e21e
LW
1450 sv_setsv(sv, *relem);
1451 *(relem++) = sv;
1452 }
1453 else
3280af22 1454 sv_setsv(sv, &PL_sv_undef);
8ef24240 1455 SvSETMAGIC(sv);
a0d0e21e
LW
1456 break;
1457 }
1458 }
5d9574c1 1459 if (UNLIKELY(PL_delaymagic & ~DM_DELAY)) {
985213f2 1460 /* Will be used to set PL_tainting below */
dfff4baf
BF
1461 Uid_t tmp_uid = PerlProc_getuid();
1462 Uid_t tmp_euid = PerlProc_geteuid();
1463 Gid_t tmp_gid = PerlProc_getgid();
1464 Gid_t tmp_egid = PerlProc_getegid();
985213f2 1465
b469f1e0 1466 /* XXX $> et al currently silently ignore failures */
3280af22 1467 if (PL_delaymagic & DM_UID) {
a0d0e21e 1468#ifdef HAS_SETRESUID
b469f1e0
JH
1469 PERL_UNUSED_RESULT(
1470 setresuid((PL_delaymagic & DM_RUID) ? PL_delaymagic_uid : (Uid_t)-1,
1471 (PL_delaymagic & DM_EUID) ? PL_delaymagic_euid : (Uid_t)-1,
1472 (Uid_t)-1));
56febc5e
AD
1473#else
1474# ifdef HAS_SETREUID
b469f1e0
JH
1475 PERL_UNUSED_RESULT(
1476 setreuid((PL_delaymagic & DM_RUID) ? PL_delaymagic_uid : (Uid_t)-1,
1477 (PL_delaymagic & DM_EUID) ? PL_delaymagic_euid : (Uid_t)-1));
56febc5e
AD
1478# else
1479# ifdef HAS_SETRUID
b28d0864 1480 if ((PL_delaymagic & DM_UID) == DM_RUID) {
b469f1e0 1481 PERL_UNUSED_RESULT(setruid(PL_delaymagic_uid));
b28d0864 1482 PL_delaymagic &= ~DM_RUID;
a0d0e21e 1483 }
56febc5e
AD
1484# endif /* HAS_SETRUID */
1485# ifdef HAS_SETEUID
b28d0864 1486 if ((PL_delaymagic & DM_UID) == DM_EUID) {
b469f1e0 1487 PERL_UNUSED_RESULT(seteuid(PL_delaymagic_euid));
b28d0864 1488 PL_delaymagic &= ~DM_EUID;
a0d0e21e 1489 }
56febc5e 1490# endif /* HAS_SETEUID */
b28d0864 1491 if (PL_delaymagic & DM_UID) {
985213f2 1492 if (PL_delaymagic_uid != PL_delaymagic_euid)
cea2e8a9 1493 DIE(aTHX_ "No setreuid available");
b469f1e0 1494 PERL_UNUSED_RESULT(PerlProc_setuid(PL_delaymagic_uid));
a0d0e21e 1495 }
56febc5e
AD
1496# endif /* HAS_SETREUID */
1497#endif /* HAS_SETRESUID */
04783dc7 1498
985213f2
AB
1499 tmp_uid = PerlProc_getuid();
1500 tmp_euid = PerlProc_geteuid();
a0d0e21e 1501 }
b469f1e0 1502 /* XXX $> et al currently silently ignore failures */
3280af22 1503 if (PL_delaymagic & DM_GID) {
a0d0e21e 1504#ifdef HAS_SETRESGID
b469f1e0
JH
1505 PERL_UNUSED_RESULT(
1506 setresgid((PL_delaymagic & DM_RGID) ? PL_delaymagic_gid : (Gid_t)-1,
1507 (PL_delaymagic & DM_EGID) ? PL_delaymagic_egid : (Gid_t)-1,
1508 (Gid_t)-1));
56febc5e
AD
1509#else
1510# ifdef HAS_SETREGID
b469f1e0
JH
1511 PERL_UNUSED_RESULT(
1512 setregid((PL_delaymagic & DM_RGID) ? PL_delaymagic_gid : (Gid_t)-1,
1513 (PL_delaymagic & DM_EGID) ? PL_delaymagic_egid : (Gid_t)-1));
56febc5e
AD
1514# else
1515# ifdef HAS_SETRGID
b28d0864 1516 if ((PL_delaymagic & DM_GID) == DM_RGID) {
b469f1e0 1517 PERL_UNUSED_RESULT(setrgid(PL_delaymagic_gid));
b28d0864 1518 PL_delaymagic &= ~DM_RGID;
a0d0e21e 1519 }
56febc5e
AD
1520# endif /* HAS_SETRGID */
1521# ifdef HAS_SETEGID
b28d0864 1522 if ((PL_delaymagic & DM_GID) == DM_EGID) {
b469f1e0 1523 PERL_UNUSED_RESULT(setegid(PL_delaymagic_egid));
b28d0864 1524 PL_delaymagic &= ~DM_EGID;
a0d0e21e 1525 }
56febc5e 1526# endif /* HAS_SETEGID */
b28d0864 1527 if (PL_delaymagic & DM_GID) {
985213f2 1528 if (PL_delaymagic_gid != PL_delaymagic_egid)
cea2e8a9 1529 DIE(aTHX_ "No setregid available");
b469f1e0 1530 PERL_UNUSED_RESULT(PerlProc_setgid(PL_delaymagic_gid));
a0d0e21e 1531 }
56febc5e
AD
1532# endif /* HAS_SETREGID */
1533#endif /* HAS_SETRESGID */
04783dc7 1534
985213f2
AB
1535 tmp_gid = PerlProc_getgid();
1536 tmp_egid = PerlProc_getegid();
a0d0e21e 1537 }
284167a5 1538 TAINTING_set( TAINTING_get | (tmp_uid && (tmp_euid != tmp_uid || tmp_egid != tmp_gid)) );
9a9b5ec9
DM
1539#ifdef NO_TAINT_SUPPORT
1540 PERL_UNUSED_VAR(tmp_uid);
1541 PERL_UNUSED_VAR(tmp_euid);
1542 PERL_UNUSED_VAR(tmp_gid);
1543 PERL_UNUSED_VAR(tmp_egid);
1544#endif
a0d0e21e 1545 }
3280af22 1546 PL_delaymagic = 0;
54310121 1547
54310121
PP
1548 if (gimme == G_VOID)
1549 SP = firstrelem - 1;
1550 else if (gimme == G_SCALAR) {
1551 dTARGET;
1552 SP = firstrelem;
231cbeb2 1553 SETi(lastrelem - firstrelem + 1);
54310121
PP
1554 }
1555 else {
1c4ea384 1556 if (ary || hash)
1d2b3927
HS
1557 /* note that in this case *firstlelem may have been overwritten
1558 by sv_undef in the odd hash case */
a0d0e21e 1559 SP = lastrelem;
1c4ea384 1560 else {
a0d0e21e 1561 SP = firstrelem + (lastlelem - firstlelem);
1c4ea384
RZ
1562 lelem = firstlelem + (relem - firstrelem);
1563 while (relem <= SP)
1564 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
1565 }
a0d0e21e 1566 }
08aeb9f7 1567
54310121 1568 RETURN;
a0d0e21e
LW
1569}
1570
8782bef2
GB
1571PP(pp_qr)
1572{
20b7effb 1573 dSP;
eb578fdb 1574 PMOP * const pm = cPMOP;
fe578d7f 1575 REGEXP * rx = PM_GETRE(pm);
10599a69 1576 SV * const pkg = rx ? CALLREG_PACKAGE(rx) : NULL;
c4420975 1577 SV * const rv = sv_newmortal();
d63c20f2
DM
1578 CV **cvp;
1579 CV *cv;
288b8c02
NC
1580
1581 SvUPGRADE(rv, SVt_IV);
c2123ae3
NC
1582 /* For a subroutine describing itself as "This is a hacky workaround" I'm
1583 loathe to use it here, but it seems to be the right fix. Or close.
1584 The key part appears to be that it's essential for pp_qr to return a new
1585 object (SV), which implies that there needs to be an effective way to
1586 generate a new SV from the existing SV that is pre-compiled in the
1587 optree. */
1588 SvRV_set(rv, MUTABLE_SV(reg_temp_copy(NULL, rx)));
288b8c02
NC
1589 SvROK_on(rv);
1590
8d919b0a 1591 cvp = &( ReANY((REGEXP *)SvRV(rv))->qr_anoncv);
5d9574c1 1592 if (UNLIKELY((cv = *cvp) && CvCLONE(*cvp))) {
d63c20f2 1593 *cvp = cv_clone(cv);
fc2b2dca 1594 SvREFCNT_dec_NN(cv);
d63c20f2
DM
1595 }
1596
288b8c02 1597 if (pkg) {
f815daf2 1598 HV *const stash = gv_stashsv(pkg, GV_ADD);
fc2b2dca 1599 SvREFCNT_dec_NN(pkg);
288b8c02
NC
1600 (void)sv_bless(rv, stash);
1601 }
1602
5d9574c1 1603 if (UNLIKELY(RX_ISTAINTED(rx))) {
e08e52cf 1604 SvTAINTED_on(rv);
9274aefd
DM
1605 SvTAINTED_on(SvRV(rv));
1606 }
c8c13c22 1607 XPUSHs(rv);
1608 RETURN;
8782bef2
GB
1609}
1610
a0d0e21e
LW
1611PP(pp_match)
1612{
20b7effb 1613 dSP; dTARG;
eb578fdb 1614 PMOP *pm = cPMOP;
d65afb4b 1615 PMOP *dynpm = pm;
eb578fdb 1616 const char *s;
5c144d81 1617 const char *strend;
99a90e59 1618 SSize_t curpos = 0; /* initial pos() or current $+[0] */
a0d0e21e 1619 I32 global;
7fadf4a7 1620 U8 r_flags = 0;
5c144d81 1621 const char *truebase; /* Start of string */
eb578fdb 1622 REGEXP *rx = PM_GETRE(pm);
b3eb6a9b 1623 bool rxtainted;
82334630 1624 const I32 gimme = GIMME_V;
a0d0e21e 1625 STRLEN len;
a3b680e6 1626 const I32 oldsave = PL_savestack_ix;
e60df1fa 1627 I32 had_zerolen = 0;
b1422d62 1628 MAGIC *mg = NULL;
a0d0e21e 1629
533c011a 1630 if (PL_op->op_flags & OPf_STACKED)
a0d0e21e 1631 TARG = POPs;
6ffceeb7 1632 else if (ARGTARG)
59f00321 1633 GETTARGET;
a0d0e21e 1634 else {
54b9620d 1635 TARG = DEFSV;
a0d0e21e
LW
1636 EXTEND(SP,1);
1637 }
d9f424b2 1638
c277df42 1639 PUTBACK; /* EVAL blocks need stack_sp. */
69dc4b30
FC
1640 /* Skip get-magic if this is a qr// clone, because regcomp has
1641 already done it. */
f1d31338 1642 truebase = ReANY(rx)->mother_re
69dc4b30
FC
1643 ? SvPV_nomg_const(TARG, len)
1644 : SvPV_const(TARG, len);
f1d31338 1645 if (!truebase)
2269b42e 1646 DIE(aTHX_ "panic: pp_match");
f1d31338 1647 strend = truebase + len;
284167a5
SM
1648 rxtainted = (RX_ISTAINTED(rx) ||
1649 (TAINT_get && (pm->op_pmflags & PMf_RETAINT)));
9212bbba 1650 TAINT_NOT;
a0d0e21e 1651
6c864ec2 1652 /* We need to know this in case we fail out early - pos() must be reset */
de0df3c0
MH
1653 global = dynpm->op_pmflags & PMf_GLOBAL;
1654
d65afb4b 1655 /* PMdf_USED is set after a ?? matches once */
c737faaf
YO
1656 if (
1657#ifdef USE_ITHREADS
1658 SvREADONLY(PL_regex_pad[pm->op_pmoffset])
1659#else
1660 pm->op_pmflags & PMf_USED
1661#endif
1662 ) {
e5dc5375 1663 DEBUG_r(PerlIO_printf(Perl_debug_log, "?? already matched once"));
de0df3c0 1664 goto nope;
a0d0e21e
LW
1665 }
1666
7e313637
FC
1667 /* empty pattern special-cased to use last successful pattern if
1668 possible, except for qr// */
8d919b0a 1669 if (!ReANY(rx)->mother_re && !RX_PRELEN(rx)
7e313637 1670 && PL_curpm) {
3280af22 1671 pm = PL_curpm;
aaa362c4 1672 rx = PM_GETRE(pm);
a0d0e21e 1673 }
d65afb4b 1674
389ecb56 1675 if (RX_MINLEN(rx) >= 0 && (STRLEN)RX_MINLEN(rx) > len) {
75d43e96
FC
1676 DEBUG_r(PerlIO_printf(Perl_debug_log, "String shorter than min possible regex match (%"
1677 UVuf" < %"IVdf")\n",
1678 (UV)len, (IV)RX_MINLEN(rx)));
de0df3c0 1679 goto nope;
e5dc5375 1680 }
c277df42 1681
8ef97b0e 1682 /* get pos() if //g */
de0df3c0 1683 if (global) {
b1422d62 1684 mg = mg_find_mglob(TARG);
8ef97b0e 1685 if (mg && mg->mg_len >= 0) {
25fdce4a 1686 curpos = MgBYTEPOS(mg, TARG, truebase, len);
8ef97b0e
DM
1687 /* last time pos() was set, it was zero-length match */
1688 if (mg->mg_flags & MGf_MINMATCH)
1689 had_zerolen = 1;
1690 }
a0d0e21e 1691 }
8ef97b0e 1692
6e240d0b 1693#ifdef PERL_SAWAMPERSAND
a41aa44d 1694 if ( RX_NPARENS(rx)
6502e081 1695 || PL_sawampersand
6502e081 1696 || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY))
5b0e71e9 1697 || (dynpm->op_pmflags & PMf_KEEPCOPY)
6e240d0b
FC
1698 )
1699#endif
1700 {
6502e081
DM
1701 r_flags |= (REXEC_COPY_STR|REXEC_COPY_SKIP_PRE);
1702 /* in @a =~ /(.)/g, we iterate multiple times, but copy the buffer
1703 * only on the first iteration. Therefore we need to copy $' as well
1704 * as $&, to make the rest of the string available for captures in
1705 * subsequent iterations */
1706 if (! (global && gimme == G_ARRAY))
1707 r_flags |= REXEC_COPY_SKIP_POST;
1708 };
5b0e71e9
DM
1709#ifdef PERL_SAWAMPERSAND
1710 if (dynpm->op_pmflags & PMf_KEEPCOPY)
1711 /* handle KEEPCOPY in pmop but not rx, eg $r=qr/a/; /$r/p */
1712 r_flags &= ~(REXEC_COPY_SKIP_PRE|REXEC_COPY_SKIP_POST);
1713#endif
22e551b9 1714
f1d31338
DM
1715 s = truebase;
1716
d7be1480 1717 play_it_again:
985afbc1 1718 if (global)
03c83e26 1719 s = truebase + curpos;
f722798b 1720
77da2310 1721 if (!CALLREGEXEC(rx, (char*)s, (char *)strend, (char*)truebase,
03c83e26 1722 had_zerolen, TARG, NULL, r_flags))
03b6c93d 1723 goto nope;
77da2310
NC
1724
1725 PL_curpm = pm;
985afbc1 1726 if (dynpm->op_pmflags & PMf_ONCE)
c737faaf 1727#ifdef USE_ITHREADS
77da2310 1728 SvREADONLY_on(PL_regex_pad[dynpm->op_pmoffset]);
c737faaf 1729#else
77da2310 1730 dynpm->op_pmflags |= PMf_USED;
c737faaf 1731#endif
a0d0e21e 1732
72311751
GS
1733 if (rxtainted)
1734 RX_MATCH_TAINTED_on(rx);
1735 TAINT_IF(RX_MATCH_TAINTED(rx));
35c2ccc3
DM
1736
1737 /* update pos */
1738
1739 if (global && (gimme != G_ARRAY || (dynpm->op_pmflags & PMf_CONTINUE))) {
b1422d62 1740 if (!mg)
35c2ccc3 1741 mg = sv_magicext_mglob(TARG);
25fdce4a 1742 MgBYTEPOS_set(mg, TARG, truebase, RX_OFFS(rx)[0].end);
adf51885
DM
1743 if (RX_ZERO_LEN(rx))
1744 mg->mg_flags |= MGf_MINMATCH;
1745 else
1746 mg->mg_flags &= ~MGf_MINMATCH;
35c2ccc3
DM
1747 }
1748
bf9dff51
DM
1749 if ((!RX_NPARENS(rx) && !global) || gimme != G_ARRAY) {
1750 LEAVE_SCOPE(oldsave);
1751 RETPUSHYES;
1752 }
1753
88ab22af
DM
1754 /* push captures on stack */
1755
bf9dff51 1756 {
07bc277f 1757 const I32 nparens = RX_NPARENS(rx);
a3b680e6 1758 I32 i = (global && !nparens) ? 1 : 0;
a0d0e21e 1759
c277df42 1760 SPAGAIN; /* EVAL blocks could move the stack. */
ffc61ed2
JH
1761 EXTEND(SP, nparens + i);
1762 EXTEND_MORTAL(nparens + i);
1763 for (i = !i; i <= nparens; i++) {
a0d0e21e 1764 PUSHs(sv_newmortal());
5d9574c1
DM
1765 if (LIKELY((RX_OFFS(rx)[i].start != -1)
1766 && RX_OFFS(rx)[i].end != -1 ))
1767 {
07bc277f 1768 const I32 len = RX_OFFS(rx)[i].end - RX_OFFS(rx)[i].start;
f1d31338 1769 const char * const s = RX_OFFS(rx)[i].start + truebase;
5d9574c1
DM
1770 if (UNLIKELY(RX_OFFS(rx)[i].end < 0 || RX_OFFS(rx)[i].start < 0
1771 || len < 0 || len > strend - s))
5637ef5b
NC
1772 DIE(aTHX_ "panic: pp_match start/end pointers, i=%ld, "
1773 "start=%ld, end=%ld, s=%p, strend=%p, len=%"UVuf,
1774 (long) i, (long) RX_OFFS(rx)[i].start,
1775 (long)RX_OFFS(rx)[i].end, s, strend, (UV) len);
a0d0e21e 1776 sv_setpvn(*SP, s, len);
cce850e4 1777 if (DO_UTF8(TARG) && is_utf8_string((U8*)s, len))
a197cbdd 1778 SvUTF8_on(*SP);
a0d0e21e
LW
1779 }
1780 }
1781 if (global) {
0e0b3e82 1782 curpos = (UV)RX_OFFS(rx)[0].end;
03c83e26 1783 had_zerolen = RX_ZERO_LEN(rx);
c277df42 1784 PUTBACK; /* EVAL blocks may use stack */
cf93c79d 1785 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
a0d0e21e
LW
1786 goto play_it_again;
1787 }
4633a7c4 1788 LEAVE_SCOPE(oldsave);
a0d0e21e
LW
1789 RETURN;
1790 }
e5964223 1791 NOT_REACHED; /* NOTREACHED */
a0d0e21e 1792
7b52d656 1793 nope:
d65afb4b 1794 if (global && !(dynpm->op_pmflags & PMf_CONTINUE)) {
b1422d62
DM
1795 if (!mg)
1796 mg = mg_find_mglob(TARG);
1797 if (mg)
1798 mg->mg_len = -1;
a0d0e21e 1799 }
4633a7c4 1800 LEAVE_SCOPE(oldsave);
a0d0e21e
LW
1801 if (gimme == G_ARRAY)
1802 RETURN;
1803 RETPUSHNO;
1804}
1805
1806OP *
864dbfa3 1807Perl_do_readline(pTHX)
a0d0e21e 1808{
20b7effb 1809 dSP; dTARGETSTACKED;
eb578fdb 1810 SV *sv;
a0d0e21e
LW
1811 STRLEN tmplen = 0;
1812 STRLEN offset;
760ac839 1813 PerlIO *fp;
eb578fdb
KW
1814 IO * const io = GvIO(PL_last_in_gv);
1815 const I32 type = PL_op->op_type;
a3b680e6 1816 const I32 gimme = GIMME_V;
a0d0e21e 1817
6136c704 1818 if (io) {
50db69d8 1819 const MAGIC *const mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar);
6136c704 1820 if (mg) {
3e0cb5de 1821 Perl_tied_method(aTHX_ SV_CONST(READLINE), SP, MUTABLE_SV(io), mg, gimme, 0);
6136c704 1822 if (gimme == G_SCALAR) {
50db69d8
NC
1823 SPAGAIN;
1824 SvSetSV_nosteal(TARG, TOPs);
1825 SETTARG;
6136c704 1826 }
50db69d8 1827 return NORMAL;
0b7c7b4f 1828 }
e79b0511 1829 }
4608196e 1830 fp = NULL;
a0d0e21e
LW
1831 if (io) {
1832 fp = IoIFP(io);
1833 if (!fp) {
1834 if (IoFLAGS(io) & IOf_ARGV) {
1835 if (IoFLAGS(io) & IOf_START) {
a0d0e21e 1836 IoLINES(io) = 0;
b9f2b683 1837 if (av_tindex(GvAVn(PL_last_in_gv)) < 0) {
1d7c1841 1838 IoFLAGS(io) &= ~IOf_START;
d5eb9a46 1839 do_open6(PL_last_in_gv, "-", 1, NULL, NULL, 0);
4bac9ae4 1840 SvTAINTED_off(GvSVn(PL_last_in_gv)); /* previous tainting irrelevant */
76f68e9b 1841 sv_setpvs(GvSVn(PL_last_in_gv), "-");
3280af22 1842 SvSETMAGIC(GvSV(PL_last_in_gv));
a2008d6d
GS
1843 fp = IoIFP(io);
1844 goto have_fp;
a0d0e21e
LW
1845 }
1846 }
157fb5a1 1847 fp = nextargv(PL_last_in_gv, PL_op->op_flags & OPf_SPECIAL);
a0d0e21e 1848 if (!fp) { /* Note: fp != IoIFP(io) */
3280af22 1849 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
a0d0e21e
LW
1850 }
1851 }
0d44d22b
NC
1852 else if (type == OP_GLOB)
1853 fp = Perl_start_glob(aTHX_ POPs, io);
a0d0e21e
LW
1854 }
1855 else if (type == OP_GLOB)
1856 SP--;
7716c5c5 1857 else if (IoTYPE(io) == IoTYPE_WRONLY) {
a5390457 1858 report_wrongway_fh(PL_last_in_gv, '>');
a00b5bd3 1859 }
a0d0e21e
LW
1860 }
1861 if (!fp) {
041457d9 1862 if ((!io || !(IoFLAGS(io) & IOf_START))
de7dabb6
TC
1863 && ckWARN(WARN_CLOSED)
1864 && type != OP_GLOB)
041457d9 1865 {
de7dabb6 1866 report_evil_fh(PL_last_in_gv);
3f4520fe 1867 }
54310121 1868 if (gimme == G_SCALAR) {
79628082 1869 /* undef TARG, and push that undefined value */
ba92458f 1870 if (type != OP_RCATLINE) {
aab1202a 1871 sv_setsv(TARG,NULL);
ba92458f 1872 }
a0d0e21e
LW
1873 PUSHTARG;
1874 }
1875 RETURN;
1876 }
a2008d6d 1877 have_fp:
54310121 1878 if (gimme == G_SCALAR) {
a0d0e21e 1879 sv = TARG;
0f722b55
RGS
1880 if (type == OP_RCATLINE && SvGMAGICAL(sv))
1881 mg_get(sv);
48de12d9
RGS
1882 if (SvROK(sv)) {
1883 if (type == OP_RCATLINE)
5668452f 1884 SvPV_force_nomg_nolen(sv);
48de12d9
RGS
1885 else
1886 sv_unref(sv);
1887 }
f7877b28 1888 else if (isGV_with_GP(sv)) {
5668452f 1889 SvPV_force_nomg_nolen(sv);
f7877b28 1890 }
862a34c6 1891 SvUPGRADE(sv, SVt_PV);
a0d0e21e 1892 tmplen = SvLEN(sv); /* remember if already alloced */
e3918bb7 1893 if (!tmplen && !SvREADONLY(sv) && !SvIsCOW(sv)) {
f72e8700
JJ
1894 /* try short-buffering it. Please update t/op/readline.t
1895 * if you change the growth length.
1896 */
1897 Sv_Grow(sv, 80);
1898 }
2b5e58c4
AMS
1899 offset = 0;
1900 if (type == OP_RCATLINE && SvOK(sv)) {
1901 if (!SvPOK(sv)) {
5668452f 1902 SvPV_force_nomg_nolen(sv);
2b5e58c4 1903 }
a0d0e21e 1904 offset = SvCUR(sv);
2b5e58c4 1905 }
a0d0e21e 1906 }
54310121 1907 else {
561b68a9 1908 sv = sv_2mortal(newSV(80));
54310121
PP
1909 offset = 0;
1910 }
fbad3eb5 1911
3887d568
AP
1912 /* This should not be marked tainted if the fp is marked clean */
1913#define MAYBE_TAINT_LINE(io, sv) \
1914 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1915 TAINT; \
1916 SvTAINTED_on(sv); \
1917 }
1918
684bef36 1919/* delay EOF state for a snarfed empty file */
fbad3eb5 1920#define SNARF_EOF(gimme,rs,io,sv) \
684bef36 1921 (gimme != G_SCALAR || SvCUR(sv) \
b9fee9ba 1922 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
fbad3eb5 1923
a0d0e21e 1924 for (;;) {
09e8efcc 1925 PUTBACK;
fbad3eb5 1926 if (!sv_gets(sv, fp, offset)
2d726892
TF
1927 && (type == OP_GLOB
1928 || SNARF_EOF(gimme, PL_rs, io, sv)
1929 || PerlIO_error(fp)))
fbad3eb5 1930 {
760ac839 1931 PerlIO_clearerr(fp);
a0d0e21e 1932 if (IoFLAGS(io) & IOf_ARGV) {
157fb5a1 1933 fp = nextargv(PL_last_in_gv, PL_op->op_flags & OPf_SPECIAL);
a0d0e21e
LW
1934 if (fp)
1935 continue;
3280af22 1936 (void)do_close(PL_last_in_gv, FALSE);
a0d0e21e
LW
1937 }
1938 else if (type == OP_GLOB) {
a2a5de95
NC
1939 if (!do_close(PL_last_in_gv, FALSE)) {
1940 Perl_ck_warner(aTHX_ packWARN(WARN_GLOB),
1941 "glob failed (child exited with status %d%s)",
1942 (int)(STATUS_CURRENT >> 8),
1943 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
4eb79ab5 1944 }
a0d0e21e 1945 }
54310121 1946 if (gimme == G_SCALAR) {
ba92458f
AE
1947 if (type != OP_RCATLINE) {
1948 SV_CHECK_THINKFIRST_COW_DROP(TARG);
0c34ef67 1949 SvOK_off(TARG);
ba92458f 1950 }
09e8efcc 1951 SPAGAIN;
a0d0e21e
LW
1952 PUSHTARG;
1953 }
3887d568 1954 MAYBE_TAINT_LINE(io, sv);
a0d0e21e
LW
1955 RETURN;
1956 }
3887d568 1957 MAYBE_TAINT_LINE(io, sv);
a0d0e21e 1958 IoLINES(io)++;
b9fee9ba 1959 IoFLAGS(io) |= IOf_NOLINE;
71be2cbc 1960 SvSETMAGIC(sv);
09e8efcc 1961 SPAGAIN;
a0d0e21e 1962 XPUSHs(sv);
a0d0e21e 1963 if (type == OP_GLOB) {
349d4f2f 1964 const char *t1;
a0d0e21e 1965
3280af22 1966 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
6136c704 1967 char * const tmps = SvEND(sv) - 1;
aa07b2f6 1968 if (*tmps == *SvPVX_const(PL_rs)) {
c07a80fd 1969 *tmps = '\0';
b162af07 1970 SvCUR_set(sv, SvCUR(sv) - 1);
c07a80fd
PP
1971 }
1972 }
349d4f2f 1973 for (t1 = SvPVX_const(sv); *t1; t1++)
b51c3e77
CB
1974#ifdef __VMS
1975 if (strchr("*%?", *t1))
1976#else
7ad1e72d 1977 if (strchr("$&*(){}[]'\";\\|?<>~`", *t1))
b51c3e77 1978#endif
a0d0e21e 1979 break;
349d4f2f 1980 if (*t1 && PerlLIO_lstat(SvPVX_const(sv), &PL_statbuf) < 0) {
a0d0e21e
LW
1981 (void)POPs; /* Unmatched wildcard? Chuck it... */
1982 continue;
1983 }
2d79bf7f 1984 } else if (SvUTF8(sv)) { /* OP_READLINE, OP_RCATLINE */
d4c19fe8
AL
1985 if (ckWARN(WARN_UTF8)) {
1986 const U8 * const s = (const U8*)SvPVX_const(sv) + offset;
1987 const STRLEN len = SvCUR(sv) - offset;
1988 const U8 *f;
1989
1990 if (!is_utf8_string_loc(s, len, &f))
1991 /* Emulate :encoding(utf8) warning in the same case. */
1992 Perl_warner(aTHX_ packWARN(WARN_UTF8),
1993 "utf8 \"\\x%02X\" does not map to Unicode",
1994 f < (U8*)SvEND(sv) ? *f : 0);
1995 }
a0d0e21e 1996 }
54310121 1997 if (gimme == G_ARRAY) {
a0d0e21e 1998 if (SvLEN(sv) - SvCUR(sv) > 20) {
1da4ca5f 1999 SvPV_shrink_to_cur(sv);
a0d0e21e 2000 }
561b68a9 2001 sv = sv_2mortal(newSV(80));
a0d0e21e
LW
2002 continue;
2003 }
54310121 2004 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
a0d0e21e 2005 /* try to reclaim a bit of scalar space (only on 1st alloc) */
d5b5861b
NC
2006 const STRLEN new_len
2007 = SvCUR(sv) < 60 ? 80 : SvCUR(sv)+40; /* allow some slop */
1da4ca5f 2008 SvPV_renew(sv, new_len);
a0d0e21e
LW
2009 }
2010 RETURN;
2011 }
2012}
2013
a0d0e21e
LW
2014PP(pp_helem)
2015{
20b7effb 2016 dSP;
760ac839 2017 HE* he;
ae77835f 2018 SV **svp;
c445ea15 2019 SV * const keysv = POPs;
85fbaab2 2020 HV * const hv = MUTABLE_HV(POPs);
a3b680e6
AL
2021 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
2022 const U32 defer = PL_op->op_private & OPpLVAL_DEFER;
be6c24e0 2023 SV *sv;
92970b93 2024 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
d30e492c 2025 bool preeminent = TRUE;
a0d0e21e 2026
6dfc73ea
SM
2027 if (SvTYPE(hv) != SVt_PVHV)
2028 RETPUSHUNDEF;
d4c19fe8 2029
92970b93 2030 if (localizing) {
d4c19fe8
AL
2031 MAGIC *mg;
2032 HV *stash;
d30e492c
VP
2033
2034 /* If we can determine whether the element exist,
2035 * Try to preserve the existenceness of a tied hash
2036 * element by using EXISTS and DELETE if possible.
2037 * Fallback to FETCH and STORE otherwise. */
2c5f48c2 2038 if (SvCANEXISTDELETE(hv))
d30e492c 2039 preeminent = hv_exists_ent(hv, keysv, 0);
d4c19fe8 2040 }
d30e492c 2041
5f9d7e2b 2042 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
d4c19fe8 2043 svp = he ? &HeVAL(he) : NULL;
a0d0e21e 2044 if (lval) {
746f6409 2045 if (!svp || !*svp || *svp == &PL_sv_undef) {
68dc0745
PP
2046 SV* lv;
2047 SV* key2;
2d8e6c8d 2048 if (!defer) {
be2597df 2049 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
2d8e6c8d 2050 }
68dc0745
PP
2051 lv = sv_newmortal();
2052 sv_upgrade(lv, SVt_PVLV);
2053 LvTYPE(lv) = 'y';
6136c704 2054 sv_magic(lv, key2 = newSVsv(keysv), PERL_MAGIC_defelem, NULL, 0);
fc2b2dca 2055 SvREFCNT_dec_NN(key2); /* sv_magic() increments refcount */
b37c2d43 2056 LvTARG(lv) = SvREFCNT_inc_simple(hv);
68dc0745
PP
2057 LvTARGLEN(lv) = 1;
2058 PUSHs(lv);
2059 RETURN;
2060 }
92970b93 2061 if (localizing) {
bfcb3514 2062 if (HvNAME_get(hv) && isGV(*svp))
159b6efe 2063 save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL));
47cfc530
VP
2064 else if (preeminent)
2065 save_helem_flags(hv, keysv, svp,
2066 (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC);
2067 else
2068 SAVEHDELETE(hv, keysv);
5f05dabc 2069 }
9026059d
GG
2070 else if (PL_op->op_private & OPpDEREF) {
2071 PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF));
2072 RETURN;
2073 }
a0d0e21e 2074 }
746f6409 2075 sv = (svp && *svp ? *svp : &PL_sv_undef);
fd69380d
DM
2076 /* Originally this did a conditional C<sv = sv_mortalcopy(sv)>; this
2077 * was to make C<local $tied{foo} = $tied{foo}> possible.
2078 * However, it seems no longer to be needed for that purpose, and
2079 * introduced a new bug: stuff like C<while ($hash{taintedval} =~ /.../g>
2080 * would loop endlessly since the pos magic is getting set on the
2081 * mortal copy and lost. However, the copy has the effect of
2082 * triggering the get magic, and losing it altogether made things like
2083 * c<$tied{foo};> in void context no longer do get magic, which some
2084 * code relied on. Also, delayed triggering of magic on @+ and friends
2085 * meant the original regex may be out of scope by now. So as a
2086 * compromise, do the get magic here. (The MGf_GSKIP flag will stop it
2087 * being called too many times). */
39cf747a 2088 if (!lval && SvRMAGICAL(hv) && SvGMAGICAL(sv))
fd69380d 2089 mg_get(sv);
be6c24e0 2090 PUSHs(sv);
a0d0e21e
LW
2091 RETURN;
2092}
2093
fedf30e1
DM
2094
2095/* a stripped-down version of Perl_softref2xv() for use by
2096 * pp_multideref(), which doesn't use PL_op->op_flags */
2097
2098GV *
2099S_softref2xv_lite(pTHX_ SV *const sv, const char *const what,
2100 const svtype type)
2101{
2102 if (PL_op->op_private & HINT_STRICT_REFS) {
2103 if (SvOK(sv))
2104 Perl_die(aTHX_ PL_no_symref_sv, sv,
2105 (SvPOKp(sv) && SvCUR(sv)>32 ? "..." : ""), what);
2106 else
2107 Perl_die(aTHX_ PL_no_usym, what);
2108 }
2109 if (!SvOK(sv))
2110 Perl_die(aTHX_ PL_no_usym, what);
2111 return gv_fetchsv_nomg(sv, GV_ADD, type);
2112}
2113
2114
79815f56
DM
2115/* Handle one or more aggregate derefs and array/hash indexings, e.g.
2116 * $h->{foo} or $a[0]{$key}[$i] or f()->[1]
fedf30e1
DM
2117 *
2118 * op_aux points to an array of unions of UV / IV / SV* / PADOFFSET.
79815f56
DM
2119 * Each of these either contains a set of actions, or an argument, such as
2120 * an IV to use as an array index, or a lexical var to retrieve.
2121 * Several actions re stored per UV; we keep shifting new actions off the
2122 * one UV, and only reload when it becomes zero.
fedf30e1
DM
2123 */
2124
2125PP(pp_multideref)
2126{
2127 SV *sv = NULL; /* init to avoid spurious 'may be used uninitialized' */
2128 UNOP_AUX_item *items = cUNOP_AUXx(PL_op)->op_aux;
2129 UV actions = items->uv;
2130
2131 assert(actions);
2132 /* this tells find_uninit_var() where we're up to */
2133 PL_multideref_pc = items;
2134
2135 while (1) {
2136 /* there are three main classes of action; the first retrieve
2137 * the initial AV or HV from a variable or the stack; the second
2138 * does the equivalent of an unrolled (/DREFAV, rv2av, aelem),
2139 * the third an unrolled (/DREFHV, rv2hv, helem).
2140 */
2141 switch (actions & MDEREF_ACTION_MASK) {
2142
2143 case MDEREF_reload:
2144 actions = (++items)->uv;
2145 continue;
2146
2147 case MDEREF_AV_padav_aelem: /* $lex[...] */
2148 sv = PAD_SVl((++items)->pad_offset);
2149 goto do_AV_aelem;
2150
2151 case MDEREF_AV_gvav_aelem: /* $pkg[...] */
2152 sv = UNOP_AUX_item_sv(++items);
2153 assert(isGV_with_GP(sv));
2154 sv = (SV*)GvAVn((GV*)sv);
2155 goto do_AV_aelem;
2156
2157 case MDEREF_AV_pop_rv2av_aelem: /* expr->[...] */
2158 {
2159 dSP;
2160 sv = POPs;
2161 PUTBACK;
2162 goto do_AV_rv2av_aelem;
2163 }
2164
2165 case MDEREF_AV_gvsv_vivify_rv2av_aelem: /* $pkg->[...] */
2166 sv = UNOP_AUX_item_sv(++items);
2167 assert(isGV_with_GP(sv));
2168 sv = GvSVn((GV*)sv);
2169 goto do_AV_vivify_rv2av_aelem;
2170
2171 case MDEREF_AV_padsv_vivify_rv2av_aelem: /* $lex->[...] */
2172 sv = PAD_SVl((++items)->pad_offset);
2173 /* FALLTHROUGH */
2174
2175 do_AV_vivify_rv2av_aelem:
2176 case MDEREF_AV_vivify_rv2av_aelem: /* vivify, ->[...] */
2177 /* this is the OPpDEREF action normally found at the end of
2178 * ops like aelem, helem, rv2sv */
2179 sv = vivify_ref(sv, OPpDEREF_AV);
2180 /* FALLTHROUGH */
2181
2182 do_AV_rv2av_aelem:
2183 /* this is basically a copy of pp_rv2av when it just has the
2184 * sKR/1 flags */
2185 SvGETMAGIC(sv);
2186 if (LIKELY(SvROK(sv))) {
2187 if (UNLIKELY(SvAMAGIC(sv))) {
2188 sv = amagic_deref_call(sv, to_av_amg);
2189 }
2190 sv = SvRV(sv);
2191 if (UNLIKELY(SvTYPE(sv) != SVt_PVAV))
2192 DIE(aTHX_ "Not an ARRAY reference");
2193 }
2194 else if (SvTYPE(sv) != SVt_PVAV) {
2195 if (!isGV_with_GP(sv))
2196 sv = (SV*)S_softref2xv_lite(aTHX_ sv, "an ARRAY", SVt_PVAV);
2197 sv = MUTABLE_SV(GvAVn((GV*)sv));
2198 }
2199 /* FALLTHROUGH */
2200
2201 do_AV_aelem:
2202 {
2203 /* retrieve the key; this may be either a lexical or package
2204 * var (whose index/ptr is stored as an item) or a signed
2205 * integer constant stored as an item.
2206 */
2207 SV *elemsv;
2208 IV elem = 0; /* to shut up stupid compiler warnings */
2209
2210
2211 assert(SvTYPE(sv) == SVt_PVAV);
2212
2213 switch (actions & MDEREF_INDEX_MASK) {
2214 case MDEREF_INDEX_none:
2215 goto finish;
2216 case MDEREF_INDEX_const:
2217 elem = (++items)->iv;
2218 break;
2219 case MDEREF_INDEX_padsv:
2220 elemsv = PAD_SVl((++items)->pad_offset);
2221 goto check_elem;
2222 case MDEREF_INDEX_gvsv:
2223 elemsv = UNOP_AUX_item_sv(++items);
2224 assert(isGV_with_GP(elemsv));
2225 elemsv = GvSVn((GV*)elemsv);
2226 check_elem:
2227 if (UNLIKELY(SvROK(elemsv) && !SvGAMAGIC(elemsv)
2228 && ckWARN(WARN_MISC)))
2229 Perl_warner(aTHX_ packWARN(WARN_MISC),
2230 "Use of reference \"%"SVf"\" as array index",
2231 SVfARG(elemsv));
2232 /* the only time that S_find_uninit_var() needs this
2233 * is to determine which index value triggered the
2234 * undef warning. So just update it here. Note that
2235 * since we don't save and restore this var (e.g. for
2236 * tie or overload execution), its value will be
2237 * meaningless apart from just here */
2238 PL_multideref_pc = items;
2239 elem = SvIV(elemsv);
2240 break;
2241 }
2242
2243
2244 /* this is basically a copy of pp_aelem with OPpDEREF skipped */
2245
2246 if (!(actions & MDEREF_FLAG_last)) {
2247 SV** svp = av_fetch((AV*)sv, elem, 1);
2248 if (!svp || ! (sv=*svp))
2249 DIE(aTHX_ PL_no_aelem, elem);
2250 break;
2251 }
2252
2253 if (PL_op->op_private &
2254 (OPpMULTIDEREF_EXISTS|OPpMULTIDEREF_DELETE))
2255 {
2256 if (PL_op->op_private & OPpMULTIDEREF_EXISTS) {
2257 sv = av_exists((AV*)sv, elem) ? &PL_sv_yes : &PL_sv_no;
2258 }
2259 else {
2260 I32 discard = (GIMME_V == G_VOID) ? G_DISCARD : 0;
2261 sv = av_delete((AV*)sv, elem, discard);
2262 if (discard)
2263 return NORMAL;
2264 if (!sv)
2265 sv = &PL_sv_undef;
2266 }
2267 }
2268 else {
2269 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
2270 const U32 defer = PL_op->op_private & OPpLVAL_DEFER;
2271 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
2272 bool preeminent = TRUE;
2273 AV *const av = (AV*)sv;
2274 SV** svp;
2275
2276 if (UNLIKELY(localizing)) {
2277 MAGIC *mg;
2278 HV *stash;
2279
2280 /* If we can determine whether the element exist,
2281 * Try to preserve the existenceness of a tied array
2282 * element by using EXISTS and DELETE if possible.
2283 * Fallback to FETCH and STORE otherwise. */
2284 if (SvCANEXISTDELETE(av))
2285 preeminent = av_exists(av, elem);
2286 }
2287
2288 svp = av_fetch(av, elem, lval && !defer);
2289
2290 if (lval) {
2291 if (!svp || !(sv = *svp)) {
2292 IV len;
2293 if (!defer)
2294 DIE(aTHX_ PL_no_aelem, elem);
2295 len = av_tindex(av);
2296 sv = sv_2mortal(newSVavdefelem(av,
2297 /* Resolve a negative index now, unless it points
2298 * before the beginning of the array, in which
2299 * case record it for error reporting in
2300 * magic_setdefelem. */
2301 elem < 0 && len + elem >= 0
2302 ? len + elem : elem, 1));
2303 }
2304 else {
2305 if (UNLIKELY(localizing)) {
2306 if (preeminent) {
2307 save_aelem(av, elem, svp);
2308 sv = *svp; /* may have changed */
2309 }
2310 else
2311 SAVEADELETE(av, elem);
2312 }
2313 }
2314 }
2315 else {
2316 sv = (svp ? *svp : &PL_sv_undef);
2317 /* see note in pp_helem() */
2318 if (SvRMAGICAL(av) && SvGMAGICAL(sv))
2319 mg_get(sv);
2320 }
2321 }
2322
2323 }
2324 finish:
2325 {
2326 dSP;
2327 XPUSHs(sv);
2328 RETURN;
2329 }
2330 /* NOTREACHED */
2331
2332
2333
2334
2335 case MDEREF_HV_padhv_helem: /* $lex{...} */
2336 sv = PAD_SVl((++items)->pad_offset);
2337 goto do_HV_helem;
2338
2339 case MDEREF_HV_gvhv_helem: /* $pkg{...} */
2340 sv = UNOP_AUX_item_sv(++items);
2341 assert(isGV_with_GP(sv));
2342 sv = (SV*)GvHVn((GV*)sv);
2343 goto do_HV_helem;
2344
2345 case MDEREF_HV_pop_rv2hv_helem: /* expr->{...} */
2346 {
2347 dSP;
2348 sv = POPs;
2349 PUTBACK;
2350 goto do_HV_rv2hv_helem;
2351 }
2352
2353 case MDEREF_HV_gvsv_vivify_rv2hv_helem: /* $pkg->{...} */
2354 sv = UNOP_AUX_item_sv(++items);
2355 assert(isGV_with_GP(sv));
2356 sv = GvSVn((GV*)sv);
2357 goto do_HV_vivify_rv2hv_helem;
2358
2359 case MDEREF_HV_padsv_vivify_rv2hv_helem: /* $lex->{...} */
2360 sv = PAD_SVl((++items)->pad_offset);
2361 /* FALLTHROUGH */
2362
2363 do_HV_vivify_rv2hv_helem:
2364 case MDEREF_HV_vivify_rv2hv_helem: /* vivify, ->{...} */
2365 /* this is the OPpDEREF action normally found at the end of
2366 * ops like aelem, helem, rv2sv */
2367 sv = vivify_ref(sv, OPpDEREF_HV);
2368 /* FALLTHROUGH */
2369
2370 do_HV_rv2hv_helem:
2371 /* this is basically a copy of pp_rv2hv when it just has the
2372 * sKR/1 flags (and pp_rv2hv is aliased to pp_rv2av) */
2373
2374 SvGETMAGIC(sv);
2375 if (LIKELY(SvROK(sv))) {
2376 if (UNLIKELY(SvAMAGIC(sv))) {
2377 sv = amagic_deref_call(sv, to_hv_amg);
2378 }
2379 sv = SvRV(sv);
2380 if (UNLIKELY(SvTYPE(sv) != SVt_PVHV))
2381 DIE(aTHX_ "Not a HASH reference");
2382 }
2383 else if (SvTYPE(sv) != SVt_PVHV) {
2384 if (!isGV_with_GP(sv))
2385 sv = (SV*)S_softref2xv_lite(aTHX_ sv, "a HASH", SVt_PVHV);
2386 sv = MUTABLE_SV(GvHVn((GV*)sv));
2387 }
2388 /* FALLTHROUGH */
2389
2390 do_HV_helem:
2391 {
2392 /* retrieve the key; this may be either a lexical / package
2393 * var or a string constant, whose index/ptr is stored as an
2394 * item
2395 */
2396 SV *keysv = NULL; /* to shut up stupid compiler warnings */
2397
2398 assert(SvTYPE(sv) == SVt_PVHV);
2399
2400 switch (actions & MDEREF_INDEX_MASK) {
2401 case MDEREF_INDEX_none:
2402 goto finish;
2403
2404 case MDEREF_INDEX_const:
2405 keysv = UNOP_AUX_item_sv(++items);
2406 break;
2407
2408 case MDEREF_INDEX_padsv:
2409 keysv = PAD_SVl((++items)->pad_offset);
2410 break;
2411
2412 case MDEREF_INDEX_gvsv:
2413 keysv = UNOP_AUX_item_sv(++items);
2414 keysv = GvSVn((GV*)keysv);
2415 break;
2416 }
2417
2418 /* see comment above about setting this var */
2419 PL_multideref_pc = items;
2420
2421
2422 /* ensure that candidate CONSTs have been HEKified */
2423 assert( ((actions & MDEREF_INDEX_MASK) != MDEREF_INDEX_const)
2424 || SvTYPE(keysv) >= SVt_PVMG
2425 || !SvOK(keysv)
2426 || SvROK(keysv)
2427 || SvIsCOW_shared_hash(keysv));
2428
2429 /* this is basically a copy of pp_helem with OPpDEREF skipped */
2430
2431 if (!(actions & MDEREF_FLAG_last)) {
2432 HE *he = hv_fetch_ent((HV*)sv, keysv, 1, 0);
2433 if (!he || !(sv=HeVAL(he)) || sv == &PL_sv_undef)
2434 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
2435 break;
2436 }
2437
2438 if (PL_op->op_private &
2439 (OPpMULTIDEREF_EXISTS|OPpMULTIDEREF_DELETE))
2440 {
2441 if (PL_op->op_private & OPpMULTIDEREF_EXISTS) {
2442 sv = hv_exists_ent((HV*)sv, keysv, 0)
2443 ? &PL_sv_yes : &PL_sv_no;
2444 }
2445 else {
2446 I32 discard = (GIMME_V == G_VOID) ? G_DISCARD : 0;
2447 sv = hv_delete_ent((HV*)sv, keysv, discard, 0);
2448 if (discard)
2449 return NORMAL;
2450 if (!sv)
2451 sv = &PL_sv_undef;
2452 }
2453 }
2454 else {
2455 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
2456 const U32 defer = PL_op->op_private & OPpLVAL_DEFER;
2457 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
2458 bool preeminent = TRUE;
2459 SV **svp;
2460 HV * const hv = (HV*)sv;
2461 HE* he;
2462
2463 if (UNLIKELY(localizing)) {
2464 MAGIC *mg;
2465 HV *stash;
2466
2467 /* If we can determine whether the element exist,
2468 * Try to preserve the existenceness of a tied hash
2469 * element by using EXISTS and DELETE if possible.
2470 * Fallback to FETCH and STORE otherwise. */
2471 if (SvCANEXISTDELETE(hv))
2472 preeminent = hv_exists_ent(hv, keysv, 0);
2473 }
2474
2475 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
2476 svp = he ? &HeVAL(he) : NULL;
2477
2478
2479 if (lval) {
2480 if (!svp || !(sv = *svp) || sv == &PL_sv_undef) {
2481 SV* lv;
2482 SV* key2;
2483 if (!defer)
2484 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
2485 lv = sv_newmortal();
2486 sv_upgrade(lv, SVt_PVLV);
2487 LvTYPE(lv) = 'y';
2488 sv_magic(lv, key2 = newSVsv(keysv),
2489 PERL_MAGIC_defelem, NULL, 0);
2490 /* sv_magic() increments refcount */
2491 SvREFCNT_dec_NN(key2);
2492 LvTARG(lv) = SvREFCNT_inc_simple(hv);
2493 LvTARGLEN(lv) = 1;
2494 sv = lv;
2495 }
2496 else {
2497 if (localizing) {
2498 if (HvNAME_get(hv) && isGV(sv))
2499 save_gp(MUTABLE_GV(sv),
2500 !(PL_op->op_flags & OPf_SPECIAL));
2501 else if (preeminent) {
2502 save_helem_flags(hv, keysv, svp,
2503 (PL_op->op_flags & OPf_SPECIAL)
2504 ? 0 : SAVEf_SETMAGIC);
2505 sv = *svp; /* may have changed */
2506 }
2507 else
2508 SAVEHDELETE(hv, keysv);
2509 }
2510 }
2511 }
2512 else {
2513 sv = (svp && *svp ? *svp : &PL_sv_undef);
2514 /* see note in pp_helem() */
2515 if (SvRMAGICAL(hv) && SvGMAGICAL(sv))
2516 mg_get(sv);
2517 }
2518 }
2519 goto finish;
2520 }
2521
2522 } /* switch */
2523
2524 actions >>= MDEREF_SHIFT;
2525 } /* while */
2526 /* NOTREACHED */
2527}
2528
2529
a0d0e21e
LW
2530PP(pp_iter)
2531{
20b7effb 2532 dSP;
eb578fdb 2533 PERL_CONTEXT *cx;
7d6c2cef 2534 SV *oldsv;
1d7c1841 2535 SV **itersvp;
a0d0e21e 2536
924508f0 2537 EXTEND(SP, 1);
a0d0e21e 2538 cx = &cxstack[cxstack_ix];
1d7c1841 2539 itersvp = CxITERVAR(cx);
a48ce6be
DM
2540
2541 switch (CxTYPE(cx)) {
17c91640 2542
b552b52c
DM
2543 case CXt_LOOP_LAZYSV: /* string increment */
2544 {
2545 SV* cur = cx->blk_loop.state_u.lazysv.cur;
2546 SV *end = cx->blk_loop.state_u.lazysv.end;
2547 /* If the maximum is !SvOK(), pp_enteriter substitutes PL_sv_no.
2548 It has SvPVX of "" and SvCUR of 0, which is what we want. */
2549 STRLEN maxlen = 0;
2550 const char *max = SvPV_const(end, maxlen);
5d9574c1 2551 if (UNLIKELY(SvNIOK(cur) || SvCUR(cur) > maxlen))
b552b52c
DM
2552 RETPUSHNO;
2553
2554 oldsv = *itersvp;
5d9574c1 2555 if (LIKELY(SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv))) {
b552b52c
DM
2556 /* safe to reuse old SV */
2557 sv_setsv(oldsv, cur);
a48ce6be 2558 }
b552b52c
DM
2559 else
2560 {
2561 /* we need a fresh SV every time so that loop body sees a
2562 * completely new SV for closures/references to work as
2563 * they used to */
2564 *itersvp = newSVsv(cur);
fc2b2dca 2565 SvREFCNT_dec_NN(oldsv);
b552b52c
DM
2566 }
2567 if (strEQ(SvPVX_const(cur), max))
2568 sv_setiv(cur, 0); /* terminate next time */
2569 else
2570 sv_inc(cur);
2571 break;
2572 }
a48ce6be 2573
fcef60b4
DM
2574 case CXt_LOOP_LAZYIV: /* integer increment */
2575 {
2576 IV cur = cx->blk_loop.state_u.lazyiv.cur;
5d9574c1 2577 if (UNLIKELY(cur > cx->blk_loop.state_u.lazyiv.end))
89ea2908 2578 RETPUSHNO;
7f61b687 2579
fcef60b4 2580 oldsv = *itersvp;
3db8f154 2581 /* don't risk potential race */
5d9574c1 2582 if (LIKELY(SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv))) {
eaa5c2d6 2583 /* safe to reuse old SV */
fcef60b4 2584 sv_setiv(oldsv, cur);
eaa5c2d6 2585 }
1c846c1f 2586 else
eaa5c2d6
GA
2587 {
2588 /* we need a fresh SV every time so that loop body sees a
2589 * completely new SV for closures/references to work as they
2590 * used to */
fcef60b4 2591 *itersvp = newSViv(cur);
fc2b2dca 2592 SvREFCNT_dec_NN(oldsv);
eaa5c2d6 2593 }
a2309040 2594
5d9574c1 2595 if (UNLIKELY(cur == IV_MAX)) {
cdc1aa42
NC
2596 /* Handle end of range at IV_MAX */
2597 cx->blk_loop.state_u.lazyiv.end = IV_MIN;
2598 } else
2599 ++cx->blk_loop.state_u.lazyiv.cur;
a48ce6be 2600 break;
fcef60b4 2601 }
a48ce6be 2602
b552b52c 2603 case CXt_LOOP_FOR: /* iterate array */
7d6c2cef 2604 {
89ea2908 2605
7d6c2cef
DM
2606 AV *av = cx->blk_loop.state_u.ary.ary;
2607 SV *sv;
2608 bool av_is_stack = FALSE;
a8a20bb6 2609 IV ix;
7d6c2cef 2610
de080daa
DM
2611 if (!av) {
2612 av_is_stack = TRUE;
2613 av = PL_curstack;
2614 }
2615 if (PL_op->op_private & OPpITER_REVERSED) {
a8a20bb6 2616 ix = --cx->blk_loop.state_u.ary.ix;
5d9574c1 2617 if (UNLIKELY(ix <= (av_is_stack ? cx->blk_loop.resetsp : -1)))
de080daa 2618 RETPUSHNO;
de080daa
DM
2619 }
2620 else {
a8a20bb6 2621 ix = ++cx->blk_loop.state_u.ary.ix;
5d9574c1 2622 if (UNLIKELY(ix > (av_is_stack ? cx->blk_oldsp : AvFILL(av))))
de080daa 2623 RETPUSHNO;
a8a20bb6 2624 }
de080daa 2625
5d9574c1 2626 if (UNLIKELY(SvMAGICAL(av) || AvREIFY(av))) {
a8a20bb6
DM
2627 SV * const * const svp = av_fetch(av, ix, FALSE);
2628 sv = svp ? *svp : NULL;
2629 }
2630 else {
2631 sv = AvARRAY(av)[ix];
de080daa 2632 }
ef3e5ea9 2633
d39c26a6
FC
2634 if (UNLIKELY(cx->cx_type & CXp_FOR_LVREF)) {
2635 SvSetMagicSV(*itersvp, sv);
2636 break;
2637 }
2638
5d9574c1
DM
2639 if (LIKELY(sv)) {
2640 if (UNLIKELY(SvIS_FREED(sv))) {
f38aa882
DM
2641 *itersvp = NULL;
2642 Perl_croak(aTHX_ "Use of freed value in iteration");
2643 }
60779a30 2644 if (SvPADTMP(sv)) {
8e079c2a 2645 sv = newSVsv(sv);
60779a30 2646 }
8e079c2a
FC
2647 else {
2648 SvTEMP_off(sv);
2649 SvREFCNT_inc_simple_void_NN(sv);
2650 }
de080daa 2651 }
a600f7e6 2652 else if (!av_is_stack) {
199f858d 2653 sv = newSVavdefelem(av, ix, 0);
de080daa 2654 }
a600f7e6
FC
2655 else
2656 sv = &PL_sv_undef;
a0d0e21e 2657
de080daa
DM
2658 oldsv = *itersvp;
2659 *itersvp = sv;
2660 SvREFCNT_dec(oldsv);
de080daa 2661 break;
7d6c2cef 2662 }
a48ce6be
DM
2663
2664 default:
2665 DIE(aTHX_ "panic: pp_iter, type=%u", CxTYPE(cx));
2666 }
b552b52c 2667 RETPUSHYES;
a0d0e21e
LW
2668}
2669
ef07e810
DM
2670/*
2671A description of how taint works in pattern matching and substitution.
2672
284167a5
SM
2673This is all conditional on NO_TAINT_SUPPORT not being defined. Under
2674NO_TAINT_SUPPORT, taint-related operations should become no-ops.
2675
4e19c54b 2676While the pattern is being assembled/concatenated and then compiled,
284167a5
SM
2677PL_tainted will get set (via TAINT_set) if any component of the pattern
2678is tainted, e.g. /.*$tainted/. At the end of pattern compilation,
2679the RXf_TAINTED flag is set on the pattern if PL_tainted is set (via
1738e041
DM
2680TAINT_get). It will also be set if any component of the pattern matches
2681based on locale-dependent behavior.
ef07e810 2682
0ab462a6
DM
2683When the pattern is copied, e.g. $r = qr/..../, the SV holding the ref to
2684the pattern is marked as tainted. This means that subsequent usage, such
284167a5
SM
2685as /x$r/, will set PL_tainted using TAINT_set, and thus RXf_TAINTED,
2686on the new pattern too.
ef07e810 2687
272d35c9 2688RXf_TAINTED_SEEN is used post-execution by the get magic code
ef07e810
DM
2689of $1 et al to indicate whether the returned value should be tainted.
2690It is the responsibility of the caller of the pattern (i.e. pp_match,
2691pp_subst etc) to set this flag for any other circumstances where $1 needs
2692to be tainted.
2693
2694The taint behaviour of pp_subst (and pp_substcont) is quite complex.
2695
2696There are three possible sources of taint
2697 * the source string
2698 * the pattern (both compile- and run-time, RXf_TAINTED / RXf_TAINTED_SEEN)
2699 * the replacement string (or expression under /e)
2700
2701There are four destinations of taint and they are affected by the sources
2702according to the rules below:
2703
2704 * the return value (not including /r):
2705 tainted by the source string and pattern, but only for the
2706 number-of-iterations case; boolean returns aren't tainted;
2707 * the modified string (or modified copy under /r):
2708 tainted by the source string, pattern, and replacement strings;
2709 * $1 et al:
2710 tainted by the pattern, and under 'use re "taint"', by the source
2711 string too;
2712 * PL_taint - i.e. whether subsequent code (e.g. in a /e block) is tainted:
2713 should always be unset before executing subsequent code.
2714
2715The overall action of pp_subst is:
2716
2717 * at the start, set bits in rxtainted indicating the taint status of
2718 the various sources.
2719
2720 * After each pattern execution, update the SUBST_TAINT_PAT bit in
2721 rxtainted if RXf_TAINTED_SEEN has been set, to indicate that the
2722 pattern has subsequently become tainted via locale ops.
2723
2724 * If control is being passed to pp_substcont to execute a /e block,
2725 save rxtainted in the CXt_SUBST block, for future use by
2726 pp_substcont.
2727
2728 * Whenever control is being returned to perl code (either by falling
2729 off the "end" of pp_subst/pp_substcont, or by entering a /e block),
2730 use the flag bits in rxtainted to make all the appropriate types of
0ab462a6
DM
2731 destination taint visible; e.g. set RXf_TAINTED_SEEN so that $1
2732 et al will appear tainted.
ef07e810
DM
2733
2734pp_match is just a simpler version of the above.
2735
2736*/
2737
a0d0e21e
LW
2738PP(pp_subst)
2739{
20b7effb 2740 dSP; dTARG;
eb578fdb 2741 PMOP *pm = cPMOP;
a0d0e21e 2742 PMOP *rpm = pm;
eb578fdb 2743 char *s;
a0d0e21e 2744 char *strend;
5c144d81 2745 const char *c;
a0d0e21e 2746 STRLEN clen;
3c6ef0a5
FC
2747 SSize_t iters = 0;
2748 SSize_t maxiters;
a0d0e21e 2749 bool once;
ef07e810
DM
2750 U8 rxtainted = 0; /* holds various SUBST_TAINT_* flag bits.
2751 See "how taint works" above */
a0d0e21e 2752 char *orig;
1ed74d04 2753 U8 r_flags;
eb578fdb 2754 REGEXP *rx = PM_GETRE(pm);
a0d0e21e
LW
2755 STRLEN len;
2756 int force_on_match = 0;
0bcc34c2 2757 const I32 oldsave = PL_savestack_ix;
792b2c16 2758 STRLEN slen;
26a74523 2759 bool doutf8 = FALSE; /* whether replacement is in utf8 */
db2c6cb3 2760#ifdef PERL_ANY_COW
ed252734
NC
2761 bool is_cow;
2762#endif
a0714e2c 2763 SV *nsv = NULL;
b770e143 2764 /* known replacement string? */
eb578fdb 2765 SV *dstr = (pm->op_pmflags & PMf_CONST) ? POPs : NULL;
a0d0e21e 2766
f410a211
NC
2767 PERL_ASYNC_CHECK();
2768
533c011a 2769 if (PL_op->op_flags & OPf_STACKED)
a0d0e21e 2770 TARG = POPs;
6ffceeb7 2771 else if (ARGTARG)
59f00321 2772 GETTARGET;
a0d0e21e 2773 else {
54b9620d 2774 TARG = DEFSV;
a0d0e21e 2775 EXTEND(SP,1);
1c846c1f 2776 }
d9f424b2 2777
64534138 2778 SvGETMAGIC(TARG); /* must come before cow check */
db2c6cb3 2779#ifdef PERL_ANY_COW
ed252734
NC
2780 /* Awooga. Awooga. "bool" types that are actually char are dangerous,
2781 because they make integers such as 256 "false". */
2782 is_cow = SvIsCOW(TARG) ? TRUE : FALSE;
2783#else
765f542d
NC
2784 if (SvIsCOW(TARG))
2785 sv_force_normal_flags(TARG,0);
ed252734 2786#endif
8ca8a454 2787 if (!(rpm->op_pmflags & PMf_NONDESTRUCT)
8ca8a454
NC
2788 && (SvREADONLY(TARG)
2789 || ( ((SvTYPE(TARG) == SVt_PVGV && isGV_with_GP(TARG))
2790 || SvTYPE(TARG) > SVt_PVLV)
2791 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG)))))
cb077ed2 2792 Perl_croak_no_modify();
8ec5e241
NIS
2793 PUTBACK;
2794
6ac6605d
DM
2795 orig = SvPV_nomg(TARG, len);
2796 /* note we don't (yet) force the var into being a string; if we fail
2797 * to match, we leave as-is; on successful match howeverm, we *will*
2798 * coerce into a string, then repeat the match */
4499db73 2799 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV || SvVOK(TARG))
a0d0e21e 2800 force_on_match = 1;
20be6587
DM
2801
2802 /* only replace once? */
2803 once = !(rpm->op_pmflags & PMf_GLOBAL);
2804
ef07e810 2805 /* See "how taint works" above */
284167a5 2806 if (TAINTING_get) {
20be6587
DM
2807 rxtainted = (
2808 (SvTAINTED(TARG) ? SUBST_TAINT_STR : 0)
284167a5 2809 | (RX_ISTAINTED(rx) ? SUBST_TAINT_PAT : 0)
20be6587
DM
2810 | ((pm->op_pmflags & PMf_RETAINT) ? SUBST_TAINT_RETAINT : 0)
2811 | ((once && !(rpm->op_pmflags & PMf_NONDESTRUCT))
2812 ? SUBST_TAINT_BOOLRET : 0));
2813 TAINT_NOT;
2814 }
a12c0f56 2815
a0d0e21e 2816 force_it:
6ac6605d
DM
2817 if (!pm || !orig)
2818 DIE(aTHX_ "panic: pp_subst, pm=%p, orig=%p", pm, orig);
a0d0e21e 2819
6ac6605d
DM
2820 strend = orig + len;
2821 slen = DO_UTF8(TARG) ? utf8_length((U8*)orig, (U8*)strend) : len;
792b2c16
JH
2822 maxiters = 2 * slen + 10; /* We can match twice at each
2823 position, once with zero-length,
2824 second time with non-zero. */
a0d0e21e 2825
6a97c51d 2826 if (!RX_PRELEN(rx) && PL_curpm
8d919b0a 2827 && !ReANY(rx)->mother_re) {
3280af22 2828 pm = PL_curpm;
aaa362c4 2829 rx = PM_GETRE(pm);
a0d0e21e 2830 }
6502e081 2831
6e240d0b 2832#ifdef PERL_SAWAMPERSAND
6502e081
DM
2833 r_flags = ( RX_NPARENS(rx)
2834 || PL_sawampersand
6502e081 2835 || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY))
5b0e71e9 2836 || (rpm->op_pmflags & PMf_KEEPCOPY)
6502e081
DM
2837 )
2838 ? REXEC_COPY_STR
2839 : 0;
6e240d0b
FC
2840#else
2841 r_flags = REXEC_COPY_STR;
2842#endif
7fba1cd6 2843
0395280b 2844 if (!CALLREGEXEC(rx, orig, strend, orig, 0, TARG, NULL, r_flags))
8b64c330 2845 {
5e79dfb9
DM
2846 SPAGAIN;
2847 PUSHs(rpm->op_pmflags & PMf_NONDESTRUCT ? TARG : &PL_sv_no);
2848 LEAVE_SCOPE(oldsave);
2849 RETURN;
2850 }
1754320d
FC
2851 PL_curpm = pm;
2852
71be2cbc 2853 /* known replacement string? */
f272994b 2854 if (dstr) {
8514a05a
JH
2855 /* replacement needing upgrading? */
2856 if (DO_UTF8(TARG) && !doutf8) {
db79b45b 2857 nsv = sv_newmortal();
4a176938 2858 SvSetSV(nsv, dstr);
47e13f24 2859 if (IN_ENCODING)
ad2de1b2 2860 sv_recode_to_utf8(nsv, _get_encoding());
8514a05a
JH
2861 else
2862 sv_utf8_upgrade(nsv);
5c144d81 2863 c = SvPV_const(nsv, clen);
4a176938
JH
2864 doutf8 = TRUE;
2865 }
2866 else {
5c144d81 2867 c = SvPV_const(dstr, clen);
4a176938 2868 doutf8 = DO_UTF8(dstr);
8514a05a 2869 }
bb933b9b
FC
2870
2871 if (SvTAINTED(dstr))
2872 rxtainted |= SUBST_TAINT_REPL;
f272994b
A
2873 }
2874 else {
6136c704 2875 c = NULL;
f272994b
A
2876 doutf8 = FALSE;
2877 }
2878
71be2cbc 2879 /* can do inplace substitution? */
ed252734 2880 if (c
db2c6cb3 2881#ifdef PERL_ANY_COW
ed252734
NC
2882 && !is_cow
2883#endif
fbfb1899 2884 && (I32)clen <= RX_MINLENRET(rx)
9cefd268
FC
2885 && ( once
2886 || !(r_flags & REXEC_COPY_STR)
2887 || (!SvGMAGICAL(dstr) && !(RX_EXTFLAGS(rx) & RXf_EVAL_SEEN))
2888 )
dbc200c5 2889 && !(RX_EXTFLAGS(rx) & RXf_NO_INPLACE_SUBST)
8ca8a454
NC
2890 && (!doutf8 || SvUTF8(TARG))
2891 && !(rpm->op_pmflags & PMf_NONDESTRUCT))
8b030b38 2892 {
ec911639 2893
db2c6cb3 2894#ifdef PERL_ANY_COW
ed252734 2895 if (SvIsCOW(TARG)) {
f7a8268c 2896 if (!force_on_match)
ed252734 2897 goto have_a_cow;
f7a8268c 2898 assert(SvVOK(TARG));
ed252734
NC
2899 }
2900#endif
71be2cbc 2901 if (force_on_match) {
6ac6605d
DM
2902 /* redo the first match, this time with the orig var
2903 * forced into being a string */
71be2cbc 2904 force_on_match = 0;
6ac6605d 2905 orig = SvPV_force_nomg(TARG, len);
71be2cbc
PP
2906 goto force_it;
2907 }
39b40493 2908
71be2cbc 2909 if (once) {
c67ab8f2 2910 char *d, *m;
20be6587
DM
2911 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2912 rxtainted |= SUBST_TAINT_PAT;
07bc277f
NC
2913 m = orig + RX_OFFS(rx)[0].start;
2914 d = orig + RX_OFFS(rx)[0].end;
71be2cbc
PP
2915 s = orig;
2916 if (m - s > strend - d) { /* faster to shorten from end */
2ec7214c 2917 I32 i;
71be2cbc
PP
2918 if (clen) {
2919 Copy(c, m, clen, char);
2920 m += clen;
a0d0e21e 2921 }
71be2cbc
PP
2922 i = strend - d;
2923 if (i > 0) {
2924 Move(d, m, i, char);
2925 m += i;
a0d0e21e 2926 }
71be2cbc
PP
2927 *m = '\0';
2928 SvCUR_set(TARG, m - s);
2929 }
2ec7214c
DM
2930 else { /* faster from front */
2931 I32 i = m - s;
71be2cbc 2932 d -= clen;
2ec7214c
DM
2933 if (i > 0)
2934 Move(s, d - i, i, char);
71be2cbc 2935 sv_chop(TARG, d-i);
71be2cbc 2936 if (clen)
c947cd8d 2937 Copy(c, d, clen, char);
71be2cbc 2938 }
8ec5e241 2939 SPAGAIN;
8ca8a454 2940 PUSHs(&PL_sv_yes);
71be2cbc
PP
2941 }
2942 else {
c67ab8f2 2943 char *d, *m;
0395280b 2944 d = s = RX_OFFS(rx)[0].start + orig;
71be2cbc 2945 do {
2b25edcf 2946 I32 i;
5d9574c1 2947 if (UNLIKELY(iters++ > maxiters))
cea2e8a9 2948 DIE(aTHX_ "Substitution loop");
5d9574c1 2949 if (UNLIKELY(RX_MATCH_TAINTED(rx))) /* run time pattern taint, eg locale */
20be6587 2950 rxtainted |= SUBST_TAINT_PAT;
07bc277f 2951 m = RX_OFFS(rx)[0].start + orig;
155aba94 2952 if ((i = m - s)) {
71be2cbc
PP
2953 if (s != d)
2954 Move(s, d, i, char);
2955 d += i;
a0d0e21e 2956 }
71be2cbc
PP
2957 if (clen) {
2958 Copy(c, d, clen, char);
2959 d += clen;
2960 }
07bc277f 2961 s = RX_OFFS(rx)[0].end + orig;
7ce41e5c
FC
2962 } while (CALLREGEXEC(rx, s, strend, orig,
2963 s == m, /* don't match same null twice */
f722798b 2964 TARG, NULL,
d5e7783a 2965 REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW));
71be2cbc 2966 if (s != d) {
2b25edcf 2967 I32 i = strend - s;
aa07b2f6 2968 SvCUR_set(TARG, d - SvPVX_const(TARG) + i);
71be2cbc 2969 Move(s, d, i+1, char); /* include the NUL */
a0d0e21e 2970 }
8ec5e241 2971 SPAGAIN;
3c6ef0a5 2972 mPUSHi(iters);
a0d0e21e
LW
2973 }
2974 }
ff6e92e8 2975 else {
1754320d 2976 bool first;
c67ab8f2 2977 char *m;
1754320d 2978 SV *repl;
a0d0e21e 2979 if (force_on_match) {
6ac6605d
DM
2980 /* redo the first match, this time with the orig var
2981 * forced into being a string */
a0d0e21e 2982 force_on_match = 0;
0c1438a1
NC
2983 if (rpm->op_pmflags & PMf_NONDESTRUCT) {
2984 /* I feel that it should be possible to avoid this mortal copy
2985 given that the code below copies into a new destination.
2986 However, I suspect it isn't worth the complexity of
2987 unravelling the C<goto force_it> for the small number of
2988 cases where it would be viable to drop into the copy code. */
2989 TARG = sv_2mortal(newSVsv(TARG));
2990 }
6ac6605d 2991 orig = SvPV_force_nomg(TARG, len);
a0d0e21e
LW
2992 goto force_it;
2993 }
db2c6cb3 2994#ifdef PERL_ANY_COW
ed252734
NC
2995 have_a_cow:
2996#endif
20be6587
DM
2997 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2998 rxtainted |= SUBST_TAINT_PAT;
1754320d 2999 repl = dstr;
0395280b
DM
3000 s = RX_OFFS(rx)[0].start + orig;
3001 dstr = newSVpvn_flags(orig, s-orig,
3002 SVs_TEMP | (DO_UTF8(TARG) ? SVf_UTF8 : 0));
a0d0e21e 3003 if (!c) {
eb578fdb 3004 PERL_CONTEXT *cx;
8ec5e241 3005 SPAGAIN;
0395280b 3006 m = orig;
20be6587
DM
3007 /* note that a whole bunch of local vars are saved here for
3008 * use by pp_substcont: here's a list of them in case you're
3009 * searching for places in this sub that uses a particular var:
3010 * iters maxiters r_flags oldsave rxtainted orig dstr targ
3011 * s m strend rx once */
a0d0e21e 3012 PUSHSUBST(cx);
20e98b0f 3013 RETURNOP(cPMOP->op_pmreplrootu.op_pmreplroot);
a0d0e21e 3014 }
1754320d 3015 first = TRUE;
a0d0e21e 3016 do {
5d9574c1 3017 if (UNLIKELY(iters++ > maxiters))
cea2e8a9 3018 DIE(aTHX_ "Substitution loop");
5d9574c1 3019 if (UNLIKELY(RX_MATCH_TAINTED(rx)))
20be6587 3020 rxtainted |= SUBST_TAINT_PAT;
07bc277f 3021 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
c67ab8f2
DM
3022 char *old_s = s;
3023 char *old_orig = orig;
6502e081 3024 assert(RX_SUBOFFSET(rx) == 0);
c67ab8f2 3025
07bc277f 3026 orig = RX_SUBBEG(rx);
c67ab8f2
DM
3027 s = orig + (old_s - old_orig);
3028 strend = s + (strend - old_s);
a0d0e21e 3029 }
07bc277f 3030 m = RX_OFFS(rx)[0].start + orig;
64534138 3031 sv_catpvn_nomg_maybeutf8(dstr, s, m - s, DO_UTF8(TARG));
07bc277f 3032 s = RX_OFFS(rx)[0].end + orig;
1754320d
FC
3033 if (first) {
3034 /* replacement already stringified */
3035 if (clen)
64534138 3036 sv_catpvn_nomg_maybeutf8(dstr, c, clen, doutf8);
1754320d
FC
3037 first = FALSE;
3038 }
3039 else {
47e13f24 3040 if (IN_ENCODING) {
1754320d
FC
3041 if (!nsv) nsv = sv_newmortal();
3042 sv_copypv(nsv, repl);
ad2de1b2 3043 if (!DO_UTF8(nsv)) sv_recode_to_utf8(nsv, _get_encoding());
1754320d
FC
3044 sv_catsv(dstr, nsv);
3045 }
3046 else sv_catsv(dstr, repl);
5d9574c1 3047 if (UNLIKELY(SvTAINTED(repl)))
bb933b9b 3048 rxtainted |= SUBST_TAINT_REPL;
1754320d 3049 }
a0d0e21e
LW
3050 if (once)
3051 break;
f9f4320a 3052 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
d5e7783a
DM
3053 TARG, NULL,
3054 REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW));
64534138 3055 sv_catpvn_nomg_maybeutf8(dstr, s, strend - s, DO_UTF8(TARG));
748a9306 3056
8ca8a454
NC
3057 if (rpm->op_pmflags & PMf_NONDESTRUCT) {
3058 /* From here on down we're using the copy, and leaving the original
3059 untouched. */
3060 TARG = dstr;
3061 SPAGAIN;
3062 PUSHs(dstr);
3063 } else {
db2c6cb3 3064#ifdef PERL_ANY_COW
8ca8a454
NC
3065 /* The match may make the string COW. If so, brilliant, because
3066 that's just saved us one malloc, copy and free - the regexp has
3067 donated the old buffer, and we malloc an entirely new one, rather
3068 than the regexp malloc()ing a buffer and copying our original,
3069 only for us to throw it away here during the substitution. */
3070 if (SvIsCOW(TARG)) {
3071 sv_force_normal_flags(TARG, SV_COW_DROP_PV);
3072 } else
ed252734 3073#endif
8ca8a454
NC
3074 {
3075 SvPV_free(TARG);
3076 }
3077 SvPV_set(TARG, SvPVX(dstr));
3078 SvCUR_set(TARG, SvCUR(dstr));
3079 SvLEN_set(TARG, SvLEN(dstr));
64534138 3080 SvFLAGS(TARG) |= SvUTF8(dstr);
8ca8a454 3081 SvPV_set(dstr, NULL);
748a9306 3082
8ca8a454 3083 SPAGAIN;
3c6ef0a5 3084 mPUSHi(iters);
8ca8a454
NC
3085 }
3086 }
3087
3088 if (!(rpm->op_pmflags & PMf_NONDESTRUCT)) {
3089 (void)SvPOK_only_UTF8(TARG);
a0d0e21e 3090 }
20be6587 3091
ef07e810 3092 /* See "how taint works" above */
284167a5 3093 if (TAINTING_get) {
20be6587
DM
3094 if ((rxtainted & SUBST_TAINT_PAT) ||
3095 ((rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT)) ==
3096 (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
3097 )
3098 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
3099
3100 if (!(rxtainted & SUBST_TAINT_BOOLRET)
3101 && (rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT))
3102 )
3103 SvTAINTED_on(TOPs); /* taint return value */
3104 else
3105 SvTAINTED_off(TOPs); /* may have got tainted earlier */
3106
3107 /* needed for mg_set below */
284167a5
SM
3108 TAINT_set(
3109 cBOOL(rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL))
3110 );
20be6587
DM
3111 SvTAINT(TARG);
3112 }
3113 SvSETMAGIC(TARG); /* PL_tainted must be correctly set for this mg_set */
3114 TAINT_NOT;
f1a76097
DM
3115 LEAVE_SCOPE(oldsave);
3116 RETURN;
a0d0e21e
LW
3117}
3118
3119PP(pp_grepwhile)
3120{
20b7effb 3121 dSP;
a0d0e21e
LW
3122
3123 if (SvTRUEx(POPs))
3280af22
NIS
3124 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
3125 ++*PL_markstack_ptr;
b2a2a901 3126 FREETMPS;
d343c3ef 3127 LEAVE_with_name("grep_item"); /* exit inner scope */
a0d0e21e
LW
3128
3129 /* All done yet? */
5d9574c1 3130 if (UNLIKELY(PL_stack_base + *PL_markstack_ptr > SP)) {
a0d0e21e 3131 I32 items;
c4420975 3132 const I32 gimme = GIMME_V;
a0d0e21e 3133
d343c3ef 3134 LEAVE_with_name("grep"); /* exit outer scope */
a0d0e21e 3135 (void)POPMARK; /* pop src */
3280af22 3136 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
a0d0e21e 3137 (void)POPMARK; /* pop dst */
3280af22 3138 SP = PL_stack_base + POPMARK; /* pop original mark */
54310121 3139 if (gimme == G_SCALAR) {
7cc47870 3140 if (PL_op->op_private & OPpGREP_LEX) {
c4420975 3141 SV* const sv = sv_newmortal();
7cc47870
RGS
3142 sv_setiv(sv, items);
3143 PUSHs(sv);
3144 }
3145 else {
3146 dTARGET;
3147 XPUSHi(items);
3148 }
a0d0e21e 3149 }
54310121
PP
3150 else if (gimme == G_ARRAY)
3151 SP += items;
a0d0e21e
LW
3152 RETURN;
3153 }
3154 else {
3155 SV *src;
3156
d343c3ef 3157 ENTER_with_name("grep_item"); /* enter inner scope */
1d7c1841 3158 SAVEVPTR(PL_curpm);
a0d0e21e 3159
3280af22 3160 src = PL_stack_base[*PL_markstack_ptr];
60779a30 3161 if (SvPADTMP(src)) {
a0ed822e
FC
3162 src = PL_stack_base[*PL_markstack_ptr] = sv_mortalcopy(src);
3163 PL_tmps_floor++;
3164 }
a0d0e21e 3165 SvTEMP_off(src);
59f00321
RGS
3166 if (PL_op->op_private & OPpGREP_LEX)
3167 PAD_SVl(PL_op->op_targ) = src;
3168 else
414bf5ae 3169 DEFSV_set(src);
a0d0e21e
LW
3170
3171 RETURNOP(cLOGOP->op_other);
3172 }
3173}
3174
3175PP(pp_leavesub)
3176{
20b7effb 3177 dSP;
a0d0e21e
LW
3178 SV **mark;
3179 SV **newsp;
3180 PMOP *newpm;
3181 I32 gimme;
eb578fdb 3182 PERL_CONTEXT *cx;
b0d9ce38 3183 SV *sv;
a0d0e21e 3184
1f0ba93b
DM
3185 if (CxMULTICALL(&cxstack[cxstack_ix])) {
3186 /* entry zero of a stack is always PL_sv_undef, which
3187 * simplifies converting a '()' return into undef in scalar context */
3188 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef);
9850bf21 3189 return 0;
1f0ba93b 3190 }
9850bf21 3191
a0d0e21e 3192 POPBLOCK(cx,newpm);
5dd42e15 3193 cxstack_ix++; /* temporarily protect top context */
1c846c1f 3194
a1f49e72 3195 TAINT_NOT;
a0d0e21e
LW
3196 if (gimme == G_SCALAR) {
3197 MARK = newsp + 1;
5d9574c1 3198 if (LIKELY(MARK <= SP)) {
a8bba7fa 3199 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
6f48390a
FC
3200 if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
3201 && !SvMAGICAL(TOPs)) {
a29cdaf0
IZ
3202 *MARK = SvREFCNT_inc(TOPs);
3203 FREETMPS;
3204 sv_2mortal(*MARK);
cd06dffe
GS
3205 }
3206 else {
959e3673 3207 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
a29cdaf0 3208 FREETMPS;
959e3673 3209 *MARK = sv_mortalcopy(sv);
fc2b2dca 3210 SvREFCNT_dec_NN(sv);
a29cdaf0 3211 }
cd06dffe 3212 }
6f48390a
FC
3213 else if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
3214 && !SvMAGICAL(TOPs)) {
767eda44 3215 *MARK = TOPs;
767eda44 3216 }
cd06dffe 3217 else
767eda44 3218 *MARK = sv_mortalcopy(TOPs);
cd06dffe
GS
3219 }
3220 else {
f86702cc 3221 MEXTEND(MARK, 0);
3280af22 3222 *MARK = &PL_sv_undef;
a0d0e21e
LW
3223 }
3224 SP = MARK;
3225 }
54310121 3226 else if (gimme == G_ARRAY) {
f86702cc 3227 for (MARK = newsp + 1; MARK <= SP; MARK++) {
6f48390a
FC
3228 if (!SvTEMP(*MARK) || SvREFCNT(*MARK) != 1
3229 || SvMAGICAL(*MARK)) {
f86702cc 3230 *MARK = sv_mortalcopy(*MARK);
a1f49e72
CS
3231 TAINT_NOT; /* Each item is independent */
3232 }
f86702cc 3233 }
a0d0e21e 3234 }
f86702cc 3235 PUTBACK;
1c846c1f 3236
a57c6685 3237 LEAVE;
b0d9ce38 3238 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
25375124 3239 cxstack_ix--;
3280af22 3240 PL_curpm = newpm; /* ... and pop $1 et al */
a0d0e21e 3241
b0d9ce38 3242 LEAVESUB(sv);
f39bc417 3243 return cx->blk_sub.retop;
a0d0e21e
LW
3244}
3245
3246PP(pp_entersub)
3247{
20b7effb 3248 dSP; dPOPss;
a0d0e21e 3249 GV *gv;
eb578fdb
KW
3250 CV *cv;
3251 PERL_CONTEXT *cx;
5d94fbed 3252 I32 gimme;
a9c4fd4e 3253 const bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
a0d0e21e 3254
f5719c02 3255 if (UNLIKELY(!sv))
cea2e8a9 3256 DIE(aTHX_ "Not a CODE reference");
f5719c02
DM
3257 /* This is overwhelmingly the most common case: */
3258 if (!LIKELY(SvTYPE(sv) == SVt_PVGV && (cv = GvCVu((const GV *)sv)))) {
313107ce
DM
3259 switch (SvTYPE(sv)) {
3260 case SVt_PVGV:
3261 we_have_a_glob:
3262 if (!(cv = GvCVu((const GV *)sv))) {
3263 HV *stash;
3264 cv = sv_2cv(sv, &stash, &gv, 0);
3265 }
3266 if (!cv) {
3267 ENTER;
3268 SAVETMPS;
3269 goto try_autoload;
3270 }
3271 break;
3272 case SVt_PVLV:
3273 if(isGV_with_GP(sv)) goto we_have_a_glob;
924ba076 3274 /* FALLTHROUGH */
313107ce
DM
3275 default:
3276 if (sv == &PL_sv_yes) { /* unfound import, ignore */
3277 if (hasargs)
3278 SP = PL_stack_base + POPMARK;
3279 else
3280 (void)POPMARK;
3281 RETURN;
3282 }
3283 SvGETMAGIC(sv);
3284 if (SvROK(sv)) {
3285 if (SvAMAGIC(sv)) {
3286 sv = amagic_deref_call(sv, to_cv_amg);
3287 /* Don't SPAGAIN here. */
3288 }
3289 }
3290 else {
3291 const char *sym;
3292 STRLEN len;
3293 if (!SvOK(sv))
3294 DIE(aTHX_ PL_no_usym, "a subroutine");
3295 sym = SvPV_nomg_const(sv, len);
3296 if (PL_op->op_private & HINT_STRICT_REFS)
3297 DIE(aTHX_ "Can't use string (\"%" SVf32 "\"%s) as a subroutine ref while \"strict refs\" in use", sv, len>32 ? "..." : "");
3298 cv = get_cvn_flags(sym, len, GV_ADD|SvUTF8(sv));
3299 break;
3300 }
3301 cv = MUTABLE_CV(SvRV(sv));
3302 if (SvTYPE(cv) == SVt_PVCV)
3303 break;
924ba076 3304 /* FALLTHROUGH */
313107ce
DM
3305 case SVt_PVHV:
3306 case SVt_PVAV:
3307 DIE(aTHX_ "Not a CODE reference");
3308 /* This is the second most common case: */
3309 case SVt_PVCV:
3310 cv = MUTABLE_CV(sv);
3311 break;
3312 }
f5719c02 3313 }
a0d0e21e 3314
a57c6685 3315 ENTER;
a0d0e21e
LW
3316
3317 retry:
f5719c02 3318 if (UNLIKELY(CvCLONE(cv) && ! CvCLONED(cv)))
541ed3a9 3319 DIE(aTHX_ "Closure prototype called");
f5719c02 3320 if (UNLIKELY(!CvROOT(cv) && !CvXSUB(cv))) {
2f349aa0
NC
3321 GV* autogv;
3322 SV* sub_name;
3323
3324 /* anonymous or undef'd function leaves us no recourse */
ae77754a
FC
3325 if (CvLEXICAL(cv) && CvHASGV(cv))
3326 DIE(aTHX_ "Undefined subroutine &%"SVf" called",
ecf05a58 3327 SVfARG(cv_name(cv, NULL, 0)));
ae77754a 3328 if (CvANON(cv) || !CvHASGV(cv)) {
2f349aa0 3329 DIE(aTHX_ "Undefined subroutine called");
7d2057d8 3330 }
2f349aa0
NC
3331
3332 /* autoloaded stub? */
ae77754a 3333 if (cv != GvCV(gv = CvGV(cv))) {
2f349aa0
NC
3334 cv = GvCV(gv);
3335 }
3336 /* should call AUTOLOAD now? */
3337 else {
7b52d656 3338 try_autoload:
d1089224
BF
3339 if ((autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
3340 GvNAMEUTF8(gv) ? SVf_UTF8 : 0)))
2f349aa0
NC
3341 {
3342 cv = GvCV(autogv);
3343 }
2f349aa0 3344 else {
c220e1a1 3345 sorry:
2f349aa0 3346 sub_name = sv_newmortal();
6136c704 3347 gv_efullname3(sub_name, gv, NULL);
be2597df 3348 DIE(aTHX_ "Undefined subroutine &%"SVf" called", SVfARG(sub_name));
2f349aa0
NC
3349 }
3350 }
3351 if (!cv)
c220e1a1 3352 goto sorry;
2f349aa0 3353 goto retry;
a0d0e21e
LW
3354 }
3355
f5719c02
DM
3356 if (UNLIKELY((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub)
3357 && !CvNODEBUG(cv)))
3358 {
005a8a35 3359 Perl_get_db_sub(aTHX_ &sv, cv);
a9ef256d
NC
3360 if (CvISXSUB(cv))
3361 PL_curcopdb = PL_curcop;
1ad62f64 3362 if (CvLVALUE(cv)) {
3363 /* check for lsub that handles lvalue subroutines */
07b605e5 3364 cv = GvCV(gv_fetchpvs("DB::lsub", GV_ADDMULTI, SVt_PVCV));
1ad62f64 3365 /* if lsub not found then fall back to DB::sub */
3366 if (!cv) cv = GvCV(PL_DBsub);
3367 } else {
3368 cv = GvCV(PL_DBsub);
3369 }
a9ef256d 3370
ccafdc96
RGS
3371 if (!cv || (!CvXSUB(cv) && !CvSTART(cv)))
3372 DIE(aTHX_ "No DB::sub routine defined");
67caa1fe 3373 }
a0d0e21e 3374
f5719c02
DM
3375 gimme = GIMME_V;
3376
aed2304a 3377 if (!(CvISXSUB(cv))) {
f1025168 3378 /* This path taken at least 75% of the time */
a0d0e21e 3379 dMARK;
b70d5558 3380 PADLIST * const padlist = CvPADLIST(cv);
3689ad62 3381 I32 depth;
f5719c02 3382
a0d0e21e
LW
3383 PUSHBLOCK(cx, CXt_SUB, MARK);
3384 PUSHSUB(cx);
f39bc417 3385 cx->blk_sub.retop = PL_op->op_next;
3689ad62 3386 if (UNLIKELY((depth = ++CvDEPTH(cv)) >= 2)) {
3a76ca88 3387 PERL_STACK_OVERFLOW_CHECK();
3689ad62 3388 pad_push(padlist, depth);
a0d0e21e 3389 }
3a76ca88 3390 SAVECOMPPAD();
3689ad62 3391 PAD_SET_CUR_NOSAVE(padlist, depth);
f5719c02 3392 if (LIKELY(hasargs)) {
10533ace 3393 AV *const av = MUTABLE_AV(PAD_SVl(0));
bdf02c57
DM
3394 SSize_t items;
3395 AV **defavp;
3396
f5719c02 3397 if (UNLIKELY(AvREAL(av))) {
221373f0
GS
3398 /* @_ is normally not REAL--this should only ever
3399 * happen when DB::sub() calls things that modify @_ */
3400 av_clear(av);
3401 AvREAL_off(av);
3402 AvREIFY_on(av);
3403 }
bdf02c57
DM
3404 defavp = &GvAV(PL_defgv);
3405 cx->blk_sub.savearray = *defavp;
3406 *defavp = MUTABLE_AV(SvREFCNT_inc_simple_NN(av));
dd2155a4 3407 CX_CURPAD_SAVE(cx->blk_sub);
6d4ff0d2 3408 cx->blk_sub.argarray = av;
bdf02c57 3409 items = SP - MARK;
a0d0e21e 3410
f5719c02 3411 if (UNLIKELY(items - 1 > AvMAX(av))) {
77d27ef6
SF
3412 SV **ary = AvALLOC(av);
3413 AvMAX(av) = items - 1;
3414 Renew(ary, items, SV*);
3415 AvALLOC(av) = ary;
3416 AvARRAY(av) = ary;
3417 }
3418
bdf02c57 3419 Copy(MARK+1,AvARRAY(av),items,SV*);
93965878 3420 AvFILLp(av) = items - 1;
1c846c1f 3421
b479c9f2 3422 MARK = AvARRAY(av);
a0d0e21e
LW
3423 while (items--) {
3424 if (*MARK)
b479c9f2 3425 {
60779a30 3426 if (SvPADTMP(*MARK)) {
b479c9f2 3427 *MARK = sv_mortalcopy(*MARK);
60779a30 3428 }
a0d0e21e 3429 SvTEMP_off(*MARK);
b479c9f2 3430 }
a0d0e21e
LW
3431 MARK++;
3432 }
3433 }
b479c9f2 3434 SAVETMPS;
f5719c02
DM
3435 if (UNLIKELY((cx->blk_u16 & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO &&
3436 !CvLVALUE(cv)))
da1dff94 3437 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
4a925ff6
GS
3438 /* warning must come *after* we fully set up the context
3439 * stuff so that __WARN__ handlers can safely dounwind()
3440 * if they want to
3441 */
3689ad62 3442 if (UNLIKELY(depth == PERL_SUB_DEPTH_WARN
f5719c02
DM
3443 && ckWARN(WARN_RECURSION)
3444 && !(PERLDB_SUB && cv == GvCV(PL_DBsub))))
4a925ff6 3445 sub_crush_depth(cv);
a0d0e21e
LW
3446 RETURNOP(CvSTART(cv));
3447 }
f1025168 3448 else {
de935cc9 3449 SSize_t markix = TOPMARK;
f1025168 3450
b479c9f2 3451 SAVETMPS;
3a76ca88 3452 PUTBACK;
f1025168 3453
f5719c02 3454 if (UNLIKELY(((PL_op->op_private
4587c532
FC
3455 & PUSHSUB_GET_LVALUE_MASK(Perl_is_lvalue_sub)
3456 ) & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO &&
f5719c02 3457 !CvLVALUE(cv)))
4587c532
FC
3458 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
3459
f5719c02 3460 if (UNLIKELY(!hasargs && GvAV(PL_defgv))) {
3a76ca88
RGS
3461 /* Need to copy @_ to stack. Alternative may be to
3462 * switch stack to @_, and copy return values
3463 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
3464 AV * const av = GvAV(PL_defgv);
ad39f3a2 3465 const SSize_t items = AvFILL(av) + 1;
3a76ca88
RGS
3466
3467 if (items) {
dd2a7f90 3468 SSize_t i = 0;
ad39f3a2 3469 const bool m = cBOOL(SvRMAGICAL(av));
3a76ca88
RGS
3470 /* Mark is at the end of the stack. */
3471 EXTEND(SP, items);
dd2a7f90 3472 for (; i < items; ++i)
ad39f3a2
FC
3473 {
3474 SV *sv;
3475 if (m) {
3476 SV ** const svp = av_fetch(av, i, 0);
3477 sv = svp ? *svp : NULL;
3478 }
3479 else sv = AvARRAY(av)[i];
3480 if (sv) SP[i+1] = sv;
dd2a7f90 3481 else {
199f858d 3482 SP[i+1] = newSVavdefelem(av, i, 1);
dd2a7f90 3483 }
ad39f3a2 3484 }
3a76ca88
RGS
3485 SP += items;
3486 PUTBACK ;
3487 }
3488 }
3455055f
FC
3489 else {
3490 SV **mark = PL_stack_base + markix;
de935cc9 3491 SSize_t items = SP - mark;
3455055f
FC
3492 while (items--) {
3493 mark++;
60779a30 3494 if (*mark && SvPADTMP(*mark)) {
3455055f 3495 *mark = sv_mortalcopy(*mark);
60779a30 3496 }
3455055f
FC
3497 }
3498 }
3a76ca88 3499 /* We assume first XSUB in &DB::sub is the called one. */
f5719c02 3500 if (UNLIKELY(PL_curcopdb)) {
3a76ca88
RGS
3501 SAVEVPTR(PL_curcop);
3502 PL_curcop = PL_curcopdb;
3503 PL_curcopdb = NULL;
3504 }
3505 /* Do we need to open block here? XXXX */
72df79cf 3506
3507 /* CvXSUB(cv) must not be NULL because newXS() refuses NULL xsub address */
3508 assert(CvXSUB(cv));
16c91539 3509 CvXSUB(cv)(aTHX_ cv);
3a76ca88
RGS
3510
3511 /* Enforce some sanity in scalar context. */
89a18b40
DM
3512 if (gimme == G_SCALAR) {
3513 SV **svp = PL_stack_base + markix + 1;
3514 if (svp != PL_stack_sp) {
3515 *svp = svp > PL_stack_sp ? &PL_sv_undef : *PL_stack_sp;
3516 PL_stack_sp = svp;
3517 }
3a76ca88 3518 }
a57c6685 3519 LEAVE;
f1025168
NC
3520 return NORMAL;
3521 }
a0d0e21e
LW
3522}
3523
44a8e56a 3524void
864dbfa3 3525Perl_sub_crush_depth(pTHX_ CV *cv)
44a8e56a 3526{
7918f24d
NC
3527 PERL_ARGS_ASSERT_SUB_CRUSH_DEPTH;
3528