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