3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 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!
19 /* This file contains 'hot' pp ("push/pop") functions that
20 * execute the opcodes that make up a perl program. A typical pp function
21 * expects to find its arguments on the stack, and usually pushes its
22 * results onto the stack, hence the 'pp' terminology. Each OP structure
23 * contains a pointer to the relevant pp_foo() function.
25 * By 'hot', we mean common ops whose execution speed is critical.
26 * By gathering them together into a single file, we encourage
27 * CPU cache hits on hot code. Also it could be taken as a warning not to
28 * change any code in this file unless you're sure it won't affect
33 #define PERL_IN_PP_HOT_C
42 if ( PL_op->op_flags & OPf_SPECIAL )
43 /* This is a const op added to hold the hints hash for
44 pp_entereval. The hash can be modified by the code
45 being eval'ed, so we return a copy instead. */
46 XPUSHs(sv_2mortal((SV*)Perl_hv_copy_hints_hv(aTHX_ (HV*)cSVOP_sv)));
56 PL_curcop = (COP*)PL_op;
57 TAINT_NOT; /* Each statement is presumed innocent */
58 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
68 if (PL_op->op_private & OPpLVAL_INTRO)
69 PUSHs(save_scalar(cGVOP_gv));
71 PUSHs(GvSVn(cGVOP_gv));
84 PL_curcop = (COP*)PL_op;
91 PUSHMARK(PL_stack_sp);
106 XPUSHs((SV*)cGVOP_gv);
116 if (PL_op->op_type == OP_AND)
118 RETURNOP(cLOGOP->op_other);
124 dVAR; dSP; dPOPTOPssrl;
126 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
127 SV * const temp = left;
128 left = right; right = temp;
130 if (PL_tainting && PL_tainted && !SvTAINTED(left))
132 if (PL_op->op_private & OPpASSIGN_CV_TO_GV) {
133 SV * const cv = SvRV(left);
134 const U32 cv_type = SvTYPE(cv);
135 const U32 gv_type = SvTYPE(right);
136 const bool got_coderef = cv_type == SVt_PVCV || cv_type == SVt_PVFM;
142 /* Can do the optimisation if right (LVALUE) is not a typeglob,
143 left (RVALUE) is a reference to something, and we're in void
145 if (!got_coderef && gv_type != SVt_PVGV && GIMME_V == G_VOID) {
146 /* Is the target symbol table currently empty? */
147 GV * const gv = gv_fetchsv(right, GV_NOINIT, SVt_PVGV);
148 if (SvTYPE(gv) != SVt_PVGV && !SvOK(gv)) {
149 /* Good. Create a new proxy constant subroutine in the target.
150 The gv becomes a(nother) reference to the constant. */
151 SV *const value = SvRV(cv);
153 SvUPGRADE((SV *)gv, SVt_RV);
154 SvPCS_IMPORTED_on(gv);
156 SvREFCNT_inc_simple_void(value);
162 /* Need to fix things up. */
163 if (gv_type != SVt_PVGV) {
164 /* Need to fix GV. */
165 right = (SV*)gv_fetchsv(right, GV_ADD, SVt_PVGV);
169 /* We've been returned a constant rather than a full subroutine,
170 but they expect a subroutine reference to apply. */
173 SvREFCNT_inc_void(SvRV(cv));
174 /* newCONSTSUB takes a reference count on the passed in SV
175 from us. We set the name to NULL, otherwise we get into
176 all sorts of fun as the reference to our new sub is
177 donated to the GV that we're about to assign to.
179 SvRV_set(left, (SV *)newCONSTSUB(GvSTASH(right), NULL,
184 /* What can happen for the corner case *{"BONK"} = \&{"BONK"};
186 First: ops for \&{"BONK"}; return us the constant in the
188 Second: ops for *{"BONK"} cause that symbol table entry
189 (and our reference to it) to be upgraded from RV
191 Thirdly: We get here. cv is actually PVGV now, and its
192 GvCV() is actually the subroutine we're looking for
194 So change the reference so that it points to the subroutine
195 of that typeglob, as that's what they were after all along.
197 GV *const upgraded = (GV *) cv;
198 CV *const source = GvCV(upgraded);
201 assert(CvFLAGS(source) & CVf_CONST);
203 SvREFCNT_inc_void(source);
204 SvREFCNT_dec(upgraded);
205 SvRV_set(left, (SV *)source);
210 SvSetMagicSV(right, left);
219 RETURNOP(cLOGOP->op_other);
221 RETURNOP(cLOGOP->op_next);
228 TAINT_NOT; /* Each statement is presumed innocent */
229 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
231 oldsave = PL_scopestack[PL_scopestack_ix - 1];
232 LEAVE_SCOPE(oldsave);
238 dVAR; dSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
243 const char *rpv = NULL;
245 bool rcopied = FALSE;
247 if (TARG == right && right != left) {
248 /* mg_get(right) may happen here ... */
249 rpv = SvPV_const(right, rlen);
250 rbyte = !DO_UTF8(right);
251 right = sv_2mortal(newSVpvn(rpv, rlen));
252 rpv = SvPV_const(right, rlen); /* no point setting UTF-8 here */
258 const char* const lpv = SvPV_const(left, llen); /* mg_get(left) may happen here */
259 lbyte = !DO_UTF8(left);
260 sv_setpvn(TARG, lpv, llen);
266 else { /* TARG == left */
268 SvGETMAGIC(left); /* or mg_get(left) may happen here */
270 if (left == right && ckWARN(WARN_UNINITIALIZED))
271 report_uninit(right);
272 sv_setpvn(left, "", 0);
274 (void)SvPV_nomg_const(left, llen); /* Needed to set UTF8 flag */
275 lbyte = !DO_UTF8(left);
280 /* or mg_get(right) may happen here */
282 rpv = SvPV_const(right, rlen);
283 rbyte = !DO_UTF8(right);
285 if (lbyte != rbyte) {
287 sv_utf8_upgrade_nomg(TARG);
290 right = sv_2mortal(newSVpvn(rpv, rlen));
291 sv_utf8_upgrade_nomg(right);
292 rpv = SvPV_const(right, rlen);
295 sv_catpvn_nomg(TARG, rpv, rlen);
306 if (PL_op->op_flags & OPf_MOD) {
307 if (PL_op->op_private & OPpLVAL_INTRO)
308 if (!(PL_op->op_private & OPpPAD_STATE))
309 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
310 if (PL_op->op_private & OPpDEREF) {
312 vivify_ref(PAD_SVl(PL_op->op_targ), PL_op->op_private & OPpDEREF);
322 tryAMAGICunTARGET(iter, 0);
323 PL_last_in_gv = (GV*)(*PL_stack_sp--);
324 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
325 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
326 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
329 XPUSHs((SV*)PL_last_in_gv);
332 PL_last_in_gv = (GV*)(*PL_stack_sp--);
335 return do_readline();
340 dVAR; dSP; tryAMAGICbinSET(eq,0);
341 #ifndef NV_PRESERVES_UV
342 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
344 SETs(boolSV(SvRV(TOPs) == SvRV(TOPp1s)));
348 #ifdef PERL_PRESERVE_IVUV
351 /* Unless the left argument is integer in range we are going
352 to have to use NV maths. Hence only attempt to coerce the
353 right argument if we know the left is integer. */
356 const bool auvok = SvUOK(TOPm1s);
357 const bool buvok = SvUOK(TOPs);
359 if (auvok == buvok) { /* ## IV == IV or UV == UV ## */
360 /* Casting IV to UV before comparison isn't going to matter
361 on 2s complement. On 1s complement or sign&magnitude
362 (if we have any of them) it could to make negative zero
363 differ from normal zero. As I understand it. (Need to
364 check - is negative zero implementation defined behaviour
366 const UV buv = SvUVX(POPs);
367 const UV auv = SvUVX(TOPs);
369 SETs(boolSV(auv == buv));
372 { /* ## Mixed IV,UV ## */
376 /* == is commutative so doesn't matter which is left or right */
378 /* top of stack (b) is the iv */
387 /* As uv is a UV, it's >0, so it cannot be == */
390 /* we know iv is >= 0 */
391 SETs(boolSV((UV)iv == SvUVX(uvp)));
398 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
400 if (Perl_isnan(left) || Perl_isnan(right))
402 SETs(boolSV(left == right));
405 SETs(boolSV(TOPn == value));
414 if (SvTYPE(TOPs) >= SVt_PVGV && SvTYPE(TOPs) != SVt_PVLV)
415 DIE(aTHX_ PL_no_modify);
416 if (!SvREADONLY(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
417 && SvIVX(TOPs) != IV_MAX)
419 SvIV_set(TOPs, SvIVX(TOPs) + 1);
420 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
422 else /* Do all the PERL_PRESERVE_IVUV conditionals in sv_inc */
434 if (PL_op->op_type == OP_OR)
436 RETURNOP(cLOGOP->op_other);
445 const int op_type = PL_op->op_type;
446 const bool is_dor = (op_type == OP_DOR || op_type == OP_DORASSIGN);
450 if (!sv || !SvANY(sv)) {
451 if (op_type == OP_DOR)
453 RETURNOP(cLOGOP->op_other);
459 if (!sv || !SvANY(sv))
464 switch (SvTYPE(sv)) {
466 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
470 if (HvARRAY(sv) || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
474 if (CvROOT(sv) || CvXSUB(sv))
487 if(op_type == OP_DOR)
489 RETURNOP(cLOGOP->op_other);
491 /* assuming OP_DEFINED */
499 dVAR; dSP; dATARGET; bool useleft; SV *svl, *svr;
500 tryAMAGICbin(add,opASSIGN);
501 svl = sv_2num(TOPm1s);
503 useleft = USE_LEFT(svl);
504 #ifdef PERL_PRESERVE_IVUV
505 /* We must see if we can perform the addition with integers if possible,
506 as the integer code detects overflow while the NV code doesn't.
507 If either argument hasn't had a numeric conversion yet attempt to get
508 the IV. It's important to do this now, rather than just assuming that
509 it's not IOK as a PV of "9223372036854775806" may not take well to NV
510 addition, and an SV which is NOK, NV=6.0 ought to be coerced to
511 integer in case the second argument is IV=9223372036854775806
512 We can (now) rely on sv_2iv to do the right thing, only setting the
513 public IOK flag if the value in the NV (or PV) slot is truly integer.
515 A side effect is that this also aggressively prefers integer maths over
516 fp maths for integer values.
518 How to detect overflow?
520 C 99 section 6.2.6.1 says
522 The range of nonnegative values of a signed integer type is a subrange
523 of the corresponding unsigned integer type, and the representation of
524 the same value in each type is the same. A computation involving
525 unsigned operands can never overflow, because a result that cannot be
526 represented by the resulting unsigned integer type is reduced modulo
527 the number that is one greater than the largest value that can be
528 represented by the resulting type.
532 which I read as "unsigned ints wrap."
534 signed integer overflow seems to be classed as "exception condition"
536 If an exceptional condition occurs during the evaluation of an
537 expression (that is, if the result is not mathematically defined or not
538 in the range of representable values for its type), the behavior is
541 (6.5, the 5th paragraph)
543 I had assumed that on 2s complement machines signed arithmetic would
544 wrap, hence coded pp_add and pp_subtract on the assumption that
545 everything perl builds on would be happy. After much wailing and
546 gnashing of teeth it would seem that irix64 knows its ANSI spec well,
547 knows that it doesn't need to, and doesn't. Bah. Anyway, the all-
548 unsigned code below is actually shorter than the old code. :-)
553 /* Unless the left argument is integer in range we are going to have to
554 use NV maths. Hence only attempt to coerce the right argument if
555 we know the left is integer. */
563 /* left operand is undef, treat as zero. + 0 is identity,
564 Could SETi or SETu right now, but space optimise by not adding
565 lots of code to speed up what is probably a rarish case. */
567 /* Left operand is defined, so is it IV? */
570 if ((auvok = SvUOK(svl)))
573 register const IV aiv = SvIVX(svl);
576 auvok = 1; /* Now acting as a sign flag. */
577 } else { /* 2s complement assumption for IV_MIN */
585 bool result_good = 0;
588 bool buvok = SvUOK(svr);
593 register const IV biv = SvIVX(svr);
600 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
601 else "IV" now, independent of how it came in.
602 if a, b represents positive, A, B negative, a maps to -A etc
607 all UV maths. negate result if A negative.
608 add if signs same, subtract if signs differ. */
614 /* Must get smaller */
620 /* result really should be -(auv-buv). as its negation
621 of true value, need to swap our result flag */
638 if (result <= (UV)IV_MIN)
641 /* result valid, but out of range for IV. */
646 } /* Overflow, drop through to NVs. */
651 NV value = SvNV(svr);
654 /* left operand is undef, treat as zero. + 0.0 is identity. */
658 SETn( value + SvNV(svl) );
666 AV * const av = PL_op->op_flags & OPf_SPECIAL ?
667 (AV*)PAD_SV(PL_op->op_targ) : GvAV(cGVOP_gv);
668 const U32 lval = PL_op->op_flags & OPf_MOD;
669 SV** const svp = av_fetch(av, PL_op->op_private, lval);
670 SV *sv = (svp ? *svp : &PL_sv_undef);
672 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
673 sv = sv_mortalcopy(sv);
680 dVAR; dSP; dMARK; dTARGET;
682 do_join(TARG, *MARK, MARK, SP);
693 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
694 * will be enough to hold an OP*.
696 SV* const sv = sv_newmortal();
697 sv_upgrade(sv, SVt_PVLV);
699 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
707 /* Oversized hot code. */
711 dVAR; dSP; dMARK; dORIGMARK;
715 GV * const gv = (PL_op->op_flags & OPf_STACKED) ? (GV*)*++MARK : PL_defoutgv;
717 if (gv && (io = GvIO(gv))
718 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
721 if (MARK == ORIGMARK) {
722 /* If using default handle then we need to make space to
723 * pass object as 1st arg, so move other args up ...
727 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
731 *MARK = SvTIED_obj((SV*)io, mg);
734 call_method("PRINT", G_SCALAR);
742 if (!(io = GvIO(gv))) {
743 if ((GvEGV(gv)) && (io = GvIO(GvEGV(gv)))
744 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
746 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
747 report_evil_fh(gv, io, PL_op->op_type);
748 SETERRNO(EBADF,RMS_IFI);
751 else if (!(fp = IoOFP(io))) {
752 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
754 report_evil_fh(gv, io, OP_phoney_INPUT_ONLY);
755 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
756 report_evil_fh(gv, io, PL_op->op_type);
758 SETERRNO(EBADF,IoIFP(io)?RMS_FAC:RMS_IFI);
763 if (PL_ofs_sv && SvOK(PL_ofs_sv)) {
765 if (!do_print(*MARK, fp))
769 if (!do_print(PL_ofs_sv, fp)) { /* $, */
778 if (!do_print(*MARK, fp))
786 if (PL_op->op_type == OP_SAY) {
787 if (PerlIO_write(fp, "\n", 1) == 0 || PerlIO_error(fp))
790 else if (PL_ors_sv && SvOK(PL_ors_sv))
791 if (!do_print(PL_ors_sv, fp)) /* $\ */
794 if (IoFLAGS(io) & IOf_FLUSH)
795 if (PerlIO_flush(fp) == EOF)
805 XPUSHs(&PL_sv_undef);
812 const I32 gimme = GIMME_V;
813 static const char return_array_to_lvalue_scalar[] = "Can't return array to lvalue scalar context";
814 static const char return_hash_to_lvalue_scalar[] = "Can't return hash to lvalue scalar context";
815 static const char an_array[] = "an ARRAY";
816 static const char a_hash[] = "a HASH";
817 const bool is_pp_rv2av = PL_op->op_type == OP_RV2AV;
818 const svtype type = is_pp_rv2av ? SVt_PVAV : SVt_PVHV;
822 tryAMAGICunDEREF_var(is_pp_rv2av ? to_av_amg : to_hv_amg);
825 if (SvTYPE(sv) != type)
826 DIE(aTHX_ "Not %s reference", is_pp_rv2av ? an_array : a_hash);
827 if (PL_op->op_flags & OPf_REF) {
832 if (gimme != G_ARRAY)
833 Perl_croak(aTHX_ is_pp_rv2av ? return_array_to_lvalue_scalar
834 : return_hash_to_lvalue_scalar);
838 else if (PL_op->op_flags & OPf_MOD
839 && PL_op->op_private & OPpLVAL_INTRO)
840 Perl_croak(aTHX_ PL_no_localize_ref);
843 if (SvTYPE(sv) == type) {
844 if (PL_op->op_flags & OPf_REF) {
849 if (gimme != G_ARRAY)
851 is_pp_rv2av ? return_array_to_lvalue_scalar
852 : return_hash_to_lvalue_scalar);
860 if (SvTYPE(sv) != SVt_PVGV) {
861 if (SvGMAGICAL(sv)) {
866 gv = Perl_softref2xv(aTHX_ sv, is_pp_rv2av ? an_array : a_hash,
874 sv = is_pp_rv2av ? (SV*)GvAVn(gv) : (SV*)GvHVn(gv);
875 if (PL_op->op_private & OPpLVAL_INTRO)
876 sv = is_pp_rv2av ? (SV*)save_ary(gv) : (SV*)save_hash(gv);
877 if (PL_op->op_flags & OPf_REF) {
882 if (gimme != G_ARRAY)
884 is_pp_rv2av ? return_array_to_lvalue_scalar
885 : return_hash_to_lvalue_scalar);
893 AV *const av = (AV*)sv;
894 /* The guts of pp_rv2av, with no intenting change to preserve history
895 (until such time as we get tools that can do blame annotation across
896 whitespace changes. */
897 if (gimme == G_ARRAY) {
898 const I32 maxarg = AvFILL(av) + 1;
899 (void)POPs; /* XXXX May be optimized away? */
901 if (SvRMAGICAL(av)) {
903 for (i=0; i < (U32)maxarg; i++) {
904 SV ** const svp = av_fetch(av, i, FALSE);
905 /* See note in pp_helem, and bug id #27839 */
907 ? SvGMAGICAL(*svp) ? sv_mortalcopy(*svp) : *svp
912 Copy(AvARRAY(av), SP+1, maxarg, SV*);
916 else if (gimme == G_SCALAR) {
918 const I32 maxarg = AvFILL(av) + 1;
922 /* The guts of pp_rv2hv */
923 if (gimme == G_ARRAY) { /* array wanted */
927 else if (gimme == G_SCALAR) {
929 TARG = Perl_hv_scalar(aTHX_ (HV*)sv);
938 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
945 if (ckWARN(WARN_MISC)) {
947 if (relem == firstrelem &&
949 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
950 SvTYPE(SvRV(*relem)) == SVt_PVHV))
952 err = "Reference found where even-sized list expected";
955 err = "Odd number of elements in hash assignment";
956 Perl_warner(aTHX_ packWARN(WARN_MISC), err);
960 didstore = hv_store_ent(hash,*relem,tmpstr,0);
961 if (SvMAGICAL(hash)) {
962 if (SvSMAGICAL(tmpstr))
974 SV **lastlelem = PL_stack_sp;
975 SV **lastrelem = PL_stack_base + POPMARK;
976 SV **firstrelem = PL_stack_base + POPMARK + 1;
977 SV **firstlelem = lastrelem + 1;
990 SV **firsthashrelem = NULL; /* "= 0" keeps gcc 2.95 quiet */
992 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
995 /* If there's a common identifier on both sides we have to take
996 * special care that assigning the identifier on the left doesn't
997 * clobber a value on the right that's used later in the list.
999 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
1000 EXTEND_MORTAL(lastrelem - firstrelem + 1);
1001 for (relem = firstrelem; relem <= lastrelem; relem++) {
1002 if ((sv = *relem)) {
1003 TAINT_NOT; /* Each item is independent */
1004 *relem = sv_mortalcopy(sv);
1014 while (lelem <= lastlelem) {
1015 TAINT_NOT; /* Each item stands on its own, taintwise. */
1017 switch (SvTYPE(sv)) {
1020 magic = SvMAGICAL(ary) != 0;
1022 av_extend(ary, lastrelem - relem);
1024 while (relem <= lastrelem) { /* gobble up all the rest */
1027 sv = newSVsv(*relem);
1029 didstore = av_store(ary,i++,sv);
1038 if (PL_delaymagic & DM_ARRAY)
1039 SvSETMAGIC((SV*)ary);
1041 case SVt_PVHV: { /* normal hash */
1045 magic = SvMAGICAL(hash) != 0;
1047 firsthashrelem = relem;
1049 while (relem < lastrelem) { /* gobble up all the rest */
1051 sv = *relem ? *relem : &PL_sv_no;
1055 sv_setsv(tmpstr,*relem); /* value */
1056 *(relem++) = tmpstr;
1057 if (gimme != G_VOID && hv_exists_ent(hash, sv, 0))
1058 /* key overwrites an existing entry */
1060 didstore = hv_store_ent(hash,sv,tmpstr,0);
1062 if (SvSMAGICAL(tmpstr))
1069 if (relem == lastrelem) {
1070 do_oddball(hash, relem, firstrelem);
1076 if (SvIMMORTAL(sv)) {
1077 if (relem <= lastrelem)
1081 if (relem <= lastrelem) {
1082 sv_setsv(sv, *relem);
1086 sv_setsv(sv, &PL_sv_undef);
1091 if (PL_delaymagic & ~DM_DELAY) {
1092 if (PL_delaymagic & DM_UID) {
1093 #ifdef HAS_SETRESUID
1094 (void)setresuid((PL_delaymagic & DM_RUID) ? PL_uid : (Uid_t)-1,
1095 (PL_delaymagic & DM_EUID) ? PL_euid : (Uid_t)-1,
1098 # ifdef HAS_SETREUID
1099 (void)setreuid((PL_delaymagic & DM_RUID) ? PL_uid : (Uid_t)-1,
1100 (PL_delaymagic & DM_EUID) ? PL_euid : (Uid_t)-1);
1103 if ((PL_delaymagic & DM_UID) == DM_RUID) {
1104 (void)setruid(PL_uid);
1105 PL_delaymagic &= ~DM_RUID;
1107 # endif /* HAS_SETRUID */
1109 if ((PL_delaymagic & DM_UID) == DM_EUID) {
1110 (void)seteuid(PL_euid);
1111 PL_delaymagic &= ~DM_EUID;
1113 # endif /* HAS_SETEUID */
1114 if (PL_delaymagic & DM_UID) {
1115 if (PL_uid != PL_euid)
1116 DIE(aTHX_ "No setreuid available");
1117 (void)PerlProc_setuid(PL_uid);
1119 # endif /* HAS_SETREUID */
1120 #endif /* HAS_SETRESUID */
1121 PL_uid = PerlProc_getuid();
1122 PL_euid = PerlProc_geteuid();
1124 if (PL_delaymagic & DM_GID) {
1125 #ifdef HAS_SETRESGID
1126 (void)setresgid((PL_delaymagic & DM_RGID) ? PL_gid : (Gid_t)-1,
1127 (PL_delaymagic & DM_EGID) ? PL_egid : (Gid_t)-1,
1130 # ifdef HAS_SETREGID
1131 (void)setregid((PL_delaymagic & DM_RGID) ? PL_gid : (Gid_t)-1,
1132 (PL_delaymagic & DM_EGID) ? PL_egid : (Gid_t)-1);
1135 if ((PL_delaymagic & DM_GID) == DM_RGID) {
1136 (void)setrgid(PL_gid);
1137 PL_delaymagic &= ~DM_RGID;
1139 # endif /* HAS_SETRGID */
1141 if ((PL_delaymagic & DM_GID) == DM_EGID) {
1142 (void)setegid(PL_egid);
1143 PL_delaymagic &= ~DM_EGID;
1145 # endif /* HAS_SETEGID */
1146 if (PL_delaymagic & DM_GID) {
1147 if (PL_gid != PL_egid)
1148 DIE(aTHX_ "No setregid available");
1149 (void)PerlProc_setgid(PL_gid);
1151 # endif /* HAS_SETREGID */
1152 #endif /* HAS_SETRESGID */
1153 PL_gid = PerlProc_getgid();
1154 PL_egid = PerlProc_getegid();
1156 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
1160 if (gimme == G_VOID)
1161 SP = firstrelem - 1;
1162 else if (gimme == G_SCALAR) {
1165 SETi(lastrelem - firstrelem + 1 - duplicates);
1172 /* Removes from the stack the entries which ended up as
1173 * duplicated keys in the hash (fix for [perl #24380]) */
1174 Move(firsthashrelem + duplicates,
1175 firsthashrelem, duplicates, SV**);
1176 lastrelem -= duplicates;
1181 SP = firstrelem + (lastlelem - firstlelem);
1182 lelem = firstlelem + (relem - firstrelem);
1184 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
1193 register PMOP * const pm = cPMOP;
1194 REGEXP * rx = PM_GETRE(pm);
1195 SV * const pkg = CALLREG_PACKAGE(rx);
1196 SV * const rv = sv_newmortal();
1197 SV * const sv = newSVrv(rv, SvPV_nolen(pkg));
1198 if (rx->extflags & RXf_TAINTED)
1200 sv_magic(sv,(SV*)ReREFCNT_inc(rx), PERL_MAGIC_qr,0,0);
1208 register PMOP *pm = cPMOP;
1210 register const char *t;
1211 register const char *s;
1214 I32 r_flags = REXEC_CHECKED;
1215 const char *truebase; /* Start of string */
1216 register REGEXP *rx = PM_GETRE(pm);
1218 const I32 gimme = GIMME;
1221 const I32 oldsave = PL_savestack_ix;
1222 I32 update_minmatch = 1;
1223 I32 had_zerolen = 0;
1226 if (PL_op->op_flags & OPf_STACKED)
1228 else if (PL_op->op_private & OPpTARGET_MY)
1235 PUTBACK; /* EVAL blocks need stack_sp. */
1236 s = SvPV_const(TARG, len);
1238 DIE(aTHX_ "panic: pp_match");
1240 rxtainted = ((rx->extflags & RXf_TAINTED) ||
1241 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1244 RX_MATCH_UTF8_set(rx, DO_UTF8(TARG));
1246 /* PMdf_USED is set after a ?? matches once */
1249 SvREADONLY(PL_regex_pad[pm->op_pmoffset])
1251 pm->op_pmflags & PMf_USED
1255 if (gimme == G_ARRAY)
1262 /* empty pattern special-cased to use last successful pattern if possible */
1263 if (!rx->prelen && PL_curpm) {
1268 if (rx->minlen > (I32)len)
1273 /* XXXX What part of this is needed with true \G-support? */
1274 if ((global = dynpm->op_pmflags & PMf_GLOBAL)) {
1275 rx->offs[0].start = -1;
1276 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1277 MAGIC* const mg = mg_find(TARG, PERL_MAGIC_regex_global);
1278 if (mg && mg->mg_len >= 0) {
1279 if (!(rx->extflags & RXf_GPOS_SEEN))
1280 rx->offs[0].end = rx->offs[0].start = mg->mg_len;
1281 else if (rx->extflags & RXf_ANCH_GPOS) {
1282 r_flags |= REXEC_IGNOREPOS;
1283 rx->offs[0].end = rx->offs[0].start = mg->mg_len;
1284 } else if (rx->extflags & RXf_GPOS_FLOAT)
1287 rx->offs[0].end = rx->offs[0].start = mg->mg_len;
1288 minmatch = (mg->mg_flags & MGf_MINMATCH) ? rx->gofs + 1 : 0;
1289 update_minmatch = 0;
1293 /* XXX: comment out !global get safe $1 vars after a
1294 match, BUT be aware that this leads to dramatic slowdowns on
1295 /g matches against large strings. So far a solution to this problem
1296 appears to be quite tricky.
1297 Test for the unsafe vars are TODO for now. */
1298 if (( !global && rx->nparens)
1299 || SvTEMP(TARG) || PL_sawampersand ||
1300 (rx->extflags & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY)))
1301 r_flags |= REXEC_COPY_STR;
1303 r_flags |= REXEC_SCREAM;
1306 if (global && rx->offs[0].start != -1) {
1307 t = s = rx->offs[0].end + truebase - rx->gofs;
1308 if ((s + rx->minlen) > strend || s < truebase)
1310 if (update_minmatch++)
1311 minmatch = had_zerolen;
1313 if (rx->extflags & RXf_USE_INTUIT &&
1314 DO_UTF8(TARG) == ((rx->extflags & RXf_UTF8) != 0)) {
1315 /* FIXME - can PL_bostr be made const char *? */
1316 PL_bostr = (char *)truebase;
1317 s = CALLREG_INTUIT_START(rx, TARG, (char *)s, (char *)strend, r_flags, NULL);
1321 if ( (rx->extflags & RXf_CHECK_ALL)
1323 && !(rx->extflags & RXf_PMf_KEEPCOPY)
1324 && ((rx->extflags & RXf_NOSCAN)
1325 || !((rx->extflags & RXf_INTUIT_TAIL)
1326 && (r_flags & REXEC_SCREAM)))
1327 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1330 if (CALLREGEXEC(rx, (char*)s, (char *)strend, (char*)truebase,
1331 minmatch, TARG, NUM2PTR(void*, gpos), r_flags))
1334 if (dynpm->op_pmflags & PMf_ONCE) {
1336 SvREADONLY_on(PL_regex_pad[dynpm->op_pmoffset]);
1338 dynpm->op_pmflags |= PMf_USED;
1349 RX_MATCH_TAINTED_on(rx);
1350 TAINT_IF(RX_MATCH_TAINTED(rx));
1351 if (gimme == G_ARRAY) {
1352 const I32 nparens = rx->nparens;
1353 I32 i = (global && !nparens) ? 1 : 0;
1355 SPAGAIN; /* EVAL blocks could move the stack. */
1356 EXTEND(SP, nparens + i);
1357 EXTEND_MORTAL(nparens + i);
1358 for (i = !i; i <= nparens; i++) {
1359 PUSHs(sv_newmortal());
1360 if ((rx->offs[i].start != -1) && rx->offs[i].end != -1 ) {
1361 const I32 len = rx->offs[i].end - rx->offs[i].start;
1362 s = rx->offs[i].start + truebase;
1363 if (rx->offs[i].end < 0 || rx->offs[i].start < 0 ||
1364 len < 0 || len > strend - s)
1365 DIE(aTHX_ "panic: pp_match start/end pointers");
1366 sv_setpvn(*SP, s, len);
1367 if (DO_UTF8(TARG) && is_utf8_string((U8*)s, len))
1372 if (dynpm->op_pmflags & PMf_CONTINUE) {
1374 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1375 mg = mg_find(TARG, PERL_MAGIC_regex_global);
1377 #ifdef PERL_OLD_COPY_ON_WRITE
1379 sv_force_normal_flags(TARG, 0);
1381 mg = sv_magicext(TARG, NULL, PERL_MAGIC_regex_global,
1382 &PL_vtbl_mglob, NULL, 0);
1384 if (rx->offs[0].start != -1) {
1385 mg->mg_len = rx->offs[0].end;
1386 if (rx->offs[0].start + rx->gofs == (UV)rx->offs[0].end)
1387 mg->mg_flags |= MGf_MINMATCH;
1389 mg->mg_flags &= ~MGf_MINMATCH;
1392 had_zerolen = (rx->offs[0].start != -1
1393 && (rx->offs[0].start + rx->gofs
1394 == (UV)rx->offs[0].end));
1395 PUTBACK; /* EVAL blocks may use stack */
1396 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1401 LEAVE_SCOPE(oldsave);
1407 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1408 mg = mg_find(TARG, PERL_MAGIC_regex_global);
1412 #ifdef PERL_OLD_COPY_ON_WRITE
1414 sv_force_normal_flags(TARG, 0);
1416 mg = sv_magicext(TARG, NULL, PERL_MAGIC_regex_global,
1417 &PL_vtbl_mglob, NULL, 0);
1419 if (rx->offs[0].start != -1) {
1420 mg->mg_len = rx->offs[0].end;
1421 if (rx->offs[0].start + rx->gofs == (UV)rx->offs[0].end)
1422 mg->mg_flags |= MGf_MINMATCH;
1424 mg->mg_flags &= ~MGf_MINMATCH;
1427 LEAVE_SCOPE(oldsave);
1431 yup: /* Confirmed by INTUIT */
1433 RX_MATCH_TAINTED_on(rx);
1434 TAINT_IF(RX_MATCH_TAINTED(rx));
1436 if (dynpm->op_pmflags & PMf_ONCE) {
1438 SvREADONLY_on(PL_regex_pad[dynpm->op_pmoffset]);
1440 dynpm->op_pmflags |= PMf_USED;
1443 if (RX_MATCH_COPIED(rx))
1444 Safefree(rx->subbeg);
1445 RX_MATCH_COPIED_off(rx);
1448 /* FIXME - should rx->subbeg be const char *? */
1449 rx->subbeg = (char *) truebase;
1450 rx->offs[0].start = s - truebase;
1451 if (RX_MATCH_UTF8(rx)) {
1452 char * const t = (char*)utf8_hop((U8*)s, rx->minlenret);
1453 rx->offs[0].end = t - truebase;
1456 rx->offs[0].end = s - truebase + rx->minlenret;
1458 rx->sublen = strend - truebase;
1461 if (PL_sawampersand || rx->extflags & RXf_PMf_KEEPCOPY) {
1463 #ifdef PERL_OLD_COPY_ON_WRITE
1464 if (SvIsCOW(TARG) || (SvFLAGS(TARG) & CAN_COW_MASK) == CAN_COW_FLAGS) {
1466 PerlIO_printf(Perl_debug_log,
1467 "Copy on write: pp_match $& capture, type %d, truebase=%p, t=%p, difference %d\n",
1468 (int) SvTYPE(TARG), (void*)truebase, (void*)t,
1471 rx->saved_copy = sv_setsv_cow(rx->saved_copy, TARG);
1472 rx->subbeg = (char *) SvPVX_const(rx->saved_copy) + (t - truebase);
1473 assert (SvPOKp(rx->saved_copy));
1478 rx->subbeg = savepvn(t, strend - t);
1479 #ifdef PERL_OLD_COPY_ON_WRITE
1480 rx->saved_copy = NULL;
1483 rx->sublen = strend - t;
1484 RX_MATCH_COPIED_on(rx);
1485 off = rx->offs[0].start = s - t;
1486 rx->offs[0].end = off + rx->minlenret;
1488 else { /* startp/endp are used by @- @+. */
1489 rx->offs[0].start = s - truebase;
1490 rx->offs[0].end = s - truebase + rx->minlenret;
1492 /* including rx->nparens in the below code seems highly suspicious.
1494 rx->nparens = rx->lastparen = rx->lastcloseparen = 0; /* used by @-, @+, and $^N */
1495 LEAVE_SCOPE(oldsave);
1500 if (global && !(dynpm->op_pmflags & PMf_CONTINUE)) {
1501 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1502 MAGIC* const mg = mg_find(TARG, PERL_MAGIC_regex_global);
1507 LEAVE_SCOPE(oldsave);
1508 if (gimme == G_ARRAY)
1514 Perl_do_readline(pTHX)
1516 dVAR; dSP; dTARGETSTACKED;
1521 register IO * const io = GvIO(PL_last_in_gv);
1522 register const I32 type = PL_op->op_type;
1523 const I32 gimme = GIMME_V;
1526 MAGIC * const mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar);
1529 XPUSHs(SvTIED_obj((SV*)io, mg));
1532 call_method("READLINE", gimme);
1535 if (gimme == G_SCALAR) {
1536 SV* const result = POPs;
1537 SvSetSV_nosteal(TARG, result);
1547 if (IoFLAGS(io) & IOf_ARGV) {
1548 if (IoFLAGS(io) & IOf_START) {
1550 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1551 IoFLAGS(io) &= ~IOf_START;
1552 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,NULL);
1553 sv_setpvn(GvSVn(PL_last_in_gv), "-", 1);
1554 SvSETMAGIC(GvSV(PL_last_in_gv));
1559 fp = nextargv(PL_last_in_gv);
1560 if (!fp) { /* Note: fp != IoIFP(io) */
1561 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1564 else if (type == OP_GLOB)
1565 fp = Perl_start_glob(aTHX_ POPs, io);
1567 else if (type == OP_GLOB)
1569 else if (ckWARN(WARN_IO) && IoTYPE(io) == IoTYPE_WRONLY) {
1570 report_evil_fh(PL_last_in_gv, io, OP_phoney_OUTPUT_ONLY);
1574 if ((!io || !(IoFLAGS(io) & IOf_START))
1575 && ckWARN2(WARN_GLOB, WARN_CLOSED))
1577 if (type == OP_GLOB)
1578 Perl_warner(aTHX_ packWARN(WARN_GLOB),
1579 "glob failed (can't start child: %s)",
1582 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1584 if (gimme == G_SCALAR) {
1585 /* undef TARG, and push that undefined value */
1586 if (type != OP_RCATLINE) {
1587 SV_CHECK_THINKFIRST_COW_DROP(TARG);
1595 if (gimme == G_SCALAR) {
1597 if (type == OP_RCATLINE && SvGMAGICAL(sv))
1600 if (type == OP_RCATLINE)
1601 SvPV_force_nolen(sv);
1605 else if (isGV_with_GP(sv)) {
1606 SvPV_force_nolen(sv);
1608 SvUPGRADE(sv, SVt_PV);
1609 tmplen = SvLEN(sv); /* remember if already alloced */
1610 if (!tmplen && !SvREADONLY(sv))
1611 Sv_Grow(sv, 80); /* try short-buffering it */
1613 if (type == OP_RCATLINE && SvOK(sv)) {
1615 SvPV_force_nolen(sv);
1621 sv = sv_2mortal(newSV(80));
1625 /* This should not be marked tainted if the fp is marked clean */
1626 #define MAYBE_TAINT_LINE(io, sv) \
1627 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1632 /* delay EOF state for a snarfed empty file */
1633 #define SNARF_EOF(gimme,rs,io,sv) \
1634 (gimme != G_SCALAR || SvCUR(sv) \
1635 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1639 if (!sv_gets(sv, fp, offset)
1641 || SNARF_EOF(gimme, PL_rs, io, sv)
1642 || PerlIO_error(fp)))
1644 PerlIO_clearerr(fp);
1645 if (IoFLAGS(io) & IOf_ARGV) {
1646 fp = nextargv(PL_last_in_gv);
1649 (void)do_close(PL_last_in_gv, FALSE);
1651 else if (type == OP_GLOB) {
1652 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1653 Perl_warner(aTHX_ packWARN(WARN_GLOB),
1654 "glob failed (child exited with status %d%s)",
1655 (int)(STATUS_CURRENT >> 8),
1656 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1659 if (gimme == G_SCALAR) {
1660 if (type != OP_RCATLINE) {
1661 SV_CHECK_THINKFIRST_COW_DROP(TARG);
1667 MAYBE_TAINT_LINE(io, sv);
1670 MAYBE_TAINT_LINE(io, sv);
1672 IoFLAGS(io) |= IOf_NOLINE;
1676 if (type == OP_GLOB) {
1679 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1680 char * const tmps = SvEND(sv) - 1;
1681 if (*tmps == *SvPVX_const(PL_rs)) {
1683 SvCUR_set(sv, SvCUR(sv) - 1);
1686 for (t1 = SvPVX_const(sv); *t1; t1++)
1687 if (!isALPHA(*t1) && !isDIGIT(*t1) &&
1688 strchr("$&*(){}[]'\";\\|?<>~`", *t1))
1690 if (*t1 && PerlLIO_lstat(SvPVX_const(sv), &PL_statbuf) < 0) {
1691 (void)POPs; /* Unmatched wildcard? Chuck it... */
1694 } else if (SvUTF8(sv)) { /* OP_READLINE, OP_RCATLINE */
1695 if (ckWARN(WARN_UTF8)) {
1696 const U8 * const s = (const U8*)SvPVX_const(sv) + offset;
1697 const STRLEN len = SvCUR(sv) - offset;
1700 if (!is_utf8_string_loc(s, len, &f))
1701 /* Emulate :encoding(utf8) warning in the same case. */
1702 Perl_warner(aTHX_ packWARN(WARN_UTF8),
1703 "utf8 \"\\x%02X\" does not map to Unicode",
1704 f < (U8*)SvEND(sv) ? *f : 0);
1707 if (gimme == G_ARRAY) {
1708 if (SvLEN(sv) - SvCUR(sv) > 20) {
1709 SvPV_shrink_to_cur(sv);
1711 sv = sv_2mortal(newSV(80));
1714 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1715 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1716 const STRLEN new_len
1717 = SvCUR(sv) < 60 ? 80 : SvCUR(sv)+40; /* allow some slop */
1718 SvPV_renew(sv, new_len);
1727 register PERL_CONTEXT *cx;
1728 I32 gimme = OP_GIMME(PL_op, -1);
1731 if (cxstack_ix >= 0)
1732 gimme = cxstack[cxstack_ix].blk_gimme;
1740 PUSHBLOCK(cx, CXt_BLOCK, SP);
1750 SV * const keysv = POPs;
1751 HV * const hv = (HV*)POPs;
1752 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
1753 const U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1755 const U32 hash = (SvIsCOW_shared_hash(keysv)) ? SvSHARED_HASH(keysv) : 0;
1758 if (SvTYPE(hv) != SVt_PVHV)
1761 if (PL_op->op_private & OPpLVAL_INTRO) {
1764 /* does the element we're localizing already exist? */
1765 preeminent = /* can we determine whether it exists? */
1767 || mg_find((SV*)hv, PERL_MAGIC_env)
1768 || ( (mg = mg_find((SV*)hv, PERL_MAGIC_tied))
1769 /* Try to preserve the existenceness of a tied hash
1770 * element by using EXISTS and DELETE if possible.
1771 * Fallback to FETCH and STORE otherwise */
1772 && (stash = SvSTASH(SvRV(SvTIED_obj((SV*)hv, mg))))
1773 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE)
1774 && gv_fetchmethod_autoload(stash, "DELETE", TRUE)
1776 ) ? hv_exists_ent(hv, keysv, 0) : 1;
1778 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1779 svp = he ? &HeVAL(he) : NULL;
1781 if (!svp || *svp == &PL_sv_undef) {
1785 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
1787 lv = sv_newmortal();
1788 sv_upgrade(lv, SVt_PVLV);
1790 sv_magic(lv, key2 = newSVsv(keysv), PERL_MAGIC_defelem, NULL, 0);
1791 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1792 LvTARG(lv) = SvREFCNT_inc_simple(hv);
1797 if (PL_op->op_private & OPpLVAL_INTRO) {
1798 if (HvNAME_get(hv) && isGV(*svp))
1799 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1803 const char * const key = SvPV_const(keysv, keylen);
1804 SAVEDELETE(hv, savepvn(key,keylen),
1805 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
1807 save_helem(hv, keysv, svp);
1810 else if (PL_op->op_private & OPpDEREF)
1811 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1813 sv = (svp ? *svp : &PL_sv_undef);
1814 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1815 * Pushing the magical RHS on to the stack is useless, since
1816 * that magic is soon destined to be misled by the local(),
1817 * and thus the later pp_sassign() will fail to mg_get() the
1818 * old value. This should also cure problems with delayed
1819 * mg_get()s. GSAR 98-07-03 */
1820 if (!lval && SvGMAGICAL(sv))
1821 sv = sv_mortalcopy(sv);
1829 register PERL_CONTEXT *cx;
1834 if (PL_op->op_flags & OPf_SPECIAL) {
1835 cx = &cxstack[cxstack_ix];
1836 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1841 gimme = OP_GIMME(PL_op, -1);
1843 if (cxstack_ix >= 0)
1844 gimme = cxstack[cxstack_ix].blk_gimme;
1850 if (gimme == G_VOID)
1852 else if (gimme == G_SCALAR) {
1856 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1859 *MARK = sv_mortalcopy(TOPs);
1862 *MARK = &PL_sv_undef;
1866 else if (gimme == G_ARRAY) {
1867 /* in case LEAVE wipes old return values */
1869 for (mark = newsp + 1; mark <= SP; mark++) {
1870 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1871 *mark = sv_mortalcopy(*mark);
1872 TAINT_NOT; /* Each item is independent */
1876 PL_curpm = newpm; /* Don't pop $1 et al till now */
1886 register PERL_CONTEXT *cx;
1892 cx = &cxstack[cxstack_ix];
1893 if (CxTYPE(cx) != CXt_LOOP)
1894 DIE(aTHX_ "panic: pp_iter");
1896 itersvp = CxITERVAR(cx);
1897 av = cx->blk_loop.iterary;
1898 if (SvTYPE(av) != SVt_PVAV) {
1899 /* iterate ($min .. $max) */
1900 if (cx->blk_loop.iterlval) {
1901 /* string increment */
1902 register SV* cur = cx->blk_loop.iterlval;
1906 SvPV_const((SV*)av, maxlen) : (const char *)"";
1907 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1908 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1909 /* safe to reuse old SV */
1910 sv_setsv(*itersvp, cur);
1914 /* we need a fresh SV every time so that loop body sees a
1915 * completely new SV for closures/references to work as
1918 *itersvp = newSVsv(cur);
1919 SvREFCNT_dec(oldsv);
1921 if (strEQ(SvPVX_const(cur), max))
1922 sv_setiv(cur, 0); /* terminate next time */
1929 /* integer increment */
1930 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1933 /* don't risk potential race */
1934 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1935 /* safe to reuse old SV */
1936 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1940 /* we need a fresh SV every time so that loop body sees a
1941 * completely new SV for closures/references to work as they
1944 *itersvp = newSViv(cx->blk_loop.iterix++);
1945 SvREFCNT_dec(oldsv);
1951 if (PL_op->op_private & OPpITER_REVERSED) {
1952 /* In reverse, use itermax as the min :-) */
1953 if (cx->blk_loop.iterix <= cx->blk_loop.itermax)
1956 if (SvMAGICAL(av) || AvREIFY(av)) {
1957 SV * const * const svp = av_fetch(av, --cx->blk_loop.iterix, FALSE);
1958 sv = svp ? *svp : NULL;
1961 sv = AvARRAY(av)[--cx->blk_loop.iterix];
1965 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp :
1969 if (SvMAGICAL(av) || AvREIFY(av)) {
1970 SV * const * const svp = av_fetch(av, ++cx->blk_loop.iterix, FALSE);
1971 sv = svp ? *svp : NULL;
1974 sv = AvARRAY(av)[++cx->blk_loop.iterix];
1978 if (sv && SvIS_FREED(sv)) {
1980 Perl_croak(aTHX_ "Use of freed value in iteration");
1987 if (av != PL_curstack && sv == &PL_sv_undef) {
1988 SV *lv = cx->blk_loop.iterlval;
1989 if (lv && SvREFCNT(lv) > 1) {
1994 SvREFCNT_dec(LvTARG(lv));
1996 lv = cx->blk_loop.iterlval = newSV_type(SVt_PVLV);
1998 sv_magic(lv, NULL, PERL_MAGIC_defelem, NULL, 0);
2000 LvTARG(lv) = SvREFCNT_inc_simple(av);
2001 LvTARGOFF(lv) = cx->blk_loop.iterix;
2002 LvTARGLEN(lv) = (STRLEN)UV_MAX;
2007 *itersvp = SvREFCNT_inc_simple_NN(sv);
2008 SvREFCNT_dec(oldsv);
2016 register PMOP *pm = cPMOP;
2031 register REGEXP *rx = PM_GETRE(pm);
2033 int force_on_match = 0;
2034 const I32 oldsave = PL_savestack_ix;
2036 bool doutf8 = FALSE;
2037 #ifdef PERL_OLD_COPY_ON_WRITE
2042 /* known replacement string? */
2043 register 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 #ifdef PERL_OLD_COPY_ON_WRITE
2054 /* Awooga. Awooga. "bool" types that are actually char are dangerous,
2055 because they make integers such as 256 "false". */
2056 is_cow = SvIsCOW(TARG) ? TRUE : FALSE;
2059 sv_force_normal_flags(TARG,0);
2062 #ifdef PERL_OLD_COPY_ON_WRITE
2066 || ( ((SvTYPE(TARG) == SVt_PVGV && isGV_with_GP(TARG))
2067 || SvTYPE(TARG) > SVt_PVLV)
2068 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG)))))
2069 DIE(aTHX_ PL_no_modify);
2072 s = SvPV_mutable(TARG, len);
2073 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
2075 rxtainted = ((rx->extflags & RXf_TAINTED) ||
2076 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
2081 RX_MATCH_UTF8_set(rx, DO_UTF8(TARG));
2085 DIE(aTHX_ "panic: pp_subst");
2088 slen = RX_MATCH_UTF8(rx) ? utf8_length((U8*)s, (U8*)strend) : len;
2089 maxiters = 2 * slen + 10; /* We can match twice at each
2090 position, once with zero-length,
2091 second time with non-zero. */
2093 if (!rx->prelen && PL_curpm) {
2097 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand
2098 || (rx->extflags & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY)) )
2099 ? REXEC_COPY_STR : 0;
2101 r_flags |= REXEC_SCREAM;
2104 if (rx->extflags & RXf_USE_INTUIT) {
2106 s = CALLREG_INTUIT_START(rx, TARG, s, strend, r_flags, NULL);
2110 /* How to do it in subst? */
2111 /* if ( (rx->extflags & RXf_CHECK_ALL)
2113 && !(rx->extflags & RXf_KEEPCOPY)
2114 && ((rx->extflags & RXf_NOSCAN)
2115 || !((rx->extflags & RXf_INTUIT_TAIL)
2116 && (r_flags & REXEC_SCREAM))))
2121 /* only replace once? */
2122 once = !(rpm->op_pmflags & PMf_GLOBAL);
2124 /* known replacement string? */
2126 /* replacement needing upgrading? */
2127 if (DO_UTF8(TARG) && !doutf8) {
2128 nsv = sv_newmortal();
2131 sv_recode_to_utf8(nsv, PL_encoding);
2133 sv_utf8_upgrade(nsv);
2134 c = SvPV_const(nsv, clen);
2138 c = SvPV_const(dstr, clen);
2139 doutf8 = DO_UTF8(dstr);
2147 /* can do inplace substitution? */
2149 #ifdef PERL_OLD_COPY_ON_WRITE
2152 && (I32)clen <= rx->minlenret && (once || !(r_flags & REXEC_COPY_STR))
2153 && !(rx->extflags & RXf_LOOKBEHIND_SEEN)
2154 && (!doutf8 || SvUTF8(TARG))) {
2155 if (!CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL,
2156 r_flags | REXEC_CHECKED))
2160 LEAVE_SCOPE(oldsave);
2163 #ifdef PERL_OLD_COPY_ON_WRITE
2164 if (SvIsCOW(TARG)) {
2165 assert (!force_on_match);
2169 if (force_on_match) {
2171 s = SvPV_force(TARG, len);
2176 SvSCREAM_off(TARG); /* disable possible screamer */
2178 rxtainted |= RX_MATCH_TAINTED(rx);
2179 m = orig + rx->offs[0].start;
2180 d = orig + rx->offs[0].end;
2182 if (m - s > strend - d) { /* faster to shorten from end */
2184 Copy(c, m, clen, char);
2189 Move(d, m, i, char);
2193 SvCUR_set(TARG, m - s);
2195 else if ((i = m - s)) { /* faster from front */
2203 Copy(c, m, clen, char);
2208 Copy(c, d, clen, char);
2213 TAINT_IF(rxtainted & 1);
2219 if (iters++ > maxiters)
2220 DIE(aTHX_ "Substitution loop");
2221 rxtainted |= RX_MATCH_TAINTED(rx);
2222 m = rx->offs[0].start + orig;
2225 Move(s, d, i, char);
2229 Copy(c, d, clen, char);
2232 s = rx->offs[0].end + orig;
2233 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
2235 /* don't match same null twice */
2236 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
2239 SvCUR_set(TARG, d - SvPVX_const(TARG) + i);
2240 Move(s, d, i+1, char); /* include the NUL */
2242 TAINT_IF(rxtainted & 1);
2244 PUSHs(sv_2mortal(newSViv((I32)iters)));
2246 (void)SvPOK_only_UTF8(TARG);
2247 TAINT_IF(rxtainted);
2248 if (SvSMAGICAL(TARG)) {
2256 LEAVE_SCOPE(oldsave);
2260 if (CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL,
2261 r_flags | REXEC_CHECKED))
2263 if (force_on_match) {
2265 s = SvPV_force(TARG, len);
2268 #ifdef PERL_OLD_COPY_ON_WRITE
2271 rxtainted |= RX_MATCH_TAINTED(rx);
2272 dstr = newSVpvn(m, s-m);
2278 register PERL_CONTEXT *cx;
2281 RETURNOP(cPMOP->op_pmreplrootu.op_pmreplroot);
2283 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
2285 if (iters++ > maxiters)
2286 DIE(aTHX_ "Substitution loop");
2287 rxtainted |= RX_MATCH_TAINTED(rx);
2288 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
2293 strend = s + (strend - m);
2295 m = rx->offs[0].start + orig;
2296 if (doutf8 && !SvUTF8(dstr))
2297 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
2299 sv_catpvn(dstr, s, m-s);
2300 s = rx->offs[0].end + orig;
2302 sv_catpvn(dstr, c, clen);
2305 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
2306 TARG, NULL, r_flags));
2307 if (doutf8 && !DO_UTF8(TARG))
2308 sv_catpvn_utf8_upgrade(dstr, s, strend - s, nsv);
2310 sv_catpvn(dstr, s, strend - s);
2312 #ifdef PERL_OLD_COPY_ON_WRITE
2313 /* The match may make the string COW. If so, brilliant, because that's
2314 just saved us one malloc, copy and free - the regexp has donated
2315 the old buffer, and we malloc an entirely new one, rather than the
2316 regexp malloc()ing a buffer and copying our original, only for
2317 us to throw it away here during the substitution. */
2318 if (SvIsCOW(TARG)) {
2319 sv_force_normal_flags(TARG, SV_COW_DROP_PV);
2325 SvPV_set(TARG, SvPVX(dstr));
2326 SvCUR_set(TARG, SvCUR(dstr));
2327 SvLEN_set(TARG, SvLEN(dstr));
2328 doutf8 |= DO_UTF8(dstr);
2329 SvPV_set(dstr, NULL);
2331 TAINT_IF(rxtainted & 1);
2333 PUSHs(sv_2mortal(newSViv((I32)iters)));
2335 (void)SvPOK_only(TARG);
2338 TAINT_IF(rxtainted);
2341 LEAVE_SCOPE(oldsave);
2350 LEAVE_SCOPE(oldsave);
2359 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2360 ++*PL_markstack_ptr;
2361 LEAVE; /* exit inner scope */
2364 if (PL_stack_base + *PL_markstack_ptr > SP) {
2366 const I32 gimme = GIMME_V;
2368 LEAVE; /* exit outer scope */
2369 (void)POPMARK; /* pop src */
2370 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2371 (void)POPMARK; /* pop dst */
2372 SP = PL_stack_base + POPMARK; /* pop original mark */
2373 if (gimme == G_SCALAR) {
2374 if (PL_op->op_private & OPpGREP_LEX) {
2375 SV* const sv = sv_newmortal();
2376 sv_setiv(sv, items);
2384 else if (gimme == G_ARRAY)
2391 ENTER; /* enter inner scope */
2394 src = PL_stack_base[*PL_markstack_ptr];
2396 if (PL_op->op_private & OPpGREP_LEX)
2397 PAD_SVl(PL_op->op_targ) = src;
2401 RETURNOP(cLOGOP->op_other);
2412 register PERL_CONTEXT *cx;
2415 if (CxMULTICALL(&cxstack[cxstack_ix]))
2419 cxstack_ix++; /* temporarily protect top context */
2422 if (gimme == G_SCALAR) {
2425 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2427 *MARK = SvREFCNT_inc(TOPs);
2432 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2434 *MARK = sv_mortalcopy(sv);
2439 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2443 *MARK = &PL_sv_undef;
2447 else if (gimme == G_ARRAY) {
2448 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2449 if (!SvTEMP(*MARK)) {
2450 *MARK = sv_mortalcopy(*MARK);
2451 TAINT_NOT; /* Each item is independent */
2459 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2460 PL_curpm = newpm; /* ... and pop $1 et al */
2463 return cx->blk_sub.retop;
2466 /* This duplicates the above code because the above code must not
2467 * get any slower by more conditions */
2475 register PERL_CONTEXT *cx;
2478 if (CxMULTICALL(&cxstack[cxstack_ix]))
2482 cxstack_ix++; /* temporarily protect top context */
2486 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2487 /* We are an argument to a function or grep().
2488 * This kind of lvalueness was legal before lvalue
2489 * subroutines too, so be backward compatible:
2490 * cannot report errors. */
2492 /* Scalar context *is* possible, on the LHS of -> only,
2493 * as in f()->meth(). But this is not an lvalue. */
2494 if (gimme == G_SCALAR)
2496 if (gimme == G_ARRAY) {
2497 if (!CvLVALUE(cx->blk_sub.cv))
2498 goto temporise_array;
2499 EXTEND_MORTAL(SP - newsp);
2500 for (mark = newsp + 1; mark <= SP; mark++) {
2503 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2504 *mark = sv_mortalcopy(*mark);
2506 /* Can be a localized value subject to deletion. */
2507 PL_tmps_stack[++PL_tmps_ix] = *mark;
2508 SvREFCNT_inc_void(*mark);
2513 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2514 /* Here we go for robustness, not for speed, so we change all
2515 * the refcounts so the caller gets a live guy. Cannot set
2516 * TEMP, so sv_2mortal is out of question. */
2517 if (!CvLVALUE(cx->blk_sub.cv)) {
2523 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2525 if (gimme == G_SCALAR) {
2529 /* Temporaries are bad unless they happen to be elements
2530 * of a tied hash or array */
2531 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY) &&
2532 !(SvRMAGICAL(TOPs) && mg_find(TOPs, PERL_MAGIC_tiedelem))) {
2538 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2539 SvREADONLY(TOPs) ? (TOPs == &PL_sv_undef) ? "undef"
2540 : "a readonly value" : "a temporary");
2542 else { /* Can be a localized value
2543 * subject to deletion. */
2544 PL_tmps_stack[++PL_tmps_ix] = *mark;
2545 SvREFCNT_inc_void(*mark);
2548 else { /* Should not happen? */
2554 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2555 (MARK > SP ? "Empty array" : "Array"));
2559 else if (gimme == G_ARRAY) {
2560 EXTEND_MORTAL(SP - newsp);
2561 for (mark = newsp + 1; mark <= SP; mark++) {
2562 if (*mark != &PL_sv_undef
2563 && SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2564 /* Might be flattened array after $#array = */
2571 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2572 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2575 /* Can be a localized value subject to deletion. */
2576 PL_tmps_stack[++PL_tmps_ix] = *mark;
2577 SvREFCNT_inc_void(*mark);
2583 if (gimme == G_SCALAR) {
2587 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2589 *MARK = SvREFCNT_inc(TOPs);
2594 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2596 *MARK = sv_mortalcopy(sv);
2601 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2605 *MARK = &PL_sv_undef;
2609 else if (gimme == G_ARRAY) {
2611 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2612 if (!SvTEMP(*MARK)) {
2613 *MARK = sv_mortalcopy(*MARK);
2614 TAINT_NOT; /* Each item is independent */
2623 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2624 PL_curpm = newpm; /* ... and pop $1 et al */
2627 return cx->blk_sub.retop;
2635 register PERL_CONTEXT *cx;
2637 const bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2640 DIE(aTHX_ "Not a CODE reference");
2641 switch (SvTYPE(sv)) {
2642 /* This is overwhelming the most common case: */
2644 if (!(cv = GvCVu((GV*)sv))) {
2646 cv = sv_2cv(sv, &stash, &gv, 0);
2658 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2660 SP = PL_stack_base + POPMARK;
2663 if (SvGMAGICAL(sv)) {
2668 sym = SvPVX_const(sv);
2676 sym = SvPV_const(sv, len);
2679 DIE(aTHX_ PL_no_usym, "a subroutine");
2680 if (PL_op->op_private & HINT_STRICT_REFS)
2681 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2682 cv = get_cvn_flags(sym, len, GV_ADD|SvUTF8(sv));
2687 SV * const * sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2688 tryAMAGICunDEREF(to_cv);
2691 if (SvTYPE(cv) == SVt_PVCV)
2696 DIE(aTHX_ "Not a CODE reference");
2697 /* This is the second most common case: */
2707 if (!CvROOT(cv) && !CvXSUB(cv)) {
2711 /* anonymous or undef'd function leaves us no recourse */
2712 if (CvANON(cv) || !(gv = CvGV(cv)))
2713 DIE(aTHX_ "Undefined subroutine called");
2715 /* autoloaded stub? */
2716 if (cv != GvCV(gv)) {
2719 /* should call AUTOLOAD now? */
2722 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2729 sub_name = sv_newmortal();
2730 gv_efullname3(sub_name, gv, NULL);
2731 DIE(aTHX_ "Undefined subroutine &%"SVf" called", SVfARG(sub_name));
2735 DIE(aTHX_ "Not a CODE reference");
2740 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2741 Perl_get_db_sub(aTHX_ &sv, cv);
2743 PL_curcopdb = PL_curcop;
2744 cv = GvCV(PL_DBsub);
2746 if (!cv || (!CvXSUB(cv) && !CvSTART(cv)))
2747 DIE(aTHX_ "No DB::sub routine defined");
2750 if (!(CvISXSUB(cv))) {
2751 /* This path taken at least 75% of the time */
2753 register I32 items = SP - MARK;
2754 AV* const padlist = CvPADLIST(cv);
2755 PUSHBLOCK(cx, CXt_SUB, MARK);
2757 cx->blk_sub.retop = PL_op->op_next;
2759 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2760 * that eval'' ops within this sub know the correct lexical space.
2761 * Owing the speed considerations, we choose instead to search for
2762 * the cv using find_runcv() when calling doeval().
2764 if (CvDEPTH(cv) >= 2) {
2765 PERL_STACK_OVERFLOW_CHECK();
2766 pad_push(padlist, CvDEPTH(cv));
2769 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2771 AV* const av = (AV*)PAD_SVl(0);
2773 /* @_ is normally not REAL--this should only ever
2774 * happen when DB::sub() calls things that modify @_ */
2779 cx->blk_sub.savearray = GvAV(PL_defgv);
2780 GvAV(PL_defgv) = (AV*)SvREFCNT_inc_simple(av);
2781 CX_CURPAD_SAVE(cx->blk_sub);
2782 cx->blk_sub.argarray = av;
2785 if (items > AvMAX(av) + 1) {
2786 SV **ary = AvALLOC(av);
2787 if (AvARRAY(av) != ary) {
2788 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2791 if (items > AvMAX(av) + 1) {
2792 AvMAX(av) = items - 1;
2793 Renew(ary,items,SV*);
2798 Copy(MARK,AvARRAY(av),items,SV*);
2799 AvFILLp(av) = items - 1;
2807 /* warning must come *after* we fully set up the context
2808 * stuff so that __WARN__ handlers can safely dounwind()
2811 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2812 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2813 sub_crush_depth(cv);
2815 DEBUG_S(PerlIO_printf(Perl_debug_log,
2816 "%p entersub returning %p\n", (void*)thr, (void*)CvSTART(cv)));
2818 RETURNOP(CvSTART(cv));
2821 I32 markix = TOPMARK;
2826 /* Need to copy @_ to stack. Alternative may be to
2827 * switch stack to @_, and copy return values
2828 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2829 AV * const av = GvAV(PL_defgv);
2830 const I32 items = AvFILLp(av) + 1; /* @_ is not tieable */
2833 /* Mark is at the end of the stack. */
2835 Copy(AvARRAY(av), SP + 1, items, SV*);
2840 /* We assume first XSUB in &DB::sub is the called one. */
2842 SAVEVPTR(PL_curcop);
2843 PL_curcop = PL_curcopdb;
2846 /* Do we need to open block here? XXXX */
2847 if (CvXSUB(cv)) /* XXX this is supposed to be true */
2848 (void)(*CvXSUB(cv))(aTHX_ cv);
2850 /* Enforce some sanity in scalar context. */
2851 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2852 if (markix > PL_stack_sp - PL_stack_base)
2853 *(PL_stack_base + markix) = &PL_sv_undef;
2855 *(PL_stack_base + markix) = *PL_stack_sp;
2856 PL_stack_sp = PL_stack_base + markix;
2864 Perl_sub_crush_depth(pTHX_ CV *cv)
2867 Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on anonymous subroutine");
2869 SV* const tmpstr = sv_newmortal();
2870 gv_efullname3(tmpstr, CvGV(cv), NULL);
2871 Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on subroutine \"%"SVf"\"",
2880 SV* const elemsv = POPs;
2881 IV elem = SvIV(elemsv);
2882 AV* const av = (AV*)POPs;
2883 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
2884 const U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > av_len(av));
2887 if (SvROK(elemsv) && !SvGAMAGIC(elemsv) && ckWARN(WARN_MISC))
2888 Perl_warner(aTHX_ packWARN(WARN_MISC),
2889 "Use of reference \"%"SVf"\" as array index",
2892 elem -= CopARYBASE_get(PL_curcop);
2893 if (SvTYPE(av) != SVt_PVAV)
2895 svp = av_fetch(av, elem, lval && !defer);
2897 #ifdef PERL_MALLOC_WRAP
2898 if (SvUOK(elemsv)) {
2899 const UV uv = SvUV(elemsv);
2900 elem = uv > IV_MAX ? IV_MAX : uv;
2902 else if (SvNOK(elemsv))
2903 elem = (IV)SvNV(elemsv);
2905 static const char oom_array_extend[] =
2906 "Out of memory during array extend"; /* Duplicated in av.c */
2907 MEM_WRAP_CHECK_1(elem,SV*,oom_array_extend);
2910 if (!svp || *svp == &PL_sv_undef) {
2913 DIE(aTHX_ PL_no_aelem, elem);
2914 lv = sv_newmortal();
2915 sv_upgrade(lv, SVt_PVLV);
2917 sv_magic(lv, NULL, PERL_MAGIC_defelem, NULL, 0);
2918 LvTARG(lv) = SvREFCNT_inc_simple(av);
2919 LvTARGOFF(lv) = elem;
2924 if (PL_op->op_private & OPpLVAL_INTRO)
2925 save_aelem(av, elem, svp);
2926 else if (PL_op->op_private & OPpDEREF)
2927 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2929 sv = (svp ? *svp : &PL_sv_undef);
2930 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2931 sv = sv_mortalcopy(sv);
2937 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2942 Perl_croak(aTHX_ PL_no_modify);
2943 if (SvTYPE(sv) < SVt_RV || SvTYPE(sv) == SVt_NV)
2944 sv_upgrade(sv, SVt_RV);
2945 else if (SvTYPE(sv) >= SVt_PV) {
2952 SvRV_set(sv, newSV(0));
2955 SvRV_set(sv, (SV*)newAV());
2958 SvRV_set(sv, (SV*)newHV());
2969 SV* const sv = TOPs;
2972 SV* const rsv = SvRV(sv);
2973 if (SvTYPE(rsv) == SVt_PVCV) {
2979 SETs(method_common(sv, NULL));
2986 SV* const sv = cSVOP_sv;
2987 U32 hash = SvSHARED_HASH(sv);
2989 XPUSHs(method_common(sv, &hash));
2994 S_method_common(pTHX_ SV* meth, U32* hashp)
3001 const char* packname = NULL;
3004 const char * const name = SvPV_const(meth, namelen);
3005 SV * const sv = *(PL_stack_base + TOPMARK + 1);
3008 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
3016 /* this isn't a reference */
3017 if(SvOK(sv) && (packname = SvPV_const(sv, packlen))) {
3018 const HE* const he = hv_fetch_ent(PL_stashcache, sv, 0, 0);
3020 stash = INT2PTR(HV*,SvIV(HeVAL(he)));
3027 !(iogv = gv_fetchsv(sv, 0, SVt_PVIO)) ||
3028 !(ob=(SV*)GvIO(iogv)))
3030 /* this isn't the name of a filehandle either */
3032 ((UTF8_IS_START(*packname) && DO_UTF8(sv))
3033 ? !isIDFIRST_utf8((U8*)packname)
3034 : !isIDFIRST(*packname)
3037 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
3038 SvOK(sv) ? "without a package or object reference"
3039 : "on an undefined value");
3041 /* assume it's a package name */
3042 stash = gv_stashpvn(packname, packlen, 0);
3046 SV* const ref = newSViv(PTR2IV(stash));
3047 (void)hv_store(PL_stashcache, packname, packlen, ref, 0);
3051 /* it _is_ a filehandle name -- replace with a reference */
3052 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
3055 /* if we got here, ob should be a reference or a glob */
3056 if (!ob || !(SvOBJECT(ob)
3057 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
3060 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
3061 (SvSCREAM(meth) && strEQ(name,"isa")) ? "DOES" :
3065 stash = SvSTASH(ob);
3068 /* NOTE: stash may be null, hope hv_fetch_ent and
3069 gv_fetchmethod can cope (it seems they can) */
3071 /* shortcut for simple names */
3073 const HE* const he = hv_fetch_ent(stash, meth, 0, *hashp);
3075 gv = (GV*)HeVAL(he);
3076 if (isGV(gv) && GvCV(gv) &&
3077 (!GvCVGEN(gv) || GvCVGEN(gv)
3078 == (PL_sub_generation + HvMROMETA(stash)->cache_gen)))
3079 return (SV*)GvCV(gv);
3083 gv = gv_fetchmethod(stash ? stash : (HV*)packsv, name);
3086 /* This code tries to figure out just what went wrong with
3087 gv_fetchmethod. It therefore needs to duplicate a lot of
3088 the internals of that function. We can't move it inside
3089 Perl_gv_fetchmethod_autoload(), however, since that would
3090 cause UNIVERSAL->can("NoSuchPackage::foo") to croak, and we
3093 const char* leaf = name;
3094 const char* sep = NULL;
3097 for (p = name; *p; p++) {
3099 sep = p, leaf = p + 1;
3100 else if (*p == ':' && *(p + 1) == ':')
3101 sep = p, leaf = p + 2;
3103 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
3104 /* the method name is unqualified or starts with SUPER:: */
3105 #ifndef USE_ITHREADS
3107 stash = CopSTASH(PL_curcop);
3109 bool need_strlen = 1;
3111 packname = CopSTASHPV(PL_curcop);
3116 HEK * const packhek = HvNAME_HEK(stash);
3118 packname = HEK_KEY(packhek);
3119 packlen = HEK_LEN(packhek);
3131 "Can't use anonymous symbol table for method lookup");
3135 packlen = strlen(packname);
3140 /* the method name is qualified */
3142 packlen = sep - name;
3145 /* we're relying on gv_fetchmethod not autovivifying the stash */
3146 if (gv_stashpvn(packname, packlen, 0)) {
3148 "Can't locate object method \"%s\" via package \"%.*s\"",
3149 leaf, (int)packlen, packname);
3153 "Can't locate object method \"%s\" via package \"%.*s\""
3154 " (perhaps you forgot to load \"%.*s\"?)",
3155 leaf, (int)packlen, packname, (int)packlen, packname);
3158 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
3163 * c-indentation-style: bsd
3165 * indent-tabs-mode: t
3168 * ex: set ts=8 sts=4 sw=4 noet: