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