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
171 # define SU_SAVE_GP_SIZE 4
174 #ifndef SvCANEXISTDELETE
175 # define SvCANEXISTDELETE(sv) \
177 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
178 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
179 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
180 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
185 /* ... Saving array elements ............................................... */
187 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
188 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
194 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
195 #if SU_HAS_PERL(5, 8, 1)
196 if (SvRMAGICAL(av)) {
197 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
199 SV * const * const negative_indices_glob =
200 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
201 NEGATIVE_INDICES_VAR, 16, 0);
202 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
208 idx = key + av_len(av) + 1;
222 STATIC void su_adelete(pTHX_ void *ud_) {
223 su_ud_adelete *ud = (su_ud_adelete *) ud_;
225 av_delete(ud->av, ud->idx, G_DISCARD);
226 SvREFCNT_dec(ud->av);
231 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
232 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
235 Newx(ud, 1, su_ud_adelete);
238 SvREFCNT_inc_simple_void(av);
240 SAVEDESTRUCTOR_X(su_adelete, ud);
243 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
245 #endif /* SAVEADELETE */
247 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
248 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
255 idx = su_av_key2idx(av, SvIV(key));
257 if (SvCANEXISTDELETE(av))
258 preeminent = av_exists(av, idx);
260 svp = av_fetch(av, idx, 1);
261 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
264 save_aelem(av, idx, svp);
266 SAVEADELETE(av, idx);
268 if (val) { /* local $x[$idx] = $val; */
269 SvSetMagicSV(*svp, val);
270 } else { /* local $x[$idx]; delete $x[$idx]; */
271 av_delete(av, idx, G_DISCARD);
275 /* ... Saving hash elements ................................................ */
277 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
278 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
285 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
286 preeminent = hv_exists_ent(hv, keysv, 0);
288 he = hv_fetch_ent(hv, keysv, 1, 0);
289 svp = he ? &HeVAL(he) : NULL;
290 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
292 if (HvNAME_get(hv) && isGV(*svp)) {
293 save_gp((GV *) *svp, 0);
298 save_helem(hv, keysv, svp);
301 const char * const key = SvPV_const(keysv, keylen);
302 SAVEDELETE(hv, savepvn(key, keylen),
303 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
306 if (val) { /* local $x{$keysv} = $val; */
307 SvSetMagicSV(*svp, val);
308 } else { /* local $x{$keysv}; delete $x{$keysv}; */
309 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
313 /* --- Actions ------------------------------------------------------------- */
319 void (*handler)(pTHX_ void *);
322 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
323 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
324 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
325 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
327 #define SU_UD_FREE(U) STMT_START { \
328 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
332 /* ... Reap ................................................................ */
339 STATIC void su_call(pTHX_ void *ud_) {
340 su_ud_reap *ud = (su_ud_reap *) ud_;
341 #if SU_HAS_PERL(5, 9, 5)
342 PERL_CONTEXT saved_cx;
349 PerlIO_printf(Perl_debug_log,
350 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
351 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
360 /* If the recently popped context isn't saved there, it will be overwritten by
361 * the sub scope from call_sv, although it's still needed in our caller. */
363 #if SU_HAS_PERL(5, 9, 5)
364 if (cxstack_ix < cxstack_max)
365 cxix = cxstack_ix + 1;
367 cxix = Perl_cxinc(aTHX);
368 saved_cx = cxstack[cxix];
371 call_sv(ud->cb, G_VOID);
373 #if SU_HAS_PERL(5, 9, 5)
374 cxstack[cxix] = saved_cx;
382 SvREFCNT_dec(ud->cb);
386 STATIC void su_reap(pTHX_ void *ud) {
387 #define su_reap(U) su_reap(aTHX_ (U))
389 PerlIO_printf(Perl_debug_log,
390 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
391 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
394 SAVEDESTRUCTOR_X(su_call, ud);
397 /* ... Localize & localize array/hash element .............................. */
407 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
408 SvREFCNT_dec((U)->elem); \
409 SvREFCNT_dec((U)->val); \
410 SvREFCNT_dec((U)->sv); \
414 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
415 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
420 SvREFCNT_inc_simple_void(sv);
422 if (SvTYPE(sv) >= SVt_PVGV) {
423 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
425 } else { /* local *x = \$val; */
426 t = SvTYPE(SvRV(val));
429 } else if (SvROK(sv)) {
430 croak("Invalid %s reference as the localization target",
431 sv_reftype(SvRV(sv), 0));
434 const char *p = SvPV_const(sv, len), *s;
435 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
441 case '$': t = SVt_PV; break;
442 case '@': t = SVt_PVAV; break;
443 case '%': t = SVt_PVHV; break;
444 case '&': t = SVt_PVCV; break;
445 case '*': t = SVt_PVGV; break;
450 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
451 if (SvROK(val) && !sv_isobject(val)) {
452 t = SvTYPE(SvRV(val));
464 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
469 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
474 size = SU_SAVE_GP_SIZE;
478 size = SU_SAVE_SPTR_SIZE;
482 size = SU_SAVE_SCALAR_SIZE;
485 /* When deref is set, val isn't NULL */
488 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
489 ud->elem = SvREFCNT_inc(elem);
495 STATIC void su_localize(pTHX_ void *ud_) {
496 #define su_localize(U) su_localize(aTHX_ (U))
497 su_ud_localize *ud = (su_ud_localize *) ud_;
504 if (SvTYPE(sv) >= SVt_PVGV) {
508 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
511 const char *name = SvPV_const(sv, len);
512 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
519 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
520 PerlIO_printf(Perl_debug_log,
521 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
522 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
526 /* Inspired from Alias.pm */
530 su_save_aelem(GvAV(gv), elem, val);
537 su_save_helem(GvHV(gv), elem, val);
543 save_gp(gv, 1); /* hide previous entry in symtab */
550 gv = (GV *) save_scalar(gv);
555 SvSetMagicSV((SV *) gv, val);
558 SU_UD_LOCALIZE_FREE(ud);
561 /* --- Pop a context back -------------------------------------------------- */
565 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
567 # define SU_CXNAME "XXX"
571 STATIC void su_pop(pTHX_ void *ud) {
572 #define su_pop(U) su_pop(aTHX_ (U))
573 I32 depth, base, mark, *origin;
574 depth = SU_UD_DEPTH(ud);
577 PerlIO_printf(Perl_debug_log,
579 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
581 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
584 origin = SU_UD_ORIGIN(ud);
585 mark = origin[depth];
586 base = origin[depth - 1];
588 SU_D(PerlIO_printf(Perl_debug_log,
589 "%p: original scope was %*c top=%2d base=%2d\n",
590 ud, 24, ' ', mark, base));
593 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
594 PL_savestack_ix = mark;
597 PL_savestack_ix = base;
599 SU_UD_DEPTH(ud) = --depth;
604 if ((pad = SU_UD_PAD(ud))) {
607 SU_D(PerlIO_printf(Perl_debug_log,
608 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
609 ud, depth, PL_scopestack_ix, PL_savestack_ix));
610 SU_SAVE_PLACEHOLDER();
614 SU_D(PerlIO_printf(Perl_debug_log,
615 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
616 ud, depth, PL_scopestack_ix, PL_savestack_ix));
617 SAVEDESTRUCTOR_X(su_pop, ud);
619 SU_UD_HANDLER(ud)(aTHX_ ud);
622 SU_D(PerlIO_printf(Perl_debug_log,
623 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
624 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
627 /* --- Initialize the stack and the action userdata ------------------------ */
629 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
630 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
631 I32 i, depth = 1, pad, offset, *origin;
633 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
635 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
638 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
639 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
640 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
643 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
645 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
646 ud, size, pad, offset));
648 for (i = cxstack_ix; i > cxix; --i) {
649 PERL_CONTEXT *cx = cxstack + i;
650 switch (CxTYPE(cx)) {
651 #if SU_HAS_PERL(5, 10, 0)
653 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
654 /* Given and when blocks are actually followed by a simple block, so skip
656 if (cxix > 0) { /* Implies i > 0 */
657 PERL_CONTEXT *next = cx - 1;
658 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
664 #if SU_HAS_PERL(5, 11, 0)
667 case CXt_LOOP_LAZYSV:
668 case CXt_LOOP_LAZYIV:
672 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
676 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
681 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
683 Newx(origin, depth + 1, I32);
684 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
685 PL_scopestack[PL_scopestack_ix - depth] += size;
686 for (i = depth - 1; i >= 1; --i) {
687 I32 j = PL_scopestack_ix - i;
688 origin[depth - i] = PL_scopestack[j];
689 PL_scopestack[j] += offset;
691 origin[depth] = PL_savestack_ix;
693 SU_UD_ORIGIN(ud) = origin;
694 SU_UD_DEPTH(ud) = depth;
697 /* Make sure the first destructor fires by pushing enough fake slots on the
699 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
700 <= PL_scopestack[PL_scopestack_ix - 1]) {
703 SU_D(PerlIO_printf(Perl_debug_log,
704 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
705 ud, PL_scopestack_ix, PL_savestack_ix));
706 SU_SAVE_PLACEHOLDER();
707 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
708 <= PL_scopestack[PL_scopestack_ix - 1]);
710 SU_D(PerlIO_printf(Perl_debug_log,
711 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
712 ud, PL_scopestack_ix, PL_savestack_ix));
713 SAVEDESTRUCTOR_X(su_pop, ud);
716 for (i = 0; i <= depth; ++i) {
717 I32 j = PL_scopestack_ix - i;
718 PerlIO_printf(Perl_debug_log,
719 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
720 ud, i, j, origin[depth - i],
721 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
728 /* --- Unwind stack -------------------------------------------------------- */
730 STATIC void su_unwind(pTHX_ void *ud_) {
732 I32 cxix = MY_CXT.cxix;
733 I32 items = MY_CXT.items - 1;
734 SV **savesp = MY_CXT.savesp;
737 PERL_UNUSED_VAR(ud_);
740 PL_stack_sp = savesp;
742 if (cxstack_ix > cxix)
749 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
750 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
754 PerlIO_printf(Perl_debug_log,
755 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
757 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
758 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
761 PL_op = (OP *) &(MY_CXT.return_op);
762 PL_op = PL_op->op_ppaddr(aTHX);
764 *PL_markstack_ptr = mark;
766 MY_CXT.proxy_op.op_next = PL_op;
767 PL_op = &(MY_CXT.proxy_op);
770 /* --- XS ------------------------------------------------------------------ */
772 #if SU_HAS_PERL(5, 8, 9)
773 # define SU_SKIP_DB_MAX 2
775 # define SU_SKIP_DB_MAX 3
778 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
779 * followed by a DB sub */
781 #define SU_SKIP_DB(C) \
784 PERL_CONTEXT *base = cxstack; \
785 PERL_CONTEXT *cx = base + (C); \
786 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
788 if (cx >= base && (C) > skipped) { \
789 switch (CxTYPE(cx)) { \
791 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
792 (C) -= skipped + 1; \
800 #define SU_GET_CONTEXT(A, B) \
809 else if (cxix > cxstack_ix) \
819 #define SU_GET_LEVEL(A, B) \
832 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
834 XS(XS_Scope__Upper_unwind) {
843 PERL_UNUSED_VAR(cv); /* -W */
844 PERL_UNUSED_VAR(ax); /* -Wall */
846 SU_GET_CONTEXT(0, items - 1);
848 PERL_CONTEXT *cx = cxstack + cxix;
849 switch (CxTYPE(cx)) {
851 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
856 MY_CXT.items = items;
857 /* pp_entersub will want to sanitize the stack after returning from there
858 * Screw that, we're insane */
859 if (GIMME_V == G_SCALAR) {
860 MY_CXT.savesp = PL_stack_sp;
861 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
862 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
864 MY_CXT.savesp = NULL;
866 SAVEDESTRUCTOR_X(su_unwind, NULL);
871 } while (--cxix >= 0);
872 croak("Can't return outside a subroutine");
875 MODULE = Scope::Upper PACKAGE = Scope::Upper
885 MY_CXT.stack_placeholder = NULL;
887 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
888 Zero(&(MY_CXT.return_op), 1, sizeof(MY_CXT.return_op));
889 MY_CXT.return_op.op_type = OP_RETURN;
890 MY_CXT.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
892 Zero(&(MY_CXT.proxy_op), 1, sizeof(MY_CXT.proxy_op));
893 MY_CXT.proxy_op.op_type = OP_STUB;
894 MY_CXT.proxy_op.op_ppaddr = NULL;
896 stash = gv_stashpv(__PACKAGE__, 1);
897 newCONSTSUB(stash, "TOP", newSViv(0));
898 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
900 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
914 #endif /* SU_THREADSAFE */
920 I32 cxix = cxstack_ix;
924 RETVAL = newSViv(cxix);
934 SU_GET_CONTEXT(0, 0);
939 RETVAL = newSViv(cxix);
949 SU_GET_CONTEXT(0, 0);
950 for (; cxix >= 0; --cxix) {
951 PERL_CONTEXT *cx = cxstack + cxix;
952 switch (CxTYPE(cx)) {
956 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
958 ST(0) = sv_2mortal(newSViv(cxix));
970 SU_GET_CONTEXT(0, 0);
971 for (; cxix >= 0; --cxix) {
972 PERL_CONTEXT *cx = cxstack + cxix;
973 switch (CxTYPE(cx)) {
977 ST(0) = sv_2mortal(newSViv(cxix));
1004 ST(0) = sv_2mortal(newSViv(cxix));
1014 for (cxix = cxstack_ix; cxix > 0; --cxix) {
1015 PERL_CONTEXT *cx = cxstack + cxix;
1016 switch (CxTYPE(cx)) {
1018 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1028 ST(0) = sv_2mortal(newSViv(cxix));
1037 SU_GET_CONTEXT(0, 0);
1039 PERL_CONTEXT *cx = cxstack + cxix--;
1040 switch (CxTYPE(cx)) {
1044 I32 gimme = cx->blk_gimme;
1046 case G_VOID: XSRETURN_UNDEF; break;
1047 case G_SCALAR: XSRETURN_NO; break;
1048 case G_ARRAY: XSRETURN_YES; break;
1063 SU_GET_CONTEXT(1, 1);
1064 Newx(ud, 1, su_ud_reap);
1065 SU_UD_ORIGIN(ud) = NULL;
1066 SU_UD_HANDLER(ud) = su_reap;
1067 ud->cb = newSVsv(hook);
1068 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1071 localize(SV *sv, SV *val, ...)
1078 SU_GET_CONTEXT(2, 2);
1079 Newx(ud, 1, su_ud_localize);
1080 SU_UD_ORIGIN(ud) = NULL;
1081 SU_UD_HANDLER(ud) = su_localize;
1082 size = su_ud_localize_init(ud, sv, val, NULL);
1083 su_init(ud, cxix, size);
1086 localize_elem(SV *sv, SV *elem, SV *val, ...)
1093 if (SvTYPE(sv) >= SVt_PVGV)
1094 croak("Can't infer the element localization type from a glob and the value");
1095 SU_GET_CONTEXT(3, 3);
1096 Newx(ud, 1, su_ud_localize);
1097 SU_UD_ORIGIN(ud) = NULL;
1098 SU_UD_HANDLER(ud) = su_localize;
1099 size = su_ud_localize_init(ud, sv, val, elem);
1100 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
1101 SU_UD_LOCALIZE_FREE(ud);
1102 croak("Can't localize an element of something that isn't an array or a hash");
1104 su_init(ud, cxix, size);
1107 localize_delete(SV *sv, SV *elem, ...)
1114 SU_GET_CONTEXT(2, 2);
1115 Newx(ud, 1, su_ud_localize);
1116 SU_UD_ORIGIN(ud) = NULL;
1117 SU_UD_HANDLER(ud) = su_localize;
1118 size = su_ud_localize_init(ud, sv, NULL, elem);
1119 su_init(ud, cxix, size);