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
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.
12 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
15 * Awake! Awake! Fear, Fire, Foes! Awake!
18 * [p.1007 of _The Lord of the Rings_, VI/viii: "The Scouring of the Shire"]
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.
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
35 #define PERL_IN_PP_HOT_C
51 PL_curcop = (COP*)PL_op;
52 TAINT_NOT; /* Each statement is presumed innocent */
53 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
64 if (PL_op->op_private & OPpLVAL_INTRO)
65 PUSHs(save_scalar(cGVOP_gv));
67 PUSHs(GvSVn(cGVOP_gv));
77 /* This is sometimes called directly by pp_coreargs and pp_grepstart. */
81 PUSHMARK(PL_stack_sp);
92 /* no PUTBACK, SETs doesn't inc/dec SP */
99 XPUSHs(MUTABLE_SV(cGVOP_gv));
108 /* SP is not used to remove a variable that is saved across the
109 sv_2bool_flags call in SvTRUE_NN, if a RISC/CISC or low/high machine
110 register or load/store vs direct mem ops macro is introduced, this
111 should be a define block between direct PL_stack_sp and dSP operations,
112 presently, using PL_stack_sp is bias towards CISC cpus */
113 SV * const sv = *PL_stack_sp;
117 if (PL_op->op_type == OP_AND)
119 return cLOGOP->op_other;
127 /* sassign keeps its args in the optree traditionally backwards.
128 So we pop them differently.
130 SV *left = POPs; SV *right = TOPs;
132 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
133 SV * const temp = left;
134 left = right; right = temp;
136 if (TAINTING_get && TAINT_get && !SvTAINTED(right))
138 if (PL_op->op_private & OPpASSIGN_CV_TO_GV) {
139 SV * const cv = SvRV(right);
140 const U32 cv_type = SvTYPE(cv);
141 const bool is_gv = isGV_with_GP(left);
142 const bool got_coderef = cv_type == SVt_PVCV || cv_type == SVt_PVFM;
148 /* Can do the optimisation if left (LVALUE) is not a typeglob,
149 right (RVALUE) is a reference to something, and we're in void
151 if (!got_coderef && !is_gv && GIMME_V == G_VOID) {
152 /* Is the target symbol table currently empty? */
153 GV * const gv = gv_fetchsv_nomg(left, GV_NOINIT, SVt_PVGV);
154 if (SvTYPE(gv) != SVt_PVGV && !SvOK(gv)) {
155 /* Good. Create a new proxy constant subroutine in the target.
156 The gv becomes a(nother) reference to the constant. */
157 SV *const value = SvRV(cv);
159 SvUPGRADE(MUTABLE_SV(gv), SVt_IV);
160 SvPCS_IMPORTED_on(gv);
162 SvREFCNT_inc_simple_void(value);
168 /* Need to fix things up. */
170 /* Need to fix GV. */
171 left = MUTABLE_SV(gv_fetchsv_nomg(left,GV_ADD, SVt_PVGV));
175 /* We've been returned a constant rather than a full subroutine,
176 but they expect a subroutine reference to apply. */
178 ENTER_with_name("sassign_coderef");
179 SvREFCNT_inc_void(SvRV(cv));
180 /* newCONSTSUB takes a reference count on the passed in SV
181 from us. We set the name to NULL, otherwise we get into
182 all sorts of fun as the reference to our new sub is
183 donated to the GV that we're about to assign to.
185 SvRV_set(right, MUTABLE_SV(newCONSTSUB(GvSTASH(left), NULL,
188 LEAVE_with_name("sassign_coderef");
190 /* What can happen for the corner case *{"BONK"} = \&{"BONK"};
192 First: ops for \&{"BONK"}; return us the constant in the
194 Second: ops for *{"BONK"} cause that symbol table entry
195 (and our reference to it) to be upgraded from RV
197 Thirdly: We get here. cv is actually PVGV now, and its
198 GvCV() is actually the subroutine we're looking for
200 So change the reference so that it points to the subroutine
201 of that typeglob, as that's what they were after all along.
203 GV *const upgraded = MUTABLE_GV(cv);
204 CV *const source = GvCV(upgraded);
207 assert(CvFLAGS(source) & CVf_CONST);
209 SvREFCNT_inc_void(source);
210 SvREFCNT_dec_NN(upgraded);
211 SvRV_set(right, MUTABLE_SV(source));
217 SvTEMP(left) && !SvSMAGICAL(left) && SvREFCNT(left) == 1 &&
218 (!isGV_with_GP(left) || SvFAKE(left)) && ckWARN(WARN_MISC)
221 packWARN(WARN_MISC), "Useless assignment to a temporary"
223 SvSetMagicSV(left, right);
233 RETURNOP(cLOGOP->op_other);
235 RETURNOP(cLOGOP->op_next);
242 TAINT_NOT; /* Each statement is presumed innocent */
243 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
245 if (!(PL_op->op_flags & OPf_SPECIAL)) {
246 I32 oldsave = PL_scopestack[PL_scopestack_ix - 1];
247 LEAVE_SCOPE(oldsave);
254 dVAR; dSP; dATARGET; tryAMAGICbin_MG(concat_amg, AMGf_assign);
259 const char *rpv = NULL;
261 bool rcopied = FALSE;
263 if (TARG == right && right != left) { /* $r = $l.$r */
264 rpv = SvPV_nomg_const(right, rlen);
265 rbyte = !DO_UTF8(right);
266 right = newSVpvn_flags(rpv, rlen, SVs_TEMP);
267 rpv = SvPV_const(right, rlen); /* no point setting UTF-8 here */
271 if (TARG != left) { /* not $l .= $r */
273 const char* const lpv = SvPV_nomg_const(left, llen);
274 lbyte = !DO_UTF8(left);
275 sv_setpvn(TARG, lpv, llen);
281 else { /* $l .= $r */
283 if (left == right && ckWARN(WARN_UNINITIALIZED)) /* $l .= $l */
284 report_uninit(right);
287 SvPV_force_nomg_nolen(left);
288 lbyte = !DO_UTF8(left);
295 /* $r.$r: do magic twice: tied might return different 2nd time */
297 rpv = SvPV_nomg_const(right, rlen);
298 rbyte = !DO_UTF8(right);
300 if (lbyte != rbyte) {
301 /* sv_utf8_upgrade_nomg() may reallocate the stack */
304 sv_utf8_upgrade_nomg(TARG);
307 right = newSVpvn_flags(rpv, rlen, SVs_TEMP);
308 sv_utf8_upgrade_nomg(right);
309 rpv = SvPV_nomg_const(right, rlen);
313 sv_catpvn_nomg(TARG, rpv, rlen);
320 /* push the elements of av onto the stack.
321 * XXX Note that padav has similar code but without the mg_get().
322 * I suspect that the mg_get is no longer needed, but while padav
323 * differs, it can't share this function */
326 S_pushav(pTHX_ AV* const av)
329 const SSize_t maxarg = AvFILL(av) + 1;
331 if (SvRMAGICAL(av)) {
333 for (i=0; i < (PADOFFSET)maxarg; i++) {
334 SV ** const svp = av_fetch(av, i, FALSE);
335 /* See note in pp_helem, and bug id #27839 */
337 ? SvGMAGICAL(*svp) ? (mg_get(*svp), *svp) : *svp
343 for (i=0; i < (PADOFFSET)maxarg; i++) {
344 SV * const sv = AvARRAY(av)[i];
345 SP[i+1] = sv ? sv : &PL_sv_undef;
353 /* ($lex1,@lex2,...) or my ($lex1,@lex2,...) */
358 PADOFFSET base = PL_op->op_targ;
359 int count = (int)(PL_op->op_private) & OPpPADRANGE_COUNTMASK;
361 if (PL_op->op_flags & OPf_SPECIAL) {
362 /* fake the RHS of my ($x,$y,..) = @_ */
364 S_pushav(aTHX_ GvAVn(PL_defgv));
368 /* note, this is only skipped for compile-time-known void cxt */
369 if ((PL_op->op_flags & OPf_WANT) != OPf_WANT_VOID) {
372 for (i = 0; i <count; i++)
373 *++SP = PAD_SV(base+i);
375 if (PL_op->op_private & OPpLVAL_INTRO) {
376 SV **svp = &(PAD_SVl(base));
377 const UV payload = (UV)(
378 (base << (OPpPADRANGE_COUNTSHIFT + SAVE_TIGHT_SHIFT))
379 | (count << SAVE_TIGHT_SHIFT)
380 | SAVEt_CLEARPADRANGE);
381 assert(OPpPADRANGE_COUNTMASK + 1 == (1 <<OPpPADRANGE_COUNTSHIFT));
382 assert((payload >> (OPpPADRANGE_COUNTSHIFT+SAVE_TIGHT_SHIFT)) == base);
389 for (i = 0; i <count; i++)
390 SvPADSTALE_off(*svp++); /* mark lexical as active */
401 OP * const op = PL_op;
402 /* access PL_curpad once */
403 SV ** const padentry = &(PAD_SVl(op->op_targ));
408 PUTBACK; /* no pop/push after this, TOPs ok */
410 if (op->op_flags & OPf_MOD) {
411 if (op->op_private & OPpLVAL_INTRO)
412 if (!(op->op_private & OPpPAD_STATE))
413 save_clearsv(padentry);
414 if (op->op_private & OPpDEREF) {
415 /* TOPs is equivalent to TARG here. Using TOPs (SP) rather
416 than TARG reduces the scope of TARG, so it does not
417 span the call to save_clearsv, resulting in smaller
419 TOPs = vivify_ref(TOPs, op->op_private & OPpDEREF);
432 tryAMAGICunTARGETlist(iter_amg, 0);
433 PL_last_in_gv = MUTABLE_GV(*PL_stack_sp--);
435 else PL_last_in_gv = PL_argvgv, PL_stack_sp--;
436 if (!isGV_with_GP(PL_last_in_gv)) {
437 if (SvROK(PL_last_in_gv) && isGV_with_GP(SvRV(PL_last_in_gv)))
438 PL_last_in_gv = MUTABLE_GV(SvRV(PL_last_in_gv));
441 XPUSHs(MUTABLE_SV(PL_last_in_gv));
444 PL_last_in_gv = MUTABLE_GV(*PL_stack_sp--);
447 return do_readline();
455 tryAMAGICbin_MG(eq_amg, AMGf_set|AMGf_numeric);
459 (SvIOK_notUV(left) && SvIOK_notUV(right))
460 ? (SvIVX(left) == SvIVX(right))
461 : ( do_ncmp(left, right) == 0)
470 PL_op->op_type == OP_PREINC || PL_op->op_type == OP_I_PREINC;
471 if (SvTYPE(TOPs) >= SVt_PVAV || (isGV_with_GP(TOPs) && !SvFAKE(TOPs)))
472 Perl_croak_no_modify();
473 if (!SvREADONLY(TOPs) && !SvGMAGICAL(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
474 && SvIVX(TOPs) != (inc ? IV_MAX : IV_MIN))
476 SvIV_set(TOPs, SvIVX(TOPs) + (inc ? 1 : -1));
477 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
479 else /* Do all the PERL_PRESERVE_IVUV conditionals in sv_inc */
480 if (inc) sv_inc(TOPs);
493 if (PL_op->op_type == OP_OR)
495 RETURNOP(cLOGOP->op_other);
504 const int op_type = PL_op->op_type;
505 const bool is_dor = (op_type == OP_DOR || op_type == OP_DORASSIGN);
510 if (!sv || !SvANY(sv)) {
511 if (op_type == OP_DOR)
513 RETURNOP(cLOGOP->op_other);
519 if (!sv || !SvANY(sv))
524 switch (SvTYPE(sv)) {
526 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
530 if (HvARRAY(sv) || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
534 if (CvROOT(sv) || CvXSUB(sv))
547 if(op_type == OP_DOR)
549 RETURNOP(cLOGOP->op_other);
551 /* assuming OP_DEFINED */
559 dVAR; dSP; dATARGET; bool useleft; SV *svl, *svr;
560 tryAMAGICbin_MG(add_amg, AMGf_assign|AMGf_numeric);
564 useleft = USE_LEFT(svl);
565 #ifdef PERL_PRESERVE_IVUV
566 /* We must see if we can perform the addition with integers if possible,
567 as the integer code detects overflow while the NV code doesn't.
568 If either argument hasn't had a numeric conversion yet attempt to get
569 the IV. It's important to do this now, rather than just assuming that
570 it's not IOK as a PV of "9223372036854775806" may not take well to NV
571 addition, and an SV which is NOK, NV=6.0 ought to be coerced to
572 integer in case the second argument is IV=9223372036854775806
573 We can (now) rely on sv_2iv to do the right thing, only setting the
574 public IOK flag if the value in the NV (or PV) slot is truly integer.
576 A side effect is that this also aggressively prefers integer maths over
577 fp maths for integer values.
579 How to detect overflow?
581 C 99 section 6.2.6.1 says
583 The range of nonnegative values of a signed integer type is a subrange
584 of the corresponding unsigned integer type, and the representation of
585 the same value in each type is the same. A computation involving
586 unsigned operands can never overflow, because a result that cannot be
587 represented by the resulting unsigned integer type is reduced modulo
588 the number that is one greater than the largest value that can be
589 represented by the resulting type.
593 which I read as "unsigned ints wrap."
595 signed integer overflow seems to be classed as "exception condition"
597 If an exceptional condition occurs during the evaluation of an
598 expression (that is, if the result is not mathematically defined or not
599 in the range of representable values for its type), the behavior is
602 (6.5, the 5th paragraph)
604 I had assumed that on 2s complement machines signed arithmetic would
605 wrap, hence coded pp_add and pp_subtract on the assumption that
606 everything perl builds on would be happy. After much wailing and
607 gnashing of teeth it would seem that irix64 knows its ANSI spec well,
608 knows that it doesn't need to, and doesn't. Bah. Anyway, the all-
609 unsigned code below is actually shorter than the old code. :-)
612 if (SvIV_please_nomg(svr)) {
613 /* Unless the left argument is integer in range we are going to have to
614 use NV maths. Hence only attempt to coerce the right argument if
615 we know the left is integer. */
623 /* left operand is undef, treat as zero. + 0 is identity,
624 Could SETi or SETu right now, but space optimise by not adding
625 lots of code to speed up what is probably a rarish case. */
627 /* Left operand is defined, so is it IV? */
628 if (SvIV_please_nomg(svl)) {
629 if ((auvok = SvUOK(svl)))
632 const IV aiv = SvIVX(svl);
635 auvok = 1; /* Now acting as a sign flag. */
636 } else { /* 2s complement assumption for IV_MIN */
644 bool result_good = 0;
647 bool buvok = SvUOK(svr);
652 const IV biv = SvIVX(svr);
659 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
660 else "IV" now, independent of how it came in.
661 if a, b represents positive, A, B negative, a maps to -A etc
666 all UV maths. negate result if A negative.
667 add if signs same, subtract if signs differ. */
673 /* Must get smaller */
679 /* result really should be -(auv-buv). as its negation
680 of true value, need to swap our result flag */
697 if (result <= (UV)IV_MIN)
700 /* result valid, but out of range for IV. */
705 } /* Overflow, drop through to NVs. */
710 NV value = SvNV_nomg(svr);
713 /* left operand is undef, treat as zero. + 0.0 is identity. */
717 SETn( value + SvNV_nomg(svl) );
725 AV * const av = PL_op->op_type == OP_AELEMFAST_LEX
726 ? MUTABLE_AV(PAD_SV(PL_op->op_targ)) : GvAVn(cGVOP_gv);
727 const U32 lval = PL_op->op_flags & OPf_MOD;
728 SV** const svp = av_fetch(av, PL_op->op_private, lval);
729 SV *sv = (svp ? *svp : &PL_sv_undef);
731 if (!lval && SvRMAGICAL(av) && SvGMAGICAL(sv)) /* see note in pp_helem() */
739 dVAR; dSP; dMARK; dTARGET;
741 do_join(TARG, *MARK, MARK, SP);
752 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
753 * will be enough to hold an OP*.
755 SV* const sv = sv_newmortal();
756 sv_upgrade(sv, SVt_PVLV);
758 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
761 XPUSHs(MUTABLE_SV(PL_op));
766 /* Oversized hot code. */
770 dVAR; dSP; dMARK; dORIGMARK;
774 = (PL_op->op_flags & OPf_STACKED) ? MUTABLE_GV(*++MARK) : PL_defoutgv;
778 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
781 if (MARK == ORIGMARK) {
782 /* If using default handle then we need to make space to
783 * pass object as 1st arg, so move other args up ...
787 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
790 return Perl_tied_method(aTHX_ SV_CONST(PRINT), mark - 1, MUTABLE_SV(io),
792 (G_SCALAR | TIED_METHOD_ARGUMENTS_ON_STACK
793 | (PL_op->op_type == OP_SAY
794 ? TIED_METHOD_SAY : 0)), sp - mark);
797 if ( gv && GvEGVx(gv) && (io = GvIO(GvEGV(gv)))
798 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
801 SETERRNO(EBADF,RMS_IFI);
804 else if (!(fp = IoOFP(io))) {
806 report_wrongway_fh(gv, '<');
809 SETERRNO(EBADF,IoIFP(io)?RMS_FAC:RMS_IFI);
813 SV * const ofs = GvSV(PL_ofsgv); /* $, */
815 if (ofs && (SvGMAGICAL(ofs) || SvOK(ofs))) {
817 if (!do_print(*MARK, fp))
821 /* don't use 'ofs' here - it may be invalidated by magic callbacks */
822 if (!do_print(GvSV(PL_ofsgv), fp)) {
831 if (!do_print(*MARK, fp))
839 if (PL_op->op_type == OP_SAY) {
840 if (PerlIO_write(fp, "\n", 1) == 0 || PerlIO_error(fp))
843 else if (PL_ors_sv && SvOK(PL_ors_sv))
844 if (!do_print(PL_ors_sv, fp)) /* $\ */
847 if (IoFLAGS(io) & IOf_FLUSH)
848 if (PerlIO_flush(fp) == EOF)
858 XPUSHs(&PL_sv_undef);
865 const I32 gimme = GIMME_V;
866 static const char an_array[] = "an ARRAY";
867 static const char a_hash[] = "a HASH";
868 const bool is_pp_rv2av = PL_op->op_type == OP_RV2AV;
869 const svtype type = is_pp_rv2av ? SVt_PVAV : SVt_PVHV;
874 sv = amagic_deref_call(sv, is_pp_rv2av ? to_av_amg : to_hv_amg);
877 if (SvTYPE(sv) != type)
878 /* diag_listed_as: Not an ARRAY reference */
879 DIE(aTHX_ "Not %s reference", is_pp_rv2av ? an_array : a_hash);
880 else if (PL_op->op_flags & OPf_MOD
881 && PL_op->op_private & OPpLVAL_INTRO)
882 Perl_croak(aTHX_ "%s", PL_no_localize_ref);
884 else if (SvTYPE(sv) != type) {
887 if (!isGV_with_GP(sv)) {
888 gv = Perl_softref2xv(aTHX_ sv, is_pp_rv2av ? an_array : a_hash,
896 sv = is_pp_rv2av ? MUTABLE_SV(GvAVn(gv)) : MUTABLE_SV(GvHVn(gv));
897 if (PL_op->op_private & OPpLVAL_INTRO)
898 sv = is_pp_rv2av ? MUTABLE_SV(save_ary(gv)) : MUTABLE_SV(save_hash(gv));
900 if (PL_op->op_flags & OPf_REF) {
904 else if (PL_op->op_private & OPpMAYBE_LVSUB) {
905 const I32 flags = is_lvalue_sub();
906 if (flags && !(flags & OPpENTERSUB_INARGS)) {
907 if (gimme != G_ARRAY)
908 goto croak_cant_return;
915 AV *const av = MUTABLE_AV(sv);
916 /* The guts of pp_rv2av, with no intending change to preserve history
917 (until such time as we get tools that can do blame annotation across
918 whitespace changes. */
919 if (gimme == G_ARRAY) {
925 else if (gimme == G_SCALAR) {
927 const SSize_t maxarg = AvFILL(av) + 1;
931 /* The guts of pp_rv2hv */
932 if (gimme == G_ARRAY) { /* array wanted */
934 return Perl_do_kv(aTHX);
936 else if ((PL_op->op_private & OPpTRUEBOOL
937 || ( PL_op->op_private & OPpMAYBE_TRUEBOOL
938 && block_gimme() == G_VOID ))
939 && (!SvRMAGICAL(sv) || !mg_find(sv, PERL_MAGIC_tied)))
940 SETs(HvUSEDKEYS(sv) ? &PL_sv_yes : sv_2mortal(newSViv(0)));
941 else if (gimme == G_SCALAR) {
943 TARG = Perl_hv_scalar(aTHX_ MUTABLE_HV(sv));
950 Perl_croak(aTHX_ "Can't return %s to lvalue scalar context",
951 is_pp_rv2av ? "array" : "hash");
956 S_do_oddball(pTHX_ SV **oddkey, SV **firstkey)
960 PERL_ARGS_ASSERT_DO_ODDBALL;
963 if (ckWARN(WARN_MISC)) {
965 if (oddkey == firstkey &&
967 (SvTYPE(SvRV(*oddkey)) == SVt_PVAV ||
968 SvTYPE(SvRV(*oddkey)) == SVt_PVHV))
970 err = "Reference found where even-sized list expected";
973 err = "Odd number of elements in hash assignment";
974 Perl_warner(aTHX_ packWARN(WARN_MISC), "%s", err);
983 SV **lastlelem = PL_stack_sp;
984 SV **lastrelem = PL_stack_base + POPMARK;
985 SV **firstrelem = PL_stack_base + POPMARK + 1;
986 SV **firstlelem = lastrelem + 1;
1000 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
1002 if (gimme == G_ARRAY)
1003 lval = PL_op->op_flags & OPf_MOD || LVRET;
1005 /* If there's a common identifier on both sides we have to take
1006 * special care that assigning the identifier on the left doesn't
1007 * clobber a value on the right that's used later in the list.
1008 * Don't bother if LHS is just an empty hash or array.
1011 if ( (PL_op->op_private & OPpASSIGN_COMMON)
1013 firstlelem != lastlelem
1014 || ! ((sv = *firstlelem))
1016 || ! (SvTYPE(sv) == SVt_PVAV || SvTYPE(sv) == SVt_PVHV)
1017 || (SvTYPE(sv) == SVt_PVAV && AvFILL((AV*)sv) != -1)
1018 || (SvTYPE(sv) == SVt_PVHV && HvUSEDKEYS((HV*)sv) != 0)
1021 EXTEND_MORTAL(lastrelem - firstrelem + 1);
1022 for (relem = firstrelem; relem <= lastrelem; relem++) {
1023 if ((sv = *relem)) {
1024 TAINT_NOT; /* Each item is independent */
1026 /* Dear TODO test in t/op/sort.t, I love you.
1027 (It's relying on a panic, not a "semi-panic" from newSVsv()
1028 and then an assertion failure below.) */
1029 if (SvIS_FREED(sv)) {
1030 Perl_croak(aTHX_ "panic: attempt to copy freed scalar %p",
1033 /* Not newSVsv(), as it does not allow copy-on-write,
1034 resulting in wasteful copies. We need a second copy of
1035 a temp here, hence the SV_NOSTEAL. */
1036 *relem = sv_mortalcopy_flags(sv,SV_GMAGIC|SV_DO_COW_SVSETSV
1047 while (lelem <= lastlelem) {
1048 TAINT_NOT; /* Each item stands on its own, taintwise. */
1050 switch (SvTYPE(sv)) {
1052 ary = MUTABLE_AV(sv);
1053 magic = SvMAGICAL(ary) != 0;
1055 SAVEFREESV(SvREFCNT_inc_simple_NN(sv));
1057 av_extend(ary, lastrelem - relem);
1059 while (relem <= lastrelem) { /* gobble up all the rest */
1062 SvGETMAGIC(*relem); /* before newSV, in case it dies */
1064 sv_setsv_nomg(sv, *relem);
1066 didstore = av_store(ary,i++,sv);
1075 if (PL_delaymagic & DM_ARRAY_ISA)
1076 SvSETMAGIC(MUTABLE_SV(ary));
1079 case SVt_PVHV: { /* normal hash */
1083 SV** topelem = relem;
1084 SV **firsthashrelem = relem;
1086 hash = MUTABLE_HV(sv);
1087 magic = SvMAGICAL(hash) != 0;
1089 odd = ((lastrelem - firsthashrelem)&1)? 0 : 1;
1091 do_oddball(lastrelem, firsthashrelem);
1092 /* we have firstlelem to reuse, it's not needed anymore
1094 *(lastrelem+1) = &PL_sv_undef;
1098 SAVEFREESV(SvREFCNT_inc_simple_NN(sv));
1100 while (relem < lastrelem+odd) { /* gobble up all the rest */
1103 /* Copy the key if aassign is called in lvalue context,
1104 to avoid having the next op modify our rhs. Copy
1105 it also if it is gmagical, lest it make the
1106 hv_store_ent call below croak, leaking the value. */
1107 sv = lval || SvGMAGICAL(*relem)
1108 ? sv_mortalcopy(*relem)
1114 sv_setsv_nomg(tmpstr,*relem++); /* value */
1115 if (gimme == G_ARRAY) {
1116 if (hv_exists_ent(hash, sv, 0))
1117 /* key overwrites an existing entry */
1120 /* copy element back: possibly to an earlier
1121 * stack location if we encountered dups earlier,
1122 * possibly to a later stack location if odd */
1124 *topelem++ = tmpstr;
1127 didstore = hv_store_ent(hash,sv,tmpstr,0);
1129 if (!didstore) sv_2mortal(tmpstr);
1135 if (duplicates && gimme == G_ARRAY) {
1136 /* at this point we have removed the duplicate key/value
1137 * pairs from the stack, but the remaining values may be
1138 * wrong; i.e. with (a 1 a 2 b 3) on the stack we've removed
1139 * the (a 2), but the stack now probably contains
1140 * (a <freed> b 3), because { hv_save(a,1); hv_save(a,2) }
1141 * obliterates the earlier key. So refresh all values. */
1142 lastrelem -= duplicates;
1143 relem = firsthashrelem;
1144 while (relem < lastrelem+odd) {
1146 he = hv_fetch_ent(hash, *relem++, 0, 0);
1147 *relem++ = (he ? HeVAL(he) : &PL_sv_undef);
1150 if (odd && gimme == G_ARRAY) lastrelem++;
1154 if (SvIMMORTAL(sv)) {
1155 if (relem <= lastrelem)
1159 if (relem <= lastrelem) {
1161 SvTEMP(sv) && !SvSMAGICAL(sv) && SvREFCNT(sv) == 1 &&
1162 (!isGV_with_GP(sv) || SvFAKE(sv)) && ckWARN(WARN_MISC)
1165 packWARN(WARN_MISC),
1166 "Useless assignment to a temporary"
1168 sv_setsv(sv, *relem);
1172 sv_setsv(sv, &PL_sv_undef);
1177 if (PL_delaymagic & ~DM_DELAY) {
1179 /* Will be used to set PL_tainting below */
1180 Uid_t tmp_uid = PerlProc_getuid();
1181 Uid_t tmp_euid = PerlProc_geteuid();
1182 Gid_t tmp_gid = PerlProc_getgid();
1183 Gid_t tmp_egid = PerlProc_getegid();
1185 if (PL_delaymagic & DM_UID) {
1186 #ifdef HAS_SETRESUID
1187 rc = setresuid((PL_delaymagic & DM_RUID) ? PL_delaymagic_uid : (Uid_t)-1,
1188 (PL_delaymagic & DM_EUID) ? PL_delaymagic_euid : (Uid_t)-1,
1191 # ifdef HAS_SETREUID
1192 rc = setreuid((PL_delaymagic & DM_RUID) ? PL_delaymagic_uid : (Uid_t)-1,
1193 (PL_delaymagic & DM_EUID) ? PL_delaymagic_euid : (Uid_t)-1);
1196 if ((PL_delaymagic & DM_UID) == DM_RUID) {
1197 rc = setruid(PL_delaymagic_uid);
1198 PL_delaymagic &= ~DM_RUID;
1200 # endif /* HAS_SETRUID */
1202 if ((PL_delaymagic & DM_UID) == DM_EUID) {
1203 rc = seteuid(PL_delaymagic_euid);
1204 PL_delaymagic &= ~DM_EUID;
1206 # endif /* HAS_SETEUID */
1207 if (PL_delaymagic & DM_UID) {
1208 if (PL_delaymagic_uid != PL_delaymagic_euid)
1209 DIE(aTHX_ "No setreuid available");
1210 rc = PerlProc_setuid(PL_delaymagic_uid);
1212 # endif /* HAS_SETREUID */
1213 #endif /* HAS_SETRESUID */
1215 /* XXX $> et al currently silently ignore failures */
1216 PERL_UNUSED_VAR(rc);
1218 tmp_uid = PerlProc_getuid();
1219 tmp_euid = PerlProc_geteuid();
1221 if (PL_delaymagic & DM_GID) {
1222 #ifdef HAS_SETRESGID
1223 rc = setresgid((PL_delaymagic & DM_RGID) ? PL_delaymagic_gid : (Gid_t)-1,
1224 (PL_delaymagic & DM_EGID) ? PL_delaymagic_egid : (Gid_t)-1,
1227 # ifdef HAS_SETREGID
1228 rc = setregid((PL_delaymagic & DM_RGID) ? PL_delaymagic_gid : (Gid_t)-1,
1229 (PL_delaymagic & DM_EGID) ? PL_delaymagic_egid : (Gid_t)-1);
1232 if ((PL_delaymagic & DM_GID) == DM_RGID) {
1233 rc = setrgid(PL_delaymagic_gid);
1234 PL_delaymagic &= ~DM_RGID;
1236 # endif /* HAS_SETRGID */
1238 if ((PL_delaymagic & DM_GID) == DM_EGID) {
1239 rc = setegid(PL_delaymagic_egid);
1240 PL_delaymagic &= ~DM_EGID;
1242 # endif /* HAS_SETEGID */
1243 if (PL_delaymagic & DM_GID) {
1244 if (PL_delaymagic_gid != PL_delaymagic_egid)
1245 DIE(aTHX_ "No setregid available");
1246 rc = PerlProc_setgid(PL_delaymagic_gid);
1248 # endif /* HAS_SETREGID */
1249 #endif /* HAS_SETRESGID */
1251 /* XXX $> et al currently silently ignore failures */
1252 PERL_UNUSED_VAR(rc);
1254 tmp_gid = PerlProc_getgid();
1255 tmp_egid = PerlProc_getegid();
1257 TAINTING_set( TAINTING_get | (tmp_uid && (tmp_euid != tmp_uid || tmp_egid != tmp_gid)) );
1258 #ifdef NO_TAINT_SUPPORT
1259 PERL_UNUSED_VAR(tmp_uid);
1260 PERL_UNUSED_VAR(tmp_euid);
1261 PERL_UNUSED_VAR(tmp_gid);
1262 PERL_UNUSED_VAR(tmp_egid);
1267 if (gimme == G_VOID)
1268 SP = firstrelem - 1;
1269 else if (gimme == G_SCALAR) {
1272 SETi(lastrelem - firstrelem + 1);
1276 /* note that in this case *firstlelem may have been overwritten
1277 by sv_undef in the odd hash case */
1280 SP = firstrelem + (lastlelem - firstlelem);
1281 lelem = firstlelem + (relem - firstrelem);
1283 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
1293 PMOP * const pm = cPMOP;
1294 REGEXP * rx = PM_GETRE(pm);
1295 SV * const pkg = rx ? CALLREG_PACKAGE(rx) : NULL;
1296 SV * const rv = sv_newmortal();
1300 SvUPGRADE(rv, SVt_IV);
1301 /* For a subroutine describing itself as "This is a hacky workaround" I'm
1302 loathe to use it here, but it seems to be the right fix. Or close.
1303 The key part appears to be that it's essential for pp_qr to return a new
1304 object (SV), which implies that there needs to be an effective way to
1305 generate a new SV from the existing SV that is pre-compiled in the
1307 SvRV_set(rv, MUTABLE_SV(reg_temp_copy(NULL, rx)));
1310 cvp = &( ReANY((REGEXP *)SvRV(rv))->qr_anoncv);
1311 if ((cv = *cvp) && CvCLONE(*cvp)) {
1312 *cvp = cv_clone(cv);
1313 SvREFCNT_dec_NN(cv);
1317 HV *const stash = gv_stashsv(pkg, GV_ADD);
1318 SvREFCNT_dec_NN(pkg);
1319 (void)sv_bless(rv, stash);
1322 if (RX_ISTAINTED(rx)) {
1324 SvTAINTED_on(SvRV(rv));
1337 SSize_t curpos = 0; /* initial pos() or current $+[0] */
1340 const char *truebase; /* Start of string */
1341 REGEXP *rx = PM_GETRE(pm);
1343 const I32 gimme = GIMME;
1345 const I32 oldsave = PL_savestack_ix;
1346 I32 had_zerolen = 0;
1349 if (PL_op->op_flags & OPf_STACKED)
1351 else if (PL_op->op_private & OPpTARGET_MY)
1358 PUTBACK; /* EVAL blocks need stack_sp. */
1359 /* Skip get-magic if this is a qr// clone, because regcomp has
1361 truebase = ReANY(rx)->mother_re
1362 ? SvPV_nomg_const(TARG, len)
1363 : SvPV_const(TARG, len);
1365 DIE(aTHX_ "panic: pp_match");
1366 strend = truebase + len;
1367 rxtainted = (RX_ISTAINTED(rx) ||
1368 (TAINT_get && (pm->op_pmflags & PMf_RETAINT)));
1371 /* We need to know this in case we fail out early - pos() must be reset */
1372 global = dynpm->op_pmflags & PMf_GLOBAL;
1374 /* PMdf_USED is set after a ?? matches once */
1377 SvREADONLY(PL_regex_pad[pm->op_pmoffset])
1379 pm->op_pmflags & PMf_USED
1382 DEBUG_r(PerlIO_printf(Perl_debug_log, "?? already matched once"));
1386 /* empty pattern special-cased to use last successful pattern if
1387 possible, except for qr// */
1388 if (!ReANY(rx)->mother_re && !RX_PRELEN(rx)
1394 if (RX_MINLEN(rx) >= 0 && (STRLEN)RX_MINLEN(rx) > len) {
1395 DEBUG_r(PerlIO_printf(Perl_debug_log, "String shorter than min possible regex match (%"
1396 UVuf" < %"IVdf")\n",
1397 (UV)len, (IV)RX_MINLEN(rx)));
1401 /* get pos() if //g */
1403 mg = mg_find_mglob(TARG);
1404 if (mg && mg->mg_len >= 0) {
1405 curpos = MgBYTEPOS(mg, TARG, truebase, len);
1406 /* last time pos() was set, it was zero-length match */
1407 if (mg->mg_flags & MGf_MINMATCH)
1412 #ifdef PERL_SAWAMPERSAND
1415 || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY))
1416 || (dynpm->op_pmflags & PMf_KEEPCOPY)
1420 r_flags |= (REXEC_COPY_STR|REXEC_COPY_SKIP_PRE);
1421 /* in @a =~ /(.)/g, we iterate multiple times, but copy the buffer
1422 * only on the first iteration. Therefore we need to copy $' as well
1423 * as $&, to make the rest of the string available for captures in
1424 * subsequent iterations */
1425 if (! (global && gimme == G_ARRAY))
1426 r_flags |= REXEC_COPY_SKIP_POST;
1428 #ifdef PERL_SAWAMPERSAND
1429 if (dynpm->op_pmflags & PMf_KEEPCOPY)
1430 /* handle KEEPCOPY in pmop but not rx, eg $r=qr/a/; /$r/p */
1431 r_flags &= ~(REXEC_COPY_SKIP_PRE|REXEC_COPY_SKIP_POST);
1438 s = truebase + curpos;
1440 if (!CALLREGEXEC(rx, (char*)s, (char *)strend, (char*)truebase,
1441 had_zerolen, TARG, NULL, r_flags))
1445 if (dynpm->op_pmflags & PMf_ONCE)
1447 SvREADONLY_on(PL_regex_pad[dynpm->op_pmoffset]);
1449 dynpm->op_pmflags |= PMf_USED;
1453 RX_MATCH_TAINTED_on(rx);
1454 TAINT_IF(RX_MATCH_TAINTED(rx));
1458 if (global && (gimme != G_ARRAY || (dynpm->op_pmflags & PMf_CONTINUE))) {
1460 mg = sv_magicext_mglob(TARG);
1461 MgBYTEPOS_set(mg, TARG, truebase, RX_OFFS(rx)[0].end);
1462 if (RX_ZERO_LEN(rx))
1463 mg->mg_flags |= MGf_MINMATCH;
1465 mg->mg_flags &= ~MGf_MINMATCH;
1468 if ((!RX_NPARENS(rx) && !global) || gimme != G_ARRAY) {
1469 LEAVE_SCOPE(oldsave);
1473 /* push captures on stack */
1476 const I32 nparens = RX_NPARENS(rx);
1477 I32 i = (global && !nparens) ? 1 : 0;
1479 SPAGAIN; /* EVAL blocks could move the stack. */
1480 EXTEND(SP, nparens + i);
1481 EXTEND_MORTAL(nparens + i);
1482 for (i = !i; i <= nparens; i++) {
1483 PUSHs(sv_newmortal());
1484 if ((RX_OFFS(rx)[i].start != -1) && RX_OFFS(rx)[i].end != -1 ) {
1485 const I32 len = RX_OFFS(rx)[i].end - RX_OFFS(rx)[i].start;
1486 const char * const s = RX_OFFS(rx)[i].start + truebase;
1487 if (RX_OFFS(rx)[i].end < 0 || RX_OFFS(rx)[i].start < 0 ||
1488 len < 0 || len > strend - s)
1489 DIE(aTHX_ "panic: pp_match start/end pointers, i=%ld, "
1490 "start=%ld, end=%ld, s=%p, strend=%p, len=%"UVuf,
1491 (long) i, (long) RX_OFFS(rx)[i].start,
1492 (long)RX_OFFS(rx)[i].end, s, strend, (UV) len);
1493 sv_setpvn(*SP, s, len);
1494 if (DO_UTF8(TARG) && is_utf8_string((U8*)s, len))
1499 curpos = (UV)RX_OFFS(rx)[0].end;
1500 had_zerolen = RX_ZERO_LEN(rx);
1501 PUTBACK; /* EVAL blocks may use stack */
1502 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1505 LEAVE_SCOPE(oldsave);
1511 if (global && !(dynpm->op_pmflags & PMf_CONTINUE)) {
1513 mg = mg_find_mglob(TARG);
1517 LEAVE_SCOPE(oldsave);
1518 if (gimme == G_ARRAY)
1524 Perl_do_readline(pTHX)
1526 dVAR; dSP; dTARGETSTACKED;
1531 IO * const io = GvIO(PL_last_in_gv);
1532 const I32 type = PL_op->op_type;
1533 const I32 gimme = GIMME_V;
1536 const MAGIC *const mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar);
1538 Perl_tied_method(aTHX_ SV_CONST(READLINE), SP, MUTABLE_SV(io), mg, gimme, 0);
1539 if (gimme == G_SCALAR) {
1541 SvSetSV_nosteal(TARG, TOPs);
1551 if (IoFLAGS(io) & IOf_ARGV) {
1552 if (IoFLAGS(io) & IOf_START) {
1554 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1555 IoFLAGS(io) &= ~IOf_START;
1556 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,NULL);
1557 SvTAINTED_off(GvSVn(PL_last_in_gv)); /* previous tainting irrelevant */
1558 sv_setpvs(GvSVn(PL_last_in_gv), "-");
1559 SvSETMAGIC(GvSV(PL_last_in_gv));
1564 fp = nextargv(PL_last_in_gv);
1565 if (!fp) { /* Note: fp != IoIFP(io) */
1566 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1569 else if (type == OP_GLOB)
1570 fp = Perl_start_glob(aTHX_ POPs, io);
1572 else if (type == OP_GLOB)
1574 else if (IoTYPE(io) == IoTYPE_WRONLY) {
1575 report_wrongway_fh(PL_last_in_gv, '>');
1579 if ((!io || !(IoFLAGS(io) & IOf_START))
1580 && ckWARN(WARN_CLOSED)
1583 report_evil_fh(PL_last_in_gv);
1585 if (gimme == G_SCALAR) {
1586 /* undef TARG, and push that undefined value */
1587 if (type != OP_RCATLINE) {
1588 SV_CHECK_THINKFIRST_COW_DROP(TARG);
1596 if (gimme == G_SCALAR) {
1598 if (type == OP_RCATLINE && SvGMAGICAL(sv))
1601 if (type == OP_RCATLINE)
1602 SvPV_force_nomg_nolen(sv);
1606 else if (isGV_with_GP(sv)) {
1607 SvPV_force_nomg_nolen(sv);
1609 SvUPGRADE(sv, SVt_PV);
1610 tmplen = SvLEN(sv); /* remember if already alloced */
1611 if (!tmplen && !SvREADONLY(sv) && !SvIsCOW(sv)) {
1612 /* try short-buffering it. Please update t/op/readline.t
1613 * if you change the growth length.
1618 if (type == OP_RCATLINE && SvOK(sv)) {
1620 SvPV_force_nomg_nolen(sv);
1626 sv = sv_2mortal(newSV(80));
1630 /* This should not be marked tainted if the fp is marked clean */
1631 #define MAYBE_TAINT_LINE(io, sv) \
1632 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1637 /* delay EOF state for a snarfed empty file */
1638 #define SNARF_EOF(gimme,rs,io,sv) \
1639 (gimme != G_SCALAR || SvCUR(sv) \
1640 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1644 if (!sv_gets(sv, fp, offset)
1646 || SNARF_EOF(gimme, PL_rs, io, sv)
1647 || PerlIO_error(fp)))
1649 PerlIO_clearerr(fp);
1650 if (IoFLAGS(io) & IOf_ARGV) {
1651 fp = nextargv(PL_last_in_gv);
1654 (void)do_close(PL_last_in_gv, FALSE);
1656 else if (type == OP_GLOB) {
1657 if (!do_close(PL_last_in_gv, FALSE)) {
1658 Perl_ck_warner(aTHX_ packWARN(WARN_GLOB),
1659 "glob failed (child exited with status %d%s)",
1660 (int)(STATUS_CURRENT >> 8),
1661 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1664 if (gimme == G_SCALAR) {
1665 if (type != OP_RCATLINE) {
1666 SV_CHECK_THINKFIRST_COW_DROP(TARG);
1672 MAYBE_TAINT_LINE(io, sv);
1675 MAYBE_TAINT_LINE(io, sv);
1677 IoFLAGS(io) |= IOf_NOLINE;
1681 if (type == OP_GLOB) {
1684 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1685 char * const tmps = SvEND(sv) - 1;
1686 if (*tmps == *SvPVX_const(PL_rs)) {
1688 SvCUR_set(sv, SvCUR(sv) - 1);
1691 for (t1 = SvPVX_const(sv); *t1; t1++)
1692 if (strchr("$&*(){}[]'\";\\|?<>~`", *t1))
1694 if (*t1 && PerlLIO_lstat(SvPVX_const(sv), &PL_statbuf) < 0) {
1695 (void)POPs; /* Unmatched wildcard? Chuck it... */
1698 } else if (SvUTF8(sv)) { /* OP_READLINE, OP_RCATLINE */
1699 if (ckWARN(WARN_UTF8)) {
1700 const U8 * const s = (const U8*)SvPVX_const(sv) + offset;
1701 const STRLEN len = SvCUR(sv) - offset;
1704 if (!is_utf8_string_loc(s, len, &f))
1705 /* Emulate :encoding(utf8) warning in the same case. */
1706 Perl_warner(aTHX_ packWARN(WARN_UTF8),
1707 "utf8 \"\\x%02X\" does not map to Unicode",
1708 f < (U8*)SvEND(sv) ? *f : 0);
1711 if (gimme == G_ARRAY) {
1712 if (SvLEN(sv) - SvCUR(sv) > 20) {
1713 SvPV_shrink_to_cur(sv);
1715 sv = sv_2mortal(newSV(80));
1718 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1719 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1720 const STRLEN new_len
1721 = SvCUR(sv) < 60 ? 80 : SvCUR(sv)+40; /* allow some slop */
1722 SvPV_renew(sv, new_len);
1733 SV * const keysv = POPs;
1734 HV * const hv = MUTABLE_HV(POPs);
1735 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
1736 const U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1738 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
1739 bool preeminent = TRUE;
1741 if (SvTYPE(hv) != SVt_PVHV)
1748 /* If we can determine whether the element exist,
1749 * Try to preserve the existenceness of a tied hash
1750 * element by using EXISTS and DELETE if possible.
1751 * Fallback to FETCH and STORE otherwise. */
1752 if (SvCANEXISTDELETE(hv))
1753 preeminent = hv_exists_ent(hv, keysv, 0);
1756 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1757 svp = he ? &HeVAL(he) : NULL;
1759 if (!svp || !*svp || *svp == &PL_sv_undef) {
1763 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
1765 lv = sv_newmortal();
1766 sv_upgrade(lv, SVt_PVLV);
1768 sv_magic(lv, key2 = newSVsv(keysv), PERL_MAGIC_defelem, NULL, 0);
1769 SvREFCNT_dec_NN(key2); /* sv_magic() increments refcount */
1770 LvTARG(lv) = SvREFCNT_inc_simple(hv);
1776 if (HvNAME_get(hv) && isGV(*svp))
1777 save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL));
1778 else if (preeminent)
1779 save_helem_flags(hv, keysv, svp,
1780 (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC);
1782 SAVEHDELETE(hv, keysv);
1784 else if (PL_op->op_private & OPpDEREF) {
1785 PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF));
1789 sv = (svp && *svp ? *svp : &PL_sv_undef);
1790 /* Originally this did a conditional C<sv = sv_mortalcopy(sv)>; this
1791 * was to make C<local $tied{foo} = $tied{foo}> possible.
1792 * However, it seems no longer to be needed for that purpose, and
1793 * introduced a new bug: stuff like C<while ($hash{taintedval} =~ /.../g>
1794 * would loop endlessly since the pos magic is getting set on the
1795 * mortal copy and lost. However, the copy has the effect of
1796 * triggering the get magic, and losing it altogether made things like
1797 * c<$tied{foo};> in void context no longer do get magic, which some
1798 * code relied on. Also, delayed triggering of magic on @+ and friends
1799 * meant the original regex may be out of scope by now. So as a
1800 * compromise, do the get magic here. (The MGf_GSKIP flag will stop it
1801 * being called too many times). */
1802 if (!lval && SvRMAGICAL(hv) && SvGMAGICAL(sv))
1816 cx = &cxstack[cxstack_ix];
1817 itersvp = CxITERVAR(cx);
1819 switch (CxTYPE(cx)) {
1821 case CXt_LOOP_LAZYSV: /* string increment */
1823 SV* cur = cx->blk_loop.state_u.lazysv.cur;
1824 SV *end = cx->blk_loop.state_u.lazysv.end;
1825 /* If the maximum is !SvOK(), pp_enteriter substitutes PL_sv_no.
1826 It has SvPVX of "" and SvCUR of 0, which is what we want. */
1828 const char *max = SvPV_const(end, maxlen);
1829 if (SvNIOK(cur) || SvCUR(cur) > maxlen)
1833 if (SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv)) {
1834 /* safe to reuse old SV */
1835 sv_setsv(oldsv, cur);
1839 /* we need a fresh SV every time so that loop body sees a
1840 * completely new SV for closures/references to work as
1842 *itersvp = newSVsv(cur);
1843 SvREFCNT_dec_NN(oldsv);
1845 if (strEQ(SvPVX_const(cur), max))
1846 sv_setiv(cur, 0); /* terminate next time */
1852 case CXt_LOOP_LAZYIV: /* integer increment */
1854 IV cur = cx->blk_loop.state_u.lazyiv.cur;
1855 if (cur > cx->blk_loop.state_u.lazyiv.end)
1859 /* don't risk potential race */
1860 if (SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv)) {
1861 /* safe to reuse old SV */
1862 sv_setiv(oldsv, cur);
1866 /* we need a fresh SV every time so that loop body sees a
1867 * completely new SV for closures/references to work as they
1869 *itersvp = newSViv(cur);
1870 SvREFCNT_dec_NN(oldsv);
1873 if (cur == IV_MAX) {
1874 /* Handle end of range at IV_MAX */
1875 cx->blk_loop.state_u.lazyiv.end = IV_MIN;
1877 ++cx->blk_loop.state_u.lazyiv.cur;
1881 case CXt_LOOP_FOR: /* iterate array */
1884 AV *av = cx->blk_loop.state_u.ary.ary;
1886 bool av_is_stack = FALSE;
1893 if (PL_op->op_private & OPpITER_REVERSED) {
1894 ix = --cx->blk_loop.state_u.ary.ix;
1895 if (ix <= (av_is_stack ? cx->blk_loop.resetsp : -1))
1899 ix = ++cx->blk_loop.state_u.ary.ix;
1900 if (ix > (av_is_stack ? cx->blk_oldsp : AvFILL(av)))
1904 if (SvMAGICAL(av) || AvREIFY(av)) {
1905 SV * const * const svp = av_fetch(av, ix, FALSE);
1906 sv = svp ? *svp : NULL;
1909 sv = AvARRAY(av)[ix];
1913 if (SvIS_FREED(sv)) {
1915 Perl_croak(aTHX_ "Use of freed value in iteration");
1917 if (SvPADTMP(sv) && !IS_PADGV(sv))
1921 SvREFCNT_inc_simple_void_NN(sv);
1924 else if (!av_is_stack) {
1925 sv = newSVavdefelem(av, ix, 0);
1932 SvREFCNT_dec(oldsv);
1937 DIE(aTHX_ "panic: pp_iter, type=%u", CxTYPE(cx));
1943 A description of how taint works in pattern matching and substitution.
1945 This is all conditional on NO_TAINT_SUPPORT not being defined. Under
1946 NO_TAINT_SUPPORT, taint-related operations should become no-ops.
1948 While the pattern is being assembled/concatenated and then compiled,
1949 PL_tainted will get set (via TAINT_set) if any component of the pattern
1950 is tainted, e.g. /.*$tainted/. At the end of pattern compilation,
1951 the RXf_TAINTED flag is set on the pattern if PL_tainted is set (via
1954 When the pattern is copied, e.g. $r = qr/..../, the SV holding the ref to
1955 the pattern is marked as tainted. This means that subsequent usage, such
1956 as /x$r/, will set PL_tainted using TAINT_set, and thus RXf_TAINTED,
1957 on the new pattern too.
1959 At the start of execution of a pattern, the RXf_TAINTED_SEEN flag on the
1960 regex is cleared; during execution, locale-variant ops such as POSIXL may
1961 set RXf_TAINTED_SEEN.
1963 RXf_TAINTED_SEEN is used post-execution by the get magic code
1964 of $1 et al to indicate whether the returned value should be tainted.
1965 It is the responsibility of the caller of the pattern (i.e. pp_match,
1966 pp_subst etc) to set this flag for any other circumstances where $1 needs
1969 The taint behaviour of pp_subst (and pp_substcont) is quite complex.
1971 There are three possible sources of taint
1973 * the pattern (both compile- and run-time, RXf_TAINTED / RXf_TAINTED_SEEN)
1974 * the replacement string (or expression under /e)
1976 There are four destinations of taint and they are affected by the sources
1977 according to the rules below:
1979 * the return value (not including /r):
1980 tainted by the source string and pattern, but only for the
1981 number-of-iterations case; boolean returns aren't tainted;
1982 * the modified string (or modified copy under /r):
1983 tainted by the source string, pattern, and replacement strings;
1985 tainted by the pattern, and under 'use re "taint"', by the source
1987 * PL_taint - i.e. whether subsequent code (e.g. in a /e block) is tainted:
1988 should always be unset before executing subsequent code.
1990 The overall action of pp_subst is:
1992 * at the start, set bits in rxtainted indicating the taint status of
1993 the various sources.
1995 * After each pattern execution, update the SUBST_TAINT_PAT bit in
1996 rxtainted if RXf_TAINTED_SEEN has been set, to indicate that the
1997 pattern has subsequently become tainted via locale ops.
1999 * If control is being passed to pp_substcont to execute a /e block,
2000 save rxtainted in the CXt_SUBST block, for future use by
2003 * Whenever control is being returned to perl code (either by falling
2004 off the "end" of pp_subst/pp_substcont, or by entering a /e block),
2005 use the flag bits in rxtainted to make all the appropriate types of
2006 destination taint visible; e.g. set RXf_TAINTED_SEEN so that $1
2007 et al will appear tainted.
2009 pp_match is just a simpler version of the above.
2025 U8 rxtainted = 0; /* holds various SUBST_TAINT_* flag bits.
2026 See "how taint works" above */
2029 REGEXP *rx = PM_GETRE(pm);
2031 int force_on_match = 0;
2032 const I32 oldsave = PL_savestack_ix;
2034 bool doutf8 = FALSE; /* whether replacement is in utf8 */
2039 /* known replacement string? */
2040 SV *dstr = (pm->op_pmflags & PMf_CONST) ? POPs : NULL;
2044 if (PL_op->op_flags & OPf_STACKED)
2046 else if (PL_op->op_private & OPpTARGET_MY)
2053 SvGETMAGIC(TARG); /* must come before cow check */
2055 /* Awooga. Awooga. "bool" types that are actually char are dangerous,
2056 because they make integers such as 256 "false". */
2057 is_cow = SvIsCOW(TARG) ? TRUE : FALSE;
2060 sv_force_normal_flags(TARG,0);
2062 if (!(rpm->op_pmflags & PMf_NONDESTRUCT)
2063 && (SvREADONLY(TARG)
2064 || ( ((SvTYPE(TARG) == SVt_PVGV && isGV_with_GP(TARG))
2065 || SvTYPE(TARG) > SVt_PVLV)
2066 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG)))))
2067 Perl_croak_no_modify();
2070 orig = SvPV_nomg(TARG, len);
2071 /* note we don't (yet) force the var into being a string; if we fail
2072 * to match, we leave as-is; on successful match howeverm, we *will*
2073 * coerce into a string, then repeat the match */
2074 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV || SvVOK(TARG))
2077 /* only replace once? */
2078 once = !(rpm->op_pmflags & PMf_GLOBAL);
2080 /* See "how taint works" above */
2083 (SvTAINTED(TARG) ? SUBST_TAINT_STR : 0)
2084 | (RX_ISTAINTED(rx) ? SUBST_TAINT_PAT : 0)
2085 | ((pm->op_pmflags & PMf_RETAINT) ? SUBST_TAINT_RETAINT : 0)
2086 | ((once && !(rpm->op_pmflags & PMf_NONDESTRUCT))
2087 ? SUBST_TAINT_BOOLRET : 0));
2093 DIE(aTHX_ "panic: pp_subst, pm=%p, orig=%p", pm, orig);
2095 strend = orig + len;
2096 slen = DO_UTF8(TARG) ? utf8_length((U8*)orig, (U8*)strend) : len;
2097 maxiters = 2 * slen + 10; /* We can match twice at each
2098 position, once with zero-length,
2099 second time with non-zero. */
2101 if (!RX_PRELEN(rx) && PL_curpm
2102 && !ReANY(rx)->mother_re) {
2107 #ifdef PERL_SAWAMPERSAND
2108 r_flags = ( RX_NPARENS(rx)
2110 || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY))
2111 || (rpm->op_pmflags & PMf_KEEPCOPY)
2116 r_flags = REXEC_COPY_STR;
2119 if (!CALLREGEXEC(rx, orig, strend, orig, 0, TARG, NULL, r_flags))
2122 PUSHs(rpm->op_pmflags & PMf_NONDESTRUCT ? TARG : &PL_sv_no);
2123 LEAVE_SCOPE(oldsave);
2128 /* known replacement string? */
2130 /* replacement needing upgrading? */
2131 if (DO_UTF8(TARG) && !doutf8) {
2132 nsv = sv_newmortal();
2135 sv_recode_to_utf8(nsv, PL_encoding);
2137 sv_utf8_upgrade(nsv);
2138 c = SvPV_const(nsv, clen);
2142 c = SvPV_const(dstr, clen);
2143 doutf8 = DO_UTF8(dstr);
2146 if (SvTAINTED(dstr))
2147 rxtainted |= SUBST_TAINT_REPL;
2154 /* can do inplace substitution? */
2159 && (I32)clen <= RX_MINLENRET(rx)
2161 || !(r_flags & REXEC_COPY_STR)
2162 || (!SvGMAGICAL(dstr) && !(RX_EXTFLAGS(rx) & RXf_EVAL_SEEN))
2164 && !(RX_EXTFLAGS(rx) & RXf_NO_INPLACE_SUBST)
2165 && (!doutf8 || SvUTF8(TARG))
2166 && !(rpm->op_pmflags & PMf_NONDESTRUCT))
2170 if (SvIsCOW(TARG)) {
2171 if (!force_on_match)
2173 assert(SvVOK(TARG));
2176 if (force_on_match) {
2177 /* redo the first match, this time with the orig var
2178 * forced into being a string */
2180 orig = SvPV_force_nomg(TARG, len);
2186 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2187 rxtainted |= SUBST_TAINT_PAT;
2188 m = orig + RX_OFFS(rx)[0].start;
2189 d = orig + RX_OFFS(rx)[0].end;
2191 if (m - s > strend - d) { /* faster to shorten from end */
2194 Copy(c, m, clen, char);
2199 Move(d, m, i, char);
2203 SvCUR_set(TARG, m - s);
2205 else { /* faster from front */
2209 Move(s, d - i, i, char);
2212 Copy(c, d, clen, char);
2219 d = s = RX_OFFS(rx)[0].start + orig;
2222 if (iters++ > maxiters)
2223 DIE(aTHX_ "Substitution loop");
2224 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2225 rxtainted |= SUBST_TAINT_PAT;
2226 m = RX_OFFS(rx)[0].start + orig;
2229 Move(s, d, i, char);
2233 Copy(c, d, clen, char);
2236 s = RX_OFFS(rx)[0].end + orig;
2237 } while (CALLREGEXEC(rx, s, strend, orig,
2238 s == m, /* don't match same null twice */
2240 REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW));
2243 SvCUR_set(TARG, d - SvPVX_const(TARG) + i);
2244 Move(s, d, i+1, char); /* include the NUL */
2254 if (force_on_match) {
2255 /* redo the first match, this time with the orig var
2256 * forced into being a string */
2258 if (rpm->op_pmflags & PMf_NONDESTRUCT) {
2259 /* I feel that it should be possible to avoid this mortal copy
2260 given that the code below copies into a new destination.
2261 However, I suspect it isn't worth the complexity of
2262 unravelling the C<goto force_it> for the small number of
2263 cases where it would be viable to drop into the copy code. */
2264 TARG = sv_2mortal(newSVsv(TARG));
2266 orig = SvPV_force_nomg(TARG, len);
2272 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2273 rxtainted |= SUBST_TAINT_PAT;
2275 s = RX_OFFS(rx)[0].start + orig;
2276 dstr = newSVpvn_flags(orig, s-orig,
2277 SVs_TEMP | (DO_UTF8(TARG) ? SVf_UTF8 : 0));
2282 /* note that a whole bunch of local vars are saved here for
2283 * use by pp_substcont: here's a list of them in case you're
2284 * searching for places in this sub that uses a particular var:
2285 * iters maxiters r_flags oldsave rxtainted orig dstr targ
2286 * s m strend rx once */
2288 RETURNOP(cPMOP->op_pmreplrootu.op_pmreplroot);
2292 if (iters++ > maxiters)
2293 DIE(aTHX_ "Substitution loop");
2294 if (RX_MATCH_TAINTED(rx))
2295 rxtainted |= SUBST_TAINT_PAT;
2296 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
2298 char *old_orig = orig;
2299 assert(RX_SUBOFFSET(rx) == 0);
2301 orig = RX_SUBBEG(rx);
2302 s = orig + (old_s - old_orig);
2303 strend = s + (strend - old_s);
2305 m = RX_OFFS(rx)[0].start + orig;
2306 sv_catpvn_nomg_maybeutf8(dstr, s, m - s, DO_UTF8(TARG));
2307 s = RX_OFFS(rx)[0].end + orig;
2309 /* replacement already stringified */
2311 sv_catpvn_nomg_maybeutf8(dstr, c, clen, doutf8);
2316 if (!nsv) nsv = sv_newmortal();
2317 sv_copypv(nsv, repl);
2318 if (!DO_UTF8(nsv)) sv_recode_to_utf8(nsv, PL_encoding);
2319 sv_catsv(dstr, nsv);
2321 else sv_catsv(dstr, repl);
2322 if (SvTAINTED(repl))
2323 rxtainted |= SUBST_TAINT_REPL;
2327 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
2329 REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW));
2330 sv_catpvn_nomg_maybeutf8(dstr, s, strend - s, DO_UTF8(TARG));
2332 if (rpm->op_pmflags & PMf_NONDESTRUCT) {
2333 /* From here on down we're using the copy, and leaving the original
2340 /* The match may make the string COW. If so, brilliant, because
2341 that's just saved us one malloc, copy and free - the regexp has
2342 donated the old buffer, and we malloc an entirely new one, rather
2343 than the regexp malloc()ing a buffer and copying our original,
2344 only for us to throw it away here during the substitution. */
2345 if (SvIsCOW(TARG)) {
2346 sv_force_normal_flags(TARG, SV_COW_DROP_PV);
2352 SvPV_set(TARG, SvPVX(dstr));
2353 SvCUR_set(TARG, SvCUR(dstr));
2354 SvLEN_set(TARG, SvLEN(dstr));
2355 SvFLAGS(TARG) |= SvUTF8(dstr);
2356 SvPV_set(dstr, NULL);
2363 if (!(rpm->op_pmflags & PMf_NONDESTRUCT)) {
2364 (void)SvPOK_only_UTF8(TARG);
2367 /* See "how taint works" above */
2369 if ((rxtainted & SUBST_TAINT_PAT) ||
2370 ((rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT)) ==
2371 (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
2373 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
2375 if (!(rxtainted & SUBST_TAINT_BOOLRET)
2376 && (rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT))
2378 SvTAINTED_on(TOPs); /* taint return value */
2380 SvTAINTED_off(TOPs); /* may have got tainted earlier */
2382 /* needed for mg_set below */
2384 cBOOL(rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL))
2388 SvSETMAGIC(TARG); /* PL_tainted must be correctly set for this mg_set */
2390 LEAVE_SCOPE(oldsave);
2399 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2400 ++*PL_markstack_ptr;
2402 LEAVE_with_name("grep_item"); /* exit inner scope */
2405 if (PL_stack_base + *PL_markstack_ptr > SP) {
2407 const I32 gimme = GIMME_V;
2409 LEAVE_with_name("grep"); /* exit outer scope */
2410 (void)POPMARK; /* pop src */
2411 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2412 (void)POPMARK; /* pop dst */
2413 SP = PL_stack_base + POPMARK; /* pop original mark */
2414 if (gimme == G_SCALAR) {
2415 if (PL_op->op_private & OPpGREP_LEX) {
2416 SV* const sv = sv_newmortal();
2417 sv_setiv(sv, items);
2425 else if (gimme == G_ARRAY)
2432 ENTER_with_name("grep_item"); /* enter inner scope */
2435 src = PL_stack_base[*PL_markstack_ptr];
2436 if (SvPADTMP(src) && !IS_PADGV(src)) {
2437 src = PL_stack_base[*PL_markstack_ptr] = sv_mortalcopy(src);
2441 if (PL_op->op_private & OPpGREP_LEX)
2442 PAD_SVl(PL_op->op_targ) = src;
2446 RETURNOP(cLOGOP->op_other);
2460 if (CxMULTICALL(&cxstack[cxstack_ix]))
2464 cxstack_ix++; /* temporarily protect top context */
2467 if (gimme == G_SCALAR) {
2470 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2471 if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
2472 && !SvMAGICAL(TOPs)) {
2473 *MARK = SvREFCNT_inc(TOPs);
2478 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2480 *MARK = sv_mortalcopy(sv);
2481 SvREFCNT_dec_NN(sv);
2484 else if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
2485 && !SvMAGICAL(TOPs)) {
2489 *MARK = sv_mortalcopy(TOPs);
2493 *MARK = &PL_sv_undef;
2497 else if (gimme == G_ARRAY) {
2498 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2499 if (!SvTEMP(*MARK) || SvREFCNT(*MARK) != 1
2500 || SvMAGICAL(*MARK)) {
2501 *MARK = sv_mortalcopy(*MARK);
2502 TAINT_NOT; /* Each item is independent */
2509 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2511 PL_curpm = newpm; /* ... and pop $1 et al */
2514 return cx->blk_sub.retop;
2524 const bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2527 DIE(aTHX_ "Not a CODE reference");
2528 switch (SvTYPE(sv)) {
2529 /* This is overwhelming the most common case: */
2532 if (!(cv = GvCVu((const GV *)sv))) {
2534 cv = sv_2cv(sv, &stash, &gv, 0);
2543 if(isGV_with_GP(sv)) goto we_have_a_glob;
2546 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2548 SP = PL_stack_base + POPMARK;
2556 sv = amagic_deref_call(sv, to_cv_amg);
2557 /* Don't SPAGAIN here. */
2564 DIE(aTHX_ PL_no_usym, "a subroutine");
2565 sym = SvPV_nomg_const(sv, len);
2566 if (PL_op->op_private & HINT_STRICT_REFS)
2567 DIE(aTHX_ "Can't use string (\"%" SVf32 "\"%s) as a subroutine ref while \"strict refs\" in use", sv, len>32 ? "..." : "");
2568 cv = get_cvn_flags(sym, len, GV_ADD|SvUTF8(sv));
2571 cv = MUTABLE_CV(SvRV(sv));
2572 if (SvTYPE(cv) == SVt_PVCV)
2577 DIE(aTHX_ "Not a CODE reference");
2578 /* This is the second most common case: */
2580 cv = MUTABLE_CV(sv);
2587 if (CvCLONE(cv) && ! CvCLONED(cv))
2588 DIE(aTHX_ "Closure prototype called");
2589 if (!CvROOT(cv) && !CvXSUB(cv)) {
2593 /* anonymous or undef'd function leaves us no recourse */
2594 if (CvANON(cv) || !(gv = CvGV(cv))) {
2596 DIE(aTHX_ "Undefined subroutine &%"HEKf" called",
2597 HEKfARG(CvNAME_HEK(cv)));
2598 DIE(aTHX_ "Undefined subroutine called");
2601 /* autoloaded stub? */
2602 if (cv != GvCV(gv)) {
2605 /* should call AUTOLOAD now? */
2608 if ((autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2609 GvNAMEUTF8(gv) ? SVf_UTF8 : 0)))
2615 sub_name = sv_newmortal();
2616 gv_efullname3(sub_name, gv, NULL);
2617 DIE(aTHX_ "Undefined subroutine &%"SVf" called", SVfARG(sub_name));
2626 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2627 Perl_get_db_sub(aTHX_ &sv, cv);
2629 PL_curcopdb = PL_curcop;
2631 /* check for lsub that handles lvalue subroutines */
2632 cv = GvCV(gv_fetchpvs("DB::lsub", GV_ADDMULTI, SVt_PVCV));
2633 /* if lsub not found then fall back to DB::sub */
2634 if (!cv) cv = GvCV(PL_DBsub);
2636 cv = GvCV(PL_DBsub);
2639 if (!cv || (!CvXSUB(cv) && !CvSTART(cv)))
2640 DIE(aTHX_ "No DB::sub routine defined");
2643 if (!(CvISXSUB(cv))) {
2644 /* This path taken at least 75% of the time */
2646 SSize_t items = SP - MARK;
2647 PADLIST * const padlist = CvPADLIST(cv);
2648 PUSHBLOCK(cx, CXt_SUB, MARK);
2650 cx->blk_sub.retop = PL_op->op_next;
2652 if (CvDEPTH(cv) >= 2) {
2653 PERL_STACK_OVERFLOW_CHECK();
2654 pad_push(padlist, CvDEPTH(cv));
2657 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2659 AV *const av = MUTABLE_AV(PAD_SVl(0));
2661 /* @_ is normally not REAL--this should only ever
2662 * happen when DB::sub() calls things that modify @_ */
2667 cx->blk_sub.savearray = GvAV(PL_defgv);
2668 GvAV(PL_defgv) = MUTABLE_AV(SvREFCNT_inc_simple(av));
2669 CX_CURPAD_SAVE(cx->blk_sub);
2670 cx->blk_sub.argarray = av;
2673 if (items - 1 > AvMAX(av)) {
2674 SV **ary = AvALLOC(av);
2675 AvMAX(av) = items - 1;
2676 Renew(ary, items, SV*);
2681 Copy(MARK,AvARRAY(av),items,SV*);
2682 AvFILLp(av) = items - 1;
2688 if (SvPADTMP(*MARK) && !IS_PADGV(*MARK))
2689 *MARK = sv_mortalcopy(*MARK);
2696 if ((cx->blk_u16 & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO &&
2698 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2699 /* warning must come *after* we fully set up the context
2700 * stuff so that __WARN__ handlers can safely dounwind()
2703 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION)
2704 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2705 sub_crush_depth(cv);
2706 RETURNOP(CvSTART(cv));
2709 SSize_t markix = TOPMARK;
2714 if (((PL_op->op_private
2715 & PUSHSUB_GET_LVALUE_MASK(Perl_is_lvalue_sub)
2716 ) & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO &&
2718 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2720 if (!hasargs && GvAV(PL_defgv)) {
2721 /* Need to copy @_ to stack. Alternative may be to
2722 * switch stack to @_, and copy return values
2723 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2724 AV * const av = GvAV(PL_defgv);
2725 const SSize_t items = AvFILL(av) + 1;
2729 const bool m = cBOOL(SvRMAGICAL(av));
2730 /* Mark is at the end of the stack. */
2732 for (; i < items; ++i)
2736 SV ** const svp = av_fetch(av, i, 0);
2737 sv = svp ? *svp : NULL;
2739 else sv = AvARRAY(av)[i];
2740 if (sv) SP[i+1] = sv;
2742 SP[i+1] = newSVavdefelem(av, i, 1);
2750 SV **mark = PL_stack_base + markix;
2751 SSize_t items = SP - mark;
2754 if (*mark && SvPADTMP(*mark) && !IS_PADGV(*mark))
2755 *mark = sv_mortalcopy(*mark);
2758 /* We assume first XSUB in &DB::sub is the called one. */
2760 SAVEVPTR(PL_curcop);
2761 PL_curcop = PL_curcopdb;
2764 /* Do we need to open block here? XXXX */
2766 /* CvXSUB(cv) must not be NULL because newXS() refuses NULL xsub address */
2768 CvXSUB(cv)(aTHX_ cv);
2770 /* Enforce some sanity in scalar context. */
2771 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2772 if (markix > PL_stack_sp - PL_stack_base)
2773 *(PL_stack_base + markix) = &PL_sv_undef;
2775 *(PL_stack_base + markix) = *PL_stack_sp;
2776 PL_stack_sp = PL_stack_base + markix;
2784 Perl_sub_crush_depth(pTHX_ CV *cv)
2786 PERL_ARGS_ASSERT_SUB_CRUSH_DEPTH;
2789 Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on anonymous subroutine");
2791 HEK *const hek = CvNAME_HEK(cv);
2794 tmpstr = sv_2mortal(newSVhek(hek));
2797 tmpstr = sv_newmortal();
2798 gv_efullname3(tmpstr, CvGV(cv), NULL);
2800 Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on subroutine \"%"SVf"\"",
2809 SV* const elemsv = POPs;
2810 IV elem = SvIV(elemsv);
2811 AV *const av = MUTABLE_AV(POPs);
2812 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
2813 const U32 defer = PL_op->op_private & OPpLVAL_DEFER;
2814 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
2815 bool preeminent = TRUE;
2818 if (SvROK(elemsv) && !SvGAMAGIC(elemsv) && ckWARN(WARN_MISC))
2819 Perl_warner(aTHX_ packWARN(WARN_MISC),
2820 "Use of reference \"%"SVf"\" as array index",
2822 if (SvTYPE(av) != SVt_PVAV)
2829 /* If we can determine whether the element exist,
2830 * Try to preserve the existenceness of a tied array
2831 * element by using EXISTS and DELETE if possible.
2832 * Fallback to FETCH and STORE otherwise. */
2833 if (SvCANEXISTDELETE(av))
2834 preeminent = av_exists(av, elem);
2837 svp = av_fetch(av, elem, lval && !defer);
2839 #ifdef PERL_MALLOC_WRAP
2840 if (SvUOK(elemsv)) {
2841 const UV uv = SvUV(elemsv);
2842 elem = uv > IV_MAX ? IV_MAX : uv;
2844 else if (SvNOK(elemsv))
2845 elem = (IV)SvNV(elemsv);
2847 static const char oom_array_extend[] =
2848 "Out of memory during array extend"; /* Duplicated in av.c */
2849 MEM_WRAP_CHECK_1(elem,SV*,oom_array_extend);
2852 if (!svp || !*svp) {
2855 DIE(aTHX_ PL_no_aelem, elem);
2857 mPUSHs(newSVavdefelem(av,
2858 /* Resolve a negative index now, unless it points before the
2859 beginning of the array, in which case record it for error
2860 reporting in magic_setdefelem. */
2861 elem < 0 && len + elem >= 0 ? len + elem : elem,
2867 save_aelem(av, elem, svp);
2869 SAVEADELETE(av, elem);
2871 else if (PL_op->op_private & OPpDEREF) {
2872 PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF));
2876 sv = (svp ? *svp : &PL_sv_undef);
2877 if (!lval && SvRMAGICAL(av) && SvGMAGICAL(sv)) /* see note in pp_helem() */
2884 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2886 PERL_ARGS_ASSERT_VIVIFY_REF;
2891 Perl_croak_no_modify();
2892 prepare_SV_for_RV(sv);
2895 SvRV_set(sv, newSV(0));
2898 SvRV_set(sv, MUTABLE_SV(newAV()));
2901 SvRV_set(sv, MUTABLE_SV(newHV()));
2908 if (SvGMAGICAL(sv)) {
2909 /* copy the sv without magic to prevent magic from being
2911 SV* msv = sv_newmortal();
2912 sv_setsv_nomg(msv, sv);
2921 SV* const sv = TOPs;
2924 SV* const rsv = SvRV(sv);
2925 if (SvTYPE(rsv) == SVt_PVCV) {
2931 SETs(method_common(sv, NULL));
2938 SV* const sv = cSVOP_sv;
2939 U32 hash = SvSHARED_HASH(sv);
2941 XPUSHs(method_common(sv, &hash));
2946 S_method_common(pTHX_ SV* meth, U32* hashp)
2953 SV * const sv = PL_stack_base + TOPMARK == PL_stack_sp
2954 ? (Perl_croak(aTHX_ "Can't call method \"%"SVf"\" without a "
2955 "package or object reference", SVfARG(meth)),
2957 : *(PL_stack_base + TOPMARK + 1);
2959 PERL_ARGS_ASSERT_METHOD_COMMON;
2963 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" on an undefined value",
2968 ob = MUTABLE_SV(SvRV(sv));
2969 else if (!SvOK(sv)) goto undefined;
2970 else if (isGV_with_GP(sv)) {
2972 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" "
2973 "without a package or object reference",
2976 if (SvTYPE(ob) == SVt_PVLV && LvTYPE(ob) == 'y') {
2977 assert(!LvTARGLEN(ob));
2981 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV(ob));
2984 /* this isn't a reference */
2987 const char * const packname = SvPV_nomg_const(sv, packlen);
2988 const bool packname_is_utf8 = !!SvUTF8(sv);
2989 const HE* const he =
2990 (const HE *)hv_common(
2991 PL_stashcache, NULL, packname, packlen,
2992 packname_is_utf8 ? HVhek_UTF8 : 0, 0, NULL, 0
2996 stash = INT2PTR(HV*,SvIV(HeVAL(he)));
2997 DEBUG_o(Perl_deb(aTHX_ "PL_stashcache hit %p for '%"SVf"'\n",
3002 if (!(iogv = gv_fetchpvn_flags(
3003 packname, packlen, SVf_UTF8 * packname_is_utf8, SVt_PVIO
3005 !(ob=MUTABLE_SV(GvIO(iogv))))
3007 /* this isn't the name of a filehandle either */
3010 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" "
3011 "without a package or object reference",
3014 /* assume it's a package name */
3015 stash = gv_stashpvn(packname, packlen, packname_is_utf8 ? SVf_UTF8 : 0);
3019 SV* const ref = newSViv(PTR2IV(stash));
3020 (void)hv_store(PL_stashcache, packname,
3021 packname_is_utf8 ? -(I32)packlen : (I32)packlen, ref, 0);
3022 DEBUG_o(Perl_deb(aTHX_ "PL_stashcache caching %p for '%"SVf"'\n",
3027 /* it _is_ a filehandle name -- replace with a reference */
3028 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV(MUTABLE_SV(iogv)));
3031 /* if we got here, ob should be an object or a glob */
3032 if (!ob || !(SvOBJECT(ob)
3033 || (isGV_with_GP(ob)
3034 && (ob = MUTABLE_SV(GvIO((const GV *)ob)))
3037 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" on unblessed reference",
3038 SVfARG((SvSCREAM(meth) && strEQ(SvPV_nolen_const(meth),"isa"))
3039 ? newSVpvs_flags("DOES", SVs_TEMP)
3043 stash = SvSTASH(ob);
3046 /* NOTE: stash may be null, hope hv_fetch_ent and
3047 gv_fetchmethod can cope (it seems they can) */
3049 /* shortcut for simple names */
3051 const HE* const he = hv_fetch_ent(stash, meth, 0, *hashp);
3053 gv = MUTABLE_GV(HeVAL(he));
3054 if (isGV(gv) && GvCV(gv) &&
3055 (!GvCVGEN(gv) || GvCVGEN(gv)
3056 == (PL_sub_generation + HvMROMETA(stash)->cache_gen)))
3057 return MUTABLE_SV(GvCV(gv));
3061 gv = gv_fetchmethod_sv_flags(stash ? stash : MUTABLE_HV(packsv),
3062 meth, GV_AUTOLOAD | GV_CROAK);
3066 return isGV(gv) ? MUTABLE_SV(GvCV(gv)) : MUTABLE_SV(gv);
3071 * c-indentation-style: bsd
3073 * indent-tabs-mode: nil
3076 * ex: set ts=8 sts=4 sw=4 et: