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