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 I32 maxarg = AvFILL(av) + 1;
331 if (SvRMAGICAL(av)) {
333 for (i=0; i < (U32)maxarg; i++) {
334 SV ** const svp = av_fetch(av, i, FALSE);
335 /* See note in pp_helem, and bug id #27839 */
337 ? SvGMAGICAL(*svp) ? (mg_get(*svp), *svp) : *svp
342 Copy(AvARRAY(av), SP+1, maxarg, SV*);
349 /* ($lex1,@lex2,...) or my ($lex1,@lex2,...) */
354 PADOFFSET base = PL_op->op_targ;
355 int count = (int)(PL_op->op_private) & OPpPADRANGE_COUNTMASK;
357 if (PL_op->op_flags & OPf_SPECIAL) {
358 /* fake the RHS of my ($x,$y,..) = @_ */
360 S_pushav(aTHX_ GvAVn(PL_defgv));
364 /* note, this is only skipped for compile-time-known void cxt */
365 if ((PL_op->op_flags & OPf_WANT) != OPf_WANT_VOID) {
368 for (i = 0; i <count; i++)
369 *++SP = PAD_SV(base+i);
371 if (PL_op->op_private & OPpLVAL_INTRO) {
372 SV **svp = &(PAD_SVl(base));
373 const UV payload = (UV)(
374 (base << (OPpPADRANGE_COUNTSHIFT + SAVE_TIGHT_SHIFT))
375 | (count << SAVE_TIGHT_SHIFT)
376 | SAVEt_CLEARPADRANGE);
377 assert(OPpPADRANGE_COUNTMASK + 1 == (1 <<OPpPADRANGE_COUNTSHIFT));
378 assert((payload >> (OPpPADRANGE_COUNTSHIFT+SAVE_TIGHT_SHIFT)) == base);
385 for (i = 0; i <count; i++)
386 SvPADSTALE_off(*svp++); /* mark lexical as active */
397 OP * const op = PL_op;
398 /* access PL_curpad once */
399 SV ** const padentry = &(PAD_SVl(op->op_targ));
404 PUTBACK; /* no pop/push after this, TOPs ok */
406 if (op->op_flags & OPf_MOD) {
407 if (op->op_private & OPpLVAL_INTRO)
408 if (!(op->op_private & OPpPAD_STATE))
409 save_clearsv(padentry);
410 if (op->op_private & OPpDEREF) {
411 /* TOPs is equivalent to TARG here. Using TOPs (SP) rather
412 than TARG reduces the scope of TARG, so it does not
413 span the call to save_clearsv, resulting in smaller
415 TOPs = vivify_ref(TOPs, op->op_private & OPpDEREF);
428 tryAMAGICunTARGETlist(iter_amg, 0);
429 PL_last_in_gv = MUTABLE_GV(*PL_stack_sp--);
431 else PL_last_in_gv = PL_argvgv, PL_stack_sp--;
432 if (!isGV_with_GP(PL_last_in_gv)) {
433 if (SvROK(PL_last_in_gv) && isGV_with_GP(SvRV(PL_last_in_gv)))
434 PL_last_in_gv = MUTABLE_GV(SvRV(PL_last_in_gv));
437 XPUSHs(MUTABLE_SV(PL_last_in_gv));
440 PL_last_in_gv = MUTABLE_GV(*PL_stack_sp--);
443 return do_readline();
451 tryAMAGICbin_MG(eq_amg, AMGf_set|AMGf_numeric);
455 (SvIOK_notUV(left) && SvIOK_notUV(right))
456 ? (SvIVX(left) == SvIVX(right))
457 : ( do_ncmp(left, right) == 0)
466 PL_op->op_type == OP_PREINC || PL_op->op_type == OP_I_PREINC;
467 if (SvTYPE(TOPs) >= SVt_PVAV || (isGV_with_GP(TOPs) && !SvFAKE(TOPs)))
468 Perl_croak_no_modify();
469 if (!SvREADONLY(TOPs) && !SvGMAGICAL(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
470 && SvIVX(TOPs) != (inc ? IV_MAX : IV_MIN))
472 SvIV_set(TOPs, SvIVX(TOPs) + (inc ? 1 : -1));
473 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
475 else /* Do all the PERL_PRESERVE_IVUV conditionals in sv_inc */
476 if (inc) sv_inc(TOPs);
489 if (PL_op->op_type == OP_OR)
491 RETURNOP(cLOGOP->op_other);
500 const int op_type = PL_op->op_type;
501 const bool is_dor = (op_type == OP_DOR || op_type == OP_DORASSIGN);
506 if (!sv || !SvANY(sv)) {
507 if (op_type == OP_DOR)
509 RETURNOP(cLOGOP->op_other);
515 if (!sv || !SvANY(sv))
520 switch (SvTYPE(sv)) {
522 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
526 if (HvARRAY(sv) || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
530 if (CvROOT(sv) || CvXSUB(sv))
543 if(op_type == OP_DOR)
545 RETURNOP(cLOGOP->op_other);
547 /* assuming OP_DEFINED */
555 dVAR; dSP; dATARGET; bool useleft; SV *svl, *svr;
556 tryAMAGICbin_MG(add_amg, AMGf_assign|AMGf_numeric);
560 useleft = USE_LEFT(svl);
561 #ifdef PERL_PRESERVE_IVUV
562 /* We must see if we can perform the addition with integers if possible,
563 as the integer code detects overflow while the NV code doesn't.
564 If either argument hasn't had a numeric conversion yet attempt to get
565 the IV. It's important to do this now, rather than just assuming that
566 it's not IOK as a PV of "9223372036854775806" may not take well to NV
567 addition, and an SV which is NOK, NV=6.0 ought to be coerced to
568 integer in case the second argument is IV=9223372036854775806
569 We can (now) rely on sv_2iv to do the right thing, only setting the
570 public IOK flag if the value in the NV (or PV) slot is truly integer.
572 A side effect is that this also aggressively prefers integer maths over
573 fp maths for integer values.
575 How to detect overflow?
577 C 99 section 6.2.6.1 says
579 The range of nonnegative values of a signed integer type is a subrange
580 of the corresponding unsigned integer type, and the representation of
581 the same value in each type is the same. A computation involving
582 unsigned operands can never overflow, because a result that cannot be
583 represented by the resulting unsigned integer type is reduced modulo
584 the number that is one greater than the largest value that can be
585 represented by the resulting type.
589 which I read as "unsigned ints wrap."
591 signed integer overflow seems to be classed as "exception condition"
593 If an exceptional condition occurs during the evaluation of an
594 expression (that is, if the result is not mathematically defined or not
595 in the range of representable values for its type), the behavior is
598 (6.5, the 5th paragraph)
600 I had assumed that on 2s complement machines signed arithmetic would
601 wrap, hence coded pp_add and pp_subtract on the assumption that
602 everything perl builds on would be happy. After much wailing and
603 gnashing of teeth it would seem that irix64 knows its ANSI spec well,
604 knows that it doesn't need to, and doesn't. Bah. Anyway, the all-
605 unsigned code below is actually shorter than the old code. :-)
608 if (SvIV_please_nomg(svr)) {
609 /* Unless the left argument is integer in range we are going to have to
610 use NV maths. Hence only attempt to coerce the right argument if
611 we know the left is integer. */
619 /* left operand is undef, treat as zero. + 0 is identity,
620 Could SETi or SETu right now, but space optimise by not adding
621 lots of code to speed up what is probably a rarish case. */
623 /* Left operand is defined, so is it IV? */
624 if (SvIV_please_nomg(svl)) {
625 if ((auvok = SvUOK(svl)))
628 const IV aiv = SvIVX(svl);
631 auvok = 1; /* Now acting as a sign flag. */
632 } else { /* 2s complement assumption for IV_MIN */
640 bool result_good = 0;
643 bool buvok = SvUOK(svr);
648 const IV biv = SvIVX(svr);
655 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
656 else "IV" now, independent of how it came in.
657 if a, b represents positive, A, B negative, a maps to -A etc
662 all UV maths. negate result if A negative.
663 add if signs same, subtract if signs differ. */
669 /* Must get smaller */
675 /* result really should be -(auv-buv). as its negation
676 of true value, need to swap our result flag */
693 if (result <= (UV)IV_MIN)
696 /* result valid, but out of range for IV. */
701 } /* Overflow, drop through to NVs. */
706 NV value = SvNV_nomg(svr);
709 /* left operand is undef, treat as zero. + 0.0 is identity. */
713 SETn( value + SvNV_nomg(svl) );
721 AV * const av = PL_op->op_type == OP_AELEMFAST_LEX
722 ? MUTABLE_AV(PAD_SV(PL_op->op_targ)) : GvAVn(cGVOP_gv);
723 const U32 lval = PL_op->op_flags & OPf_MOD;
724 SV** const svp = av_fetch(av, PL_op->op_private, lval);
725 SV *sv = (svp ? *svp : &PL_sv_undef);
727 if (!lval && SvRMAGICAL(av) && SvGMAGICAL(sv)) /* see note in pp_helem() */
735 dVAR; dSP; dMARK; dTARGET;
737 do_join(TARG, *MARK, MARK, SP);
748 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
749 * will be enough to hold an OP*.
751 SV* const sv = sv_newmortal();
752 sv_upgrade(sv, SVt_PVLV);
754 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
757 XPUSHs(MUTABLE_SV(PL_op));
762 /* Oversized hot code. */
766 dVAR; dSP; dMARK; dORIGMARK;
770 = (PL_op->op_flags & OPf_STACKED) ? MUTABLE_GV(*++MARK) : PL_defoutgv;
774 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
777 if (MARK == ORIGMARK) {
778 /* If using default handle then we need to make space to
779 * pass object as 1st arg, so move other args up ...
783 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
786 return Perl_tied_method(aTHX_ SV_CONST(PRINT), mark - 1, MUTABLE_SV(io),
788 (G_SCALAR | TIED_METHOD_ARGUMENTS_ON_STACK
789 | (PL_op->op_type == OP_SAY
790 ? TIED_METHOD_SAY : 0)), sp - mark);
793 if ( gv && GvEGVx(gv) && (io = GvIO(GvEGV(gv)))
794 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
797 SETERRNO(EBADF,RMS_IFI);
800 else if (!(fp = IoOFP(io))) {
802 report_wrongway_fh(gv, '<');
805 SETERRNO(EBADF,IoIFP(io)?RMS_FAC:RMS_IFI);
809 SV * const ofs = GvSV(PL_ofsgv); /* $, */
811 if (ofs && (SvGMAGICAL(ofs) || SvOK(ofs))) {
813 if (!do_print(*MARK, fp))
817 /* don't use 'ofs' here - it may be invalidated by magic callbacks */
818 if (!do_print(GvSV(PL_ofsgv), fp)) {
827 if (!do_print(*MARK, fp))
835 if (PL_op->op_type == OP_SAY) {
836 if (PerlIO_write(fp, "\n", 1) == 0 || PerlIO_error(fp))
839 else if (PL_ors_sv && SvOK(PL_ors_sv))
840 if (!do_print(PL_ors_sv, fp)) /* $\ */
843 if (IoFLAGS(io) & IOf_FLUSH)
844 if (PerlIO_flush(fp) == EOF)
854 XPUSHs(&PL_sv_undef);
861 const I32 gimme = GIMME_V;
862 static const char an_array[] = "an ARRAY";
863 static const char a_hash[] = "a HASH";
864 const bool is_pp_rv2av = PL_op->op_type == OP_RV2AV;
865 const svtype type = is_pp_rv2av ? SVt_PVAV : SVt_PVHV;
870 sv = amagic_deref_call(sv, is_pp_rv2av ? to_av_amg : to_hv_amg);
873 if (SvTYPE(sv) != type)
874 /* diag_listed_as: Not an ARRAY reference */
875 DIE(aTHX_ "Not %s reference", is_pp_rv2av ? an_array : a_hash);
876 else if (PL_op->op_flags & OPf_MOD
877 && PL_op->op_private & OPpLVAL_INTRO)
878 Perl_croak(aTHX_ "%s", PL_no_localize_ref);
880 else if (SvTYPE(sv) != type) {
883 if (!isGV_with_GP(sv)) {
884 gv = Perl_softref2xv(aTHX_ sv, is_pp_rv2av ? an_array : a_hash,
892 sv = is_pp_rv2av ? MUTABLE_SV(GvAVn(gv)) : MUTABLE_SV(GvHVn(gv));
893 if (PL_op->op_private & OPpLVAL_INTRO)
894 sv = is_pp_rv2av ? MUTABLE_SV(save_ary(gv)) : MUTABLE_SV(save_hash(gv));
896 if (PL_op->op_flags & OPf_REF) {
900 else if (PL_op->op_private & OPpMAYBE_LVSUB) {
901 const I32 flags = is_lvalue_sub();
902 if (flags && !(flags & OPpENTERSUB_INARGS)) {
903 if (gimme != G_ARRAY)
904 goto croak_cant_return;
911 AV *const av = MUTABLE_AV(sv);
912 /* The guts of pp_rv2av, with no intending change to preserve history
913 (until such time as we get tools that can do blame annotation across
914 whitespace changes. */
915 if (gimme == G_ARRAY) {
921 else if (gimme == G_SCALAR) {
923 const I32 maxarg = AvFILL(av) + 1;
927 /* The guts of pp_rv2hv */
928 if (gimme == G_ARRAY) { /* array wanted */
930 return Perl_do_kv(aTHX);
932 else if ((PL_op->op_private & OPpTRUEBOOL
933 || ( PL_op->op_private & OPpMAYBE_TRUEBOOL
934 && block_gimme() == G_VOID ))
935 && (!SvRMAGICAL(sv) || !mg_find(sv, PERL_MAGIC_tied)))
936 SETs(HvUSEDKEYS(sv) ? &PL_sv_yes : sv_2mortal(newSViv(0)));
937 else if (gimme == G_SCALAR) {
939 TARG = Perl_hv_scalar(aTHX_ MUTABLE_HV(sv));
947 Perl_croak(aTHX_ "Can't return %s to lvalue scalar context",
948 is_pp_rv2av ? "array" : "hash");
953 S_do_oddball(pTHX_ SV **oddkey, SV **firstkey)
957 PERL_ARGS_ASSERT_DO_ODDBALL;
960 if (ckWARN(WARN_MISC)) {
962 if (oddkey == firstkey &&
964 (SvTYPE(SvRV(*oddkey)) == SVt_PVAV ||
965 SvTYPE(SvRV(*oddkey)) == SVt_PVHV))
967 err = "Reference found where even-sized list expected";
970 err = "Odd number of elements in hash assignment";
971 Perl_warner(aTHX_ packWARN(WARN_MISC), "%s", err);
980 SV **lastlelem = PL_stack_sp;
981 SV **lastrelem = PL_stack_base + POPMARK;
982 SV **firstrelem = PL_stack_base + POPMARK + 1;
983 SV **firstlelem = lastrelem + 1;
997 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
999 if (gimme == G_ARRAY)
1000 lval = PL_op->op_flags & OPf_MOD || LVRET;
1002 /* If there's a common identifier on both sides we have to take
1003 * special care that assigning the identifier on the left doesn't
1004 * clobber a value on the right that's used later in the list.
1005 * Don't bother if LHS is just an empty hash or array.
1008 if ( (PL_op->op_private & OPpASSIGN_COMMON)
1010 firstlelem != lastlelem
1011 || ! ((sv = *firstlelem))
1013 || ! (SvTYPE(sv) == SVt_PVAV || SvTYPE(sv) == SVt_PVHV)
1014 || (SvTYPE(sv) == SVt_PVAV && AvFILL((AV*)sv) != -1)
1015 || (SvTYPE(sv) == SVt_PVHV && HvUSEDKEYS((HV*)sv) != 0)
1018 EXTEND_MORTAL(lastrelem - firstrelem + 1);
1019 for (relem = firstrelem; relem <= lastrelem; relem++) {
1020 if ((sv = *relem)) {
1021 TAINT_NOT; /* Each item is independent */
1023 /* Dear TODO test in t/op/sort.t, I love you.
1024 (It's relying on a panic, not a "semi-panic" from newSVsv()
1025 and then an assertion failure below.) */
1026 if (SvIS_FREED(sv)) {
1027 Perl_croak(aTHX_ "panic: attempt to copy freed scalar %p",
1030 /* Not newSVsv(), as it does not allow copy-on-write,
1031 resulting in wasteful copies. We need a second copy of
1032 a temp here, hence the SV_NOSTEAL. */
1033 *relem = sv_mortalcopy_flags(sv,SV_GMAGIC|SV_DO_COW_SVSETSV
1044 while (lelem <= lastlelem) {
1045 TAINT_NOT; /* Each item stands on its own, taintwise. */
1047 switch (SvTYPE(sv)) {
1049 ary = MUTABLE_AV(sv);
1050 magic = SvMAGICAL(ary) != 0;
1052 SAVEFREESV(SvREFCNT_inc_simple_NN(sv));
1054 av_extend(ary, lastrelem - relem);
1056 while (relem <= lastrelem) { /* gobble up all the rest */
1059 SvGETMAGIC(*relem); /* before newSV, in case it dies */
1061 sv_setsv_nomg(sv, *relem);
1063 didstore = av_store(ary,i++,sv);
1072 if (PL_delaymagic & DM_ARRAY_ISA)
1073 SvSETMAGIC(MUTABLE_SV(ary));
1076 case SVt_PVHV: { /* normal hash */
1080 SV** topelem = relem;
1081 SV **firsthashrelem = relem;
1083 hash = MUTABLE_HV(sv);
1084 magic = SvMAGICAL(hash) != 0;
1086 odd = ((lastrelem - firsthashrelem)&1)? 0 : 1;
1088 do_oddball(lastrelem, firsthashrelem);
1089 /* we have firstlelem to reuse, it's not needed anymore
1091 *(lastrelem+1) = &PL_sv_undef;
1095 SAVEFREESV(SvREFCNT_inc_simple_NN(sv));
1097 while (relem < lastrelem+odd) { /* gobble up all the rest */
1100 /* Copy the key if aassign is called in lvalue context,
1101 to avoid having the next op modify our rhs. Copy
1102 it also if it is gmagical, lest it make the
1103 hv_store_ent call below croak, leaking the value. */
1104 sv = lval || SvGMAGICAL(*relem)
1105 ? sv_mortalcopy(*relem)
1111 sv_setsv_nomg(tmpstr,*relem++); /* value */
1112 if (gimme == G_ARRAY) {
1113 if (hv_exists_ent(hash, sv, 0))
1114 /* key overwrites an existing entry */
1117 /* copy element back: possibly to an earlier
1118 * stack location if we encountered dups earlier,
1119 * possibly to a later stack location if odd */
1121 *topelem++ = tmpstr;
1124 didstore = hv_store_ent(hash,sv,tmpstr,0);
1126 if (!didstore) sv_2mortal(tmpstr);
1132 if (duplicates && gimme == G_ARRAY) {
1133 /* at this point we have removed the duplicate key/value
1134 * pairs from the stack, but the remaining values may be
1135 * wrong; i.e. with (a 1 a 2 b 3) on the stack we've removed
1136 * the (a 2), but the stack now probably contains
1137 * (a <freed> b 3), because { hv_save(a,1); hv_save(a,2) }
1138 * obliterates the earlier key. So refresh all values. */
1139 lastrelem -= duplicates;
1140 relem = firsthashrelem;
1141 while (relem < lastrelem+odd) {
1143 he = hv_fetch_ent(hash, *relem++, 0, 0);
1144 *relem++ = (he ? HeVAL(he) : &PL_sv_undef);
1147 if (odd && gimme == G_ARRAY) lastrelem++;
1151 if (SvIMMORTAL(sv)) {
1152 if (relem <= lastrelem)
1156 if (relem <= lastrelem) {
1158 SvTEMP(sv) && !SvSMAGICAL(sv) && SvREFCNT(sv) == 1 &&
1159 (!isGV_with_GP(sv) || SvFAKE(sv)) && ckWARN(WARN_MISC)
1162 packWARN(WARN_MISC),
1163 "Useless assignment to a temporary"
1165 sv_setsv(sv, *relem);
1169 sv_setsv(sv, &PL_sv_undef);
1174 if (PL_delaymagic & ~DM_DELAY) {
1175 /* Will be used to set PL_tainting below */
1176 Uid_t tmp_uid = PerlProc_getuid();
1177 Uid_t tmp_euid = PerlProc_geteuid();
1178 Gid_t tmp_gid = PerlProc_getgid();
1179 Gid_t tmp_egid = PerlProc_getegid();
1181 if (PL_delaymagic & DM_UID) {
1182 #ifdef HAS_SETRESUID
1183 (void)setresuid((PL_delaymagic & DM_RUID) ? PL_delaymagic_uid : (Uid_t)-1,
1184 (PL_delaymagic & DM_EUID) ? PL_delaymagic_euid : (Uid_t)-1,
1187 # ifdef HAS_SETREUID
1188 (void)setreuid((PL_delaymagic & DM_RUID) ? PL_delaymagic_uid : (Uid_t)-1,
1189 (PL_delaymagic & DM_EUID) ? PL_delaymagic_euid : (Uid_t)-1);
1192 if ((PL_delaymagic & DM_UID) == DM_RUID) {
1193 (void)setruid(PL_delaymagic_uid);
1194 PL_delaymagic &= ~DM_RUID;
1196 # endif /* HAS_SETRUID */
1198 if ((PL_delaymagic & DM_UID) == DM_EUID) {
1199 (void)seteuid(PL_delaymagic_euid);
1200 PL_delaymagic &= ~DM_EUID;
1202 # endif /* HAS_SETEUID */
1203 if (PL_delaymagic & DM_UID) {
1204 if (PL_delaymagic_uid != PL_delaymagic_euid)
1205 DIE(aTHX_ "No setreuid available");
1206 (void)PerlProc_setuid(PL_delaymagic_uid);
1208 # endif /* HAS_SETREUID */
1209 #endif /* HAS_SETRESUID */
1210 tmp_uid = PerlProc_getuid();
1211 tmp_euid = PerlProc_geteuid();
1213 if (PL_delaymagic & DM_GID) {
1214 #ifdef HAS_SETRESGID
1215 (void)setresgid((PL_delaymagic & DM_RGID) ? PL_delaymagic_gid : (Gid_t)-1,
1216 (PL_delaymagic & DM_EGID) ? PL_delaymagic_egid : (Gid_t)-1,
1219 # ifdef HAS_SETREGID
1220 (void)setregid((PL_delaymagic & DM_RGID) ? PL_delaymagic_gid : (Gid_t)-1,
1221 (PL_delaymagic & DM_EGID) ? PL_delaymagic_egid : (Gid_t)-1);
1224 if ((PL_delaymagic & DM_GID) == DM_RGID) {
1225 (void)setrgid(PL_delaymagic_gid);
1226 PL_delaymagic &= ~DM_RGID;
1228 # endif /* HAS_SETRGID */
1230 if ((PL_delaymagic & DM_GID) == DM_EGID) {
1231 (void)setegid(PL_delaymagic_egid);
1232 PL_delaymagic &= ~DM_EGID;
1234 # endif /* HAS_SETEGID */
1235 if (PL_delaymagic & DM_GID) {
1236 if (PL_delaymagic_gid != PL_delaymagic_egid)
1237 DIE(aTHX_ "No setregid available");
1238 (void)PerlProc_setgid(PL_delaymagic_gid);
1240 # endif /* HAS_SETREGID */
1241 #endif /* HAS_SETRESGID */
1242 tmp_gid = PerlProc_getgid();
1243 tmp_egid = PerlProc_getegid();
1245 TAINTING_set( TAINTING_get | (tmp_uid && (tmp_euid != tmp_uid || tmp_egid != tmp_gid)) );
1246 #ifdef NO_TAINT_SUPPORT
1247 PERL_UNUSED_VAR(tmp_uid);
1248 PERL_UNUSED_VAR(tmp_euid);
1249 PERL_UNUSED_VAR(tmp_gid);
1250 PERL_UNUSED_VAR(tmp_egid);
1255 if (gimme == G_VOID)
1256 SP = firstrelem - 1;
1257 else if (gimme == G_SCALAR) {
1260 SETi(lastrelem - firstrelem + 1);
1264 /* note that in this case *firstlelem may have been overwritten
1265 by sv_undef in the odd hash case */
1268 SP = firstrelem + (lastlelem - firstlelem);
1269 lelem = firstlelem + (relem - firstrelem);
1271 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
1281 PMOP * const pm = cPMOP;
1282 REGEXP * rx = PM_GETRE(pm);
1283 SV * const pkg = rx ? CALLREG_PACKAGE(rx) : NULL;
1284 SV * const rv = sv_newmortal();
1288 SvUPGRADE(rv, SVt_IV);
1289 /* For a subroutine describing itself as "This is a hacky workaround" I'm
1290 loathe to use it here, but it seems to be the right fix. Or close.
1291 The key part appears to be that it's essential for pp_qr to return a new
1292 object (SV), which implies that there needs to be an effective way to
1293 generate a new SV from the existing SV that is pre-compiled in the
1295 SvRV_set(rv, MUTABLE_SV(reg_temp_copy(NULL, rx)));
1298 cvp = &( ReANY((REGEXP *)SvRV(rv))->qr_anoncv);
1299 if ((cv = *cvp) && CvCLONE(*cvp)) {
1300 *cvp = cv_clone(cv);
1301 SvREFCNT_dec_NN(cv);
1305 HV *const stash = gv_stashsv(pkg, GV_ADD);
1306 SvREFCNT_dec_NN(pkg);
1307 (void)sv_bless(rv, stash);
1310 if (RX_ISTAINTED(rx)) {
1312 SvTAINTED_on(SvRV(rv));
1325 I32 curpos = 0; /* initial pos() or current $+[0] */
1328 const char *truebase; /* Start of string */
1329 REGEXP *rx = PM_GETRE(pm);
1331 const I32 gimme = GIMME;
1333 const I32 oldsave = PL_savestack_ix;
1334 I32 had_zerolen = 0;
1337 if (PL_op->op_flags & OPf_STACKED)
1339 else if (PL_op->op_private & OPpTARGET_MY)
1346 PUTBACK; /* EVAL blocks need stack_sp. */
1347 /* Skip get-magic if this is a qr// clone, because regcomp has
1349 truebase = ReANY(rx)->mother_re
1350 ? SvPV_nomg_const(TARG, len)
1351 : SvPV_const(TARG, len);
1353 DIE(aTHX_ "panic: pp_match");
1354 strend = truebase + len;
1355 rxtainted = (RX_ISTAINTED(rx) ||
1356 (TAINT_get && (pm->op_pmflags & PMf_RETAINT)));
1359 /* We need to know this in case we fail out early - pos() must be reset */
1360 global = dynpm->op_pmflags & PMf_GLOBAL;
1362 /* PMdf_USED is set after a ?? matches once */
1365 SvREADONLY(PL_regex_pad[pm->op_pmoffset])
1367 pm->op_pmflags & PMf_USED
1370 DEBUG_r(PerlIO_printf(Perl_debug_log, "?? already matched once"));
1374 /* empty pattern special-cased to use last successful pattern if
1375 possible, except for qr// */
1376 if (!ReANY(rx)->mother_re && !RX_PRELEN(rx)
1382 if (RX_MINLEN(rx) > (I32)len) {
1383 DEBUG_r(PerlIO_printf(Perl_debug_log, "String shorter than min possible regex match\n"));
1387 /* get pos() if //g */
1389 mg = mg_find_mglob(TARG);
1390 if (mg && mg->mg_len >= 0) {
1391 curpos = mg->mg_len;
1392 /* last time pos() was set, it was zero-length match */
1393 if (mg->mg_flags & MGf_MINMATCH)
1398 #ifdef PERL_SAWAMPERSAND
1401 || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY))
1402 || (dynpm->op_pmflags & PMf_KEEPCOPY)
1406 r_flags |= (REXEC_COPY_STR|REXEC_COPY_SKIP_PRE);
1407 /* in @a =~ /(.)/g, we iterate multiple times, but copy the buffer
1408 * only on the first iteration. Therefore we need to copy $' as well
1409 * as $&, to make the rest of the string available for captures in
1410 * subsequent iterations */
1411 if (! (global && gimme == G_ARRAY))
1412 r_flags |= REXEC_COPY_SKIP_POST;
1414 #ifdef PERL_SAWAMPERSAND
1415 if (dynpm->op_pmflags & PMf_KEEPCOPY)
1416 /* handle KEEPCOPY in pmop but not rx, eg $r=qr/a/; /$r/p */
1417 r_flags &= ~(REXEC_COPY_SKIP_PRE|REXEC_COPY_SKIP_POST);
1424 s = truebase + curpos;
1426 if (!CALLREGEXEC(rx, (char*)s, (char *)strend, (char*)truebase,
1427 had_zerolen, TARG, NULL, r_flags))
1431 if (dynpm->op_pmflags & PMf_ONCE)
1433 SvREADONLY_on(PL_regex_pad[dynpm->op_pmoffset]);
1435 dynpm->op_pmflags |= PMf_USED;
1439 RX_MATCH_TAINTED_on(rx);
1440 TAINT_IF(RX_MATCH_TAINTED(rx));
1444 if (global && (gimme != G_ARRAY || (dynpm->op_pmflags & PMf_CONTINUE))) {
1446 mg = sv_magicext_mglob(TARG);
1447 mg->mg_len = RX_OFFS(rx)[0].end;
1448 if (RX_ZERO_LEN(rx))
1449 mg->mg_flags |= MGf_MINMATCH;
1451 mg->mg_flags &= ~MGf_MINMATCH;
1454 if ((!RX_NPARENS(rx) && !global) || gimme != G_ARRAY) {
1455 LEAVE_SCOPE(oldsave);
1459 /* push captures on stack */
1462 const I32 nparens = RX_NPARENS(rx);
1463 I32 i = (global && !nparens) ? 1 : 0;
1465 SPAGAIN; /* EVAL blocks could move the stack. */
1466 EXTEND(SP, nparens + i);
1467 EXTEND_MORTAL(nparens + i);
1468 for (i = !i; i <= nparens; i++) {
1469 PUSHs(sv_newmortal());
1470 if ((RX_OFFS(rx)[i].start != -1) && RX_OFFS(rx)[i].end != -1 ) {
1471 const I32 len = RX_OFFS(rx)[i].end - RX_OFFS(rx)[i].start;
1472 const char * const s = RX_OFFS(rx)[i].start + truebase;
1473 if (RX_OFFS(rx)[i].end < 0 || RX_OFFS(rx)[i].start < 0 ||
1474 len < 0 || len > strend - s)
1475 DIE(aTHX_ "panic: pp_match start/end pointers, i=%ld, "
1476 "start=%ld, end=%ld, s=%p, strend=%p, len=%"UVuf,
1477 (long) i, (long) RX_OFFS(rx)[i].start,
1478 (long)RX_OFFS(rx)[i].end, s, strend, (UV) len);
1479 sv_setpvn(*SP, s, len);
1480 if (DO_UTF8(TARG) && is_utf8_string((U8*)s, len))
1485 curpos = (UV)RX_OFFS(rx)[0].end;
1486 had_zerolen = RX_ZERO_LEN(rx);
1487 PUTBACK; /* EVAL blocks may use stack */
1488 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1491 LEAVE_SCOPE(oldsave);
1497 if (global && !(dynpm->op_pmflags & PMf_CONTINUE)) {
1499 mg = mg_find_mglob(TARG);
1503 LEAVE_SCOPE(oldsave);
1504 if (gimme == G_ARRAY)
1510 Perl_do_readline(pTHX)
1512 dVAR; dSP; dTARGETSTACKED;
1517 IO * const io = GvIO(PL_last_in_gv);
1518 const I32 type = PL_op->op_type;
1519 const I32 gimme = GIMME_V;
1522 const MAGIC *const mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar);
1524 Perl_tied_method(aTHX_ SV_CONST(READLINE), SP, MUTABLE_SV(io), mg, gimme, 0);
1525 if (gimme == G_SCALAR) {
1527 SvSetSV_nosteal(TARG, TOPs);
1537 if (IoFLAGS(io) & IOf_ARGV) {
1538 if (IoFLAGS(io) & IOf_START) {
1540 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1541 IoFLAGS(io) &= ~IOf_START;
1542 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,NULL);
1543 SvTAINTED_off(GvSVn(PL_last_in_gv)); /* previous tainting irrelevant */
1544 sv_setpvs(GvSVn(PL_last_in_gv), "-");
1545 SvSETMAGIC(GvSV(PL_last_in_gv));
1550 fp = nextargv(PL_last_in_gv);
1551 if (!fp) { /* Note: fp != IoIFP(io) */
1552 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1555 else if (type == OP_GLOB)
1556 fp = Perl_start_glob(aTHX_ POPs, io);
1558 else if (type == OP_GLOB)
1560 else if (IoTYPE(io) == IoTYPE_WRONLY) {
1561 report_wrongway_fh(PL_last_in_gv, '>');
1565 if ((!io || !(IoFLAGS(io) & IOf_START))
1566 && ckWARN2(WARN_GLOB, WARN_CLOSED))
1568 if (type == OP_GLOB)
1569 Perl_ck_warner_d(aTHX_ packWARN(WARN_GLOB),
1570 "glob failed (can't start child: %s)",
1573 report_evil_fh(PL_last_in_gv);
1575 if (gimme == G_SCALAR) {
1576 /* undef TARG, and push that undefined value */
1577 if (type != OP_RCATLINE) {
1578 SV_CHECK_THINKFIRST_COW_DROP(TARG);
1586 if (gimme == G_SCALAR) {
1588 if (type == OP_RCATLINE && SvGMAGICAL(sv))
1591 if (type == OP_RCATLINE)
1592 SvPV_force_nomg_nolen(sv);
1596 else if (isGV_with_GP(sv)) {
1597 SvPV_force_nomg_nolen(sv);
1599 SvUPGRADE(sv, SVt_PV);
1600 tmplen = SvLEN(sv); /* remember if already alloced */
1601 if (!tmplen && !SvREADONLY(sv) && !SvIsCOW(sv)) {
1602 /* try short-buffering it. Please update t/op/readline.t
1603 * if you change the growth length.
1608 if (type == OP_RCATLINE && SvOK(sv)) {
1610 SvPV_force_nomg_nolen(sv);
1616 sv = sv_2mortal(newSV(80));
1620 /* This should not be marked tainted if the fp is marked clean */
1621 #define MAYBE_TAINT_LINE(io, sv) \
1622 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1627 /* delay EOF state for a snarfed empty file */
1628 #define SNARF_EOF(gimme,rs,io,sv) \
1629 (gimme != G_SCALAR || SvCUR(sv) \
1630 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1634 if (!sv_gets(sv, fp, offset)
1636 || SNARF_EOF(gimme, PL_rs, io, sv)
1637 || PerlIO_error(fp)))
1639 PerlIO_clearerr(fp);
1640 if (IoFLAGS(io) & IOf_ARGV) {
1641 fp = nextargv(PL_last_in_gv);
1644 (void)do_close(PL_last_in_gv, FALSE);
1646 else if (type == OP_GLOB) {
1647 if (!do_close(PL_last_in_gv, FALSE)) {
1648 Perl_ck_warner(aTHX_ packWARN(WARN_GLOB),
1649 "glob failed (child exited with status %d%s)",
1650 (int)(STATUS_CURRENT >> 8),
1651 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1654 if (gimme == G_SCALAR) {
1655 if (type != OP_RCATLINE) {
1656 SV_CHECK_THINKFIRST_COW_DROP(TARG);
1662 MAYBE_TAINT_LINE(io, sv);
1665 MAYBE_TAINT_LINE(io, sv);
1667 IoFLAGS(io) |= IOf_NOLINE;
1671 if (type == OP_GLOB) {
1674 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1675 char * const tmps = SvEND(sv) - 1;
1676 if (*tmps == *SvPVX_const(PL_rs)) {
1678 SvCUR_set(sv, SvCUR(sv) - 1);
1681 for (t1 = SvPVX_const(sv); *t1; t1++)
1682 if (!isALPHANUMERIC(*t1) &&
1683 strchr("$&*(){}[]'\";\\|?<>~`", *t1))
1685 if (*t1 && PerlLIO_lstat(SvPVX_const(sv), &PL_statbuf) < 0) {
1686 (void)POPs; /* Unmatched wildcard? Chuck it... */
1689 } else if (SvUTF8(sv)) { /* OP_READLINE, OP_RCATLINE */
1690 if (ckWARN(WARN_UTF8)) {
1691 const U8 * const s = (const U8*)SvPVX_const(sv) + offset;
1692 const STRLEN len = SvCUR(sv) - offset;
1695 if (!is_utf8_string_loc(s, len, &f))
1696 /* Emulate :encoding(utf8) warning in the same case. */
1697 Perl_warner(aTHX_ packWARN(WARN_UTF8),
1698 "utf8 \"\\x%02X\" does not map to Unicode",
1699 f < (U8*)SvEND(sv) ? *f : 0);
1702 if (gimme == G_ARRAY) {
1703 if (SvLEN(sv) - SvCUR(sv) > 20) {
1704 SvPV_shrink_to_cur(sv);
1706 sv = sv_2mortal(newSV(80));
1709 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1710 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1711 const STRLEN new_len
1712 = SvCUR(sv) < 60 ? 80 : SvCUR(sv)+40; /* allow some slop */
1713 SvPV_renew(sv, new_len);
1724 SV * const keysv = POPs;
1725 HV * const hv = MUTABLE_HV(POPs);
1726 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
1727 const U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1729 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
1730 bool preeminent = TRUE;
1732 if (SvTYPE(hv) != SVt_PVHV)
1739 /* If we can determine whether the element exist,
1740 * Try to preserve the existenceness of a tied hash
1741 * element by using EXISTS and DELETE if possible.
1742 * Fallback to FETCH and STORE otherwise. */
1743 if (SvCANEXISTDELETE(hv))
1744 preeminent = hv_exists_ent(hv, keysv, 0);
1747 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1748 svp = he ? &HeVAL(he) : NULL;
1750 if (!svp || !*svp || *svp == &PL_sv_undef) {
1754 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
1756 lv = sv_newmortal();
1757 sv_upgrade(lv, SVt_PVLV);
1759 sv_magic(lv, key2 = newSVsv(keysv), PERL_MAGIC_defelem, NULL, 0);
1760 SvREFCNT_dec_NN(key2); /* sv_magic() increments refcount */
1761 LvTARG(lv) = SvREFCNT_inc_simple(hv);
1767 if (HvNAME_get(hv) && isGV(*svp))
1768 save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL));
1769 else if (preeminent)
1770 save_helem_flags(hv, keysv, svp,
1771 (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC);
1773 SAVEHDELETE(hv, keysv);
1775 else if (PL_op->op_private & OPpDEREF) {
1776 PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF));
1780 sv = (svp && *svp ? *svp : &PL_sv_undef);
1781 /* Originally this did a conditional C<sv = sv_mortalcopy(sv)>; this
1782 * was to make C<local $tied{foo} = $tied{foo}> possible.
1783 * However, it seems no longer to be needed for that purpose, and
1784 * introduced a new bug: stuff like C<while ($hash{taintedval} =~ /.../g>
1785 * would loop endlessly since the pos magic is getting set on the
1786 * mortal copy and lost. However, the copy has the effect of
1787 * triggering the get magic, and losing it altogether made things like
1788 * c<$tied{foo};> in void context no longer do get magic, which some
1789 * code relied on. Also, delayed triggering of magic on @+ and friends
1790 * meant the original regex may be out of scope by now. So as a
1791 * compromise, do the get magic here. (The MGf_GSKIP flag will stop it
1792 * being called too many times). */
1793 if (!lval && SvRMAGICAL(hv) && SvGMAGICAL(sv))
1807 cx = &cxstack[cxstack_ix];
1808 itersvp = CxITERVAR(cx);
1810 switch (CxTYPE(cx)) {
1812 case CXt_LOOP_LAZYSV: /* string increment */
1814 SV* cur = cx->blk_loop.state_u.lazysv.cur;
1815 SV *end = cx->blk_loop.state_u.lazysv.end;
1816 /* If the maximum is !SvOK(), pp_enteriter substitutes PL_sv_no.
1817 It has SvPVX of "" and SvCUR of 0, which is what we want. */
1819 const char *max = SvPV_const(end, maxlen);
1820 if (SvNIOK(cur) || SvCUR(cur) > maxlen)
1824 if (SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv)) {
1825 /* safe to reuse old SV */
1826 sv_setsv(oldsv, cur);
1830 /* we need a fresh SV every time so that loop body sees a
1831 * completely new SV for closures/references to work as
1833 *itersvp = newSVsv(cur);
1834 SvREFCNT_dec_NN(oldsv);
1836 if (strEQ(SvPVX_const(cur), max))
1837 sv_setiv(cur, 0); /* terminate next time */
1843 case CXt_LOOP_LAZYIV: /* integer increment */
1845 IV cur = cx->blk_loop.state_u.lazyiv.cur;
1846 if (cur > cx->blk_loop.state_u.lazyiv.end)
1850 /* don't risk potential race */
1851 if (SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv)) {
1852 /* safe to reuse old SV */
1853 sv_setiv(oldsv, cur);
1857 /* we need a fresh SV every time so that loop body sees a
1858 * completely new SV for closures/references to work as they
1860 *itersvp = newSViv(cur);
1861 SvREFCNT_dec_NN(oldsv);
1864 if (cur == IV_MAX) {
1865 /* Handle end of range at IV_MAX */
1866 cx->blk_loop.state_u.lazyiv.end = IV_MIN;
1868 ++cx->blk_loop.state_u.lazyiv.cur;
1872 case CXt_LOOP_FOR: /* iterate array */
1875 AV *av = cx->blk_loop.state_u.ary.ary;
1877 bool av_is_stack = FALSE;
1884 if (PL_op->op_private & OPpITER_REVERSED) {
1885 ix = --cx->blk_loop.state_u.ary.ix;
1886 if (ix <= (av_is_stack ? cx->blk_loop.resetsp : -1))
1890 ix = ++cx->blk_loop.state_u.ary.ix;
1891 if (ix > (av_is_stack ? cx->blk_oldsp : AvFILL(av)))
1895 if (SvMAGICAL(av) || AvREIFY(av)) {
1896 SV * const * const svp = av_fetch(av, ix, FALSE);
1897 sv = svp ? *svp : NULL;
1900 sv = AvARRAY(av)[ix];
1904 if (SvIS_FREED(sv)) {
1906 Perl_croak(aTHX_ "Use of freed value in iteration");
1908 if (SvPADTMP(sv) && !IS_PADGV(sv))
1912 SvREFCNT_inc_simple_void_NN(sv);
1918 if (!av_is_stack && sv == &PL_sv_undef) {
1919 SV *lv = newSV_type(SVt_PVLV);
1921 sv_magic(lv, NULL, PERL_MAGIC_defelem, NULL, 0);
1922 LvTARG(lv) = SvREFCNT_inc_simple(av);
1924 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1930 SvREFCNT_dec(oldsv);
1935 DIE(aTHX_ "panic: pp_iter, type=%u", CxTYPE(cx));
1941 A description of how taint works in pattern matching and substitution.
1943 This is all conditional on NO_TAINT_SUPPORT not being defined. Under
1944 NO_TAINT_SUPPORT, taint-related operations should become no-ops.
1946 While the pattern is being assembled/concatenated and then compiled,
1947 PL_tainted will get set (via TAINT_set) if any component of the pattern
1948 is tainted, e.g. /.*$tainted/. At the end of pattern compilation,
1949 the RXf_TAINTED flag is set on the pattern if PL_tainted is set (via
1952 When the pattern is copied, e.g. $r = qr/..../, the SV holding the ref to
1953 the pattern is marked as tainted. This means that subsequent usage, such
1954 as /x$r/, will set PL_tainted using TAINT_set, and thus RXf_TAINTED,
1955 on the new pattern too.
1957 At the start of execution of a pattern, the RXf_TAINTED_SEEN flag on the
1958 regex is cleared; during execution, locale-variant ops such as POSIXL may
1959 set RXf_TAINTED_SEEN.
1961 RXf_TAINTED_SEEN is used post-execution by the get magic code
1962 of $1 et al to indicate whether the returned value should be tainted.
1963 It is the responsibility of the caller of the pattern (i.e. pp_match,
1964 pp_subst etc) to set this flag for any other circumstances where $1 needs
1967 The taint behaviour of pp_subst (and pp_substcont) is quite complex.
1969 There are three possible sources of taint
1971 * the pattern (both compile- and run-time, RXf_TAINTED / RXf_TAINTED_SEEN)
1972 * the replacement string (or expression under /e)
1974 There are four destinations of taint and they are affected by the sources
1975 according to the rules below:
1977 * the return value (not including /r):
1978 tainted by the source string and pattern, but only for the
1979 number-of-iterations case; boolean returns aren't tainted;
1980 * the modified string (or modified copy under /r):
1981 tainted by the source string, pattern, and replacement strings;
1983 tainted by the pattern, and under 'use re "taint"', by the source
1985 * PL_taint - i.e. whether subsequent code (e.g. in a /e block) is tainted:
1986 should always be unset before executing subsequent code.
1988 The overall action of pp_subst is:
1990 * at the start, set bits in rxtainted indicating the taint status of
1991 the various sources.
1993 * After each pattern execution, update the SUBST_TAINT_PAT bit in
1994 rxtainted if RXf_TAINTED_SEEN has been set, to indicate that the
1995 pattern has subsequently become tainted via locale ops.
1997 * If control is being passed to pp_substcont to execute a /e block,
1998 save rxtainted in the CXt_SUBST block, for future use by
2001 * Whenever control is being returned to perl code (either by falling
2002 off the "end" of pp_subst/pp_substcont, or by entering a /e block),
2003 use the flag bits in rxtainted to make all the appropriate types of
2004 destination taint visible; e.g. set RXf_TAINTED_SEEN so that $1
2005 et al will appear tainted.
2007 pp_match is just a simpler version of the above.
2023 U8 rxtainted = 0; /* holds various SUBST_TAINT_* flag bits.
2024 See "how taint works" above */
2027 REGEXP *rx = PM_GETRE(pm);
2029 int force_on_match = 0;
2030 const I32 oldsave = PL_savestack_ix;
2032 bool doutf8 = FALSE; /* whether replacement is in utf8 */
2037 /* known replacement string? */
2038 SV *dstr = (pm->op_pmflags & PMf_CONST) ? POPs : NULL;
2042 if (PL_op->op_flags & OPf_STACKED)
2044 else if (PL_op->op_private & OPpTARGET_MY)
2051 SvGETMAGIC(TARG); /* must come before cow check */
2053 /* Awooga. Awooga. "bool" types that are actually char are dangerous,
2054 because they make integers such as 256 "false". */
2055 is_cow = SvIsCOW(TARG) ? TRUE : FALSE;
2058 sv_force_normal_flags(TARG,0);
2060 if (!(rpm->op_pmflags & PMf_NONDESTRUCT)
2061 && (SvREADONLY(TARG)
2062 || ( ((SvTYPE(TARG) == SVt_PVGV && isGV_with_GP(TARG))
2063 || SvTYPE(TARG) > SVt_PVLV)
2064 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG)))))
2065 Perl_croak_no_modify();
2068 orig = SvPV_nomg(TARG, len);
2069 /* note we don't (yet) force the var into being a string; if we fail
2070 * to match, we leave as-is; on successful match howeverm, we *will*
2071 * coerce into a string, then repeat the match */
2072 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV || SvVOK(TARG))
2075 /* only replace once? */
2076 once = !(rpm->op_pmflags & PMf_GLOBAL);
2078 /* See "how taint works" above */
2081 (SvTAINTED(TARG) ? SUBST_TAINT_STR : 0)
2082 | (RX_ISTAINTED(rx) ? SUBST_TAINT_PAT : 0)
2083 | ((pm->op_pmflags & PMf_RETAINT) ? SUBST_TAINT_RETAINT : 0)
2084 | ((once && !(rpm->op_pmflags & PMf_NONDESTRUCT))
2085 ? SUBST_TAINT_BOOLRET : 0));
2091 DIE(aTHX_ "panic: pp_subst, pm=%p, orig=%p", pm, orig);
2093 strend = orig + len;
2094 slen = DO_UTF8(TARG) ? utf8_length((U8*)orig, (U8*)strend) : len;
2095 maxiters = 2 * slen + 10; /* We can match twice at each
2096 position, once with zero-length,
2097 second time with non-zero. */
2099 if (!RX_PRELEN(rx) && PL_curpm
2100 && !ReANY(rx)->mother_re) {
2105 #ifdef PERL_SAWAMPERSAND
2106 r_flags = ( RX_NPARENS(rx)
2108 || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY))
2109 || (rpm->op_pmflags & PMf_KEEPCOPY)
2114 r_flags = REXEC_COPY_STR;
2117 if (!CALLREGEXEC(rx, orig, strend, orig, 0, TARG, NULL, r_flags))
2120 PUSHs(rpm->op_pmflags & PMf_NONDESTRUCT ? TARG : &PL_sv_no);
2121 LEAVE_SCOPE(oldsave);
2126 /* known replacement string? */
2128 /* replacement needing upgrading? */
2129 if (DO_UTF8(TARG) && !doutf8) {
2130 nsv = sv_newmortal();
2133 sv_recode_to_utf8(nsv, PL_encoding);
2135 sv_utf8_upgrade(nsv);
2136 c = SvPV_const(nsv, clen);
2140 c = SvPV_const(dstr, clen);
2141 doutf8 = DO_UTF8(dstr);
2144 if (SvTAINTED(dstr))
2145 rxtainted |= SUBST_TAINT_REPL;
2152 /* can do inplace substitution? */
2157 && (I32)clen <= RX_MINLENRET(rx)
2158 && (once || !(r_flags & REXEC_COPY_STR))
2159 && !(RX_EXTFLAGS(rx) & RXf_NO_INPLACE_SUBST)
2160 && (!doutf8 || SvUTF8(TARG))
2161 && !(rpm->op_pmflags & PMf_NONDESTRUCT))
2165 if (SvIsCOW(TARG)) {
2166 if (!force_on_match)
2168 assert(SvVOK(TARG));
2171 if (force_on_match) {
2172 /* redo the first match, this time with the orig var
2173 * forced into being a string */
2175 orig = SvPV_force_nomg(TARG, len);
2181 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2182 rxtainted |= SUBST_TAINT_PAT;
2183 m = orig + RX_OFFS(rx)[0].start;
2184 d = orig + RX_OFFS(rx)[0].end;
2186 if (m - s > strend - d) { /* faster to shorten from end */
2189 Copy(c, m, clen, char);
2194 Move(d, m, i, char);
2198 SvCUR_set(TARG, m - s);
2200 else { /* faster from front */
2204 Move(s, d - i, i, char);
2207 Copy(c, d, clen, char);
2214 d = s = RX_OFFS(rx)[0].start + orig;
2217 if (iters++ > maxiters)
2218 DIE(aTHX_ "Substitution loop");
2219 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2220 rxtainted |= SUBST_TAINT_PAT;
2221 m = RX_OFFS(rx)[0].start + orig;
2224 Move(s, d, i, char);
2228 Copy(c, d, clen, char);
2231 s = RX_OFFS(rx)[0].end + orig;
2232 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
2234 /* don't match same null twice */
2235 REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW));
2238 SvCUR_set(TARG, d - SvPVX_const(TARG) + i);
2239 Move(s, d, i+1, char); /* include the NUL */
2249 if (force_on_match) {
2250 /* redo the first match, this time with the orig var
2251 * forced into being a string */
2253 if (rpm->op_pmflags & PMf_NONDESTRUCT) {
2254 /* I feel that it should be possible to avoid this mortal copy
2255 given that the code below copies into a new destination.
2256 However, I suspect it isn't worth the complexity of
2257 unravelling the C<goto force_it> for the small number of
2258 cases where it would be viable to drop into the copy code. */
2259 TARG = sv_2mortal(newSVsv(TARG));
2261 orig = SvPV_force_nomg(TARG, len);
2267 if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */
2268 rxtainted |= SUBST_TAINT_PAT;
2270 s = RX_OFFS(rx)[0].start + orig;
2271 dstr = newSVpvn_flags(orig, s-orig,
2272 SVs_TEMP | (DO_UTF8(TARG) ? SVf_UTF8 : 0));
2277 /* note that a whole bunch of local vars are saved here for
2278 * use by pp_substcont: here's a list of them in case you're
2279 * searching for places in this sub that uses a particular var:
2280 * iters maxiters r_flags oldsave rxtainted orig dstr targ
2281 * s m strend rx once */
2283 RETURNOP(cPMOP->op_pmreplrootu.op_pmreplroot);
2287 if (iters++ > maxiters)
2288 DIE(aTHX_ "Substitution loop");
2289 if (RX_MATCH_TAINTED(rx))
2290 rxtainted |= SUBST_TAINT_PAT;
2291 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
2293 char *old_orig = orig;
2294 assert(RX_SUBOFFSET(rx) == 0);
2296 orig = RX_SUBBEG(rx);
2297 s = orig + (old_s - old_orig);
2298 strend = s + (strend - old_s);
2300 m = RX_OFFS(rx)[0].start + orig;
2301 sv_catpvn_nomg_maybeutf8(dstr, s, m - s, DO_UTF8(TARG));
2302 s = RX_OFFS(rx)[0].end + orig;
2304 /* replacement already stringified */
2306 sv_catpvn_nomg_maybeutf8(dstr, c, clen, doutf8);
2311 if (!nsv) nsv = sv_newmortal();
2312 sv_copypv(nsv, repl);
2313 if (!DO_UTF8(nsv)) sv_recode_to_utf8(nsv, PL_encoding);
2314 sv_catsv(dstr, nsv);
2316 else sv_catsv(dstr, repl);
2317 if (SvTAINTED(repl))
2318 rxtainted |= SUBST_TAINT_REPL;
2322 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
2324 REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW));
2325 sv_catpvn_nomg_maybeutf8(dstr, s, strend - s, DO_UTF8(TARG));
2327 if (rpm->op_pmflags & PMf_NONDESTRUCT) {
2328 /* From here on down we're using the copy, and leaving the original
2335 /* The match may make the string COW. If so, brilliant, because
2336 that's just saved us one malloc, copy and free - the regexp has
2337 donated the old buffer, and we malloc an entirely new one, rather
2338 than the regexp malloc()ing a buffer and copying our original,
2339 only for us to throw it away here during the substitution. */
2340 if (SvIsCOW(TARG)) {
2341 sv_force_normal_flags(TARG, SV_COW_DROP_PV);
2347 SvPV_set(TARG, SvPVX(dstr));
2348 SvCUR_set(TARG, SvCUR(dstr));
2349 SvLEN_set(TARG, SvLEN(dstr));
2350 SvFLAGS(TARG) |= SvUTF8(dstr);
2351 SvPV_set(dstr, NULL);
2358 if (!(rpm->op_pmflags & PMf_NONDESTRUCT)) {
2359 (void)SvPOK_only_UTF8(TARG);
2362 /* See "how taint works" above */
2364 if ((rxtainted & SUBST_TAINT_PAT) ||
2365 ((rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT)) ==
2366 (SUBST_TAINT_STR|SUBST_TAINT_RETAINT))
2368 (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */
2370 if (!(rxtainted & SUBST_TAINT_BOOLRET)
2371 && (rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT))
2373 SvTAINTED_on(TOPs); /* taint return value */
2375 SvTAINTED_off(TOPs); /* may have got tainted earlier */
2377 /* needed for mg_set below */
2379 cBOOL(rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL))
2383 SvSETMAGIC(TARG); /* PL_tainted must be correctly set for this mg_set */
2385 LEAVE_SCOPE(oldsave);
2394 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2395 ++*PL_markstack_ptr;
2397 LEAVE_with_name("grep_item"); /* exit inner scope */
2400 if (PL_stack_base + *PL_markstack_ptr > SP) {
2402 const I32 gimme = GIMME_V;
2404 LEAVE_with_name("grep"); /* exit outer scope */
2405 (void)POPMARK; /* pop src */
2406 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2407 (void)POPMARK; /* pop dst */
2408 SP = PL_stack_base + POPMARK; /* pop original mark */
2409 if (gimme == G_SCALAR) {
2410 if (PL_op->op_private & OPpGREP_LEX) {
2411 SV* const sv = sv_newmortal();
2412 sv_setiv(sv, items);
2420 else if (gimme == G_ARRAY)
2427 ENTER_with_name("grep_item"); /* enter inner scope */
2430 src = PL_stack_base[*PL_markstack_ptr];
2431 if (SvPADTMP(src) && !IS_PADGV(src)) {
2432 src = PL_stack_base[*PL_markstack_ptr] = sv_mortalcopy(src);
2436 if (PL_op->op_private & OPpGREP_LEX)
2437 PAD_SVl(PL_op->op_targ) = src;
2441 RETURNOP(cLOGOP->op_other);
2455 if (CxMULTICALL(&cxstack[cxstack_ix]))
2459 cxstack_ix++; /* temporarily protect top context */
2462 if (gimme == G_SCALAR) {
2465 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2466 if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
2467 && !SvMAGICAL(TOPs)) {
2468 *MARK = SvREFCNT_inc(TOPs);
2473 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2475 *MARK = sv_mortalcopy(sv);
2476 SvREFCNT_dec_NN(sv);
2479 else if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1
2480 && !SvMAGICAL(TOPs)) {
2484 *MARK = sv_mortalcopy(TOPs);
2488 *MARK = &PL_sv_undef;
2492 else if (gimme == G_ARRAY) {
2493 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2494 if (!SvTEMP(*MARK) || SvREFCNT(*MARK) != 1
2495 || SvMAGICAL(*MARK)) {
2496 *MARK = sv_mortalcopy(*MARK);
2497 TAINT_NOT; /* Each item is independent */
2505 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2506 PL_curpm = newpm; /* ... and pop $1 et al */
2509 return cx->blk_sub.retop;
2519 const bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2522 DIE(aTHX_ "Not a CODE reference");
2523 switch (SvTYPE(sv)) {
2524 /* This is overwhelming the most common case: */
2527 if (!(cv = GvCVu((const GV *)sv))) {
2529 cv = sv_2cv(sv, &stash, &gv, 0);
2538 if(isGV_with_GP(sv)) goto we_have_a_glob;
2541 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2543 SP = PL_stack_base + POPMARK;
2551 sv = amagic_deref_call(sv, to_cv_amg);
2552 /* Don't SPAGAIN here. */
2559 DIE(aTHX_ PL_no_usym, "a subroutine");
2560 sym = SvPV_nomg_const(sv, len);
2561 if (PL_op->op_private & HINT_STRICT_REFS)
2562 DIE(aTHX_ "Can't use string (\"%" SVf32 "\"%s) as a subroutine ref while \"strict refs\" in use", sv, len>32 ? "..." : "");
2563 cv = get_cvn_flags(sym, len, GV_ADD|SvUTF8(sv));
2566 cv = MUTABLE_CV(SvRV(sv));
2567 if (SvTYPE(cv) == SVt_PVCV)
2572 DIE(aTHX_ "Not a CODE reference");
2573 /* This is the second most common case: */
2575 cv = MUTABLE_CV(sv);
2582 if (CvCLONE(cv) && ! CvCLONED(cv))
2583 DIE(aTHX_ "Closure prototype called");
2584 if (!CvROOT(cv) && !CvXSUB(cv)) {
2588 /* anonymous or undef'd function leaves us no recourse */
2589 if (CvANON(cv) || !(gv = CvGV(cv))) {
2591 DIE(aTHX_ "Undefined subroutine &%"HEKf" called",
2592 HEKfARG(CvNAME_HEK(cv)));
2593 DIE(aTHX_ "Undefined subroutine called");
2596 /* autoloaded stub? */
2597 if (cv != GvCV(gv)) {
2600 /* should call AUTOLOAD now? */
2603 if ((autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2604 GvNAMEUTF8(gv) ? SVf_UTF8 : 0)))
2610 sub_name = sv_newmortal();
2611 gv_efullname3(sub_name, gv, NULL);
2612 DIE(aTHX_ "Undefined subroutine &%"SVf" called", SVfARG(sub_name));
2621 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2622 Perl_get_db_sub(aTHX_ &sv, cv);
2624 PL_curcopdb = PL_curcop;
2626 /* check for lsub that handles lvalue subroutines */
2627 cv = GvCV(gv_HVadd(gv_fetchpvs("DB::lsub", GV_ADDMULTI, SVt_PVHV)));
2628 /* if lsub not found then fall back to DB::sub */
2629 if (!cv) cv = GvCV(PL_DBsub);
2631 cv = GvCV(PL_DBsub);
2634 if (!cv || (!CvXSUB(cv) && !CvSTART(cv)))
2635 DIE(aTHX_ "No DB::sub routine defined");
2638 if (!(CvISXSUB(cv))) {
2639 /* This path taken at least 75% of the time */
2641 I32 items = SP - MARK;
2642 PADLIST * const padlist = CvPADLIST(cv);
2643 PUSHBLOCK(cx, CXt_SUB, MARK);
2645 cx->blk_sub.retop = PL_op->op_next;
2647 if (CvDEPTH(cv) >= 2) {
2648 PERL_STACK_OVERFLOW_CHECK();
2649 pad_push(padlist, CvDEPTH(cv));
2652 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2654 AV *const av = MUTABLE_AV(PAD_SVl(0));
2656 /* @_ is normally not REAL--this should only ever
2657 * happen when DB::sub() calls things that modify @_ */
2662 cx->blk_sub.savearray = GvAV(PL_defgv);
2663 GvAV(PL_defgv) = MUTABLE_AV(SvREFCNT_inc_simple(av));
2664 CX_CURPAD_SAVE(cx->blk_sub);
2665 cx->blk_sub.argarray = av;
2668 if (items - 1 > AvMAX(av)) {
2669 SV **ary = AvALLOC(av);
2670 AvMAX(av) = items - 1;
2671 Renew(ary, items, SV*);
2676 Copy(MARK,AvARRAY(av),items,SV*);
2677 AvFILLp(av) = items - 1;
2683 if (SvPADTMP(*MARK) && !IS_PADGV(*MARK))
2684 *MARK = sv_mortalcopy(*MARK);
2691 if ((cx->blk_u16 & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO &&
2693 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2694 /* warning must come *after* we fully set up the context
2695 * stuff so that __WARN__ handlers can safely dounwind()
2698 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION)
2699 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2700 sub_crush_depth(cv);
2701 RETURNOP(CvSTART(cv));
2704 I32 markix = TOPMARK;
2709 if (((PL_op->op_private
2710 & PUSHSUB_GET_LVALUE_MASK(Perl_is_lvalue_sub)
2711 ) & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO &&
2713 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2716 /* Need to copy @_ to stack. Alternative may be to
2717 * switch stack to @_, and copy return values
2718 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2719 AV * const av = GvAV(PL_defgv);
2720 const I32 items = AvFILLp(av) + 1; /* @_ is not tieable */
2723 /* Mark is at the end of the stack. */
2725 Copy(AvARRAY(av), SP + 1, items, SV*);
2730 /* We assume first XSUB in &DB::sub is the called one. */
2732 SAVEVPTR(PL_curcop);
2733 PL_curcop = PL_curcopdb;
2736 /* Do we need to open block here? XXXX */
2738 /* CvXSUB(cv) must not be NULL because newXS() refuses NULL xsub address */
2740 CvXSUB(cv)(aTHX_ cv);
2742 /* Enforce some sanity in scalar context. */
2743 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2744 if (markix > PL_stack_sp - PL_stack_base)
2745 *(PL_stack_base + markix) = &PL_sv_undef;
2747 *(PL_stack_base + markix) = *PL_stack_sp;
2748 PL_stack_sp = PL_stack_base + markix;
2756 Perl_sub_crush_depth(pTHX_ CV *cv)
2758 PERL_ARGS_ASSERT_SUB_CRUSH_DEPTH;
2761 Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on anonymous subroutine");
2763 HEK *const hek = CvNAME_HEK(cv);
2766 tmpstr = sv_2mortal(newSVhek(hek));
2769 tmpstr = sv_newmortal();
2770 gv_efullname3(tmpstr, CvGV(cv), NULL);
2772 Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on subroutine \"%"SVf"\"",
2781 SV* const elemsv = POPs;
2782 IV elem = SvIV(elemsv);
2783 AV *const av = MUTABLE_AV(POPs);
2784 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
2785 const U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > av_len(av));
2786 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
2787 bool preeminent = TRUE;
2790 if (SvROK(elemsv) && !SvGAMAGIC(elemsv) && ckWARN(WARN_MISC))
2791 Perl_warner(aTHX_ packWARN(WARN_MISC),
2792 "Use of reference \"%"SVf"\" as array index",
2794 if (SvTYPE(av) != SVt_PVAV)
2801 /* If we can determine whether the element exist,
2802 * Try to preserve the existenceness of a tied array
2803 * element by using EXISTS and DELETE if possible.
2804 * Fallback to FETCH and STORE otherwise. */
2805 if (SvCANEXISTDELETE(av))
2806 preeminent = av_exists(av, elem);
2809 svp = av_fetch(av, elem, lval && !defer);
2811 #ifdef PERL_MALLOC_WRAP
2812 if (SvUOK(elemsv)) {
2813 const UV uv = SvUV(elemsv);
2814 elem = uv > IV_MAX ? IV_MAX : uv;
2816 else if (SvNOK(elemsv))
2817 elem = (IV)SvNV(elemsv);
2819 static const char oom_array_extend[] =
2820 "Out of memory during array extend"; /* Duplicated in av.c */
2821 MEM_WRAP_CHECK_1(elem,SV*,oom_array_extend);
2824 if (!svp || *svp == &PL_sv_undef) {
2827 DIE(aTHX_ PL_no_aelem, elem);
2828 lv = sv_newmortal();
2829 sv_upgrade(lv, SVt_PVLV);
2831 sv_magic(lv, NULL, PERL_MAGIC_defelem, NULL, 0);
2832 LvTARG(lv) = SvREFCNT_inc_simple(av);
2833 LvTARGOFF(lv) = elem;
2840 save_aelem(av, elem, svp);
2842 SAVEADELETE(av, elem);
2844 else if (PL_op->op_private & OPpDEREF) {
2845 PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF));
2849 sv = (svp ? *svp : &PL_sv_undef);
2850 if (!lval && SvRMAGICAL(av) && SvGMAGICAL(sv)) /* see note in pp_helem() */
2857 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2859 PERL_ARGS_ASSERT_VIVIFY_REF;
2864 Perl_croak_no_modify();
2865 prepare_SV_for_RV(sv);
2868 SvRV_set(sv, newSV(0));
2871 SvRV_set(sv, MUTABLE_SV(newAV()));
2874 SvRV_set(sv, MUTABLE_SV(newHV()));
2881 if (SvGMAGICAL(sv)) {
2882 /* copy the sv without magic to prevent magic from being
2884 SV* msv = sv_newmortal();
2885 sv_setsv_nomg(msv, sv);
2894 SV* const sv = TOPs;
2897 SV* const rsv = SvRV(sv);
2898 if (SvTYPE(rsv) == SVt_PVCV) {
2904 SETs(method_common(sv, NULL));
2911 SV* const sv = cSVOP_sv;
2912 U32 hash = SvSHARED_HASH(sv);
2914 XPUSHs(method_common(sv, &hash));
2919 S_method_common(pTHX_ SV* meth, U32* hashp)
2926 SV * const sv = PL_stack_base + TOPMARK == PL_stack_sp
2927 ? (Perl_croak(aTHX_ "Can't call method \"%"SVf"\" without a "
2928 "package or object reference", SVfARG(meth)),
2930 : *(PL_stack_base + TOPMARK + 1);
2932 PERL_ARGS_ASSERT_METHOD_COMMON;
2936 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" on an undefined value",
2941 ob = MUTABLE_SV(SvRV(sv));
2942 else if (!SvOK(sv)) goto undefined;
2943 else if (isGV_with_GP(sv)) {
2945 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" "
2946 "without a package or object reference",
2949 if (SvTYPE(ob) == SVt_PVLV && LvTYPE(ob) == 'y') {
2950 assert(!LvTARGLEN(ob));
2954 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV(ob));
2957 /* this isn't a reference */
2960 const char * const packname = SvPV_nomg_const(sv, packlen);
2961 const bool packname_is_utf8 = !!SvUTF8(sv);
2962 const HE* const he =
2963 (const HE *)hv_common(
2964 PL_stashcache, NULL, packname, packlen,
2965 packname_is_utf8 ? HVhek_UTF8 : 0, 0, NULL, 0
2969 stash = INT2PTR(HV*,SvIV(HeVAL(he)));
2970 DEBUG_o(Perl_deb(aTHX_ "PL_stashcache hit %p for '%"SVf"'\n",
2975 if (!(iogv = gv_fetchpvn_flags(
2976 packname, packlen, SVf_UTF8 * packname_is_utf8, SVt_PVIO
2978 !(ob=MUTABLE_SV(GvIO(iogv))))
2980 /* this isn't the name of a filehandle either */
2983 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" "
2984 "without a package or object reference",
2987 /* assume it's a package name */
2988 stash = gv_stashpvn(packname, packlen, packname_is_utf8 ? SVf_UTF8 : 0);
2992 SV* const ref = newSViv(PTR2IV(stash));
2993 (void)hv_store(PL_stashcache, packname,
2994 packname_is_utf8 ? -(I32)packlen : (I32)packlen, ref, 0);
2995 DEBUG_o(Perl_deb(aTHX_ "PL_stashcache caching %p for '%"SVf"'\n",
3000 /* it _is_ a filehandle name -- replace with a reference */
3001 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV(MUTABLE_SV(iogv)));
3004 /* if we got here, ob should be an object or a glob */
3005 if (!ob || !(SvOBJECT(ob)
3006 || (isGV_with_GP(ob)
3007 && (ob = MUTABLE_SV(GvIO((const GV *)ob)))
3010 Perl_croak(aTHX_ "Can't call method \"%"SVf"\" on unblessed reference",
3011 SVfARG((SvSCREAM(meth) && strEQ(SvPV_nolen_const(meth),"isa"))
3012 ? newSVpvs_flags("DOES", SVs_TEMP)
3016 stash = SvSTASH(ob);
3019 /* NOTE: stash may be null, hope hv_fetch_ent and
3020 gv_fetchmethod can cope (it seems they can) */
3022 /* shortcut for simple names */
3024 const HE* const he = hv_fetch_ent(stash, meth, 0, *hashp);
3026 gv = MUTABLE_GV(HeVAL(he));
3027 if (isGV(gv) && GvCV(gv) &&
3028 (!GvCVGEN(gv) || GvCVGEN(gv)
3029 == (PL_sub_generation + HvMROMETA(stash)->cache_gen)))
3030 return MUTABLE_SV(GvCV(gv));
3034 gv = gv_fetchmethod_sv_flags(stash ? stash : MUTABLE_HV(packsv),
3035 meth, GV_AUTOLOAD | GV_CROAK);
3039 return isGV(gv) ? MUTABLE_SV(GvCV(gv)) : MUTABLE_SV(gv);
3044 * c-indentation-style: bsd
3046 * indent-tabs-mode: nil
3049 * ex: set ts=8 sts=4 sw=4 et: