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 ------------------------------------------------------- */
30 # define MUTABLE_SV(S) ((SV *) (S))
34 # define MUTABLE_AV(A) ((AV *) (A))
38 # define MUTABLE_CV(C) ((CV *) (C))
41 #ifndef PERL_UNUSED_VAR
42 # define PERL_UNUSED_VAR(V)
46 # define STMT_START do
50 # define STMT_END while (0)
54 # define SU_D(X) STMT_START X STMT_END
60 # define Newx(v, n, c) New(0, v, n, c)
65 # define SU_POISON(D, N, T) PoisonNew((D), (N), T)
66 # elif defined(Poison)
67 # define SU_POISON(D, N, T) Poison((D), (N), T)
71 # define SU_POISON(D, N, T) NOOP
75 STATIC SV *su_newSV_type(pTHX_ svtype t) {
80 # define newSV_type(T) su_newSV_type(aTHX_ (T))
84 # define SvPV_const(S, L) SvPV(S, L)
88 # define SvPVX_const(S) SvPVX(S)
91 #ifndef SvPV_nolen_const
92 # define SvPV_nolen_const(S) SvPV_nolen(S)
95 #ifndef SvREFCNT_inc_simple_void
96 # define SvREFCNT_inc_simple_void(sv) ((void) SvREFCNT_inc(sv))
100 # define mPUSHi(I) PUSHs(sv_2mortal(newSViv(I)))
104 # define GvCV_set(G, C) (GvCV(G) = (C))
108 # define CvGV_set(C, G) (CvGV(C) = (G))
112 # define CvSTASH_set(C, S) (CvSTASH(C) = (S))
116 # define CvISXSUB(C) CvXSUB(C)
120 # define CxHASARGS(C) ((C)->blk_sub.hasargs)
124 # define HvNAME_get(H) HvNAME(H)
127 #ifndef gv_fetchpvn_flags
128 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
131 #ifndef PERL_MAGIC_tied
132 # define PERL_MAGIC_tied 'P'
135 #ifndef PERL_MAGIC_env
136 # define PERL_MAGIC_env 'E'
139 #ifndef NEGATIVE_INDICES_VAR
140 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
143 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
144 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
146 /* --- Threads and multiplicity -------------------------------------------- */
148 #ifndef SU_MULTIPLICITY
149 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
150 # define SU_MULTIPLICITY 1
152 # define SU_MULTIPLICITY 0
155 #if SU_MULTIPLICITY && !defined(tTHX)
156 # define tTHX PerlInterpreter*
159 #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))
160 # define SU_THREADSAFE 1
161 # ifndef MY_CXT_CLONE
162 # define MY_CXT_CLONE \
164 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
165 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
166 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
169 # define SU_THREADSAFE 0
171 # define dMY_CXT dNOOP
173 # define MY_CXT su_globaldata
175 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
177 # define MY_CXT_INIT NOOP
179 # define MY_CXT_CLONE NOOP
182 /* --- unwind() global storage --------------------------------------------- */
192 /* --- uplevel() data tokens and global storage ---------------------------- */
203 PERL_SI *old_curstackinfo;
213 STATIC su_uplevel_ud *su_uplevel_ud_new(pTHX) {
214 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
218 Newx(sud, 1, su_uplevel_ud);
221 Newx(si, 1, PERL_SI);
222 si->si_stack = newAV();
223 AvREAL_off(si->si_stack);
224 si->si_cxstack = NULL;
232 STATIC void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
233 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
234 PERL_SI *si = sud->si;
236 Safefree(si->si_cxstack);
237 SvREFCNT_dec(si->si_stack);
247 } su_uplevel_storage;
249 #ifndef SU_UPLEVEL_STORAGE_SIZE
250 # define SU_UPLEVEL_STORAGE_SIZE 4
253 /* --- Global data --------------------------------------------------------- */
255 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
258 char *stack_placeholder;
259 su_unwind_storage unwind_storage;
260 su_uplevel_storage uplevel_storage;
265 /* --- Stack manipulations ------------------------------------------------- */
267 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
269 #define SU_SAVE_DESTRUCTOR_SIZE 3
270 #define SU_SAVE_PLACEHOLDER_SIZE 3
272 #define SU_SAVE_SCALAR_SIZE 3
274 #define SU_SAVE_ARY_SIZE 3
275 #define SU_SAVE_AELEM_SIZE 4
277 # define SU_SAVE_ADELETE_SIZE 3
279 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
281 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
282 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
284 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
287 #define SU_SAVE_HASH_SIZE 3
288 #define SU_SAVE_HELEM_SIZE 4
289 #define SU_SAVE_HDELETE_SIZE 4
290 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
291 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
293 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
296 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
298 #if !SU_HAS_PERL(5, 8, 9)
299 # define SU_SAVE_GP_SIZE 6
300 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
301 # define SU_SAVE_GP_SIZE 3
302 #elif !SU_HAS_PERL(5, 13, 8)
303 # define SU_SAVE_GP_SIZE 4
305 # define SU_SAVE_GP_SIZE 3
308 #ifndef SvCANEXISTDELETE
309 # define SvCANEXISTDELETE(sv) \
311 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
312 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
313 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
314 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
319 /* ... Saving array elements ............................................... */
321 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
322 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
328 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
329 #if SU_HAS_PERL(5, 8, 1)
330 if (SvRMAGICAL(av)) {
331 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
333 SV * const * const negative_indices_glob =
334 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
335 NEGATIVE_INDICES_VAR, 16, 0);
336 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
342 idx = key + av_len(av) + 1;
356 STATIC void su_adelete(pTHX_ void *ud_) {
357 su_ud_adelete *ud = (su_ud_adelete *) ud_;
359 av_delete(ud->av, ud->idx, G_DISCARD);
360 SvREFCNT_dec(ud->av);
365 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
366 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
369 Newx(ud, 1, su_ud_adelete);
372 SvREFCNT_inc_simple_void(av);
374 SAVEDESTRUCTOR_X(su_adelete, ud);
377 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
379 #endif /* SAVEADELETE */
381 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
382 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
389 idx = su_av_key2idx(av, SvIV(key));
391 if (SvCANEXISTDELETE(av))
392 preeminent = av_exists(av, idx);
394 svp = av_fetch(av, idx, 1);
395 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
398 save_aelem(av, idx, svp);
400 SAVEADELETE(av, idx);
402 if (val) { /* local $x[$idx] = $val; */
403 SvSetMagicSV(*svp, val);
404 } else { /* local $x[$idx]; delete $x[$idx]; */
405 av_delete(av, idx, G_DISCARD);
409 /* ... Saving hash elements ................................................ */
411 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
412 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
419 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
420 preeminent = hv_exists_ent(hv, keysv, 0);
422 he = hv_fetch_ent(hv, keysv, 1, 0);
423 svp = he ? &HeVAL(he) : NULL;
424 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
426 if (HvNAME_get(hv) && isGV(*svp)) {
427 save_gp((GV *) *svp, 0);
432 save_helem(hv, keysv, svp);
435 const char * const key = SvPV_const(keysv, keylen);
436 SAVEDELETE(hv, savepvn(key, keylen),
437 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
440 if (val) { /* local $x{$keysv} = $val; */
441 SvSetMagicSV(*svp, val);
442 } else { /* local $x{$keysv}; delete $x{$keysv}; */
443 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
447 /* ... Saving code slots from a glob ....................................... */
449 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
450 # define mro_method_changed_in(G) PL_sub_generation++
458 STATIC void su_restore_gvcv(pTHX_ void *ud_) {
459 su_save_gvcv_ud *ud = ud_;
462 GvCV_set(gv, ud->old_cv);
464 mro_method_changed_in(GvSTASH(gv));
469 STATIC void su_save_gvcv(pTHX_ GV *gv) {
470 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
473 Newx(ud, 1, su_save_gvcv_ud);
475 ud->old_cv = GvCV(gv);
479 mro_method_changed_in(GvSTASH(gv));
481 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
484 /* --- Actions ------------------------------------------------------------- */
490 void (*handler)(pTHX_ void *);
493 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
494 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
495 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
496 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
498 #define SU_UD_FREE(U) STMT_START { \
499 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
503 /* ... Reap ................................................................ */
510 STATIC void su_call(pTHX_ void *ud_) {
511 su_ud_reap *ud = (su_ud_reap *) ud_;
512 #if SU_HAS_PERL(5, 9, 5)
513 PERL_CONTEXT saved_cx;
520 PerlIO_printf(Perl_debug_log,
521 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
522 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
531 /* If the recently popped context isn't saved there, it will be overwritten by
532 * the sub scope from call_sv, although it's still needed in our caller. */
534 #if SU_HAS_PERL(5, 9, 5)
535 if (cxstack_ix < cxstack_max)
536 cxix = cxstack_ix + 1;
538 cxix = Perl_cxinc(aTHX);
539 saved_cx = cxstack[cxix];
542 call_sv(ud->cb, G_VOID);
544 #if SU_HAS_PERL(5, 9, 5)
545 cxstack[cxix] = saved_cx;
553 SvREFCNT_dec(ud->cb);
557 STATIC void su_reap(pTHX_ void *ud) {
558 #define su_reap(U) su_reap(aTHX_ (U))
560 PerlIO_printf(Perl_debug_log,
561 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
562 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
565 SAVEDESTRUCTOR_X(su_call, ud);
568 /* ... Localize & localize array/hash element .............................. */
578 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
579 SvREFCNT_dec((U)->elem); \
580 SvREFCNT_dec((U)->val); \
581 SvREFCNT_dec((U)->sv); \
585 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
586 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
591 SvREFCNT_inc_simple_void(sv);
593 if (SvTYPE(sv) >= SVt_PVGV) {
594 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
596 } else { /* local *x = \$val; */
597 t = SvTYPE(SvRV(val));
600 } else if (SvROK(sv)) {
601 croak("Invalid %s reference as the localization target",
602 sv_reftype(SvRV(sv), 0));
605 const char *p = SvPV_const(sv, len), *s;
606 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
612 case '$': t = SVt_PV; break;
613 case '@': t = SVt_PVAV; break;
614 case '%': t = SVt_PVHV; break;
615 case '&': t = SVt_PVCV; break;
616 case '*': t = SVt_PVGV; break;
621 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
622 if (SvROK(val) && !sv_isobject(val)) {
623 t = SvTYPE(SvRV(val));
635 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
640 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
645 size = SU_SAVE_GP_SIZE;
649 size = SU_SAVE_GVCV_SIZE;
653 size = SU_SAVE_SCALAR_SIZE;
656 /* When deref is set, val isn't NULL */
659 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
660 ud->elem = SvREFCNT_inc(elem);
666 STATIC void su_localize(pTHX_ void *ud_) {
667 #define su_localize(U) su_localize(aTHX_ (U))
668 su_ud_localize *ud = (su_ud_localize *) ud_;
675 if (SvTYPE(sv) >= SVt_PVGV) {
679 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
682 const char *name = SvPV_const(sv, len);
683 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
690 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
691 PerlIO_printf(Perl_debug_log,
692 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
693 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
697 /* Inspired from Alias.pm */
701 su_save_aelem(GvAV(gv), elem, val);
708 su_save_helem(GvHV(gv), elem, val);
714 save_gp(gv, 1); /* hide previous entry in symtab */
720 gv = (GV *) save_scalar(gv);
725 SvSetMagicSV((SV *) gv, val);
728 SU_UD_LOCALIZE_FREE(ud);
731 /* --- Pop a context back -------------------------------------------------- */
735 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
737 # define SU_CXNAME "XXX"
741 STATIC void su_pop(pTHX_ void *ud) {
742 #define su_pop(U) su_pop(aTHX_ (U))
743 I32 depth, base, mark, *origin;
744 depth = SU_UD_DEPTH(ud);
747 PerlIO_printf(Perl_debug_log,
749 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
751 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
754 origin = SU_UD_ORIGIN(ud);
755 mark = origin[depth];
756 base = origin[depth - 1];
758 SU_D(PerlIO_printf(Perl_debug_log,
759 "%p: original scope was %*c top=%2d base=%2d\n",
760 ud, 24, ' ', mark, base));
763 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
764 PL_savestack_ix = mark;
767 PL_savestack_ix = base;
769 SU_UD_DEPTH(ud) = --depth;
774 if ((pad = SU_UD_PAD(ud))) {
777 SU_D(PerlIO_printf(Perl_debug_log,
778 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
779 ud, depth, PL_scopestack_ix, PL_savestack_ix));
780 SU_SAVE_PLACEHOLDER();
784 SU_D(PerlIO_printf(Perl_debug_log,
785 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
786 ud, depth, PL_scopestack_ix, PL_savestack_ix));
787 SAVEDESTRUCTOR_X(su_pop, ud);
789 SU_UD_HANDLER(ud)(aTHX_ ud);
792 SU_D(PerlIO_printf(Perl_debug_log,
793 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
794 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
797 /* --- Initialize the stack and the action userdata ------------------------ */
799 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
800 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
801 I32 i, depth = 1, pad, offset, *origin;
803 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
805 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
808 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
809 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
810 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
813 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
815 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
816 ud, size, pad, offset));
818 for (i = cxstack_ix; i > cxix; --i) {
819 PERL_CONTEXT *cx = cxstack + i;
820 switch (CxTYPE(cx)) {
821 #if SU_HAS_PERL(5, 10, 0)
823 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
824 /* Given and when blocks are actually followed by a simple block, so skip
826 if (cxix > 0) { /* Implies i > 0 */
827 PERL_CONTEXT *next = cx - 1;
828 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
834 #if SU_HAS_PERL(5, 11, 0)
837 case CXt_LOOP_LAZYSV:
838 case CXt_LOOP_LAZYIV:
842 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
846 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
851 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
853 Newx(origin, depth + 1, I32);
854 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
855 PL_scopestack[PL_scopestack_ix - depth] += size;
856 for (i = depth - 1; i >= 1; --i) {
857 I32 j = PL_scopestack_ix - i;
858 origin[depth - i] = PL_scopestack[j];
859 PL_scopestack[j] += offset;
861 origin[depth] = PL_savestack_ix;
863 SU_UD_ORIGIN(ud) = origin;
864 SU_UD_DEPTH(ud) = depth;
867 /* Make sure the first destructor fires by pushing enough fake slots on the
869 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
870 <= PL_scopestack[PL_scopestack_ix - 1]) {
873 SU_D(PerlIO_printf(Perl_debug_log,
874 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
875 ud, PL_scopestack_ix, PL_savestack_ix));
876 SU_SAVE_PLACEHOLDER();
877 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
878 <= PL_scopestack[PL_scopestack_ix - 1]);
880 SU_D(PerlIO_printf(Perl_debug_log,
881 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
882 ud, PL_scopestack_ix, PL_savestack_ix));
883 SAVEDESTRUCTOR_X(su_pop, ud);
886 for (i = 0; i <= depth; ++i) {
887 I32 j = PL_scopestack_ix - i;
888 PerlIO_printf(Perl_debug_log,
889 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
890 ud, i, j, origin[depth - i],
891 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
898 /* --- Unwind stack -------------------------------------------------------- */
900 STATIC void su_unwind(pTHX_ void *ud_) {
902 I32 cxix = MY_CXT.unwind_storage.cxix;
903 I32 items = MY_CXT.unwind_storage.items - 1;
904 SV **savesp = MY_CXT.unwind_storage.savesp;
907 PERL_UNUSED_VAR(ud_);
910 PL_stack_sp = savesp;
912 if (cxstack_ix > cxix)
919 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
920 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
924 PerlIO_printf(Perl_debug_log,
925 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
927 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
928 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
931 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
932 PL_op = PL_op->op_ppaddr(aTHX);
934 *PL_markstack_ptr = mark;
936 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
937 PL_op = &(MY_CXT.unwind_storage.proxy_op);
940 /* --- Uplevel ------------------------------------------------------------- */
942 #ifndef OP_GIMME_REVERSE
943 STATIC U8 su_op_gimme_reverse(U8 gimme) {
946 return OPf_WANT_VOID;
948 return OPf_WANT_LIST;
953 return OPf_WANT_SCALAR;
955 #define OP_GIMME_REVERSE(G) su_op_gimme_reverse(G)
958 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
959 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
961 STATIC su_uplevel_ud *su_uplevel_storage_new(pTHX) {
962 #define su_uplevel_storage_new() su_uplevel_storage_new(aTHX)
966 sud = MY_CXT.uplevel_storage.root;
968 MY_CXT.uplevel_storage.root = sud->next;
969 MY_CXT.uplevel_storage.count--;
971 sud = su_uplevel_ud_new();
977 STATIC void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
978 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
981 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
982 su_uplevel_ud_delete(sud);
984 sud->next = MY_CXT.uplevel_storage.root;
985 MY_CXT.uplevel_storage.root = sud;
986 MY_CXT.uplevel_storage.count++;
990 #define SU_HAS_EXT_MAGIC SU_HAS_PERL(5, 8, 0)
992 #if SU_HAS_EXT_MAGIC && !SU_HAS_PERL(5, 13, 7)
994 STATIC int su_uplevel_restore_free(pTHX_ SV *sv, MAGIC *mg) {
995 su_uplevel_storage_delete((su_uplevel_ud *) mg->mg_ptr);
1000 STATIC MGVTBL su_uplevel_restore_vtbl = {
1005 su_uplevel_restore_free
1008 #endif /* SU_HAS_EXT_MAGIC && !SU_HAS_PERL(5, 13, 7) */
1010 STATIC void su_uplevel_restore(pTHX_ void *sus_) {
1011 su_uplevel_ud *sud = sus_;
1012 const PERL_CONTEXT *sub_cx;
1013 PERL_SI *cur = sud->old_curstackinfo;
1014 PERL_SI *si = sud->si;
1016 sub_cx = cxstack + sud->cxix;
1018 /* When we reach this place, POPSUB has already been called (with our fake
1019 * argarray). GvAV(PL_defgv) points to the savearray (that is, what @_ was
1020 * before uplevel). argarray is either the fake AV we created in su_uplevel()
1021 * or some empty replacement POPSUB creates when @_ is reified. In both cases
1022 * we have to destroy it before the context stack is swapped back to its
1023 * original state. */
1024 SvREFCNT_dec(sub_cx->blk_sub.argarray);
1026 /* PUSHSUB was exerted with the original callback, but after calling
1027 * pp_entersub() we hijacked the blk_sub.cv member of the fresh sub context
1028 * with the renamed CV. Thus POPSUB and LEAVESUB applied to this CV, not the
1029 * original. Repair this imbalance right now. */
1030 if (!(CvDEPTH(sud->callback) = sub_cx->blk_sub.olddepth))
1031 LEAVESUB(sud->callback);
1033 /* Free the renamed cv. */
1035 CV *renamed_cv = sub_cx->blk_sub.cv;
1036 CvDEPTH(renamed_cv) = 0;
1037 SvREFCNT_dec(renamed_cv);
1040 CATCH_SET(sud->old_catch);
1042 SU_UPLEVEL_RESTORE(op);
1044 /* stack_grow() wants PL_curstack so restore the old stack first */
1045 if (PL_curstackinfo == si) {
1046 PL_curstack = cur->si_stack;
1047 if (sud->old_mainstack)
1048 SU_UPLEVEL_RESTORE(mainstack);
1049 SU_UPLEVEL_RESTORE(curstackinfo);
1052 CV *target_cv = sud->target;
1055 /* When we die, the depth of the target CV is not updated because of the
1056 * stack switcheroo. So we have to look at all the frames between the
1057 * uplevel call and the catch block to count how many call frames to the
1058 * target CV were skipped. */
1059 for (i = cur->si_cxix; i > sud->cxix; i--) {
1060 register const PERL_CONTEXT *cx = cxstack + i;
1062 if (CxTYPE(cx) == CXt_SUB) {
1063 if (cx->blk_sub.cv == target_cv)
1068 /* If we died, the replacement stack was already unwinded to the first
1069 * eval frame, and all the contexts down there were popped. We don't have
1070 * to pop manually any context of the original stack, because they must
1071 * have been in the replacement stack as well (since the second was copied
1072 * from the first). Thus we only have to make sure the original stack index
1073 * points to the context just below the first eval scope under the target
1075 for (; i >= 0; i--) {
1076 register const PERL_CONTEXT *cx = cxstack + i;
1078 switch (CxTYPE(cx)) {
1080 if (cx->blk_sub.cv == target_cv)
1092 CvDEPTH(target_cv) = sud->old_depth - levels;
1093 PL_curstackinfo->si_cxix = i - 1;
1095 #if !SU_HAS_PERL(5, 13, 1)
1096 /* Since $@ was maybe localized between the target frame and the uplevel
1097 * call, we forcefully flush the save stack to get rid of it and then
1098 * reset $@ to its proper value. Note that the the call to
1099 * su_uplevel_restore() must happen before the "reset $@" item of the save
1100 * stack is processed, as uplevel was called after the localization.
1101 * Andrew's changes to how $@ was handled, which were mainly integrated
1102 * between perl 5.13.0 and 5.13.1, fixed this. */
1103 if (ERRSV && SvTRUE(ERRSV)) {
1104 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1105 SV *errsv = SvREFCNT_inc(ERRSV);
1106 PL_scopestack_ix = cx->blk_oldscopesp;
1107 leave_scope(PL_scopestack[PL_scopestack_ix]);
1108 sv_setsv(ERRSV, errsv);
1109 SvREFCNT_dec(errsv);
1115 SU_UPLEVEL_RESTORE(curcop);
1117 SvREFCNT_dec(sud->target);
1119 PL_stack_base = AvARRAY(cur->si_stack);
1120 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1121 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1123 /* When an exception is thrown from the uplevel'd subroutine,
1124 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1125 * die_where() in more recent perls), which has the sad habit of keeping a
1126 * pointer to the current context frame across this call. This means that we
1127 * can't free the temporary context stack we used for the uplevel call right
1128 * now, or that pointer upwards would point to garbage. */
1129 #if SU_HAS_PERL(5, 13, 7)
1130 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1131 * public in perl 5.13.7. */
1132 su_uplevel_storage_delete(sud);
1133 #elif SU_HAS_EXT_MAGIC
1134 /* If 'ext' magic is available, we work around this by attaching the state
1135 * data to a scalar that will be freed "soon". */
1137 SV *sv = sv_newmortal();
1139 sv_magicext(sv, NULL, PERL_MAGIC_ext, &su_uplevel_restore_vtbl,
1140 (const char *) sud, 0);
1143 /* Otherwise, we just enqueue it back in the global storage list. */
1147 sud->next = MY_CXT.uplevel_storage.root;
1148 MY_CXT.uplevel_storage.root = sud;
1149 MY_CXT.uplevel_storage.count++;
1156 STATIC CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1157 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1159 AV *protopadlist = CvPADLIST(proto);
1160 const AV *protopadname = (const AV *) *av_fetch(protopadlist, 0, FALSE);
1161 SV **pname = AvARRAY(protopadname);
1162 const I32 fpadlist = AvFILLp(protopadlist);
1163 const I32 fpadname = AvFILLp(protopadname);
1164 AV *padlist, *padname;
1167 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1169 CvFLAGS(cv) = CvFLAGS(proto);
1171 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1173 CvDEPTH(cv) = CvDEPTH(proto);
1175 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1177 CvFILE(cv) = CvFILE(proto);
1181 CvSTASH_set(cv, CvSTASH(proto));
1182 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1183 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1184 * (which was part of perl 5.13.7). */
1185 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1187 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1191 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1193 CvSTART(cv) = CvSTART(proto);
1194 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1195 #ifdef CVf_WEAKOUTSIDE
1196 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1198 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1199 #ifdef CvOUTSIDE_SEQ
1200 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1204 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1207 AvREAL_off(padlist);
1208 av_fill(padlist, fpadlist);
1209 CvPADLIST(cv) = padlist;
1212 av_fill(padname, fpadname);
1213 if (fpadname >= 0) {
1215 SV **psvp = AvARRAY(protopadname);
1216 SV **svp = AvARRAY(padname);
1218 svp[0] = &PL_sv_undef;
1219 for (j = 1; j <= fpadname; ++j)
1220 svp[j] = SvREFCNT_inc(psvp[j]);
1222 AvARRAY(padlist)[0] = MUTABLE_SV(padname);
1224 if (fpadlist >= 1) {
1227 for (i = 1; i <= fpadlist; ++i) {
1228 AV *protoframe = MUTABLE_AV(AvARRAY(protopadlist)[i]);
1229 AV *frame = newAV();
1230 SV **psvp = AvARRAY(protoframe);
1232 I32 j, fframe = AvFILLp(protoframe);
1234 av_fill(frame, fframe);
1235 svp = AvARRAY(frame);
1237 AV *a0 = newAV(); /* will be @_ */
1240 svp[0] = MUTABLE_SV(a0);
1242 svp[0] = SvREFCNT_inc(psvp[0]);
1244 for (j = 1; j <= fframe; ++j)
1245 svp[j] = SvREFCNT_inc(psvp[j]);
1247 AvARRAY(padlist)[i] = MUTABLE_SV(frame);
1259 STATIC I32 su_uplevel(pTHX_ CV *cv, I32 cxix, I32 args) {
1260 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1262 const PERL_CONTEXT *cx = cxstack + cxix;
1264 PERL_SI *cur = PL_curstackinfo;
1269 I32 old_mark, new_mark;
1276 /* Make PL_stack_sp point just before the CV. */
1277 PL_stack_sp -= args + 1;
1278 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1281 sud = su_uplevel_storage_new();
1286 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1290 si->si_type = cur->si_type;
1292 si->si_prev = cur->si_prev;
1294 si->si_markoff = cx->blk_oldmarksp;
1297 /* Allocate enough space for all the elements of the original stack up to the
1298 * target context, plus the forthcoming arguments. */
1299 new_mark = cx->blk_oldsp;
1300 av_extend(si->si_stack, new_mark + 1 + args + 1);
1301 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1302 AvFILLp(si->si_stack) = new_mark;
1303 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1305 /* Specialized SWITCHSTACK() */
1306 PL_stack_base = AvARRAY(si->si_stack);
1307 old_stack_sp = PL_stack_sp;
1308 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1309 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1312 /* Copy the context stack up to the context just below the target. */
1313 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1314 if (si->si_cxmax < cxix) {
1315 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1316 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1317 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1319 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1320 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1322 target_cv = cx->blk_sub.cv;
1323 sud->target = (CV *) SvREFCNT_inc(target_cv);
1324 sud->old_depth = CvDEPTH(target_cv);
1326 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1327 * run-time implication, since PL_curcop will be overwritten as soon as we
1328 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1329 * make it point to the blk_oldcop for the target frame, so that caller()
1330 * reports the right file name, line number and lexical hints. */
1331 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1332 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1333 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1335 SU_UPLEVEL_SAVE(curstackinfo, si);
1336 /* If those two are equal, we need to fool POPSTACK_TO() */
1337 if (PL_mainstack == PL_curstack)
1338 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1340 sud->old_mainstack = NULL;
1341 PL_curstack = si->si_stack;
1344 /* Both SP and old_stack_sp point just before the CV. */
1345 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1350 Zero(&sub_op, 1, UNOP);
1351 sub_op.op_type = OP_ENTERSUB;
1352 sub_op.op_next = NULL;
1353 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1355 sub_op.op_flags |= OPpENTERSUB_DB;
1357 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1359 sud->old_catch = CATCH_GET;
1362 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1363 PERL_CONTEXT *sub_cx;
1366 renamed_cv = su_cv_clone(cv, CvGV(target_cv));
1368 sub_cx = cxstack + cxstack_ix;
1369 sub_cx->blk_sub.cv = renamed_cv;
1370 if (!sub_cx->blk_sub.olddepth) {
1371 SvREFCNT_inc_simple_void(renamed_cv);
1372 SvREFCNT_inc_simple_void(renamed_cv);
1373 SAVEFREESV(renamed_cv);
1376 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1377 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1378 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1379 * with what we put on the stack. But we want to fake up the same arguments
1380 * as the ones in use at the context we uplevel to, so we replace the
1381 * argarray with an unreal copy of the original @_. */
1384 av_extend(av, AvMAX(cx->blk_sub.argarray));
1385 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1386 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1387 cxstack[cxix].blk_sub.argarray = av;
1389 SvREFCNT_inc_simple_void(cxstack[cxix].blk_sub.argarray);
1394 ret = PL_stack_sp - (PL_stack_base + new_mark);
1402 AV *old_stack = sud->old_curstackinfo->si_stack;
1404 if (old_mark + ret > AvMAX(old_stack)) {
1405 /* Specialized EXTEND(old_sp, ret) */
1406 av_extend(old_stack, old_mark + ret + 1);
1407 old_stack_sp = AvARRAY(old_stack) + old_mark;
1410 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1412 AvFILLp(old_stack) += ret;
1422 /* --- Interpreter setup/teardown ------------------------------------------ */
1424 STATIC void su_teardown(pTHX_ void *param) {
1428 cur = MY_CXT.uplevel_storage.root;
1430 su_uplevel_ud *prev;
1434 su_uplevel_ud_delete(prev);
1441 STATIC void su_setup(pTHX) {
1442 #define su_setup() su_setup(aTHX)
1445 MY_CXT.stack_placeholder = NULL;
1447 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
1448 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
1449 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
1450 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
1452 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
1453 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
1454 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
1456 MY_CXT.uplevel_storage.root = NULL;
1457 MY_CXT.uplevel_storage.count = 0;
1459 call_atexit(su_teardown, NULL);
1464 /* --- XS ------------------------------------------------------------------ */
1466 #if SU_HAS_PERL(5, 8, 9)
1467 # define SU_SKIP_DB_MAX 2
1469 # define SU_SKIP_DB_MAX 3
1472 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
1473 * followed by a DB sub */
1475 #define SU_SKIP_DB(C) \
1478 PERL_CONTEXT *base = cxstack; \
1479 PERL_CONTEXT *cx = base + (C); \
1480 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
1482 if (cx >= base && (C) > skipped) { \
1483 switch (CxTYPE(cx)) { \
1485 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
1486 (C) -= skipped + 1; \
1494 #define SU_GET_CONTEXT(A, B) \
1503 else if (cxix > cxstack_ix) \
1504 cxix = cxstack_ix; \
1507 cxix = cxstack_ix; \
1513 #define SU_GET_LEVEL(A, B) \
1519 level = SvIV(lsv); \
1526 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
1528 XS(XS_Scope__Upper_unwind) {
1537 PERL_UNUSED_VAR(cv); /* -W */
1538 PERL_UNUSED_VAR(ax); /* -Wall */
1540 SU_GET_CONTEXT(0, items - 1);
1542 PERL_CONTEXT *cx = cxstack + cxix;
1543 switch (CxTYPE(cx)) {
1545 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1549 MY_CXT.unwind_storage.cxix = cxix;
1550 MY_CXT.unwind_storage.items = items;
1551 /* pp_entersub will want to sanitize the stack after returning from there
1552 * Screw that, we're insane */
1553 if (GIMME_V == G_SCALAR) {
1554 MY_CXT.unwind_storage.savesp = PL_stack_sp;
1555 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
1556 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
1558 MY_CXT.unwind_storage.savesp = NULL;
1560 SAVEDESTRUCTOR_X(su_unwind, NULL);
1565 } while (--cxix >= 0);
1566 croak("Can't return outside a subroutine");
1569 MODULE = Scope::Upper PACKAGE = Scope::Upper
1577 stash = gv_stashpv(__PACKAGE__, 1);
1578 newCONSTSUB(stash, "TOP", newSViv(0));
1579 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
1581 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
1594 MY_CXT.uplevel_storage.root = NULL;
1595 MY_CXT.uplevel_storage.count = 0;
1599 #endif /* SU_THREADSAFE */
1605 I32 cxix = cxstack_ix;
1619 SU_GET_CONTEXT(0, 0);
1634 SU_GET_CONTEXT(0, 0);
1636 for (; cxix >= 0; --cxix) {
1637 PERL_CONTEXT *cx = cxstack + cxix;
1638 switch (CxTYPE(cx)) {
1642 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1656 SU_GET_CONTEXT(0, 0);
1658 for (; cxix >= 0; --cxix) {
1659 PERL_CONTEXT *cx = cxstack + cxix;
1660 switch (CxTYPE(cx)) {
1702 for (cxix = cxstack_ix; cxix > 0; --cxix) {
1703 PERL_CONTEXT *cx = cxstack + cxix;
1704 switch (CxTYPE(cx)) {
1706 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1726 SU_GET_CONTEXT(0, 0);
1729 PERL_CONTEXT *cx = cxstack + cxix--;
1730 switch (CxTYPE(cx)) {
1734 I32 gimme = cx->blk_gimme;
1736 case G_VOID: XSRETURN_UNDEF; break;
1737 case G_SCALAR: XSRETURN_NO; break;
1738 case G_ARRAY: XSRETURN_YES; break;
1753 SU_GET_CONTEXT(1, 1);
1754 Newx(ud, 1, su_ud_reap);
1755 SU_UD_ORIGIN(ud) = NULL;
1756 SU_UD_HANDLER(ud) = su_reap;
1757 ud->cb = newSVsv(hook);
1758 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1761 localize(SV *sv, SV *val, ...)
1768 SU_GET_CONTEXT(2, 2);
1769 Newx(ud, 1, su_ud_localize);
1770 SU_UD_ORIGIN(ud) = NULL;
1771 SU_UD_HANDLER(ud) = su_localize;
1772 size = su_ud_localize_init(ud, sv, val, NULL);
1773 su_init(ud, cxix, size);
1776 localize_elem(SV *sv, SV *elem, SV *val, ...)
1783 if (SvTYPE(sv) >= SVt_PVGV)
1784 croak("Can't infer the element localization type from a glob and the value");
1785 SU_GET_CONTEXT(3, 3);
1786 Newx(ud, 1, su_ud_localize);
1787 SU_UD_ORIGIN(ud) = NULL;
1788 SU_UD_HANDLER(ud) = su_localize;
1789 size = su_ud_localize_init(ud, sv, val, elem);
1790 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
1791 SU_UD_LOCALIZE_FREE(ud);
1792 croak("Can't localize an element of something that isn't an array or a hash");
1794 su_init(ud, cxix, size);
1797 localize_delete(SV *sv, SV *elem, ...)
1804 SU_GET_CONTEXT(2, 2);
1805 Newx(ud, 1, su_ud_localize);
1806 SU_UD_ORIGIN(ud) = NULL;
1807 SU_UD_HANDLER(ud) = su_localize;
1808 size = su_ud_localize_init(ud, sv, NULL, elem);
1809 su_init(ud, cxix, size);
1812 uplevel(SV *code, ...)
1815 I32 cxix, ret, args = 0;
1819 if (SvTYPE(code) < SVt_PVCV)
1820 croak("First argument to uplevel must be a code reference");
1821 SU_GET_CONTEXT(1, items - 1);
1823 PERL_CONTEXT *cx = cxstack + cxix;
1824 switch (CxTYPE(cx)) {
1826 croak("Can't uplevel to an eval frame");
1828 croak("Can't uplevel to a format frame");
1830 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1836 /* su_uplevel() takes care of extending the stack if needed. */
1837 ret = su_uplevel((CV *) code, cxix, args);
1842 } while (--cxix >= 0);
1843 croak("Can't uplevel outside a subroutine");