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)
119 #ifndef PADLIST_ARRAY
120 # define PADLIST_ARRAY(P) AvARRAY(P)
124 # define CxHASARGS(C) ((C)->blk_sub.hasargs)
128 # define HvNAME_get(H) HvNAME(H)
131 #ifndef gv_fetchpvn_flags
132 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
135 #ifndef PERL_MAGIC_tied
136 # define PERL_MAGIC_tied 'P'
139 #ifndef PERL_MAGIC_env
140 # define PERL_MAGIC_env 'E'
143 #ifndef NEGATIVE_INDICES_VAR
144 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
147 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
148 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
150 /* --- Threads and multiplicity -------------------------------------------- */
152 #ifndef SU_MULTIPLICITY
153 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
154 # define SU_MULTIPLICITY 1
156 # define SU_MULTIPLICITY 0
159 #if SU_MULTIPLICITY && !defined(tTHX)
160 # define tTHX PerlInterpreter*
163 #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))
164 # define SU_THREADSAFE 1
165 # ifndef MY_CXT_CLONE
166 # define MY_CXT_CLONE \
168 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
169 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
170 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
173 # define SU_THREADSAFE 0
175 # define dMY_CXT dNOOP
177 # define MY_CXT su_globaldata
179 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
181 # define MY_CXT_INIT NOOP
183 # define MY_CXT_CLONE NOOP
186 /* --- Unique context ID global storage ------------------------------------ */
188 /* ... Sequence ID counter ................................................. */
195 STATIC su_uv_array su_uid_seq_counter;
199 STATIC perl_mutex su_uid_seq_counter_mutex;
201 #define SU_LOCK(M) MUTEX_LOCK(M)
202 #define SU_UNLOCK(M) MUTEX_UNLOCK(M)
204 #else /* USE_ITHREADS */
209 #endif /* !USE_ITHREADS */
211 STATIC UV su_uid_seq_next(pTHX_ UV depth) {
212 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
216 SU_LOCK(&su_uid_seq_counter_mutex);
218 seqs = su_uid_seq_counter.seqs;
220 if (depth >= su_uid_seq_counter.size) {
223 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
224 for (i = su_uid_seq_counter.size; i <= depth; ++i)
227 su_uid_seq_counter.seqs = seqs;
228 su_uid_seq_counter.size = depth + 1;
233 SU_UNLOCK(&su_uid_seq_counter_mutex);
238 /* ... UID storage ......................................................... */
245 #define SU_UID_ACTIVE 1
247 STATIC UV su_uid_depth(pTHX_ I32 cxix) {
248 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
253 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
254 depth += si->si_cxix + 1;
265 STATIC void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
266 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
267 su_uid **old_map = old_cxt->map;
270 su_uid **new_map = new_cxt->map;
271 STRLEN old_used = old_cxt->used;
272 STRLEN old_alloc = old_cxt->alloc;
273 STRLEN new_used, new_alloc;
276 new_used = max_depth < old_used ? max_depth : old_used;
277 new_cxt->used = new_used;
279 if (new_used <= new_cxt->alloc)
280 new_alloc = new_cxt->alloc;
282 new_alloc = new_used;
283 Renew(new_map, new_alloc, su_uid *);
284 for (i = new_cxt->alloc; i < new_alloc; ++i)
286 new_cxt->map = new_map;
287 new_cxt->alloc = new_alloc;
290 for (i = 0; i < new_alloc; ++i) {
291 su_uid *new_uid = new_map[i];
293 if (i < new_used) { /* => i < max_depth && i < old_used */
294 su_uid *old_uid = old_map[i];
296 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
298 Newx(new_uid, 1, su_uid);
299 new_map[i] = new_uid;
307 new_uid->flags &= ~SU_UID_ACTIVE;
314 /* --- unwind() global storage --------------------------------------------- */
324 /* --- uplevel() data tokens and global storage ---------------------------- */
326 #define SU_UPLEVEL_HIJACKS_RUNOPS SU_HAS_PERL(5, 8, 0)
331 su_uid_storage tmp_uid_storage;
332 su_uid_storage old_uid_storage;
343 PERL_SI *old_curstackinfo;
349 #if SU_UPLEVEL_HIJACKS_RUNOPS
350 runops_proc_t old_runops;
357 STATIC su_uplevel_ud *su_uplevel_ud_new(pTHX) {
358 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
362 Newx(sud, 1, su_uplevel_ud);
365 sud->tmp_uid_storage.map = NULL;
366 sud->tmp_uid_storage.used = 0;
367 sud->tmp_uid_storage.alloc = 0;
369 Newx(si, 1, PERL_SI);
370 si->si_stack = newAV();
371 AvREAL_off(si->si_stack);
372 si->si_cxstack = NULL;
380 STATIC void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
381 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
382 PERL_SI *si = sud->si;
384 Safefree(si->si_cxstack);
385 SvREFCNT_dec(si->si_stack);
388 if (sud->tmp_uid_storage.map) {
389 su_uid **map = sud->tmp_uid_storage.map;
390 STRLEN alloc = sud->tmp_uid_storage.alloc;
393 for (i = 0; i < alloc; ++i)
408 } su_uplevel_storage;
410 #ifndef SU_UPLEVEL_STORAGE_SIZE
411 # define SU_UPLEVEL_STORAGE_SIZE 4
414 /* --- Global data --------------------------------------------------------- */
416 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
419 char *stack_placeholder;
420 su_unwind_storage unwind_storage;
421 su_uplevel_storage uplevel_storage;
422 su_uid_storage uid_storage;
427 /* --- Stack manipulations ------------------------------------------------- */
429 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
431 #define SU_SAVE_DESTRUCTOR_SIZE 3
432 #define SU_SAVE_PLACEHOLDER_SIZE 3
434 #define SU_SAVE_SCALAR_SIZE 3
436 #define SU_SAVE_ARY_SIZE 3
437 #define SU_SAVE_AELEM_SIZE 4
439 # define SU_SAVE_ADELETE_SIZE 3
441 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
443 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
444 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
446 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
449 #define SU_SAVE_HASH_SIZE 3
450 #define SU_SAVE_HELEM_SIZE 4
451 #define SU_SAVE_HDELETE_SIZE 4
452 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
453 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
455 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
458 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
460 #if !SU_HAS_PERL(5, 8, 9)
461 # define SU_SAVE_GP_SIZE 6
462 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
463 # define SU_SAVE_GP_SIZE 3
464 #elif !SU_HAS_PERL(5, 13, 8)
465 # define SU_SAVE_GP_SIZE 4
467 # define SU_SAVE_GP_SIZE 3
470 #ifndef SvCANEXISTDELETE
471 # define SvCANEXISTDELETE(sv) \
473 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
474 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
475 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
476 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
481 /* ... Saving array elements ............................................... */
483 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
484 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
490 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
491 #if SU_HAS_PERL(5, 8, 1)
492 if (SvRMAGICAL(av)) {
493 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
495 SV * const * const negative_indices_glob =
496 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
497 NEGATIVE_INDICES_VAR, 16, 0);
498 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
504 idx = key + av_len(av) + 1;
518 STATIC void su_adelete(pTHX_ void *ud_) {
519 su_ud_adelete *ud = (su_ud_adelete *) ud_;
521 av_delete(ud->av, ud->idx, G_DISCARD);
522 SvREFCNT_dec(ud->av);
527 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
528 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
531 Newx(ud, 1, su_ud_adelete);
534 SvREFCNT_inc_simple_void(av);
536 SAVEDESTRUCTOR_X(su_adelete, ud);
539 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
541 #endif /* SAVEADELETE */
543 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
544 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
551 idx = su_av_key2idx(av, SvIV(key));
553 if (SvCANEXISTDELETE(av))
554 preeminent = av_exists(av, idx);
556 svp = av_fetch(av, idx, 1);
557 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
560 save_aelem(av, idx, svp);
562 SAVEADELETE(av, idx);
564 if (val) { /* local $x[$idx] = $val; */
565 SvSetMagicSV(*svp, val);
566 } else { /* local $x[$idx]; delete $x[$idx]; */
567 av_delete(av, idx, G_DISCARD);
571 /* ... Saving hash elements ................................................ */
573 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
574 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
581 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
582 preeminent = hv_exists_ent(hv, keysv, 0);
584 he = hv_fetch_ent(hv, keysv, 1, 0);
585 svp = he ? &HeVAL(he) : NULL;
586 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
588 if (HvNAME_get(hv) && isGV(*svp)) {
589 save_gp((GV *) *svp, 0);
594 save_helem(hv, keysv, svp);
597 const char * const key = SvPV_const(keysv, keylen);
598 SAVEDELETE(hv, savepvn(key, keylen),
599 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
602 if (val) { /* local $x{$keysv} = $val; */
603 SvSetMagicSV(*svp, val);
604 } else { /* local $x{$keysv}; delete $x{$keysv}; */
605 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
609 /* ... Saving code slots from a glob ....................................... */
611 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
612 # define mro_method_changed_in(G) PL_sub_generation++
620 STATIC void su_restore_gvcv(pTHX_ void *ud_) {
621 su_save_gvcv_ud *ud = ud_;
624 GvCV_set(gv, ud->old_cv);
626 mro_method_changed_in(GvSTASH(gv));
631 STATIC void su_save_gvcv(pTHX_ GV *gv) {
632 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
635 Newx(ud, 1, su_save_gvcv_ud);
637 ud->old_cv = GvCV(gv);
641 mro_method_changed_in(GvSTASH(gv));
643 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
646 /* --- Actions ------------------------------------------------------------- */
652 void (*handler)(pTHX_ void *);
655 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
656 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
657 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
658 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
660 #define SU_UD_FREE(U) STMT_START { \
661 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
665 /* ... Reap ................................................................ */
667 #define SU_SAVE_LAST_CX (!SU_HAS_PERL(5, 8, 4) || (SU_HAS_PERL(5, 9, 5) && !SU_HAS_PERL(5, 14, 0)) || SU_HAS_PERL(5, 15, 0))
674 STATIC void su_call(pTHX_ void *ud_) {
675 su_ud_reap *ud = (su_ud_reap *) ud_;
678 PERL_CONTEXT saved_cx;
679 #endif /* SU_SAVE_LAST_CX */
684 PerlIO_printf(Perl_debug_log,
685 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
686 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
696 /* If the recently popped context isn't saved there, it will be overwritten by
697 * the sub scope from call_sv, although it's still needed in our caller. */
698 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
699 saved_cx = cxstack[cxix];
700 #endif /* SU_SAVE_LAST_CX */
702 call_sv(ud->cb, G_VOID);
705 cxstack[cxix] = saved_cx;
706 #endif /* SU_SAVE_LAST_CX */
713 SvREFCNT_dec(ud->cb);
717 STATIC void su_reap(pTHX_ void *ud) {
718 #define su_reap(U) su_reap(aTHX_ (U))
720 PerlIO_printf(Perl_debug_log,
721 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
722 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
725 SAVEDESTRUCTOR_X(su_call, ud);
728 /* ... Localize & localize array/hash element .............................. */
738 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
739 SvREFCNT_dec((U)->elem); \
740 SvREFCNT_dec((U)->val); \
741 SvREFCNT_dec((U)->sv); \
745 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
746 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
751 SvREFCNT_inc_simple_void(sv);
753 if (SvTYPE(sv) >= SVt_PVGV) {
754 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
756 } else { /* local *x = \$val; */
757 t = SvTYPE(SvRV(val));
760 } else if (SvROK(sv)) {
761 croak("Invalid %s reference as the localization target",
762 sv_reftype(SvRV(sv), 0));
765 const char *p = SvPV_const(sv, len), *s;
766 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
772 case '$': t = SVt_PV; break;
773 case '@': t = SVt_PVAV; break;
774 case '%': t = SVt_PVHV; break;
775 case '&': t = SVt_PVCV; break;
776 case '*': t = SVt_PVGV; break;
781 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
782 if (SvROK(val) && !sv_isobject(val)) {
783 t = SvTYPE(SvRV(val));
795 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
800 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
805 size = SU_SAVE_GP_SIZE;
809 size = SU_SAVE_GVCV_SIZE;
813 size = SU_SAVE_SCALAR_SIZE;
816 /* When deref is set, val isn't NULL */
819 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
820 ud->elem = SvREFCNT_inc(elem);
826 STATIC void su_localize(pTHX_ void *ud_) {
827 #define su_localize(U) su_localize(aTHX_ (U))
828 su_ud_localize *ud = (su_ud_localize *) ud_;
835 if (SvTYPE(sv) >= SVt_PVGV) {
839 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
842 const char *name = SvPV_const(sv, len);
843 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
850 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
851 PerlIO_printf(Perl_debug_log,
852 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
853 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
857 /* Inspired from Alias.pm */
861 su_save_aelem(GvAV(gv), elem, val);
868 su_save_helem(GvHV(gv), elem, val);
874 save_gp(gv, 1); /* hide previous entry in symtab */
880 gv = (GV *) save_scalar(gv);
885 SvSetMagicSV((SV *) gv, val);
888 SU_UD_LOCALIZE_FREE(ud);
891 /* --- Pop a context back -------------------------------------------------- */
895 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
897 # define SU_CXNAME "XXX"
901 STATIC void su_pop(pTHX_ void *ud) {
902 #define su_pop(U) su_pop(aTHX_ (U))
903 I32 depth, base, mark, *origin;
904 depth = SU_UD_DEPTH(ud);
907 PerlIO_printf(Perl_debug_log,
909 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
911 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
914 origin = SU_UD_ORIGIN(ud);
915 mark = origin[depth];
916 base = origin[depth - 1];
918 SU_D(PerlIO_printf(Perl_debug_log,
919 "%p: original scope was %*c top=%2d base=%2d\n",
920 ud, 24, ' ', mark, base));
923 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
924 PL_savestack_ix = mark;
927 PL_savestack_ix = base;
929 SU_UD_DEPTH(ud) = --depth;
934 if ((pad = SU_UD_PAD(ud))) {
937 SU_D(PerlIO_printf(Perl_debug_log,
938 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
939 ud, depth, PL_scopestack_ix, PL_savestack_ix));
940 SU_SAVE_PLACEHOLDER();
944 SU_D(PerlIO_printf(Perl_debug_log,
945 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
946 ud, depth, PL_scopestack_ix, PL_savestack_ix));
947 SAVEDESTRUCTOR_X(su_pop, ud);
949 SU_UD_HANDLER(ud)(aTHX_ ud);
952 SU_D(PerlIO_printf(Perl_debug_log,
953 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
954 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
957 /* --- Initialize the stack and the action userdata ------------------------ */
959 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
960 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
961 I32 i, depth = 1, pad, offset, *origin;
963 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
965 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
968 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
969 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
970 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
973 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
975 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
976 ud, size, pad, offset));
978 for (i = cxstack_ix; i > cxix; --i) {
979 PERL_CONTEXT *cx = cxstack + i;
980 switch (CxTYPE(cx)) {
981 #if SU_HAS_PERL(5, 10, 0)
983 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
984 /* Given and when blocks are actually followed by a simple block, so skip
986 if (cxix > 0) { /* Implies i > 0 */
987 PERL_CONTEXT *next = cx - 1;
988 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
994 #if SU_HAS_PERL(5, 11, 0)
997 case CXt_LOOP_LAZYSV:
998 case CXt_LOOP_LAZYIV:
1002 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
1006 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
1011 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
1013 Newx(origin, depth + 1, I32);
1014 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
1015 PL_scopestack[PL_scopestack_ix - depth] += size;
1016 for (i = depth - 1; i >= 1; --i) {
1017 I32 j = PL_scopestack_ix - i;
1018 origin[depth - i] = PL_scopestack[j];
1019 PL_scopestack[j] += offset;
1021 origin[depth] = PL_savestack_ix;
1023 SU_UD_ORIGIN(ud) = origin;
1024 SU_UD_DEPTH(ud) = depth;
1025 SU_UD_PAD(ud) = pad;
1027 /* Make sure the first destructor fires by pushing enough fake slots on the
1029 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1030 <= PL_scopestack[PL_scopestack_ix - 1]) {
1033 SU_D(PerlIO_printf(Perl_debug_log,
1034 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1035 ud, PL_scopestack_ix, PL_savestack_ix));
1036 SU_SAVE_PLACEHOLDER();
1037 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1038 <= PL_scopestack[PL_scopestack_ix - 1]);
1040 SU_D(PerlIO_printf(Perl_debug_log,
1041 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1042 ud, PL_scopestack_ix, PL_savestack_ix));
1043 SAVEDESTRUCTOR_X(su_pop, ud);
1046 for (i = 0; i <= depth; ++i) {
1047 I32 j = PL_scopestack_ix - i;
1048 PerlIO_printf(Perl_debug_log,
1049 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1050 ud, i, j, origin[depth - i],
1051 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1058 /* --- Unwind stack -------------------------------------------------------- */
1060 STATIC void su_unwind(pTHX_ void *ud_) {
1062 I32 cxix = MY_CXT.unwind_storage.cxix;
1063 I32 items = MY_CXT.unwind_storage.items - 1;
1064 SV **savesp = MY_CXT.unwind_storage.savesp;
1067 PERL_UNUSED_VAR(ud_);
1070 PL_stack_sp = savesp;
1072 if (cxstack_ix > cxix)
1075 /* Hide the level */
1079 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1080 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1083 I32 gimme = GIMME_V;
1084 PerlIO_printf(Perl_debug_log,
1085 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1087 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1088 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1091 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1092 PL_op = PL_op->op_ppaddr(aTHX);
1094 *PL_markstack_ptr = mark;
1096 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1097 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1100 /* --- Uplevel ------------------------------------------------------------- */
1102 #ifndef OP_GIMME_REVERSE
1103 STATIC U8 su_op_gimme_reverse(U8 gimme) {
1106 return OPf_WANT_VOID;
1108 return OPf_WANT_LIST;
1113 return OPf_WANT_SCALAR;
1115 #define OP_GIMME_REVERSE(G) su_op_gimme_reverse(G)
1118 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1119 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1121 STATIC su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1122 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1127 sud = MY_CXT.uplevel_storage.root;
1129 MY_CXT.uplevel_storage.root = sud->next;
1130 MY_CXT.uplevel_storage.count--;
1132 sud = su_uplevel_ud_new();
1135 sud->next = MY_CXT.uplevel_storage.top;
1136 MY_CXT.uplevel_storage.top = sud;
1138 depth = su_uid_depth(cxix);
1139 su_uid_storage_dup(&sud->tmp_uid_storage, &MY_CXT.uid_storage, depth);
1140 sud->old_uid_storage = MY_CXT.uid_storage;
1141 MY_CXT.uid_storage = sud->tmp_uid_storage;
1146 STATIC void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1147 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1150 sud->tmp_uid_storage = MY_CXT.uid_storage;
1151 MY_CXT.uid_storage = sud->old_uid_storage;
1155 map = sud->tmp_uid_storage.map;
1156 alloc = sud->tmp_uid_storage.alloc;
1157 for (i = 0; i < alloc; ++i) {
1159 map[i]->flags &= SU_UID_ACTIVE;
1162 MY_CXT.uplevel_storage.top = sud->next;
1164 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1165 su_uplevel_ud_delete(sud);
1167 sud->next = MY_CXT.uplevel_storage.root;
1168 MY_CXT.uplevel_storage.root = sud;
1169 MY_CXT.uplevel_storage.count++;
1173 STATIC int su_uplevel_goto_static(const OP *o) {
1174 for (; o; o = o->op_sibling) {
1175 /* goto ops are unops with kids. */
1176 if (!(o->op_flags & OPf_KIDS))
1179 switch (o->op_type) {
1182 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1187 if (su_uplevel_goto_static(cUNOPo->op_first))
1196 #if SU_UPLEVEL_HIJACKS_RUNOPS
1198 STATIC int su_uplevel_goto_runops(pTHX) {
1199 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1205 if (op->op_type == OP_GOTO) {
1206 AV *argarray = NULL;
1209 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1210 const PERL_CONTEXT *cx = cxstack + cxix;
1212 switch (CxTYPE(cx)) {
1214 if (CxHASARGS(cx)) {
1215 argarray = cx->blk_sub.argarray;
1231 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1232 AV *args = GvAV(PL_defgv);
1233 I32 items = AvFILLp(args);
1235 av_extend(argarray, items);
1236 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1237 AvFILLp(argarray) = items;
1242 PL_op = op = op->op_ppaddr(aTHX);
1244 #if !SU_HAS_PERL(5, 13, 0)
1254 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1256 #define su_at_underscore(C) AvARRAY(PADLIST_ARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1258 STATIC void su_uplevel_restore(pTHX_ void *sus_) {
1259 su_uplevel_ud *sud = sus_;
1260 PERL_SI *cur = sud->old_curstackinfo;
1261 PERL_SI *si = sud->si;
1263 #if SU_UPLEVEL_HIJACKS_RUNOPS
1264 if (PL_runops == su_uplevel_goto_runops)
1265 PL_runops = sud->old_runops;
1268 if (sud->callback) {
1269 PERL_CONTEXT *cx = cxstack + sud->cxix;
1270 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1272 /* We have to fix the pad entry for @_ in the original callback because it
1273 * may have been reified. */
1274 if (AvREAL(argarray)) {
1275 const I32 fill = AvFILLp(argarray);
1276 SvREFCNT_dec(argarray);
1278 AvREAL_off(argarray);
1279 AvREIFY_on(argarray);
1280 av_extend(argarray, fill);
1281 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1283 CLEAR_ARGARRAY(argarray);
1286 /* If the old cv member is our renamed CV, it means that this place has been
1287 * reached without a goto() happening, and the old argarray member is
1288 * actually our fake argarray. Destroy it properly in that case. */
1289 if (cx->blk_sub.cv == sud->renamed) {
1290 SvREFCNT_dec(cx->blk_sub.argarray);
1291 cx->blk_sub.argarray = argarray;
1294 CvDEPTH(sud->callback)--;
1295 SvREFCNT_dec(sud->callback);
1298 /* Free the renamed CV. We must do it ourselves so that we can force the
1299 * depth to be 0, or perl would complain about it being "still in use".
1300 * But we *know* that it cannot be so. */
1302 CvDEPTH(sud->renamed) = 0;
1303 CvPADLIST(sud->renamed) = NULL;
1304 SvREFCNT_dec(sud->renamed);
1307 CATCH_SET(sud->old_catch);
1309 SU_UPLEVEL_RESTORE(op);
1311 /* stack_grow() wants PL_curstack so restore the old stack first */
1312 if (PL_curstackinfo == si) {
1313 PL_curstack = cur->si_stack;
1314 if (sud->old_mainstack)
1315 SU_UPLEVEL_RESTORE(mainstack);
1316 SU_UPLEVEL_RESTORE(curstackinfo);
1319 CV *target = sud->target;
1322 /* When we die, the depth of the target CV is not updated because of the
1323 * stack switcheroo. So we have to look at all the frames between the
1324 * uplevel call and the catch block to count how many call frames to the
1325 * target CV were skipped. */
1326 for (i = cur->si_cxix; i > sud->cxix; i--) {
1327 register const PERL_CONTEXT *cx = cxstack + i;
1329 if (CxTYPE(cx) == CXt_SUB) {
1330 if (cx->blk_sub.cv == target)
1335 /* If we died, the replacement stack was already unwinded to the first
1336 * eval frame, and all the contexts down there were popped. We don't have
1337 * to pop manually any context of the original stack, because they must
1338 * have been in the replacement stack as well (since the second was copied
1339 * from the first). Thus we only have to make sure the original stack index
1340 * points to the context just below the first eval scope under the target
1342 for (; i >= 0; i--) {
1343 register const PERL_CONTEXT *cx = cxstack + i;
1345 switch (CxTYPE(cx)) {
1347 if (cx->blk_sub.cv == target)
1359 CvDEPTH(target) = sud->target_depth - levels;
1360 PL_curstackinfo->si_cxix = i - 1;
1362 #if !SU_HAS_PERL(5, 13, 1)
1363 /* Since $@ was maybe localized between the target frame and the uplevel
1364 * call, we forcefully flush the save stack to get rid of it and then
1365 * reset $@ to its proper value. Note that the the call to
1366 * su_uplevel_restore() must happen before the "reset $@" item of the save
1367 * stack is processed, as uplevel was called after the localization.
1368 * Andrew's changes to how $@ was handled, which were mainly integrated
1369 * between perl 5.13.0 and 5.13.1, fixed this. */
1370 if (ERRSV && SvTRUE(ERRSV)) {
1371 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1372 SV *errsv = SvREFCNT_inc(ERRSV);
1373 PL_scopestack_ix = cx->blk_oldscopesp;
1374 leave_scope(PL_scopestack[PL_scopestack_ix]);
1375 sv_setsv(ERRSV, errsv);
1376 SvREFCNT_dec(errsv);
1382 SU_UPLEVEL_RESTORE(curcop);
1384 SvREFCNT_dec(sud->target);
1386 PL_stack_base = AvARRAY(cur->si_stack);
1387 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1388 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1390 /* When an exception is thrown from the uplevel'd subroutine,
1391 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1392 * die_where() in more recent perls), which has the sad habit of keeping a
1393 * pointer to the current context frame across this call. This means that we
1394 * can't free the temporary context stack we used for the uplevel call right
1395 * now, or that pointer upwards would point to garbage. */
1396 #if SU_HAS_PERL(5, 13, 7)
1397 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1398 * public in perl 5.13.7. */
1399 su_uplevel_storage_delete(sud);
1401 /* Otherwise, we just enqueue it back in the global storage list. */
1405 sud->tmp_uid_storage = MY_CXT.uid_storage;
1406 MY_CXT.uid_storage = sud->old_uid_storage;
1408 MY_CXT.uplevel_storage.top = sud->next;
1409 sud->next = MY_CXT.uplevel_storage.root;
1410 MY_CXT.uplevel_storage.root = sud;
1411 MY_CXT.uplevel_storage.count++;
1418 STATIC CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1419 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1423 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1425 CvFLAGS(cv) = CvFLAGS(proto);
1427 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1429 CvDEPTH(cv) = CvDEPTH(proto);
1431 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1433 CvFILE(cv) = CvFILE(proto);
1437 CvSTASH_set(cv, CvSTASH(proto));
1438 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1439 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1440 * (which was part of perl 5.13.7). */
1441 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1443 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1446 if (CvISXSUB(proto)) {
1447 CvXSUB(cv) = CvXSUB(proto);
1448 CvXSUBANY(cv) = CvXSUBANY(proto);
1451 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1453 CvSTART(cv) = CvSTART(proto);
1455 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1456 #ifdef CVf_WEAKOUTSIDE
1457 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1459 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1460 CvPADLIST(cv) = CvPADLIST(proto);
1461 #ifdef CvOUTSIDE_SEQ
1462 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1466 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1476 STATIC I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1477 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1479 const PERL_CONTEXT *cx = cxstack + cxix;
1481 PERL_SI *cur = PL_curstackinfo;
1487 I32 old_mark, new_mark;
1494 /* Make PL_stack_sp point just before the CV. */
1495 PL_stack_sp -= args + 1;
1496 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1499 sud = su_uplevel_storage_new(cxix);
1503 sud->callback = NULL;
1504 sud->renamed = NULL;
1505 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1509 si->si_type = cur->si_type;
1511 si->si_prev = cur->si_prev;
1513 si->si_markoff = cx->blk_oldmarksp;
1516 /* Allocate enough space for all the elements of the original stack up to the
1517 * target context, plus the forthcoming arguments. */
1518 new_mark = cx->blk_oldsp;
1519 av_extend(si->si_stack, new_mark + 1 + args + 1);
1520 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1521 AvFILLp(si->si_stack) = new_mark;
1522 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1524 /* Specialized SWITCHSTACK() */
1525 PL_stack_base = AvARRAY(si->si_stack);
1526 old_stack_sp = PL_stack_sp;
1527 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1528 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1531 /* Copy the context stack up to the context just below the target. */
1532 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1533 if (si->si_cxmax < cxix) {
1534 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1535 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1536 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1538 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1539 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1541 target = cx->blk_sub.cv;
1542 sud->target = (CV *) SvREFCNT_inc(target);
1543 sud->target_depth = CvDEPTH(target);
1545 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1546 * run-time implication, since PL_curcop will be overwritten as soon as we
1547 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1548 * make it point to the blk_oldcop for the target frame, so that caller()
1549 * reports the right file name, line number and lexical hints. */
1550 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1551 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1552 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1554 SU_UPLEVEL_SAVE(curstackinfo, si);
1555 /* If those two are equal, we need to fool POPSTACK_TO() */
1556 if (PL_mainstack == PL_curstack)
1557 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1559 sud->old_mainstack = NULL;
1560 PL_curstack = si->si_stack;
1562 renamed = su_cv_clone(callback, CvGV(target));
1563 sud->renamed = renamed;
1566 /* Both SP and old_stack_sp point just before the CV. */
1567 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1569 PUSHs((SV *) renamed);
1572 Zero(&sub_op, 1, UNOP);
1573 sub_op.op_type = OP_ENTERSUB;
1574 sub_op.op_next = NULL;
1575 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1577 sub_op.op_flags |= OPpENTERSUB_DB;
1579 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1581 #if SU_UPLEVEL_HIJACKS_RUNOPS
1582 sud->old_runops = PL_runops;
1585 sud->old_catch = CATCH_GET;
1588 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1589 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1591 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1594 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1595 CvDEPTH(callback)++;
1597 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1598 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1599 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1600 * with what we put on the stack. But we want to fake up the same arguments
1601 * as the ones in use at the context we uplevel to, so we replace the
1602 * argarray with an unreal copy of the original @_. */
1606 av_extend(av, AvMAX(cx->blk_sub.argarray));
1607 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1608 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1609 sub_cx->blk_sub.argarray = av;
1611 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1614 if (su_uplevel_goto_static(CvROOT(renamed))) {
1615 #if SU_UPLEVEL_HIJACKS_RUNOPS
1616 if (PL_runops != PL_runops_std) {
1617 if (PL_runops == PL_runops_dbg) {
1619 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1620 } else if (PL_runops != su_uplevel_goto_runops)
1621 croak("uplevel() can't execute code that calls goto with a custom runloop");
1624 PL_runops = su_uplevel_goto_runops;
1625 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1626 croak("uplevel() can't execute code that calls goto before perl 5.8");
1627 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1635 ret = PL_stack_sp - (PL_stack_base + new_mark);
1637 AV *old_stack = sud->old_curstackinfo->si_stack;
1639 if (old_mark + ret > AvMAX(old_stack)) {
1640 /* Specialized EXTEND(old_sp, ret) */
1641 av_extend(old_stack, old_mark + ret + 1);
1642 old_stack_sp = AvARRAY(old_stack) + old_mark;
1645 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1647 AvFILLp(old_stack) += ret;
1655 /* --- Unique context ID --------------------------------------------------- */
1657 STATIC su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1658 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1663 map = MY_CXT.uid_storage.map;
1664 alloc = MY_CXT.uid_storage.alloc;
1666 if (depth >= alloc) {
1669 Renew(map, depth + 1, su_uid *);
1670 for (i = alloc; i <= depth; ++i)
1673 MY_CXT.uid_storage.map = map;
1674 MY_CXT.uid_storage.alloc = depth + 1;
1680 Newx(uid, 1, su_uid);
1686 if (depth >= MY_CXT.uid_storage.used)
1687 MY_CXT.uid_storage.used = depth + 1;
1692 STATIC int su_uid_storage_check(pTHX_ UV depth, UV seq) {
1693 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
1697 if (depth >= MY_CXT.uid_storage.used)
1700 uid = MY_CXT.uid_storage.map[depth];
1702 return uid && (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
1705 STATIC void su_uid_drop(pTHX_ void *ud_) {
1708 uid->flags &= ~SU_UID_ACTIVE;
1711 STATIC void su_uid_bump(pTHX_ void *ud_) {
1712 su_ud_reap *ud = ud_;
1714 SAVEDESTRUCTOR_X(su_uid_drop, ud->cb);
1717 STATIC SV *su_uid_get(pTHX_ I32 cxix) {
1718 #define su_uid_get(I) su_uid_get(aTHX_ (I))
1723 depth = su_uid_depth(cxix);
1724 uid = su_uid_storage_fetch(depth);
1726 if (!(uid->flags & SU_UID_ACTIVE)) {
1729 uid->seq = su_uid_seq_next(depth);
1730 uid->flags |= SU_UID_ACTIVE;
1732 Newx(ud, 1, su_ud_reap);
1733 SU_UD_ORIGIN(ud) = NULL;
1734 SU_UD_HANDLER(ud) = su_uid_bump;
1735 ud->cb = (SV *) uid;
1736 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1739 uid_sv = sv_newmortal();
1740 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
1746 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
1748 #else /* grok_number */
1750 #define IS_NUMBER_IN_UV 0x1
1752 STATIC int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
1753 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
1757 /* This crude check should be good enough for a fallback implementation.
1758 * Better be too strict than too lax. */
1759 for (i = 0; i < len; ++i) {
1764 tmpsv = sv_newmortal();
1765 sv_setpvn(tmpsv, s, len);
1766 *valuep = sv_2uv(tmpsv);
1768 return IS_NUMBER_IN_UV;
1771 #endif /* !grok_number */
1773 STATIC int su_uid_validate(pTHX_ SV *uid) {
1774 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
1780 s = SvPV_const(uid, len);
1782 while (p < len && s[p] != '-')
1785 croak("UID contains only one part");
1787 type = su_grok_number(s, p, &depth);
1788 if (type != IS_NUMBER_IN_UV)
1789 croak("First UID part is not an unsigned integer");
1791 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
1793 type = su_grok_number(s + p, len - p, &seq);
1794 if (type != IS_NUMBER_IN_UV)
1795 croak("Second UID part is not an unsigned integer");
1797 return su_uid_storage_check(depth, seq);
1800 /* --- Interpreter setup/teardown ------------------------------------------ */
1802 STATIC void su_teardown(pTHX_ void *param) {
1807 map = MY_CXT.uid_storage.map;
1810 for (i = 0; i < MY_CXT.uid_storage.used; ++i)
1815 cur = MY_CXT.uplevel_storage.root;
1817 su_uplevel_ud *prev;
1821 su_uplevel_ud_delete(prev);
1828 STATIC void su_setup(pTHX) {
1829 #define su_setup() su_setup(aTHX)
1832 MY_CXT.stack_placeholder = NULL;
1834 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
1835 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
1836 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
1837 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
1839 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
1840 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
1841 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
1843 MY_CXT.uplevel_storage.top = NULL;
1844 MY_CXT.uplevel_storage.root = NULL;
1845 MY_CXT.uplevel_storage.count = 0;
1847 MY_CXT.uid_storage.map = NULL;
1848 MY_CXT.uid_storage.used = 0;
1849 MY_CXT.uid_storage.alloc = 0;
1851 call_atexit(su_teardown, NULL);
1856 /* --- XS ------------------------------------------------------------------ */
1858 #if SU_HAS_PERL(5, 8, 9)
1859 # define SU_SKIP_DB_MAX 2
1861 # define SU_SKIP_DB_MAX 3
1864 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
1865 * followed by a DB sub */
1867 #define SU_SKIP_DB(C) \
1870 PERL_CONTEXT *base = cxstack; \
1871 PERL_CONTEXT *cx = base + (C); \
1872 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
1874 if (cx >= base && (C) > skipped) { \
1875 switch (CxTYPE(cx)) { \
1877 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
1878 (C) -= skipped + 1; \
1886 #define SU_GET_CONTEXT(A, B) \
1895 else if (cxix > cxstack_ix) \
1896 cxix = cxstack_ix; \
1899 cxix = cxstack_ix; \
1905 #define SU_GET_LEVEL(A, B) \
1911 level = SvIV(lsv); \
1918 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
1920 XS(XS_Scope__Upper_unwind) {
1929 PERL_UNUSED_VAR(cv); /* -W */
1930 PERL_UNUSED_VAR(ax); /* -Wall */
1932 SU_GET_CONTEXT(0, items - 1);
1934 PERL_CONTEXT *cx = cxstack + cxix;
1935 switch (CxTYPE(cx)) {
1937 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
1941 MY_CXT.unwind_storage.cxix = cxix;
1942 MY_CXT.unwind_storage.items = items;
1943 /* pp_entersub will want to sanitize the stack after returning from there
1944 * Screw that, we're insane */
1945 if (GIMME_V == G_SCALAR) {
1946 MY_CXT.unwind_storage.savesp = PL_stack_sp;
1947 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
1948 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
1950 MY_CXT.unwind_storage.savesp = NULL;
1952 SAVEDESTRUCTOR_X(su_unwind, NULL);
1957 } while (--cxix >= 0);
1958 croak("Can't return outside a subroutine");
1961 MODULE = Scope::Upper PACKAGE = Scope::Upper
1969 MUTEX_INIT(&su_uid_seq_counter_mutex);
1971 su_uid_seq_counter.seqs = NULL;
1972 su_uid_seq_counter.size = 0;
1974 stash = gv_stashpv(__PACKAGE__, 1);
1975 newCONSTSUB(stash, "TOP", newSViv(0));
1976 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
1978 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
1989 su_uid_storage new_cxt;
1996 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
2000 MY_CXT.uplevel_storage.top = NULL;
2001 MY_CXT.uplevel_storage.root = NULL;
2002 MY_CXT.uplevel_storage.count = 0;
2003 MY_CXT.uid_storage = new_cxt;
2007 #endif /* SU_THREADSAFE */
2013 I32 cxix = cxstack_ix;
2027 SU_GET_CONTEXT(0, 0);
2042 SU_GET_CONTEXT(0, 0);
2044 for (; cxix >= 0; --cxix) {
2045 PERL_CONTEXT *cx = cxstack + cxix;
2046 switch (CxTYPE(cx)) {
2050 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2064 SU_GET_CONTEXT(0, 0);
2066 for (; cxix >= 0; --cxix) {
2067 PERL_CONTEXT *cx = cxstack + cxix;
2068 switch (CxTYPE(cx)) {
2110 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2111 PERL_CONTEXT *cx = cxstack + cxix;
2112 switch (CxTYPE(cx)) {
2114 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2134 SU_GET_CONTEXT(0, 0);
2137 PERL_CONTEXT *cx = cxstack + cxix--;
2138 switch (CxTYPE(cx)) {
2142 I32 gimme = cx->blk_gimme;
2144 case G_VOID: XSRETURN_UNDEF; break;
2145 case G_SCALAR: XSRETURN_NO; break;
2146 case G_ARRAY: XSRETURN_YES; break;
2161 SU_GET_CONTEXT(1, 1);
2162 Newx(ud, 1, su_ud_reap);
2163 SU_UD_ORIGIN(ud) = NULL;
2164 SU_UD_HANDLER(ud) = su_reap;
2165 ud->cb = newSVsv(hook);
2166 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2169 localize(SV *sv, SV *val, ...)
2176 SU_GET_CONTEXT(2, 2);
2177 Newx(ud, 1, su_ud_localize);
2178 SU_UD_ORIGIN(ud) = NULL;
2179 SU_UD_HANDLER(ud) = su_localize;
2180 size = su_ud_localize_init(ud, sv, val, NULL);
2181 su_init(ud, cxix, size);
2184 localize_elem(SV *sv, SV *elem, SV *val, ...)
2191 if (SvTYPE(sv) >= SVt_PVGV)
2192 croak("Can't infer the element localization type from a glob and the value");
2193 SU_GET_CONTEXT(3, 3);
2194 Newx(ud, 1, su_ud_localize);
2195 SU_UD_ORIGIN(ud) = NULL;
2196 SU_UD_HANDLER(ud) = su_localize;
2197 size = su_ud_localize_init(ud, sv, val, elem);
2198 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
2199 SU_UD_LOCALIZE_FREE(ud);
2200 croak("Can't localize an element of something that isn't an array or a hash");
2202 su_init(ud, cxix, size);
2205 localize_delete(SV *sv, SV *elem, ...)
2212 SU_GET_CONTEXT(2, 2);
2213 Newx(ud, 1, su_ud_localize);
2214 SU_UD_ORIGIN(ud) = NULL;
2215 SU_UD_HANDLER(ud) = su_localize;
2216 size = su_ud_localize_init(ud, sv, NULL, elem);
2217 su_init(ud, cxix, size);
2220 uplevel(SV *code, ...)
2223 I32 cxix, ret, args = 0;
2227 if (SvTYPE(code) < SVt_PVCV)
2228 croak("First argument to uplevel must be a code reference");
2229 SU_GET_CONTEXT(1, items - 1);
2231 PERL_CONTEXT *cx = cxstack + cxix;
2232 switch (CxTYPE(cx)) {
2234 croak("Can't uplevel to an eval frame");
2236 croak("Can't uplevel to a format frame");
2238 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2244 /* su_uplevel() takes care of extending the stack if needed. */
2245 ret = su_uplevel((CV *) code, cxix, args);
2250 } while (--cxix >= 0);
2251 croak("Can't uplevel outside a subroutine");
2260 SU_GET_CONTEXT(0, 0);
2261 uid = su_uid_get(cxix);
2267 validate_uid(SV *uid)
2272 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;