3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * For the fashion of Minas Tirith was such that it was built on seven
15 * [p.751 of _The Lord of the Rings_, V/i: "Minas Tirith"]
18 /* This file contains functions to manipulate several of Perl's stacks;
19 * in particular it contains code to push various types of things onto
20 * the savestack, then to pop them off and perform the correct restorative
21 * action for each one. This corresponds to the cleanup Perl does at
26 #define PERL_IN_SCOPE_C
30 Perl_stack_grow(pTHX_ SV **sp, SV **p, SSize_t n)
33 SSize_t current = (p - PL_stack_base);
35 PERL_ARGS_ASSERT_STACK_GROW;
39 "panic: stack_grow() negative count (%"IVdf")", (IV)n);
48 /* If the total might wrap, panic instead. This is really testing
49 * that (current + n + extra < SSize_t_MAX), but done in a way that
51 if (UNLIKELY( current > SSize_t_MAX - extra
52 || current + extra > SSize_t_MAX - n
54 /* diag_listed_as: Out of memory during %s extend */
55 Perl_croak(aTHX_ "Out of memory during stack extend");
57 av_extend(PL_curstack, current + n + extra);
61 #ifndef STRESS_REALLOC
62 #define GROW(old) ((old) * 3 / 2)
64 #define GROW(old) ((old) + 1)
68 Perl_new_stackinfo(pTHX_ I32 stitems, I32 cxitems)
72 si->si_stack = newAV();
73 AvREAL_off(si->si_stack);
74 av_extend(si->si_stack, stitems > 0 ? stitems-1 : 0);
75 AvALLOC(si->si_stack)[0] = &PL_sv_undef;
76 AvFILLp(si->si_stack) = 0;
79 si->si_cxmax = cxitems - 1;
81 si->si_type = PERLSI_UNDEF;
82 Newx(si->si_cxstack, cxitems, PERL_CONTEXT);
83 /* Without any kind of initialising CX_PUSHSUBST()
84 * in pp_subst() will read uninitialised heap. */
85 PoisonNew(si->si_cxstack, cxitems, PERL_CONTEXT);
92 const IV old_max = cxstack_max;
93 cxstack_max = GROW(cxstack_max);
94 Renew(cxstack, cxstack_max + 1, PERL_CONTEXT);
95 /* Without any kind of initialising deep enough recursion
96 * will end up reading uninitialised PERL_CONTEXTs. */
97 PoisonNew(cxstack + old_max + 1, cxstack_max - old_max, PERL_CONTEXT);
98 return cxstack_ix + 1;
102 Perl_push_scope(pTHX)
104 if (UNLIKELY(PL_scopestack_ix == PL_scopestack_max)) {
105 PL_scopestack_max = GROW(PL_scopestack_max);
106 Renew(PL_scopestack, PL_scopestack_max, I32);
108 Renew(PL_scopestack_name, PL_scopestack_max, const char*);
112 PL_scopestack_name[PL_scopestack_ix] = "unknown";
114 PL_scopestack[PL_scopestack_ix++] = PL_savestack_ix;
121 const I32 oldsave = PL_scopestack[--PL_scopestack_ix];
122 LEAVE_SCOPE(oldsave);
126 Perl_markstack_grow(pTHX)
128 const I32 oldmax = PL_markstack_max - PL_markstack;
129 const I32 newmax = GROW(oldmax);
131 Renew(PL_markstack, newmax, I32);
132 PL_markstack_max = PL_markstack + newmax;
133 PL_markstack_ptr = PL_markstack + oldmax;
134 DEBUG_s(DEBUG_v(PerlIO_printf(Perl_debug_log,
135 "MARK grow %p %"IVdf" by %"IVdf"\n",
136 PL_markstack_ptr, (IV)*PL_markstack_ptr, (IV)oldmax)));
137 return PL_markstack_ptr;
141 Perl_savestack_grow(pTHX)
143 PL_savestack_max = GROW(PL_savestack_max);
144 /* Note that we allocate SS_MAXPUSH slots higher than ss_max
145 * so that SS_ADD_END(), SSGROW() etc can do a simper check */
146 Renew(PL_savestack, PL_savestack_max + SS_MAXPUSH, ANY);
150 Perl_savestack_grow_cnt(pTHX_ I32 need)
152 PL_savestack_max = PL_savestack_ix + need;
153 /* Note that we allocate SS_MAXPUSH slots higher than ss_max
154 * so that SS_ADD_END(), SSGROW() etc can do a simper check */
155 Renew(PL_savestack, PL_savestack_max + SS_MAXPUSH, ANY);
160 /* The original function was called Perl_tmps_grow and was removed from public
161 API, Perl_tmps_grow_p is the replacement and it used in public macros but
164 Perl_tmps_grow_p takes a proposed ix. A proposed ix is PL_tmps_ix + extend_by,
165 where the result of (PL_tmps_ix + extend_by) is >= PL_tmps_max
166 Upon return, PL_tmps_stack[ix] will be a valid address. For machine code
167 optimization and register usage reasons, the proposed ix passed into
168 tmps_grow is returned to the caller which the caller can then use to write
169 an SV * to PL_tmps_stack[ix]. If the caller was using tmps_grow in
170 pre-extend mode (EXTEND_MORTAL macro), then it ignores the return value of
171 tmps_grow. Note, tmps_grow DOES NOT write ix to PL_tmps_ix, the caller
172 must assign ix or ret val of tmps_grow to PL_temps_ix themselves if that is
173 appropriate. The assignment to PL_temps_ix can happen before or after
174 tmps_grow call since tmps_grow doesn't look at PL_tmps_ix.
178 Perl_tmps_grow_p(pTHX_ SSize_t ix)
180 SSize_t extend_to = ix;
181 #ifndef STRESS_REALLOC
182 if (ix - PL_tmps_max < 128)
183 extend_to += (PL_tmps_max < 512) ? 128 : 512;
185 PL_tmps_max = extend_to + 1;
186 Renew(PL_tmps_stack, PL_tmps_max, SV*);
194 /* XXX should tmps_floor live in cxstack? */
195 const SSize_t myfloor = PL_tmps_floor;
196 while (PL_tmps_ix > myfloor) { /* clean up after last statement */
197 SV* const sv = PL_tmps_stack[PL_tmps_ix--];
199 PoisonWith(PL_tmps_stack + PL_tmps_ix + 1, 1, SV *, 0xAB);
203 SvREFCNT_dec_NN(sv); /* note, can modify tmps_ix!!! */
209 S_save_scalar_at(pTHX_ SV **sptr, const U32 flags)
214 PERL_ARGS_ASSERT_SAVE_SCALAR_AT;
217 if (flags & SAVEf_KEEPOLDELEM)
220 sv = (*sptr = newSV(0));
221 if (SvTYPE(osv) >= SVt_PVMG && SvMAGIC(osv))
222 mg_localize(osv, sv, cBOOL(flags & SAVEf_SETMAGIC));
229 Perl_save_pushptrptr(pTHX_ void *const ptr1, void *const ptr2, const int type)
239 Perl_save_scalar(pTHX_ GV *gv)
241 SV ** const sptr = &GvSVn(gv);
243 PERL_ARGS_ASSERT_SAVE_SCALAR;
245 if (UNLIKELY(SvGMAGICAL(*sptr))) {
250 save_pushptrptr(SvREFCNT_inc_simple(gv), SvREFCNT_inc(*sptr), SAVEt_SV);
251 return save_scalar_at(sptr, SAVEf_SETMAGIC); /* XXX - FIXME - see #60360 */
254 /* Like save_sptr(), but also SvREFCNT_dec()s the new value. Can be used to
255 * restore a global SV to its prior contents, freeing new value. */
257 Perl_save_generic_svref(pTHX_ SV **sptr)
259 PERL_ARGS_ASSERT_SAVE_GENERIC_SVREF;
261 save_pushptrptr(sptr, SvREFCNT_inc(*sptr), SAVEt_GENERIC_SVREF);
264 /* Like save_pptr(), but also Safefree()s the new value if it is different
265 * from the old one. Can be used to restore a global char* to its prior
266 * contents, freeing new value. */
268 Perl_save_generic_pvref(pTHX_ char **str)
270 PERL_ARGS_ASSERT_SAVE_GENERIC_PVREF;
272 save_pushptrptr(*str, str, SAVEt_GENERIC_PVREF);
275 /* Like save_generic_pvref(), but uses PerlMemShared_free() rather than Safefree().
276 * Can be used to restore a shared global char* to its prior
277 * contents, freeing new value. */
279 Perl_save_shared_pvref(pTHX_ char **str)
281 PERL_ARGS_ASSERT_SAVE_SHARED_PVREF;
283 save_pushptrptr(str, *str, SAVEt_SHARED_PVREF);
286 /* set the SvFLAGS specified by mask to the values in val */
289 Perl_save_set_svflags(pTHX_ SV* sv, U32 mask, U32 val)
293 PERL_ARGS_ASSERT_SAVE_SET_SVFLAGS;
298 SS_ADD_UV(SAVEt_SET_SVFLAGS);
305 Saves the current GP of gv on the save stack to be restored on scope exit.
307 If empty is true, replace the GP with a new GP.
309 If empty is false, mark gv with GVf_INTRO so the next reference
310 assigned is localized, which is how C< local *foo = $someref; > works.
316 Perl_save_gp(pTHX_ GV *gv, I32 empty)
318 PERL_ARGS_ASSERT_SAVE_GP;
320 save_pushptrptr(SvREFCNT_inc(gv), GvGP(gv), SAVEt_GP);
323 GP *gp = Perl_newGP(aTHX_ gv);
324 HV * const stash = GvSTASH(gv);
325 bool isa_changed = 0;
327 if (stash && HvENAME(stash)) {
328 if (GvNAMELEN(gv) == 3 && strnEQ(GvNAME(gv), "ISA", 3))
331 /* taking a method out of circulation ("local")*/
332 mro_method_changed_in(stash);
334 if (GvIOp(gv) && (IoFLAGS(GvIOp(gv)) & IOf_ARGV)) {
336 IoFLAGS(gp->gp_io) |= IOf_ARGV|IOf_START;
339 if (isa_changed) mro_isa_changed_in(stash);
348 Perl_save_ary(pTHX_ GV *gv)
350 AV * const oav = GvAVn(gv);
353 PERL_ARGS_ASSERT_SAVE_ARY;
355 if (UNLIKELY(!AvREAL(oav) && AvREIFY(oav)))
357 save_pushptrptr(SvREFCNT_inc_simple_NN(gv), oav, SAVEt_AV);
361 if (UNLIKELY(SvMAGIC(oav)))
362 mg_localize(MUTABLE_SV(oav), MUTABLE_SV(av), TRUE);
367 Perl_save_hash(pTHX_ GV *gv)
371 PERL_ARGS_ASSERT_SAVE_HASH;
374 SvREFCNT_inc_simple_NN(gv), (ohv = GvHVn(gv)), SAVEt_HV
379 if (UNLIKELY(SvMAGIC(ohv)))
380 mg_localize(MUTABLE_SV(ohv), MUTABLE_SV(hv), TRUE);
385 Perl_save_item(pTHX_ SV *item)
387 SV * const sv = newSVsv(item);
389 PERL_ARGS_ASSERT_SAVE_ITEM;
391 save_pushptrptr(item, /* remember the pointer */
392 sv, /* remember the value */
397 Perl_save_bool(pTHX_ bool *boolp)
401 PERL_ARGS_ASSERT_SAVE_BOOL;
404 SS_ADD_UV(SAVEt_BOOL | (*boolp << 8));
409 Perl_save_pushi32ptr(pTHX_ const I32 i, void *const ptr, const int type)
420 Perl_save_int(pTHX_ int *intp)
423 UV type = ((UV)((UV)i << SAVE_TIGHT_SHIFT) | SAVEt_INT_SMALL);
427 PERL_ARGS_ASSERT_SAVE_INT;
429 if (UNLIKELY((int)(type >> SAVE_TIGHT_SHIFT) != i)) {
440 Perl_save_I8(pTHX_ I8 *bytep)
444 PERL_ARGS_ASSERT_SAVE_I8;
447 SS_ADD_UV(SAVEt_I8 | ((UV)*bytep << 8));
452 Perl_save_I16(pTHX_ I16 *intp)
456 PERL_ARGS_ASSERT_SAVE_I16;
459 SS_ADD_UV(SAVEt_I16 | ((UV)*intp << 8));
464 Perl_save_I32(pTHX_ I32 *intp)
467 UV type = ((I32)((U32)i << SAVE_TIGHT_SHIFT) | SAVEt_I32_SMALL);
471 PERL_ARGS_ASSERT_SAVE_I32;
473 if (UNLIKELY((I32)(type >> SAVE_TIGHT_SHIFT) != i)) {
484 Perl_save_strlen(pTHX_ STRLEN *ptr)
488 PERL_ARGS_ASSERT_SAVE_STRLEN;
492 SS_ADD_UV(SAVEt_STRLEN);
496 /* Cannot use save_sptr() to store a char* since the SV** cast will
497 * force word-alignment and we'll miss the pointer.
500 Perl_save_pptr(pTHX_ char **pptr)
502 PERL_ARGS_ASSERT_SAVE_PPTR;
504 save_pushptrptr(*pptr, pptr, SAVEt_PPTR);
508 Perl_save_vptr(pTHX_ void *ptr)
510 PERL_ARGS_ASSERT_SAVE_VPTR;
512 save_pushptrptr(*(char**)ptr, ptr, SAVEt_VPTR);
516 Perl_save_sptr(pTHX_ SV **sptr)
518 PERL_ARGS_ASSERT_SAVE_SPTR;
520 save_pushptrptr(*sptr, sptr, SAVEt_SPTR);
524 Perl_save_padsv_and_mortalize(pTHX_ PADOFFSET off)
528 ASSERT_CURPAD_ACTIVE("save_padsv");
529 SS_ADD_PTR(SvREFCNT_inc_simple_NN(PL_curpad[off]));
530 SS_ADD_PTR(PL_comppad);
532 SS_ADD_UV(SAVEt_PADSV_AND_MORTALIZE);
537 Perl_save_hptr(pTHX_ HV **hptr)
539 PERL_ARGS_ASSERT_SAVE_HPTR;
541 save_pushptrptr(*hptr, hptr, SAVEt_HPTR);
545 Perl_save_aptr(pTHX_ AV **aptr)
547 PERL_ARGS_ASSERT_SAVE_APTR;
549 save_pushptrptr(*aptr, aptr, SAVEt_APTR);
553 Perl_save_pushptr(pTHX_ void *const ptr, const int type)
562 Perl_save_clearsv(pTHX_ SV **svp)
564 const UV offset = svp - PL_curpad;
565 const UV offset_shifted = offset << SAVE_TIGHT_SHIFT;
567 PERL_ARGS_ASSERT_SAVE_CLEARSV;
569 ASSERT_CURPAD_ACTIVE("save_clearsv");
570 SvPADSTALE_off(*svp); /* mark lexical as active */
571 if (UNLIKELY((offset_shifted >> SAVE_TIGHT_SHIFT) != offset)) {
572 Perl_croak(aTHX_ "panic: pad offset %"UVuf" out of range (%p-%p)",
573 offset, svp, PL_curpad);
578 SS_ADD_UV(offset_shifted | SAVEt_CLEARSV);
584 Perl_save_delete(pTHX_ HV *hv, char *key, I32 klen)
586 PERL_ARGS_ASSERT_SAVE_DELETE;
588 save_pushptri32ptr(key, klen, SvREFCNT_inc_simple(hv), SAVEt_DELETE);
592 Perl_save_hdelete(pTHX_ HV *hv, SV *keysv)
598 PERL_ARGS_ASSERT_SAVE_HDELETE;
600 key = SvPV_const(keysv, len);
601 klen = SvUTF8(keysv) ? -(I32)len : (I32)len;
602 SvREFCNT_inc_simple_void_NN(hv);
603 save_pushptri32ptr(savepvn(key, len), klen, hv, SAVEt_DELETE);
607 Perl_save_adelete(pTHX_ AV *av, SSize_t key)
611 PERL_ARGS_ASSERT_SAVE_ADELETE;
613 SvREFCNT_inc_void(av);
616 SS_ADD_IV(SAVEt_ADELETE);
621 Perl_save_destructor(pTHX_ DESTRUCTORFUNC_NOCONTEXT_t f, void* p)
624 PERL_ARGS_ASSERT_SAVE_DESTRUCTOR;
628 SS_ADD_UV(SAVEt_DESTRUCTOR);
633 Perl_save_destructor_x(pTHX_ DESTRUCTORFUNC_t f, void* p)
639 SS_ADD_UV(SAVEt_DESTRUCTOR_X);
644 Perl_save_hints(pTHX)
646 COPHH *save_cophh = cophh_copy(CopHINTHASH_get(&PL_compiling));
647 if (PL_hints & HINT_LOCALIZE_HH) {
648 HV *oldhh = GvHV(PL_hintgv);
649 save_pushptri32ptr(oldhh, PL_hints, save_cophh, SAVEt_HINTS);
650 GvHV(PL_hintgv) = NULL; /* in case copying dies */
651 GvHV(PL_hintgv) = hv_copy_hints_hv(oldhh);
653 save_pushi32ptr(PL_hints, save_cophh, SAVEt_HINTS);
658 S_save_pushptri32ptr(pTHX_ void *const ptr1, const I32 i, void *const ptr2,
670 Perl_save_aelem_flags(pTHX_ AV *av, SSize_t idx, SV **sptr,
676 PERL_ARGS_ASSERT_SAVE_AELEM_FLAGS;
679 SS_ADD_PTR(SvREFCNT_inc_simple(av));
681 SS_ADD_PTR(SvREFCNT_inc(*sptr));
682 SS_ADD_UV(SAVEt_AELEM);
684 /* The array needs to hold a reference count on its new element, so it
686 if (UNLIKELY(!AvREAL(av) && AvREIFY(av)))
688 save_scalar_at(sptr, flags); /* XXX - FIXME - see #60360 */
689 if (flags & SAVEf_KEEPOLDELEM)
692 /* If we're localizing a tied array element, this new sv
693 * won't actually be stored in the array - so it won't get
694 * reaped when the localize ends. Ensure it gets reaped by
695 * mortifying it instead. DAPM */
696 if (UNLIKELY(SvTIED_mg((const SV *)av, PERL_MAGIC_tied)))
701 Perl_save_helem_flags(pTHX_ HV *hv, SV *key, SV **sptr, const U32 flags)
705 PERL_ARGS_ASSERT_SAVE_HELEM_FLAGS;
710 SS_ADD_PTR(SvREFCNT_inc_simple(hv));
711 SS_ADD_PTR(newSVsv(key));
712 SS_ADD_PTR(SvREFCNT_inc(*sptr));
713 SS_ADD_UV(SAVEt_HELEM);
716 save_scalar_at(sptr, flags);
717 if (flags & SAVEf_KEEPOLDELEM)
720 /* If we're localizing a tied hash element, this new sv
721 * won't actually be stored in the hash - so it won't get
722 * reaped when the localize ends. Ensure it gets reaped by
723 * mortifying it instead. DAPM */
724 if (UNLIKELY(SvTIED_mg((const SV *)hv, PERL_MAGIC_tied)))
729 Perl_save_svref(pTHX_ SV **sptr)
731 PERL_ARGS_ASSERT_SAVE_SVREF;
734 save_pushptrptr(sptr, SvREFCNT_inc(*sptr), SAVEt_SVREF);
735 return save_scalar_at(sptr, SAVEf_SETMAGIC); /* XXX - FIXME - see #60360 */
743 SS_ADD_IV(PL_tmps_floor);
744 PL_tmps_floor = PL_tmps_ix;
745 SS_ADD_UV(SAVEt_TMPSFLOOR);
751 Perl_save_alloc(pTHX_ I32 size, I32 pad)
753 const I32 start = pad + ((char*)&PL_savestack[PL_savestack_ix]
754 - (char*)PL_savestack);
755 const UV elems = 1 + ((size + pad - 1) / sizeof(*PL_savestack));
756 const UV elems_shifted = elems << SAVE_TIGHT_SHIFT;
758 if (UNLIKELY((elems_shifted >> SAVE_TIGHT_SHIFT) != elems))
760 "panic: save_alloc elems %"UVuf" out of range (%"IVdf"-%"IVdf")",
761 elems, (IV)size, (IV)pad);
765 PL_savestack_ix += elems;
766 SSPUSHUV(SAVEt_ALLOC | elems_shifted);
772 #define ARG0_SV MUTABLE_SV(arg0.any_ptr)
773 #define ARG0_AV MUTABLE_AV(arg0.any_ptr)
774 #define ARG0_HV MUTABLE_HV(arg0.any_ptr)
775 #define ARG0_PTR arg0.any_ptr
776 #define ARG0_PV (char*)(arg0.any_ptr)
777 #define ARG0_PVP (char**)(arg0.any_ptr)
778 #define ARG0_I32 (arg0.any_i32)
780 #define ARG1_SV MUTABLE_SV(arg1.any_ptr)
781 #define ARG1_AV MUTABLE_AV(arg1.any_ptr)
782 #define ARG1_GV MUTABLE_GV(arg1.any_ptr)
783 #define ARG1_SVP (SV**)(arg1.any_ptr)
784 #define ARG1_PVP (char**)(arg1.any_ptr)
785 #define ARG1_PTR arg1.any_ptr
786 #define ARG1_PV (char*)(arg1.any_ptr)
787 #define ARG1_I32 (arg1.any_i32)
789 #define ARG2_SV MUTABLE_SV(arg2.any_ptr)
790 #define ARG2_AV MUTABLE_AV(arg2.any_ptr)
791 #define ARG2_HV MUTABLE_HV(arg2.any_ptr)
792 #define ARG2_GV MUTABLE_GV(arg2.any_ptr)
793 #define ARG2_PV (char*)(arg2.any_ptr)
796 Perl_leave_scope(pTHX_ I32 base)
798 /* Localise the effects of the TAINT_NOT inside the loop. */
799 bool was = TAINT_get;
804 ANY arg0, arg1, arg2;
806 /* these initialisations are logically unnecessary, but they shut up
807 * spurious 'may be used uninitialized' compiler warnings */
812 if (UNLIKELY(base < -1))
813 Perl_croak(aTHX_ "panic: corrupt saved stack index %ld", (long) base);
814 DEBUG_l(Perl_deb(aTHX_ "savestack: releasing items %ld -> %ld\n",
815 (long)PL_savestack_ix, (long)base));
816 while (PL_savestack_ix > base) {
826 I32 ix = PL_savestack_ix - 1;
827 ANY *p = &PL_savestack[ix];
829 type = (U8)uv & SAVE_MASK;
830 if (type > SAVEt_ARG0_MAX) {
833 if (type > SAVEt_ARG1_MAX) {
835 if (type > SAVEt_ARG2_MAX) {
841 PL_savestack_ix = ix;
845 case SAVEt_ITEM: /* normal string */
846 sv_replace(ARG1_SV, ARG0_SV);
847 if (UNLIKELY(SvSMAGICAL(ARG1_SV))) {
854 /* This would be a mathom, but Perl_save_svref() calls a static
855 function, S_save_scalar_at(), so has to stay in this file. */
856 case SAVEt_SVREF: /* scalar reference */
858 refsv = NULL; /* what to refcnt_dec */
861 case SAVEt_SV: /* scalar reference */
862 svp = &GvSV(ARG1_GV);
863 refsv = ARG1_SV; /* what to refcnt_dec */
866 SV * const sv = *svp;
869 if (UNLIKELY(SvSMAGICAL(ARG0_SV))) {
870 /* mg_set could die, skipping the freeing of ARG0_SV and
871 * refsv; Ensure that they're always freed in that case */
874 SS_ADD_UV(SAVEt_FREESV);
876 SS_ADD_UV(SAVEt_FREESV);
883 SvREFCNT_dec_NN(ARG0_SV);
887 case SAVEt_GENERIC_PVREF: /* generic pv */
888 if (*ARG0_PVP != ARG1_PV) {
893 case SAVEt_SHARED_PVREF: /* shared pv */
894 if (*ARG1_PVP != ARG0_PV) {
896 PerlMem_free(*ARG1_PVP);
898 PerlMemShared_free(*ARG1_PVP);
903 case SAVEt_GVSV: /* scalar slot in GV */
904 svp = &GvSV(ARG1_GV);
906 case SAVEt_GENERIC_SVREF: /* generic sv */
910 SV * const sv = *svp;
913 SvREFCNT_dec(ARG0_SV);
916 case SAVEt_GVSLOT: /* any slot in GV */
918 HV *const hv = GvSTASH(ARG2_GV);
920 if (hv && HvENAME(hv) && (
921 (ARG0_SV && SvTYPE(ARG0_SV) == SVt_PVCV)
922 || (*svp && SvTYPE(*svp) == SVt_PVCV)
925 if ((char *)svp < (char *)GvGP(ARG2_GV)
926 || (char *)svp > (char *)GvGP(ARG2_GV) + sizeof(struct gp)
927 || GvREFCNT(ARG2_GV) > 2) /* "> 2" to ignore savestack's ref */
929 else mro_method_changed_in(hv);
933 case SAVEt_AV: /* array reference */
934 SvREFCNT_dec(GvAV(ARG1_GV));
935 GvAV(ARG1_GV) = ARG0_AV;
937 if (UNLIKELY(SvSMAGICAL(ARG0_SV))) {
938 /* mg_set might die, so make sure ARG1 isn't leaked */
941 SS_ADD_UV(SAVEt_FREESV);
948 SvREFCNT_dec_NN(ARG1_GV);
950 case SAVEt_HV: /* hash reference */
951 SvREFCNT_dec(GvHV(ARG1_GV));
952 GvHV(ARG1_GV) = ARG0_HV;
955 case SAVEt_INT_SMALL:
956 *(int*)ARG0_PTR = (int)(uv >> SAVE_TIGHT_SHIFT);
958 case SAVEt_INT: /* int reference */
959 *(int*)ARG0_PTR = (int)ARG1_I32;
961 case SAVEt_STRLEN: /* STRLEN/size_t ref */
962 *(STRLEN*)ARG0_PTR = (STRLEN)arg1.any_iv;
964 case SAVEt_TMPSFLOOR: /* restore PL_tmps_floor */
965 PL_tmps_floor = (SSize_t)arg0.any_iv;
967 case SAVEt_BOOL: /* bool reference */
968 *(bool*)ARG0_PTR = cBOOL(uv >> 8);
969 #ifdef NO_TAINT_SUPPORT
970 PERL_UNUSED_VAR(was);
972 if (UNLIKELY(ARG0_PTR == &(TAINT_get))) {
973 /* If we don't update <was>, to reflect what was saved on the
974 * stack for PL_tainted, then we will overwrite this attempt to
975 * restore it when we exit this routine. Note that this won't
976 * work if this value was saved in a wider-than necessary type,
978 was = *(bool*)ARG0_PTR;
982 case SAVEt_I32_SMALL:
983 *(I32*)ARG0_PTR = (I32)(uv >> SAVE_TIGHT_SHIFT);
985 case SAVEt_I32: /* I32 reference */
986 #ifdef PERL_DEBUG_READONLY_OPS
987 if (*(I32*)ARG0_PTR != ARG1_I32)
989 *(I32*)ARG0_PTR = ARG1_I32;
991 case SAVEt_SPTR: /* SV* reference */
992 *(SV**)(ARG0_PTR)= ARG1_SV;
994 case SAVEt_VPTR: /* random* reference */
995 case SAVEt_PPTR: /* char* reference */
998 case SAVEt_HPTR: /* HV* reference */
999 *(HV**)ARG0_PTR = MUTABLE_HV(ARG1_PTR);
1001 case SAVEt_APTR: /* AV* reference */
1002 *(AV**)ARG0_PTR = ARG1_AV;
1004 case SAVEt_GP: /* scalar reference */
1007 /* possibly taking a method out of circulation */
1008 const bool had_method = !!GvCVu(ARG1_GV);
1010 GvGP_set(ARG1_GV, (GP*)ARG0_PTR);
1011 if ((hv=GvSTASH(ARG1_GV)) && HvENAME_get(hv)) {
1012 if ( GvNAMELEN(ARG1_GV) == 3
1013 && strnEQ(GvNAME(ARG1_GV), "ISA", 3)
1015 mro_isa_changed_in(hv);
1016 else if (had_method || GvCVu(ARG1_GV))
1017 /* putting a method back into circulation ("local")*/
1018 gv_method_changed(ARG1_GV);
1020 SvREFCNT_dec_NN(ARG1_GV);
1024 SvREFCNT_dec(ARG0_SV);
1026 case SAVEt_FREEPADNAME:
1027 PadnameREFCNT_dec((PADNAME *)ARG0_PTR);
1029 case SAVEt_FREECOPHH:
1030 cophh_free((COPHH *)ARG0_PTR);
1032 case SAVEt_MORTALIZESV:
1033 sv_2mortal(ARG0_SV);
1036 ASSERT_CURPAD_LEGAL("SAVEt_FREEOP");
1037 op_free((OP*)ARG0_PTR);
1043 case SAVEt_CLEARPADRANGE:
1044 i = (I32)((uv >> SAVE_TIGHT_SHIFT) & OPpPADRANGE_COUNTMASK);
1045 svp = &PL_curpad[uv >>
1046 (OPpPADRANGE_COUNTSHIFT + SAVE_TIGHT_SHIFT)] + i - 1;
1049 svp = &PL_curpad[uv >> SAVE_TIGHT_SHIFT];
1052 for (; i; i--, svp--) {
1055 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1056 "Pad 0x%"UVxf"[0x%"UVxf"] clearsv: %ld sv=0x%"UVxf"<%"IVdf"> %s\n",
1057 PTR2UV(PL_comppad), PTR2UV(PL_curpad),
1058 (long)(svp-PL_curpad), PTR2UV(sv), (IV)SvREFCNT(sv),
1059 (SvREFCNT(sv) <= 1 && !SvOBJECT(sv)) ? "clear" : "abandon"
1062 /* Can clear pad variable in place? */
1063 if (SvREFCNT(sv) == 1 && !SvOBJECT(sv)) {
1065 /* these flags are the union of all the relevant flags
1066 * in the individual conditions within */
1067 if (UNLIKELY(SvFLAGS(sv) & (
1068 SVf_READONLY|SVf_PROTECT /*for SvREADONLY_off*/
1069 | (SVs_GMG|SVs_SMG|SVs_RMG) /* SvMAGICAL() */
1073 /* if a my variable that was made readonly is
1074 * going out of scope, we want to remove the
1075 * readonlyness so that it can go out of scope
1081 if (SvOOK(sv)) { /* OOK or HvAUX */
1082 if (SvTYPE(sv) == SVt_PVHV)
1083 Perl_hv_kill_backrefs(aTHX_ MUTABLE_HV(sv));
1088 if (SvMAGICAL(sv)) {
1089 /* note that backrefs (either in HvAUX or magic)
1090 * must be removed before other magic */
1091 sv_unmagic(sv, PERL_MAGIC_backref);
1092 if (SvTYPE(sv) != SVt_PVCV)
1095 if (SvTHINKFIRST(sv))
1096 sv_force_normal_flags(sv, SV_IMMEDIATE_UNREF
1100 switch (SvTYPE(sv)) {
1104 av_clear(MUTABLE_AV(sv));
1107 hv_clear(MUTABLE_HV(sv));
1113 ? CvNAME_HEK((CV *)sv)
1114 : GvNAME_HEK(CvGV(sv));
1116 (void)share_hek_hek(hek);
1118 CvNAME_HEK_set(sv, hek);
1123 /* This looks odd, but these two macros are for use in
1124 expressions and finish with a trailing comma, so
1125 adding a ; after them would be wrong. */
1128 SvFLAGS(sv) &=~ (SVf_OK|SVf_IVisUV|SVf_UTF8);
1132 SvPADSTALE_on(sv); /* mark as no longer live */
1134 else { /* Someone has a claim on this, so abandon it. */
1135 switch (SvTYPE(sv)) { /* Console ourselves with a new value */
1136 case SVt_PVAV: *svp = MUTABLE_SV(newAV()); break;
1137 case SVt_PVHV: *svp = MUTABLE_SV(newHV()); break;
1140 HEK * const hek = CvNAMED(sv)
1141 ? CvNAME_HEK((CV *)sv)
1142 : GvNAME_HEK(CvGV(sv));
1145 *svp = newSV_type(SVt_PVCV);
1148 CvNAME_HEK_set(*svp,
1149 share_hek_hek(hek));
1153 default: *svp = newSV(0); break;
1155 SvREFCNT_dec_NN(sv); /* Cast current value to the winds. */
1156 /* preserve pad nature, but also mark as not live
1157 * for any closure capturing */
1158 SvFLAGS(*svp) |= SVs_PADSTALE;
1163 (void)hv_delete(ARG0_HV, ARG2_PV, ARG1_I32, G_DISCARD);
1164 SvREFCNT_dec(ARG0_HV);
1165 Safefree(arg2.any_ptr);
1168 (void)av_delete(ARG0_AV, arg1.any_iv, G_DISCARD);
1169 SvREFCNT_dec(ARG0_AV);
1171 case SAVEt_DESTRUCTOR_X:
1172 (*arg1.any_dxptr)(aTHX_ ARG0_PTR);
1174 case SAVEt_REGCONTEXT:
1175 /* regexp must have croaked */
1177 PL_savestack_ix -= uv >> SAVE_TIGHT_SHIFT;
1179 case SAVEt_STACK_POS: /* Position on Perl stack */
1180 PL_stack_sp = PL_stack_base + arg0.any_i32;
1182 case SAVEt_AELEM: /* array element */
1183 svp = av_fetch(ARG2_AV, arg1.any_iv, 1);
1184 if (UNLIKELY(!AvREAL(ARG2_AV) && AvREIFY(ARG2_AV))) /* undo reify guard */
1185 SvREFCNT_dec(ARG0_SV);
1187 SV * const sv = *svp;
1188 if (LIKELY(sv && sv != &PL_sv_undef)) {
1189 if (UNLIKELY(SvTIED_mg((const SV *)ARG2_AV, PERL_MAGIC_tied)))
1190 SvREFCNT_inc_void_NN(sv);
1195 SvREFCNT_dec(ARG2_AV);
1196 SvREFCNT_dec(ARG0_SV);
1198 case SAVEt_HELEM: /* hash element */
1200 HE * const he = hv_fetch_ent(ARG2_HV, ARG1_SV, 1, 0);
1201 SvREFCNT_dec(ARG1_SV);
1203 const SV * const oval = HeVAL(he);
1204 if (LIKELY(oval && oval != &PL_sv_undef)) {
1206 if (UNLIKELY(SvTIED_mg((const SV *)ARG2_HV, PERL_MAGIC_tied)))
1207 SvREFCNT_inc_void(*svp);
1208 refsv = ARG2_SV; /* what to refcnt_dec */
1212 SvREFCNT_dec(ARG2_HV);
1213 SvREFCNT_dec(ARG0_SV);
1217 PL_op = (OP*)ARG0_PTR;
1220 if ((PL_hints & HINT_LOCALIZE_HH)) {
1221 while (GvHV(PL_hintgv)) {
1222 HV *hv = GvHV(PL_hintgv);
1223 GvHV(PL_hintgv) = NULL;
1224 SvREFCNT_dec(MUTABLE_SV(hv));
1227 cophh_free(CopHINTHASH_get(&PL_compiling));
1228 CopHINTHASH_set(&PL_compiling, (COPHH*)ARG0_PTR);
1229 *(I32*)&PL_hints = ARG1_I32;
1230 if (PL_hints & HINT_LOCALIZE_HH) {
1231 SvREFCNT_dec(MUTABLE_SV(GvHV(PL_hintgv)));
1232 GvHV(PL_hintgv) = MUTABLE_HV(SSPOPPTR);
1234 if (!GvHV(PL_hintgv)) {
1235 /* Need to add a new one manually, else rv2hv can
1236 add one via GvHVn and it won't have the magic set. */
1237 HV *const hv = newHV();
1238 hv_magic(hv, NULL, PERL_MAGIC_hints);
1239 GvHV(PL_hintgv) = hv;
1241 assert(GvHV(PL_hintgv));
1244 PL_comppad = (PAD*)ARG0_PTR;
1245 if (LIKELY(PL_comppad))
1246 PL_curpad = AvARRAY(PL_comppad);
1250 case SAVEt_PADSV_AND_MORTALIZE:
1254 svp = AvARRAY((PAD*)ARG1_PTR) + (PADOFFSET)arg0.any_uv;
1255 /* This mortalizing used to be done by CX_POOPLOOP() via
1256 itersave. But as we have all the information here, we
1257 can do it here, save even having to have itersave in
1264 case SAVEt_SAVESWITCHSTACK:
1267 SWITCHSTACK(ARG0_AV, ARG1_AV);
1268 PL_curstackinfo->si_stack = ARG1_AV;
1271 case SAVEt_SET_SVFLAGS:
1272 SvFLAGS(ARG2_SV) &= ~((U32)ARG1_I32);
1273 SvFLAGS(ARG2_SV) |= (U32)ARG0_I32;
1276 /* These are only saved in mathoms.c */
1278 (void)sv_clear(ARG0_SV);
1280 case SAVEt_LONG: /* long reference */
1281 *(long*)ARG0_PTR = arg1.any_long;
1283 case SAVEt_IV: /* IV reference */
1284 *(IV*)ARG0_PTR = arg1.any_iv;
1287 case SAVEt_I16: /* I16 reference */
1288 *(I16*)ARG0_PTR = (I16)(uv >> 8);
1290 case SAVEt_I8: /* I8 reference */
1291 *(I8*)ARG0_PTR = (I8)(uv >> 8);
1293 case SAVEt_DESTRUCTOR:
1294 (*arg1.any_dptr)(ARG0_PTR);
1296 case SAVEt_COMPILE_WARNINGS:
1297 if (!specialWARN(PL_compiling.cop_warnings))
1298 PerlMemShared_free(PL_compiling.cop_warnings);
1300 PL_compiling.cop_warnings = (STRLEN*)ARG0_PTR;
1303 parser_free((yy_parser *) ARG0_PTR);
1305 case SAVEt_READONLY_OFF:
1306 SvREADONLY_off(ARG0_SV);
1309 Perl_croak(aTHX_ "panic: leave_scope inconsistency %u", type);
1317 Perl_cx_dump(pTHX_ PERL_CONTEXT *cx)
1319 PERL_ARGS_ASSERT_CX_DUMP;
1322 PerlIO_printf(Perl_debug_log, "CX %ld = %s\n", (long)(cx - cxstack), PL_block_type[CxTYPE(cx)]);
1323 if (CxTYPE(cx) != CXt_SUBST) {
1324 const char *gimme_text;
1325 PerlIO_printf(Perl_debug_log, "BLK_OLDSP = %ld\n", (long)cx->blk_oldsp);
1326 PerlIO_printf(Perl_debug_log, "BLK_OLDCOP = 0x%"UVxf"\n",
1327 PTR2UV(cx->blk_oldcop));
1328 PerlIO_printf(Perl_debug_log, "BLK_OLDMARKSP = %ld\n", (long)cx->blk_oldmarksp);
1329 PerlIO_printf(Perl_debug_log, "BLK_OLDSCOPESP = %ld\n", (long)cx->blk_oldscopesp);
1330 PerlIO_printf(Perl_debug_log, "BLK_OLDSAVEIX = %ld\n", (long)cx->blk_oldsaveix);
1331 PerlIO_printf(Perl_debug_log, "BLK_OLDPM = 0x%"UVxf"\n",
1332 PTR2UV(cx->blk_oldpm));
1333 switch (cx->blk_gimme) {
1335 gimme_text = "VOID";
1338 gimme_text = "SCALAR";
1341 gimme_text = "LIST";
1344 gimme_text = "UNKNOWN";
1347 PerlIO_printf(Perl_debug_log, "BLK_GIMME = %s\n", gimme_text);
1349 switch (CxTYPE(cx)) {
1354 PerlIO_printf(Perl_debug_log, "BLK_FORMAT.CV = 0x%"UVxf"\n",
1355 PTR2UV(cx->blk_format.cv));
1356 PerlIO_printf(Perl_debug_log, "BLK_FORMAT.GV = 0x%"UVxf"\n",
1357 PTR2UV(cx->blk_format.gv));
1358 PerlIO_printf(Perl_debug_log, "BLK_FORMAT.DFOUTGV = 0x%"UVxf"\n",
1359 PTR2UV(cx->blk_format.dfoutgv));
1360 PerlIO_printf(Perl_debug_log, "BLK_FORMAT.HASARGS = %d\n",
1361 (int)CxHASARGS(cx));
1362 PerlIO_printf(Perl_debug_log, "BLK_FORMAT.RETOP = 0x%"UVxf"\n",
1363 PTR2UV(cx->blk_format.retop));
1366 PerlIO_printf(Perl_debug_log, "BLK_SUB.CV = 0x%"UVxf"\n",
1367 PTR2UV(cx->blk_sub.cv));
1368 PerlIO_printf(Perl_debug_log, "BLK_SUB.OLDDEPTH = %ld\n",
1369 (long)cx->blk_sub.olddepth);
1370 PerlIO_printf(Perl_debug_log, "BLK_SUB.HASARGS = %d\n",
1371 (int)CxHASARGS(cx));
1372 PerlIO_printf(Perl_debug_log, "BLK_SUB.LVAL = %d\n", (int)CxLVAL(cx));
1373 PerlIO_printf(Perl_debug_log, "BLK_SUB.RETOP = 0x%"UVxf"\n",
1374 PTR2UV(cx->blk_sub.retop));
1377 PerlIO_printf(Perl_debug_log, "BLK_EVAL.OLD_IN_EVAL = %ld\n",
1378 (long)CxOLD_IN_EVAL(cx));
1379 PerlIO_printf(Perl_debug_log, "BLK_EVAL.OLD_OP_TYPE = %s (%s)\n",
1380 PL_op_name[CxOLD_OP_TYPE(cx)],
1381 PL_op_desc[CxOLD_OP_TYPE(cx)]);
1382 if (cx->blk_eval.old_namesv)
1383 PerlIO_printf(Perl_debug_log, "BLK_EVAL.OLD_NAME = %s\n",
1384 SvPVX_const(cx->blk_eval.old_namesv));
1385 PerlIO_printf(Perl_debug_log, "BLK_EVAL.OLD_EVAL_ROOT = 0x%"UVxf"\n",
1386 PTR2UV(cx->blk_eval.old_eval_root));
1387 PerlIO_printf(Perl_debug_log, "BLK_EVAL.RETOP = 0x%"UVxf"\n",
1388 PTR2UV(cx->blk_eval.retop));
1391 case CXt_LOOP_PLAIN:
1392 case CXt_LOOP_LAZYIV:
1393 case CXt_LOOP_LAZYSV:
1396 PerlIO_printf(Perl_debug_log, "BLK_LOOP.LABEL = %s\n", CxLABEL(cx));
1397 PerlIO_printf(Perl_debug_log, "BLK_LOOP.MY_OP = 0x%"UVxf"\n",
1398 PTR2UV(cx->blk_loop.my_op));
1399 if (CxTYPE(cx) != CXt_LOOP_PLAIN) {
1400 PerlIO_printf(Perl_debug_log, "BLK_LOOP.ITERVAR = 0x%"UVxf"\n",
1401 PTR2UV(CxITERVAR(cx)));
1402 PerlIO_printf(Perl_debug_log, "BLK_LOOP.ITERSAVE = 0x%"UVxf"\n",
1403 PTR2UV(cx->blk_loop.itersave));
1404 /* XXX: not accurate for LAZYSV/IV/LIST */
1405 PerlIO_printf(Perl_debug_log, "BLK_LOOP.ITERARY = 0x%"UVxf"\n",
1406 PTR2UV(cx->blk_loop.state_u.ary.ary));
1407 PerlIO_printf(Perl_debug_log, "BLK_LOOP.ITERIX = %ld\n",
1408 (long)cx->blk_loop.state_u.ary.ix);
1413 PerlIO_printf(Perl_debug_log, "SB_ITERS = %ld\n",
1414 (long)cx->sb_iters);
1415 PerlIO_printf(Perl_debug_log, "SB_MAXITERS = %ld\n",
1416 (long)cx->sb_maxiters);
1417 PerlIO_printf(Perl_debug_log, "SB_RFLAGS = %ld\n",
1418 (long)cx->sb_rflags);
1419 PerlIO_printf(Perl_debug_log, "SB_ONCE = %ld\n",
1421 PerlIO_printf(Perl_debug_log, "SB_ORIG = %s\n",
1423 PerlIO_printf(Perl_debug_log, "SB_DSTR = 0x%"UVxf"\n",
1424 PTR2UV(cx->sb_dstr));
1425 PerlIO_printf(Perl_debug_log, "SB_TARG = 0x%"UVxf"\n",
1426 PTR2UV(cx->sb_targ));
1427 PerlIO_printf(Perl_debug_log, "SB_S = 0x%"UVxf"\n",
1429 PerlIO_printf(Perl_debug_log, "SB_M = 0x%"UVxf"\n",
1431 PerlIO_printf(Perl_debug_log, "SB_STREND = 0x%"UVxf"\n",
1432 PTR2UV(cx->sb_strend));
1433 PerlIO_printf(Perl_debug_log, "SB_RXRES = 0x%"UVxf"\n",
1434 PTR2UV(cx->sb_rxres));
1438 PERL_UNUSED_CONTEXT;
1439 PERL_UNUSED_ARG(cx);
1440 #endif /* DEBUGGING */
1444 * ex: set ts=8 sts=4 sw=4 et: