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 /* --- Unique context ID global storage ------------------------------------ */
184 /* ... Sequence ID counter ................................................. */
191 STATIC su_uv_array su_uid_seq_counter;
195 STATIC perl_mutex su_uid_seq_counter_mutex;
197 #define SU_LOCK(M) MUTEX_LOCK(M)
198 #define SU_UNLOCK(M) MUTEX_UNLOCK(M)
200 #else /* USE_ITHREADS */
205 #endif /* !USE_ITHREADS */
207 STATIC UV su_uid_seq_next(pTHX_ UV depth) {
208 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
212 SU_LOCK(&su_uid_seq_counter_mutex);
214 seqs = su_uid_seq_counter.seqs;
216 if (depth >= su_uid_seq_counter.size) {
219 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
220 for (i = su_uid_seq_counter.size; i <= depth; ++i)
223 su_uid_seq_counter.seqs = seqs;
224 su_uid_seq_counter.size = depth + 1;
229 SU_UNLOCK(&su_uid_seq_counter_mutex);
234 /* ... UID storage ......................................................... */
241 #define SU_UID_ACTIVE 1
243 STATIC UV su_uid_depth(pTHX_ I32 cxix) {
244 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
249 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
250 depth += si->si_cxix + 1;
261 STATIC void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
262 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
263 su_uid **old_map = old_cxt->map;
266 su_uid **new_map = new_cxt->map;
267 STRLEN old_used = old_cxt->used;
268 STRLEN old_alloc = old_cxt->alloc;
269 STRLEN new_used, new_alloc;
272 new_used = max_depth < old_used ? max_depth : old_used;
273 new_cxt->used = new_used;
275 if (new_used <= new_cxt->alloc)
276 new_alloc = new_cxt->alloc;
278 new_alloc = new_used;
279 Renew(new_map, new_alloc, su_uid *);
280 for (i = new_cxt->alloc; i < new_alloc; ++i)
282 new_cxt->map = new_map;
283 new_cxt->alloc = new_alloc;
286 for (i = 0; i < new_alloc; ++i) {
287 su_uid *new_uid = new_map[i];
289 if (i < new_used) { /* => i < max_depth && i < old_used */
290 su_uid *old_uid = old_map[i];
292 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
294 Newx(new_uid, 1, su_uid);
295 new_map[i] = new_uid;
303 new_uid->flags &= ~SU_UID_ACTIVE;
310 /* --- unwind() global storage --------------------------------------------- */
320 /* --- uplevel() data tokens and global storage ---------------------------- */
322 #define SU_UPLEVEL_HIJACKS_RUNOPS SU_HAS_PERL(5, 8, 0)
337 PERL_SI *old_curstackinfo;
342 #if SU_UPLEVEL_HIJACKS_RUNOPS
343 runops_proc_t old_runops;
348 su_uid_storage new_uid_storage, old_uid_storage;
351 STATIC su_uplevel_ud *su_uplevel_ud_new(pTHX) {
352 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
356 Newx(sud, 1, su_uplevel_ud);
359 sud->new_uid_storage.map = NULL;
360 sud->new_uid_storage.used = 0;
361 sud->new_uid_storage.alloc = 0;
363 Newx(si, 1, PERL_SI);
364 si->si_stack = newAV();
365 AvREAL_off(si->si_stack);
366 si->si_cxstack = NULL;
374 STATIC void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
375 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
376 PERL_SI *si = sud->si;
378 Safefree(si->si_cxstack);
379 SvREFCNT_dec(si->si_stack);
382 if (sud->new_uid_storage.map) {
383 su_uid **map = sud->new_uid_storage.map;
384 STRLEN alloc = sud->new_uid_storage.alloc;
387 for (i = 0; i < alloc; ++i)
402 } su_uplevel_storage;
404 #ifndef SU_UPLEVEL_STORAGE_SIZE
405 # define SU_UPLEVEL_STORAGE_SIZE 4
408 /* --- Global data --------------------------------------------------------- */
410 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
413 char *stack_placeholder;
414 su_unwind_storage unwind_storage;
415 su_uplevel_storage uplevel_storage;
416 su_uid_storage uid_storage;
421 /* --- Stack manipulations ------------------------------------------------- */
423 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
425 #define SU_SAVE_DESTRUCTOR_SIZE 3
426 #define SU_SAVE_PLACEHOLDER_SIZE 3
428 #define SU_SAVE_SCALAR_SIZE 3
430 #define SU_SAVE_ARY_SIZE 3
431 #define SU_SAVE_AELEM_SIZE 4
433 # define SU_SAVE_ADELETE_SIZE 3
435 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
437 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
438 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
440 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
443 #define SU_SAVE_HASH_SIZE 3
444 #define SU_SAVE_HELEM_SIZE 4
445 #define SU_SAVE_HDELETE_SIZE 4
446 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
447 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
449 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
452 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
454 #if !SU_HAS_PERL(5, 8, 9)
455 # define SU_SAVE_GP_SIZE 6
456 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
457 # define SU_SAVE_GP_SIZE 3
458 #elif !SU_HAS_PERL(5, 13, 8)
459 # define SU_SAVE_GP_SIZE 4
461 # define SU_SAVE_GP_SIZE 3
464 #ifndef SvCANEXISTDELETE
465 # define SvCANEXISTDELETE(sv) \
467 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
468 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
469 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
470 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
475 /* ... Saving array elements ............................................... */
477 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
478 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
484 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
485 #if SU_HAS_PERL(5, 8, 1)
486 if (SvRMAGICAL(av)) {
487 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
489 SV * const * const negative_indices_glob =
490 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
491 NEGATIVE_INDICES_VAR, 16, 0);
492 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
498 idx = key + av_len(av) + 1;
512 STATIC void su_adelete(pTHX_ void *ud_) {
513 su_ud_adelete *ud = (su_ud_adelete *) ud_;
515 av_delete(ud->av, ud->idx, G_DISCARD);
516 SvREFCNT_dec(ud->av);
521 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
522 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
525 Newx(ud, 1, su_ud_adelete);
528 SvREFCNT_inc_simple_void(av);
530 SAVEDESTRUCTOR_X(su_adelete, ud);
533 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
535 #endif /* SAVEADELETE */
537 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
538 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
545 idx = su_av_key2idx(av, SvIV(key));
547 if (SvCANEXISTDELETE(av))
548 preeminent = av_exists(av, idx);
550 svp = av_fetch(av, idx, 1);
551 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
554 save_aelem(av, idx, svp);
556 SAVEADELETE(av, idx);
558 if (val) { /* local $x[$idx] = $val; */
559 SvSetMagicSV(*svp, val);
560 } else { /* local $x[$idx]; delete $x[$idx]; */
561 av_delete(av, idx, G_DISCARD);
565 /* ... Saving hash elements ................................................ */
567 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
568 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
575 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
576 preeminent = hv_exists_ent(hv, keysv, 0);
578 he = hv_fetch_ent(hv, keysv, 1, 0);
579 svp = he ? &HeVAL(he) : NULL;
580 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
582 if (HvNAME_get(hv) && isGV(*svp)) {
583 save_gp((GV *) *svp, 0);
588 save_helem(hv, keysv, svp);
591 const char * const key = SvPV_const(keysv, keylen);
592 SAVEDELETE(hv, savepvn(key, keylen),
593 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
596 if (val) { /* local $x{$keysv} = $val; */
597 SvSetMagicSV(*svp, val);
598 } else { /* local $x{$keysv}; delete $x{$keysv}; */
599 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
603 /* ... Saving code slots from a glob ....................................... */
605 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
606 # define mro_method_changed_in(G) PL_sub_generation++
614 STATIC void su_restore_gvcv(pTHX_ void *ud_) {
615 su_save_gvcv_ud *ud = ud_;
618 GvCV_set(gv, ud->old_cv);
620 mro_method_changed_in(GvSTASH(gv));
625 STATIC void su_save_gvcv(pTHX_ GV *gv) {
626 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
629 Newx(ud, 1, su_save_gvcv_ud);
631 ud->old_cv = GvCV(gv);
635 mro_method_changed_in(GvSTASH(gv));
637 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
640 /* --- Actions ------------------------------------------------------------- */
646 void (*handler)(pTHX_ void *);
649 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
650 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
651 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
652 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
654 #define SU_UD_FREE(U) STMT_START { \
655 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
659 /* ... Reap ................................................................ */
666 STATIC void su_call(pTHX_ void *ud_) {
667 su_ud_reap *ud = (su_ud_reap *) ud_;
668 #if SU_HAS_PERL(5, 9, 5)
669 PERL_CONTEXT saved_cx;
676 PerlIO_printf(Perl_debug_log,
677 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
678 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
687 /* If the recently popped context isn't saved there, it will be overwritten by
688 * the sub scope from call_sv, although it's still needed in our caller. */
690 #if SU_HAS_PERL(5, 9, 5)
691 if (cxstack_ix < cxstack_max)
692 cxix = cxstack_ix + 1;
694 cxix = Perl_cxinc(aTHX);
695 saved_cx = cxstack[cxix];
698 call_sv(ud->cb, G_VOID);
700 #if SU_HAS_PERL(5, 9, 5)
701 cxstack[cxix] = saved_cx;
709 SvREFCNT_dec(ud->cb);
713 STATIC void su_reap(pTHX_ void *ud) {
714 #define su_reap(U) su_reap(aTHX_ (U))
716 PerlIO_printf(Perl_debug_log,
717 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
718 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
721 SAVEDESTRUCTOR_X(su_call, ud);
724 /* ... Localize & localize array/hash element .............................. */
734 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
735 SvREFCNT_dec((U)->elem); \
736 SvREFCNT_dec((U)->val); \
737 SvREFCNT_dec((U)->sv); \
741 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
742 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
747 SvREFCNT_inc_simple_void(sv);
749 if (SvTYPE(sv) >= SVt_PVGV) {
750 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
752 } else { /* local *x = \$val; */
753 t = SvTYPE(SvRV(val));
756 } else if (SvROK(sv)) {
757 croak("Invalid %s reference as the localization target",
758 sv_reftype(SvRV(sv), 0));
761 const char *p = SvPV_const(sv, len), *s;
762 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
768 case '$': t = SVt_PV; break;
769 case '@': t = SVt_PVAV; break;
770 case '%': t = SVt_PVHV; break;
771 case '&': t = SVt_PVCV; break;
772 case '*': t = SVt_PVGV; break;
777 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
778 if (SvROK(val) && !sv_isobject(val)) {
779 t = SvTYPE(SvRV(val));
791 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
796 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
801 size = SU_SAVE_GP_SIZE;
805 size = SU_SAVE_GVCV_SIZE;
809 size = SU_SAVE_SCALAR_SIZE;
812 /* When deref is set, val isn't NULL */
815 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
816 ud->elem = SvREFCNT_inc(elem);
822 STATIC void su_localize(pTHX_ void *ud_) {
823 #define su_localize(U) su_localize(aTHX_ (U))
824 su_ud_localize *ud = (su_ud_localize *) ud_;
831 if (SvTYPE(sv) >= SVt_PVGV) {
835 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
838 const char *name = SvPV_const(sv, len);
839 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
846 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
847 PerlIO_printf(Perl_debug_log,
848 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
849 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
853 /* Inspired from Alias.pm */
857 su_save_aelem(GvAV(gv), elem, val);
864 su_save_helem(GvHV(gv), elem, val);
870 save_gp(gv, 1); /* hide previous entry in symtab */
876 gv = (GV *) save_scalar(gv);
881 SvSetMagicSV((SV *) gv, val);
884 SU_UD_LOCALIZE_FREE(ud);
887 /* --- Pop a context back -------------------------------------------------- */
891 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
893 # define SU_CXNAME "XXX"
897 STATIC void su_pop(pTHX_ void *ud) {
898 #define su_pop(U) su_pop(aTHX_ (U))
899 I32 depth, base, mark, *origin;
900 depth = SU_UD_DEPTH(ud);
903 PerlIO_printf(Perl_debug_log,
905 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
907 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
910 origin = SU_UD_ORIGIN(ud);
911 mark = origin[depth];
912 base = origin[depth - 1];
914 SU_D(PerlIO_printf(Perl_debug_log,
915 "%p: original scope was %*c top=%2d base=%2d\n",
916 ud, 24, ' ', mark, base));
919 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
920 PL_savestack_ix = mark;
923 PL_savestack_ix = base;
925 SU_UD_DEPTH(ud) = --depth;
930 if ((pad = SU_UD_PAD(ud))) {
933 SU_D(PerlIO_printf(Perl_debug_log,
934 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
935 ud, depth, PL_scopestack_ix, PL_savestack_ix));
936 SU_SAVE_PLACEHOLDER();
940 SU_D(PerlIO_printf(Perl_debug_log,
941 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
942 ud, depth, PL_scopestack_ix, PL_savestack_ix));
943 SAVEDESTRUCTOR_X(su_pop, ud);
945 SU_UD_HANDLER(ud)(aTHX_ ud);
948 SU_D(PerlIO_printf(Perl_debug_log,
949 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
950 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
953 /* --- Initialize the stack and the action userdata ------------------------ */
955 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
956 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
957 I32 i, depth = 1, pad, offset, *origin;
959 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
961 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
964 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
965 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
966 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
969 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
971 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
972 ud, size, pad, offset));
974 for (i = cxstack_ix; i > cxix; --i) {
975 PERL_CONTEXT *cx = cxstack + i;
976 switch (CxTYPE(cx)) {
977 #if SU_HAS_PERL(5, 10, 0)
979 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
980 /* Given and when blocks are actually followed by a simple block, so skip
982 if (cxix > 0) { /* Implies i > 0 */
983 PERL_CONTEXT *next = cx - 1;
984 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
990 #if SU_HAS_PERL(5, 11, 0)
993 case CXt_LOOP_LAZYSV:
994 case CXt_LOOP_LAZYIV:
998 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
1002 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
1007 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
1009 Newx(origin, depth + 1, I32);
1010 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
1011 PL_scopestack[PL_scopestack_ix - depth] += size;
1012 for (i = depth - 1; i >= 1; --i) {
1013 I32 j = PL_scopestack_ix - i;
1014 origin[depth - i] = PL_scopestack[j];
1015 PL_scopestack[j] += offset;
1017 origin[depth] = PL_savestack_ix;
1019 SU_UD_ORIGIN(ud) = origin;
1020 SU_UD_DEPTH(ud) = depth;
1021 SU_UD_PAD(ud) = pad;
1023 /* Make sure the first destructor fires by pushing enough fake slots on the
1025 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1026 <= PL_scopestack[PL_scopestack_ix - 1]) {
1029 SU_D(PerlIO_printf(Perl_debug_log,
1030 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1031 ud, PL_scopestack_ix, PL_savestack_ix));
1032 SU_SAVE_PLACEHOLDER();
1033 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1034 <= PL_scopestack[PL_scopestack_ix - 1]);
1036 SU_D(PerlIO_printf(Perl_debug_log,
1037 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1038 ud, PL_scopestack_ix, PL_savestack_ix));
1039 SAVEDESTRUCTOR_X(su_pop, ud);
1042 for (i = 0; i <= depth; ++i) {
1043 I32 j = PL_scopestack_ix - i;
1044 PerlIO_printf(Perl_debug_log,
1045 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1046 ud, i, j, origin[depth - i],
1047 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1054 /* --- Unwind stack -------------------------------------------------------- */
1056 STATIC void su_unwind(pTHX_ void *ud_) {
1058 I32 cxix = MY_CXT.unwind_storage.cxix;
1059 I32 items = MY_CXT.unwind_storage.items - 1;
1060 SV **savesp = MY_CXT.unwind_storage.savesp;
1063 PERL_UNUSED_VAR(ud_);
1066 PL_stack_sp = savesp;
1068 if (cxstack_ix > cxix)
1071 /* Hide the level */
1075 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1076 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1079 I32 gimme = GIMME_V;
1080 PerlIO_printf(Perl_debug_log,
1081 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1083 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1084 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1087 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1088 PL_op = PL_op->op_ppaddr(aTHX);
1090 *PL_markstack_ptr = mark;
1092 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1093 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1096 /* --- Uplevel ------------------------------------------------------------- */
1098 #ifndef OP_GIMME_REVERSE
1099 STATIC U8 su_op_gimme_reverse(U8 gimme) {
1102 return OPf_WANT_VOID;
1104 return OPf_WANT_LIST;
1109 return OPf_WANT_SCALAR;
1111 #define OP_GIMME_REVERSE(G) su_op_gimme_reverse(G)
1114 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1115 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1117 STATIC su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1118 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1123 sud = MY_CXT.uplevel_storage.root;
1125 MY_CXT.uplevel_storage.root = sud->next;
1126 MY_CXT.uplevel_storage.count--;
1128 sud = su_uplevel_ud_new();
1131 sud->next = MY_CXT.uplevel_storage.top;
1132 MY_CXT.uplevel_storage.top = sud;
1134 depth = su_uid_depth(cxix);
1135 su_uid_storage_dup(&sud->new_uid_storage, &MY_CXT.uid_storage, depth);
1136 sud->old_uid_storage = MY_CXT.uid_storage;
1137 MY_CXT.uid_storage = sud->new_uid_storage;
1142 STATIC void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1143 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1146 sud->new_uid_storage = MY_CXT.uid_storage;
1147 MY_CXT.uid_storage = sud->old_uid_storage;
1151 map = sud->new_uid_storage.map;
1152 alloc = sud->new_uid_storage.alloc;
1153 for (i = 0; i < alloc; ++i) {
1155 map[i]->flags &= SU_UID_ACTIVE;
1158 MY_CXT.uplevel_storage.top = sud->next;
1160 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1161 su_uplevel_ud_delete(sud);
1163 sud->next = MY_CXT.uplevel_storage.root;
1164 MY_CXT.uplevel_storage.root = sud;
1165 MY_CXT.uplevel_storage.count++;
1169 STATIC int su_uplevel_goto_static(const OP *o) {
1170 for (; o; o = o->op_sibling) {
1171 /* goto ops are unops with kids. */
1172 if (!(o->op_flags & OPf_KIDS))
1175 switch (o->op_type) {
1178 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1183 if (su_uplevel_goto_static(cUNOPo->op_first))
1192 #if SU_UPLEVEL_HIJACKS_RUNOPS
1194 STATIC int su_uplevel_goto_runops(pTHX) {
1195 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1201 if (op->op_type == OP_GOTO) {
1202 AV *argarray = NULL;
1205 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1206 const PERL_CONTEXT *cx = cxstack + cxix;
1208 switch (CxTYPE(cx)) {
1210 if (CxHASARGS(cx)) {
1211 argarray = cx->blk_sub.argarray;
1227 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1228 AV *args = GvAV(PL_defgv);
1229 I32 items = AvFILLp(args);
1231 av_extend(argarray, items);
1232 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1233 AvFILLp(argarray) = items;
1238 PL_op = op = op->op_ppaddr(aTHX);
1240 #if !SU_HAS_PERL(5, 13, 0)
1250 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1252 #define su_at_underscore(C) AvARRAY(AvARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1254 STATIC void su_uplevel_restore(pTHX_ void *sus_) {
1255 su_uplevel_ud *sud = sus_;
1256 PERL_SI *cur = sud->old_curstackinfo;
1257 PERL_SI *si = sud->si;
1259 #if SU_UPLEVEL_HIJACKS_RUNOPS
1260 if (PL_runops == su_uplevel_goto_runops)
1261 PL_runops = sud->old_runops;
1264 if (sud->callback) {
1265 PERL_CONTEXT *cx = cxstack + sud->cxix;
1266 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1268 /* We have to fix the pad entry for @_ in the original callback because it
1269 * may have been reified. */
1270 if (AvREAL(argarray)) {
1271 const I32 fill = AvFILLp(argarray);
1272 SvREFCNT_dec(argarray);
1274 AvREAL_off(argarray);
1275 AvREIFY_on(argarray);
1276 av_extend(argarray, fill);
1277 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1279 CLEAR_ARGARRAY(argarray);
1282 /* If the old cv member is our renamed CV, it means that this place has been
1283 * reached without a goto() happening, and the old argarray member is
1284 * actually our fake argarray. Destroy it properly in that case. */
1285 if (cx->blk_sub.cv == sud->renamed) {
1286 SvREFCNT_dec(cx->blk_sub.argarray);
1287 cx->blk_sub.argarray = argarray;
1290 CvDEPTH(sud->callback)--;
1291 SvREFCNT_dec(sud->callback);
1294 /* Free the renamed CV. We must do it ourselves so that we can force the
1295 * depth to be 0, or perl would complain about it being "still in use".
1296 * But we *know* that it cannot be so. */
1298 CvDEPTH(sud->renamed) = 0;
1299 CvPADLIST(sud->renamed) = NULL;
1300 SvREFCNT_dec(sud->renamed);
1303 CATCH_SET(sud->old_catch);
1305 SU_UPLEVEL_RESTORE(op);
1307 /* stack_grow() wants PL_curstack so restore the old stack first */
1308 if (PL_curstackinfo == si) {
1309 PL_curstack = cur->si_stack;
1310 if (sud->old_mainstack)
1311 SU_UPLEVEL_RESTORE(mainstack);
1312 SU_UPLEVEL_RESTORE(curstackinfo);
1315 CV *target = sud->target;
1318 /* When we die, the depth of the target CV is not updated because of the
1319 * stack switcheroo. So we have to look at all the frames between the
1320 * uplevel call and the catch block to count how many call frames to the
1321 * target CV were skipped. */
1322 for (i = cur->si_cxix; i > sud->cxix; i--) {
1323 register const PERL_CONTEXT *cx = cxstack + i;
1325 if (CxTYPE(cx) == CXt_SUB) {
1326 if (cx->blk_sub.cv == target)
1331 /* If we died, the replacement stack was already unwinded to the first
1332 * eval frame, and all the contexts down there were popped. We don't have
1333 * to pop manually any context of the original stack, because they must
1334 * have been in the replacement stack as well (since the second was copied
1335 * from the first). Thus we only have to make sure the original stack index
1336 * points to the context just below the first eval scope under the target
1338 for (; i >= 0; i--) {
1339 register const PERL_CONTEXT *cx = cxstack + i;
1341 switch (CxTYPE(cx)) {
1343 if (cx->blk_sub.cv == target)
1355 CvDEPTH(target) = sud->target_depth - levels;
1356 PL_curstackinfo->si_cxix = i - 1;
1358 #if !SU_HAS_PERL(5, 13, 1)
1359 /* Since $@ was maybe localized between the target frame and the uplevel
1360 * call, we forcefully flush the save stack to get rid of it and then
1361 * reset $@ to its proper value. Note that the the call to
1362 * su_uplevel_restore() must happen before the "reset $@" item of the save
1363 * stack is processed, as uplevel was called after the localization.
1364 * Andrew's changes to how $@ was handled, which were mainly integrated
1365 * between perl 5.13.0 and 5.13.1, fixed this. */
1366 if (ERRSV && SvTRUE(ERRSV)) {
1367 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1368 SV *errsv = SvREFCNT_inc(ERRSV);
1369 PL_scopestack_ix = cx->blk_oldscopesp;
1370 leave_scope(PL_scopestack[PL_scopestack_ix]);
1371 sv_setsv(ERRSV, errsv);
1372 SvREFCNT_dec(errsv);
1378 SU_UPLEVEL_RESTORE(curcop);
1380 SvREFCNT_dec(sud->target);
1382 PL_stack_base = AvARRAY(cur->si_stack);
1383 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1384 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1386 /* When an exception is thrown from the uplevel'd subroutine,
1387 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1388 * die_where() in more recent perls), which has the sad habit of keeping a
1389 * pointer to the current context frame across this call. This means that we
1390 * can't free the temporary context stack we used for the uplevel call right
1391 * now, or that pointer upwards would point to garbage. */
1392 #if SU_HAS_PERL(5, 13, 7)
1393 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1394 * public in perl 5.13.7. */
1395 su_uplevel_storage_delete(sud);
1397 /* Otherwise, we just enqueue it back in the global storage list. */
1401 sud->new_uid_storage = MY_CXT.uid_storage;
1402 MY_CXT.uid_storage = sud->old_uid_storage;
1404 MY_CXT.uplevel_storage.top = sud->next;
1405 sud->next = MY_CXT.uplevel_storage.root;
1406 MY_CXT.uplevel_storage.root = sud;
1407 MY_CXT.uplevel_storage.count++;
1414 STATIC CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1415 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1419 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1421 CvFLAGS(cv) = CvFLAGS(proto);
1423 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1425 CvDEPTH(cv) = CvDEPTH(proto);
1427 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1429 CvFILE(cv) = CvFILE(proto);
1433 CvSTASH_set(cv, CvSTASH(proto));
1434 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1435 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1436 * (which was part of perl 5.13.7). */
1437 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1439 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1442 if (CvISXSUB(proto)) {
1443 CvXSUB(cv) = CvXSUB(proto);
1444 CvXSUBANY(cv) = CvXSUBANY(proto);
1447 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1449 CvSTART(cv) = CvSTART(proto);
1451 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1452 #ifdef CVf_WEAKOUTSIDE
1453 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1455 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1456 CvPADLIST(cv) = CvPADLIST(proto);
1457 #ifdef CvOUTSIDE_SEQ
1458 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1462 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1472 STATIC I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1473 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1475 const PERL_CONTEXT *cx = cxstack + cxix;
1477 PERL_SI *cur = PL_curstackinfo;
1483 I32 old_mark, new_mark;
1490 /* Make PL_stack_sp point just before the CV. */
1491 PL_stack_sp -= args + 1;
1492 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1495 sud = su_uplevel_storage_new(cxix);
1499 sud->callback = NULL;
1500 sud->renamed = NULL;
1501 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1505 si->si_type = cur->si_type;
1507 si->si_prev = cur->si_prev;
1509 si->si_markoff = cx->blk_oldmarksp;
1512 /* Allocate enough space for all the elements of the original stack up to the
1513 * target context, plus the forthcoming arguments. */
1514 new_mark = cx->blk_oldsp;
1515 av_extend(si->si_stack, new_mark + 1 + args + 1);
1516 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1517 AvFILLp(si->si_stack) = new_mark;
1518 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1520 /* Specialized SWITCHSTACK() */
1521 PL_stack_base = AvARRAY(si->si_stack);
1522 old_stack_sp = PL_stack_sp;
1523 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1524 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1527 /* Copy the context stack up to the context just below the target. */
1528 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1529 if (si->si_cxmax < cxix) {
1530 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1531 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1532 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1534 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1535 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1537 target = cx->blk_sub.cv;
1538 sud->target = (CV *) SvREFCNT_inc(target);
1539 sud->target_depth = CvDEPTH(target);
1541 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1542 * run-time implication, since PL_curcop will be overwritten as soon as we
1543 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1544 * make it point to the blk_oldcop for the target frame, so that caller()
1545 * reports the right file name, line number and lexical hints. */
1546 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1547 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1548 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1550 SU_UPLEVEL_SAVE(curstackinfo, si);
1551 /* If those two are equal, we need to fool POPSTACK_TO() */
1552 if (PL_mainstack == PL_curstack)
1553 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1555 sud->old_mainstack = NULL;
1556 PL_curstack = si->si_stack;
1558 renamed = su_cv_clone(callback, CvGV(target));
1559 sud->renamed = renamed;
1562 /* Both SP and old_stack_sp point just before the CV. */
1563 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1565 PUSHs((SV *) renamed);
1568 Zero(&sub_op, 1, UNOP);
1569 sub_op.op_type = OP_ENTERSUB;
1570 sub_op.op_next = NULL;
1571 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1573 sub_op.op_flags |= OPpENTERSUB_DB;
1575 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1577 #if SU_UPLEVEL_HIJACKS_RUNOPS
1578 sud->old_runops = PL_runops;
1581 sud->old_catch = CATCH_GET;
1584 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1585 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1587 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1590 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1591 CvDEPTH(callback)++;
1593 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1594 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1595 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1596 * with what we put on the stack. But we want to fake up the same arguments
1597 * as the ones in use at the context we uplevel to, so we replace the
1598 * argarray with an unreal copy of the original @_. */
1602 av_extend(av, AvMAX(cx->blk_sub.argarray));
1603 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1604 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1605 sub_cx->blk_sub.argarray = av;
1607 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1610 if (su_uplevel_goto_static(CvROOT(renamed))) {
1611 #if SU_UPLEVEL_HIJACKS_RUNOPS
1612 if (PL_runops != PL_runops_std) {
1613 if (PL_runops == PL_runops_dbg) {
1615 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1616 } else if (PL_runops != su_uplevel_goto_runops)
1617 croak("uplevel() can't execute code that calls goto with a custom runloop");
1620 PL_runops = su_uplevel_goto_runops;
1621 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1622 croak("uplevel() can't execute code that calls goto before perl 5.8");
1623 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1631 ret = PL_stack_sp - (PL_stack_base + new_mark);
1633 AV *old_stack = sud->old_curstackinfo->si_stack;
1635 if (old_mark + ret > AvMAX(old_stack)) {
1636 /* Specialized EXTEND(old_sp, ret) */
1637 av_extend(old_stack, old_mark + ret + 1);
1638 old_stack_sp = AvARRAY(old_stack) + old_mark;
1641 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1643 AvFILLp(old_stack) += ret;
1651 /* --- Unique context ID --------------------------------------------------- */
1653 STATIC su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1654 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1659 map = MY_CXT.uid_storage.map;
1660 alloc = MY_CXT.uid_storage.alloc;
1662 if (depth >= alloc) {
1665 Renew(map, depth + 1, su_uid *);
1666 for (i = alloc; i <= depth; ++i)
1669 MY_CXT.uid_storage.map = map;
1670 MY_CXT.uid_storage.alloc = depth + 1;
1676 Newx(uid, 1, su_uid);
1682 if (depth >= MY_CXT.uid_storage.used)
1683 MY_CXT.uid_storage.used = depth + 1;
1688 STATIC int su_uid_storage_check(pTHX_ UV depth, UV seq) {
1689 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
1693 if (depth >= MY_CXT.uid_storage.used)
1696 uid = MY_CXT.uid_storage.map[depth];
1698 return uid && (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
1701 STATIC void su_uid_drop(pTHX_ void *ud_) {
1704 uid->flags &= ~SU_UID_ACTIVE;
1707 STATIC void su_uid_bump(pTHX_ void *ud_) {
1708 su_ud_reap *ud = ud_;
1710 SAVEDESTRUCTOR_X(su_uid_drop, ud->cb);
1713 STATIC SV *su_uid_get(pTHX_ I32 cxix) {
1714 #define su_uid_get(I) su_uid_get(aTHX_ (I))
1719 depth = su_uid_depth(cxix);
1720 uid = su_uid_storage_fetch(depth);
1722 if (!(uid->flags & SU_UID_ACTIVE)) {
1725 uid->seq = su_uid_seq_next(depth);
1726 uid->flags |= SU_UID_ACTIVE;
1728 Newx(ud, 1, su_ud_reap);
1729 SU_UD_ORIGIN(ud) = NULL;
1730 SU_UD_HANDLER(ud) = su_uid_bump;
1731 ud->cb = (SV *) uid;
1732 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1735 uid_sv = sv_newmortal();
1736 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
1742 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
1744 #else /* grok_number */
1746 #define IS_NUMBER_IN_UV 0x1
1748 STATIC int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
1749 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
1753 /* This crude check should be good enough for a fallback implementation.
1754 * Better be too strict than too lax. */
1755 for (i = 0; i < len; ++i) {
1760 tmpsv = sv_newmortal();
1761 sv_setpvn(tmpsv, s, len);
1762 *valuep = sv_2uv(tmpsv);
1764 return IS_NUMBER_IN_UV;
1767 #endif /* !grok_number */
1769 STATIC int su_uid_validate(pTHX_ SV *uid) {
1770 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
1776 s = SvPV_const(uid, len);
1778 while (p < len && s[p] != '-')
1781 croak("UID contains only one part");
1783 type = su_grok_number(s, p, &depth);
1784 if (type != IS_NUMBER_IN_UV)
1785 croak("First UID part is not an unsigned integer");
1787 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
1789 type = su_grok_number(s + p, len - p, &seq);
1790 if (type != IS_NUMBER_IN_UV)
1791 croak("Second UID part is not an unsigned integer");
1793 return su_uid_storage_check(depth, seq);
1796 /* --- Interpreter setup/teardown ------------------------------------------ */
1798 STATIC void su_teardown(pTHX_ void *param) {
1803 map = MY_CXT.uid_storage.map;
1806 for (i = 0; i < MY_CXT.uid_storage.used; ++i)
1811 cur = MY_CXT.uplevel_storage.root;
1813 su_uplevel_ud *prev;
1817 su_uplevel_ud_delete(prev);
1824 STATIC void su_setup(pTHX) {
1825 #define su_setup() su_setup(aTHX)
1828 MY_CXT.stack_placeholder = NULL;
1830 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
1831 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
1832 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
1833 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
1835 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
1836 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
1837 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
1839 MY_CXT.uplevel_storage.top = NULL;
1840 MY_CXT.uplevel_storage.root = NULL;
1841 MY_CXT.uplevel_storage.count = 0;
1843 MY_CXT.uid_storage.map = NULL;
1844 MY_CXT.uid_storage.used = 0;
1845 MY_CXT.uid_storage.alloc = 0;
1847 call_atexit(su_teardown, NULL);
1852 /* --- XS ------------------------------------------------------------------ */
1854 #if SU_HAS_PERL(5, 8, 9)
1855 # define SU_SKIP_DB_MAX 2
1857 # define SU_SKIP_DB_MAX 3
1860 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
1861 * followed by a DB sub */
1863 #define SU_SKIP_DB(C) \
1866 PERL_CONTEXT *base = cxstack; \
1867 PERL_CONTEXT *cx = base + (C); \
1868 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
1870 if (cx >= base && (C) > skipped) { \
1871 switch (CxTYPE(cx)) { \
1873 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
1874 (C) -= skipped + 1; \
1882 #define SU_GET_CONTEXT(A, B) \
1891 else if (cxix > cxstack_ix) \
1892 cxix = cxstack_ix; \
1895 cxix = cxstack_ix; \
1901 #define SU_GET_LEVEL(A, B) \
1907 level = SvIV(lsv); \
1914 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
1916 XS(XS_Scope__Upper_unwind) {
1925 PERL_UNUSED_VAR(cv); /* -W */
1926 PERL_UNUSED_VAR(ax); /* -Wall */
1928 SU_GET_CONTEXT(0, items - 1);
1930 PERL_CONTEXT *cx = cxstack + cxix;
1931 switch (CxTYPE(cx)) {
1933 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1937 MY_CXT.unwind_storage.cxix = cxix;
1938 MY_CXT.unwind_storage.items = items;
1939 /* pp_entersub will want to sanitize the stack after returning from there
1940 * Screw that, we're insane */
1941 if (GIMME_V == G_SCALAR) {
1942 MY_CXT.unwind_storage.savesp = PL_stack_sp;
1943 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
1944 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
1946 MY_CXT.unwind_storage.savesp = NULL;
1948 SAVEDESTRUCTOR_X(su_unwind, NULL);
1953 } while (--cxix >= 0);
1954 croak("Can't return outside a subroutine");
1957 MODULE = Scope::Upper PACKAGE = Scope::Upper
1965 MUTEX_INIT(&su_uid_seq_counter_mutex);
1967 su_uid_seq_counter.seqs = NULL;
1968 su_uid_seq_counter.size = 0;
1970 stash = gv_stashpv(__PACKAGE__, 1);
1971 newCONSTSUB(stash, "TOP", newSViv(0));
1972 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
1974 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
1985 su_uid_storage new_cxt;
1992 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
1996 MY_CXT.uplevel_storage.top = NULL;
1997 MY_CXT.uplevel_storage.root = NULL;
1998 MY_CXT.uplevel_storage.count = 0;
1999 MY_CXT.uid_storage = new_cxt;
2003 #endif /* SU_THREADSAFE */
2009 I32 cxix = cxstack_ix;
2023 SU_GET_CONTEXT(0, 0);
2038 SU_GET_CONTEXT(0, 0);
2040 for (; cxix >= 0; --cxix) {
2041 PERL_CONTEXT *cx = cxstack + cxix;
2042 switch (CxTYPE(cx)) {
2046 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2060 SU_GET_CONTEXT(0, 0);
2062 for (; cxix >= 0; --cxix) {
2063 PERL_CONTEXT *cx = cxstack + cxix;
2064 switch (CxTYPE(cx)) {
2106 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2107 PERL_CONTEXT *cx = cxstack + cxix;
2108 switch (CxTYPE(cx)) {
2110 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2130 SU_GET_CONTEXT(0, 0);
2133 PERL_CONTEXT *cx = cxstack + cxix--;
2134 switch (CxTYPE(cx)) {
2138 I32 gimme = cx->blk_gimme;
2140 case G_VOID: XSRETURN_UNDEF; break;
2141 case G_SCALAR: XSRETURN_NO; break;
2142 case G_ARRAY: XSRETURN_YES; break;
2157 SU_GET_CONTEXT(1, 1);
2158 Newx(ud, 1, su_ud_reap);
2159 SU_UD_ORIGIN(ud) = NULL;
2160 SU_UD_HANDLER(ud) = su_reap;
2161 ud->cb = newSVsv(hook);
2162 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2165 localize(SV *sv, SV *val, ...)
2172 SU_GET_CONTEXT(2, 2);
2173 Newx(ud, 1, su_ud_localize);
2174 SU_UD_ORIGIN(ud) = NULL;
2175 SU_UD_HANDLER(ud) = su_localize;
2176 size = su_ud_localize_init(ud, sv, val, NULL);
2177 su_init(ud, cxix, size);
2180 localize_elem(SV *sv, SV *elem, SV *val, ...)
2187 if (SvTYPE(sv) >= SVt_PVGV)
2188 croak("Can't infer the element localization type from a glob and the value");
2189 SU_GET_CONTEXT(3, 3);
2190 Newx(ud, 1, su_ud_localize);
2191 SU_UD_ORIGIN(ud) = NULL;
2192 SU_UD_HANDLER(ud) = su_localize;
2193 size = su_ud_localize_init(ud, sv, val, elem);
2194 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
2195 SU_UD_LOCALIZE_FREE(ud);
2196 croak("Can't localize an element of something that isn't an array or a hash");
2198 su_init(ud, cxix, size);
2201 localize_delete(SV *sv, SV *elem, ...)
2208 SU_GET_CONTEXT(2, 2);
2209 Newx(ud, 1, su_ud_localize);
2210 SU_UD_ORIGIN(ud) = NULL;
2211 SU_UD_HANDLER(ud) = su_localize;
2212 size = su_ud_localize_init(ud, sv, NULL, elem);
2213 su_init(ud, cxix, size);
2216 uplevel(SV *code, ...)
2219 I32 cxix, ret, args = 0;
2223 if (SvTYPE(code) < SVt_PVCV)
2224 croak("First argument to uplevel must be a code reference");
2225 SU_GET_CONTEXT(1, items - 1);
2227 PERL_CONTEXT *cx = cxstack + cxix;
2228 switch (CxTYPE(cx)) {
2230 croak("Can't uplevel to an eval frame");
2232 croak("Can't uplevel to a format frame");
2234 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2240 /* su_uplevel() takes care of extending the stack if needed. */
2241 ret = su_uplevel((CV *) code, cxix, args);
2246 } while (--cxix >= 0);
2247 croak("Can't uplevel outside a subroutine");
2256 SU_GET_CONTEXT(0, 0);
2257 uid = su_uid_get(cxix);
2263 validate_uid(SV *uid)
2268 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;