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))))))
73 /* --- Threads and multiplicity -------------------------------------------- */
83 #ifndef SU_MULTIPLICITY
84 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
85 # define SU_MULTIPLICITY 1
87 # define SU_MULTIPLICITY 0
90 #if SU_MULTIPLICITY && !defined(tTHX)
91 # define tTHX PerlInterpreter*
94 #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))
95 # define SU_THREADSAFE 1
97 # define MY_CXT_CLONE \
99 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
100 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
101 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
104 # define SU_THREADSAFE 0
106 # define dMY_CXT dNOOP
108 # define MY_CXT su_globaldata
110 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
112 # define MY_CXT_INIT NOOP
114 # define MY_CXT_CLONE NOOP
117 /* --- Global data --------------------------------------------------------- */
119 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
122 char *stack_placeholder;
131 /* --- Stack manipulations ------------------------------------------------- */
133 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
135 #define SU_SAVE_DESTRUCTOR_SIZE 3
136 #define SU_SAVE_PLACEHOLDER_SIZE 3
138 #define SU_SAVE_SCALAR_SIZE 3
140 #define SU_SAVE_ARY_SIZE 3
141 #define SU_SAVE_AELEM_SIZE 4
143 # define SU_SAVE_ADELETE_SIZE 3
145 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
147 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
148 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
150 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
153 #define SU_SAVE_HASH_SIZE 3
154 #define SU_SAVE_HELEM_SIZE 4
155 #define SU_SAVE_HDELETE_SIZE 4
156 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
157 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
159 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
162 #define SU_SAVE_SPTR_SIZE 3
164 #if !SU_HAS_PERL(5, 8, 9)
165 # define SU_SAVE_GP_SIZE 6
166 #elif !SU_HAS_PERL(5, 13, 0)
167 # define SU_SAVE_GP_SIZE 3
169 # define SU_SAVE_GP_SIZE 4
172 #ifndef SvCANEXISTDELETE
173 # define SvCANEXISTDELETE(sv) \
175 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
176 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
177 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
178 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
183 /* ... Saving array elements ............................................... */
185 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
186 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
192 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
193 #if SU_HAS_PERL(5, 8, 1)
194 if (SvRMAGICAL(av)) {
195 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
197 SV * const * const negative_indices_glob =
198 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
199 NEGATIVE_INDICES_VAR, 16, 0);
200 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
206 idx = key + av_len(av) + 1;
220 STATIC void su_adelete(pTHX_ void *ud_) {
221 su_ud_adelete *ud = (su_ud_adelete *) ud_;
223 av_delete(ud->av, ud->idx, G_DISCARD);
224 SvREFCNT_dec(ud->av);
229 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
230 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
233 Newx(ud, 1, su_ud_adelete);
236 SvREFCNT_inc_simple_void(av);
238 SAVEDESTRUCTOR_X(su_adelete, ud);
241 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
243 #endif /* SAVEADELETE */
245 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
246 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
253 idx = su_av_key2idx(av, SvIV(key));
255 if (SvCANEXISTDELETE(av))
256 preeminent = av_exists(av, idx);
258 svp = av_fetch(av, idx, 1);
259 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
262 save_aelem(av, idx, svp);
264 SAVEADELETE(av, idx);
266 if (val) { /* local $x[$idx] = $val; */
267 SvSetMagicSV(*svp, val);
268 } else { /* local $x[$idx]; delete $x[$idx]; */
269 av_delete(av, idx, G_DISCARD);
273 /* ... Saving hash elements ................................................ */
275 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
276 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
283 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
284 preeminent = hv_exists_ent(hv, keysv, 0);
286 he = hv_fetch_ent(hv, keysv, 1, 0);
287 svp = he ? &HeVAL(he) : NULL;
288 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
290 if (HvNAME_get(hv) && isGV(*svp)) {
291 save_gp((GV *) *svp, 0);
296 save_helem(hv, keysv, svp);
299 const char * const key = SvPV_const(keysv, keylen);
300 SAVEDELETE(hv, savepvn(key, keylen),
301 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
304 if (val) { /* local $x{$keysv} = $val; */
305 SvSetMagicSV(*svp, val);
306 } else { /* local $x{$keysv}; delete $x{$keysv}; */
307 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
311 /* --- Actions ------------------------------------------------------------- */
317 void (*handler)(pTHX_ void *);
320 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
321 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
322 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
323 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
325 #define SU_UD_FREE(U) STMT_START { \
326 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
330 /* ... Reap ................................................................ */
337 STATIC void su_call(pTHX_ void *ud_) {
338 su_ud_reap *ud = (su_ud_reap *) ud_;
339 #if SU_HAS_PERL(5, 9, 5)
340 PERL_CONTEXT saved_cx;
347 PerlIO_printf(Perl_debug_log,
348 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
349 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
358 /* If the recently popped context isn't saved there, it will be overwritten by
359 * the sub scope from call_sv, although it's still needed in our caller. */
361 #if SU_HAS_PERL(5, 9, 5)
362 if (cxstack_ix < cxstack_max)
363 cxix = cxstack_ix + 1;
365 cxix = Perl_cxinc(aTHX);
366 saved_cx = cxstack[cxix];
369 call_sv(ud->cb, G_VOID);
371 #if SU_HAS_PERL(5, 9, 5)
372 cxstack[cxix] = saved_cx;
380 SvREFCNT_dec(ud->cb);
384 STATIC void su_reap(pTHX_ void *ud) {
385 #define su_reap(U) su_reap(aTHX_ (U))
387 PerlIO_printf(Perl_debug_log,
388 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
389 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
392 SAVEDESTRUCTOR_X(su_call, ud);
395 /* ... Localize & localize array/hash element .............................. */
405 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
406 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
411 SvREFCNT_inc_simple_void(sv);
413 if (SvTYPE(sv) >= SVt_PVGV) {
414 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
416 } else { /* local *x = \$val; */
417 t = SvTYPE(SvRV(val));
420 } else if (SvROK(sv)) {
421 croak("Invalid %s reference as the localization target",
422 sv_reftype(SvRV(sv), 0));
425 const char *p = SvPV_const(sv, len), *s;
426 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
432 case '$': t = SVt_PV; break;
433 case '@': t = SVt_PVAV; break;
434 case '%': t = SVt_PVHV; break;
435 case '&': t = SVt_PVCV; break;
436 case '*': t = SVt_PVGV; break;
441 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
442 if (SvROK(val) && !sv_isobject(val)) {
443 t = SvTYPE(SvRV(val));
455 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
460 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
465 size = SU_SAVE_GP_SIZE;
469 size = SU_SAVE_SPTR_SIZE;
473 size = SU_SAVE_SCALAR_SIZE;
476 /* When deref is set, val isn't NULL */
479 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
480 ud->elem = SvREFCNT_inc(elem);
486 STATIC void su_localize(pTHX_ void *ud_) {
487 #define su_localize(U) su_localize(aTHX_ (U))
488 su_ud_localize *ud = (su_ud_localize *) ud_;
495 if (SvTYPE(sv) >= SVt_PVGV) {
499 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
502 const char *name = SvPV_const(sv, len);
503 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
510 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
511 PerlIO_printf(Perl_debug_log,
512 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
513 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
517 /* Inspired from Alias.pm */
521 su_save_aelem(GvAV(gv), elem, val);
528 su_save_helem(GvHV(gv), elem, val);
534 save_gp(gv, 1); /* hide previous entry in symtab */
541 gv = (GV *) save_scalar(gv);
546 SvSetMagicSV((SV *) gv, val);
549 SvREFCNT_dec(ud->elem);
550 SvREFCNT_dec(ud->val);
551 SvREFCNT_dec(ud->sv);
555 /* --- Pop a context back -------------------------------------------------- */
559 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
561 # define SU_CXNAME "XXX"
565 STATIC void su_pop(pTHX_ void *ud) {
566 #define su_pop(U) su_pop(aTHX_ (U))
567 I32 depth, base, mark, *origin;
568 depth = SU_UD_DEPTH(ud);
571 PerlIO_printf(Perl_debug_log,
573 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
575 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
578 origin = SU_UD_ORIGIN(ud);
579 mark = origin[depth];
580 base = origin[depth - 1];
582 SU_D(PerlIO_printf(Perl_debug_log,
583 "%p: original scope was %*c top=%2d base=%2d\n",
584 ud, 24, ' ', mark, base));
587 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
588 PL_savestack_ix = mark;
591 PL_savestack_ix = base;
593 SU_UD_DEPTH(ud) = --depth;
598 if ((pad = SU_UD_PAD(ud))) {
601 SU_D(PerlIO_printf(Perl_debug_log,
602 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
603 ud, depth, PL_scopestack_ix, PL_savestack_ix));
604 SU_SAVE_PLACEHOLDER();
608 SU_D(PerlIO_printf(Perl_debug_log,
609 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
610 ud, depth, PL_scopestack_ix, PL_savestack_ix));
611 SAVEDESTRUCTOR_X(su_pop, ud);
613 SU_UD_HANDLER(ud)(aTHX_ ud);
616 SU_D(PerlIO_printf(Perl_debug_log,
617 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
618 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
621 /* --- Initialize the stack and the action userdata ------------------------ */
623 STATIC I32 su_init(pTHX_ I32 cxix, void *ud, I32 size) {
624 #define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
625 I32 i, depth = 1, pad, offset, *origin;
627 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
629 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
632 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
633 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
634 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
637 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
639 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
640 ud, size, pad, offset));
642 for (i = cxstack_ix; i > cxix; --i) {
643 PERL_CONTEXT *cx = cxstack + i;
644 switch (CxTYPE(cx)) {
645 #if SU_HAS_PERL(5, 10, 0)
647 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
648 /* Given and when blocks are actually followed by a simple block, so skip
650 if (cxix > 0) { /* Implies i > 0 */
651 PERL_CONTEXT *next = cx - 1;
652 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
658 #if SU_HAS_PERL(5, 11, 0)
661 case CXt_LOOP_LAZYSV:
662 case CXt_LOOP_LAZYIV:
666 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
670 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
675 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
677 Newx(origin, depth + 1, I32);
678 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
679 PL_scopestack[PL_scopestack_ix - depth] += size;
680 for (i = depth - 1; i >= 1; --i) {
681 I32 j = PL_scopestack_ix - i;
682 origin[depth - i] = PL_scopestack[j];
683 PL_scopestack[j] += offset;
685 origin[depth] = PL_savestack_ix;
687 SU_UD_ORIGIN(ud) = origin;
688 SU_UD_DEPTH(ud) = depth;
691 /* Make sure the first destructor fires by pushing enough fake slots on the
693 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
694 <= PL_scopestack[PL_scopestack_ix - 1]) {
697 SU_D(PerlIO_printf(Perl_debug_log,
698 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
699 ud, PL_scopestack_ix, PL_savestack_ix));
700 SU_SAVE_PLACEHOLDER();
701 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
702 <= PL_scopestack[PL_scopestack_ix - 1]);
704 SU_D(PerlIO_printf(Perl_debug_log,
705 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
706 ud, PL_scopestack_ix, PL_savestack_ix));
707 SAVEDESTRUCTOR_X(su_pop, ud);
710 for (i = 0; i <= depth; ++i) {
711 I32 j = PL_scopestack_ix - i;
712 PerlIO_printf(Perl_debug_log,
713 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
714 ud, i, j, origin[depth - i],
715 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
722 /* --- Unwind stack -------------------------------------------------------- */
724 STATIC void su_unwind(pTHX_ void *ud_) {
726 I32 cxix = MY_CXT.cxix;
727 I32 items = MY_CXT.items - 1;
728 SV **savesp = MY_CXT.savesp;
731 PERL_UNUSED_VAR(ud_);
734 PL_stack_sp = savesp;
736 if (cxstack_ix > cxix)
743 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
744 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
748 PerlIO_printf(Perl_debug_log,
749 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
751 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
752 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
755 PL_op = PL_ppaddr[OP_RETURN](aTHX);
756 *PL_markstack_ptr = mark;
758 MY_CXT.fakeop.op_next = PL_op;
759 PL_op = &(MY_CXT.fakeop);
762 /* --- XS ------------------------------------------------------------------ */
764 #if SU_HAS_PERL(5, 8, 9)
765 # define SU_SKIP_DB_MAX 2
767 # define SU_SKIP_DB_MAX 3
770 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
771 * followed by a DB sub */
773 #define SU_SKIP_DB(C) \
776 PERL_CONTEXT *base = cxstack; \
777 PERL_CONTEXT *cx = base + (C); \
778 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
780 if (cx >= base && (C) > skipped) { \
781 switch (CxTYPE(cx)) { \
783 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
784 (C) -= skipped + 1; \
792 #define SU_GET_CONTEXT(A, B) \
801 else if (cxix > cxstack_ix) \
811 #define SU_GET_LEVEL(A, B) \
824 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
826 XS(XS_Scope__Upper_unwind) {
835 PERL_UNUSED_VAR(cv); /* -W */
836 PERL_UNUSED_VAR(ax); /* -Wall */
838 SU_GET_CONTEXT(0, items - 1);
840 PERL_CONTEXT *cx = cxstack + cxix;
841 switch (CxTYPE(cx)) {
843 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
848 MY_CXT.items = items;
849 /* pp_entersub will want to sanitize the stack after returning from there
850 * Screw that, we're insane */
851 if (GIMME_V == G_SCALAR) {
852 MY_CXT.savesp = PL_stack_sp;
853 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
854 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
856 MY_CXT.savesp = NULL;
858 SAVEDESTRUCTOR_X(su_unwind, NULL);
863 } while (--cxix >= 0);
864 croak("Can't return outside a subroutine");
867 MODULE = Scope::Upper PACKAGE = Scope::Upper
876 MY_CXT.stack_placeholder = NULL;
878 stash = gv_stashpv(__PACKAGE__, 1);
879 newCONSTSUB(stash, "TOP", newSViv(0));
880 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
882 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
896 #endif /* SU_THREADSAFE */
902 I32 cxix = cxstack_ix;
906 RETVAL = newSViv(cxix);
916 SU_GET_CONTEXT(0, 0);
921 RETVAL = newSViv(cxix);
931 SU_GET_CONTEXT(0, 0);
932 for (; cxix >= 0; --cxix) {
933 PERL_CONTEXT *cx = cxstack + cxix;
934 switch (CxTYPE(cx)) {
938 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
940 ST(0) = sv_2mortal(newSViv(cxix));
952 SU_GET_CONTEXT(0, 0);
953 for (; cxix >= 0; --cxix) {
954 PERL_CONTEXT *cx = cxstack + cxix;
955 switch (CxTYPE(cx)) {
959 ST(0) = sv_2mortal(newSViv(cxix));
986 ST(0) = sv_2mortal(newSViv(cxix));
996 for (cxix = cxstack_ix; cxix > 0; --cxix) {
997 PERL_CONTEXT *cx = cxstack + cxix;
998 switch (CxTYPE(cx)) {
1000 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1010 ST(0) = sv_2mortal(newSViv(cxix));
1019 SU_GET_CONTEXT(0, 0);
1021 PERL_CONTEXT *cx = cxstack + cxix--;
1022 switch (CxTYPE(cx)) {
1026 I32 gimme = cx->blk_gimme;
1028 case G_VOID: XSRETURN_UNDEF; break;
1029 case G_SCALAR: XSRETURN_NO; break;
1030 case G_ARRAY: XSRETURN_YES; break;
1045 SU_GET_CONTEXT(1, 1);
1046 Newx(ud, 1, su_ud_reap);
1047 SU_UD_ORIGIN(ud) = NULL;
1048 SU_UD_HANDLER(ud) = su_reap;
1049 ud->cb = newSVsv(hook);
1050 su_init(cxix, ud, SU_SAVE_DESTRUCTOR_SIZE);
1053 localize(SV *sv, SV *val, ...)
1060 SU_GET_CONTEXT(2, 2);
1061 Newx(ud, 1, su_ud_localize);
1062 SU_UD_ORIGIN(ud) = NULL;
1063 SU_UD_HANDLER(ud) = su_localize;
1064 size = su_ud_localize_init(ud, sv, val, NULL);
1065 su_init(cxix, ud, size);
1068 localize_elem(SV *sv, SV *elem, SV *val, ...)
1075 if (SvTYPE(sv) >= SVt_PVGV)
1076 croak("Can't infer the element localization type from a glob and the value");
1077 SU_GET_CONTEXT(3, 3);
1078 Newx(ud, 1, su_ud_localize);
1079 SU_UD_ORIGIN(ud) = NULL;
1080 SU_UD_HANDLER(ud) = su_localize;
1081 size = su_ud_localize_init(ud, sv, val, elem);
1082 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
1084 croak("Can't localize an element of something that isn't an array or a hash");
1086 su_init(cxix, ud, size);
1089 localize_delete(SV *sv, SV *elem, ...)
1096 SU_GET_CONTEXT(2, 2);
1097 Newx(ud, 1, su_ud_localize);
1098 SU_UD_ORIGIN(ud) = NULL;
1099 SU_UD_HANDLER(ud) = su_localize;
1100 size = su_ud_localize_init(ud, sv, NULL, elem);
1101 su_init(cxix, ud, size);