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