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 HvNAME_get(H) HvNAME(H)
55 #ifndef gv_fetchpvn_flags
56 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
59 #ifndef PERL_MAGIC_tied
60 # define PERL_MAGIC_tied 'P'
63 #ifndef PERL_MAGIC_env
64 # define PERL_MAGIC_env 'E'
67 #ifndef NEGATIVE_INDICES_VAR
68 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
71 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
72 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
74 /* --- Threads and multiplicity -------------------------------------------- */
84 #ifndef SU_MULTIPLICITY
85 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
86 # define SU_MULTIPLICITY 1
88 # define SU_MULTIPLICITY 0
91 #if SU_MULTIPLICITY && !defined(tTHX)
92 # define tTHX PerlInterpreter*
95 #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))
96 # define SU_THREADSAFE 1
98 # define MY_CXT_CLONE \
100 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
101 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
102 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
105 # define SU_THREADSAFE 0
107 # define dMY_CXT dNOOP
109 # define MY_CXT su_globaldata
111 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
113 # define MY_CXT_INIT NOOP
115 # define MY_CXT_CLONE NOOP
118 /* --- Global data --------------------------------------------------------- */
120 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
123 char *stack_placeholder;
133 /* --- Stack manipulations ------------------------------------------------- */
135 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
137 #define SU_SAVE_DESTRUCTOR_SIZE 3
138 #define SU_SAVE_PLACEHOLDER_SIZE 3
140 #define SU_SAVE_SCALAR_SIZE 3
142 #define SU_SAVE_ARY_SIZE 3
143 #define SU_SAVE_AELEM_SIZE 4
145 # define SU_SAVE_ADELETE_SIZE 3
147 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
149 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
150 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
152 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
155 #define SU_SAVE_HASH_SIZE 3
156 #define SU_SAVE_HELEM_SIZE 4
157 #define SU_SAVE_HDELETE_SIZE 4
158 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
159 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
161 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
164 #define SU_SAVE_SPTR_SIZE 3
166 #if !SU_HAS_PERL(5, 8, 9)
167 # define SU_SAVE_GP_SIZE 6
168 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
169 # define SU_SAVE_GP_SIZE 3
170 #elif !SU_HAS_PERL(5, 13, 8)
171 # define SU_SAVE_GP_SIZE 4
173 # define SU_SAVE_GP_SIZE 3
176 #ifndef SvCANEXISTDELETE
177 # define SvCANEXISTDELETE(sv) \
179 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
180 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
181 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
182 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
187 /* ... Saving array elements ............................................... */
189 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
190 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
196 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
197 #if SU_HAS_PERL(5, 8, 1)
198 if (SvRMAGICAL(av)) {
199 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
201 SV * const * const negative_indices_glob =
202 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
203 NEGATIVE_INDICES_VAR, 16, 0);
204 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
210 idx = key + av_len(av) + 1;
224 STATIC void su_adelete(pTHX_ void *ud_) {
225 su_ud_adelete *ud = (su_ud_adelete *) ud_;
227 av_delete(ud->av, ud->idx, G_DISCARD);
228 SvREFCNT_dec(ud->av);
233 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
234 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
237 Newx(ud, 1, su_ud_adelete);
240 SvREFCNT_inc_simple_void(av);
242 SAVEDESTRUCTOR_X(su_adelete, ud);
245 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
247 #endif /* SAVEADELETE */
249 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
250 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
257 idx = su_av_key2idx(av, SvIV(key));
259 if (SvCANEXISTDELETE(av))
260 preeminent = av_exists(av, idx);
262 svp = av_fetch(av, idx, 1);
263 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
266 save_aelem(av, idx, svp);
268 SAVEADELETE(av, idx);
270 if (val) { /* local $x[$idx] = $val; */
271 SvSetMagicSV(*svp, val);
272 } else { /* local $x[$idx]; delete $x[$idx]; */
273 av_delete(av, idx, G_DISCARD);
277 /* ... Saving hash elements ................................................ */
279 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
280 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
287 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
288 preeminent = hv_exists_ent(hv, keysv, 0);
290 he = hv_fetch_ent(hv, keysv, 1, 0);
291 svp = he ? &HeVAL(he) : NULL;
292 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
294 if (HvNAME_get(hv) && isGV(*svp)) {
295 save_gp((GV *) *svp, 0);
300 save_helem(hv, keysv, svp);
303 const char * const key = SvPV_const(keysv, keylen);
304 SAVEDELETE(hv, savepvn(key, keylen),
305 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
308 if (val) { /* local $x{$keysv} = $val; */
309 SvSetMagicSV(*svp, val);
310 } else { /* local $x{$keysv}; delete $x{$keysv}; */
311 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
315 /* --- Actions ------------------------------------------------------------- */
321 void (*handler)(pTHX_ void *);
324 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
325 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
326 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
327 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
329 #define SU_UD_FREE(U) STMT_START { \
330 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
334 /* ... Reap ................................................................ */
341 STATIC void su_call(pTHX_ void *ud_) {
342 su_ud_reap *ud = (su_ud_reap *) ud_;
343 #if SU_HAS_PERL(5, 9, 5)
344 PERL_CONTEXT saved_cx;
351 PerlIO_printf(Perl_debug_log,
352 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
353 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
362 /* If the recently popped context isn't saved there, it will be overwritten by
363 * the sub scope from call_sv, although it's still needed in our caller. */
365 #if SU_HAS_PERL(5, 9, 5)
366 if (cxstack_ix < cxstack_max)
367 cxix = cxstack_ix + 1;
369 cxix = Perl_cxinc(aTHX);
370 saved_cx = cxstack[cxix];
373 call_sv(ud->cb, G_VOID);
375 #if SU_HAS_PERL(5, 9, 5)
376 cxstack[cxix] = saved_cx;
384 SvREFCNT_dec(ud->cb);
388 STATIC void su_reap(pTHX_ void *ud) {
389 #define su_reap(U) su_reap(aTHX_ (U))
391 PerlIO_printf(Perl_debug_log,
392 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
393 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
396 SAVEDESTRUCTOR_X(su_call, ud);
399 /* ... Localize & localize array/hash element .............................. */
409 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
410 SvREFCNT_dec((U)->elem); \
411 SvREFCNT_dec((U)->val); \
412 SvREFCNT_dec((U)->sv); \
416 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
417 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
422 SvREFCNT_inc_simple_void(sv);
424 if (SvTYPE(sv) >= SVt_PVGV) {
425 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
427 } else { /* local *x = \$val; */
428 t = SvTYPE(SvRV(val));
431 } else if (SvROK(sv)) {
432 croak("Invalid %s reference as the localization target",
433 sv_reftype(SvRV(sv), 0));
436 const char *p = SvPV_const(sv, len), *s;
437 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
443 case '$': t = SVt_PV; break;
444 case '@': t = SVt_PVAV; break;
445 case '%': t = SVt_PVHV; break;
446 case '&': t = SVt_PVCV; break;
447 case '*': t = SVt_PVGV; break;
452 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
453 if (SvROK(val) && !sv_isobject(val)) {
454 t = SvTYPE(SvRV(val));
466 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
471 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
476 size = SU_SAVE_GP_SIZE;
480 size = SU_SAVE_SPTR_SIZE;
484 size = SU_SAVE_SCALAR_SIZE;
487 /* When deref is set, val isn't NULL */
490 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
491 ud->elem = SvREFCNT_inc(elem);
497 STATIC void su_localize(pTHX_ void *ud_) {
498 #define su_localize(U) su_localize(aTHX_ (U))
499 su_ud_localize *ud = (su_ud_localize *) ud_;
506 if (SvTYPE(sv) >= SVt_PVGV) {
510 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
513 const char *name = SvPV_const(sv, len);
514 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
521 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
522 PerlIO_printf(Perl_debug_log,
523 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
524 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
528 /* Inspired from Alias.pm */
532 su_save_aelem(GvAV(gv), elem, val);
539 su_save_helem(GvHV(gv), elem, val);
545 save_gp(gv, 1); /* hide previous entry in symtab */
552 gv = (GV *) save_scalar(gv);
557 SvSetMagicSV((SV *) gv, val);
560 SU_UD_LOCALIZE_FREE(ud);
563 /* --- Pop a context back -------------------------------------------------- */
567 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
569 # define SU_CXNAME "XXX"
573 STATIC void su_pop(pTHX_ void *ud) {
574 #define su_pop(U) su_pop(aTHX_ (U))
575 I32 depth, base, mark, *origin;
576 depth = SU_UD_DEPTH(ud);
579 PerlIO_printf(Perl_debug_log,
581 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
583 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
586 origin = SU_UD_ORIGIN(ud);
587 mark = origin[depth];
588 base = origin[depth - 1];
590 SU_D(PerlIO_printf(Perl_debug_log,
591 "%p: original scope was %*c top=%2d base=%2d\n",
592 ud, 24, ' ', mark, base));
595 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
596 PL_savestack_ix = mark;
599 PL_savestack_ix = base;
601 SU_UD_DEPTH(ud) = --depth;
606 if ((pad = SU_UD_PAD(ud))) {
609 SU_D(PerlIO_printf(Perl_debug_log,
610 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
611 ud, depth, PL_scopestack_ix, PL_savestack_ix));
612 SU_SAVE_PLACEHOLDER();
616 SU_D(PerlIO_printf(Perl_debug_log,
617 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
618 ud, depth, PL_scopestack_ix, PL_savestack_ix));
619 SAVEDESTRUCTOR_X(su_pop, ud);
621 SU_UD_HANDLER(ud)(aTHX_ ud);
624 SU_D(PerlIO_printf(Perl_debug_log,
625 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
626 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
629 /* --- Initialize the stack and the action userdata ------------------------ */
631 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
632 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
633 I32 i, depth = 1, pad, offset, *origin;
635 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
637 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
640 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
641 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
642 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
645 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
647 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
648 ud, size, pad, offset));
650 for (i = cxstack_ix; i > cxix; --i) {
651 PERL_CONTEXT *cx = cxstack + i;
652 switch (CxTYPE(cx)) {
653 #if SU_HAS_PERL(5, 10, 0)
655 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
656 /* Given and when blocks are actually followed by a simple block, so skip
658 if (cxix > 0) { /* Implies i > 0 */
659 PERL_CONTEXT *next = cx - 1;
660 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
666 #if SU_HAS_PERL(5, 11, 0)
669 case CXt_LOOP_LAZYSV:
670 case CXt_LOOP_LAZYIV:
674 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
678 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
683 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
685 Newx(origin, depth + 1, I32);
686 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
687 PL_scopestack[PL_scopestack_ix - depth] += size;
688 for (i = depth - 1; i >= 1; --i) {
689 I32 j = PL_scopestack_ix - i;
690 origin[depth - i] = PL_scopestack[j];
691 PL_scopestack[j] += offset;
693 origin[depth] = PL_savestack_ix;
695 SU_UD_ORIGIN(ud) = origin;
696 SU_UD_DEPTH(ud) = depth;
699 /* Make sure the first destructor fires by pushing enough fake slots on the
701 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
702 <= PL_scopestack[PL_scopestack_ix - 1]) {
705 SU_D(PerlIO_printf(Perl_debug_log,
706 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
707 ud, PL_scopestack_ix, PL_savestack_ix));
708 SU_SAVE_PLACEHOLDER();
709 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
710 <= PL_scopestack[PL_scopestack_ix - 1]);
712 SU_D(PerlIO_printf(Perl_debug_log,
713 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
714 ud, PL_scopestack_ix, PL_savestack_ix));
715 SAVEDESTRUCTOR_X(su_pop, ud);
718 for (i = 0; i <= depth; ++i) {
719 I32 j = PL_scopestack_ix - i;
720 PerlIO_printf(Perl_debug_log,
721 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
722 ud, i, j, origin[depth - i],
723 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
730 /* --- Unwind stack -------------------------------------------------------- */
732 STATIC void su_unwind(pTHX_ void *ud_) {
734 I32 cxix = MY_CXT.cxix;
735 I32 items = MY_CXT.items - 1;
736 SV **savesp = MY_CXT.savesp;
739 PERL_UNUSED_VAR(ud_);
742 PL_stack_sp = savesp;
744 if (cxstack_ix > cxix)
751 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
752 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
756 PerlIO_printf(Perl_debug_log,
757 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
759 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
760 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
763 PL_op = (OP *) &(MY_CXT.return_op);
764 PL_op = PL_op->op_ppaddr(aTHX);
766 *PL_markstack_ptr = mark;
768 MY_CXT.proxy_op.op_next = PL_op;
769 PL_op = &(MY_CXT.proxy_op);
772 /* --- XS ------------------------------------------------------------------ */
774 #if SU_HAS_PERL(5, 8, 9)
775 # define SU_SKIP_DB_MAX 2
777 # define SU_SKIP_DB_MAX 3
780 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
781 * followed by a DB sub */
783 #define SU_SKIP_DB(C) \
786 PERL_CONTEXT *base = cxstack; \
787 PERL_CONTEXT *cx = base + (C); \
788 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
790 if (cx >= base && (C) > skipped) { \
791 switch (CxTYPE(cx)) { \
793 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
794 (C) -= skipped + 1; \
802 #define SU_GET_CONTEXT(A, B) \
811 else if (cxix > cxstack_ix) \
821 #define SU_GET_LEVEL(A, B) \
834 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
836 XS(XS_Scope__Upper_unwind) {
845 PERL_UNUSED_VAR(cv); /* -W */
846 PERL_UNUSED_VAR(ax); /* -Wall */
848 SU_GET_CONTEXT(0, items - 1);
850 PERL_CONTEXT *cx = cxstack + cxix;
851 switch (CxTYPE(cx)) {
853 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
858 MY_CXT.items = items;
859 /* pp_entersub will want to sanitize the stack after returning from there
860 * Screw that, we're insane */
861 if (GIMME_V == G_SCALAR) {
862 MY_CXT.savesp = PL_stack_sp;
863 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
864 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
866 MY_CXT.savesp = NULL;
868 SAVEDESTRUCTOR_X(su_unwind, NULL);
873 } while (--cxix >= 0);
874 croak("Can't return outside a subroutine");
877 MODULE = Scope::Upper PACKAGE = Scope::Upper
887 MY_CXT.stack_placeholder = NULL;
889 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
890 Zero(&(MY_CXT.return_op), 1, sizeof(MY_CXT.return_op));
891 MY_CXT.return_op.op_type = OP_RETURN;
892 MY_CXT.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
894 Zero(&(MY_CXT.proxy_op), 1, sizeof(MY_CXT.proxy_op));
895 MY_CXT.proxy_op.op_type = OP_STUB;
896 MY_CXT.proxy_op.op_ppaddr = NULL;
898 stash = gv_stashpv(__PACKAGE__, 1);
899 newCONSTSUB(stash, "TOP", newSViv(0));
900 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
902 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
916 #endif /* SU_THREADSAFE */
922 I32 cxix = cxstack_ix;
926 RETVAL = newSViv(cxix);
936 SU_GET_CONTEXT(0, 0);
941 RETVAL = newSViv(cxix);
951 SU_GET_CONTEXT(0, 0);
952 for (; cxix >= 0; --cxix) {
953 PERL_CONTEXT *cx = cxstack + cxix;
954 switch (CxTYPE(cx)) {
958 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
960 ST(0) = sv_2mortal(newSViv(cxix));
972 SU_GET_CONTEXT(0, 0);
973 for (; cxix >= 0; --cxix) {
974 PERL_CONTEXT *cx = cxstack + cxix;
975 switch (CxTYPE(cx)) {
979 ST(0) = sv_2mortal(newSViv(cxix));
1006 ST(0) = sv_2mortal(newSViv(cxix));
1016 for (cxix = cxstack_ix; cxix > 0; --cxix) {
1017 PERL_CONTEXT *cx = cxstack + cxix;
1018 switch (CxTYPE(cx)) {
1020 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1030 ST(0) = sv_2mortal(newSViv(cxix));
1039 SU_GET_CONTEXT(0, 0);
1041 PERL_CONTEXT *cx = cxstack + cxix--;
1042 switch (CxTYPE(cx)) {
1046 I32 gimme = cx->blk_gimme;
1048 case G_VOID: XSRETURN_UNDEF; break;
1049 case G_SCALAR: XSRETURN_NO; break;
1050 case G_ARRAY: XSRETURN_YES; break;
1065 SU_GET_CONTEXT(1, 1);
1066 Newx(ud, 1, su_ud_reap);
1067 SU_UD_ORIGIN(ud) = NULL;
1068 SU_UD_HANDLER(ud) = su_reap;
1069 ud->cb = newSVsv(hook);
1070 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1073 localize(SV *sv, SV *val, ...)
1080 SU_GET_CONTEXT(2, 2);
1081 Newx(ud, 1, su_ud_localize);
1082 SU_UD_ORIGIN(ud) = NULL;
1083 SU_UD_HANDLER(ud) = su_localize;
1084 size = su_ud_localize_init(ud, sv, val, NULL);
1085 su_init(ud, cxix, size);
1088 localize_elem(SV *sv, SV *elem, SV *val, ...)
1095 if (SvTYPE(sv) >= SVt_PVGV)
1096 croak("Can't infer the element localization type from a glob and the value");
1097 SU_GET_CONTEXT(3, 3);
1098 Newx(ud, 1, su_ud_localize);
1099 SU_UD_ORIGIN(ud) = NULL;
1100 SU_UD_HANDLER(ud) = su_localize;
1101 size = su_ud_localize_init(ud, sv, val, elem);
1102 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
1103 SU_UD_LOCALIZE_FREE(ud);
1104 croak("Can't localize an element of something that isn't an array or a hash");
1106 su_init(ud, cxix, size);
1109 localize_delete(SV *sv, SV *elem, ...)
1116 SU_GET_CONTEXT(2, 2);
1117 Newx(ud, 1, su_ud_localize);
1118 SU_UD_ORIGIN(ud) = NULL;
1119 SU_UD_HANDLER(ud) = su_localize;
1120 size = su_ud_localize_init(ud, sv, NULL, elem);
1121 su_init(ud, cxix, size);