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 /* --- Stack manipulations ------------------------------------------------- */
119 #ifndef SvCANEXISTDELETE
120 # define SvCANEXISTDELETE(sv) \
122 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
123 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
124 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
125 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
130 /* ... Saving array elements ............................................... */
132 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
133 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
139 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
140 #if SU_HAS_PERL(5, 8, 1)
141 if (SvRMAGICAL(av)) {
142 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
144 SV * const * const negative_indices_glob =
145 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
146 NEGATIVE_INDICES_VAR, 16, 0);
147 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
153 idx = key + av_len(av) + 1;
167 STATIC void su_adelete(pTHX_ void *ud_) {
168 su_ud_adelete *ud = (su_ud_adelete *) ud_;
170 av_delete(ud->av, ud->idx, G_DISCARD);
171 SvREFCNT_dec(ud->av);
176 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
177 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
180 Newx(ud, 1, su_ud_adelete);
183 SvREFCNT_inc_simple_void(av);
185 SAVEDESTRUCTOR_X(su_adelete, ud);
188 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
190 #endif /* SAVEADELETE */
192 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
193 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
200 idx = su_av_key2idx(av, SvIV(key));
202 if (SvCANEXISTDELETE(av))
203 preeminent = av_exists(av, idx);
205 svp = av_fetch(av, idx, 1);
206 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
209 save_aelem(av, idx, svp);
211 SAVEADELETE(av, idx);
213 if (val) { /* local $x[$idx] = $val; */
214 SvSetMagicSV(*svp, val);
215 } else { /* local $x[$idx]; delete $x[$idx]; */
216 av_delete(av, idx, G_DISCARD);
220 /* ... Saving hash elements ................................................ */
222 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
223 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
230 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
231 preeminent = hv_exists_ent(hv, keysv, 0);
233 he = hv_fetch_ent(hv, keysv, 1, 0);
234 svp = he ? &HeVAL(he) : NULL;
235 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
237 if (HvNAME_get(hv) && isGV(*svp)) {
238 save_gp((GV *) *svp, 0);
243 save_helem(hv, keysv, svp);
246 const char * const key = SvPV_const(keysv, keylen);
247 SAVEDELETE(hv, savepvn(key, keylen),
248 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
251 if (val) { /* local $x{$keysv} = $val; */
252 SvSetMagicSV(*svp, val);
253 } else { /* local $x{$keysv}; delete $x{$keysv}; */
254 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
258 /* --- Actions ------------------------------------------------------------- */
263 void (*handler)(pTHX_ void *);
266 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
267 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
268 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
270 #define SU_UD_FREE(U) STMT_START { \
271 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
275 /* ... Reap ................................................................ */
282 STATIC void su_call(pTHX_ void *ud_) {
283 su_ud_reap *ud = (su_ud_reap *) ud_;
284 #if SU_HAS_PERL(5, 9, 5)
285 PERL_CONTEXT saved_cx;
286 I32 dieing = PL_op->op_type == OP_DIE;
293 PerlIO_printf(Perl_debug_log,
294 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
295 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
304 /* If the recently popped context isn't saved there, it will be overwritten by
305 * the sub scope from call_sv, although it's still needed in our caller. */
307 #if SU_HAS_PERL(5, 9, 5)
309 if (cxstack_ix < cxstack_max)
310 cxix = cxstack_ix + 1;
312 cxix = Perl_cxinc(aTHX);
313 saved_cx = cxstack[cxix];
317 call_sv(ud->cb, G_VOID);
319 #if SU_HAS_PERL(5, 9, 5)
321 cxstack[cxix] = saved_cx;
329 SvREFCNT_dec(ud->cb);
333 STATIC void su_reap(pTHX_ void *ud) {
334 #define su_reap(U) su_reap(aTHX_ (U))
336 PerlIO_printf(Perl_debug_log,
337 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
338 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
341 SAVEDESTRUCTOR_X(su_call, ud);
344 /* ... Localize & localize array/hash element .............................. */
354 STATIC void su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
355 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
359 SvREFCNT_inc_simple_void(sv);
361 if (SvTYPE(sv) >= SVt_PVGV) {
362 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
364 } else { /* local *x = \$val; */
365 t = SvTYPE(SvRV(val));
370 const char *p = SvPV_const(sv, len), *s;
371 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
377 case '$': t = SVt_PV; break;
378 case '@': t = SVt_PVAV; break;
379 case '%': t = SVt_PVHV; break;
380 case '&': t = SVt_PVCV; break;
381 case '*': t = SVt_PVGV; break;
386 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
387 if (SvROK(val) && !sv_isobject(val)) {
388 t = SvTYPE(SvRV(val));
407 /* When deref is set, val isn't NULL */
410 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
411 ud->elem = SvREFCNT_inc(elem);
415 STATIC void su_localize(pTHX_ void *ud_) {
416 #define su_localize(U) su_localize(aTHX_ (U))
417 su_ud_localize *ud = (su_ud_localize *) ud_;
424 if (SvTYPE(sv) >= SVt_PVGV) {
428 gv = gv_fetchsv(sv, GV_ADDMULTI, SVt_PVGV);
431 const char *name = SvPV_const(sv, len);
432 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, SVt_PVGV);
439 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
440 PerlIO_printf(Perl_debug_log,
441 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
442 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
446 /* Inspired from Alias.pm */
450 su_save_aelem(GvAV(gv), elem, val);
457 su_save_helem(GvHV(gv), elem, val);
463 save_gp(gv, 1); /* hide previous entry in symtab */
470 gv = (GV *) save_scalar(gv);
475 SvSetMagicSV((SV *) gv, val);
478 SvREFCNT_dec(ud->elem);
479 SvREFCNT_dec(ud->val);
480 SvREFCNT_dec(ud->sv);
484 /* --- Pop a context back -------------------------------------------------- */
488 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
490 # define SU_CXNAME "XXX"
494 STATIC void su_pop(pTHX_ void *ud) {
495 #define su_pop(U) su_pop(aTHX_ (U))
496 I32 depth, base, mark, *origin;
497 depth = SU_UD_DEPTH(ud);
500 PerlIO_printf(Perl_debug_log,
502 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
504 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
507 origin = SU_UD_ORIGIN(ud);
508 mark = origin[depth];
509 base = origin[depth - 1];
511 SU_D(PerlIO_printf(Perl_debug_log,
512 "%p: original scope was %*c top=%2d base=%2d\n",
513 ud, 24, ' ', mark, base));
516 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
517 PL_savestack_ix = mark;
520 PL_savestack_ix = base;
522 SU_UD_DEPTH(ud) = --depth;
527 SAVEDESTRUCTOR_X(su_pop, ud);
529 /* Skip depths corresponding to scopes for which leave_scope() might not be
531 while (depth > 1 && PL_scopestack_ix >= i) {
532 I32 j = PL_scopestack[PL_scopestack_ix - i];
534 if (j < PL_savestack_ix)
537 SU_D(PerlIO_printf(Perl_debug_log,
538 "%p: skip scope%*cat depth=%2d scope_ix=%2d new_top=%2d >= cur_base=%2d\n",
539 ud, 6, ' ', depth, PL_scopestack_ix - i, j, PL_savestack_ix));
541 SU_UD_DEPTH(ud) = --depth;
546 SU_D(PerlIO_printf(Perl_debug_log,
547 "%p: set destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
548 ud, depth, PL_scopestack_ix, PL_savestack_ix));
550 SU_UD_HANDLER(ud)(aTHX_ ud);
553 SU_D(PerlIO_printf(Perl_debug_log,
554 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
555 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
558 /* --- Global data --------------------------------------------------------- */
560 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
563 int stack_placeholder;
572 /* --- Initialize the stack and the action userdata ------------------------ */
574 STATIC I32 su_init(pTHX_ I32 cxix, void *ud, I32 size) {
575 #define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
576 I32 i, depth = 1, *origin;
578 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
580 for (i = cxstack_ix; i > cxix; --i) {
581 PERL_CONTEXT *cx = cxstack + i;
582 switch (CxTYPE(cx)) {
583 #if SU_HAS_PERL(5, 10, 0)
585 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
586 /* Given and when blocks are actually followed by a simple block, so skip
588 if (cxix > 0) { /* Implies i > 0 */
589 PERL_CONTEXT *next = cx - 1;
590 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
596 #if SU_HAS_PERL(5, 11, 0)
599 case CXt_LOOP_LAZYSV:
600 case CXt_LOOP_LAZYIV:
604 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
608 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
613 SU_D(PerlIO_printf(Perl_debug_log, "%p: depth is %d\n", ud, depth));
615 Newx(origin, depth + 1, I32);
616 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
617 PL_scopestack[PL_scopestack_ix - depth] += size;
618 for (i = depth - 1; i >= 1; --i) {
619 I32 j = PL_scopestack_ix - i;
620 origin[depth - i] = PL_scopestack[j];
621 PL_scopestack[j] += 3;
623 origin[depth] = PL_savestack_ix;
625 SU_UD_ORIGIN(ud) = origin;
626 SU_UD_DEPTH(ud) = depth;
628 SU_D(PerlIO_printf(Perl_debug_log,
629 "%p: set original destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
630 ud, depth, PL_scopestack_ix - 1, PL_savestack_ix));
632 /* Make sure the first destructor fires by pushing enough fake slots on the
634 if (PL_savestack_ix + 3 <= PL_scopestack[PL_scopestack_ix - 1]) {
637 save_int(&MY_CXT.stack_placeholder);
638 } while (PL_savestack_ix + 3 <= PL_scopestack[PL_scopestack_ix - 1]);
641 SAVEDESTRUCTOR_X(su_pop, ud);
644 for (i = 0; i <= depth; ++i) {
645 I32 j = PL_scopestack_ix - i;
646 PerlIO_printf(Perl_debug_log,
647 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
648 ud, i, j, origin[depth - i],
649 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
656 /* --- Unwind stack -------------------------------------------------------- */
658 STATIC void su_unwind(pTHX_ void *ud_) {
660 I32 cxix = MY_CXT.cxix;
661 I32 items = MY_CXT.items - 1;
662 SV **savesp = MY_CXT.savesp;
665 PERL_UNUSED_VAR(ud_);
668 PL_stack_sp = savesp;
670 if (cxstack_ix > cxix)
677 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
678 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
682 PerlIO_printf(Perl_debug_log,
683 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
685 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
686 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
689 PL_op = PL_ppaddr[OP_RETURN](aTHX);
690 *PL_markstack_ptr = mark;
692 MY_CXT.fakeop.op_next = PL_op;
693 PL_op = &(MY_CXT.fakeop);
696 /* --- XS ------------------------------------------------------------------ */
698 #if SU_HAS_PERL(5, 8, 9)
699 # define SU_SKIP_DB_MAX 2
701 # define SU_SKIP_DB_MAX 3
704 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
705 * followed by a DB sub */
707 #define SU_SKIP_DB(C) \
710 PERL_CONTEXT *base = cxstack; \
711 PERL_CONTEXT *cx = base + (C); \
712 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
714 if (cx >= base && (C) > skipped) { \
715 switch (CxTYPE(cx)) { \
717 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
718 (C) -= skipped + 1; \
726 #define SU_GET_CONTEXT(A, B) \
735 else if (cxix > cxstack_ix) \
745 #define SU_GET_LEVEL(A, B) \
758 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
760 XS(XS_Scope__Upper_unwind) {
769 PERL_UNUSED_VAR(cv); /* -W */
770 PERL_UNUSED_VAR(ax); /* -Wall */
772 SU_GET_CONTEXT(0, items - 1);
774 PERL_CONTEXT *cx = cxstack + cxix;
775 switch (CxTYPE(cx)) {
777 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
782 MY_CXT.items = items;
783 /* pp_entersub will want to sanitize the stack after returning from there
784 * Screw that, we're insane */
785 if (GIMME_V == G_SCALAR) {
786 MY_CXT.savesp = PL_stack_sp;
787 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
788 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
790 MY_CXT.savesp = NULL;
792 SAVEDESTRUCTOR_X(su_unwind, NULL);
797 } while (--cxix >= 0);
798 croak("Can't return outside a subroutine");
801 MODULE = Scope::Upper PACKAGE = Scope::Upper
810 MY_CXT.stack_placeholder = 0;
812 stash = gv_stashpv(__PACKAGE__, 1);
813 newCONSTSUB(stash, "TOP", newSViv(0));
814 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
816 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
825 PERL_UNUSED_VAR(items);
830 #endif /* SU_THREADSAFE */
836 I32 cxix = cxstack_ix;
840 RETVAL = newSViv(cxix);
850 SU_GET_CONTEXT(0, 0);
855 RETVAL = newSViv(cxix);
865 SU_GET_CONTEXT(0, 0);
866 for (; cxix >= 0; --cxix) {
867 PERL_CONTEXT *cx = cxstack + cxix;
868 switch (CxTYPE(cx)) {
872 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
874 ST(0) = sv_2mortal(newSViv(cxix));
886 SU_GET_CONTEXT(0, 0);
887 for (; cxix >= 0; --cxix) {
888 PERL_CONTEXT *cx = cxstack + cxix;
889 switch (CxTYPE(cx)) {
893 ST(0) = sv_2mortal(newSViv(cxix));
920 ST(0) = sv_2mortal(newSViv(cxix));
930 for (cxix = cxstack_ix; cxix > 0; --cxix) {
931 PERL_CONTEXT *cx = cxstack + cxix;
932 switch (CxTYPE(cx)) {
934 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
944 ST(0) = sv_2mortal(newSViv(cxix));
953 SU_GET_CONTEXT(0, 0);
955 PERL_CONTEXT *cx = cxstack + cxix--;
956 switch (CxTYPE(cx)) {
960 I32 gimme = cx->blk_gimme;
962 case G_VOID: XSRETURN_UNDEF; break;
963 case G_SCALAR: XSRETURN_NO; break;
964 case G_ARRAY: XSRETURN_YES; break;
979 SU_GET_CONTEXT(1, 1);
980 Newx(ud, 1, su_ud_reap);
981 SU_UD_ORIGIN(ud) = NULL;
982 SU_UD_HANDLER(ud) = su_reap;
983 ud->cb = newSVsv(hook);
984 su_init(cxix, ud, 3);
987 localize(SV *sv, SV *val, ...)
994 SU_GET_CONTEXT(2, 2);
995 Newx(ud, 1, su_ud_localize);
996 SU_UD_ORIGIN(ud) = NULL;
997 SU_UD_HANDLER(ud) = su_localize;
998 su_ud_localize_init(ud, sv, val, NULL);
999 #if !SU_HAS_PERL(5, 8, 9)
1000 if (ud->type >= SVt_PVGV)
1003 su_init(cxix, ud, size);
1006 localize_elem(SV *sv, SV *elem, SV *val, ...)
1012 SU_GET_CONTEXT(3, 3);
1013 Newx(ud, 1, su_ud_localize);
1014 SU_UD_ORIGIN(ud) = NULL;
1015 SU_UD_HANDLER(ud) = su_localize;
1016 su_ud_localize_init(ud, sv, val, elem);
1017 su_init(cxix, ud, 4);
1020 localize_delete(SV *sv, SV *elem, ...)
1027 SU_GET_CONTEXT(2, 2);
1028 Newx(ud, 1, su_ud_localize);
1029 SU_UD_ORIGIN(ud) = NULL;
1030 SU_UD_HANDLER(ud) = su_localize;
1031 su_ud_localize_init(ud, sv, NULL, elem);
1032 #if !SU_HAS_PERL(5, 8, 9)
1033 if (ud->type >= SVt_PVGV)
1036 su_init(cxix, ud, size);