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 #ifndef SvCANEXISTDELETE
139 # define SvCANEXISTDELETE(sv) \
141 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
142 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
143 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
144 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
149 /* ... Saving array elements ............................................... */
151 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
152 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
158 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
159 #if SU_HAS_PERL(5, 8, 1)
160 if (SvRMAGICAL(av)) {
161 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
163 SV * const * const negative_indices_glob =
164 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
165 NEGATIVE_INDICES_VAR, 16, 0);
166 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
172 idx = key + av_len(av) + 1;
186 STATIC void su_adelete(pTHX_ void *ud_) {
187 su_ud_adelete *ud = (su_ud_adelete *) ud_;
189 av_delete(ud->av, ud->idx, G_DISCARD);
190 SvREFCNT_dec(ud->av);
195 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
196 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
199 Newx(ud, 1, su_ud_adelete);
202 SvREFCNT_inc_simple_void(av);
204 SAVEDESTRUCTOR_X(su_adelete, ud);
207 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
209 #endif /* SAVEADELETE */
211 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
212 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
219 idx = su_av_key2idx(av, SvIV(key));
221 if (SvCANEXISTDELETE(av))
222 preeminent = av_exists(av, idx);
224 svp = av_fetch(av, idx, 1);
225 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
228 save_aelem(av, idx, svp);
230 SAVEADELETE(av, idx);
232 if (val) { /* local $x[$idx] = $val; */
233 SvSetMagicSV(*svp, val);
234 } else { /* local $x[$idx]; delete $x[$idx]; */
235 av_delete(av, idx, G_DISCARD);
239 /* ... Saving hash elements ................................................ */
241 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
242 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
249 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
250 preeminent = hv_exists_ent(hv, keysv, 0);
252 he = hv_fetch_ent(hv, keysv, 1, 0);
253 svp = he ? &HeVAL(he) : NULL;
254 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
256 if (HvNAME_get(hv) && isGV(*svp)) {
257 save_gp((GV *) *svp, 0);
262 save_helem(hv, keysv, svp);
265 const char * const key = SvPV_const(keysv, keylen);
266 SAVEDELETE(hv, savepvn(key, keylen),
267 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
270 if (val) { /* local $x{$keysv} = $val; */
271 SvSetMagicSV(*svp, val);
272 } else { /* local $x{$keysv}; delete $x{$keysv}; */
273 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
277 /* --- Actions ------------------------------------------------------------- */
283 void (*handler)(pTHX_ void *);
286 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
287 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
288 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
289 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
291 #define SU_UD_FREE(U) STMT_START { \
292 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
296 /* ... Reap ................................................................ */
303 STATIC void su_call(pTHX_ void *ud_) {
304 su_ud_reap *ud = (su_ud_reap *) ud_;
305 #if SU_HAS_PERL(5, 9, 5)
306 PERL_CONTEXT saved_cx;
313 PerlIO_printf(Perl_debug_log,
314 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
315 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
324 /* If the recently popped context isn't saved there, it will be overwritten by
325 * the sub scope from call_sv, although it's still needed in our caller. */
327 #if SU_HAS_PERL(5, 9, 5)
328 if (cxstack_ix < cxstack_max)
329 cxix = cxstack_ix + 1;
331 cxix = Perl_cxinc(aTHX);
332 saved_cx = cxstack[cxix];
335 call_sv(ud->cb, G_VOID);
337 #if SU_HAS_PERL(5, 9, 5)
338 cxstack[cxix] = saved_cx;
346 SvREFCNT_dec(ud->cb);
350 STATIC void su_reap(pTHX_ void *ud) {
351 #define su_reap(U) su_reap(aTHX_ (U))
353 PerlIO_printf(Perl_debug_log,
354 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
355 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
358 SAVEDESTRUCTOR_X(su_call, ud);
361 /* ... Localize & localize array/hash element .............................. */
371 STATIC void su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
372 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
376 SvREFCNT_inc_simple_void(sv);
378 if (SvTYPE(sv) >= SVt_PVGV) {
379 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
381 } else { /* local *x = \$val; */
382 t = SvTYPE(SvRV(val));
385 } else if (SvROK(sv)) {
386 croak("Invalid %s reference as the localization target",
387 sv_reftype(SvRV(sv), 0));
390 const char *p = SvPV_const(sv, len), *s;
391 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
397 case '$': t = SVt_PV; break;
398 case '@': t = SVt_PVAV; break;
399 case '%': t = SVt_PVHV; break;
400 case '&': t = SVt_PVCV; break;
401 case '*': t = SVt_PVGV; break;
406 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
407 if (SvROK(val) && !sv_isobject(val)) {
408 t = SvTYPE(SvRV(val));
427 /* When deref is set, val isn't NULL */
430 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
431 ud->elem = SvREFCNT_inc(elem);
435 STATIC void su_localize(pTHX_ void *ud_) {
436 #define su_localize(U) su_localize(aTHX_ (U))
437 su_ud_localize *ud = (su_ud_localize *) ud_;
444 if (SvTYPE(sv) >= SVt_PVGV) {
448 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
451 const char *name = SvPV_const(sv, len);
452 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
459 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
460 PerlIO_printf(Perl_debug_log,
461 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
462 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
466 /* Inspired from Alias.pm */
470 su_save_aelem(GvAV(gv), elem, val);
477 su_save_helem(GvHV(gv), elem, val);
483 save_gp(gv, 1); /* hide previous entry in symtab */
490 gv = (GV *) save_scalar(gv);
495 SvSetMagicSV((SV *) gv, val);
498 SvREFCNT_dec(ud->elem);
499 SvREFCNT_dec(ud->val);
500 SvREFCNT_dec(ud->sv);
504 /* --- Pop a context back -------------------------------------------------- */
508 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
510 # define SU_CXNAME "XXX"
514 STATIC void su_pop(pTHX_ void *ud) {
515 #define su_pop(U) su_pop(aTHX_ (U))
516 I32 depth, base, mark, *origin;
517 depth = SU_UD_DEPTH(ud);
520 PerlIO_printf(Perl_debug_log,
522 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
524 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
527 origin = SU_UD_ORIGIN(ud);
528 mark = origin[depth];
529 base = origin[depth - 1];
531 SU_D(PerlIO_printf(Perl_debug_log,
532 "%p: original scope was %*c top=%2d base=%2d\n",
533 ud, 24, ' ', mark, base));
536 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
537 PL_savestack_ix = mark;
540 PL_savestack_ix = base;
542 SU_UD_DEPTH(ud) = --depth;
547 if ((pad = SU_UD_PAD(ud))) {
550 SU_D(PerlIO_printf(Perl_debug_log,
551 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
552 ud, depth, PL_scopestack_ix, PL_savestack_ix));
553 SU_SAVE_PLACEHOLDER();
557 SU_D(PerlIO_printf(Perl_debug_log,
558 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
559 ud, depth, PL_scopestack_ix, PL_savestack_ix));
560 SAVEDESTRUCTOR_X(su_pop, ud);
562 SU_UD_HANDLER(ud)(aTHX_ ud);
565 SU_D(PerlIO_printf(Perl_debug_log,
566 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
567 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
570 /* --- Initialize the stack and the action userdata ------------------------ */
572 STATIC I32 su_init(pTHX_ I32 cxix, void *ud, I32 size) {
573 #define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
574 I32 i, depth = 1, pad, offset, *origin;
576 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
578 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
581 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
582 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
583 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
586 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
588 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
589 ud, size, pad, offset));
591 for (i = cxstack_ix; i > cxix; --i) {
592 PERL_CONTEXT *cx = cxstack + i;
593 switch (CxTYPE(cx)) {
594 #if SU_HAS_PERL(5, 10, 0)
596 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
597 /* Given and when blocks are actually followed by a simple block, so skip
599 if (cxix > 0) { /* Implies i > 0 */
600 PERL_CONTEXT *next = cx - 1;
601 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
607 #if SU_HAS_PERL(5, 11, 0)
610 case CXt_LOOP_LAZYSV:
611 case CXt_LOOP_LAZYIV:
615 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
619 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
624 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
626 Newx(origin, depth + 1, I32);
627 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
628 PL_scopestack[PL_scopestack_ix - depth] += size;
629 for (i = depth - 1; i >= 1; --i) {
630 I32 j = PL_scopestack_ix - i;
631 origin[depth - i] = PL_scopestack[j];
632 PL_scopestack[j] += offset;
634 origin[depth] = PL_savestack_ix;
636 SU_UD_ORIGIN(ud) = origin;
637 SU_UD_DEPTH(ud) = depth;
640 /* Make sure the first destructor fires by pushing enough fake slots on the
642 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
643 <= PL_scopestack[PL_scopestack_ix - 1]) {
646 SU_D(PerlIO_printf(Perl_debug_log,
647 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
648 ud, PL_scopestack_ix, PL_savestack_ix));
649 SU_SAVE_PLACEHOLDER();
650 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
651 <= PL_scopestack[PL_scopestack_ix - 1]);
653 SU_D(PerlIO_printf(Perl_debug_log,
654 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
655 ud, PL_scopestack_ix, PL_savestack_ix));
656 SAVEDESTRUCTOR_X(su_pop, ud);
659 for (i = 0; i <= depth; ++i) {
660 I32 j = PL_scopestack_ix - i;
661 PerlIO_printf(Perl_debug_log,
662 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
663 ud, i, j, origin[depth - i],
664 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
671 /* --- Unwind stack -------------------------------------------------------- */
673 STATIC void su_unwind(pTHX_ void *ud_) {
675 I32 cxix = MY_CXT.cxix;
676 I32 items = MY_CXT.items - 1;
677 SV **savesp = MY_CXT.savesp;
680 PERL_UNUSED_VAR(ud_);
683 PL_stack_sp = savesp;
685 if (cxstack_ix > cxix)
692 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
693 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
697 PerlIO_printf(Perl_debug_log,
698 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
700 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
701 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
704 PL_op = PL_ppaddr[OP_RETURN](aTHX);
705 *PL_markstack_ptr = mark;
707 MY_CXT.fakeop.op_next = PL_op;
708 PL_op = &(MY_CXT.fakeop);
711 /* --- XS ------------------------------------------------------------------ */
713 #if SU_HAS_PERL(5, 8, 9)
714 # define SU_SKIP_DB_MAX 2
716 # define SU_SKIP_DB_MAX 3
719 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
720 * followed by a DB sub */
722 #define SU_SKIP_DB(C) \
725 PERL_CONTEXT *base = cxstack; \
726 PERL_CONTEXT *cx = base + (C); \
727 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
729 if (cx >= base && (C) > skipped) { \
730 switch (CxTYPE(cx)) { \
732 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
733 (C) -= skipped + 1; \
741 #define SU_GET_CONTEXT(A, B) \
750 else if (cxix > cxstack_ix) \
760 #define SU_GET_LEVEL(A, B) \
773 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
775 XS(XS_Scope__Upper_unwind) {
784 PERL_UNUSED_VAR(cv); /* -W */
785 PERL_UNUSED_VAR(ax); /* -Wall */
787 SU_GET_CONTEXT(0, items - 1);
789 PERL_CONTEXT *cx = cxstack + cxix;
790 switch (CxTYPE(cx)) {
792 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
797 MY_CXT.items = items;
798 /* pp_entersub will want to sanitize the stack after returning from there
799 * Screw that, we're insane */
800 if (GIMME_V == G_SCALAR) {
801 MY_CXT.savesp = PL_stack_sp;
802 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
803 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
805 MY_CXT.savesp = NULL;
807 SAVEDESTRUCTOR_X(su_unwind, NULL);
812 } while (--cxix >= 0);
813 croak("Can't return outside a subroutine");
816 MODULE = Scope::Upper PACKAGE = Scope::Upper
825 MY_CXT.stack_placeholder = NULL;
827 stash = gv_stashpv(__PACKAGE__, 1);
828 newCONSTSUB(stash, "TOP", newSViv(0));
829 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
831 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
840 PERL_UNUSED_VAR(items);
845 #endif /* SU_THREADSAFE */
851 I32 cxix = cxstack_ix;
855 RETVAL = newSViv(cxix);
865 SU_GET_CONTEXT(0, 0);
870 RETVAL = newSViv(cxix);
880 SU_GET_CONTEXT(0, 0);
881 for (; cxix >= 0; --cxix) {
882 PERL_CONTEXT *cx = cxstack + cxix;
883 switch (CxTYPE(cx)) {
887 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
889 ST(0) = sv_2mortal(newSViv(cxix));
901 SU_GET_CONTEXT(0, 0);
902 for (; cxix >= 0; --cxix) {
903 PERL_CONTEXT *cx = cxstack + cxix;
904 switch (CxTYPE(cx)) {
908 ST(0) = sv_2mortal(newSViv(cxix));
935 ST(0) = sv_2mortal(newSViv(cxix));
945 for (cxix = cxstack_ix; cxix > 0; --cxix) {
946 PERL_CONTEXT *cx = cxstack + cxix;
947 switch (CxTYPE(cx)) {
949 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
959 ST(0) = sv_2mortal(newSViv(cxix));
968 SU_GET_CONTEXT(0, 0);
970 PERL_CONTEXT *cx = cxstack + cxix--;
971 switch (CxTYPE(cx)) {
975 I32 gimme = cx->blk_gimme;
977 case G_VOID: XSRETURN_UNDEF; break;
978 case G_SCALAR: XSRETURN_NO; break;
979 case G_ARRAY: XSRETURN_YES; break;
994 SU_GET_CONTEXT(1, 1);
995 Newx(ud, 1, su_ud_reap);
996 SU_UD_ORIGIN(ud) = NULL;
997 SU_UD_HANDLER(ud) = su_reap;
998 ud->cb = newSVsv(hook);
999 su_init(cxix, ud, 3);
1002 localize(SV *sv, SV *val, ...)
1009 SU_GET_CONTEXT(2, 2);
1010 Newx(ud, 1, su_ud_localize);
1011 SU_UD_ORIGIN(ud) = NULL;
1012 SU_UD_HANDLER(ud) = su_localize;
1013 su_ud_localize_init(ud, sv, val, NULL);
1014 #if !SU_HAS_PERL(5, 8, 9)
1015 if (ud->type >= SVt_PVGV)
1018 su_init(cxix, ud, size);
1021 localize_elem(SV *sv, SV *elem, SV *val, ...)
1027 if (SvTYPE(sv) >= SVt_PVGV)
1028 croak("Can't infer the element localization type from a glob and the value");
1029 SU_GET_CONTEXT(3, 3);
1030 Newx(ud, 1, su_ud_localize);
1031 SU_UD_ORIGIN(ud) = NULL;
1032 SU_UD_HANDLER(ud) = su_localize;
1033 su_ud_localize_init(ud, sv, val, elem);
1034 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
1036 croak("Can't localize an element of something that isn't an array or a hash");
1038 su_init(cxix, ud, 4);
1041 localize_delete(SV *sv, SV *elem, ...)
1048 SU_GET_CONTEXT(2, 2);
1049 Newx(ud, 1, su_ud_localize);
1050 SU_UD_ORIGIN(ud) = NULL;
1051 SU_UD_HANDLER(ud) = su_localize;
1052 su_ud_localize_init(ud, sv, NULL, elem);
1053 #if !SU_HAS_PERL(5, 8, 9)
1054 if (ud->type >= SVt_PVGV)
1057 su_init(cxix, ud, size);