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