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