1 /* This file is part of the Scope::Upper Perl module.
2 * See http://search.cpan.org/dist/Scope-Upper/ */
4 #define PERL_NO_GET_CONTEXT
9 #define __PACKAGE__ "Scope::Upper"
15 /* --- Compatibility ------------------------------------------------------- */
30 # define MUTABLE_SV(S) ((SV *) (S))
34 # define MUTABLE_AV(A) ((AV *) (A))
38 # define MUTABLE_CV(C) ((CV *) (C))
41 #ifndef PERL_UNUSED_VAR
42 # define PERL_UNUSED_VAR(V)
46 # define STMT_START do
50 # define STMT_END while (0)
54 # define SU_D(X) STMT_START X STMT_END
60 # define Newx(v, n, c) New(0, v, n, c)
65 # define SU_POISON(D, N, T) PoisonNew((D), (N), T)
66 # elif defined(Poison)
67 # define SU_POISON(D, N, T) Poison((D), (N), T)
71 # define SU_POISON(D, N, T) NOOP
75 STATIC SV *su_newSV_type(pTHX_ svtype t) {
80 # define newSV_type(T) su_newSV_type(aTHX_ (T))
84 # define SvPV_const(S, L) SvPV(S, L)
88 # define SvPVX_const(S) SvPVX(S)
91 #ifndef SvPV_nolen_const
92 # define SvPV_nolen_const(S) SvPV_nolen(S)
95 #ifndef SvREFCNT_inc_simple_void
96 # define SvREFCNT_inc_simple_void(sv) ((void) SvREFCNT_inc(sv))
100 # define mPUSHi(I) PUSHs(sv_2mortal(newSViv(I)))
104 # define GvCV_set(G, C) (GvCV(G) = (C))
108 # define CvGV_set(C, G) (CvGV(C) = (G))
112 # define CvSTASH_set(C, S) (CvSTASH(C) = (S))
116 # define CvISXSUB(C) CvXSUB(C)
120 # define CxHASARGS(C) ((C)->blk_sub.hasargs)
124 # define HvNAME_get(H) HvNAME(H)
127 #ifndef gv_fetchpvn_flags
128 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
131 #ifndef PERL_MAGIC_tied
132 # define PERL_MAGIC_tied 'P'
135 #ifndef PERL_MAGIC_env
136 # define PERL_MAGIC_env 'E'
139 #ifndef NEGATIVE_INDICES_VAR
140 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
143 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
144 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
146 /* --- Threads and multiplicity -------------------------------------------- */
148 #ifndef SU_MULTIPLICITY
149 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
150 # define SU_MULTIPLICITY 1
152 # define SU_MULTIPLICITY 0
155 #if SU_MULTIPLICITY && !defined(tTHX)
156 # define tTHX PerlInterpreter*
159 #if SU_MULTIPLICITY && defined(USE_ITHREADS) && defined(dMY_CXT) && defined(MY_CXT) && defined(START_MY_CXT) && defined(MY_CXT_INIT) && (defined(MY_CXT_CLONE) || defined(dMY_CXT_SV))
160 # define SU_THREADSAFE 1
161 # ifndef MY_CXT_CLONE
162 # define MY_CXT_CLONE \
164 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
165 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
166 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
169 # define SU_THREADSAFE 0
171 # define dMY_CXT dNOOP
173 # define MY_CXT su_globaldata
175 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
177 # define MY_CXT_INIT NOOP
179 # define MY_CXT_CLONE NOOP
182 /* --- unwind() global storage --------------------------------------------- */
192 /* --- uplevel() data tokens and global storage ---------------------------- */
208 PERL_SI *old_curstackinfo;
221 STATIC su_uplevel_ud *su_uplevel_ud_new(pTHX) {
222 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
226 Newx(sud, 1, su_uplevel_ud);
229 Newx(si, 1, PERL_SI);
230 si->si_stack = newAV();
231 AvREAL_off(si->si_stack);
232 si->si_cxstack = NULL;
240 STATIC void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
241 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
242 PERL_SI *si = sud->si;
244 Safefree(si->si_cxstack);
245 SvREFCNT_dec(si->si_stack);
255 } su_uplevel_storage;
257 #ifndef SU_UPLEVEL_STORAGE_SIZE
258 # define SU_UPLEVEL_STORAGE_SIZE 4
261 /* --- Global data --------------------------------------------------------- */
263 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
266 char *stack_placeholder;
267 su_unwind_storage unwind_storage;
268 su_uplevel_storage uplevel_storage;
273 /* --- Stack manipulations ------------------------------------------------- */
275 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
277 #define SU_SAVE_DESTRUCTOR_SIZE 3
278 #define SU_SAVE_PLACEHOLDER_SIZE 3
280 #define SU_SAVE_SCALAR_SIZE 3
282 #define SU_SAVE_ARY_SIZE 3
283 #define SU_SAVE_AELEM_SIZE 4
285 # define SU_SAVE_ADELETE_SIZE 3
287 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
289 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
290 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
292 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
295 #define SU_SAVE_HASH_SIZE 3
296 #define SU_SAVE_HELEM_SIZE 4
297 #define SU_SAVE_HDELETE_SIZE 4
298 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
299 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
301 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
304 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
306 #if !SU_HAS_PERL(5, 8, 9)
307 # define SU_SAVE_GP_SIZE 6
308 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
309 # define SU_SAVE_GP_SIZE 3
310 #elif !SU_HAS_PERL(5, 13, 8)
311 # define SU_SAVE_GP_SIZE 4
313 # define SU_SAVE_GP_SIZE 3
316 #ifndef SvCANEXISTDELETE
317 # define SvCANEXISTDELETE(sv) \
319 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
320 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
321 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
322 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
327 /* ... Saving array elements ............................................... */
329 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
330 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
336 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
337 #if SU_HAS_PERL(5, 8, 1)
338 if (SvRMAGICAL(av)) {
339 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
341 SV * const * const negative_indices_glob =
342 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
343 NEGATIVE_INDICES_VAR, 16, 0);
344 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
350 idx = key + av_len(av) + 1;
364 STATIC void su_adelete(pTHX_ void *ud_) {
365 su_ud_adelete *ud = (su_ud_adelete *) ud_;
367 av_delete(ud->av, ud->idx, G_DISCARD);
368 SvREFCNT_dec(ud->av);
373 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
374 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
377 Newx(ud, 1, su_ud_adelete);
380 SvREFCNT_inc_simple_void(av);
382 SAVEDESTRUCTOR_X(su_adelete, ud);
385 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
387 #endif /* SAVEADELETE */
389 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
390 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
397 idx = su_av_key2idx(av, SvIV(key));
399 if (SvCANEXISTDELETE(av))
400 preeminent = av_exists(av, idx);
402 svp = av_fetch(av, idx, 1);
403 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
406 save_aelem(av, idx, svp);
408 SAVEADELETE(av, idx);
410 if (val) { /* local $x[$idx] = $val; */
411 SvSetMagicSV(*svp, val);
412 } else { /* local $x[$idx]; delete $x[$idx]; */
413 av_delete(av, idx, G_DISCARD);
417 /* ... Saving hash elements ................................................ */
419 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
420 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
427 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
428 preeminent = hv_exists_ent(hv, keysv, 0);
430 he = hv_fetch_ent(hv, keysv, 1, 0);
431 svp = he ? &HeVAL(he) : NULL;
432 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
434 if (HvNAME_get(hv) && isGV(*svp)) {
435 save_gp((GV *) *svp, 0);
440 save_helem(hv, keysv, svp);
443 const char * const key = SvPV_const(keysv, keylen);
444 SAVEDELETE(hv, savepvn(key, keylen),
445 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
448 if (val) { /* local $x{$keysv} = $val; */
449 SvSetMagicSV(*svp, val);
450 } else { /* local $x{$keysv}; delete $x{$keysv}; */
451 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
455 /* ... Saving code slots from a glob ....................................... */
457 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
458 # define mro_method_changed_in(G) PL_sub_generation++
466 STATIC void su_restore_gvcv(pTHX_ void *ud_) {
467 su_save_gvcv_ud *ud = ud_;
470 GvCV_set(gv, ud->old_cv);
472 mro_method_changed_in(GvSTASH(gv));
477 STATIC void su_save_gvcv(pTHX_ GV *gv) {
478 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
481 Newx(ud, 1, su_save_gvcv_ud);
483 ud->old_cv = GvCV(gv);
487 mro_method_changed_in(GvSTASH(gv));
489 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
492 /* --- Actions ------------------------------------------------------------- */
498 void (*handler)(pTHX_ void *);
501 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
502 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
503 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
504 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
506 #define SU_UD_FREE(U) STMT_START { \
507 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
511 /* ... Reap ................................................................ */
518 STATIC void su_call(pTHX_ void *ud_) {
519 su_ud_reap *ud = (su_ud_reap *) ud_;
520 #if SU_HAS_PERL(5, 9, 5)
521 PERL_CONTEXT saved_cx;
528 PerlIO_printf(Perl_debug_log,
529 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
530 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
539 /* If the recently popped context isn't saved there, it will be overwritten by
540 * the sub scope from call_sv, although it's still needed in our caller. */
542 #if SU_HAS_PERL(5, 9, 5)
543 if (cxstack_ix < cxstack_max)
544 cxix = cxstack_ix + 1;
546 cxix = Perl_cxinc(aTHX);
547 saved_cx = cxstack[cxix];
550 call_sv(ud->cb, G_VOID);
552 #if SU_HAS_PERL(5, 9, 5)
553 cxstack[cxix] = saved_cx;
561 SvREFCNT_dec(ud->cb);
565 STATIC void su_reap(pTHX_ void *ud) {
566 #define su_reap(U) su_reap(aTHX_ (U))
568 PerlIO_printf(Perl_debug_log,
569 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
570 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
573 SAVEDESTRUCTOR_X(su_call, ud);
576 /* ... Localize & localize array/hash element .............................. */
586 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
587 SvREFCNT_dec((U)->elem); \
588 SvREFCNT_dec((U)->val); \
589 SvREFCNT_dec((U)->sv); \
593 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
594 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
599 SvREFCNT_inc_simple_void(sv);
601 if (SvTYPE(sv) >= SVt_PVGV) {
602 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
604 } else { /* local *x = \$val; */
605 t = SvTYPE(SvRV(val));
608 } else if (SvROK(sv)) {
609 croak("Invalid %s reference as the localization target",
610 sv_reftype(SvRV(sv), 0));
613 const char *p = SvPV_const(sv, len), *s;
614 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
620 case '$': t = SVt_PV; break;
621 case '@': t = SVt_PVAV; break;
622 case '%': t = SVt_PVHV; break;
623 case '&': t = SVt_PVCV; break;
624 case '*': t = SVt_PVGV; break;
629 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
630 if (SvROK(val) && !sv_isobject(val)) {
631 t = SvTYPE(SvRV(val));
643 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
648 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
653 size = SU_SAVE_GP_SIZE;
657 size = SU_SAVE_GVCV_SIZE;
661 size = SU_SAVE_SCALAR_SIZE;
664 /* When deref is set, val isn't NULL */
667 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
668 ud->elem = SvREFCNT_inc(elem);
674 STATIC void su_localize(pTHX_ void *ud_) {
675 #define su_localize(U) su_localize(aTHX_ (U))
676 su_ud_localize *ud = (su_ud_localize *) ud_;
683 if (SvTYPE(sv) >= SVt_PVGV) {
687 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
690 const char *name = SvPV_const(sv, len);
691 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
698 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
699 PerlIO_printf(Perl_debug_log,
700 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
701 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
705 /* Inspired from Alias.pm */
709 su_save_aelem(GvAV(gv), elem, val);
716 su_save_helem(GvHV(gv), elem, val);
722 save_gp(gv, 1); /* hide previous entry in symtab */
728 gv = (GV *) save_scalar(gv);
733 SvSetMagicSV((SV *) gv, val);
736 SU_UD_LOCALIZE_FREE(ud);
739 /* --- Pop a context back -------------------------------------------------- */
743 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
745 # define SU_CXNAME "XXX"
749 STATIC void su_pop(pTHX_ void *ud) {
750 #define su_pop(U) su_pop(aTHX_ (U))
751 I32 depth, base, mark, *origin;
752 depth = SU_UD_DEPTH(ud);
755 PerlIO_printf(Perl_debug_log,
757 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
759 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
762 origin = SU_UD_ORIGIN(ud);
763 mark = origin[depth];
764 base = origin[depth - 1];
766 SU_D(PerlIO_printf(Perl_debug_log,
767 "%p: original scope was %*c top=%2d base=%2d\n",
768 ud, 24, ' ', mark, base));
771 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
772 PL_savestack_ix = mark;
775 PL_savestack_ix = base;
777 SU_UD_DEPTH(ud) = --depth;
782 if ((pad = SU_UD_PAD(ud))) {
785 SU_D(PerlIO_printf(Perl_debug_log,
786 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
787 ud, depth, PL_scopestack_ix, PL_savestack_ix));
788 SU_SAVE_PLACEHOLDER();
792 SU_D(PerlIO_printf(Perl_debug_log,
793 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
794 ud, depth, PL_scopestack_ix, PL_savestack_ix));
795 SAVEDESTRUCTOR_X(su_pop, ud);
797 SU_UD_HANDLER(ud)(aTHX_ ud);
800 SU_D(PerlIO_printf(Perl_debug_log,
801 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
802 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
805 /* --- Initialize the stack and the action userdata ------------------------ */
807 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
808 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
809 I32 i, depth = 1, pad, offset, *origin;
811 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
813 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
816 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
817 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
818 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
821 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
823 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
824 ud, size, pad, offset));
826 for (i = cxstack_ix; i > cxix; --i) {
827 PERL_CONTEXT *cx = cxstack + i;
828 switch (CxTYPE(cx)) {
829 #if SU_HAS_PERL(5, 10, 0)
831 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
832 /* Given and when blocks are actually followed by a simple block, so skip
834 if (cxix > 0) { /* Implies i > 0 */
835 PERL_CONTEXT *next = cx - 1;
836 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
842 #if SU_HAS_PERL(5, 11, 0)
845 case CXt_LOOP_LAZYSV:
846 case CXt_LOOP_LAZYIV:
850 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
854 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
859 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
861 Newx(origin, depth + 1, I32);
862 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
863 PL_scopestack[PL_scopestack_ix - depth] += size;
864 for (i = depth - 1; i >= 1; --i) {
865 I32 j = PL_scopestack_ix - i;
866 origin[depth - i] = PL_scopestack[j];
867 PL_scopestack[j] += offset;
869 origin[depth] = PL_savestack_ix;
871 SU_UD_ORIGIN(ud) = origin;
872 SU_UD_DEPTH(ud) = depth;
875 /* Make sure the first destructor fires by pushing enough fake slots on the
877 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
878 <= PL_scopestack[PL_scopestack_ix - 1]) {
881 SU_D(PerlIO_printf(Perl_debug_log,
882 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
883 ud, PL_scopestack_ix, PL_savestack_ix));
884 SU_SAVE_PLACEHOLDER();
885 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
886 <= PL_scopestack[PL_scopestack_ix - 1]);
888 SU_D(PerlIO_printf(Perl_debug_log,
889 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
890 ud, PL_scopestack_ix, PL_savestack_ix));
891 SAVEDESTRUCTOR_X(su_pop, ud);
894 for (i = 0; i <= depth; ++i) {
895 I32 j = PL_scopestack_ix - i;
896 PerlIO_printf(Perl_debug_log,
897 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
898 ud, i, j, origin[depth - i],
899 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
906 /* --- Unwind stack -------------------------------------------------------- */
908 STATIC void su_unwind(pTHX_ void *ud_) {
910 I32 cxix = MY_CXT.unwind_storage.cxix;
911 I32 items = MY_CXT.unwind_storage.items - 1;
912 SV **savesp = MY_CXT.unwind_storage.savesp;
915 PERL_UNUSED_VAR(ud_);
918 PL_stack_sp = savesp;
920 if (cxstack_ix > cxix)
927 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
928 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
932 PerlIO_printf(Perl_debug_log,
933 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
935 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
936 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
939 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
940 PL_op = PL_op->op_ppaddr(aTHX);
942 *PL_markstack_ptr = mark;
944 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
945 PL_op = &(MY_CXT.unwind_storage.proxy_op);
948 /* --- Uplevel ------------------------------------------------------------- */
950 #ifndef OP_GIMME_REVERSE
951 STATIC U8 su_op_gimme_reverse(U8 gimme) {
954 return OPf_WANT_VOID;
956 return OPf_WANT_LIST;
961 return OPf_WANT_SCALAR;
963 #define OP_GIMME_REVERSE(G) su_op_gimme_reverse(G)
966 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
967 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
969 STATIC su_uplevel_ud *su_uplevel_storage_new(pTHX) {
970 #define su_uplevel_storage_new() su_uplevel_storage_new(aTHX)
974 sud = MY_CXT.uplevel_storage.root;
976 MY_CXT.uplevel_storage.root = sud->next;
977 MY_CXT.uplevel_storage.count--;
979 sud = su_uplevel_ud_new();
985 STATIC void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
986 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
989 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
990 su_uplevel_ud_delete(sud);
992 sud->next = MY_CXT.uplevel_storage.root;
993 MY_CXT.uplevel_storage.root = sud;
994 MY_CXT.uplevel_storage.count++;
998 #define SU_HAS_EXT_MAGIC SU_HAS_PERL(5, 8, 0)
1000 #if SU_HAS_EXT_MAGIC && !SU_HAS_PERL(5, 13, 7)
1002 STATIC int su_uplevel_restore_free(pTHX_ SV *sv, MAGIC *mg) {
1003 su_uplevel_storage_delete((su_uplevel_ud *) mg->mg_ptr);
1008 STATIC MGVTBL su_uplevel_restore_vtbl = {
1013 su_uplevel_restore_free
1016 #endif /* SU_HAS_EXT_MAGIC && !SU_HAS_PERL(5, 13, 7) */
1018 #define su_at_underscore(C) AvARRAY(AvARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1020 STATIC void su_uplevel_restore(pTHX_ void *sus_) {
1021 su_uplevel_ud *sud = sus_;
1022 PERL_SI *cur = sud->old_curstackinfo;
1023 PERL_SI *si = sud->si;
1025 if (sud->callback) {
1026 PERL_CONTEXT *cx = cxstack + sud->cxix;
1027 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1029 /* We have to fix the pad entry for @_ in the original callback because it
1030 * may have been reified. */
1031 if (AvREAL(argarray)) {
1032 const I32 fill = AvFILLp(argarray);
1033 SvREFCNT_dec(argarray);
1035 AvREAL_off(argarray);
1036 AvREIFY_on(argarray);
1037 av_extend(argarray, fill);
1038 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1040 CLEAR_ARGARRAY(argarray);
1043 /* If the old cv member is our renamed CV, it means that this place has been
1044 * reached without a goto() happening, and the old argarray member is
1045 * actually our fake argarray. Destroy it properly in that case. */
1046 if (cx->blk_sub.cv == sud->renamed) {
1047 SvREFCNT_dec(cx->blk_sub.argarray);
1048 cx->blk_sub.argarray = argarray;
1051 CvDEPTH(sud->callback)--;
1052 SvREFCNT_dec(sud->callback);
1055 /* Free the renamed CV. We must do it ourselves so that we can force the
1056 * depth to be 0, or perl would complain about it being "still in use".
1057 * But we *know* that it cannot be so. */
1059 CvDEPTH(sud->renamed) = 0;
1060 CvPADLIST(sud->renamed) = NULL;
1061 SvREFCNT_dec(sud->renamed);
1064 CATCH_SET(sud->old_catch);
1066 SU_UPLEVEL_RESTORE(op);
1068 /* stack_grow() wants PL_curstack so restore the old stack first */
1069 if (PL_curstackinfo == si) {
1070 PL_curstack = cur->si_stack;
1071 if (sud->old_mainstack)
1072 SU_UPLEVEL_RESTORE(mainstack);
1073 SU_UPLEVEL_RESTORE(curstackinfo);
1076 CV *target = sud->target;
1079 /* When we die, the depth of the target CV is not updated because of the
1080 * stack switcheroo. So we have to look at all the frames between the
1081 * uplevel call and the catch block to count how many call frames to the
1082 * target CV were skipped. */
1083 for (i = cur->si_cxix; i > sud->cxix; i--) {
1084 register const PERL_CONTEXT *cx = cxstack + i;
1086 if (CxTYPE(cx) == CXt_SUB) {
1087 if (cx->blk_sub.cv == target)
1092 /* If we died, the replacement stack was already unwinded to the first
1093 * eval frame, and all the contexts down there were popped. We don't have
1094 * to pop manually any context of the original stack, because they must
1095 * have been in the replacement stack as well (since the second was copied
1096 * from the first). Thus we only have to make sure the original stack index
1097 * points to the context just below the first eval scope under the target
1099 for (; i >= 0; i--) {
1100 register const PERL_CONTEXT *cx = cxstack + i;
1102 switch (CxTYPE(cx)) {
1104 if (cx->blk_sub.cv == target)
1116 CvDEPTH(target) = sud->target_depth - levels;
1117 PL_curstackinfo->si_cxix = i - 1;
1119 #if !SU_HAS_PERL(5, 13, 1)
1120 /* Since $@ was maybe localized between the target frame and the uplevel
1121 * call, we forcefully flush the save stack to get rid of it and then
1122 * reset $@ to its proper value. Note that the the call to
1123 * su_uplevel_restore() must happen before the "reset $@" item of the save
1124 * stack is processed, as uplevel was called after the localization.
1125 * Andrew's changes to how $@ was handled, which were mainly integrated
1126 * between perl 5.13.0 and 5.13.1, fixed this. */
1127 if (ERRSV && SvTRUE(ERRSV)) {
1128 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1129 SV *errsv = SvREFCNT_inc(ERRSV);
1130 PL_scopestack_ix = cx->blk_oldscopesp;
1131 leave_scope(PL_scopestack[PL_scopestack_ix]);
1132 sv_setsv(ERRSV, errsv);
1133 SvREFCNT_dec(errsv);
1139 SU_UPLEVEL_RESTORE(curcop);
1141 SvREFCNT_dec(sud->target);
1143 PL_stack_base = AvARRAY(cur->si_stack);
1144 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1145 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1147 /* When an exception is thrown from the uplevel'd subroutine,
1148 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1149 * die_where() in more recent perls), which has the sad habit of keeping a
1150 * pointer to the current context frame across this call. This means that we
1151 * can't free the temporary context stack we used for the uplevel call right
1152 * now, or that pointer upwards would point to garbage. */
1153 #if SU_HAS_PERL(5, 13, 7)
1154 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1155 * public in perl 5.13.7. */
1156 su_uplevel_storage_delete(sud);
1157 #elif SU_HAS_EXT_MAGIC
1158 /* If 'ext' magic is available, we work around this by attaching the state
1159 * data to a scalar that will be freed "soon". */
1161 SV *sv = sv_newmortal();
1163 sv_magicext(sv, NULL, PERL_MAGIC_ext, &su_uplevel_restore_vtbl,
1164 (const char *) sud, 0);
1167 /* Otherwise, we just enqueue it back in the global storage list. */
1171 sud->next = MY_CXT.uplevel_storage.root;
1172 MY_CXT.uplevel_storage.root = sud;
1173 MY_CXT.uplevel_storage.count++;
1180 STATIC CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1181 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1185 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1187 CvFLAGS(cv) = CvFLAGS(proto);
1189 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1191 CvDEPTH(cv) = CvDEPTH(proto);
1193 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1195 CvFILE(cv) = CvFILE(proto);
1199 CvSTASH_set(cv, CvSTASH(proto));
1200 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1201 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1202 * (which was part of perl 5.13.7). */
1203 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1205 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1209 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1211 CvSTART(cv) = CvSTART(proto);
1212 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1213 #ifdef CVf_WEAKOUTSIDE
1214 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1216 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1217 CvPADLIST(cv) = CvPADLIST(proto);
1218 #ifdef CvOUTSIDE_SEQ
1219 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1223 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1233 #if SU_HAS_PERL(5, 8, 0)
1235 STATIC int su_uplevel_guard_free(pTHX_ SV *sv, MAGIC *mg) {
1236 MAGIC *omg = (MAGIC *) mg->mg_ptr;
1237 su_uplevel_ud *sud = (su_uplevel_ud *) omg->mg_ptr;
1240 /* This code should be triggered by the FREETMPS in the first
1241 * nextstate/dbstate op of the goto'd code. Its job is to reset the sub
1242 * arguments to what the uplevel'd code was called with. */
1244 if (PL_op != CvSTART(sud->goto_code))
1245 croak("su_uplevel_guard_free() was called at an incorrect time");
1246 sud->goto_code = NULL;
1248 /* get_db_sub() has called save_item() on the SV member of the fake GV we
1249 * used to replace PL_DBsub, so we can't kill it yet. Since set magic will
1250 * be called when the item is restored, we save the fake GV so that we can
1251 * correctly drop its refcount just after the restore. */
1252 omg->mg_obj = MUTABLE_SV(PL_DBsub);
1258 I32 items = AvFILLp(args);
1262 EXTEND(SP, items + 2);
1263 Copy(AvARRAY(args), SP + 1, items + 1, SV *);
1265 cx = cxstack + cxstack_ix;
1266 argarray = cx->blk_sub.argarray;
1267 av_extend(argarray, items);
1268 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1269 AvFILLp(argarray) = items;
1275 STATIC MGVTBL su_uplevel_guard_vtbl = {
1280 su_uplevel_guard_free
1283 STATIC int su_uplevel_dbsv_get(pTHX_ SV *sv, MAGIC *mg) {
1284 su_uplevel_ud *sud = (su_uplevel_ud *) mg->mg_ptr;
1287 /* This code should be called at the very end of pp_goto, after the
1288 * SAVETMPS enclosing the sub was isseud and the blk_sub.cv member is set.
1289 * It creates a magical mortal guard that will be destroyed soon at the next
1292 if (PL_op != sud->goto_op)
1293 croak("su_uplevel_dbsv_get() was called at an incorrect time");
1294 sud->goto_op = NULL;
1296 sud->goto_code = cxstack[cxstack_ix].blk_sub.cv;
1297 PL_perldb = sud->goto_perldb;
1299 guard = sv_newmortal();
1300 sv_magicext(guard, 0, PERL_MAGIC_ext, &su_uplevel_guard_vtbl,
1301 (const char *) mg, 0);
1306 STATIC int su_uplevel_dbsv_set(pTHX_ SV *sv, MAGIC *mg) {
1307 su_uplevel_ud *sud = (su_uplevel_ud *) mg->mg_ptr;
1310 /* This handler is supposed to be executed when the saved GvSV(PL_DBsub)
1311 * is restored, which happens when the goto'd code terminates. Its aim is
1312 * just to clean up after our hack. */
1315 croak("su_uplevel_dbsv_set() called before su_uplevel_dbsv_get");
1317 croak("su_uplevel_dbsv_set() called before su_uplevel_goto_2_free");
1319 /* Don't free the current magical SV right now, because the mg_*() calls above
1320 * us may still need it. */
1322 SvREFCNT_dec(mg->mg_obj);
1327 STATIC MGVTBL su_uplevel_dbsv_vtbl = {
1328 su_uplevel_dbsv_get,
1329 su_uplevel_dbsv_set,
1336 # ifdef PERL_DONT_CREATE_GVSV
1337 # define GvSVn(gv) (*(GvGP(gv)->gp_sv ? \
1338 &(GvGP(gv)->gp_sv) : \
1339 &(GvGP(gv_SVadd(gv))->gp_sv)))
1341 # define GvSVn(gv) GvSV(gv)
1345 STATIC void su_uplevel_goto_handler(pTHX_ void *ud_) {
1346 su_uplevel_ud *sud = ud_;
1348 if (PL_op && PL_op->op_type == OP_GOTO && !PL_DBsub) {
1351 sud->goto_op = PL_op;
1352 sud->goto_code = NULL;
1353 sud->goto_perldb = PL_perldb;
1355 PL_DBsub = (GV *) newSV(0);
1356 gv_init(PL_DBsub, NULL, "", 0, 0);
1357 PL_perldb = PERLDBf_SUB;
1359 dbsv = GvSVn(PL_DBsub);
1360 sv_magicext(dbsv, NULL, PERL_MAGIC_ext, &su_uplevel_dbsv_vtbl,
1361 (const char *) sud, 0);
1366 #else /* SU_HAS_PERL(5, 8, 0) */
1368 STATIC void su_uplevel_goto_handler(pTHX_ void *ud_) {
1369 su_uplevel_ud *sud = ud_;
1371 if (PL_op && PL_op->op_type == OP_GOTO) {
1372 /* Don't let the last sub context in an mixed state while we throw an
1373 * exception, as this may cause double free errors (the blk_sub.cv member
1374 * is still the renamed CV). Let our su_uplevel_restore() properly handle the
1376 cxstack[cxstack_ix].blk_sub.cv = NULL;
1377 croak("Can't goto to an uplevel'd stack frame on perl 5.6");
1381 #endif /* !SU_HAS_PERL(5, 8, 0) */
1383 STATIC I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1384 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1386 const PERL_CONTEXT *cx = cxstack + cxix;
1388 PERL_SI *cur = PL_curstackinfo;
1394 I32 old_mark, new_mark;
1401 /* Make PL_stack_sp point just before the CV. */
1402 PL_stack_sp -= args + 1;
1403 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1406 sud = su_uplevel_storage_new();
1410 sud->callback = NULL;
1411 sud->renamed = NULL;
1413 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1417 si->si_type = cur->si_type;
1419 si->si_prev = cur->si_prev;
1421 si->si_markoff = cx->blk_oldmarksp;
1424 /* Allocate enough space for all the elements of the original stack up to the
1425 * target context, plus the forthcoming arguments. */
1426 new_mark = cx->blk_oldsp;
1427 av_extend(si->si_stack, new_mark + 1 + args + 1);
1428 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1429 AvFILLp(si->si_stack) = new_mark;
1430 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1432 /* Specialized SWITCHSTACK() */
1433 PL_stack_base = AvARRAY(si->si_stack);
1434 old_stack_sp = PL_stack_sp;
1435 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1436 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1439 /* Copy the context stack up to the context just below the target. */
1440 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1441 if (si->si_cxmax < cxix) {
1442 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1443 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1444 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1446 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1447 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1449 target = cx->blk_sub.cv;
1450 sud->target = (CV *) SvREFCNT_inc(target);
1451 sud->target_depth = CvDEPTH(target);
1453 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1454 * run-time implication, since PL_curcop will be overwritten as soon as we
1455 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1456 * make it point to the blk_oldcop for the target frame, so that caller()
1457 * reports the right file name, line number and lexical hints. */
1458 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1459 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1460 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1462 SU_UPLEVEL_SAVE(curstackinfo, si);
1463 /* If those two are equal, we need to fool POPSTACK_TO() */
1464 if (PL_mainstack == PL_curstack)
1465 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1467 sud->old_mainstack = NULL;
1468 PL_curstack = si->si_stack;
1470 renamed = su_cv_clone(callback, CvGV(target));
1471 sud->renamed = renamed;
1474 /* Both SP and old_stack_sp point just before the CV. */
1475 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1477 PUSHs((SV *) renamed);
1480 Zero(&sub_op, 1, UNOP);
1481 sub_op.op_type = OP_ENTERSUB;
1482 sub_op.op_next = NULL;
1483 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1485 sub_op.op_flags |= OPpENTERSUB_DB;
1487 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1489 sud->old_catch = CATCH_GET;
1492 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1493 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1495 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1496 CvDEPTH(callback)++;
1498 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1499 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1500 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1501 * with what we put on the stack. But we want to fake up the same arguments
1502 * as the ones in use at the context we uplevel to, so we replace the
1503 * argarray with an unreal copy of the original @_. */
1507 av_extend(av, AvMAX(cx->blk_sub.argarray));
1508 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1509 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1510 sub_cx->blk_sub.argarray = av;
1512 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1514 sud->args = GvAV(PL_defgv);
1516 SAVEDESTRUCTOR_X(su_uplevel_goto_handler, sud);
1520 ret = PL_stack_sp - (PL_stack_base + new_mark);
1528 AV *old_stack = sud->old_curstackinfo->si_stack;
1530 if (old_mark + ret > AvMAX(old_stack)) {
1531 /* Specialized EXTEND(old_sp, ret) */
1532 av_extend(old_stack, old_mark + ret + 1);
1533 old_stack_sp = AvARRAY(old_stack) + old_mark;
1536 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1538 AvFILLp(old_stack) += ret;
1548 /* --- Interpreter setup/teardown ------------------------------------------ */
1550 STATIC void su_teardown(pTHX_ void *param) {
1554 cur = MY_CXT.uplevel_storage.root;
1556 su_uplevel_ud *prev;
1560 su_uplevel_ud_delete(prev);
1567 STATIC void su_setup(pTHX) {
1568 #define su_setup() su_setup(aTHX)
1571 MY_CXT.stack_placeholder = NULL;
1573 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
1574 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
1575 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
1576 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
1578 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
1579 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
1580 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
1582 MY_CXT.uplevel_storage.root = NULL;
1583 MY_CXT.uplevel_storage.count = 0;
1585 call_atexit(su_teardown, NULL);
1590 /* --- XS ------------------------------------------------------------------ */
1592 #if SU_HAS_PERL(5, 8, 9)
1593 # define SU_SKIP_DB_MAX 2
1595 # define SU_SKIP_DB_MAX 3
1598 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
1599 * followed by a DB sub */
1601 #define SU_SKIP_DB(C) \
1604 PERL_CONTEXT *base = cxstack; \
1605 PERL_CONTEXT *cx = base + (C); \
1606 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
1608 if (cx >= base && (C) > skipped) { \
1609 switch (CxTYPE(cx)) { \
1611 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
1612 (C) -= skipped + 1; \
1620 #define SU_GET_CONTEXT(A, B) \
1629 else if (cxix > cxstack_ix) \
1630 cxix = cxstack_ix; \
1633 cxix = cxstack_ix; \
1639 #define SU_GET_LEVEL(A, B) \
1645 level = SvIV(lsv); \
1652 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
1654 XS(XS_Scope__Upper_unwind) {
1663 PERL_UNUSED_VAR(cv); /* -W */
1664 PERL_UNUSED_VAR(ax); /* -Wall */
1666 SU_GET_CONTEXT(0, items - 1);
1668 PERL_CONTEXT *cx = cxstack + cxix;
1669 switch (CxTYPE(cx)) {
1671 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1675 MY_CXT.unwind_storage.cxix = cxix;
1676 MY_CXT.unwind_storage.items = items;
1677 /* pp_entersub will want to sanitize the stack after returning from there
1678 * Screw that, we're insane */
1679 if (GIMME_V == G_SCALAR) {
1680 MY_CXT.unwind_storage.savesp = PL_stack_sp;
1681 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
1682 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
1684 MY_CXT.unwind_storage.savesp = NULL;
1686 SAVEDESTRUCTOR_X(su_unwind, NULL);
1691 } while (--cxix >= 0);
1692 croak("Can't return outside a subroutine");
1695 MODULE = Scope::Upper PACKAGE = Scope::Upper
1703 stash = gv_stashpv(__PACKAGE__, 1);
1704 newCONSTSUB(stash, "TOP", newSViv(0));
1705 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
1707 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
1720 MY_CXT.uplevel_storage.root = NULL;
1721 MY_CXT.uplevel_storage.count = 0;
1725 #endif /* SU_THREADSAFE */
1731 I32 cxix = cxstack_ix;
1745 SU_GET_CONTEXT(0, 0);
1760 SU_GET_CONTEXT(0, 0);
1762 for (; cxix >= 0; --cxix) {
1763 PERL_CONTEXT *cx = cxstack + cxix;
1764 switch (CxTYPE(cx)) {
1768 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1782 SU_GET_CONTEXT(0, 0);
1784 for (; cxix >= 0; --cxix) {
1785 PERL_CONTEXT *cx = cxstack + cxix;
1786 switch (CxTYPE(cx)) {
1828 for (cxix = cxstack_ix; cxix > 0; --cxix) {
1829 PERL_CONTEXT *cx = cxstack + cxix;
1830 switch (CxTYPE(cx)) {
1832 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1852 SU_GET_CONTEXT(0, 0);
1855 PERL_CONTEXT *cx = cxstack + cxix--;
1856 switch (CxTYPE(cx)) {
1860 I32 gimme = cx->blk_gimme;
1862 case G_VOID: XSRETURN_UNDEF; break;
1863 case G_SCALAR: XSRETURN_NO; break;
1864 case G_ARRAY: XSRETURN_YES; break;
1879 SU_GET_CONTEXT(1, 1);
1880 Newx(ud, 1, su_ud_reap);
1881 SU_UD_ORIGIN(ud) = NULL;
1882 SU_UD_HANDLER(ud) = su_reap;
1883 ud->cb = newSVsv(hook);
1884 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1887 localize(SV *sv, SV *val, ...)
1894 SU_GET_CONTEXT(2, 2);
1895 Newx(ud, 1, su_ud_localize);
1896 SU_UD_ORIGIN(ud) = NULL;
1897 SU_UD_HANDLER(ud) = su_localize;
1898 size = su_ud_localize_init(ud, sv, val, NULL);
1899 su_init(ud, cxix, size);
1902 localize_elem(SV *sv, SV *elem, SV *val, ...)
1909 if (SvTYPE(sv) >= SVt_PVGV)
1910 croak("Can't infer the element localization type from a glob and the value");
1911 SU_GET_CONTEXT(3, 3);
1912 Newx(ud, 1, su_ud_localize);
1913 SU_UD_ORIGIN(ud) = NULL;
1914 SU_UD_HANDLER(ud) = su_localize;
1915 size = su_ud_localize_init(ud, sv, val, elem);
1916 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
1917 SU_UD_LOCALIZE_FREE(ud);
1918 croak("Can't localize an element of something that isn't an array or a hash");
1920 su_init(ud, cxix, size);
1923 localize_delete(SV *sv, SV *elem, ...)
1930 SU_GET_CONTEXT(2, 2);
1931 Newx(ud, 1, su_ud_localize);
1932 SU_UD_ORIGIN(ud) = NULL;
1933 SU_UD_HANDLER(ud) = su_localize;
1934 size = su_ud_localize_init(ud, sv, NULL, elem);
1935 su_init(ud, cxix, size);
1938 uplevel(SV *code, ...)
1941 I32 cxix, ret, args = 0;
1945 if (SvTYPE(code) < SVt_PVCV)
1946 croak("First argument to uplevel must be a code reference");
1947 SU_GET_CONTEXT(1, items - 1);
1949 PERL_CONTEXT *cx = cxstack + cxix;
1950 switch (CxTYPE(cx)) {
1952 croak("Can't uplevel to an eval frame");
1954 croak("Can't uplevel to a format frame");
1956 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1962 /* su_uplevel() takes care of extending the stack if needed. */
1963 ret = su_uplevel((CV *) code, cxix, args);
1968 } while (--cxix >= 0);
1969 croak("Can't uplevel outside a subroutine");