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);
59 PL_curstackinfo->si_stack_hwm = current + n + extra;
65 #ifndef STRESS_REALLOC
66 #define GROW(old) ((old) * 3 / 2)
68 #define GROW(old) ((old) + 1)
72 Perl_new_stackinfo(pTHX_ I32 stitems, I32 cxitems)
76 si->si_stack = newAV();
77 AvREAL_off(si->si_stack);
78 av_extend(si->si_stack, stitems > 0 ? stitems-1 : 0);
79 AvALLOC(si->si_stack)[0] = &PL_sv_undef;
80 AvFILLp(si->si_stack) = 0;
83 si->si_cxmax = cxitems - 1;
85 si->si_type = PERLSI_UNDEF;
86 Newx(si->si_cxstack, cxitems, PERL_CONTEXT);
87 /* Without any kind of initialising CX_PUSHSUBST()
88 * in pp_subst() will read uninitialised heap. */
89 PoisonNew(si->si_cxstack, cxitems, PERL_CONTEXT);
96 const IV old_max = cxstack_max;
97 const IV new_max = GROW(cxstack_max);
98 Renew(cxstack, new_max + 1, PERL_CONTEXT);
99 cxstack_max = new_max;
100 /* Without any kind of initialising deep enough recursion
101 * will end up reading uninitialised PERL_CONTEXTs. */
102 PoisonNew(cxstack + old_max + 1, new_max - old_max, PERL_CONTEXT);
103 return cxstack_ix + 1;
107 Perl_push_scope(pTHX)
109 if (UNLIKELY(PL_scopestack_ix == PL_scopestack_max)) {
110 const IV new_max = GROW(PL_scopestack_max);
111 Renew(PL_scopestack, new_max, I32);
113 Renew(PL_scopestack_name, new_max, const char*);
115 PL_scopestack_max = new_max;
118 PL_scopestack_name[PL_scopestack_ix] = "unknown";
120 PL_scopestack[PL_scopestack_ix++] = PL_savestack_ix;
127 const I32 oldsave = PL_scopestack[--PL_scopestack_ix];
128 LEAVE_SCOPE(oldsave);
132 Perl_markstack_grow(pTHX)
134 const I32 oldmax = PL_markstack_max - PL_markstack;
135 const I32 newmax = GROW(oldmax);
137 Renew(PL_markstack, newmax, I32);
138 PL_markstack_max = PL_markstack + newmax;
139 PL_markstack_ptr = PL_markstack + oldmax;
140 DEBUG_s(DEBUG_v(PerlIO_printf(Perl_debug_log,
141 "MARK grow %p %" IVdf " by %" IVdf "\n",
142 PL_markstack_ptr, (IV)*PL_markstack_ptr, (IV)oldmax)));
143 return PL_markstack_ptr;
147 Perl_savestack_grow(pTHX)
150 #ifdef STRESS_REALLOC
151 new_max = PL_savestack_max + SS_MAXPUSH;
153 new_max = GROW(PL_savestack_max);
155 /* Note that we allocate SS_MAXPUSH slots higher than ss_max
156 * so that SS_ADD_END(), SSGROW() etc can do a simper check */
157 Renew(PL_savestack, new_max + SS_MAXPUSH, ANY);
158 PL_savestack_max = new_max;
162 Perl_savestack_grow_cnt(pTHX_ I32 need)
164 const IV new_max = PL_savestack_ix + need;
165 /* Note that we allocate SS_MAXPUSH slots higher than ss_max
166 * so that SS_ADD_END(), SSGROW() etc can do a simper check */
167 Renew(PL_savestack, new_max + SS_MAXPUSH, ANY);
168 PL_savestack_max = new_max;
173 /* The original function was called Perl_tmps_grow and was removed from public
174 API, Perl_tmps_grow_p is the replacement and it used in public macros but
177 Perl_tmps_grow_p takes a proposed ix. A proposed ix is PL_tmps_ix + extend_by,
178 where the result of (PL_tmps_ix + extend_by) is >= PL_tmps_max
179 Upon return, PL_tmps_stack[ix] will be a valid address. For machine code
180 optimization and register usage reasons, the proposed ix passed into
181 tmps_grow is returned to the caller which the caller can then use to write
182 an SV * to PL_tmps_stack[ix]. If the caller was using tmps_grow in
183 pre-extend mode (EXTEND_MORTAL macro), then it ignores the return value of
184 tmps_grow. Note, tmps_grow DOES NOT write ix to PL_tmps_ix, the caller
185 must assign ix or ret val of tmps_grow to PL_temps_ix themselves if that is
186 appropriate. The assignment to PL_temps_ix can happen before or after
187 tmps_grow call since tmps_grow doesn't look at PL_tmps_ix.
191 Perl_tmps_grow_p(pTHX_ SSize_t ix)
193 SSize_t extend_to = ix;
194 #ifndef STRESS_REALLOC
195 if (ix - PL_tmps_max < 128)
196 extend_to += (PL_tmps_max < 512) ? 128 : 512;
198 Renew(PL_tmps_stack, extend_to + 1, SV*);
199 PL_tmps_max = extend_to + 1;
207 /* XXX should tmps_floor live in cxstack? */
208 const SSize_t myfloor = PL_tmps_floor;
209 while (PL_tmps_ix > myfloor) { /* clean up after last statement */
210 SV* const sv = PL_tmps_stack[PL_tmps_ix--];
212 PoisonWith(PL_tmps_stack + PL_tmps_ix + 1, 1, SV *, 0xAB);
216 SvREFCNT_dec_NN(sv); /* note, can modify tmps_ix!!! */
222 S_save_scalar_at(pTHX_ SV **sptr, const U32 flags)
227 PERL_ARGS_ASSERT_SAVE_SCALAR_AT;
230 if (flags & SAVEf_KEEPOLDELEM)
233 sv = (*sptr = newSV(0));
234 if (SvTYPE(osv) >= SVt_PVMG && SvMAGIC(osv))
235 mg_localize(osv, sv, cBOOL(flags & SAVEf_SETMAGIC));
242 Perl_save_pushptrptr(pTHX_ void *const ptr1, void *const ptr2, const int type)
252 Perl_save_scalar(pTHX_ GV *gv)
254 SV ** const sptr = &GvSVn(gv);
256 PERL_ARGS_ASSERT_SAVE_SCALAR;
258 if (UNLIKELY(SvGMAGICAL(*sptr))) {
263 save_pushptrptr(SvREFCNT_inc_simple(gv), SvREFCNT_inc(*sptr), SAVEt_SV);
264 return save_scalar_at(sptr, SAVEf_SETMAGIC); /* XXX - FIXME - see #60360 */
267 /* Like save_sptr(), but also SvREFCNT_dec()s the new value. Can be used to
268 * restore a global SV to its prior contents, freeing new value. */
270 Perl_save_generic_svref(pTHX_ SV **sptr)
272 PERL_ARGS_ASSERT_SAVE_GENERIC_SVREF;
274 save_pushptrptr(sptr, SvREFCNT_inc(*sptr), SAVEt_GENERIC_SVREF);
277 /* Like save_pptr(), but also Safefree()s the new value if it is different
278 * from the old one. Can be used to restore a global char* to its prior
279 * contents, freeing new value. */
281 Perl_save_generic_pvref(pTHX_ char **str)
283 PERL_ARGS_ASSERT_SAVE_GENERIC_PVREF;
285 save_pushptrptr(*str, str, SAVEt_GENERIC_PVREF);
288 /* Like save_generic_pvref(), but uses PerlMemShared_free() rather than Safefree().
289 * Can be used to restore a shared global char* to its prior
290 * contents, freeing new value. */
292 Perl_save_shared_pvref(pTHX_ char **str)
294 PERL_ARGS_ASSERT_SAVE_SHARED_PVREF;
296 save_pushptrptr(str, *str, SAVEt_SHARED_PVREF);
299 /* set the SvFLAGS specified by mask to the values in val */
302 Perl_save_set_svflags(pTHX_ SV* sv, U32 mask, U32 val)
306 PERL_ARGS_ASSERT_SAVE_SET_SVFLAGS;
311 SS_ADD_UV(SAVEt_SET_SVFLAGS);
321 Saves the current GP of gv on the save stack to be restored on scope exit.
323 If empty is true, replace the GP with a new GP.
325 If empty is false, mark gv with GVf_INTRO so the next reference
326 assigned is localized, which is how C< local *foo = $someref; > works.
332 Perl_save_gp(pTHX_ GV *gv, I32 empty)
334 PERL_ARGS_ASSERT_SAVE_GP;
336 /* XXX For now, we just upgrade any coderef in the stash to a full GV
337 during localisation. Maybe at some point we could make localis-
338 ation work without needing the upgrade. (In which case our
339 callers should probably call a different function, not save_gp.)
342 assert(isGV_or_RVCV(gv));
343 (void)CvGV(SvRV((SV *)gv)); /* CvGV does the upgrade */
347 save_pushptrptr(SvREFCNT_inc(gv), GvGP(gv), SAVEt_GP);
350 GP *gp = Perl_newGP(aTHX_ gv);
351 HV * const stash = GvSTASH(gv);
352 bool isa_changed = 0;
354 if (stash && HvENAME(stash)) {
355 if (memEQs(GvNAME(gv), GvNAMELEN(gv), "ISA"))
358 /* taking a method out of circulation ("local")*/
359 mro_method_changed_in(stash);
361 if (GvIOp(gv) && (IoFLAGS(GvIOp(gv)) & IOf_ARGV)) {
363 IoFLAGS(gp->gp_io) |= IOf_ARGV|IOf_START;
366 if (isa_changed) mro_isa_changed_in(stash);
375 Perl_save_ary(pTHX_ GV *gv)
377 AV * const oav = GvAVn(gv);
380 PERL_ARGS_ASSERT_SAVE_ARY;
382 if (UNLIKELY(!AvREAL(oav) && AvREIFY(oav)))
384 save_pushptrptr(SvREFCNT_inc_simple_NN(gv), oav, SAVEt_AV);
388 if (UNLIKELY(SvMAGIC(oav)))
389 mg_localize(MUTABLE_SV(oav), MUTABLE_SV(av), TRUE);
394 Perl_save_hash(pTHX_ GV *gv)
398 PERL_ARGS_ASSERT_SAVE_HASH;
401 SvREFCNT_inc_simple_NN(gv), (ohv = GvHVn(gv)), SAVEt_HV
406 if (UNLIKELY(SvMAGIC(ohv)))
407 mg_localize(MUTABLE_SV(ohv), MUTABLE_SV(hv), TRUE);
412 Perl_save_item(pTHX_ SV *item)
414 SV * const sv = newSVsv(item);
416 PERL_ARGS_ASSERT_SAVE_ITEM;
418 save_pushptrptr(item, /* remember the pointer */
419 sv, /* remember the value */
424 Perl_save_bool(pTHX_ bool *boolp)
428 PERL_ARGS_ASSERT_SAVE_BOOL;
431 SS_ADD_UV(SAVEt_BOOL | (*boolp << 8));
436 Perl_save_pushi32ptr(pTHX_ const I32 i, void *const ptr, const int type)
447 Perl_save_int(pTHX_ int *intp)
450 UV type = ((UV)((UV)i << SAVE_TIGHT_SHIFT) | SAVEt_INT_SMALL);
454 PERL_ARGS_ASSERT_SAVE_INT;
456 if (UNLIKELY((int)(type >> SAVE_TIGHT_SHIFT) != i)) {
467 Perl_save_I8(pTHX_ I8 *bytep)
471 PERL_ARGS_ASSERT_SAVE_I8;
474 SS_ADD_UV(SAVEt_I8 | ((UV)*bytep << 8));
479 Perl_save_I16(pTHX_ I16 *intp)
483 PERL_ARGS_ASSERT_SAVE_I16;
486 SS_ADD_UV(SAVEt_I16 | ((UV)*intp << 8));
491 Perl_save_I32(pTHX_ I32 *intp)
494 UV type = ((I32)((U32)i << SAVE_TIGHT_SHIFT) | SAVEt_I32_SMALL);
498 PERL_ARGS_ASSERT_SAVE_I32;
500 if (UNLIKELY((I32)(type >> SAVE_TIGHT_SHIFT) != i)) {
511 Perl_save_strlen(pTHX_ STRLEN *ptr)
515 PERL_ARGS_ASSERT_SAVE_STRLEN;
519 SS_ADD_UV(SAVEt_STRLEN);
524 Perl_save_iv(pTHX_ IV *ivp)
526 PERL_ARGS_ASSERT_SAVE_IV;
534 /* Cannot use save_sptr() to store a char* since the SV** cast will
535 * force word-alignment and we'll miss the pointer.
538 Perl_save_pptr(pTHX_ char **pptr)
540 PERL_ARGS_ASSERT_SAVE_PPTR;
542 save_pushptrptr(*pptr, pptr, SAVEt_PPTR);
546 Perl_save_vptr(pTHX_ void *ptr)
548 PERL_ARGS_ASSERT_SAVE_VPTR;
550 save_pushptrptr(*(char**)ptr, ptr, SAVEt_VPTR);
554 Perl_save_sptr(pTHX_ SV **sptr)
556 PERL_ARGS_ASSERT_SAVE_SPTR;
558 save_pushptrptr(*sptr, sptr, SAVEt_SPTR);
562 Perl_save_padsv_and_mortalize(pTHX_ PADOFFSET off)
566 ASSERT_CURPAD_ACTIVE("save_padsv");
567 SS_ADD_PTR(SvREFCNT_inc_simple_NN(PL_curpad[off]));
568 SS_ADD_PTR(PL_comppad);
570 SS_ADD_UV(SAVEt_PADSV_AND_MORTALIZE);
575 Perl_save_hptr(pTHX_ HV **hptr)
577 PERL_ARGS_ASSERT_SAVE_HPTR;
579 save_pushptrptr(*hptr, hptr, SAVEt_HPTR);
583 Perl_save_aptr(pTHX_ AV **aptr)
585 PERL_ARGS_ASSERT_SAVE_APTR;
587 save_pushptrptr(*aptr, aptr, SAVEt_APTR);
591 Perl_save_pushptr(pTHX_ void *const ptr, const int type)
600 Perl_save_clearsv(pTHX_ SV **svp)
602 const UV offset = svp - PL_curpad;
603 const UV offset_shifted = offset << SAVE_TIGHT_SHIFT;
605 PERL_ARGS_ASSERT_SAVE_CLEARSV;
607 ASSERT_CURPAD_ACTIVE("save_clearsv");
608 SvPADSTALE_off(*svp); /* mark lexical as active */
609 if (UNLIKELY((offset_shifted >> SAVE_TIGHT_SHIFT) != offset)) {
610 Perl_croak(aTHX_ "panic: pad offset %" UVuf " out of range (%p-%p)",
611 offset, svp, PL_curpad);
616 SS_ADD_UV(offset_shifted | SAVEt_CLEARSV);
622 Perl_save_delete(pTHX_ HV *hv, char *key, I32 klen)
624 PERL_ARGS_ASSERT_SAVE_DELETE;
626 save_pushptri32ptr(key, klen, SvREFCNT_inc_simple(hv), SAVEt_DELETE);
630 Perl_save_hdelete(pTHX_ HV *hv, SV *keysv)
636 PERL_ARGS_ASSERT_SAVE_HDELETE;
638 key = SvPV_const(keysv, len);
639 klen = SvUTF8(keysv) ? -(I32)len : (I32)len;
640 SvREFCNT_inc_simple_void_NN(hv);
641 save_pushptri32ptr(savepvn(key, len), klen, hv, SAVEt_DELETE);
645 Perl_save_adelete(pTHX_ AV *av, SSize_t key)
649 PERL_ARGS_ASSERT_SAVE_ADELETE;
651 SvREFCNT_inc_void(av);
654 SS_ADD_IV(SAVEt_ADELETE);
659 Perl_save_destructor(pTHX_ DESTRUCTORFUNC_NOCONTEXT_t f, void* p)
662 PERL_ARGS_ASSERT_SAVE_DESTRUCTOR;
666 SS_ADD_UV(SAVEt_DESTRUCTOR);
671 Perl_save_destructor_x(pTHX_ DESTRUCTORFUNC_t f, void* p)
677 SS_ADD_UV(SAVEt_DESTRUCTOR_X);
682 Perl_save_hints(pTHX)
684 COPHH *save_cophh = cophh_copy(CopHINTHASH_get(&PL_compiling));
685 if (PL_hints & HINT_LOCALIZE_HH) {
686 HV *oldhh = GvHV(PL_hintgv);
687 save_pushptri32ptr(oldhh, PL_hints, save_cophh, SAVEt_HINTS);
688 GvHV(PL_hintgv) = NULL; /* in case copying dies */
689 GvHV(PL_hintgv) = hv_copy_hints_hv(oldhh);
691 save_pushi32ptr(PL_hints, save_cophh, SAVEt_HINTS);
696 S_save_pushptri32ptr(pTHX_ void *const ptr1, const I32 i, void *const ptr2,
708 Perl_save_aelem_flags(pTHX_ AV *av, SSize_t idx, SV **sptr,
714 PERL_ARGS_ASSERT_SAVE_AELEM_FLAGS;
717 SS_ADD_PTR(SvREFCNT_inc_simple(av));
719 SS_ADD_PTR(SvREFCNT_inc(*sptr));
720 SS_ADD_UV(SAVEt_AELEM);
722 /* The array needs to hold a reference count on its new element, so it
724 if (UNLIKELY(!AvREAL(av) && AvREIFY(av)))
726 save_scalar_at(sptr, flags); /* XXX - FIXME - see #60360 */
727 if (flags & SAVEf_KEEPOLDELEM)
730 /* If we're localizing a tied array element, this new sv
731 * won't actually be stored in the array - so it won't get
732 * reaped when the localize ends. Ensure it gets reaped by
733 * mortifying it instead. DAPM */
734 if (UNLIKELY(SvTIED_mg((const SV *)av, PERL_MAGIC_tied)))
739 Perl_save_helem_flags(pTHX_ HV *hv, SV *key, SV **sptr, const U32 flags)
743 PERL_ARGS_ASSERT_SAVE_HELEM_FLAGS;
748 SS_ADD_PTR(SvREFCNT_inc_simple(hv));
749 SS_ADD_PTR(newSVsv(key));
750 SS_ADD_PTR(SvREFCNT_inc(*sptr));
751 SS_ADD_UV(SAVEt_HELEM);
754 save_scalar_at(sptr, flags);
755 if (flags & SAVEf_KEEPOLDELEM)
758 /* If we're localizing a tied hash element, this new sv
759 * won't actually be stored in the hash - so it won't get
760 * reaped when the localize ends. Ensure it gets reaped by
761 * mortifying it instead. DAPM */
762 if (UNLIKELY(SvTIED_mg((const SV *)hv, PERL_MAGIC_tied)))
767 Perl_save_svref(pTHX_ SV **sptr)
769 PERL_ARGS_ASSERT_SAVE_SVREF;
772 save_pushptrptr(sptr, SvREFCNT_inc(*sptr), SAVEt_SVREF);
773 return save_scalar_at(sptr, SAVEf_SETMAGIC); /* XXX - FIXME - see #60360 */
781 SS_ADD_IV(PL_tmps_floor);
782 PL_tmps_floor = PL_tmps_ix;
783 SS_ADD_UV(SAVEt_TMPSFLOOR);
789 Perl_save_alloc(pTHX_ I32 size, I32 pad)
791 const I32 start = pad + ((char*)&PL_savestack[PL_savestack_ix]
792 - (char*)PL_savestack);
793 const UV elems = 1 + ((size + pad - 1) / sizeof(*PL_savestack));
794 const UV elems_shifted = elems << SAVE_TIGHT_SHIFT;
796 if (UNLIKELY((elems_shifted >> SAVE_TIGHT_SHIFT) != elems))
798 "panic: save_alloc elems %" UVuf " out of range (%" IVdf "-%" IVdf ")",
799 elems, (IV)size, (IV)pad);
803 PL_savestack_ix += elems;
804 SSPUSHUV(SAVEt_ALLOC | elems_shifted);
809 static const U8 arg_counts[] = {
811 0, /* SAVEt_CLEARPADRANGE */
812 0, /* SAVEt_CLEARSV */
813 0, /* SAVEt_REGCONTEXT */
814 1, /* SAVEt_TMPSFLOOR */
816 1, /* SAVEt_COMPILE_WARNINGS */
817 1, /* SAVEt_COMPPAD */
818 1, /* SAVEt_FREECOPHH */
819 1, /* SAVEt_FREEOP */
820 1, /* SAVEt_FREEPV */
821 1, /* SAVEt_FREESV */
823 1, /* SAVEt_I32_SMALL */
825 1, /* SAVEt_INT_SMALL */
826 1, /* SAVEt_MORTALIZESV */
829 1, /* SAVEt_PARSER */
830 1, /* SAVEt_STACK_POS */
831 1, /* SAVEt_READONLY_OFF */
832 1, /* SAVEt_FREEPADNAME */
834 2, /* SAVEt_DESTRUCTOR */
835 2, /* SAVEt_DESTRUCTOR_X */
836 2, /* SAVEt_GENERIC_PVREF */
837 2, /* SAVEt_GENERIC_SVREF */
849 2, /* SAVEt_SAVESWITCHSTACK */
850 2, /* SAVEt_SHARED_PVREF */
852 2, /* SAVEt_STRLEN */
856 2, /* SAVEt_ADELETE */
859 3, /* SAVEt_PADSV_AND_MORTALIZE*/
860 3, /* SAVEt_SET_SVFLAGS */
861 3, /* SAVEt_GVSLOT */
868 Perl_leave_scope(pTHX_ I32 base)
870 /* Localise the effects of the TAINT_NOT inside the loop. */
871 bool was = TAINT_get;
873 if (UNLIKELY(base < -1))
874 Perl_croak(aTHX_ "panic: corrupt saved stack index %ld", (long) base);
875 DEBUG_l(Perl_deb(aTHX_ "savestack: releasing items %ld -> %ld\n",
876 (long)PL_savestack_ix, (long)base));
877 while (PL_savestack_ix > base) {
880 ANY *ap; /* arg pointer */
881 ANY a0, a1, a2; /* up to 3 args */
887 I32 ix = PL_savestack_ix - 1;
889 ap = &PL_savestack[ix];
891 type = (U8)uv & SAVE_MASK;
892 argcount = arg_counts[type];
893 PL_savestack_ix = ix - argcount;
898 case SAVEt_ITEM: /* normal string */
899 a0 = ap[0]; a1 = ap[1];
900 sv_replace(a0.any_sv, a1.any_sv);
901 if (UNLIKELY(SvSMAGICAL(a0.any_sv))) {
908 /* This would be a mathom, but Perl_save_svref() calls a static
909 function, S_save_scalar_at(), so has to stay in this file. */
910 case SAVEt_SVREF: /* scalar reference */
911 a0 = ap[0]; a1 = ap[1];
912 a2.any_svp = a0.any_svp;
913 a0.any_sv = NULL; /* what to refcnt_dec */
916 case SAVEt_SV: /* scalar reference */
917 a0 = ap[0]; a1 = ap[1];
918 a2.any_svp = &GvSV(a0.any_gv);
921 /* do *a2.any_svp = a1 and free a0 */
922 SV * const sv = *a2.any_svp;
923 *a2.any_svp = a1.any_sv;
925 if (UNLIKELY(SvSMAGICAL(a1.any_sv))) {
926 /* mg_set could die, skipping the freeing of a0 and
927 * a1; Ensure that they're always freed in that case */
929 SS_ADD_PTR(a1.any_sv);
930 SS_ADD_UV(SAVEt_FREESV);
931 SS_ADD_PTR(a0.any_sv);
932 SS_ADD_UV(SAVEt_FREESV);
939 SvREFCNT_dec_NN(a1.any_sv);
940 SvREFCNT_dec(a0.any_sv);
944 case SAVEt_GENERIC_PVREF: /* generic pv */
945 a0 = ap[0]; a1 = ap[1];
946 if (*a1.any_pvp != a0.any_pv) {
947 Safefree(*a1.any_pvp);
948 *a1.any_pvp = a0.any_pv;
952 case SAVEt_SHARED_PVREF: /* shared pv */
953 a0 = ap[0]; a1 = ap[1];
954 if (*a0.any_pvp != a1.any_pv) {
956 PerlMem_free(*a0.any_pvp);
958 PerlMemShared_free(*a0.any_pvp);
960 *a0.any_pvp = a1.any_pv;
964 case SAVEt_GVSV: /* scalar slot in GV */
965 a0 = ap[0]; a1 = ap[1];
966 a0.any_svp = &GvSV(a0.any_gv);
969 case SAVEt_GENERIC_SVREF: /* generic sv */
970 a0 = ap[0]; a1 = ap[1];
973 /* do *a0.any_svp = a1 */
974 SV * const sv = *a0.any_svp;
975 *a0.any_svp = a1.any_sv;
977 SvREFCNT_dec(a1.any_sv);
981 case SAVEt_GVSLOT: /* any slot in GV */
984 a0 = ap[0]; a1 = ap[1]; a2 = ap[2];
985 hv = GvSTASH(a0.any_gv);
986 if (hv && HvENAME(hv) && (
987 (a2.any_sv && SvTYPE(a2.any_sv) == SVt_PVCV)
988 || (*a1.any_svp && SvTYPE(*a1.any_svp) == SVt_PVCV)
991 if ((char *)a1.any_svp < (char *)GvGP(a0.any_gv)
992 || (char *)a1.any_svp > (char *)GvGP(a0.any_gv) + sizeof(struct gp)
993 || GvREFCNT(a0.any_gv) > 2) /* "> 2" to ignore savestack's ref */
995 else mro_method_changed_in(hv);
997 a0.any_svp = a1.any_svp;
998 a1.any_sv = a2.any_sv;
1002 case SAVEt_AV: /* array reference */
1003 a0 = ap[0]; a1 = ap[1];
1004 SvREFCNT_dec(GvAV(a0.any_gv));
1005 GvAV(a0.any_gv) = a1.any_av;
1007 if (UNLIKELY(SvSMAGICAL(a1.any_sv))) {
1008 /* mg_set might die, so make sure a0 isn't leaked */
1010 SS_ADD_PTR(a0.any_sv);
1011 SS_ADD_UV(SAVEt_FREESV);
1018 SvREFCNT_dec_NN(a0.any_sv);
1021 case SAVEt_HV: /* hash reference */
1022 a0 = ap[0]; a1 = ap[1];
1023 SvREFCNT_dec(GvHV(a0.any_gv));
1024 GvHV(a0.any_gv) = a1.any_hv;
1027 case SAVEt_INT_SMALL:
1029 *(int*)a0.any_ptr = (int)(uv >> SAVE_TIGHT_SHIFT);
1032 case SAVEt_INT: /* int reference */
1033 a0 = ap[0]; a1 = ap[1];
1034 *(int*)a1.any_ptr = (int)a0.any_i32;
1037 case SAVEt_STRLEN: /* STRLEN/size_t ref */
1038 a0 = ap[0]; a1 = ap[1];
1039 *(STRLEN*)a1.any_ptr = (STRLEN)a0.any_iv;
1042 case SAVEt_TMPSFLOOR: /* restore PL_tmps_floor */
1044 PL_tmps_floor = (SSize_t)a0.any_iv;
1047 case SAVEt_BOOL: /* bool reference */
1049 *(bool*)a0.any_ptr = cBOOL(uv >> 8);
1050 #ifdef NO_TAINT_SUPPORT
1051 PERL_UNUSED_VAR(was);
1053 if (UNLIKELY(a0.any_ptr == &(TAINT_get))) {
1054 /* If we don't update <was>, to reflect what was saved on the
1055 * stack for PL_tainted, then we will overwrite this attempt to
1056 * restore it when we exit this routine. Note that this won't
1057 * work if this value was saved in a wider-than necessary type,
1059 was = *(bool*)a0.any_ptr;
1064 case SAVEt_I32_SMALL:
1066 *(I32*)a0.any_ptr = (I32)(uv >> SAVE_TIGHT_SHIFT);
1069 case SAVEt_I32: /* I32 reference */
1070 a0 = ap[0]; a1 = ap[1];
1071 #ifdef PERL_DEBUG_READONLY_OPS
1072 if (*(I32*)a1.any_ptr != a0.any_i32)
1074 *(I32*)a1.any_ptr = a0.any_i32;
1077 case SAVEt_SPTR: /* SV* reference */
1078 case SAVEt_VPTR: /* random* reference */
1079 case SAVEt_PPTR: /* char* reference */
1080 case SAVEt_HPTR: /* HV* reference */
1081 case SAVEt_APTR: /* AV* reference */
1082 a0 = ap[0]; a1 = ap[1];
1083 *a1.any_svp= a0.any_sv;
1086 case SAVEt_GP: /* scalar reference */
1091 a0 = ap[0]; a1 = ap[1];
1092 /* possibly taking a method out of circulation */
1093 had_method = !!GvCVu(a0.any_gv);
1095 GvGP_set(a0.any_gv, (GP*)a1.any_ptr);
1096 if ((hv=GvSTASH(a0.any_gv)) && HvENAME_get(hv)) {
1097 if (memEQs(GvNAME(a0.any_gv), GvNAMELEN(a0.any_gv), "ISA"))
1098 mro_isa_changed_in(hv);
1099 else if (had_method || GvCVu(a0.any_gv))
1100 /* putting a method back into circulation ("local")*/
1101 gv_method_changed(a0.any_gv);
1103 SvREFCNT_dec_NN(a0.any_gv);
1109 SvREFCNT_dec(a0.any_sv);
1112 case SAVEt_FREEPADNAME:
1114 PadnameREFCNT_dec((PADNAME *)a0.any_ptr);
1117 case SAVEt_FREECOPHH:
1119 cophh_free((COPHH *)a0.any_ptr);
1122 case SAVEt_MORTALIZESV:
1124 sv_2mortal(a0.any_sv);
1129 ASSERT_CURPAD_LEGAL("SAVEt_FREEOP");
1135 Safefree(a0.any_ptr);
1138 case SAVEt_CLEARPADRANGE:
1142 i = (I32)((uv >> SAVE_TIGHT_SHIFT) & OPpPADRANGE_COUNTMASK);
1143 svp = &PL_curpad[uv >>
1144 (OPpPADRANGE_COUNTSHIFT + SAVE_TIGHT_SHIFT)] + i - 1;
1147 svp = &PL_curpad[uv >> SAVE_TIGHT_SHIFT];
1150 for (; i; i--, svp--) {
1153 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1154 "Pad 0x%" UVxf "[0x%" UVxf "] clearsv: %ld sv=0x%" UVxf "<%" IVdf "> %s\n",
1155 PTR2UV(PL_comppad), PTR2UV(PL_curpad),
1156 (long)(svp-PL_curpad), PTR2UV(sv), (IV)SvREFCNT(sv),
1157 (SvREFCNT(sv) <= 1 && !SvOBJECT(sv)) ? "clear" : "abandon"
1160 /* Can clear pad variable in place? */
1161 if (SvREFCNT(sv) == 1 && !SvOBJECT(sv)) {
1163 /* these flags are the union of all the relevant flags
1164 * in the individual conditions within */
1165 if (UNLIKELY(SvFLAGS(sv) & (
1166 SVf_READONLY|SVf_PROTECT /*for SvREADONLY_off*/
1167 | (SVs_GMG|SVs_SMG|SVs_RMG) /* SvMAGICAL() */
1171 /* if a my variable that was made readonly is
1172 * going out of scope, we want to remove the
1173 * readonlyness so that it can go out of scope
1179 if (SvOOK(sv)) { /* OOK or HvAUX */
1180 if (SvTYPE(sv) == SVt_PVHV)
1181 Perl_hv_kill_backrefs(aTHX_ MUTABLE_HV(sv));
1186 if (SvMAGICAL(sv)) {
1187 /* note that backrefs (either in HvAUX or magic)
1188 * must be removed before other magic */
1189 sv_unmagic(sv, PERL_MAGIC_backref);
1190 if (SvTYPE(sv) != SVt_PVCV)
1193 if (SvTHINKFIRST(sv))
1194 sv_force_normal_flags(sv, SV_IMMEDIATE_UNREF
1198 switch (SvTYPE(sv)) {
1202 av_clear(MUTABLE_AV(sv));
1205 hv_clear(MUTABLE_HV(sv));
1209 HEK *hek = CvGvNAME_HEK(sv);
1211 (void)share_hek_hek(hek);
1213 CvNAME_HEK_set(sv, hek);
1218 /* This looks odd, but these two macros are for use in
1219 expressions and finish with a trailing comma, so
1220 adding a ; after them would be wrong. */
1223 SvFLAGS(sv) &=~ (SVf_OK|SVf_IVisUV|SVf_UTF8);
1227 SvPADSTALE_on(sv); /* mark as no longer live */
1229 else { /* Someone has a claim on this, so abandon it. */
1230 switch (SvTYPE(sv)) { /* Console ourselves with a new value */
1231 case SVt_PVAV: *svp = MUTABLE_SV(newAV()); break;
1232 case SVt_PVHV: *svp = MUTABLE_SV(newHV()); break;
1235 HEK * const hek = CvGvNAME_HEK(sv);
1238 *svp = newSV_type(SVt_PVCV);
1241 CvNAME_HEK_set(*svp,
1242 share_hek_hek(hek));
1246 default: *svp = newSV(0); break;
1248 SvREFCNT_dec_NN(sv); /* Cast current value to the winds. */
1249 /* preserve pad nature, but also mark as not live
1250 * for any closure capturing */
1251 SvFLAGS(*svp) |= SVs_PADSTALE;
1258 a0 = ap[0]; a1 = ap[1]; a2 = ap[2];
1259 /* hv_delete could die, so free the key and SvREFCNT_dec the
1260 * hv by pushing new save actions
1262 /* ap[0] is the key */
1263 ap[1].any_uv = SAVEt_FREEPV; /* was len */
1264 /* ap[2] is the hv */
1265 ap[3].any_uv = SAVEt_FREESV; /* was SAVEt_DELETE */
1266 PL_savestack_ix += 4;
1267 (void)hv_delete(a2.any_hv, a0.any_pv, a1.any_i32, G_DISCARD);
1271 a0 = ap[0]; a1 = ap[1];
1272 /* av_delete could die, so SvREFCNT_dec the av by pushing a
1275 ap[0].any_av = a1.any_av;
1276 ap[1].any_uv = SAVEt_FREESV;
1277 PL_savestack_ix += 2;
1278 (void)av_delete(a1.any_av, a0.any_iv, G_DISCARD);
1281 case SAVEt_DESTRUCTOR_X:
1282 a0 = ap[0]; a1 = ap[1];
1283 (*a0.any_dxptr)(aTHX_ a1.any_ptr);
1286 case SAVEt_REGCONTEXT:
1287 /* regexp must have croaked */
1289 PL_savestack_ix -= uv >> SAVE_TIGHT_SHIFT;
1292 case SAVEt_STACK_POS: /* Position on Perl stack */
1294 PL_stack_sp = PL_stack_base + a0.any_i32;
1297 case SAVEt_AELEM: /* array element */
1300 a0 = ap[0]; a1 = ap[1]; a2 = ap[2];
1301 svp = av_fetch(a0.any_av, a1.any_iv, 1);
1302 if (UNLIKELY(!AvREAL(a0.any_av) && AvREIFY(a0.any_av))) /* undo reify guard */
1303 SvREFCNT_dec(a2.any_sv);
1305 SV * const sv = *svp;
1306 if (LIKELY(sv && sv != &PL_sv_undef)) {
1307 if (UNLIKELY(SvTIED_mg((const SV *)a0.any_av, PERL_MAGIC_tied)))
1308 SvREFCNT_inc_void_NN(sv);
1309 a1.any_sv = a2.any_sv;
1314 SvREFCNT_dec(a0.any_av);
1315 SvREFCNT_dec(a2.any_sv);
1319 case SAVEt_HELEM: /* hash element */
1323 a0 = ap[0]; a1 = ap[1]; a2 = ap[2];
1324 he = hv_fetch_ent(a0.any_hv, a1.any_sv, 1, 0);
1325 SvREFCNT_dec(a1.any_sv);
1327 const SV * const oval = HeVAL(he);
1328 if (LIKELY(oval && oval != &PL_sv_undef)) {
1329 SV **svp = &HeVAL(he);
1330 if (UNLIKELY(SvTIED_mg((const SV *)a0.any_hv, PERL_MAGIC_tied)))
1331 SvREFCNT_inc_void(*svp);
1332 a1.any_sv = a2.any_sv;
1337 SvREFCNT_dec(a0.any_hv);
1338 SvREFCNT_dec(a2.any_sv);
1344 PL_op = (OP*)a0.any_ptr;
1348 a0 = ap[0]; a1 = ap[1];
1349 if ((PL_hints & HINT_LOCALIZE_HH)) {
1350 while (GvHV(PL_hintgv)) {
1351 HV *hv = GvHV(PL_hintgv);
1352 GvHV(PL_hintgv) = NULL;
1353 SvREFCNT_dec(MUTABLE_SV(hv));
1356 cophh_free(CopHINTHASH_get(&PL_compiling));
1357 CopHINTHASH_set(&PL_compiling, (COPHH*)a1.any_ptr);
1358 *(I32*)&PL_hints = a0.any_i32;
1359 if (PL_hints & HINT_LOCALIZE_HH) {
1360 SvREFCNT_dec(MUTABLE_SV(GvHV(PL_hintgv)));
1361 GvHV(PL_hintgv) = MUTABLE_HV(SSPOPPTR);
1363 if (!GvHV(PL_hintgv)) {
1364 /* Need to add a new one manually, else rv2hv can
1365 add one via GvHVn and it won't have the magic set. */
1366 HV *const hv = newHV();
1367 hv_magic(hv, NULL, PERL_MAGIC_hints);
1368 GvHV(PL_hintgv) = hv;
1370 assert(GvHV(PL_hintgv));
1375 PL_comppad = (PAD*)a0.any_ptr;
1376 if (LIKELY(PL_comppad))
1377 PL_curpad = AvARRAY(PL_comppad);
1382 case SAVEt_PADSV_AND_MORTALIZE:
1386 a0 = ap[0]; a1 = ap[1]; a2 = ap[2];
1387 assert (a1.any_ptr);
1388 svp = AvARRAY((PAD*)a1.any_ptr) + (PADOFFSET)a2.any_uv;
1389 /* This mortalizing used to be done by CX_POOPLOOP() via
1390 itersave. But as we have all the information here, we
1391 can do it here, save even having to have itersave in
1399 case SAVEt_SAVESWITCHSTACK:
1403 a0 = ap[0]; a1 = ap[1];
1404 SWITCHSTACK(a1.any_av, a0.any_av);
1405 PL_curstackinfo->si_stack = a0.any_av;
1409 case SAVEt_SET_SVFLAGS:
1410 a0 = ap[0]; a1 = ap[1]; a2 = ap[2];
1411 SvFLAGS(a0.any_sv) &= ~(a1.any_u32);
1412 SvFLAGS(a0.any_sv) |= a2.any_u32;
1415 /* These are only saved in mathoms.c */
1418 (void)sv_clear(a0.any_sv);
1421 case SAVEt_LONG: /* long reference */
1422 a0 = ap[0]; a1 = ap[1];
1423 *(long*)a1.any_ptr = a0.any_long;
1426 case SAVEt_IV: /* IV reference */
1427 a0 = ap[0]; a1 = ap[1];
1428 *(IV*)a1.any_ptr = a0.any_iv;
1431 case SAVEt_I16: /* I16 reference */
1433 *(I16*)a0.any_ptr = (I16)(uv >> 8);
1436 case SAVEt_I8: /* I8 reference */
1438 *(I8*)a0.any_ptr = (I8)(uv >> 8);
1441 case SAVEt_DESTRUCTOR:
1442 a0 = ap[0]; a1 = ap[1];
1443 (*a0.any_dptr)(a1.any_ptr);
1446 case SAVEt_COMPILE_WARNINGS:
1448 if (!specialWARN(PL_compiling.cop_warnings))
1449 PerlMemShared_free(PL_compiling.cop_warnings);
1450 PL_compiling.cop_warnings = (STRLEN*)a0.any_ptr;
1455 parser_free((yy_parser *)a0.any_ptr);
1458 case SAVEt_READONLY_OFF:
1460 SvREADONLY_off(a0.any_sv);
1464 Perl_croak(aTHX_ "panic: leave_scope inconsistency %u",
1465 (U8)uv & SAVE_MASK);
1473 Perl_cx_dump(pTHX_ PERL_CONTEXT *cx)
1475 PERL_ARGS_ASSERT_CX_DUMP;
1478 PerlIO_printf(Perl_debug_log, "CX %ld = %s\n", (long)(cx - cxstack), PL_block_type[CxTYPE(cx)]);
1479 if (CxTYPE(cx) != CXt_SUBST) {
1480 const char *gimme_text;
1481 PerlIO_printf(Perl_debug_log, "BLK_OLDSP = %ld\n", (long)cx->blk_oldsp);
1482 PerlIO_printf(Perl_debug_log, "BLK_OLDCOP = 0x%" UVxf "\n",
1483 PTR2UV(cx->blk_oldcop));
1484 PerlIO_printf(Perl_debug_log, "BLK_OLDMARKSP = %ld\n", (long)cx->blk_oldmarksp);
1485 PerlIO_printf(Perl_debug_log, "BLK_OLDSCOPESP = %ld\n", (long)cx->blk_oldscopesp);
1486 PerlIO_printf(Perl_debug_log, "BLK_OLDSAVEIX = %ld\n", (long)cx->blk_oldsaveix);
1487 PerlIO_printf(Perl_debug_log, "BLK_OLDPM = 0x%" UVxf "\n",
1488 PTR2UV(cx->blk_oldpm));
1489 switch (cx->blk_gimme) {
1491 gimme_text = "VOID";
1494 gimme_text = "SCALAR";
1497 gimme_text = "LIST";
1500 gimme_text = "UNKNOWN";
1503 PerlIO_printf(Perl_debug_log, "BLK_GIMME = %s\n", gimme_text);
1505 switch (CxTYPE(cx)) {
1510 PerlIO_printf(Perl_debug_log, "BLK_FORMAT.CV = 0x%" UVxf "\n",
1511 PTR2UV(cx->blk_format.cv));
1512 PerlIO_printf(Perl_debug_log, "BLK_FORMAT.GV = 0x%" UVxf "\n",
1513 PTR2UV(cx->blk_format.gv));
1514 PerlIO_printf(Perl_debug_log, "BLK_FORMAT.DFOUTGV = 0x%" UVxf "\n",
1515 PTR2UV(cx->blk_format.dfoutgv));
1516 PerlIO_printf(Perl_debug_log, "BLK_FORMAT.HASARGS = %d\n",
1517 (int)CxHASARGS(cx));
1518 PerlIO_printf(Perl_debug_log, "BLK_FORMAT.RETOP = 0x%" UVxf "\n",
1519 PTR2UV(cx->blk_format.retop));
1522 PerlIO_printf(Perl_debug_log, "BLK_SUB.CV = 0x%" UVxf "\n",
1523 PTR2UV(cx->blk_sub.cv));
1524 PerlIO_printf(Perl_debug_log, "BLK_SUB.OLDDEPTH = %ld\n",
1525 (long)cx->blk_sub.olddepth);
1526 PerlIO_printf(Perl_debug_log, "BLK_SUB.HASARGS = %d\n",
1527 (int)CxHASARGS(cx));
1528 PerlIO_printf(Perl_debug_log, "BLK_SUB.LVAL = %d\n", (int)CxLVAL(cx));
1529 PerlIO_printf(Perl_debug_log, "BLK_SUB.RETOP = 0x%" UVxf "\n",
1530 PTR2UV(cx->blk_sub.retop));
1533 PerlIO_printf(Perl_debug_log, "BLK_EVAL.OLD_IN_EVAL = %ld\n",
1534 (long)CxOLD_IN_EVAL(cx));
1535 PerlIO_printf(Perl_debug_log, "BLK_EVAL.OLD_OP_TYPE = %s (%s)\n",
1536 PL_op_name[CxOLD_OP_TYPE(cx)],
1537 PL_op_desc[CxOLD_OP_TYPE(cx)]);
1538 if (cx->blk_eval.old_namesv)
1539 PerlIO_printf(Perl_debug_log, "BLK_EVAL.OLD_NAME = %s\n",
1540 SvPVX_const(cx->blk_eval.old_namesv));
1541 PerlIO_printf(Perl_debug_log, "BLK_EVAL.OLD_EVAL_ROOT = 0x%" UVxf "\n",
1542 PTR2UV(cx->blk_eval.old_eval_root));
1543 PerlIO_printf(Perl_debug_log, "BLK_EVAL.RETOP = 0x%" UVxf "\n",
1544 PTR2UV(cx->blk_eval.retop));
1547 case CXt_LOOP_PLAIN:
1548 case CXt_LOOP_LAZYIV:
1549 case CXt_LOOP_LAZYSV:
1552 PerlIO_printf(Perl_debug_log, "BLK_LOOP.LABEL = %s\n", CxLABEL(cx));
1553 PerlIO_printf(Perl_debug_log, "BLK_LOOP.MY_OP = 0x%" UVxf "\n",
1554 PTR2UV(cx->blk_loop.my_op));
1555 if (CxTYPE(cx) != CXt_LOOP_PLAIN) {
1556 PerlIO_printf(Perl_debug_log, "BLK_LOOP.ITERVAR = 0x%" UVxf "\n",
1557 PTR2UV(CxITERVAR(cx)));
1558 PerlIO_printf(Perl_debug_log, "BLK_LOOP.ITERSAVE = 0x%" UVxf "\n",
1559 PTR2UV(cx->blk_loop.itersave));
1561 if (CxTYPE(cx) == CXt_LOOP_ARY) {
1562 PerlIO_printf(Perl_debug_log, "BLK_LOOP.ITERARY = 0x%" UVxf "\n",
1563 PTR2UV(cx->blk_loop.state_u.ary.ary));
1564 PerlIO_printf(Perl_debug_log, "BLK_LOOP.ITERIX = %ld\n",
1565 (long)cx->blk_loop.state_u.ary.ix);
1570 PerlIO_printf(Perl_debug_log, "SB_ITERS = %ld\n",
1571 (long)cx->sb_iters);
1572 PerlIO_printf(Perl_debug_log, "SB_MAXITERS = %ld\n",
1573 (long)cx->sb_maxiters);
1574 PerlIO_printf(Perl_debug_log, "SB_RFLAGS = %ld\n",
1575 (long)cx->sb_rflags);
1576 PerlIO_printf(Perl_debug_log, "SB_ONCE = %ld\n",
1578 PerlIO_printf(Perl_debug_log, "SB_ORIG = %s\n",
1580 PerlIO_printf(Perl_debug_log, "SB_DSTR = 0x%" UVxf "\n",
1581 PTR2UV(cx->sb_dstr));
1582 PerlIO_printf(Perl_debug_log, "SB_TARG = 0x%" UVxf "\n",
1583 PTR2UV(cx->sb_targ));
1584 PerlIO_printf(Perl_debug_log, "SB_S = 0x%" UVxf "\n",
1586 PerlIO_printf(Perl_debug_log, "SB_M = 0x%" UVxf "\n",
1588 PerlIO_printf(Perl_debug_log, "SB_STREND = 0x%" UVxf "\n",
1589 PTR2UV(cx->sb_strend));
1590 PerlIO_printf(Perl_debug_log, "SB_RXRES = 0x%" UVxf "\n",
1591 PTR2UV(cx->sb_rxres));
1595 PERL_UNUSED_CONTEXT;
1596 PERL_UNUSED_ARG(cx);
1597 #endif /* DEBUGGING */
1601 * ex: set ts=8 sts=4 sw=4 et: