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;
132 /* --- Stack manipulations ------------------------------------------------- */
134 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
136 #define SU_SAVE_DESTRUCTOR_SIZE 3
137 #define SU_SAVE_PLACEHOLDER_SIZE 3
139 #define SU_SAVE_SCALAR_SIZE 3
141 #define SU_SAVE_ARY_SIZE 3
142 #define SU_SAVE_AELEM_SIZE 4
144 # define SU_SAVE_ADELETE_SIZE 3
146 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
148 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
149 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
151 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
154 #define SU_SAVE_HASH_SIZE 3
155 #define SU_SAVE_HELEM_SIZE 4
156 #define SU_SAVE_HDELETE_SIZE 4
157 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
158 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
160 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
163 #define SU_SAVE_SPTR_SIZE 3
165 #if !SU_HAS_PERL(5, 8, 9)
166 # define SU_SAVE_GP_SIZE 6
167 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
168 # define SU_SAVE_GP_SIZE 3
170 # define SU_SAVE_GP_SIZE 4
173 #ifndef SvCANEXISTDELETE
174 # define SvCANEXISTDELETE(sv) \
176 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
177 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
178 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
179 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
184 /* ... Saving array elements ............................................... */
186 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
187 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
193 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
194 #if SU_HAS_PERL(5, 8, 1)
195 if (SvRMAGICAL(av)) {
196 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
198 SV * const * const negative_indices_glob =
199 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
200 NEGATIVE_INDICES_VAR, 16, 0);
201 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
207 idx = key + av_len(av) + 1;
221 STATIC void su_adelete(pTHX_ void *ud_) {
222 su_ud_adelete *ud = (su_ud_adelete *) ud_;
224 av_delete(ud->av, ud->idx, G_DISCARD);
225 SvREFCNT_dec(ud->av);
230 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
231 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
234 Newx(ud, 1, su_ud_adelete);
237 SvREFCNT_inc_simple_void(av);
239 SAVEDESTRUCTOR_X(su_adelete, ud);
242 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
244 #endif /* SAVEADELETE */
246 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
247 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
254 idx = su_av_key2idx(av, SvIV(key));
256 if (SvCANEXISTDELETE(av))
257 preeminent = av_exists(av, idx);
259 svp = av_fetch(av, idx, 1);
260 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
263 save_aelem(av, idx, svp);
265 SAVEADELETE(av, idx);
267 if (val) { /* local $x[$idx] = $val; */
268 SvSetMagicSV(*svp, val);
269 } else { /* local $x[$idx]; delete $x[$idx]; */
270 av_delete(av, idx, G_DISCARD);
274 /* ... Saving hash elements ................................................ */
276 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
277 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
284 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
285 preeminent = hv_exists_ent(hv, keysv, 0);
287 he = hv_fetch_ent(hv, keysv, 1, 0);
288 svp = he ? &HeVAL(he) : NULL;
289 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
291 if (HvNAME_get(hv) && isGV(*svp)) {
292 save_gp((GV *) *svp, 0);
297 save_helem(hv, keysv, svp);
300 const char * const key = SvPV_const(keysv, keylen);
301 SAVEDELETE(hv, savepvn(key, keylen),
302 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
305 if (val) { /* local $x{$keysv} = $val; */
306 SvSetMagicSV(*svp, val);
307 } else { /* local $x{$keysv}; delete $x{$keysv}; */
308 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
312 /* --- Actions ------------------------------------------------------------- */
318 void (*handler)(pTHX_ void *);
321 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
322 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
323 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
324 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
326 #define SU_UD_FREE(U) STMT_START { \
327 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
331 /* ... Reap ................................................................ */
338 STATIC void su_call(pTHX_ void *ud_) {
339 su_ud_reap *ud = (su_ud_reap *) ud_;
340 #if SU_HAS_PERL(5, 9, 5)
341 PERL_CONTEXT saved_cx;
348 PerlIO_printf(Perl_debug_log,
349 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
350 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
359 /* If the recently popped context isn't saved there, it will be overwritten by
360 * the sub scope from call_sv, although it's still needed in our caller. */
362 #if SU_HAS_PERL(5, 9, 5)
363 if (cxstack_ix < cxstack_max)
364 cxix = cxstack_ix + 1;
366 cxix = Perl_cxinc(aTHX);
367 saved_cx = cxstack[cxix];
370 call_sv(ud->cb, G_VOID);
372 #if SU_HAS_PERL(5, 9, 5)
373 cxstack[cxix] = saved_cx;
381 SvREFCNT_dec(ud->cb);
385 STATIC void su_reap(pTHX_ void *ud) {
386 #define su_reap(U) su_reap(aTHX_ (U))
388 PerlIO_printf(Perl_debug_log,
389 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
390 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
393 SAVEDESTRUCTOR_X(su_call, ud);
396 /* ... Localize & localize array/hash element .............................. */
406 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
407 SvREFCNT_dec((U)->elem); \
408 SvREFCNT_dec((U)->val); \
409 SvREFCNT_dec((U)->sv); \
413 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
414 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
419 SvREFCNT_inc_simple_void(sv);
421 if (SvTYPE(sv) >= SVt_PVGV) {
422 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
424 } else { /* local *x = \$val; */
425 t = SvTYPE(SvRV(val));
428 } else if (SvROK(sv)) {
429 croak("Invalid %s reference as the localization target",
430 sv_reftype(SvRV(sv), 0));
433 const char *p = SvPV_const(sv, len), *s;
434 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
440 case '$': t = SVt_PV; break;
441 case '@': t = SVt_PVAV; break;
442 case '%': t = SVt_PVHV; break;
443 case '&': t = SVt_PVCV; break;
444 case '*': t = SVt_PVGV; break;
449 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
450 if (SvROK(val) && !sv_isobject(val)) {
451 t = SvTYPE(SvRV(val));
463 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
468 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
473 size = SU_SAVE_GP_SIZE;
477 size = SU_SAVE_SPTR_SIZE;
481 size = SU_SAVE_SCALAR_SIZE;
484 /* When deref is set, val isn't NULL */
487 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
488 ud->elem = SvREFCNT_inc(elem);
494 STATIC void su_localize(pTHX_ void *ud_) {
495 #define su_localize(U) su_localize(aTHX_ (U))
496 su_ud_localize *ud = (su_ud_localize *) ud_;
503 if (SvTYPE(sv) >= SVt_PVGV) {
507 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
510 const char *name = SvPV_const(sv, len);
511 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
518 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
519 PerlIO_printf(Perl_debug_log,
520 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
521 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
525 /* Inspired from Alias.pm */
529 su_save_aelem(GvAV(gv), elem, val);
536 su_save_helem(GvHV(gv), elem, val);
542 save_gp(gv, 1); /* hide previous entry in symtab */
549 gv = (GV *) save_scalar(gv);
554 SvSetMagicSV((SV *) gv, val);
557 SU_UD_LOCALIZE_FREE(ud);
560 /* --- Pop a context back -------------------------------------------------- */
564 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
566 # define SU_CXNAME "XXX"
570 STATIC void su_pop(pTHX_ void *ud) {
571 #define su_pop(U) su_pop(aTHX_ (U))
572 I32 depth, base, mark, *origin;
573 depth = SU_UD_DEPTH(ud);
576 PerlIO_printf(Perl_debug_log,
578 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
580 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
583 origin = SU_UD_ORIGIN(ud);
584 mark = origin[depth];
585 base = origin[depth - 1];
587 SU_D(PerlIO_printf(Perl_debug_log,
588 "%p: original scope was %*c top=%2d base=%2d\n",
589 ud, 24, ' ', mark, base));
592 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
593 PL_savestack_ix = mark;
596 PL_savestack_ix = base;
598 SU_UD_DEPTH(ud) = --depth;
603 if ((pad = SU_UD_PAD(ud))) {
606 SU_D(PerlIO_printf(Perl_debug_log,
607 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
608 ud, depth, PL_scopestack_ix, PL_savestack_ix));
609 SU_SAVE_PLACEHOLDER();
613 SU_D(PerlIO_printf(Perl_debug_log,
614 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
615 ud, depth, PL_scopestack_ix, PL_savestack_ix));
616 SAVEDESTRUCTOR_X(su_pop, ud);
618 SU_UD_HANDLER(ud)(aTHX_ ud);
621 SU_D(PerlIO_printf(Perl_debug_log,
622 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
623 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
626 /* --- Initialize the stack and the action userdata ------------------------ */
628 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
629 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
630 I32 i, depth = 1, pad, offset, *origin;
632 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
634 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
637 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
638 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
639 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
642 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
644 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
645 ud, size, pad, offset));
647 for (i = cxstack_ix; i > cxix; --i) {
648 PERL_CONTEXT *cx = cxstack + i;
649 switch (CxTYPE(cx)) {
650 #if SU_HAS_PERL(5, 10, 0)
652 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
653 /* Given and when blocks are actually followed by a simple block, so skip
655 if (cxix > 0) { /* Implies i > 0 */
656 PERL_CONTEXT *next = cx - 1;
657 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
663 #if SU_HAS_PERL(5, 11, 0)
666 case CXt_LOOP_LAZYSV:
667 case CXt_LOOP_LAZYIV:
671 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
675 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
680 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
682 Newx(origin, depth + 1, I32);
683 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
684 PL_scopestack[PL_scopestack_ix - depth] += size;
685 for (i = depth - 1; i >= 1; --i) {
686 I32 j = PL_scopestack_ix - i;
687 origin[depth - i] = PL_scopestack[j];
688 PL_scopestack[j] += offset;
690 origin[depth] = PL_savestack_ix;
692 SU_UD_ORIGIN(ud) = origin;
693 SU_UD_DEPTH(ud) = depth;
696 /* Make sure the first destructor fires by pushing enough fake slots on the
698 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
699 <= PL_scopestack[PL_scopestack_ix - 1]) {
702 SU_D(PerlIO_printf(Perl_debug_log,
703 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
704 ud, PL_scopestack_ix, PL_savestack_ix));
705 SU_SAVE_PLACEHOLDER();
706 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
707 <= PL_scopestack[PL_scopestack_ix - 1]);
709 SU_D(PerlIO_printf(Perl_debug_log,
710 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
711 ud, PL_scopestack_ix, PL_savestack_ix));
712 SAVEDESTRUCTOR_X(su_pop, ud);
715 for (i = 0; i <= depth; ++i) {
716 I32 j = PL_scopestack_ix - i;
717 PerlIO_printf(Perl_debug_log,
718 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
719 ud, i, j, origin[depth - i],
720 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
727 /* --- Unwind stack -------------------------------------------------------- */
729 STATIC void su_unwind(pTHX_ void *ud_) {
731 I32 cxix = MY_CXT.cxix;
732 I32 items = MY_CXT.items - 1;
733 SV **savesp = MY_CXT.savesp;
736 PERL_UNUSED_VAR(ud_);
739 PL_stack_sp = savesp;
741 if (cxstack_ix > cxix)
748 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
749 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
753 PerlIO_printf(Perl_debug_log,
754 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
756 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
757 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
760 PL_op = PL_ppaddr[OP_RETURN](aTHX);
761 *PL_markstack_ptr = mark;
763 MY_CXT.fakeop.op_next = PL_op;
764 PL_op = &(MY_CXT.fakeop);
767 /* --- XS ------------------------------------------------------------------ */
769 #if SU_HAS_PERL(5, 8, 9)
770 # define SU_SKIP_DB_MAX 2
772 # define SU_SKIP_DB_MAX 3
775 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
776 * followed by a DB sub */
778 #define SU_SKIP_DB(C) \
781 PERL_CONTEXT *base = cxstack; \
782 PERL_CONTEXT *cx = base + (C); \
783 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
785 if (cx >= base && (C) > skipped) { \
786 switch (CxTYPE(cx)) { \
788 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
789 (C) -= skipped + 1; \
797 #define SU_GET_CONTEXT(A, B) \
806 else if (cxix > cxstack_ix) \
816 #define SU_GET_LEVEL(A, B) \
829 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
831 XS(XS_Scope__Upper_unwind) {
840 PERL_UNUSED_VAR(cv); /* -W */
841 PERL_UNUSED_VAR(ax); /* -Wall */
843 SU_GET_CONTEXT(0, items - 1);
845 PERL_CONTEXT *cx = cxstack + cxix;
846 switch (CxTYPE(cx)) {
848 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
853 MY_CXT.items = items;
854 /* pp_entersub will want to sanitize the stack after returning from there
855 * Screw that, we're insane */
856 if (GIMME_V == G_SCALAR) {
857 MY_CXT.savesp = PL_stack_sp;
858 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
859 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
861 MY_CXT.savesp = NULL;
863 SAVEDESTRUCTOR_X(su_unwind, NULL);
868 } while (--cxix >= 0);
869 croak("Can't return outside a subroutine");
872 MODULE = Scope::Upper PACKAGE = Scope::Upper
881 MY_CXT.stack_placeholder = NULL;
883 stash = gv_stashpv(__PACKAGE__, 1);
884 newCONSTSUB(stash, "TOP", newSViv(0));
885 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
887 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
901 #endif /* SU_THREADSAFE */
907 I32 cxix = cxstack_ix;
911 RETVAL = newSViv(cxix);
921 SU_GET_CONTEXT(0, 0);
926 RETVAL = newSViv(cxix);
936 SU_GET_CONTEXT(0, 0);
937 for (; cxix >= 0; --cxix) {
938 PERL_CONTEXT *cx = cxstack + cxix;
939 switch (CxTYPE(cx)) {
943 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
945 ST(0) = sv_2mortal(newSViv(cxix));
957 SU_GET_CONTEXT(0, 0);
958 for (; cxix >= 0; --cxix) {
959 PERL_CONTEXT *cx = cxstack + cxix;
960 switch (CxTYPE(cx)) {
964 ST(0) = sv_2mortal(newSViv(cxix));
991 ST(0) = sv_2mortal(newSViv(cxix));
1001 for (cxix = cxstack_ix; cxix > 0; --cxix) {
1002 PERL_CONTEXT *cx = cxstack + cxix;
1003 switch (CxTYPE(cx)) {
1005 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1015 ST(0) = sv_2mortal(newSViv(cxix));
1024 SU_GET_CONTEXT(0, 0);
1026 PERL_CONTEXT *cx = cxstack + cxix--;
1027 switch (CxTYPE(cx)) {
1031 I32 gimme = cx->blk_gimme;
1033 case G_VOID: XSRETURN_UNDEF; break;
1034 case G_SCALAR: XSRETURN_NO; break;
1035 case G_ARRAY: XSRETURN_YES; break;
1050 SU_GET_CONTEXT(1, 1);
1051 Newx(ud, 1, su_ud_reap);
1052 SU_UD_ORIGIN(ud) = NULL;
1053 SU_UD_HANDLER(ud) = su_reap;
1054 ud->cb = newSVsv(hook);
1055 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1058 localize(SV *sv, SV *val, ...)
1065 SU_GET_CONTEXT(2, 2);
1066 Newx(ud, 1, su_ud_localize);
1067 SU_UD_ORIGIN(ud) = NULL;
1068 SU_UD_HANDLER(ud) = su_localize;
1069 size = su_ud_localize_init(ud, sv, val, NULL);
1070 su_init(ud, cxix, size);
1073 localize_elem(SV *sv, SV *elem, SV *val, ...)
1080 if (SvTYPE(sv) >= SVt_PVGV)
1081 croak("Can't infer the element localization type from a glob and the value");
1082 SU_GET_CONTEXT(3, 3);
1083 Newx(ud, 1, su_ud_localize);
1084 SU_UD_ORIGIN(ud) = NULL;
1085 SU_UD_HANDLER(ud) = su_localize;
1086 size = su_ud_localize_init(ud, sv, val, elem);
1087 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
1088 SU_UD_LOCALIZE_FREE(ud);
1089 croak("Can't localize an element of something that isn't an array or a hash");
1091 su_init(ud, cxix, size);
1094 localize_delete(SV *sv, SV *elem, ...)
1101 SU_GET_CONTEXT(2, 2);
1102 Newx(ud, 1, su_ud_localize);
1103 SU_UD_ORIGIN(ud) = NULL;
1104 SU_UD_HANDLER(ud) = su_localize;
1105 size = su_ud_localize_init(ud, sv, NULL, elem);
1106 su_init(ud, cxix, size);