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