This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
[perl #117265] move the "glob failed" warning to the point of failure
[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 1571 if ((!io || !(IoFLAGS(io) & IOf_START))
de7dabb6
TC
1572 && ckWARN(WARN_CLOSED)
1573 && type != OP_GLOB)
041457d9 1574 {
de7dabb6 1575 report_evil_fh(PL_last_in_gv);
3f4520fe 1576 }
54310121 1577 if (gimme == G_SCALAR) {
79628082 1578 /* undef TARG, and push that undefined value */
ba92458f
AE
1579 if (type != OP_RCATLINE) {
1580 SV_CHECK_THINKFIRST_COW_DROP(TARG);
0c34ef67 1581 SvOK_off(TARG);
ba92458f 1582 }
a0d0e21e
LW
1583 PUSHTARG;
1584 }
1585 RETURN;
1586 }
a2008d6d 1587 have_fp:
54310121 1588 if (gimme == G_SCALAR) {
a0d0e21e 1589 sv = TARG;
0f722b55
RGS
1590 if (type == OP_RCATLINE && SvGMAGICAL(sv))
1591 mg_get(sv);
48de12d9
RGS
1592 if (SvROK(sv)) {
1593 if (type == OP_RCATLINE)
5668452f 1594 SvPV_force_nomg_nolen(sv);
48de12d9
RGS
1595 else
1596 sv_unref(sv);
1597 }
f7877b28 1598 else if (isGV_with_GP(sv)) {
5668452f 1599 SvPV_force_nomg_nolen(sv);
f7877b28 1600 }
862a34c6 1601 SvUPGRADE(sv, SVt_PV);
a0d0e21e 1602 tmplen = SvLEN(sv); /* remember if already alloced */
e3918bb7 1603 if (!tmplen && !SvREADONLY(sv) && !SvIsCOW(sv)) {
f72e8700
JJ
1604 /* try short-buffering it. Please update t/op/readline.t
1605 * if you change the growth length.
1606 */
1607 Sv_Grow(sv, 80);
1608 }
2b5e58c4
AMS
1609 offset = 0;
1610 if (type == OP_RCATLINE && SvOK(sv)) {
1611 if (!SvPOK(sv)) {
5668452f 1612 SvPV_force_nomg_nolen(sv);
2b5e58c4 1613 }
a0d0e21e 1614 offset = SvCUR(sv);
2b5e58c4 1615 }
a0d0e21e 1616 }
54310121 1617 else {
561b68a9 1618 sv = sv_2mortal(newSV(80));
54310121
PP
1619 offset = 0;
1620 }
fbad3eb5 1621
3887d568
AP
1622 /* This should not be marked tainted if the fp is marked clean */
1623#define MAYBE_TAINT_LINE(io, sv) \
1624 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1625 TAINT; \
1626 SvTAINTED_on(sv); \
1627 }
1628
684bef36 1629/* delay EOF state for a snarfed empty file */
fbad3eb5 1630#define SNARF_EOF(gimme,rs,io,sv) \
684bef36 1631 (gimme != G_SCALAR || SvCUR(sv) \
b9fee9ba 1632 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
fbad3eb5 1633
a0d0e21e 1634 for (;;) {
09e8efcc 1635 PUTBACK;
fbad3eb5 1636 if (!sv_gets(sv, fp, offset)
2d726892
TF
1637 && (type == OP_GLOB
1638 || SNARF_EOF(gimme, PL_rs, io, sv)
1639 || PerlIO_error(fp)))
fbad3eb5 1640 {
760ac839 1641 PerlIO_clearerr(fp);
a0d0e21e 1642 if (IoFLAGS(io) & IOf_ARGV) {
3280af22 1643 fp = nextargv(PL_last_in_gv);
a0d0e21e
LW
1644 if (fp)
1645 continue;
3280af22 1646 (void)do_close(PL_last_in_gv, FALSE);
a0d0e21e
LW
1647 }
1648 else if (type == OP_GLOB) {
a2a5de95
NC
1649 if (!do_close(PL_last_in_gv, FALSE)) {
1650 Perl_ck_warner(aTHX_ packWARN(WARN_GLOB),
1651 "glob failed (child exited with status %d%s)",
1652 (int)(STATUS_CURRENT >> 8),
1653 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
4eb79ab5 1654 }
a0d0e21e 1655 }
54310121 1656 if (gimme == G_SCALAR) {
ba92458f
AE
1657 if (type != OP_RCATLINE) {
1658 SV_CHECK_THINKFIRST_COW_DROP(TARG);
0c34ef67 1659 SvOK_off(TARG);
ba92458f 1660 }
09e8efcc 1661 SPAGAIN;
a0d0e21e
LW
1662 PUSHTARG;
1663 }
3887d568 1664 MAYBE_TAINT_LINE(io, sv);
a0d0e21e
LW
1665 RETURN;
1666 }
3887d568 1667 MAYBE_TAINT_LINE(io, sv);
a0d0e21e 1668 IoLINES(io)++;
b9fee9ba 1669 IoFLAGS(io) |= IOf_NOLINE;
71be2cbc 1670 SvSETMAGIC(sv);
09e8efcc 1671 SPAGAIN;
a0d0e21e 1672 XPUSHs(sv);
a0d0e21e 1673 if (type == OP_GLOB) {
349d4f2f 1674 const char *t1;
a0d0e21e 1675
3280af22 1676 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
6136c704 1677 char * const tmps = SvEND(sv) - 1;
aa07b2f6 1678 if (*tmps == *SvPVX_const(PL_rs)) {
c07a80fd 1679 *tmps = '\0';
b162af07 1680 SvCUR_set(sv, SvCUR(sv) - 1);
c07a80fd
PP
1681 }
1682 }
349d4f2f 1683 for (t1 = SvPVX_const(sv); *t1; t1++)
15861f94 1684 if (!isALPHANUMERIC(*t1) &&
349d4f2f 1685 strchr("$&*(){}[]'\";\\|?<>~`", *t1))
a0d0e21e 1686 break;
349d4f2f 1687 if (*t1 && PerlLIO_lstat(SvPVX_const(sv), &PL_statbuf) < 0) {
a0d0e21e
LW
1688 (void)POPs; /* Unmatched wildcard? Chuck it... */
1689 continue;
1690 }
2d79bf7f 1691 } else if (SvUTF8(sv)) { /* OP_READLINE, OP_RCATLINE */
d4c19fe8
AL
1692 if (ckWARN(WARN_UTF8)) {
1693 const U8 * const s = (const U8*)SvPVX_const(sv) + offset;
1694 const STRLEN len = SvCUR(sv) - offset;
1695 const U8 *f;
1696
1697 if (!is_utf8_string_loc(s, len, &f))
1698 /* Emulate :encoding(utf8) warning in the same case. */
1699 Perl_warner(aTHX_ packWARN(WARN_UTF8),
1700 "utf8 \"\\x%02X\" does not map to Unicode",
1701 f < (U8*)SvEND(sv) ? *f : 0);
1702 }
a0d0e21e 1703 }
54310121 1704 if (gimme == G_ARRAY) {
a0d0e21e 1705 if (SvLEN(sv) - SvCUR(sv) > 20) {
1da4ca5f 1706 SvPV_shrink_to_cur(sv);
a0d0e21e 1707 }
561b68a9 1708 sv = sv_2mortal(newSV(80));
a0d0e21e
LW
1709 continue;
1710 }
54310121 1711 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
a0d0e21e 1712 /* try to reclaim a bit of scalar space (only on 1st alloc) */
d5b5861b
NC
1713 const STRLEN new_len
1714 = SvCUR(sv) < 60 ? 80 : SvCUR(sv)+40; /* allow some slop */
1da4ca5f 1715 SvPV_renew(sv, new_len);
a0d0e21e
LW
1716 }
1717 RETURN;
1718 }
1719}
1720
a0d0e21e
LW
1721PP(pp_helem)
1722{
97aff369 1723 dVAR; dSP;
760ac839 1724 HE* he;
ae77835f 1725 SV **svp;
c445ea15 1726 SV * const keysv = POPs;
85fbaab2 1727 HV * const hv = MUTABLE_HV(POPs);
a3b680e6
AL
1728 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
1729 const U32 defer = PL_op->op_private & OPpLVAL_DEFER;
be6c24e0 1730 SV *sv;
92970b93 1731 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
d30e492c 1732 bool preeminent = TRUE;
a0d0e21e 1733
d4c19fe8 1734 if (SvTYPE(hv) != SVt_PVHV)
a0d0e21e 1735 RETPUSHUNDEF;
d4c19fe8 1736
92970b93 1737 if (localizing) {
d4c19fe8
AL
1738 MAGIC *mg;
1739 HV *stash;
d30e492c
VP
1740
1741 /* If we can determine whether the element exist,
1742 * Try to preserve the existenceness of a tied hash
1743 * element by using EXISTS and DELETE if possible.
1744 * Fallback to FETCH and STORE otherwise. */
2c5f48c2 1745 if (SvCANEXISTDELETE(hv))
d30e492c 1746 preeminent = hv_exists_ent(hv, keysv, 0);
d4c19fe8 1747 }
d30e492c 1748
5f9d7e2b 1749 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
d4c19fe8 1750 svp = he ? &HeVAL(he) : NULL;
a0d0e21e 1751 if (lval) {
746f6409 1752 if (!svp || !*svp || *svp == &PL_sv_undef) {
68dc0745
PP
1753 SV* lv;
1754 SV* key2;
2d8e6c8d 1755 if (!defer) {
be2597df 1756 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
2d8e6c8d 1757 }
68dc0745
PP
1758 lv = sv_newmortal();
1759 sv_upgrade(lv, SVt_PVLV);
1760 LvTYPE(lv) = 'y';
6136c704 1761 sv_magic(lv, key2 = newSVsv(keysv), PERL_MAGIC_defelem, NULL, 0);
fc2b2dca 1762 SvREFCNT_dec_NN(key2); /* sv_magic() increments refcount */
b37c2d43 1763 LvTARG(lv) = SvREFCNT_inc_simple(hv);
68dc0745
PP
1764 LvTARGLEN(lv) = 1;
1765 PUSHs(lv);
1766 RETURN;
1767 }
92970b93 1768 if (localizing) {
bfcb3514 1769 if (HvNAME_get(hv) && isGV(*svp))
159b6efe 1770 save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL));
47cfc530
VP
1771 else if (preeminent)
1772 save_helem_flags(hv, keysv, svp,
1773 (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC);
1774 else
1775 SAVEHDELETE(hv, keysv);
5f05dabc 1776 }
9026059d
GG
1777 else if (PL_op->op_private & OPpDEREF) {
1778 PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF));
1779 RETURN;
1780 }
a0d0e21e 1781 }
746f6409 1782 sv = (svp && *svp ? *svp : &PL_sv_undef);
fd69380d
DM
1783 /* Originally this did a conditional C<sv = sv_mortalcopy(sv)>; this
1784 * was to make C<local $tied{foo} = $tied{foo}> possible.
1785 * However, it seems no longer to be needed for that purpose, and
1786 * introduced a new bug: stuff like C<while ($hash{taintedval} =~ /.../g>
1787 * would loop endlessly since the pos magic is getting set on the
1788 * mortal copy and lost. However, the copy has the effect of
1789 * triggering the get magic, and losing it altogether made things like
1790 * c<$tied{foo};> in void context no longer do get magic, which some
1791 * code relied on. Also, delayed triggering of magic on @+ and friends
1792 * meant the original regex may be out of scope by now. So as a
1793 * compromise, do the get magic here. (The MGf_GSKIP flag will stop it
1794 * being called too many times). */
39cf747a 1795 if (!lval && SvRMAGICAL(hv) && SvGMAGICAL(sv))
fd69380d 1796 mg_get(sv);
be6c24e0 1797 PUSHs(sv);
a0d0e21e
LW
1798 RETURN;
1799}
1800
a0d0e21e
LW
1801PP(pp_iter)
1802{
97aff369 1803 dVAR; dSP;
eb578fdb 1804 PERL_CONTEXT *cx;
7d6c2cef 1805 SV *oldsv;
1d7c1841 1806 SV **itersvp;
a0d0e21e 1807
924508f0 1808 EXTEND(SP, 1);
a0d0e21e 1809 cx = &cxstack[cxstack_ix];
1d7c1841 1810 itersvp = CxITERVAR(cx);
a48ce6be
DM
1811
1812 switch (CxTYPE(cx)) {
17c91640 1813
b552b52c
DM
1814 case CXt_LOOP_LAZYSV: /* string increment */
1815 {
1816 SV* cur = cx->blk_loop.state_u.lazysv.cur;
1817 SV *end = cx->blk_loop.state_u.lazysv.end;
1818 /* If the maximum is !SvOK(), pp_enteriter substitutes PL_sv_no.
1819 It has SvPVX of "" and SvCUR of 0, which is what we want. */
1820 STRLEN maxlen = 0;
1821 const char *max = SvPV_const(end, maxlen);
1822 if (SvNIOK(cur) || SvCUR(cur) > maxlen)
1823 RETPUSHNO;
1824
1825 oldsv = *itersvp;
1826 if (SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv)) {
1827 /* safe to reuse old SV */
1828 sv_setsv(oldsv, cur);
a48ce6be 1829 }
b552b52c
DM
1830 else
1831 {
1832 /* we need a fresh SV every time so that loop body sees a
1833 * completely new SV for closures/references to work as
1834 * they used to */
1835 *itersvp = newSVsv(cur);
fc2b2dca 1836 SvREFCNT_dec_NN(oldsv);
b552b52c
DM
1837 }
1838 if (strEQ(SvPVX_const(cur), max))
1839 sv_setiv(cur, 0); /* terminate next time */
1840 else
1841 sv_inc(cur);
1842 break;
1843 }
a48ce6be 1844
fcef60b4
DM
1845 case CXt_LOOP_LAZYIV: /* integer increment */
1846 {
1847 IV cur = cx->blk_loop.state_u.lazyiv.cur;
1848 if (cur > cx->blk_loop.state_u.lazyiv.end)
89ea2908 1849 RETPUSHNO;
7f61b687 1850
fcef60b4 1851 oldsv = *itersvp;
3db8f154 1852 /* don't risk potential race */
fcef60b4 1853 if (SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv)) {
eaa5c2d6 1854 /* safe to reuse old SV */
fcef60b4 1855 sv_setiv(oldsv, cur);
eaa5c2d6 1856 }
1c846c1f 1857 else
eaa5c2d6
GA
1858 {
1859 /* we need a fresh SV every time so that loop body sees a
1860 * completely new SV for closures/references to work as they
1861 * used to */
fcef60b4 1862 *itersvp = newSViv(cur);
fc2b2dca 1863 SvREFCNT_dec_NN(oldsv);
eaa5c2d6 1864 }
a2309040 1865
fcef60b4 1866 if (cur == IV_MAX) {
cdc1aa42
NC
1867 /* Handle end of range at IV_MAX */
1868 cx->blk_loop.state_u.lazyiv.end = IV_MIN;
1869 } else
1870 ++cx->blk_loop.state_u.lazyiv.cur;
a48ce6be 1871 break;
fcef60b4 1872 }
a48ce6be 1873
b552b52c 1874 case CXt_LOOP_FOR: /* iterate array */
7d6c2cef 1875 {
89ea2908 1876
7d6c2cef
DM
1877 AV *av = cx->blk_loop.state_u.ary.ary;
1878 SV *sv;
1879 bool av_is_stack = FALSE;
a8a20bb6 1880 IV ix;
7d6c2cef 1881
de080daa
DM
1882 if (!av) {
1883 av_is_stack = TRUE;
1884 av = PL_curstack;
1885 }
1886 if (PL_op->op_private & OPpITER_REVERSED) {
a8a20bb6
DM
1887 ix = --cx->blk_loop.state_u.ary.ix;
1888 if (ix <= (av_is_stack ? cx->blk_loop.resetsp : -1))
de080daa 1889 RETPUSHNO;
de080daa
DM
1890 }
1891 else {
a8a20bb6
DM
1892 ix = ++cx->blk_loop.state_u.ary.ix;
1893 if (ix > (av_is_stack ? cx->blk_oldsp : AvFILL(av)))
de080daa 1894 RETPUSHNO;
a8a20bb6 1895 }
de080daa 1896
a8a20bb6
DM
1897 if (SvMAGICAL(av) || AvREIFY(av)) {
1898 SV * const * const svp = av_fetch(av, ix, FALSE);
1899 sv = svp ? *svp : NULL;
1900 }
1901 else {
1902 sv = AvARRAY(av)[ix];
de080daa 1903 }
ef3e5ea9 1904
de080daa 1905 if (sv) {
f38aa882
DM
1906 if (SvIS_FREED(sv)) {
1907 *itersvp = NULL;
1908 Perl_croak(aTHX_ "Use of freed value in iteration");
1909 }
8e079c2a
FC
1910 if (SvPADTMP(sv) && !IS_PADGV(sv))
1911 sv = newSVsv(sv);
1912 else {
1913 SvTEMP_off(sv);
1914 SvREFCNT_inc_simple_void_NN(sv);
1915 }
de080daa 1916 }
a600f7e6 1917 else if (!av_is_stack) {
199f858d 1918 sv = newSVavdefelem(av, ix, 0);
de080daa 1919 }
a600f7e6
FC
1920 else
1921 sv = &PL_sv_undef;
a0d0e21e 1922
de080daa
DM
1923 oldsv = *itersvp;
1924 *itersvp = sv;
1925 SvREFCNT_dec(oldsv);
de080daa 1926 break;
7d6c2cef 1927 }
a48ce6be
DM
1928
1929 default:
1930 DIE(aTHX_ "panic: pp_iter, type=%u", CxTYPE(cx));
1931 }
b552b52c 1932 RETPUSHYES;
a0d0e21e
LW
1933}
1934
ef07e810
DM
1935/*
1936A description of how taint works in pattern matching and substitution.
1937
284167a5
SM
1938This is all conditional on NO_TAINT_SUPPORT not being defined. Under
1939NO_TAINT_SUPPORT, taint-related operations should become no-ops.
1940
4e19c54b 1941While the pattern is being assembled/concatenated and then compiled,
284167a5
SM
1942PL_tainted will get set (via TAINT_set) if any component of the pattern
1943is tainted, e.g. /.*$tainted/. At the end of pattern compilation,
1944the RXf_TAINTED flag is set on the pattern if PL_tainted is set (via
1945TAINT_get).
ef07e810 1946
0ab462a6
DM
1947When the pattern is copied, e.g. $r = qr/..../, the SV holding the ref to
1948the pattern is marked as tainted. This means that subsequent usage, such
284167a5
SM
1949as /x$r/, will set PL_tainted using TAINT_set, and thus RXf_TAINTED,
1950on the new pattern too.
ef07e810 1951
272d35c9 1952At the start of execution of a pattern, the RXf_TAINTED_SEEN flag on the
ca143fe8 1953regex is cleared; during execution, locale-variant ops such as POSIXL may
272d35c9 1954set RXf_TAINTED_SEEN.
ef07e810 1955
272d35c9 1956RXf_TAINTED_SEEN is used post-execution by the get magic code
ef07e810
DM
1957of $1 et al to indicate whether the returned value should be tainted.
1958It is the responsibility of the caller of the pattern (i.e. pp_match,
1959pp_subst etc) to set this flag for any other circumstances where $1 needs
1960to be tainted.
1961
1962The taint behaviour of pp_subst (and pp_substcont) is quite complex.
1963
1964There are three possible sources of taint
1965 * the source string
1966 * the pattern (both compile- and run-time, RXf_TAINTED / RXf_TAINTED_SEEN)
1967 * the replacement string (or expression under /e)
1968
1969There are four destinations of taint and they are affected by the sources
1970according to the rules below:
1971
1972 * the return value (not including /r):
1973 tainted by the source string and pattern, but only for the
1974 number-of-iterations case; boolean returns aren't tainted;
1975 * the modified string (or modified copy under /r):
1976 tainted by the source string, pattern, and replacement strings;
1977 * $1 et al:
1978 tainted by the pattern, and under 'use re "taint"', by the source
1979 string too;
1980 * PL_taint - i.e. whether subsequent code (e.g. in a /e block) is tainted:
1981 should always be unset before executing subsequent code.
1982
1983The overall action of pp_subst is:
1984
1985 * at the start, set bits in rxtainted indicating the taint status of
1986 the various sources.
1987
1988 * After each pattern execution, update the SUBST_TAINT_PAT bit in
1989 rxtainted if RXf_TAINTED_SEEN has been set, to indicate that the
1990 pattern has subsequently become tainted via locale ops.
1991
1992 * If control is being passed to pp_substcont to execute a /e block,
1993 save rxtainted in the CXt_SUBST block, for future use by
1994 pp_substcont.
1995
1996 * Whenever control is being returned to perl code (either by falling
1997 off the "end" of pp_subst/pp_substcont, or by entering a /e block),
1998 use the flag bits in rxtainted to make all the appropriate types of
0ab462a6
DM
1999 destination taint visible; e.g. set RXf_TAINTED_SEEN so that $1
2000 et al will appear tainted.
ef07e810
DM
2001
2002pp_match is just a simpler version of the above.
2003
2004*/
2005
a0d0e21e
LW
2006PP(pp_subst)
2007{
97aff369 2008 dVAR; dSP; dTARG;
eb578fdb 2009 PMOP *pm = cPMOP;
a0d0e21e 2010 PMOP *rpm = pm;
eb578fdb 2011 char *s;
a0d0e21e 2012 char *strend;
5c144d81 2013 const char *c;
a0d0e21e
LW
2014 STRLEN clen;
2015 I32 iters = 0;
2016 I32 maxiters;
a0d0e21e 2017 bool once;
ef07e810
DM
2018 U8 rxtainted = 0; /* holds various SUBST_TAINT_* flag bits.
2019 See "how taint works" above */
a0d0e21e 2020 char *orig;
1ed74d04 2021 U8 r_flags;
eb578fdb 2022 REGEXP *rx = PM_GETRE(pm);
a0d0e21e
LW
2023 STRLEN len;
2024 int force_on_match = 0;
0bcc34c2 2025 const I32 oldsave = PL_savestack_ix;
792b2c16 2026 STRLEN slen;
26a74523 2027 bool doutf8 = FALSE; /* whether replacement is in utf8 */
db2c6cb3 2028#ifdef PERL_ANY_COW
ed252734
NC
2029 bool is_cow;
2030#endif
a0714e2c 2031 SV *nsv = NULL;
b770e143 2032 /* known replacement string? */
eb578fdb 2033 SV *dstr = (pm->op_pmflags & PMf_CONST) ? POPs : NULL;
a0d0e21e 2034
f410a211
NC
2035 PERL_ASYNC_CHECK();
2036
533c011a 2037 if (PL_op->op_flags & OPf_STACKED)
a0d0e21e 2038 TARG = POPs;
59f00321
RGS
2039 else if (PL_op->op_private & OPpTARGET_MY)
2040 GETTARGET;
a0d0e21e 2041 else {
54b9620d 2042 TARG = DEFSV;
a0d0e21e 2043 EXTEND(SP,1);
1c846c1f 2044 }
d9f424b2 2045
64534138 2046 SvGETMAGIC(TARG); /* must come before cow check */
db2c6cb3 2047#ifdef PERL_ANY_COW
ed252734
NC
2048 /* Awooga. Awooga. "bool" types that are actually char are dangerous,
2049 because they make integers such as 256 "false". */
2050 is_cow = SvIsCOW(TARG) ? TRUE : FALSE;
2051#else
765f542d
NC
2052 if (SvIsCOW(TARG))
2053 sv_force_normal_flags(TARG,0);
ed252734 2054#endif
8ca8a454 2055 if (!(rpm->op_pmflags & PMf_NONDESTRUCT)
8ca8a454
NC
2056 && (SvREADONLY(TARG)
2057 || ( ((SvTYPE(TARG) == SVt_PVGV && isGV_with_GP(TARG))
2058 || SvTYPE(TARG) > SVt_PVLV)
2059 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG)))))
cb077ed2 2060 Perl_croak_no_modify();
8ec5e241
NIS
2061 PUTBACK;
2062
6ac6605d
DM
2063 orig = SvPV_nomg(TARG, len);
2064 /* note we don't (yet) force the var into being a string; if we fail
2065 * to match, we leave as-is; on successful match howeverm, we *will*
2066 * coerce into a string, then repeat the match */
4499db73 2067 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV || SvVOK(TARG))
a0d0e21e 2068 force_on_match = 1;
20be6587
DM
2069
2070 /* only replace once? */
2071 once = !(rpm->op_pmflags & PMf_GLOBAL);
2072
ef07e810 2073 /* See "how taint works" above */
284167a5 2074 if (TAINTING_get) {
20be6587
DM
2075 rxtainted = (
2076 (SvTAINTED(TARG) ? SUBST_TAINT_STR : 0)
284167a5 2077 | (RX_ISTAINTED(rx) ? SUBST_TAINT_PAT : 0)
20be6587
DM
2078 | ((pm->op_pmflags & PMf_RETAINT) ? SUBST_TAINT_RETAINT : 0)
2079 | ((once && !(rpm->op_pmflags & PMf_NONDESTRUCT))
2080 ? SUBST_TAINT_BOOLRET : 0));
2081 TAINT_NOT;
2082 }
a12c0f56 2083
a0d0e21e 2084 force_it:
6ac6605d
DM
2085 if (!pm || !orig)
2086 DIE(aTHX_ "panic: pp_subst, pm=%p, orig=%p", pm, orig);
a0d0e21e 2087
6ac6605d
DM
2088 strend = orig + len;
2089 slen = DO_UTF8(TARG) ? utf8_length((U8*)orig, (U8*)strend) : len;
792b2c16
JH
2090 maxiters = 2 * slen + 10; /* We can match twice at each
2091 position, once with zero-length,
2092 second time with non-zero. */
a0d0e21e 2093
6a97c51d 2094 if (!RX_PRELEN(rx) && PL_curpm
8d919b0a 2095 && !ReANY(rx)->mother_re) {
3280af22 2096 pm = PL_curpm;
aaa362c4 2097 rx = PM_GETRE(pm);
a0d0e21e 2098 }
6502e081 2099
6e240d0b 2100#ifdef PERL_SAWAMPERSAND
6502e081
DM
2101 r_flags = ( RX_NPARENS(rx)
2102 || PL_sawampersand
6502e081 2103 || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY))
5b0e71e9 2104 || (rpm->op_pmflags & PMf_KEEPCOPY)
6502e081
DM
2105 )
2106 ? REXEC_COPY_STR
2107 : 0;
6e240d0b
FC
2108#else
2109 r_flags = REXEC_COPY_STR;
2110#endif
7fba1cd6 2111
0395280b 2112 if (!CALLREGEXEC(rx, orig, strend, orig, 0, TARG, NULL, r_flags))
8b64c330 2113 {
5e79dfb9
DM
2114 SPAGAIN;
2115 PUSHs(rpm->op_pmflags & PMf_NONDESTRUCT ? TARG : &PL_sv_no);
2116 LEAVE_SCOPE(oldsave);
2117 RETURN;
2118 }
1754320d
FC
2119 PL_curpm = pm;
2120
71be2cbc 2121 /* known replacement string? */
f272994b 2122 if (dstr) {
8514a05a
JH
2123 /* replacement needing upgrading? */
2124 if (DO_UTF8(TARG) && !doutf8) {
db79b45b 2125 nsv = sv_newmortal();
4a176938 2126 SvSetSV(nsv, dstr);
8514a05a
JH
2127 if (PL_encoding)
2128 sv_recode_to_utf8(nsv, PL_encoding);
2129 else
2130 sv_utf8_upgrade(nsv);
5c144d81 2131 c = SvPV_const(nsv, clen);
4a176938
JH
2132 doutf8 = TRUE;
2133 }
2134 else {
5c144d81 2135 c = SvPV_const(dstr, clen);
4a176938 2136 doutf8 = DO_UTF8(dstr);
8514a05a 2137 }
bb933b9b
FC
2138
2139 if (SvTAINTED(dstr))
2140 rxtainted |= SUBST_TAINT_REPL;
f272994b
A
2141 }
2142 else {
6136c704 2143 c = NULL;
f272994b
A
2144 doutf8 = FALSE;
2145 }
2146
71be2cbc 2147 /* can do inplace substitution? */
ed252734 2148 if (c
db2c6cb3 2149#ifdef PERL_ANY_COW
ed252734
NC
2150 && !is_cow
2151#endif
fbfb1899 2152 && (I32)clen <= RX_MINLENRET(rx)
9cefd268
FC
2153 && ( once
2154 || !(r_flags & REXEC_COPY_STR)
2155 || (!SvGMAGICAL(dstr) && !(RX_EXTFLAGS(rx) & RXf_EVAL_SEEN))
2156 )
dbc200c5 2157 && !(RX_EXTFLAGS(rx) & RXf_NO_INPLACE_SUBST)
8ca8a454
NC
2158 && (!doutf8 || SvUTF8(TARG))
2159 && !(rpm->op_pmflags & PMf_NONDESTRUCT))
8b030b38 2160 {
ec911639 2161
db2c6cb3 2162#ifdef PERL_ANY_COW
ed252734 2163 if (SvIsCOW(TARG)) {
f7a8268c 2164 if (!force_on_match)
ed252734 2165 goto have_a_cow;
f7a8268c 2166 assert(SvVOK(TARG));
ed252734
NC
2167 }
2168#endif
71be2cbc 2169 if (force_on_match) {
6ac6605d
DM
2170 /* redo the first match, this time with the orig var
2171 * forced into being a string */
71be2cbc 2172 force_on_match = 0;
6ac6605d 2173 orig = SvPV_force_nomg(TARG, len);
71be2cbc
PP
2174 goto force_it;
2175 }
39b40493 2176
71be2cbc 2177 if (once) {
c67ab8f2 2178 char *d, *m;
20be6587
DM
2179 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2180 rxtainted |= SUBST_TAINT_PAT;
07bc277f
NC
2181 m = orig + RX_OFFS(rx)[0].start;
2182 d = orig + RX_OFFS(rx)[0].end;
71be2cbc
PP
2183 s = orig;
2184 if (m - s > strend - d) { /* faster to shorten from end */
2ec7214c 2185 I32 i;
71be2cbc
PP
2186 if (clen) {
2187 Copy(c, m, clen, char);
2188 m += clen;
a0d0e21e 2189 }
71be2cbc
PP
2190 i = strend - d;
2191 if (i > 0) {
2192 Move(d, m, i, char);
2193 m += i;
a0d0e21e 2194 }
71be2cbc
PP
2195 *m = '\0';
2196 SvCUR_set(TARG, m - s);
2197 }
2ec7214c
DM
2198 else { /* faster from front */
2199 I32 i = m - s;
71be2cbc 2200 d -= clen;
2ec7214c
DM
2201 if (i > 0)
2202 Move(s, d - i, i, char);
71be2cbc 2203 sv_chop(TARG, d-i);
71be2cbc 2204 if (clen)
c947cd8d 2205 Copy(c, d, clen, char);
71be2cbc 2206 }
8ec5e241 2207 SPAGAIN;
8ca8a454 2208 PUSHs(&PL_sv_yes);
71be2cbc
PP
2209 }
2210 else {
c67ab8f2 2211 char *d, *m;
0395280b 2212 d = s = RX_OFFS(rx)[0].start + orig;
71be2cbc 2213 do {
2b25edcf 2214 I32 i;
71be2cbc 2215 if (iters++ > maxiters)
cea2e8a9 2216 DIE(aTHX_ "Substitution loop");
20be6587
DM
2217 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2218 rxtainted |= SUBST_TAINT_PAT;
07bc277f 2219 m = RX_OFFS(rx)[0].start + orig;
155aba94 2220 if ((i = m - s)) {
71be2cbc
PP
2221 if (s != d)
2222 Move(s, d, i, char);
2223 d += i;
a0d0e21e 2224 }
71be2cbc
PP
2225 if (clen) {
2226 Copy(c, d, clen, char);
2227 d += clen;
2228 }
07bc277f 2229 s = RX_OFFS(rx)[0].end + orig;
7ce41e5c
FC
2230 } while (CALLREGEXEC(rx, s, strend, orig,
2231 s == m, /* don't match same null twice */
f722798b 2232 TARG, NULL,
d5e7783a 2233 REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW));
71be2cbc 2234 if (s != d) {
2b25edcf 2235 I32 i = strend - s;
aa07b2f6 2236 SvCUR_set(TARG, d - SvPVX_const(TARG) + i);
71be2cbc 2237 Move(s, d, i+1, char); /* include the NUL */
a0d0e21e 2238 }
8ec5e241 2239 SPAGAIN;
8ca8a454 2240 mPUSHi((I32)iters);
a0d0e21e
LW
2241 }
2242 }
ff6e92e8 2243 else {
1754320d 2244 bool first;
c67ab8f2 2245 char *m;
1754320d 2246 SV *repl;
a0d0e21e 2247 if (force_on_match) {
6ac6605d
DM
2248 /* redo the first match, this time with the orig var
2249 * forced into being a string */
a0d0e21e 2250 force_on_match = 0;
0c1438a1
NC
2251 if (rpm->op_pmflags & PMf_NONDESTRUCT) {
2252 /* I feel that it should be possible to avoid this mortal copy
2253 given that the code below copies into a new destination.
2254 However, I suspect it isn't worth the complexity of
2255 unravelling the C<goto force_it> for the small number of
2256 cases where it would be viable to drop into the copy code. */
2257 TARG = sv_2mortal(newSVsv(TARG));
2258 }
6ac6605d 2259 orig = SvPV_force_nomg(TARG, len);
a0d0e21e
LW
2260 goto force_it;
2261 }
db2c6cb3 2262#ifdef PERL_ANY_COW
ed252734
NC
2263 have_a_cow:
2264#endif
20be6587
DM
2265 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2266 rxtainted |= SUBST_TAINT_PAT;
1754320d 2267 repl = dstr;
0395280b
DM
2268 s = RX_OFFS(rx)[0].start + orig;
2269 dstr = newSVpvn_flags(orig, s-orig,
2270 SVs_TEMP | (DO_UTF8(TARG) ? SVf_UTF8 : 0));
a0d0e21e 2271 if (!c) {
eb578fdb 2272 PERL_CONTEXT *cx;
8ec5e241 2273 SPAGAIN;
0395280b 2274 m = orig;
20be6587
DM
2275 /* note that a whole bunch of local vars are saved here for
2276 * use by pp_substcont: here's a list of them in case you're
2277 * searching for places in this sub that uses a particular var:
2278 * iters maxiters r_flags oldsave rxtainted orig dstr targ
2279 * s m strend rx once */
a0d0e21e 2280 PUSHSUBST(cx);
20e98b0f 2281 RETURNOP(cPMOP->op_pmreplrootu.op_pmreplroot);
a0d0e21e 2282 }
1754320d 2283 first = TRUE;
a0d0e21e
LW
2284 do {
2285 if (iters++ > maxiters)
cea2e8a9 2286 DIE(aTHX_ "Substitution loop");
20be6587
DM
2287 if (RX_MATCH_TAINTED(rx))
2288 rxtainted |= SUBST_TAINT_PAT;
07bc277f 2289 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
c67ab8f2
DM
2290 char *old_s = s;
2291 char *old_orig = orig;
6502e081 2292 assert(RX_SUBOFFSET(rx) == 0);
c67ab8f2 2293
07bc277f 2294 orig = RX_SUBBEG(rx);
c67ab8f2
DM
2295 s = orig + (old_s - old_orig);
2296 strend = s + (strend - old_s);
a0d0e21e 2297 }
07bc277f 2298 m = RX_OFFS(rx)[0].start + orig;
64534138 2299 sv_catpvn_nomg_maybeutf8(dstr, s, m - s, DO_UTF8(TARG));
07bc277f 2300 s = RX_OFFS(rx)[0].end + orig;
1754320d
FC
2301 if (first) {
2302 /* replacement already stringified */
2303 if (clen)
64534138 2304 sv_catpvn_nomg_maybeutf8(dstr, c, clen, doutf8);
1754320d
FC
2305 first = FALSE;
2306 }
2307 else {
1754320d
FC
2308 if (PL_encoding) {
2309 if (!nsv) nsv = sv_newmortal();
2310 sv_copypv(nsv, repl);
2311 if (!DO_UTF8(nsv)) sv_recode_to_utf8(nsv, PL_encoding);
2312 sv_catsv(dstr, nsv);
2313 }
2314 else sv_catsv(dstr, repl);
bb933b9b
FC
2315 if (SvTAINTED(repl))
2316 rxtainted |= SUBST_TAINT_REPL;
1754320d 2317 }
a0d0e21e
LW
2318 if (once)
2319 break;
f9f4320a 2320 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
d5e7783a
DM
2321 TARG, NULL,
2322 REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW));
64534138 2323 sv_catpvn_nomg_maybeutf8(dstr, s, strend - s, DO_UTF8(TARG));
748a9306 2324
8ca8a454
NC
2325 if (rpm->op_pmflags & PMf_NONDESTRUCT) {
2326 /* From here on down we're using the copy, and leaving the original
2327 untouched. */
2328 TARG = dstr;
2329 SPAGAIN;
2330 PUSHs(dstr);
2331 } else {
db2c6cb3 2332#ifdef PERL_ANY_COW
8ca8a454
NC
2333 /* The match may make the string COW. If so, brilliant, because
2334 that's just saved us one malloc, copy and free - the regexp has
2335 donated the old buffer, and we malloc an entirely new one, rather
2336 than the regexp malloc()ing a buffer and copying our original,
2337 only for us to throw it away here during the substitution. */
2338 if (SvIsCOW(TARG)) {
2339 sv_force_normal_flags(TARG, SV_COW_DROP_PV);
2340 } else
ed252734 2341#endif
8ca8a454
NC
2342 {
2343 SvPV_free(TARG);
2344 }
2345 SvPV_set(TARG, SvPVX(dstr));
2346 SvCUR_set(TARG, SvCUR(dstr));
2347 SvLEN_set(TARG, SvLEN(dstr));
64534138 2348 SvFLAGS(TARG) |= SvUTF8(dstr);
8ca8a454 2349 SvPV_set(dstr, NULL);
748a9306 2350
8ca8a454 2351 SPAGAIN;
4f4d7508 2352 mPUSHi((I32)iters);
8ca8a454
NC
2353 }
2354 }
2355
2356 if (!(rpm->op_pmflags & PMf_NONDESTRUCT)) {
2357 (void)SvPOK_only_UTF8(TARG);
a0d0e21e 2358 }
20be6587 2359
ef07e810 2360 /* See "how taint works" above */
284167a5 2361 if (TAINTING_get) {
20be6587
DM
2362 if ((rxtainted & SUBST_TAINT_PAT) ||
2363 ((rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT)) ==
2364 (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
2365 )
2366 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
2367
2368 if (!(rxtainted & SUBST_TAINT_BOOLRET)
2369 && (rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT))
2370 )
2371 SvTAINTED_on(TOPs); /* taint return value */
2372 else
2373 SvTAINTED_off(TOPs); /* may have got tainted earlier */
2374
2375 /* needed for mg_set below */
284167a5
SM
2376 TAINT_set(
2377 cBOOL(rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL))
2378 );
20be6587
DM
2379 SvTAINT(TARG);
2380 }
2381 SvSETMAGIC(TARG); /* PL_tainted must be correctly set for this mg_set */
2382 TAINT_NOT;
f1a76097
DM
2383 LEAVE_SCOPE(oldsave);
2384 RETURN;
a0d0e21e
LW
2385}
2386
2387PP(pp_grepwhile)
2388{
27da23d5 2389 dVAR; dSP;
a0d0e21e
LW
2390
2391 if (SvTRUEx(POPs))
3280af22
NIS
2392 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2393 ++*PL_markstack_ptr;
b2a2a901 2394 FREETMPS;
d343c3ef 2395 LEAVE_with_name("grep_item"); /* exit inner scope */
a0d0e21e
LW
2396
2397 /* All done yet? */
3280af22 2398 if (PL_stack_base + *PL_markstack_ptr > SP) {
a0d0e21e 2399 I32 items;
c4420975 2400 const I32 gimme = GIMME_V;
a0d0e21e 2401
d343c3ef 2402 LEAVE_with_name("grep"); /* exit outer scope */
a0d0e21e 2403 (void)POPMARK; /* pop src */
3280af22 2404 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
a0d0e21e 2405 (void)POPMARK; /* pop dst */
3280af22 2406 SP = PL_stack_base + POPMARK; /* pop original mark */
54310121 2407 if (gimme == G_SCALAR) {
7cc47870 2408 if (PL_op->op_private & OPpGREP_LEX) {
c4420975 2409 SV* const sv = sv_newmortal();
7cc47870
RGS
2410 sv_setiv(sv, items);
2411 PUSHs(sv);
2412 }
2413 else {
2414 dTARGET;
2415 XPUSHi(items);
2416 }
a0d0e21e 2417 }
54310121
PP
2418 else if (gimme == G_ARRAY)
2419 SP += items;
a0d0e21e
LW
2420 RETURN;
2421 }
2422 else {
2423 SV *src;
2424
d343c3ef 2425 ENTER_with_name("grep_item"); /* enter inner scope */
1d7c1841 2426 SAVEVPTR(PL_curpm);
a0d0e21e 2427
3280af22 2428 src = PL_stack_base[*PL_markstack_ptr];
a0ed822e
FC
2429 if (SvPADTMP(src) && !IS_PADGV(src)) {
2430 src = PL_stack_base[*PL_markstack_ptr] = sv_mortalcopy(src);
2431 PL_tmps_floor++;
2432 }
a0d0e21e 2433 SvTEMP_off(src);
59f00321
RGS
2434 if (PL_op->op_private & OPpGREP_LEX)
2435 PAD_SVl(PL_op->op_targ) = src;
2436 else
414bf5ae 2437 DEFSV_set(src);
a0d0e21e
LW
2438
2439 RETURNOP(cLOGOP->op_other);
2440 }
2441}
2442
2443PP(pp_leavesub)
2444{
27da23d5 2445 dVAR; dSP;
a0d0e21e
LW
2446 SV **mark;
2447 SV **newsp;
2448 PMOP *newpm;
2449 I32 gimme;
eb578fdb 2450 PERL_CONTEXT *cx;
b0d9ce38 2451 SV *sv;
a0d0e21e 2452
9850bf21
RH
2453 if (CxMULTICALL(&cxstack[cxstack_ix]))
2454 return 0;
2455
a0d0e21e 2456 POPBLOCK(cx,newpm);
5dd42e15 2457 cxstack_ix++; /* temporarily protect top context */
1c846c1f 2458
a1f49e72 2459 TAINT_NOT;
a0d0e21e
LW
2460 if (gimme == G_SCALAR) {
2461 MARK = newsp + 1;
a29cdaf0 2462 if (MARK <= SP) {
a8bba7fa 2463 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
6f48390a
FC
2464 if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
2465 && !SvMAGICAL(TOPs)) {
a29cdaf0
IZ
2466 *MARK = SvREFCNT_inc(TOPs);
2467 FREETMPS;
2468 sv_2mortal(*MARK);
cd06dffe
GS
2469 }
2470 else {
959e3673 2471 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
a29cdaf0 2472 FREETMPS;
959e3673 2473 *MARK = sv_mortalcopy(sv);
fc2b2dca 2474 SvREFCNT_dec_NN(sv);
a29cdaf0 2475 }
cd06dffe 2476 }
6f48390a
FC
2477 else if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
2478 && !SvMAGICAL(TOPs)) {
767eda44 2479 *MARK = TOPs;
767eda44 2480 }
cd06dffe 2481 else
767eda44 2482 *MARK = sv_mortalcopy(TOPs);
cd06dffe
GS
2483 }
2484 else {
f86702cc 2485 MEXTEND(MARK, 0);
3280af22 2486 *MARK = &PL_sv_undef;
a0d0e21e
LW
2487 }
2488 SP = MARK;
2489 }
54310121 2490 else if (gimme == G_ARRAY) {
f86702cc 2491 for (MARK = newsp + 1; MARK <= SP; MARK++) {
6f48390a
FC
2492 if (!SvTEMP(*MARK) || SvREFCNT(*MARK) != 1
2493 || SvMAGICAL(*MARK)) {
f86702cc 2494 *MARK = sv_mortalcopy(*MARK);
a1f49e72
CS
2495 TAINT_NOT; /* Each item is independent */
2496 }
f86702cc 2497 }
a0d0e21e 2498 }
f86702cc 2499 PUTBACK;
1c846c1f 2500
a57c6685 2501 LEAVE;
b0d9ce38 2502 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
25375124 2503 cxstack_ix--;
3280af22 2504 PL_curpm = newpm; /* ... and pop $1 et al */
a0d0e21e 2505
b0d9ce38 2506 LEAVESUB(sv);
f39bc417 2507 return cx->blk_sub.retop;
a0d0e21e
LW
2508}
2509
2510PP(pp_entersub)
2511{
27da23d5 2512 dVAR; dSP; dPOPss;
a0d0e21e 2513 GV *gv;
eb578fdb
KW
2514 CV *cv;
2515 PERL_CONTEXT *cx;
5d94fbed 2516 I32 gimme;
a9c4fd4e 2517 const bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
a0d0e21e
LW
2518
2519 if (!sv)
cea2e8a9 2520 DIE(aTHX_ "Not a CODE reference");
a0d0e21e 2521 switch (SvTYPE(sv)) {
f1025168
NC
2522 /* This is overwhelming the most common case: */
2523 case SVt_PVGV:
13be902c 2524 we_have_a_glob:
159b6efe 2525 if (!(cv = GvCVu((const GV *)sv))) {
f730a42d 2526 HV *stash;
f2c0649b 2527 cv = sv_2cv(sv, &stash, &gv, 0);
f730a42d 2528 }
f1025168 2529 if (!cv) {
a57c6685 2530 ENTER;
f1025168
NC
2531 SAVETMPS;
2532 goto try_autoload;
2533 }
2534 break;
13be902c
FC
2535 case SVt_PVLV:
2536 if(isGV_with_GP(sv)) goto we_have_a_glob;
2537 /*FALLTHROUGH*/
a0d0e21e 2538 default:
7c75014e
DM
2539 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2540 if (hasargs)
2541 SP = PL_stack_base + POPMARK;
4d198de3
DM
2542 else
2543 (void)POPMARK;
7c75014e
DM
2544 RETURN;
2545 }
2546 SvGETMAGIC(sv);
2547 if (SvROK(sv)) {
93d7320b
DM
2548 if (SvAMAGIC(sv)) {
2549 sv = amagic_deref_call(sv, to_cv_amg);
2550 /* Don't SPAGAIN here. */
2551 }
7c75014e
DM
2552 }
2553 else {
a9c4fd4e 2554 const char *sym;
780a5241 2555 STRLEN len;
79a3e5ea 2556 if (!SvOK(sv))
cea2e8a9 2557 DIE(aTHX_ PL_no_usym, "a subroutine");
79a3e5ea 2558 sym = SvPV_nomg_const(sv, len);
533c011a 2559 if (PL_op->op_private & HINT_STRICT_REFS)
b375e37b 2560 DIE(aTHX_ "Can't use string (\"%" SVf32 "\"%s) as a subroutine ref while \"strict refs\" in use", sv, len>32 ? "..." : "");
780a5241 2561 cv = get_cvn_flags(sym, len, GV_ADD|SvUTF8(sv));
a0d0e21e
LW
2562 break;
2563 }
ea726b52 2564 cv = MUTABLE_CV(SvRV(sv));
a0d0e21e
LW
2565 if (SvTYPE(cv) == SVt_PVCV)
2566 break;
2567 /* FALL THROUGH */
2568 case SVt_PVHV:
2569 case SVt_PVAV:
cea2e8a9 2570 DIE(aTHX_ "Not a CODE reference");
f1025168 2571 /* This is the second most common case: */
a0d0e21e 2572 case SVt_PVCV:
ea726b52 2573 cv = MUTABLE_CV(sv);
a0d0e21e 2574 break;
a0d0e21e
LW
2575 }
2576
a57c6685 2577 ENTER;
a0d0e21e
LW
2578
2579 retry:
541ed3a9
FC
2580 if (CvCLONE(cv) && ! CvCLONED(cv))
2581 DIE(aTHX_ "Closure prototype called");
a0d0e21e 2582 if (!CvROOT(cv) && !CvXSUB(cv)) {
2f349aa0
NC
2583 GV* autogv;
2584 SV* sub_name;
2585
2586 /* anonymous or undef'd function leaves us no recourse */
7d2057d8
FC
2587 if (CvANON(cv) || !(gv = CvGV(cv))) {
2588 if (CvNAMED(cv))
2589 DIE(aTHX_ "Undefined subroutine &%"HEKf" called",
2590 HEKfARG(CvNAME_HEK(cv)));
2f349aa0 2591 DIE(aTHX_ "Undefined subroutine called");
7d2057d8 2592 }
2f349aa0
NC
2593
2594 /* autoloaded stub? */
2595 if (cv != GvCV(gv)) {
2596 cv = GvCV(gv);
2597 }
2598 /* should call AUTOLOAD now? */
2599 else {
7e623da3 2600try_autoload:
d1089224
BF
2601 if ((autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2602 GvNAMEUTF8(gv) ? SVf_UTF8 : 0)))
2f349aa0
NC
2603 {
2604 cv = GvCV(autogv);
2605 }
2f349aa0 2606 else {
c220e1a1 2607 sorry:
2f349aa0 2608 sub_name = sv_newmortal();
6136c704 2609 gv_efullname3(sub_name, gv, NULL);
be2597df 2610 DIE(aTHX_ "Undefined subroutine &%"SVf" called", SVfARG(sub_name));
2f349aa0
NC
2611 }
2612 }
2613 if (!cv)
c220e1a1 2614 goto sorry;
2f349aa0 2615 goto retry;
a0d0e21e
LW
2616 }
2617
54310121 2618 gimme = GIMME_V;
67caa1fe 2619 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
005a8a35 2620 Perl_get_db_sub(aTHX_ &sv, cv);
a9ef256d
NC
2621 if (CvISXSUB(cv))
2622 PL_curcopdb = PL_curcop;
1ad62f64 2623 if (CvLVALUE(cv)) {
2624 /* check for lsub that handles lvalue subroutines */
ae5c1e95 2625 cv = GvCV(gv_HVadd(gv_fetchpvs("DB::lsub", GV_ADDMULTI, SVt_PVHV)));
1ad62f64 2626 /* if lsub not found then fall back to DB::sub */
2627 if (!cv) cv = GvCV(PL_DBsub);
2628 } else {
2629 cv = GvCV(PL_DBsub);
2630 }
a9ef256d 2631
ccafdc96
RGS
2632 if (!cv || (!CvXSUB(cv) && !CvSTART(cv)))
2633 DIE(aTHX_ "No DB::sub routine defined");
67caa1fe 2634 }
a0d0e21e 2635
aed2304a 2636 if (!(CvISXSUB(cv))) {
f1025168 2637 /* This path taken at least 75% of the time */
a0d0e21e 2638 dMARK;
de935cc9 2639 SSize_t items = SP - MARK;
b70d5558 2640 PADLIST * const padlist = CvPADLIST(cv);
a0d0e21e
LW
2641 PUSHBLOCK(cx, CXt_SUB, MARK);
2642 PUSHSUB(cx);
f39bc417 2643 cx->blk_sub.retop = PL_op->op_next;
a0d0e21e 2644 CvDEPTH(cv)++;
3a76ca88
RGS
2645 if (CvDEPTH(cv) >= 2) {
2646 PERL_STACK_OVERFLOW_CHECK();
2647 pad_push(padlist, CvDEPTH(cv));
a0d0e21e 2648 }
3a76ca88
RGS
2649 SAVECOMPPAD();
2650 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2651 if (hasargs) {
10533ace 2652 AV *const av = MUTABLE_AV(PAD_SVl(0));
221373f0
GS
2653 if (AvREAL(av)) {
2654 /* @_ is normally not REAL--this should only ever
2655 * happen when DB::sub() calls things that modify @_ */
2656 av_clear(av);
2657 AvREAL_off(av);
2658 AvREIFY_on(av);
2659 }
3280af22 2660 cx->blk_sub.savearray = GvAV(PL_defgv);
502c6561 2661 GvAV(PL_defgv) = MUTABLE_AV(SvREFCNT_inc_simple(av));
dd2155a4 2662 CX_CURPAD_SAVE(cx->blk_sub);
6d4ff0d2 2663 cx->blk_sub.argarray = av;
a0d0e21e
LW
2664 ++MARK;
2665
77d27ef6
SF
2666 if (items - 1 > AvMAX(av)) {
2667 SV **ary = AvALLOC(av);
2668 AvMAX(av) = items - 1;
2669 Renew(ary, items, SV*);
2670 AvALLOC(av) = ary;
2671 AvARRAY(av) = ary;
2672 }
2673
a0d0e21e 2674 Copy(MARK,AvARRAY(av),items,SV*);
93965878 2675 AvFILLp(av) = items - 1;
1c846c1f 2676
b479c9f2 2677 MARK = AvARRAY(av);
a0d0e21e
LW
2678 while (items--) {
2679 if (*MARK)
b479c9f2
FC
2680 {
2681 if (SvPADTMP(*MARK) && !IS_PADGV(*MARK))
2682 *MARK = sv_mortalcopy(*MARK);
a0d0e21e 2683 SvTEMP_off(*MARK);
b479c9f2 2684 }
a0d0e21e
LW
2685 MARK++;
2686 }
2687 }
b479c9f2 2688 SAVETMPS;
da1dff94
FC
2689 if ((cx->blk_u16 & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO &&
2690 !CvLVALUE(cv))
2691 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
4a925ff6
GS
2692 /* warning must come *after* we fully set up the context
2693 * stuff so that __WARN__ handlers can safely dounwind()
2694 * if they want to
2695 */
2b9dff67 2696 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION)
4a925ff6
GS
2697 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2698 sub_crush_depth(cv);
a0d0e21e
LW
2699 RETURNOP(CvSTART(cv));
2700 }
f1025168 2701 else {
de935cc9 2702 SSize_t markix = TOPMARK;
f1025168 2703
b479c9f2 2704 SAVETMPS;
3a76ca88 2705 PUTBACK;
f1025168 2706
4587c532
FC
2707 if (((PL_op->op_private
2708 & PUSHSUB_GET_LVALUE_MASK(Perl_is_lvalue_sub)
2709 ) & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO &&
2710 !CvLVALUE(cv))
2711 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2712
8c9d3376 2713 if (!hasargs && GvAV(PL_defgv)) {
3a76ca88
RGS
2714 /* Need to copy @_ to stack. Alternative may be to
2715 * switch stack to @_, and copy return values
2716 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2717 AV * const av = GvAV(PL_defgv);
de935cc9 2718 const SSize_t items = AvFILLp(av) + 1; /* @_ is not tieable */
3a76ca88
RGS
2719
2720 if (items) {
dd2a7f90 2721 SSize_t i = 0;
3a76ca88
RGS
2722 /* Mark is at the end of the stack. */
2723 EXTEND(SP, items);
dd2a7f90
FC
2724 for (; i < items; ++i)
2725 if (AvARRAY(av)[i]) SP[i+1] = AvARRAY(av)[i];
2726 else {
199f858d 2727 SP[i+1] = newSVavdefelem(av, i, 1);
dd2a7f90 2728 }
3a76ca88
RGS
2729 SP += items;
2730 PUTBACK ;
2731 }
2732 }
3455055f
FC
2733 else {
2734 SV **mark = PL_stack_base + markix;
de935cc9 2735 SSize_t items = SP - mark;
3455055f
FC
2736 while (items--) {
2737 mark++;
2738 if (*mark && SvPADTMP(*mark) && !IS_PADGV(*mark))
2739 *mark = sv_mortalcopy(*mark);
2740 }
2741 }
3a76ca88
RGS
2742 /* We assume first XSUB in &DB::sub is the called one. */
2743 if (PL_curcopdb) {
2744 SAVEVPTR(PL_curcop);
2745 PL_curcop = PL_curcopdb;
2746 PL_curcopdb = NULL;
2747 }
2748 /* Do we need to open block here? XXXX */
72df79cf 2749
2750 /* CvXSUB(cv) must not be NULL because newXS() refuses NULL xsub address */
2751 assert(CvXSUB(cv));
16c91539 2752 CvXSUB(cv)(aTHX_ cv);
3a76ca88
RGS
2753
2754 /* Enforce some sanity in scalar context. */
2755 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2756 if (markix > PL_stack_sp - PL_stack_base)
2757 *(PL_stack_base + markix) = &PL_sv_undef;
2758 else
2759 *(PL_stack_base + markix) = *PL_stack_sp;
2760 PL_stack_sp = PL_stack_base + markix;
2761 }
a57c6685 2762 LEAVE;
f1025168
NC
2763 return NORMAL;
2764 }
a0d0e21e
LW
2765}
2766
44a8e56a 2767void
864dbfa3 2768Perl_sub_crush_depth(pTHX_ CV *cv)
44a8e56a 2769{
7918f24d
NC
2770 PERL_ARGS_ASSERT_SUB_CRUSH_DEPTH;
2771
44a8e56a 2772 if (CvANON(cv))
9014280d 2773 Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on anonymous subroutine");
44a8e56a 2774 else {
07b2687d
LM
2775 HEK *const hek = CvNAME_HEK(cv);
2776 SV *tmpstr;
2777 if (hek) {
2778 tmpstr = sv_2mortal(newSVhek(hek));
2779 }
2780 else {
2781 tmpstr = sv_newmortal();
2782 gv_efullname3(tmpstr, CvGV(cv), NULL);
2783 }
35c1215d 2784 Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on subroutine \"%"SVf"\"",
be2597df 2785 SVfARG(tmpstr));
44a8e56a
PP
2786 }
2787}
2788
a0d0e21e
LW
2789PP(pp_aelem)
2790{
97aff369 2791 dVAR; dSP;
a0d0e21e 2792 SV** svp;
a3b680e6 2793 SV* const elemsv = POPs;
d804643f 2794 IV elem = SvIV(elemsv);
502c6561 2795 AV *const av = MUTABLE_AV(POPs);
e1ec3a88 2796 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
bbfdc870 2797 const U32 defer = PL_op->op_private & OPpLVAL_DEFER;
4ad10a0b
VP
2798 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
2799 bool preeminent = TRUE;
be6c24e0 2800 SV *sv;
a0d0e21e 2801
e35c1634 2802 if (SvROK(elemsv) && !SvGAMAGIC(elemsv) && ckWARN(WARN_MISC))
95b63a38
JH
2803 Perl_warner(aTHX_ packWARN(WARN_MISC),
2804 "Use of reference \"%"SVf"\" as array index",
be2597df 2805 SVfARG(elemsv));
a0d0e21e
LW
2806 if (SvTYPE(av) != SVt_PVAV)
2807 RETPUSHUNDEF;
4ad10a0b
VP
2808
2809 if (localizing) {
2810 MAGIC *mg;
2811 HV *stash;
2812
2813 /* If we can determine whether the element exist,
2814 * Try to preserve the existenceness of a tied array
2815 * element by using EXISTS and DELETE if possible.
2816 * Fallback to FETCH and STORE otherwise. */
2817 if (SvCANEXISTDELETE(av))
2818 preeminent = av_exists(av, elem);
2819 }
2820
68dc0745 2821 svp = av_fetch(av, elem, lval && !defer);
a0d0e21e 2822 if (lval) {
2b573ace 2823#ifdef PERL_MALLOC_WRAP
2b573ace 2824 if (SvUOK(elemsv)) {
a9c4fd4e 2825 const UV uv = SvUV(elemsv);
2b573ace
JH
2826 elem = uv > IV_MAX ? IV_MAX : uv;
2827 }
2828 else if (SvNOK(elemsv))
2829 elem = (IV)SvNV(elemsv);
a3b680e6
AL
2830 if (elem > 0) {
2831 static const char oom_array_extend[] =
2832 "Out of memory during array extend"; /* Duplicated in av.c */
2b573ace 2833 MEM_WRAP_CHECK_1(elem,SV*,oom_array_extend);
a3b680e6 2834 }
2b573ace 2835#endif
ce0d59fd 2836 if (!svp || !*svp) {
bbfdc870 2837 IV len;
68dc0745 2838 if (!defer)
cea2e8a9 2839 DIE(aTHX_ PL_no_aelem, elem);
bbfdc870 2840 len = av_len(av);
199f858d 2841 mPUSHs(newSVavdefelem(av,
bbfdc870
FC
2842 /* Resolve a negative index now, unless it points before the
2843 beginning of the array, in which case record it for error
2844 reporting in magic_setdefelem. */
199f858d
FC
2845 elem < 0 && len + elem >= 0 ? len + elem : elem,
2846 1));
68dc0745
PP
2847 RETURN;
2848 }
4ad10a0b
VP
2849 if (localizing) {
2850 if (preeminent)
2851 save_aelem(av, elem, svp);
2852 else
2853 SAVEADELETE(av, elem);
2854 }
9026059d
GG
2855 else if (PL_op->op_private & OPpDEREF) {
2856 PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF));
2857 RETURN;
2858 }
a0d0e21e 2859 }
3280af22 2860 sv = (svp ? *svp : &PL_sv_undef);
39cf747a 2861 if (!lval && SvRMAGICAL(av) && SvGMAGICAL(sv)) /* see note in pp_helem() */
fd69380d 2862 mg_get(sv);
be6c24e0 2863 PUSHs(sv);
a0d0e21e
LW
2864 RETURN;
2865}
2866
9026059d 2867SV*
864dbfa3 2868Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
02a9e968 2869{
7918f24d
NC
2870 PERL_ARGS_ASSERT_VIVIFY_REF;
2871
5b295bef 2872 SvGETMAGIC(sv);
02a9e968
CS
2873 if (!SvOK(sv)) {
2874 if (SvREADONLY(sv))
cb077ed2 2875 Perl_croak_no_modify();
43230e26 2876 prepare_SV_for_RV(sv);
68dc0745 2877 switch (to_what) {
5f05dabc 2878 case OPpDEREF_SV:
561b68a9 2879 SvRV_set(sv, newSV(0));
5f05dabc
PP
2880 break;
2881 case OPpDEREF_AV:
ad64d0ec 2882 SvRV_set(sv, MUTABLE_SV(newAV()));
5f05dabc
PP
2883 break;
2884 case OPpDEREF_HV:
ad64d0ec 2885 SvRV_set(sv, MUTABLE_SV(newHV()));
5f05dabc
PP
2886 break;
2887 }
02a9e968
CS
2888 SvROK_on(sv);
2889 SvSETMAGIC(sv);
7e482323 2890 SvGETMAGIC(sv);
02a9e968 2891 }
9026059d
GG
2892 if (SvGMAGICAL(sv)) {
2893 /* copy the sv without magic to prevent magic from being
2894 executed twice */
2895 SV* msv = sv_newmortal();
2896 sv_setsv_nomg(msv, sv);
2897 return msv;
2898 }
2899 return sv;
02a9e968
CS
2900}
2901
a0d0e21e
LW
2902PP(pp_method)
2903{
97aff369 2904 dVAR; dSP;
890ce7af 2905 SV* const sv = TOPs;
f5d5a27c
CS
2906
2907 if (SvROK(sv)) {
890ce7af 2908 SV* const rsv = SvRV(sv);
f5d5a27c
CS
2909 if (SvTYPE(rsv) == SVt_PVCV) {
2910 SETs(rsv);
2911 RETURN;
2912 }
2913 }
2914
4608196e 2915 SETs(method_common(sv, NULL));
f5d5a27c
CS
2916 RETURN;
2917}
2918
2919PP(pp_method_named)
2920{
97aff369 2921 dVAR; dSP;
890ce7af 2922 SV* const sv = cSVOP_sv;
c158a4fd 2923 U32 hash = SvSHARED_HASH(sv);
f5d5a27c
CS
2924
2925 XPUSHs(method_common(sv, &hash));
2926 RETURN;
2927}
2928
2929STATIC SV *
2930S_method_common(pTHX_ SV* meth, U32* hashp)
2931{
97aff369 2932 dVAR;
a0d0e21e
LW
2933 SV* ob;
2934 GV* gv;
56304f61 2935 HV* stash;
a0714e2c 2936 SV *packsv = NULL;
f226e9be
FC
2937 SV * const sv = PL_stack_base + TOPMARK == PL_stack_sp
2938 ? (Perl_croak(aTHX_ "Can't call method \"%"SVf"\" without a "
2939 "package or object reference", SVfARG(meth)),
2940 (SV *)NULL)
2941 : *(PL_stack_base + TOPMARK + 1);
f5d5a27c 2942
7918f24d
NC
2943 PERL_ARGS_ASSERT_METHOD_COMMON;
2944
4f1b7578 2945 if (!sv)
7156e69a 2946 undefined:
a214957f
VP
2947 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" on an undefined value",
2948 SVfARG(meth));
4f1b7578 2949
5b295bef 2950 SvGETMAGIC(sv);
a0d0e21e 2951 if (SvROK(sv))
ad64d0ec 2952 ob = MUTABLE_SV(SvRV(sv));
7156e69a 2953 else if (!SvOK(sv)) goto undefined;
a77c16f7
FC
2954 else if (isGV_with_GP(sv)) {
2955 if (!GvIO(sv))
2956 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" "
2957 "without a package or object reference",
2958 SVfARG(meth));
2959 ob = sv;
2960 if (SvTYPE(ob) == SVt_PVLV && LvTYPE(ob) == 'y') {
2961 assert(!LvTARGLEN(ob));
2962 ob = LvTARG(ob);
2963 assert(ob);
2964 }
2965 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV(ob));
2966 }
a0d0e21e 2967 else {
89269094 2968 /* this isn't a reference */
a0d0e21e 2969 GV* iogv;
f937af42 2970 STRLEN packlen;
89269094 2971 const char * const packname = SvPV_nomg_const(sv, packlen);
b3ebc221 2972 const bool packname_is_utf8 = !!SvUTF8(sv);
89269094 2973 const HE* const he =
b3ebc221
NC
2974 (const HE *)hv_common(
2975 PL_stashcache, NULL, packname, packlen,
2976 packname_is_utf8 ? HVhek_UTF8 : 0, 0, NULL, 0
da6b625f
FC
2977 );
2978
89269094 2979 if (he) {
5e6396ae 2980 stash = INT2PTR(HV*,SvIV(HeVAL(he)));
103f5a36
NC
2981 DEBUG_o(Perl_deb(aTHX_ "PL_stashcache hit %p for '%"SVf"'\n",
2982 stash, sv));
081fc587 2983 goto fetch;
081fc587
AB
2984 }
2985
89269094 2986 if (!(iogv = gv_fetchpvn_flags(
da6b625f
FC
2987 packname, packlen, SVf_UTF8 * packname_is_utf8, SVt_PVIO
2988 )) ||
ad64d0ec 2989 !(ob=MUTABLE_SV(GvIO(iogv))))
a0d0e21e 2990 {
af09ea45 2991 /* this isn't the name of a filehandle either */
89269094 2992 if (!packlen)
834a4ddd 2993 {
7156e69a
FC
2994 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" "
2995 "without a package or object reference",
2996 SVfARG(meth));
834a4ddd 2997 }
af09ea45 2998 /* assume it's a package name */
f937af42 2999 stash = gv_stashpvn(packname, packlen, packname_is_utf8 ? SVf_UTF8 : 0);
0dae17bd
GS
3000 if (!stash)
3001 packsv = sv;
081fc587 3002 else {
d4c19fe8 3003 SV* const ref = newSViv(PTR2IV(stash));
f937af42 3004 (void)hv_store(PL_stashcache, packname,
c60dbbc3 3005 packname_is_utf8 ? -(I32)packlen : (I32)packlen, ref, 0);
103f5a36
NC
3006 DEBUG_o(Perl_deb(aTHX_ "PL_stashcache caching %p for '%"SVf"'\n",
3007 stash, sv));
7e8961ec 3008 }
ac91690f 3009 goto fetch;
a0d0e21e 3010 }
af09ea45 3011 /* it _is_ a filehandle name -- replace with a reference */
ad64d0ec 3012 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV(MUTABLE_SV(iogv)));
a0d0e21e
LW
3013 }
3014
1f3ffe4c 3015 /* if we got here, ob should be an object or a glob */
f0d43078 3016 if (!ob || !(SvOBJECT(ob)
a77c16f7 3017 || (isGV_with_GP(ob)
159b6efe 3018 && (ob = MUTABLE_SV(GvIO((const GV *)ob)))
f0d43078
GS
3019 && SvOBJECT(ob))))
3020 {
b375e37b
BF
3021 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" on unblessed reference",
3022 SVfARG((SvSCREAM(meth) && strEQ(SvPV_nolen_const(meth),"isa"))
3023 ? newSVpvs_flags("DOES", SVs_TEMP)
3024 : meth));
f0d43078 3025 }
a0d0e21e 3026
56304f61 3027 stash = SvSTASH(ob);
a0d0e21e 3028
ac91690f 3029 fetch:
af09ea45
IK
3030 /* NOTE: stash may be null, hope hv_fetch_ent and
3031 gv_fetchmethod can cope (it seems they can) */
3032
f5d5a27c
CS
3033 /* shortcut for simple names */
3034 if (hashp) {
b464bac0 3035 const HE* const he = hv_fetch_ent(stash, meth, 0, *hashp);
f5d5a27c 3036 if (he) {
159b6efe 3037 gv = MUTABLE_GV(HeVAL(he));
f5d5a27c 3038 if (isGV(gv) && GvCV(gv) &&
e1a479c5 3039 (!GvCVGEN(gv) || GvCVGEN(gv)
dd69841b 3040 == (PL_sub_generation + HvMROMETA(stash)->cache_gen)))
ad64d0ec 3041 return MUTABLE_SV(GvCV(gv));
f5d5a27c
CS
3042 }
3043 }
3044
f937af42
BF
3045 gv = gv_fetchmethod_sv_flags(stash ? stash : MUTABLE_HV(packsv),
3046 meth, GV_AUTOLOAD | GV_CROAK);
9b9d0b15 3047
256d1bb2 3048 assert(gv);
9b9d0b15 3049
ad64d0ec 3050 return isGV(gv) ? MUTABLE_SV(GvCV(gv)) : MUTABLE_SV(gv);
a0d0e21e 3051}
241d1a3b
NC
3052
3053/*
3054 * Local variables:
3055 * c-indentation-style: bsd
3056 * c-basic-offset: 4
14d04a33 3057 * indent-tabs-mode: nil
241d1a3b
NC
3058 * End:
3059 *
14d04a33 3060 * ex: set ts=8 sts=4 sw=4 et:
37442d52 3061 */