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, minmatch, TARG, INT2PTR(void*, gpos), r_flags))
1333 if (dynpm->op_pmflags & PMf_ONCE) {
1335 SvREADONLY_on(PL_regex_pad[dynpm->op_pmoffset]);
1337 dynpm->op_pmflags |= PMf_USED;
1348 RX_MATCH_TAINTED_on(rx);
1349 TAINT_IF(RX_MATCH_TAINTED(rx));
1350 if (gimme == G_ARRAY) {
1351 const I32 nparens = rx->nparens;
1352 I32 i = (global && !nparens) ? 1 : 0;
1354 SPAGAIN; /* EVAL blocks could move the stack. */
1355 EXTEND(SP, nparens + i);
1356 EXTEND_MORTAL(nparens + i);
1357 for (i = !i; i <= nparens; i++) {
1358 PUSHs(sv_newmortal());
1359 if ((rx->offs[i].start != -1) && rx->offs[i].end != -1 ) {
1360 const I32 len = rx->offs[i].end - rx->offs[i].start;
1361 s = rx->offs[i].start + truebase;
1362 if (rx->offs[i].end < 0 || rx->offs[i].start < 0 ||
1363 len < 0 || len > strend - s)
1364 DIE(aTHX_ "panic: pp_match start/end pointers");
1365 sv_setpvn(*SP, s, len);
1366 if (DO_UTF8(TARG) && is_utf8_string((U8*)s, len))
1371 if (dynpm->op_pmflags & PMf_CONTINUE) {
1373 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1374 mg = mg_find(TARG, PERL_MAGIC_regex_global);
1376 #ifdef PERL_OLD_COPY_ON_WRITE
1378 sv_force_normal_flags(TARG, 0);
1380 mg = sv_magicext(TARG, NULL, PERL_MAGIC_regex_global,
1381 &PL_vtbl_mglob, NULL, 0);
1383 if (rx->offs[0].start != -1) {
1384 mg->mg_len = rx->offs[0].end;
1385 if (rx->offs[0].start + rx->gofs == (UV)rx->offs[0].end)
1386 mg->mg_flags |= MGf_MINMATCH;
1388 mg->mg_flags &= ~MGf_MINMATCH;
1391 had_zerolen = (rx->offs[0].start != -1
1392 && (rx->offs[0].start + rx->gofs
1393 == (UV)rx->offs[0].end));
1394 PUTBACK; /* EVAL blocks may use stack */
1395 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1400 LEAVE_SCOPE(oldsave);
1406 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1407 mg = mg_find(TARG, PERL_MAGIC_regex_global);
1411 #ifdef PERL_OLD_COPY_ON_WRITE
1413 sv_force_normal_flags(TARG, 0);
1415 mg = sv_magicext(TARG, NULL, PERL_MAGIC_regex_global,
1416 &PL_vtbl_mglob, NULL, 0);
1418 if (rx->offs[0].start != -1) {
1419 mg->mg_len = rx->offs[0].end;
1420 if (rx->offs[0].start + rx->gofs == (UV)rx->offs[0].end)
1421 mg->mg_flags |= MGf_MINMATCH;
1423 mg->mg_flags &= ~MGf_MINMATCH;
1426 LEAVE_SCOPE(oldsave);
1430 yup: /* Confirmed by INTUIT */
1432 RX_MATCH_TAINTED_on(rx);
1433 TAINT_IF(RX_MATCH_TAINTED(rx));
1435 if (dynpm->op_pmflags & PMf_ONCE) {
1437 SvREADONLY_on(PL_regex_pad[dynpm->op_pmoffset]);
1439 dynpm->op_pmflags |= PMf_USED;
1442 if (RX_MATCH_COPIED(rx))
1443 Safefree(rx->subbeg);
1444 RX_MATCH_COPIED_off(rx);
1447 /* FIXME - should rx->subbeg be const char *? */
1448 rx->subbeg = (char *) truebase;
1449 rx->offs[0].start = s - truebase;
1450 if (RX_MATCH_UTF8(rx)) {
1451 char * const t = (char*)utf8_hop((U8*)s, rx->minlenret);
1452 rx->offs[0].end = t - truebase;
1455 rx->offs[0].end = s - truebase + rx->minlenret;
1457 rx->sublen = strend - truebase;
1460 if (PL_sawampersand || rx->extflags & RXf_PMf_KEEPCOPY) {
1462 #ifdef PERL_OLD_COPY_ON_WRITE
1463 if (SvIsCOW(TARG) || (SvFLAGS(TARG) & CAN_COW_MASK) == CAN_COW_FLAGS) {
1465 PerlIO_printf(Perl_debug_log,
1466 "Copy on write: pp_match $& capture, type %d, truebase=%p, t=%p, difference %d\n",
1467 (int) SvTYPE(TARG), (void*)truebase, (void*)t,
1470 rx->saved_copy = sv_setsv_cow(rx->saved_copy, TARG);
1471 rx->subbeg = (char *) SvPVX_const(rx->saved_copy) + (t - truebase);
1472 assert (SvPOKp(rx->saved_copy));
1477 rx->subbeg = savepvn(t, strend - t);
1478 #ifdef PERL_OLD_COPY_ON_WRITE
1479 rx->saved_copy = NULL;
1482 rx->sublen = strend - t;
1483 RX_MATCH_COPIED_on(rx);
1484 off = rx->offs[0].start = s - t;
1485 rx->offs[0].end = off + rx->minlenret;
1487 else { /* startp/endp are used by @- @+. */
1488 rx->offs[0].start = s - truebase;
1489 rx->offs[0].end = s - truebase + rx->minlenret;
1491 /* including rx->nparens in the below code seems highly suspicious.
1493 rx->nparens = rx->lastparen = rx->lastcloseparen = 0; /* used by @-, @+, and $^N */
1494 LEAVE_SCOPE(oldsave);
1499 if (global && !(dynpm->op_pmflags & PMf_CONTINUE)) {
1500 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1501 MAGIC* const mg = mg_find(TARG, PERL_MAGIC_regex_global);
1506 LEAVE_SCOPE(oldsave);
1507 if (gimme == G_ARRAY)
1513 Perl_do_readline(pTHX)
1515 dVAR; dSP; dTARGETSTACKED;
1520 register IO * const io = GvIO(PL_last_in_gv);
1521 register const I32 type = PL_op->op_type;
1522 const I32 gimme = GIMME_V;
1525 MAGIC * const mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar);
1528 XPUSHs(SvTIED_obj((SV*)io, mg));
1531 call_method("READLINE", gimme);
1534 if (gimme == G_SCALAR) {
1535 SV* const result = POPs;
1536 SvSetSV_nosteal(TARG, result);
1546 if (IoFLAGS(io) & IOf_ARGV) {
1547 if (IoFLAGS(io) & IOf_START) {
1549 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1550 IoFLAGS(io) &= ~IOf_START;
1551 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,NULL);
1552 sv_setpvn(GvSVn(PL_last_in_gv), "-", 1);
1553 SvSETMAGIC(GvSV(PL_last_in_gv));
1558 fp = nextargv(PL_last_in_gv);
1559 if (!fp) { /* Note: fp != IoIFP(io) */
1560 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1563 else if (type == OP_GLOB)
1564 fp = Perl_start_glob(aTHX_ POPs, io);
1566 else if (type == OP_GLOB)
1568 else if (ckWARN(WARN_IO) && IoTYPE(io) == IoTYPE_WRONLY) {
1569 report_evil_fh(PL_last_in_gv, io, OP_phoney_OUTPUT_ONLY);
1573 if ((!io || !(IoFLAGS(io) & IOf_START))
1574 && ckWARN2(WARN_GLOB, WARN_CLOSED))
1576 if (type == OP_GLOB)
1577 Perl_warner(aTHX_ packWARN(WARN_GLOB),
1578 "glob failed (can't start child: %s)",
1581 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1583 if (gimme == G_SCALAR) {
1584 /* undef TARG, and push that undefined value */
1585 if (type != OP_RCATLINE) {
1586 SV_CHECK_THINKFIRST_COW_DROP(TARG);
1594 if (gimme == G_SCALAR) {
1596 if (type == OP_RCATLINE && SvGMAGICAL(sv))
1599 if (type == OP_RCATLINE)
1600 SvPV_force_nolen(sv);
1604 else if (isGV_with_GP(sv)) {
1605 SvPV_force_nolen(sv);
1607 SvUPGRADE(sv, SVt_PV);
1608 tmplen = SvLEN(sv); /* remember if already alloced */
1609 if (!tmplen && !SvREADONLY(sv))
1610 Sv_Grow(sv, 80); /* try short-buffering it */
1612 if (type == OP_RCATLINE && SvOK(sv)) {
1614 SvPV_force_nolen(sv);
1620 sv = sv_2mortal(newSV(80));
1624 /* This should not be marked tainted if the fp is marked clean */
1625 #define MAYBE_TAINT_LINE(io, sv) \
1626 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1631 /* delay EOF state for a snarfed empty file */
1632 #define SNARF_EOF(gimme,rs,io,sv) \
1633 (gimme != G_SCALAR || SvCUR(sv) \
1634 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1638 if (!sv_gets(sv, fp, offset)
1640 || SNARF_EOF(gimme, PL_rs, io, sv)
1641 || PerlIO_error(fp)))
1643 PerlIO_clearerr(fp);
1644 if (IoFLAGS(io) & IOf_ARGV) {
1645 fp = nextargv(PL_last_in_gv);
1648 (void)do_close(PL_last_in_gv, FALSE);
1650 else if (type == OP_GLOB) {
1651 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1652 Perl_warner(aTHX_ packWARN(WARN_GLOB),
1653 "glob failed (child exited with status %d%s)",
1654 (int)(STATUS_CURRENT >> 8),
1655 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1658 if (gimme == G_SCALAR) {
1659 if (type != OP_RCATLINE) {
1660 SV_CHECK_THINKFIRST_COW_DROP(TARG);
1666 MAYBE_TAINT_LINE(io, sv);
1669 MAYBE_TAINT_LINE(io, sv);
1671 IoFLAGS(io) |= IOf_NOLINE;
1675 if (type == OP_GLOB) {
1678 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1679 char * const tmps = SvEND(sv) - 1;
1680 if (*tmps == *SvPVX_const(PL_rs)) {
1682 SvCUR_set(sv, SvCUR(sv) - 1);
1685 for (t1 = SvPVX_const(sv); *t1; t1++)
1686 if (!isALPHA(*t1) && !isDIGIT(*t1) &&
1687 strchr("$&*(){}[]'\";\\|?<>~`", *t1))
1689 if (*t1 && PerlLIO_lstat(SvPVX_const(sv), &PL_statbuf) < 0) {
1690 (void)POPs; /* Unmatched wildcard? Chuck it... */
1693 } else if (SvUTF8(sv)) { /* OP_READLINE, OP_RCATLINE */
1694 if (ckWARN(WARN_UTF8)) {
1695 const U8 * const s = (const U8*)SvPVX_const(sv) + offset;
1696 const STRLEN len = SvCUR(sv) - offset;
1699 if (!is_utf8_string_loc(s, len, &f))
1700 /* Emulate :encoding(utf8) warning in the same case. */
1701 Perl_warner(aTHX_ packWARN(WARN_UTF8),
1702 "utf8 \"\\x%02X\" does not map to Unicode",
1703 f < (U8*)SvEND(sv) ? *f : 0);
1706 if (gimme == G_ARRAY) {
1707 if (SvLEN(sv) - SvCUR(sv) > 20) {
1708 SvPV_shrink_to_cur(sv);
1710 sv = sv_2mortal(newSV(80));
1713 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1714 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1715 const STRLEN new_len
1716 = SvCUR(sv) < 60 ? 80 : SvCUR(sv)+40; /* allow some slop */
1717 SvPV_renew(sv, new_len);
1726 register PERL_CONTEXT *cx;
1727 I32 gimme = OP_GIMME(PL_op, -1);
1730 if (cxstack_ix >= 0)
1731 gimme = cxstack[cxstack_ix].blk_gimme;
1739 PUSHBLOCK(cx, CXt_BLOCK, SP);
1749 SV * const keysv = POPs;
1750 HV * const hv = (HV*)POPs;
1751 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
1752 const U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1754 const U32 hash = (SvIsCOW_shared_hash(keysv)) ? SvSHARED_HASH(keysv) : 0;
1757 if (SvTYPE(hv) != SVt_PVHV)
1760 if (PL_op->op_private & OPpLVAL_INTRO) {
1763 /* does the element we're localizing already exist? */
1764 preeminent = /* can we determine whether it exists? */
1766 || mg_find((SV*)hv, PERL_MAGIC_env)
1767 || ( (mg = mg_find((SV*)hv, PERL_MAGIC_tied))
1768 /* Try to preserve the existenceness of a tied hash
1769 * element by using EXISTS and DELETE if possible.
1770 * Fallback to FETCH and STORE otherwise */
1771 && (stash = SvSTASH(SvRV(SvTIED_obj((SV*)hv, mg))))
1772 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE)
1773 && gv_fetchmethod_autoload(stash, "DELETE", TRUE)
1775 ) ? hv_exists_ent(hv, keysv, 0) : 1;
1777 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1778 svp = he ? &HeVAL(he) : NULL;
1780 if (!svp || *svp == &PL_sv_undef) {
1784 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
1786 lv = sv_newmortal();
1787 sv_upgrade(lv, SVt_PVLV);
1789 sv_magic(lv, key2 = newSVsv(keysv), PERL_MAGIC_defelem, NULL, 0);
1790 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1791 LvTARG(lv) = SvREFCNT_inc_simple(hv);
1796 if (PL_op->op_private & OPpLVAL_INTRO) {
1797 if (HvNAME_get(hv) && isGV(*svp))
1798 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1802 const char * const key = SvPV_const(keysv, keylen);
1803 SAVEDELETE(hv, savepvn(key,keylen),
1804 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
1806 save_helem(hv, keysv, svp);
1809 else if (PL_op->op_private & OPpDEREF)
1810 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1812 sv = (svp ? *svp : &PL_sv_undef);
1813 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1814 * Pushing the magical RHS on to the stack is useless, since
1815 * that magic is soon destined to be misled by the local(),
1816 * and thus the later pp_sassign() will fail to mg_get() the
1817 * old value. This should also cure problems with delayed
1818 * mg_get()s. GSAR 98-07-03 */
1819 if (!lval && SvGMAGICAL(sv))
1820 sv = sv_mortalcopy(sv);
1828 register PERL_CONTEXT *cx;
1833 if (PL_op->op_flags & OPf_SPECIAL) {
1834 cx = &cxstack[cxstack_ix];
1835 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1840 gimme = OP_GIMME(PL_op, -1);
1842 if (cxstack_ix >= 0)
1843 gimme = cxstack[cxstack_ix].blk_gimme;
1849 if (gimme == G_VOID)
1851 else if (gimme == G_SCALAR) {
1855 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1858 *MARK = sv_mortalcopy(TOPs);
1861 *MARK = &PL_sv_undef;
1865 else if (gimme == G_ARRAY) {
1866 /* in case LEAVE wipes old return values */
1868 for (mark = newsp + 1; mark <= SP; mark++) {
1869 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1870 *mark = sv_mortalcopy(*mark);
1871 TAINT_NOT; /* Each item is independent */
1875 PL_curpm = newpm; /* Don't pop $1 et al till now */
1885 register PERL_CONTEXT *cx;
1891 cx = &cxstack[cxstack_ix];
1892 if (CxTYPE(cx) != CXt_LOOP)
1893 DIE(aTHX_ "panic: pp_iter");
1895 itersvp = CxITERVAR(cx);
1896 av = cx->blk_loop.iterary;
1897 if (SvTYPE(av) != SVt_PVAV) {
1898 /* iterate ($min .. $max) */
1899 if (cx->blk_loop.iterlval) {
1900 /* string increment */
1901 register SV* cur = cx->blk_loop.iterlval;
1905 SvPV_const((SV*)av, maxlen) : (const char *)"";
1906 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1907 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1908 /* safe to reuse old SV */
1909 sv_setsv(*itersvp, cur);
1913 /* we need a fresh SV every time so that loop body sees a
1914 * completely new SV for closures/references to work as
1917 *itersvp = newSVsv(cur);
1918 SvREFCNT_dec(oldsv);
1920 if (strEQ(SvPVX_const(cur), max))
1921 sv_setiv(cur, 0); /* terminate next time */
1928 /* integer increment */
1929 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1932 /* don't risk potential race */
1933 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1934 /* safe to reuse old SV */
1935 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1939 /* we need a fresh SV every time so that loop body sees a
1940 * completely new SV for closures/references to work as they
1943 *itersvp = newSViv(cx->blk_loop.iterix++);
1944 SvREFCNT_dec(oldsv);
1950 if (PL_op->op_private & OPpITER_REVERSED) {
1951 /* In reverse, use itermax as the min :-) */
1952 if (cx->blk_loop.iterix <= cx->blk_loop.itermax)
1955 if (SvMAGICAL(av) || AvREIFY(av)) {
1956 SV * const * const svp = av_fetch(av, --cx->blk_loop.iterix, FALSE);
1957 sv = svp ? *svp : NULL;
1960 sv = AvARRAY(av)[--cx->blk_loop.iterix];
1964 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp :
1968 if (SvMAGICAL(av) || AvREIFY(av)) {
1969 SV * const * const svp = av_fetch(av, ++cx->blk_loop.iterix, FALSE);
1970 sv = svp ? *svp : NULL;
1973 sv = AvARRAY(av)[++cx->blk_loop.iterix];
1977 if (sv && SvIS_FREED(sv)) {
1979 Perl_croak(aTHX_ "Use of freed value in iteration");
1986 if (av != PL_curstack && sv == &PL_sv_undef) {
1987 SV *lv = cx->blk_loop.iterlval;
1988 if (lv && SvREFCNT(lv) > 1) {
1993 SvREFCNT_dec(LvTARG(lv));
1995 lv = cx->blk_loop.iterlval = newSV_type(SVt_PVLV);
1997 sv_magic(lv, NULL, PERL_MAGIC_defelem, NULL, 0);
1999 LvTARG(lv) = SvREFCNT_inc_simple(av);
2000 LvTARGOFF(lv) = cx->blk_loop.iterix;
2001 LvTARGLEN(lv) = (STRLEN)UV_MAX;
2006 *itersvp = SvREFCNT_inc_simple_NN(sv);
2007 SvREFCNT_dec(oldsv);
2015 register PMOP *pm = cPMOP;
2030 register REGEXP *rx = PM_GETRE(pm);
2032 int force_on_match = 0;
2033 const I32 oldsave = PL_savestack_ix;
2035 bool doutf8 = FALSE;
2036 #ifdef PERL_OLD_COPY_ON_WRITE
2041 /* known replacement string? */
2042 register SV *dstr = (pm->op_pmflags & PMf_CONST) ? POPs : NULL;
2043 if (PL_op->op_flags & OPf_STACKED)
2045 else if (PL_op->op_private & OPpTARGET_MY)
2052 #ifdef PERL_OLD_COPY_ON_WRITE
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);
2061 #ifdef PERL_OLD_COPY_ON_WRITE
2065 || ( ((SvTYPE(TARG) == SVt_PVGV && isGV_with_GP(TARG))
2066 || SvTYPE(TARG) > SVt_PVLV)
2067 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG)))))
2068 DIE(aTHX_ PL_no_modify);
2071 s = SvPV_mutable(TARG, len);
2072 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
2074 rxtainted = ((rx->extflags & RXf_TAINTED) ||
2075 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
2080 RX_MATCH_UTF8_set(rx, DO_UTF8(TARG));
2084 DIE(aTHX_ "panic: pp_subst");
2087 slen = RX_MATCH_UTF8(rx) ? utf8_length((U8*)s, (U8*)strend) : len;
2088 maxiters = 2 * slen + 10; /* We can match twice at each
2089 position, once with zero-length,
2090 second time with non-zero. */
2092 if (!rx->prelen && PL_curpm) {
2096 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand
2097 || (rx->extflags & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY)) )
2098 ? REXEC_COPY_STR : 0;
2100 r_flags |= REXEC_SCREAM;
2103 if (rx->extflags & RXf_USE_INTUIT) {
2105 s = CALLREG_INTUIT_START(rx, TARG, s, strend, r_flags, NULL);
2109 /* How to do it in subst? */
2110 /* if ( (rx->extflags & RXf_CHECK_ALL)
2112 && !(rx->extflags & RXf_KEEPCOPY)
2113 && ((rx->extflags & RXf_NOSCAN)
2114 || !((rx->extflags & RXf_INTUIT_TAIL)
2115 && (r_flags & REXEC_SCREAM))))
2120 /* only replace once? */
2121 once = !(rpm->op_pmflags & PMf_GLOBAL);
2123 /* known replacement string? */
2125 /* replacement needing upgrading? */
2126 if (DO_UTF8(TARG) && !doutf8) {
2127 nsv = sv_newmortal();
2130 sv_recode_to_utf8(nsv, PL_encoding);
2132 sv_utf8_upgrade(nsv);
2133 c = SvPV_const(nsv, clen);
2137 c = SvPV_const(dstr, clen);
2138 doutf8 = DO_UTF8(dstr);
2146 /* can do inplace substitution? */
2148 #ifdef PERL_OLD_COPY_ON_WRITE
2151 && (I32)clen <= rx->minlenret && (once || !(r_flags & REXEC_COPY_STR))
2152 && !(rx->extflags & RXf_LOOKBEHIND_SEEN)
2153 && (!doutf8 || SvUTF8(TARG))) {
2154 if (!CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL,
2155 r_flags | REXEC_CHECKED))
2159 LEAVE_SCOPE(oldsave);
2162 #ifdef PERL_OLD_COPY_ON_WRITE
2163 if (SvIsCOW(TARG)) {
2164 assert (!force_on_match);
2168 if (force_on_match) {
2170 s = SvPV_force(TARG, len);
2175 SvSCREAM_off(TARG); /* disable possible screamer */
2177 rxtainted |= RX_MATCH_TAINTED(rx);
2178 m = orig + rx->offs[0].start;
2179 d = orig + rx->offs[0].end;
2181 if (m - s > strend - d) { /* faster to shorten from end */
2183 Copy(c, m, clen, char);
2188 Move(d, m, i, char);
2192 SvCUR_set(TARG, m - s);
2194 else if ((i = m - s)) { /* faster from front */
2202 Copy(c, m, clen, char);
2207 Copy(c, d, clen, char);
2212 TAINT_IF(rxtainted & 1);
2218 if (iters++ > maxiters)
2219 DIE(aTHX_ "Substitution loop");
2220 rxtainted |= RX_MATCH_TAINTED(rx);
2221 m = rx->offs[0].start + orig;
2224 Move(s, d, i, char);
2228 Copy(c, d, clen, char);
2231 s = rx->offs[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));
2238 SvCUR_set(TARG, d - SvPVX_const(TARG) + i);
2239 Move(s, d, i+1, char); /* include the NUL */
2241 TAINT_IF(rxtainted & 1);
2243 PUSHs(sv_2mortal(newSViv((I32)iters)));
2245 (void)SvPOK_only_UTF8(TARG);
2246 TAINT_IF(rxtainted);
2247 if (SvSMAGICAL(TARG)) {
2255 LEAVE_SCOPE(oldsave);
2259 if (CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL,
2260 r_flags | REXEC_CHECKED))
2262 if (force_on_match) {
2264 s = SvPV_force(TARG, len);
2267 #ifdef PERL_OLD_COPY_ON_WRITE
2270 rxtainted |= RX_MATCH_TAINTED(rx);
2271 dstr = newSVpvn(m, s-m);
2277 register PERL_CONTEXT *cx;
2280 RETURNOP(cPMOP->op_pmreplrootu.op_pmreplroot);
2282 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
2284 if (iters++ > maxiters)
2285 DIE(aTHX_ "Substitution loop");
2286 rxtainted |= RX_MATCH_TAINTED(rx);
2287 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
2292 strend = s + (strend - m);
2294 m = rx->offs[0].start + orig;
2295 if (doutf8 && !SvUTF8(dstr))
2296 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
2298 sv_catpvn(dstr, s, m-s);
2299 s = rx->offs[0].end + orig;
2301 sv_catpvn(dstr, c, clen);
2304 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
2305 TARG, NULL, r_flags));
2306 if (doutf8 && !DO_UTF8(TARG))
2307 sv_catpvn_utf8_upgrade(dstr, s, strend - s, nsv);
2309 sv_catpvn(dstr, s, strend - s);
2311 #ifdef PERL_OLD_COPY_ON_WRITE
2312 /* The match may make the string COW. If so, brilliant, because that's
2313 just saved us one malloc, copy and free - the regexp has donated
2314 the old buffer, and we malloc an entirely new one, rather than the
2315 regexp malloc()ing a buffer and copying our original, only for
2316 us to throw it away here during the substitution. */
2317 if (SvIsCOW(TARG)) {
2318 sv_force_normal_flags(TARG, SV_COW_DROP_PV);
2324 SvPV_set(TARG, SvPVX(dstr));
2325 SvCUR_set(TARG, SvCUR(dstr));
2326 SvLEN_set(TARG, SvLEN(dstr));
2327 doutf8 |= DO_UTF8(dstr);
2328 SvPV_set(dstr, NULL);
2330 TAINT_IF(rxtainted & 1);
2332 PUSHs(sv_2mortal(newSViv((I32)iters)));
2334 (void)SvPOK_only(TARG);
2337 TAINT_IF(rxtainted);
2340 LEAVE_SCOPE(oldsave);
2349 LEAVE_SCOPE(oldsave);
2358 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2359 ++*PL_markstack_ptr;
2360 LEAVE; /* exit inner scope */
2363 if (PL_stack_base + *PL_markstack_ptr > SP) {
2365 const I32 gimme = GIMME_V;
2367 LEAVE; /* exit outer scope */
2368 (void)POPMARK; /* pop src */
2369 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2370 (void)POPMARK; /* pop dst */
2371 SP = PL_stack_base + POPMARK; /* pop original mark */
2372 if (gimme == G_SCALAR) {
2373 if (PL_op->op_private & OPpGREP_LEX) {
2374 SV* const sv = sv_newmortal();
2375 sv_setiv(sv, items);
2383 else if (gimme == G_ARRAY)
2390 ENTER; /* enter inner scope */
2393 src = PL_stack_base[*PL_markstack_ptr];
2395 if (PL_op->op_private & OPpGREP_LEX)
2396 PAD_SVl(PL_op->op_targ) = src;
2400 RETURNOP(cLOGOP->op_other);
2411 register PERL_CONTEXT *cx;
2414 if (CxMULTICALL(&cxstack[cxstack_ix]))
2418 cxstack_ix++; /* temporarily protect top context */
2421 if (gimme == G_SCALAR) {
2424 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2426 *MARK = SvREFCNT_inc(TOPs);
2431 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2433 *MARK = sv_mortalcopy(sv);
2438 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2442 *MARK = &PL_sv_undef;
2446 else if (gimme == G_ARRAY) {
2447 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2448 if (!SvTEMP(*MARK)) {
2449 *MARK = sv_mortalcopy(*MARK);
2450 TAINT_NOT; /* Each item is independent */
2458 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2459 PL_curpm = newpm; /* ... and pop $1 et al */
2462 return cx->blk_sub.retop;
2465 /* This duplicates the above code because the above code must not
2466 * get any slower by more conditions */
2474 register PERL_CONTEXT *cx;
2477 if (CxMULTICALL(&cxstack[cxstack_ix]))
2481 cxstack_ix++; /* temporarily protect top context */
2485 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2486 /* We are an argument to a function or grep().
2487 * This kind of lvalueness was legal before lvalue
2488 * subroutines too, so be backward compatible:
2489 * cannot report errors. */
2491 /* Scalar context *is* possible, on the LHS of -> only,
2492 * as in f()->meth(). But this is not an lvalue. */
2493 if (gimme == G_SCALAR)
2495 if (gimme == G_ARRAY) {
2496 if (!CvLVALUE(cx->blk_sub.cv))
2497 goto temporise_array;
2498 EXTEND_MORTAL(SP - newsp);
2499 for (mark = newsp + 1; mark <= SP; mark++) {
2502 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2503 *mark = sv_mortalcopy(*mark);
2505 /* Can be a localized value subject to deletion. */
2506 PL_tmps_stack[++PL_tmps_ix] = *mark;
2507 SvREFCNT_inc_void(*mark);
2512 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2513 /* Here we go for robustness, not for speed, so we change all
2514 * the refcounts so the caller gets a live guy. Cannot set
2515 * TEMP, so sv_2mortal is out of question. */
2516 if (!CvLVALUE(cx->blk_sub.cv)) {
2522 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2524 if (gimme == G_SCALAR) {
2528 /* Temporaries are bad unless they happen to be elements
2529 * of a tied hash or array */
2530 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY) &&
2531 !(SvRMAGICAL(TOPs) && mg_find(TOPs, PERL_MAGIC_tiedelem))) {
2537 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2538 SvREADONLY(TOPs) ? (TOPs == &PL_sv_undef) ? "undef"
2539 : "a readonly value" : "a temporary");
2541 else { /* Can be a localized value
2542 * subject to deletion. */
2543 PL_tmps_stack[++PL_tmps_ix] = *mark;
2544 SvREFCNT_inc_void(*mark);
2547 else { /* Should not happen? */
2553 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2554 (MARK > SP ? "Empty array" : "Array"));
2558 else if (gimme == G_ARRAY) {
2559 EXTEND_MORTAL(SP - newsp);
2560 for (mark = newsp + 1; mark <= SP; mark++) {
2561 if (*mark != &PL_sv_undef
2562 && SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2563 /* Might be flattened array after $#array = */
2570 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2571 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2574 /* Can be a localized value subject to deletion. */
2575 PL_tmps_stack[++PL_tmps_ix] = *mark;
2576 SvREFCNT_inc_void(*mark);
2582 if (gimme == G_SCALAR) {
2586 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2588 *MARK = SvREFCNT_inc(TOPs);
2593 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2595 *MARK = sv_mortalcopy(sv);
2600 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2604 *MARK = &PL_sv_undef;
2608 else if (gimme == G_ARRAY) {
2610 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2611 if (!SvTEMP(*MARK)) {
2612 *MARK = sv_mortalcopy(*MARK);
2613 TAINT_NOT; /* Each item is independent */
2622 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2623 PL_curpm = newpm; /* ... and pop $1 et al */
2626 return cx->blk_sub.retop;
2634 register PERL_CONTEXT *cx;
2636 const bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2639 DIE(aTHX_ "Not a CODE reference");
2640 switch (SvTYPE(sv)) {
2641 /* This is overwhelming the most common case: */
2643 if (!(cv = GvCVu((GV*)sv))) {
2645 cv = sv_2cv(sv, &stash, &gv, 0);
2657 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2659 SP = PL_stack_base + POPMARK;
2662 if (SvGMAGICAL(sv)) {
2667 sym = SvPVX_const(sv);
2675 sym = SvPV_const(sv, len);
2678 DIE(aTHX_ PL_no_usym, "a subroutine");
2679 if (PL_op->op_private & HINT_STRICT_REFS)
2680 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2681 cv = get_cvn_flags(sym, len, GV_ADD|SvUTF8(sv));
2686 SV * const * sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2687 tryAMAGICunDEREF(to_cv);
2690 if (SvTYPE(cv) == SVt_PVCV)
2695 DIE(aTHX_ "Not a CODE reference");
2696 /* This is the second most common case: */
2706 if (!CvROOT(cv) && !CvXSUB(cv)) {
2710 /* anonymous or undef'd function leaves us no recourse */
2711 if (CvANON(cv) || !(gv = CvGV(cv)))
2712 DIE(aTHX_ "Undefined subroutine called");
2714 /* autoloaded stub? */
2715 if (cv != GvCV(gv)) {
2718 /* should call AUTOLOAD now? */
2721 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2728 sub_name = sv_newmortal();
2729 gv_efullname3(sub_name, gv, NULL);
2730 DIE(aTHX_ "Undefined subroutine &%"SVf" called", SVfARG(sub_name));
2734 DIE(aTHX_ "Not a CODE reference");
2739 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2740 Perl_get_db_sub(aTHX_ &sv, cv);
2742 PL_curcopdb = PL_curcop;
2743 cv = GvCV(PL_DBsub);
2745 if (!cv || (!CvXSUB(cv) && !CvSTART(cv)))
2746 DIE(aTHX_ "No DB::sub routine defined");
2749 if (!(CvISXSUB(cv))) {
2750 /* This path taken at least 75% of the time */
2752 register I32 items = SP - MARK;
2753 AV* const padlist = CvPADLIST(cv);
2754 PUSHBLOCK(cx, CXt_SUB, MARK);
2756 cx->blk_sub.retop = PL_op->op_next;
2758 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2759 * that eval'' ops within this sub know the correct lexical space.
2760 * Owing the speed considerations, we choose instead to search for
2761 * the cv using find_runcv() when calling doeval().
2763 if (CvDEPTH(cv) >= 2) {
2764 PERL_STACK_OVERFLOW_CHECK();
2765 pad_push(padlist, CvDEPTH(cv));
2768 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2770 AV* const av = (AV*)PAD_SVl(0);
2772 /* @_ is normally not REAL--this should only ever
2773 * happen when DB::sub() calls things that modify @_ */
2778 cx->blk_sub.savearray = GvAV(PL_defgv);
2779 GvAV(PL_defgv) = (AV*)SvREFCNT_inc_simple(av);
2780 CX_CURPAD_SAVE(cx->blk_sub);
2781 cx->blk_sub.argarray = av;
2784 if (items > AvMAX(av) + 1) {
2785 SV **ary = AvALLOC(av);
2786 if (AvARRAY(av) != ary) {
2787 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2790 if (items > AvMAX(av) + 1) {
2791 AvMAX(av) = items - 1;
2792 Renew(ary,items,SV*);
2797 Copy(MARK,AvARRAY(av),items,SV*);
2798 AvFILLp(av) = items - 1;
2806 /* warning must come *after* we fully set up the context
2807 * stuff so that __WARN__ handlers can safely dounwind()
2810 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2811 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2812 sub_crush_depth(cv);
2814 DEBUG_S(PerlIO_printf(Perl_debug_log,
2815 "%p entersub returning %p\n", (void*)thr, (void*)CvSTART(cv)));
2817 RETURNOP(CvSTART(cv));
2820 I32 markix = TOPMARK;
2825 /* Need to copy @_ to stack. Alternative may be to
2826 * switch stack to @_, and copy return values
2827 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2828 AV * const av = GvAV(PL_defgv);
2829 const I32 items = AvFILLp(av) + 1; /* @_ is not tieable */
2832 /* Mark is at the end of the stack. */
2834 Copy(AvARRAY(av), SP + 1, items, SV*);
2839 /* We assume first XSUB in &DB::sub is the called one. */
2841 SAVEVPTR(PL_curcop);
2842 PL_curcop = PL_curcopdb;
2845 /* Do we need to open block here? XXXX */
2846 if (CvXSUB(cv)) /* XXX this is supposed to be true */
2847 (void)(*CvXSUB(cv))(aTHX_ cv);
2849 /* Enforce some sanity in scalar context. */
2850 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2851 if (markix > PL_stack_sp - PL_stack_base)
2852 *(PL_stack_base + markix) = &PL_sv_undef;
2854 *(PL_stack_base + markix) = *PL_stack_sp;
2855 PL_stack_sp = PL_stack_base + markix;
2863 Perl_sub_crush_depth(pTHX_ CV *cv)
2866 Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on anonymous subroutine");
2868 SV* const tmpstr = sv_newmortal();
2869 gv_efullname3(tmpstr, CvGV(cv), NULL);
2870 Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on subroutine \"%"SVf"\"",
2879 SV* const elemsv = POPs;
2880 IV elem = SvIV(elemsv);
2881 AV* const av = (AV*)POPs;
2882 const U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
2883 const U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > av_len(av));
2886 if (SvROK(elemsv) && !SvGAMAGIC(elemsv) && ckWARN(WARN_MISC))
2887 Perl_warner(aTHX_ packWARN(WARN_MISC),
2888 "Use of reference \"%"SVf"\" as array index",
2891 elem -= CopARYBASE_get(PL_curcop);
2892 if (SvTYPE(av) != SVt_PVAV)
2894 svp = av_fetch(av, elem, lval && !defer);
2896 #ifdef PERL_MALLOC_WRAP
2897 if (SvUOK(elemsv)) {
2898 const UV uv = SvUV(elemsv);
2899 elem = uv > IV_MAX ? IV_MAX : uv;
2901 else if (SvNOK(elemsv))
2902 elem = (IV)SvNV(elemsv);
2904 static const char oom_array_extend[] =
2905 "Out of memory during array extend"; /* Duplicated in av.c */
2906 MEM_WRAP_CHECK_1(elem,SV*,oom_array_extend);
2909 if (!svp || *svp == &PL_sv_undef) {
2912 DIE(aTHX_ PL_no_aelem, elem);
2913 lv = sv_newmortal();
2914 sv_upgrade(lv, SVt_PVLV);
2916 sv_magic(lv, NULL, PERL_MAGIC_defelem, NULL, 0);
2917 LvTARG(lv) = SvREFCNT_inc_simple(av);
2918 LvTARGOFF(lv) = elem;
2923 if (PL_op->op_private & OPpLVAL_INTRO)
2924 save_aelem(av, elem, svp);
2925 else if (PL_op->op_private & OPpDEREF)
2926 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2928 sv = (svp ? *svp : &PL_sv_undef);
2929 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2930 sv = sv_mortalcopy(sv);
2936 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2941 Perl_croak(aTHX_ PL_no_modify);
2942 if (SvTYPE(sv) < SVt_RV)
2943 sv_upgrade(sv, SVt_RV);
2944 else if (SvTYPE(sv) >= SVt_PV) {
2951 SvRV_set(sv, newSV(0));
2954 SvRV_set(sv, (SV*)newAV());
2957 SvRV_set(sv, (SV*)newHV());
2968 SV* const sv = TOPs;
2971 SV* const rsv = SvRV(sv);
2972 if (SvTYPE(rsv) == SVt_PVCV) {
2978 SETs(method_common(sv, NULL));
2985 SV* const sv = cSVOP_sv;
2986 U32 hash = SvSHARED_HASH(sv);
2988 XPUSHs(method_common(sv, &hash));
2993 S_method_common(pTHX_ SV* meth, U32* hashp)
3000 const char* packname = NULL;
3003 const char * const name = SvPV_const(meth, namelen);
3004 SV * const sv = *(PL_stack_base + TOPMARK + 1);
3007 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
3015 /* this isn't a reference */
3016 if(SvOK(sv) && (packname = SvPV_const(sv, packlen))) {
3017 const HE* const he = hv_fetch_ent(PL_stashcache, sv, 0, 0);
3019 stash = INT2PTR(HV*,SvIV(HeVAL(he)));
3026 !(iogv = gv_fetchsv(sv, 0, SVt_PVIO)) ||
3027 !(ob=(SV*)GvIO(iogv)))
3029 /* this isn't the name of a filehandle either */
3031 ((UTF8_IS_START(*packname) && DO_UTF8(sv))
3032 ? !isIDFIRST_utf8((U8*)packname)
3033 : !isIDFIRST(*packname)
3036 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
3037 SvOK(sv) ? "without a package or object reference"
3038 : "on an undefined value");
3040 /* assume it's a package name */
3041 stash = gv_stashpvn(packname, packlen, 0);
3045 SV* const ref = newSViv(PTR2IV(stash));
3046 (void)hv_store(PL_stashcache, packname, packlen, ref, 0);
3050 /* it _is_ a filehandle name -- replace with a reference */
3051 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
3054 /* if we got here, ob should be a reference or a glob */
3055 if (!ob || !(SvOBJECT(ob)
3056 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
3059 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
3060 (SvSCREAM(meth) && strEQ(name,"isa")) ? "DOES" :
3064 stash = SvSTASH(ob);
3067 /* NOTE: stash may be null, hope hv_fetch_ent and
3068 gv_fetchmethod can cope (it seems they can) */
3070 /* shortcut for simple names */
3072 const HE* const he = hv_fetch_ent(stash, meth, 0, *hashp);
3074 gv = (GV*)HeVAL(he);
3075 if (isGV(gv) && GvCV(gv) &&
3076 (!GvCVGEN(gv) || GvCVGEN(gv)
3077 == (PL_sub_generation + HvMROMETA(stash)->cache_gen)))
3078 return (SV*)GvCV(gv);
3082 gv = gv_fetchmethod(stash ? stash : (HV*)packsv, name);
3085 /* This code tries to figure out just what went wrong with
3086 gv_fetchmethod. It therefore needs to duplicate a lot of
3087 the internals of that function. We can't move it inside
3088 Perl_gv_fetchmethod_autoload(), however, since that would
3089 cause UNIVERSAL->can("NoSuchPackage::foo") to croak, and we
3092 const char* leaf = name;
3093 const char* sep = NULL;
3096 for (p = name; *p; p++) {
3098 sep = p, leaf = p + 1;
3099 else if (*p == ':' && *(p + 1) == ':')
3100 sep = p, leaf = p + 2;
3102 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
3103 /* the method name is unqualified or starts with SUPER:: */
3104 #ifndef USE_ITHREADS
3106 stash = CopSTASH(PL_curcop);
3108 bool need_strlen = 1;
3110 packname = CopSTASHPV(PL_curcop);
3115 HEK * const packhek = HvNAME_HEK(stash);
3117 packname = HEK_KEY(packhek);
3118 packlen = HEK_LEN(packhek);
3130 "Can't use anonymous symbol table for method lookup");
3134 packlen = strlen(packname);
3139 /* the method name is qualified */
3141 packlen = sep - name;
3144 /* we're relying on gv_fetchmethod not autovivifying the stash */
3145 if (gv_stashpvn(packname, packlen, 0)) {
3147 "Can't locate object method \"%s\" via package \"%.*s\"",
3148 leaf, (int)packlen, packname);
3152 "Can't locate object method \"%s\" via package \"%.*s\""
3153 " (perhaps you forgot to load \"%.*s\"?)",
3154 leaf, (int)packlen, packname, (int)packlen, packname);
3157 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
3162 * c-indentation-style: bsd
3164 * indent-tabs-mode: t
3167 * ex: set ts=8 sts=4 sw=4 noet: