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