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 ------------------------------------------------------- */
17 #ifndef PERL_UNUSED_VAR
18 # define PERL_UNUSED_VAR(V)
22 # define STMT_START do
26 # define STMT_END while (0)
30 # define SU_D(X) STMT_START X STMT_END
36 # define Newx(v, n, c) New(0, v, n, c)
40 # define SvPV_const(S, L) SvPV(S, L)
43 #ifndef SvPV_nolen_const
44 # define SvPV_nolen_const(S) SvPV_nolen(S)
47 #ifndef SvREFCNT_inc_simple_void
48 # define SvREFCNT_inc_simple_void(sv) SvREFCNT_inc(sv)
52 # define GvCV_set(G, C) (GvCV(G) = (C))
56 # define HvNAME_get(H) HvNAME(H)
59 #ifndef gv_fetchpvn_flags
60 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
63 #ifndef PERL_MAGIC_tied
64 # define PERL_MAGIC_tied 'P'
67 #ifndef PERL_MAGIC_env
68 # define PERL_MAGIC_env 'E'
71 #ifndef NEGATIVE_INDICES_VAR
72 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
75 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
76 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
78 /* --- Threads and multiplicity -------------------------------------------- */
88 #ifndef SU_MULTIPLICITY
89 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
90 # define SU_MULTIPLICITY 1
92 # define SU_MULTIPLICITY 0
95 #if SU_MULTIPLICITY && !defined(tTHX)
96 # define tTHX PerlInterpreter*
99 #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))
100 # define SU_THREADSAFE 1
101 # ifndef MY_CXT_CLONE
102 # define MY_CXT_CLONE \
104 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
105 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
106 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
109 # define SU_THREADSAFE 0
111 # define dMY_CXT dNOOP
113 # define MY_CXT su_globaldata
115 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
117 # define MY_CXT_INIT NOOP
119 # define MY_CXT_CLONE NOOP
122 /* --- Global data --------------------------------------------------------- */
124 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
127 char *stack_placeholder;
137 /* --- Stack manipulations ------------------------------------------------- */
139 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
141 #define SU_SAVE_DESTRUCTOR_SIZE 3
142 #define SU_SAVE_PLACEHOLDER_SIZE 3
144 #define SU_SAVE_SCALAR_SIZE 3
146 #define SU_SAVE_ARY_SIZE 3
147 #define SU_SAVE_AELEM_SIZE 4
149 # define SU_SAVE_ADELETE_SIZE 3
151 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
153 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
154 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
156 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
159 #define SU_SAVE_HASH_SIZE 3
160 #define SU_SAVE_HELEM_SIZE 4
161 #define SU_SAVE_HDELETE_SIZE 4
162 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
163 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
165 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
168 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
170 #if !SU_HAS_PERL(5, 8, 9)
171 # define SU_SAVE_GP_SIZE 6
172 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
173 # define SU_SAVE_GP_SIZE 3
174 #elif !SU_HAS_PERL(5, 13, 8)
175 # define SU_SAVE_GP_SIZE 4
177 # define SU_SAVE_GP_SIZE 3
180 #ifndef SvCANEXISTDELETE
181 # define SvCANEXISTDELETE(sv) \
183 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
184 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
185 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
186 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
191 /* ... Saving array elements ............................................... */
193 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
194 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
200 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
201 #if SU_HAS_PERL(5, 8, 1)
202 if (SvRMAGICAL(av)) {
203 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
205 SV * const * const negative_indices_glob =
206 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
207 NEGATIVE_INDICES_VAR, 16, 0);
208 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
214 idx = key + av_len(av) + 1;
228 STATIC void su_adelete(pTHX_ void *ud_) {
229 su_ud_adelete *ud = (su_ud_adelete *) ud_;
231 av_delete(ud->av, ud->idx, G_DISCARD);
232 SvREFCNT_dec(ud->av);
237 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
238 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
241 Newx(ud, 1, su_ud_adelete);
244 SvREFCNT_inc_simple_void(av);
246 SAVEDESTRUCTOR_X(su_adelete, ud);
249 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
251 #endif /* SAVEADELETE */
253 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
254 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
261 idx = su_av_key2idx(av, SvIV(key));
263 if (SvCANEXISTDELETE(av))
264 preeminent = av_exists(av, idx);
266 svp = av_fetch(av, idx, 1);
267 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
270 save_aelem(av, idx, svp);
272 SAVEADELETE(av, idx);
274 if (val) { /* local $x[$idx] = $val; */
275 SvSetMagicSV(*svp, val);
276 } else { /* local $x[$idx]; delete $x[$idx]; */
277 av_delete(av, idx, G_DISCARD);
281 /* ... Saving hash elements ................................................ */
283 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
284 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
291 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
292 preeminent = hv_exists_ent(hv, keysv, 0);
294 he = hv_fetch_ent(hv, keysv, 1, 0);
295 svp = he ? &HeVAL(he) : NULL;
296 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
298 if (HvNAME_get(hv) && isGV(*svp)) {
299 save_gp((GV *) *svp, 0);
304 save_helem(hv, keysv, svp);
307 const char * const key = SvPV_const(keysv, keylen);
308 SAVEDELETE(hv, savepvn(key, keylen),
309 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
312 if (val) { /* local $x{$keysv} = $val; */
313 SvSetMagicSV(*svp, val);
314 } else { /* local $x{$keysv}; delete $x{$keysv}; */
315 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
319 /* ... Saving code slots from a glob ....................................... */
321 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
322 # define mro_method_changed_in(G) PL_sub_generation++
330 STATIC void su_restore_gvcv(pTHX_ void *ud_) {
331 su_save_gvcv_ud *ud = ud_;
334 GvCV_set(gv, ud->old_cv);
336 mro_method_changed_in(GvSTASH(gv));
341 STATIC void su_save_gvcv(pTHX_ GV *gv) {
342 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
345 Newx(ud, 1, su_save_gvcv_ud);
347 ud->old_cv = GvCV(gv);
351 mro_method_changed_in(GvSTASH(gv));
353 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
356 /* --- Actions ------------------------------------------------------------- */
362 void (*handler)(pTHX_ void *);
365 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
366 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
367 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
368 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
370 #define SU_UD_FREE(U) STMT_START { \
371 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
375 /* ... Reap ................................................................ */
382 STATIC void su_call(pTHX_ void *ud_) {
383 su_ud_reap *ud = (su_ud_reap *) ud_;
384 #if SU_HAS_PERL(5, 9, 5)
385 PERL_CONTEXT saved_cx;
392 PerlIO_printf(Perl_debug_log,
393 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
394 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
403 /* If the recently popped context isn't saved there, it will be overwritten by
404 * the sub scope from call_sv, although it's still needed in our caller. */
406 #if SU_HAS_PERL(5, 9, 5)
407 if (cxstack_ix < cxstack_max)
408 cxix = cxstack_ix + 1;
410 cxix = Perl_cxinc(aTHX);
411 saved_cx = cxstack[cxix];
414 call_sv(ud->cb, G_VOID);
416 #if SU_HAS_PERL(5, 9, 5)
417 cxstack[cxix] = saved_cx;
425 SvREFCNT_dec(ud->cb);
429 STATIC void su_reap(pTHX_ void *ud) {
430 #define su_reap(U) su_reap(aTHX_ (U))
432 PerlIO_printf(Perl_debug_log,
433 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
434 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
437 SAVEDESTRUCTOR_X(su_call, ud);
440 /* ... Localize & localize array/hash element .............................. */
450 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
451 SvREFCNT_dec((U)->elem); \
452 SvREFCNT_dec((U)->val); \
453 SvREFCNT_dec((U)->sv); \
457 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
458 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
463 SvREFCNT_inc_simple_void(sv);
465 if (SvTYPE(sv) >= SVt_PVGV) {
466 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
468 } else { /* local *x = \$val; */
469 t = SvTYPE(SvRV(val));
472 } else if (SvROK(sv)) {
473 croak("Invalid %s reference as the localization target",
474 sv_reftype(SvRV(sv), 0));
477 const char *p = SvPV_const(sv, len), *s;
478 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
484 case '$': t = SVt_PV; break;
485 case '@': t = SVt_PVAV; break;
486 case '%': t = SVt_PVHV; break;
487 case '&': t = SVt_PVCV; break;
488 case '*': t = SVt_PVGV; break;
493 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
494 if (SvROK(val) && !sv_isobject(val)) {
495 t = SvTYPE(SvRV(val));
507 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
512 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
517 size = SU_SAVE_GP_SIZE;
521 size = SU_SAVE_GVCV_SIZE;
525 size = SU_SAVE_SCALAR_SIZE;
528 /* When deref is set, val isn't NULL */
531 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
532 ud->elem = SvREFCNT_inc(elem);
538 STATIC void su_localize(pTHX_ void *ud_) {
539 #define su_localize(U) su_localize(aTHX_ (U))
540 su_ud_localize *ud = (su_ud_localize *) ud_;
547 if (SvTYPE(sv) >= SVt_PVGV) {
551 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
554 const char *name = SvPV_const(sv, len);
555 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
562 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
563 PerlIO_printf(Perl_debug_log,
564 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
565 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
569 /* Inspired from Alias.pm */
573 su_save_aelem(GvAV(gv), elem, val);
580 su_save_helem(GvHV(gv), elem, val);
586 save_gp(gv, 1); /* hide previous entry in symtab */
592 gv = (GV *) save_scalar(gv);
597 SvSetMagicSV((SV *) gv, val);
600 SU_UD_LOCALIZE_FREE(ud);
603 /* --- Pop a context back -------------------------------------------------- */
607 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
609 # define SU_CXNAME "XXX"
613 STATIC void su_pop(pTHX_ void *ud) {
614 #define su_pop(U) su_pop(aTHX_ (U))
615 I32 depth, base, mark, *origin;
616 depth = SU_UD_DEPTH(ud);
619 PerlIO_printf(Perl_debug_log,
621 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
623 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
626 origin = SU_UD_ORIGIN(ud);
627 mark = origin[depth];
628 base = origin[depth - 1];
630 SU_D(PerlIO_printf(Perl_debug_log,
631 "%p: original scope was %*c top=%2d base=%2d\n",
632 ud, 24, ' ', mark, base));
635 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
636 PL_savestack_ix = mark;
639 PL_savestack_ix = base;
641 SU_UD_DEPTH(ud) = --depth;
646 if ((pad = SU_UD_PAD(ud))) {
649 SU_D(PerlIO_printf(Perl_debug_log,
650 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
651 ud, depth, PL_scopestack_ix, PL_savestack_ix));
652 SU_SAVE_PLACEHOLDER();
656 SU_D(PerlIO_printf(Perl_debug_log,
657 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
658 ud, depth, PL_scopestack_ix, PL_savestack_ix));
659 SAVEDESTRUCTOR_X(su_pop, ud);
661 SU_UD_HANDLER(ud)(aTHX_ ud);
664 SU_D(PerlIO_printf(Perl_debug_log,
665 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
666 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
669 /* --- Initialize the stack and the action userdata ------------------------ */
671 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
672 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
673 I32 i, depth = 1, pad, offset, *origin;
675 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
677 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
680 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
681 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
682 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
685 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
687 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
688 ud, size, pad, offset));
690 for (i = cxstack_ix; i > cxix; --i) {
691 PERL_CONTEXT *cx = cxstack + i;
692 switch (CxTYPE(cx)) {
693 #if SU_HAS_PERL(5, 10, 0)
695 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
696 /* Given and when blocks are actually followed by a simple block, so skip
698 if (cxix > 0) { /* Implies i > 0 */
699 PERL_CONTEXT *next = cx - 1;
700 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
706 #if SU_HAS_PERL(5, 11, 0)
709 case CXt_LOOP_LAZYSV:
710 case CXt_LOOP_LAZYIV:
714 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
718 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
723 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
725 Newx(origin, depth + 1, I32);
726 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
727 PL_scopestack[PL_scopestack_ix - depth] += size;
728 for (i = depth - 1; i >= 1; --i) {
729 I32 j = PL_scopestack_ix - i;
730 origin[depth - i] = PL_scopestack[j];
731 PL_scopestack[j] += offset;
733 origin[depth] = PL_savestack_ix;
735 SU_UD_ORIGIN(ud) = origin;
736 SU_UD_DEPTH(ud) = depth;
739 /* Make sure the first destructor fires by pushing enough fake slots on the
741 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
742 <= PL_scopestack[PL_scopestack_ix - 1]) {
745 SU_D(PerlIO_printf(Perl_debug_log,
746 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
747 ud, PL_scopestack_ix, PL_savestack_ix));
748 SU_SAVE_PLACEHOLDER();
749 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
750 <= PL_scopestack[PL_scopestack_ix - 1]);
752 SU_D(PerlIO_printf(Perl_debug_log,
753 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
754 ud, PL_scopestack_ix, PL_savestack_ix));
755 SAVEDESTRUCTOR_X(su_pop, ud);
758 for (i = 0; i <= depth; ++i) {
759 I32 j = PL_scopestack_ix - i;
760 PerlIO_printf(Perl_debug_log,
761 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
762 ud, i, j, origin[depth - i],
763 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
770 /* --- Unwind stack -------------------------------------------------------- */
772 STATIC void su_unwind(pTHX_ void *ud_) {
774 I32 cxix = MY_CXT.cxix;
775 I32 items = MY_CXT.items - 1;
776 SV **savesp = MY_CXT.savesp;
779 PERL_UNUSED_VAR(ud_);
782 PL_stack_sp = savesp;
784 if (cxstack_ix > cxix)
791 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
792 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
796 PerlIO_printf(Perl_debug_log,
797 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
799 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
800 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
803 PL_op = (OP *) &(MY_CXT.return_op);
804 PL_op = PL_op->op_ppaddr(aTHX);
806 *PL_markstack_ptr = mark;
808 MY_CXT.proxy_op.op_next = PL_op;
809 PL_op = &(MY_CXT.proxy_op);
812 /* --- XS ------------------------------------------------------------------ */
814 #if SU_HAS_PERL(5, 8, 9)
815 # define SU_SKIP_DB_MAX 2
817 # define SU_SKIP_DB_MAX 3
820 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
821 * followed by a DB sub */
823 #define SU_SKIP_DB(C) \
826 PERL_CONTEXT *base = cxstack; \
827 PERL_CONTEXT *cx = base + (C); \
828 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
830 if (cx >= base && (C) > skipped) { \
831 switch (CxTYPE(cx)) { \
833 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
834 (C) -= skipped + 1; \
842 #define SU_GET_CONTEXT(A, B) \
851 else if (cxix > cxstack_ix) \
861 #define SU_GET_LEVEL(A, B) \
874 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
876 XS(XS_Scope__Upper_unwind) {
885 PERL_UNUSED_VAR(cv); /* -W */
886 PERL_UNUSED_VAR(ax); /* -Wall */
888 SU_GET_CONTEXT(0, items - 1);
890 PERL_CONTEXT *cx = cxstack + cxix;
891 switch (CxTYPE(cx)) {
893 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
898 MY_CXT.items = items;
899 /* pp_entersub will want to sanitize the stack after returning from there
900 * Screw that, we're insane */
901 if (GIMME_V == G_SCALAR) {
902 MY_CXT.savesp = PL_stack_sp;
903 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
904 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
906 MY_CXT.savesp = NULL;
908 SAVEDESTRUCTOR_X(su_unwind, NULL);
913 } while (--cxix >= 0);
914 croak("Can't return outside a subroutine");
917 MODULE = Scope::Upper PACKAGE = Scope::Upper
927 MY_CXT.stack_placeholder = NULL;
929 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
930 Zero(&(MY_CXT.return_op), 1, sizeof(MY_CXT.return_op));
931 MY_CXT.return_op.op_type = OP_RETURN;
932 MY_CXT.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
934 Zero(&(MY_CXT.proxy_op), 1, sizeof(MY_CXT.proxy_op));
935 MY_CXT.proxy_op.op_type = OP_STUB;
936 MY_CXT.proxy_op.op_ppaddr = NULL;
938 stash = gv_stashpv(__PACKAGE__, 1);
939 newCONSTSUB(stash, "TOP", newSViv(0));
940 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
942 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
956 #endif /* SU_THREADSAFE */
962 I32 cxix = cxstack_ix;
966 RETVAL = newSViv(cxix);
976 SU_GET_CONTEXT(0, 0);
981 RETVAL = newSViv(cxix);
991 SU_GET_CONTEXT(0, 0);
992 for (; cxix >= 0; --cxix) {
993 PERL_CONTEXT *cx = cxstack + cxix;
994 switch (CxTYPE(cx)) {
998 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1000 ST(0) = sv_2mortal(newSViv(cxix));
1012 SU_GET_CONTEXT(0, 0);
1013 for (; cxix >= 0; --cxix) {
1014 PERL_CONTEXT *cx = cxstack + cxix;
1015 switch (CxTYPE(cx)) {
1019 ST(0) = sv_2mortal(newSViv(cxix));
1046 ST(0) = sv_2mortal(newSViv(cxix));
1056 for (cxix = cxstack_ix; cxix > 0; --cxix) {
1057 PERL_CONTEXT *cx = cxstack + cxix;
1058 switch (CxTYPE(cx)) {
1060 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1070 ST(0) = sv_2mortal(newSViv(cxix));
1079 SU_GET_CONTEXT(0, 0);
1081 PERL_CONTEXT *cx = cxstack + cxix--;
1082 switch (CxTYPE(cx)) {
1086 I32 gimme = cx->blk_gimme;
1088 case G_VOID: XSRETURN_UNDEF; break;
1089 case G_SCALAR: XSRETURN_NO; break;
1090 case G_ARRAY: XSRETURN_YES; break;
1105 SU_GET_CONTEXT(1, 1);
1106 Newx(ud, 1, su_ud_reap);
1107 SU_UD_ORIGIN(ud) = NULL;
1108 SU_UD_HANDLER(ud) = su_reap;
1109 ud->cb = newSVsv(hook);
1110 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1113 localize(SV *sv, SV *val, ...)
1120 SU_GET_CONTEXT(2, 2);
1121 Newx(ud, 1, su_ud_localize);
1122 SU_UD_ORIGIN(ud) = NULL;
1123 SU_UD_HANDLER(ud) = su_localize;
1124 size = su_ud_localize_init(ud, sv, val, NULL);
1125 su_init(ud, cxix, size);
1128 localize_elem(SV *sv, SV *elem, SV *val, ...)
1135 if (SvTYPE(sv) >= SVt_PVGV)
1136 croak("Can't infer the element localization type from a glob and the value");
1137 SU_GET_CONTEXT(3, 3);
1138 Newx(ud, 1, su_ud_localize);
1139 SU_UD_ORIGIN(ud) = NULL;
1140 SU_UD_HANDLER(ud) = su_localize;
1141 size = su_ud_localize_init(ud, sv, val, elem);
1142 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
1143 SU_UD_LOCALIZE_FREE(ud);
1144 croak("Can't localize an element of something that isn't an array or a hash");
1146 su_init(ud, cxix, size);
1149 localize_delete(SV *sv, SV *elem, ...)
1156 SU_GET_CONTEXT(2, 2);
1157 Newx(ud, 1, su_ud_localize);
1158 SU_UD_ORIGIN(ud) = NULL;
1159 SU_UD_HANDLER(ud) = su_localize;
1160 size = su_ud_localize_init(ud, sv, NULL, elem);
1161 su_init(ud, cxix, size);