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 int stack_placeholder;
131 /* --- Stack manipulations ------------------------------------------------- */
133 #define SU_SAVE_DESTRUCTOR_SIZE 3
134 #define SU_SAVE_INT_SIZE 3
136 #ifndef SvCANEXISTDELETE
137 # define SvCANEXISTDELETE(sv) \
139 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
140 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
141 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
142 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
147 /* ... Saving array elements ............................................... */
149 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
150 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
156 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
157 #if SU_HAS_PERL(5, 8, 1)
158 if (SvRMAGICAL(av)) {
159 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
161 SV * const * const negative_indices_glob =
162 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
163 NEGATIVE_INDICES_VAR, 16, 0);
164 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
170 idx = key + av_len(av) + 1;
184 STATIC void su_adelete(pTHX_ void *ud_) {
185 su_ud_adelete *ud = (su_ud_adelete *) ud_;
187 av_delete(ud->av, ud->idx, G_DISCARD);
188 SvREFCNT_dec(ud->av);
193 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
194 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
197 Newx(ud, 1, su_ud_adelete);
200 SvREFCNT_inc_simple_void(av);
202 SAVEDESTRUCTOR_X(su_adelete, ud);
205 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
207 #endif /* SAVEADELETE */
209 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
210 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
217 idx = su_av_key2idx(av, SvIV(key));
219 if (SvCANEXISTDELETE(av))
220 preeminent = av_exists(av, idx);
222 svp = av_fetch(av, idx, 1);
223 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
226 save_aelem(av, idx, svp);
228 SAVEADELETE(av, idx);
230 if (val) { /* local $x[$idx] = $val; */
231 SvSetMagicSV(*svp, val);
232 } else { /* local $x[$idx]; delete $x[$idx]; */
233 av_delete(av, idx, G_DISCARD);
237 /* ... Saving hash elements ................................................ */
239 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
240 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
247 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
248 preeminent = hv_exists_ent(hv, keysv, 0);
250 he = hv_fetch_ent(hv, keysv, 1, 0);
251 svp = he ? &HeVAL(he) : NULL;
252 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
254 if (HvNAME_get(hv) && isGV(*svp)) {
255 save_gp((GV *) *svp, 0);
260 save_helem(hv, keysv, svp);
263 const char * const key = SvPV_const(keysv, keylen);
264 SAVEDELETE(hv, savepvn(key, keylen),
265 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
268 if (val) { /* local $x{$keysv} = $val; */
269 SvSetMagicSV(*svp, val);
270 } else { /* local $x{$keysv}; delete $x{$keysv}; */
271 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
275 /* --- Actions ------------------------------------------------------------- */
281 void (*handler)(pTHX_ void *);
284 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
285 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
286 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
287 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
289 #define SU_UD_FREE(U) STMT_START { \
290 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
294 /* ... Reap ................................................................ */
301 STATIC void su_call(pTHX_ void *ud_) {
302 su_ud_reap *ud = (su_ud_reap *) ud_;
303 #if SU_HAS_PERL(5, 9, 5)
304 PERL_CONTEXT saved_cx;
311 PerlIO_printf(Perl_debug_log,
312 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
313 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
322 /* If the recently popped context isn't saved there, it will be overwritten by
323 * the sub scope from call_sv, although it's still needed in our caller. */
325 #if SU_HAS_PERL(5, 9, 5)
326 if (cxstack_ix < cxstack_max)
327 cxix = cxstack_ix + 1;
329 cxix = Perl_cxinc(aTHX);
330 saved_cx = cxstack[cxix];
333 call_sv(ud->cb, G_VOID);
335 #if SU_HAS_PERL(5, 9, 5)
336 cxstack[cxix] = saved_cx;
344 SvREFCNT_dec(ud->cb);
348 STATIC void su_reap(pTHX_ void *ud) {
349 #define su_reap(U) su_reap(aTHX_ (U))
351 PerlIO_printf(Perl_debug_log,
352 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
353 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
356 SAVEDESTRUCTOR_X(su_call, ud);
359 /* ... Localize & localize array/hash element .............................. */
369 STATIC void su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
370 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
374 SvREFCNT_inc_simple_void(sv);
376 if (SvTYPE(sv) >= SVt_PVGV) {
377 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
379 } else { /* local *x = \$val; */
380 t = SvTYPE(SvRV(val));
383 } else if (SvROK(sv)) {
384 croak("Invalid %s reference as the localization target",
385 sv_reftype(SvRV(sv), 0));
388 const char *p = SvPV_const(sv, len), *s;
389 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
395 case '$': t = SVt_PV; break;
396 case '@': t = SVt_PVAV; break;
397 case '%': t = SVt_PVHV; break;
398 case '&': t = SVt_PVCV; break;
399 case '*': t = SVt_PVGV; break;
404 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
405 if (SvROK(val) && !sv_isobject(val)) {
406 t = SvTYPE(SvRV(val));
425 /* When deref is set, val isn't NULL */
428 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
429 ud->elem = SvREFCNT_inc(elem);
433 STATIC void su_localize(pTHX_ void *ud_) {
434 #define su_localize(U) su_localize(aTHX_ (U))
435 su_ud_localize *ud = (su_ud_localize *) ud_;
442 if (SvTYPE(sv) >= SVt_PVGV) {
446 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
449 const char *name = SvPV_const(sv, len);
450 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
457 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
458 PerlIO_printf(Perl_debug_log,
459 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
460 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
464 /* Inspired from Alias.pm */
468 su_save_aelem(GvAV(gv), elem, val);
475 su_save_helem(GvHV(gv), elem, val);
481 save_gp(gv, 1); /* hide previous entry in symtab */
488 gv = (GV *) save_scalar(gv);
493 SvSetMagicSV((SV *) gv, val);
496 SvREFCNT_dec(ud->elem);
497 SvREFCNT_dec(ud->val);
498 SvREFCNT_dec(ud->sv);
502 /* --- Pop a context back -------------------------------------------------- */
506 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
508 # define SU_CXNAME "XXX"
512 STATIC void su_pop(pTHX_ void *ud) {
513 #define su_pop(U) su_pop(aTHX_ (U))
514 I32 depth, base, mark, *origin;
515 depth = SU_UD_DEPTH(ud);
518 PerlIO_printf(Perl_debug_log,
520 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
522 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
525 origin = SU_UD_ORIGIN(ud);
526 mark = origin[depth];
527 base = origin[depth - 1];
529 SU_D(PerlIO_printf(Perl_debug_log,
530 "%p: original scope was %*c top=%2d base=%2d\n",
531 ud, 24, ' ', mark, base));
534 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
535 PL_savestack_ix = mark;
538 PL_savestack_ix = base;
540 SU_UD_DEPTH(ud) = --depth;
545 if ((pad = SU_UD_PAD(ud))) {
548 SU_D(PerlIO_printf(Perl_debug_log,
549 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
550 ud, depth, PL_scopestack_ix, PL_savestack_ix));
551 save_int(&MY_CXT.stack_placeholder);
555 SU_D(PerlIO_printf(Perl_debug_log,
556 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
557 ud, depth, PL_scopestack_ix, PL_savestack_ix));
558 SAVEDESTRUCTOR_X(su_pop, ud);
560 SU_UD_HANDLER(ud)(aTHX_ ud);
563 SU_D(PerlIO_printf(Perl_debug_log,
564 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
565 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
568 /* --- Initialize the stack and the action userdata ------------------------ */
570 STATIC I32 su_init(pTHX_ I32 cxix, void *ud, I32 size) {
571 #define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
572 I32 i, depth = 1, pad, offset, *origin;
574 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
576 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
579 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
580 pad = extra / SU_SAVE_INT_SIZE + ((extra % SU_SAVE_INT_SIZE) ? 1 : 0);
582 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_INT_SIZE * pad;
584 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
585 ud, size, pad, offset));
587 for (i = cxstack_ix; i > cxix; --i) {
588 PERL_CONTEXT *cx = cxstack + i;
589 switch (CxTYPE(cx)) {
590 #if SU_HAS_PERL(5, 10, 0)
592 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
593 /* Given and when blocks are actually followed by a simple block, so skip
595 if (cxix > 0) { /* Implies i > 0 */
596 PERL_CONTEXT *next = cx - 1;
597 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
603 #if SU_HAS_PERL(5, 11, 0)
606 case CXt_LOOP_LAZYSV:
607 case CXt_LOOP_LAZYIV:
611 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
615 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
620 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
622 Newx(origin, depth + 1, I32);
623 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
624 PL_scopestack[PL_scopestack_ix - depth] += size;
625 for (i = depth - 1; i >= 1; --i) {
626 I32 j = PL_scopestack_ix - i;
627 origin[depth - i] = PL_scopestack[j];
628 PL_scopestack[j] += offset;
630 origin[depth] = PL_savestack_ix;
632 SU_UD_ORIGIN(ud) = origin;
633 SU_UD_DEPTH(ud) = depth;
636 /* Make sure the first destructor fires by pushing enough fake slots on the
638 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
639 <= PL_scopestack[PL_scopestack_ix - 1]) {
642 SU_D(PerlIO_printf(Perl_debug_log,
643 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
644 ud, PL_scopestack_ix, PL_savestack_ix));
645 save_int(&MY_CXT.stack_placeholder);
646 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
647 <= PL_scopestack[PL_scopestack_ix - 1]);
649 SU_D(PerlIO_printf(Perl_debug_log,
650 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
651 ud, PL_scopestack_ix, PL_savestack_ix));
652 SAVEDESTRUCTOR_X(su_pop, ud);
655 for (i = 0; i <= depth; ++i) {
656 I32 j = PL_scopestack_ix - i;
657 PerlIO_printf(Perl_debug_log,
658 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
659 ud, i, j, origin[depth - i],
660 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
667 /* --- Unwind stack -------------------------------------------------------- */
669 STATIC void su_unwind(pTHX_ void *ud_) {
671 I32 cxix = MY_CXT.cxix;
672 I32 items = MY_CXT.items - 1;
673 SV **savesp = MY_CXT.savesp;
676 PERL_UNUSED_VAR(ud_);
679 PL_stack_sp = savesp;
681 if (cxstack_ix > cxix)
688 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
689 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
693 PerlIO_printf(Perl_debug_log,
694 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
696 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
697 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
700 PL_op = PL_ppaddr[OP_RETURN](aTHX);
701 *PL_markstack_ptr = mark;
703 MY_CXT.fakeop.op_next = PL_op;
704 PL_op = &(MY_CXT.fakeop);
707 /* --- XS ------------------------------------------------------------------ */
709 #if SU_HAS_PERL(5, 8, 9)
710 # define SU_SKIP_DB_MAX 2
712 # define SU_SKIP_DB_MAX 3
715 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
716 * followed by a DB sub */
718 #define SU_SKIP_DB(C) \
721 PERL_CONTEXT *base = cxstack; \
722 PERL_CONTEXT *cx = base + (C); \
723 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
725 if (cx >= base && (C) > skipped) { \
726 switch (CxTYPE(cx)) { \
728 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
729 (C) -= skipped + 1; \
737 #define SU_GET_CONTEXT(A, B) \
746 else if (cxix > cxstack_ix) \
756 #define SU_GET_LEVEL(A, B) \
769 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
771 XS(XS_Scope__Upper_unwind) {
780 PERL_UNUSED_VAR(cv); /* -W */
781 PERL_UNUSED_VAR(ax); /* -Wall */
783 SU_GET_CONTEXT(0, items - 1);
785 PERL_CONTEXT *cx = cxstack + cxix;
786 switch (CxTYPE(cx)) {
788 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
793 MY_CXT.items = items;
794 /* pp_entersub will want to sanitize the stack after returning from there
795 * Screw that, we're insane */
796 if (GIMME_V == G_SCALAR) {
797 MY_CXT.savesp = PL_stack_sp;
798 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
799 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
801 MY_CXT.savesp = NULL;
803 SAVEDESTRUCTOR_X(su_unwind, NULL);
808 } while (--cxix >= 0);
809 croak("Can't return outside a subroutine");
812 MODULE = Scope::Upper PACKAGE = Scope::Upper
821 MY_CXT.stack_placeholder = 0;
823 stash = gv_stashpv(__PACKAGE__, 1);
824 newCONSTSUB(stash, "TOP", newSViv(0));
825 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
827 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
836 PERL_UNUSED_VAR(items);
841 #endif /* SU_THREADSAFE */
847 I32 cxix = cxstack_ix;
851 RETVAL = newSViv(cxix);
861 SU_GET_CONTEXT(0, 0);
866 RETVAL = newSViv(cxix);
876 SU_GET_CONTEXT(0, 0);
877 for (; cxix >= 0; --cxix) {
878 PERL_CONTEXT *cx = cxstack + cxix;
879 switch (CxTYPE(cx)) {
883 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
885 ST(0) = sv_2mortal(newSViv(cxix));
897 SU_GET_CONTEXT(0, 0);
898 for (; cxix >= 0; --cxix) {
899 PERL_CONTEXT *cx = cxstack + cxix;
900 switch (CxTYPE(cx)) {
904 ST(0) = sv_2mortal(newSViv(cxix));
931 ST(0) = sv_2mortal(newSViv(cxix));
941 for (cxix = cxstack_ix; cxix > 0; --cxix) {
942 PERL_CONTEXT *cx = cxstack + cxix;
943 switch (CxTYPE(cx)) {
945 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
955 ST(0) = sv_2mortal(newSViv(cxix));
964 SU_GET_CONTEXT(0, 0);
966 PERL_CONTEXT *cx = cxstack + cxix--;
967 switch (CxTYPE(cx)) {
971 I32 gimme = cx->blk_gimme;
973 case G_VOID: XSRETURN_UNDEF; break;
974 case G_SCALAR: XSRETURN_NO; break;
975 case G_ARRAY: XSRETURN_YES; break;
990 SU_GET_CONTEXT(1, 1);
991 Newx(ud, 1, su_ud_reap);
992 SU_UD_ORIGIN(ud) = NULL;
993 SU_UD_HANDLER(ud) = su_reap;
994 ud->cb = newSVsv(hook);
995 su_init(cxix, ud, 3);
998 localize(SV *sv, SV *val, ...)
1005 SU_GET_CONTEXT(2, 2);
1006 Newx(ud, 1, su_ud_localize);
1007 SU_UD_ORIGIN(ud) = NULL;
1008 SU_UD_HANDLER(ud) = su_localize;
1009 su_ud_localize_init(ud, sv, val, NULL);
1010 #if !SU_HAS_PERL(5, 8, 9)
1011 if (ud->type >= SVt_PVGV)
1014 su_init(cxix, ud, size);
1017 localize_elem(SV *sv, SV *elem, SV *val, ...)
1023 if (SvTYPE(sv) >= SVt_PVGV)
1024 croak("Can't infer the element localization type from a glob and the value");
1025 SU_GET_CONTEXT(3, 3);
1026 Newx(ud, 1, su_ud_localize);
1027 SU_UD_ORIGIN(ud) = NULL;
1028 SU_UD_HANDLER(ud) = su_localize;
1029 su_ud_localize_init(ud, sv, val, elem);
1030 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
1032 croak("Can't localize an element of something that isn't an array or a hash");
1034 su_init(cxix, ud, 4);
1037 localize_delete(SV *sv, SV *elem, ...)
1044 SU_GET_CONTEXT(2, 2);
1045 Newx(ud, 1, su_ud_localize);
1046 SU_UD_ORIGIN(ud) = NULL;
1047 SU_UD_HANDLER(ud) = su_localize;
1048 su_ud_localize_init(ud, sv, NULL, elem);
1049 #if !SU_HAS_PERL(5, 8, 9)
1050 if (ud->type >= SVt_PVGV)
1053 su_init(cxix, ud, size);