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
55 static void su_debug_log(const char *fmt, ...) {
60 sv = get_sv(__PACKAGE__ "::DEBUG", 0);
62 PerlIO_vprintf(Perl_debug_log, fmt, va);
71 # define Newx(v, n, c) New(0, v, n, c)
76 # define SU_POISON(D, N, T) PoisonNew((D), (N), T)
77 # elif defined(Poison)
78 # define SU_POISON(D, N, T) Poison((D), (N), T)
82 # define SU_POISON(D, N, T) NOOP
86 static SV *su_newSV_type(pTHX_ svtype t) {
91 # define newSV_type(T) su_newSV_type(aTHX_ (T))
95 # define su_newmortal_pvn(S, L) newSVpvn_flags((S), (L), SVs_TEMP)
97 # define su_newmortal_pvn(S, L) sv_2mortal(newSVpvn((S), (L)))
99 #define su_newmortal_pvs(S) su_newmortal_pvn((S), sizeof(S)-1)
102 # define SvPV_const(S, L) SvPV(S, L)
106 # define SvPVX_const(S) SvPVX(S)
109 #ifndef SvPV_nolen_const
110 # define SvPV_nolen_const(S) SvPV_nolen(S)
113 #ifndef SvREFCNT_inc_simple_void
114 # define SvREFCNT_inc_simple_void(sv) ((void) SvREFCNT_inc(sv))
118 # define mPUSHi(I) PUSHs(sv_2mortal(newSViv(I)))
122 # define GvCV_set(G, C) (GvCV(G) = (C))
126 # define CvGV_set(C, G) (CvGV(C) = (G))
130 # define CvSTASH_set(C, S) (CvSTASH(C) = (S))
134 # define CvISXSUB(C) CvXSUB(C)
138 # define PadlistARRAY(P) AvARRAY(P)
139 # define PadARRAY(P) AvARRAY(P)
143 # define CxHASARGS(C) ((C)->blk_sub.hasargs)
148 # define CxGIMME(C) ((C)->blk_gimme & G_WANT)
150 # define CxGIMME(C) ((C)->blk_gimme)
154 #ifndef CxOLD_OP_TYPE
155 # define CxOLD_OP_TYPE(C) (C)->blk_eval.old_op_type
159 # define OutCopFILE(C) CopFILE(C)
162 #ifndef OutCopFILE_len
163 # define OutCopFILE_len(C) strlen(OutCopFILE(C))
167 # define CopHINTS_get(C) ((I32) (C)->op_private & HINT_PRIVATE_MASK)
170 #ifndef CopHINTHASH_get
171 # define CopHINTHASH_get(C) (C)->cop_hints_hash
175 # define COPHH struct refcounted_he
176 # define cophh_2hv(H, F) Perl_refcounted_he_chain_2hv(aTHX_ (H))
180 # define HvNAME_get(H) HvNAME(H)
184 # define HvNAMELEN(H) strlen(HvNAME(H))
187 #ifndef gv_fetchpvn_flags
188 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
192 # define hv_fetchs(H, K, L) hv_fetch((H), (K), sizeof(K)-1, (L))
195 #ifndef OP_GIMME_REVERSE
196 static U8 su_op_gimme_reverse(U8 gimme) {
199 return OPf_WANT_VOID;
201 return OPf_WANT_LIST;
206 return OPf_WANT_SCALAR;
208 #define OP_GIMME_REVERSE(G) su_op_gimme_reverse(G)
213 # define OpSIBLING(O) OP_SIBLING(O)
215 # define OpSIBLING(O) ((O)->op_sibling)
219 #ifndef PERL_MAGIC_tied
220 # define PERL_MAGIC_tied 'P'
223 #ifndef PERL_MAGIC_env
224 # define PERL_MAGIC_env 'E'
227 #ifndef NEGATIVE_INDICES_VAR
228 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
231 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
232 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
234 /* --- Threads and multiplicity -------------------------------------------- */
236 #ifndef SU_MULTIPLICITY
237 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
238 # define SU_MULTIPLICITY 1
240 # define SU_MULTIPLICITY 0
243 #if SU_MULTIPLICITY && !defined(tTHX)
244 # define tTHX PerlInterpreter*
247 #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))
248 # define SU_THREADSAFE 1
249 # ifndef MY_CXT_CLONE
250 # define MY_CXT_CLONE \
252 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
253 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
254 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
257 # define SU_THREADSAFE 0
259 # define dMY_CXT dNOOP
261 # define MY_CXT su_globaldata
263 # define START_MY_CXT static my_cxt_t MY_CXT;
265 # define MY_CXT_INIT NOOP
267 # define MY_CXT_CLONE NOOP
270 /* --- Error messages ------------------------------------------------------ */
272 static const char su_stack_smash[] = "Cannot target a scope outside of the current stack";
273 static const char su_no_such_target[] = "No targetable %s scope in the current stack";
275 /* --- Unique context ID global storage ------------------------------------ */
277 /* ... Sequence ID counter ................................................. */
284 static su_uv_array su_uid_seq_counter;
288 static perl_mutex su_uid_seq_counter_mutex;
290 #define SU_LOCK(M) MUTEX_LOCK(M)
291 #define SU_UNLOCK(M) MUTEX_UNLOCK(M)
293 #else /* USE_ITHREADS */
298 #endif /* !USE_ITHREADS */
300 static UV su_uid_seq_next(pTHX_ UV depth) {
301 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
305 SU_LOCK(&su_uid_seq_counter_mutex);
307 seqs = su_uid_seq_counter.seqs;
309 if (depth >= su_uid_seq_counter.size) {
312 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
313 for (i = su_uid_seq_counter.size; i <= depth; ++i)
316 su_uid_seq_counter.seqs = seqs;
317 su_uid_seq_counter.size = depth + 1;
322 SU_UNLOCK(&su_uid_seq_counter_mutex);
327 /* ... UID storage ......................................................... */
334 #define SU_UID_ACTIVE 1
336 static UV su_uid_depth(pTHX_ I32 cxix) {
337 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
342 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
343 depth += si->si_cxix + 1;
354 static void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
355 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
356 su_uid *old_map = old_cxt->map;
359 su_uid *new_map = new_cxt->map;
360 STRLEN old_used = old_cxt->used;
361 STRLEN new_used, new_alloc;
364 new_used = max_depth < old_used ? max_depth : old_used;
365 new_cxt->used = new_used;
367 if (new_used <= new_cxt->alloc) {
368 new_alloc = new_cxt->alloc;
370 new_alloc = new_used;
371 Renew(new_map, new_alloc, su_uid);
372 new_cxt->map = new_map;
373 new_cxt->alloc = new_alloc;
376 for (i = 0; i < new_alloc; ++i) {
377 su_uid *new_uid = new_map + i;
379 if (i < new_used) { /* => i < max_depth && i < old_used */
380 su_uid *old_uid = old_map + i;
382 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
396 /* --- unwind() global storage --------------------------------------------- */
406 /* --- yield() global storage ---------------------------------------------- */
416 /* --- uplevel() data tokens and global storage ---------------------------- */
418 #define SU_UPLEVEL_HIJACKS_RUNOPS SU_HAS_PERL(5, 8, 0)
423 su_uid_storage tmp_uid_storage;
424 su_uid_storage old_uid_storage;
435 PERL_SI *old_curstackinfo;
441 #if SU_UPLEVEL_HIJACKS_RUNOPS
442 runops_proc_t old_runops;
449 static su_uplevel_ud *su_uplevel_ud_new(pTHX) {
450 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
454 Newx(sud, 1, su_uplevel_ud);
457 sud->tmp_uid_storage.map = NULL;
458 sud->tmp_uid_storage.used = 0;
459 sud->tmp_uid_storage.alloc = 0;
461 Newx(si, 1, PERL_SI);
462 si->si_stack = newAV();
463 AvREAL_off(si->si_stack);
464 si->si_cxstack = NULL;
472 static void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
473 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
474 PERL_SI *si = sud->si;
476 Safefree(si->si_cxstack);
477 SvREFCNT_dec(si->si_stack);
480 Safefree(sud->tmp_uid_storage.map);
491 } su_uplevel_storage;
493 #ifndef SU_UPLEVEL_STORAGE_SIZE
494 # define SU_UPLEVEL_STORAGE_SIZE 4
497 /* --- Global data --------------------------------------------------------- */
499 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
502 char *stack_placeholder;
503 su_unwind_storage unwind_storage;
504 su_yield_storage yield_storage;
505 su_uplevel_storage uplevel_storage;
506 su_uid_storage uid_storage;
511 /* --- Stack manipulations ------------------------------------------------- */
513 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
515 #define SU_SAVE_DESTRUCTOR_SIZE 3
516 #define SU_SAVE_PLACEHOLDER_SIZE 3
518 #define SU_SAVE_SCALAR_SIZE 3
520 #define SU_SAVE_ARY_SIZE 3
521 #define SU_SAVE_AELEM_SIZE 4
523 # define SU_SAVE_ADELETE_SIZE 3
525 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
527 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
528 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
530 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
533 #define SU_SAVE_HASH_SIZE 3
534 #define SU_SAVE_HELEM_SIZE 4
535 #define SU_SAVE_HDELETE_SIZE 4
536 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
537 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
539 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
542 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
544 #if !SU_HAS_PERL(5, 8, 9)
545 # define SU_SAVE_GP_SIZE 6
546 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
547 # define SU_SAVE_GP_SIZE 3
548 #elif !SU_HAS_PERL(5, 13, 8)
549 # define SU_SAVE_GP_SIZE 4
551 # define SU_SAVE_GP_SIZE 3
554 #ifndef SvCANEXISTDELETE
555 # define SvCANEXISTDELETE(sv) \
557 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
558 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
559 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
560 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
565 /* ... Saving array elements ............................................... */
567 static I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
568 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
574 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
575 #if SU_HAS_PERL(5, 8, 1)
576 if (SvRMAGICAL(av)) {
577 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
579 SV * const * const negative_indices_glob =
580 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
581 NEGATIVE_INDICES_VAR, 16, 0);
582 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
588 idx = key + av_len(av) + 1;
602 static void su_adelete(pTHX_ void *ud_) {
603 su_ud_adelete *ud = (su_ud_adelete *) ud_;
605 av_delete(ud->av, ud->idx, G_DISCARD);
606 SvREFCNT_dec(ud->av);
611 static void su_save_adelete(pTHX_ AV *av, I32 idx) {
612 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
615 Newx(ud, 1, su_ud_adelete);
618 SvREFCNT_inc_simple_void(av);
620 SAVEDESTRUCTOR_X(su_adelete, ud);
623 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
625 #endif /* SAVEADELETE */
627 static void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
628 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
635 idx = su_av_key2idx(av, SvIV(key));
637 if (SvCANEXISTDELETE(av))
638 preeminent = av_exists(av, idx);
640 svp = av_fetch(av, idx, 1);
641 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
644 save_aelem(av, idx, svp);
646 SAVEADELETE(av, idx);
648 if (val) { /* local $x[$idx] = $val; */
649 SvSetMagicSV(*svp, val);
650 } else { /* local $x[$idx]; delete $x[$idx]; */
651 av_delete(av, idx, G_DISCARD);
655 /* ... Saving hash elements ................................................ */
657 static void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
658 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
665 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
666 preeminent = hv_exists_ent(hv, keysv, 0);
668 he = hv_fetch_ent(hv, keysv, 1, 0);
669 svp = he ? &HeVAL(he) : NULL;
670 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
672 if (HvNAME_get(hv) && isGV(*svp)) {
673 save_gp((GV *) *svp, 0);
678 save_helem(hv, keysv, svp);
681 const char * const key = SvPV_const(keysv, keylen);
682 SAVEDELETE(hv, savepvn(key, keylen),
683 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
686 if (val) { /* local $x{$keysv} = $val; */
687 SvSetMagicSV(*svp, val);
688 } else { /* local $x{$keysv}; delete $x{$keysv}; */
689 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
693 /* ... Saving code slots from a glob ....................................... */
695 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
696 # define mro_method_changed_in(G) PL_sub_generation++
704 static void su_restore_gvcv(pTHX_ void *ud_) {
705 su_save_gvcv_ud *ud = ud_;
708 GvCV_set(gv, ud->old_cv);
710 mro_method_changed_in(GvSTASH(gv));
715 static void su_save_gvcv(pTHX_ GV *gv) {
716 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
719 Newx(ud, 1, su_save_gvcv_ud);
721 ud->old_cv = GvCV(gv);
725 mro_method_changed_in(GvSTASH(gv));
727 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
730 /* --- Actions ------------------------------------------------------------- */
741 #define SU_UD_TYPE(U) (((su_ud_common *) (U))->type)
742 #define SU_UD_PRIVATE(U) (((su_ud_common *) (U))->private)
743 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
744 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
745 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
747 #define SU_UD_TYPE_REAP 0
748 #define SU_UD_TYPE_LOCALIZE 1
749 #define SU_UD_TYPE_UID 2
751 #define SU_UD_FREE(U) STMT_START { \
752 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
756 /* ... Reap ................................................................ */
758 #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))
765 #define SU_UD_REAP_CB(U) (((su_ud_reap *) (U))->cb)
767 static void su_call(pTHX_ SV *cb) {
770 PERL_CONTEXT saved_cx;
771 #endif /* SU_SAVE_LAST_CX */
775 SU_D(su_debug_log("@@@ call scope_ix=%2d save_ix=%2d\n",
776 PL_scopestack_ix, PL_savestack_ix));
785 /* If the recently popped context isn't saved there, it will be overwritten by
786 * the sub scope from call_sv, although it's still needed in our caller. */
787 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
788 saved_cx = cxstack[cxix];
789 #endif /* SU_SAVE_LAST_CX */
794 cxstack[cxix] = saved_cx;
795 #endif /* SU_SAVE_LAST_CX */
807 /* ... Localize & localize array/hash element .............................. */
816 #define SU_UD_LOCALIZE_SV(U) (((su_ud_localize *) (U))->sv)
817 #define SU_UD_LOCALIZE_VAL(U) (((su_ud_localize *) (U))->val)
818 #define SU_UD_LOCALIZE_ELEM(U) (((su_ud_localize *) (U))->elem)
820 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
821 SvREFCNT_dec(SU_UD_LOCALIZE_ELEM(U)); \
822 SvREFCNT_dec(SU_UD_LOCALIZE_VAL(U)); \
823 SvREFCNT_dec(SU_UD_LOCALIZE_SV(U)); \
827 static I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
828 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
833 SvREFCNT_inc_simple_void(sv);
835 if (SvTYPE(sv) >= SVt_PVGV) {
836 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
838 } else { /* local *x = \$val; */
839 t = SvTYPE(SvRV(val));
842 } else if (SvROK(sv)) {
843 croak("Invalid %s reference as the localization target",
844 sv_reftype(SvRV(sv), 0));
847 const char *p = SvPV_const(sv, len), *s;
848 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
854 case '$': t = SVt_PV; break;
855 case '@': t = SVt_PVAV; break;
856 case '%': t = SVt_PVHV; break;
857 case '&': t = SVt_PVCV; break;
858 case '*': t = SVt_PVGV; break;
863 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
864 if (SvROK(val) && !sv_isobject(val)) {
865 t = SvTYPE(SvRV(val));
877 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
882 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
887 size = SU_SAVE_GP_SIZE;
891 size = SU_SAVE_GVCV_SIZE;
895 size = SU_SAVE_SCALAR_SIZE;
898 /* When deref is set, val isn't NULL */
900 SU_UD_PRIVATE(ud) = t;
903 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
904 ud->elem = SvREFCNT_inc(elem);
909 static void su_localize(pTHX_ void *ud_) {
910 #define su_localize(U) su_localize(aTHX_ (U))
911 su_ud_localize *ud = (su_ud_localize *) ud_;
915 svtype t = SU_UD_PRIVATE(ud);
918 if (SvTYPE(sv) >= SVt_PVGV) {
922 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
925 const char *name = SvPV_const(sv, len);
926 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
933 su_debug_log("%p: === localize a %s\n",ud, sv_reftype(z, 0));
934 su_debug_log("%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
935 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
939 /* Inspired from Alias.pm */
943 su_save_aelem(GvAV(gv), elem, val);
950 su_save_helem(GvHV(gv), elem, val);
956 save_gp(gv, 1); /* hide previous entry in symtab */
962 gv = (GV *) save_scalar(gv);
967 SvSetMagicSV((SV *) gv, val);
972 /* ... Unique context ID ................................................... */
974 /* We must pass the index because MY_CXT.uid_storage might be reallocated
975 * between the UID fetch and the invalidation at the end of scope. */
982 static void su_uid_drop(pTHX_ void *ud_) {
986 MY_CXT.uid_storage.map[ud->idx].flags &= ~SU_UID_ACTIVE;
993 /* --- Pop a context back -------------------------------------------------- */
996 # define SU_CXNAME(C) PL_block_type[CxTYPE(C)]
998 # if SU_HAS_PERL(5, 11, 0)
999 static const char *su_block_type[] = {
1013 # elif SU_HAS_PERL(5, 9, 3)
1014 static const char *su_block_type[] = {
1029 static const char *su_block_type[] = {
1038 # define SU_CXNAME(C) su_block_type[CxTYPE(C)]
1041 static void su_pop(pTHX_ void *ud) {
1042 #define su_pop(U) su_pop(aTHX_ (U))
1043 I32 depth, base, mark, *origin;
1044 depth = SU_UD_DEPTH(ud);
1047 "%p: --- pop a %s\n"
1048 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
1049 ud, SU_CXNAME(cxstack + cxstack_ix),
1050 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix]
1053 origin = SU_UD_ORIGIN(ud);
1054 mark = origin[depth];
1055 base = origin[depth - 1];
1057 SU_D(su_debug_log("%p: original scope was %*c top=%2d base=%2d\n",
1058 ud, 24, ' ', mark, base));
1061 #if SU_HAS_PERL(5, 19, 4)
1066 SU_D(su_debug_log("%p: clear leftovers\n", ud));
1068 #if SU_HAS_PERL(5, 19, 4)
1069 cx = cxstack + cxstack_ix;
1070 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1071 save = PL_scopestack[cx->blk_oldscopesp - 1];
1074 PL_savestack_ix = mark;
1077 #if SU_HAS_PERL(5, 19, 4)
1078 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1079 PL_scopestack[cx->blk_oldscopesp - 1] = save;
1082 PL_savestack_ix = base;
1084 SU_UD_DEPTH(ud) = --depth;
1089 if ((pad = SU_UD_PAD(ud)) > 0) {
1093 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
1094 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1095 SU_SAVE_PLACEHOLDER();
1100 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
1101 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1102 SAVEDESTRUCTOR_X(su_pop, ud);
1104 switch (SU_UD_TYPE(ud)) {
1105 case SU_UD_TYPE_REAP: {
1106 SU_D(su_debug_log("%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
1107 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix));
1108 SAVEDESTRUCTOR_X(su_call, SU_UD_REAP_CB(ud));
1112 case SU_UD_TYPE_LOCALIZE:
1114 SU_UD_LOCALIZE_FREE(ud);
1116 case SU_UD_TYPE_UID:
1117 SAVEDESTRUCTOR_X(su_uid_drop, ud);
1122 SU_D(su_debug_log("%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
1123 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
1126 /* --- Initialize the stack and the action userdata ------------------------ */
1128 static I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
1129 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
1130 I32 i, depth, offset, base, *origin;
1133 SU_D(su_debug_log("%p: ### init for cx %d\n", ud, cxix));
1135 /* su_pop() is going to be called from leave_scope(), so before pushing the
1136 * next callback, we'll want to flush the current scope stack slice first.
1137 * However, if we want the next callback not to be processed immediately by
1138 * the current leave_scope(), we'll need to hide it by artificially
1139 * incrementing the scope stack marker before. For the intermediate bumps,
1140 * we will only need a bump of SU_SAVE_DESTRUCTOR_SIZE items, but for the
1141 * last one we will need a bump of size items. However, in order to preserve
1142 * the natural ordering between scope stack markers, we cannot bump lower
1143 * markers more than higher ones. This is why we bump the intermediate markers
1144 * by the smallest multiple of SU_SAVE_PLACEHOLDER_SIZE greater or equal to
1145 * max(SU_SAVE_DESTRUCTOR_SIZE, size). */
1147 if (size <= SU_SAVE_DESTRUCTOR_SIZE) {
1150 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
1151 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
1152 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
1155 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
1156 SU_D(su_debug_log("%p: size=%d pad=%d offset=%d\n", ud, size, pad, offset));
1158 depth = PL_scopestack_ix - cxstack[cxix].blk_oldscopesp;
1159 SU_D(su_debug_log("%p: going down to depth %d\n", ud, depth));
1161 /* We need to bump all the intermediary stack markers just in case an
1162 * exception is thrown before the target scope is reached. Indeed, in this
1163 * case there might be arbitrary many scope frames flushed at the same time,
1164 * and since we cannot know in advance whether this will happen or not, we
1165 * have to make sure the final frame is protected for the actual action. But
1166 * of course, in order to do that, we also need to bump all the previous stack
1167 * markers. If not for this, it should have been possible to just bump the two
1168 * next frames in su_pop(). */
1170 Newx(origin, depth + 1, I32);
1171 base = PL_scopestack_ix - depth;
1172 origin[0] = PL_scopestack[base];
1173 PL_scopestack[base] += size;
1174 for (i = 1; i < depth; ++i) {
1176 /* origin[depth - i] == PL_scopestack[PL_scopestack_ix - i] */
1177 origin[i] = PL_scopestack[j];
1178 PL_scopestack[j] += offset;
1180 origin[depth] = PL_savestack_ix;
1182 SU_UD_PAD(ud) = pad;
1183 SU_UD_DEPTH(ud) = depth;
1184 SU_UD_ORIGIN(ud) = origin;
1186 /* Make sure the first destructor fires by pushing enough fake slots on the
1188 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1189 <= PL_scopestack[PL_scopestack_ix - 1]) {
1192 SU_D(su_debug_log("%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1193 ud, PL_scopestack_ix, PL_savestack_ix));
1194 SU_SAVE_PLACEHOLDER();
1195 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1196 <= PL_scopestack[PL_scopestack_ix - 1]);
1198 SU_D(su_debug_log("%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1199 ud, PL_scopestack_ix, PL_savestack_ix));
1200 SAVEDESTRUCTOR_X(su_pop, ud);
1203 for (i = 0; i <= depth; ++i) {
1204 I32 j = PL_scopestack_ix - i;
1205 su_debug_log("%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1206 ud, i, j, origin[depth - i],
1207 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1214 /* --- Unwind stack -------------------------------------------------------- */
1216 static void su_unwind(pTHX_ void *ud_) {
1218 I32 cxix = MY_CXT.unwind_storage.cxix;
1219 I32 items = MY_CXT.unwind_storage.items;
1222 PERL_UNUSED_VAR(ud_);
1224 PL_stack_sp = MY_CXT.unwind_storage.savesp;
1225 #if SU_HAS_PERL(5, 19, 4)
1228 SV **sp = PL_stack_sp;
1229 for (i = -items + 1; i <= 0; ++i)
1231 sv_2mortal(SvREFCNT_inc(sp[i]));
1235 if (cxstack_ix > cxix)
1238 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1239 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1242 I32 gimme = GIMME_V;
1243 su_debug_log("%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1245 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1246 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1249 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1250 PL_op = PL_op->op_ppaddr(aTHX);
1252 *PL_markstack_ptr = mark;
1254 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1255 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1258 /* --- Yield --------------------------------------------------------------- */
1260 #if SU_HAS_PERL(5, 10, 0)
1261 # define SU_RETOP_SUB(C) ((C)->blk_sub.retop)
1262 # define SU_RETOP_EVAL(C) ((C)->blk_eval.retop)
1263 # define SU_RETOP_LOOP(C) ((C)->blk_loop.my_op->op_lastop->op_next)
1264 # define SU_RETOP_GIVEN(C) ((C)->blk_givwhen.leave_op->op_next)
1266 # define SU_RETOP_SUB(C) ((C)->blk_oldretsp > 0 ? PL_retstack[(C)->blk_oldretsp - 1] : NULL)
1267 # define SU_RETOP_EVAL(C) SU_RETOP_SUB(C)
1268 # define SU_RETOP_LOOP(C) ((C)->blk_loop.last_op->op_next)
1271 static void su_yield(pTHX_ void *ud_) {
1274 const char *which = ud_;
1275 I32 cxix = MY_CXT.yield_storage.cxix;
1276 I32 items = MY_CXT.yield_storage.items;
1277 opcode type = OP_NULL;
1281 PERL_UNUSED_VAR(ud_);
1283 cx = cxstack + cxix;
1284 switch (CxTYPE(cx)) {
1286 I32 i, cur = cxstack_ix, n = 1;
1288 /* Is this actually a given/when block? This may occur only when yield was
1289 * called with HERE (or nothing) as the context. */
1290 #if SU_HAS_PERL(5, 10, 0)
1292 PERL_CONTEXT *prev = cx - 1;
1293 U8 prev_type = CxTYPE(prev);
1294 if ((prev_type == CXt_GIVEN || prev_type == CXt_WHEN)
1295 && (prev->blk_oldcop == cx->blk_oldcop)) {
1298 if (prev_type == CXt_GIVEN)
1307 /* Bare blocks (that appear as do { ... } blocks, map { ... } blocks or
1308 * constant folded blcoks) don't need to save the op to return to anywhere
1309 * since 'last' isn't supposed to work inside them. So we climb higher in
1310 * the context stack until we reach a context that has a return op (i.e. a
1311 * sub, an eval, a format or a real loop), recording how many blocks we
1312 * crossed. Then we follow the op_next chain until we get to the leave op
1313 * that closes the original block, which we are assured to reach since
1314 * everything is static (the blocks we have crossed cannot be evals or
1315 * subroutine calls). */
1316 for (i = cxix + 1; i <= cur; ++i) {
1317 PERL_CONTEXT *cx2 = cxstack + i;
1318 switch (CxTYPE(cx2)) {
1324 o = SU_RETOP_SUB(cx2);
1327 o = SU_RETOP_EVAL(cx2);
1329 #if SU_HAS_PERL(5, 11, 0)
1331 case CXt_LOOP_PLAIN:
1332 case CXt_LOOP_LAZYSV:
1333 case CXt_LOOP_LAZYIV:
1337 o = SU_RETOP_LOOP(cx2);
1346 /* We may find other enter/leave blocks on our way to the matching leave.
1347 * Make sure the depth is incremented/decremented appropriately. */
1348 if (o->op_type == OP_ENTER) {
1350 } else if (o->op_type == OP_LEAVE) {
1364 next = SU_RETOP_SUB(cx);
1367 type = CxTRYBLOCK(cx) ? OP_LEAVETRY : OP_LEAVEEVAL;
1368 next = SU_RETOP_EVAL(cx);
1370 #if SU_HAS_PERL(5, 11, 0)
1372 case CXt_LOOP_PLAIN:
1373 case CXt_LOOP_LAZYSV:
1374 case CXt_LOOP_LAZYIV:
1378 type = OP_LEAVELOOP;
1379 next = SU_RETOP_LOOP(cx);
1381 #if SU_HAS_PERL(5, 10, 0)
1384 type = OP_LEAVEGIVEN;
1385 next = SU_RETOP_GIVEN(cx);
1389 #if SU_HAS_PERL(5, 15, 1)
1390 type = OP_LEAVEWHEN;
1393 flags |= OPf_SPECIAL;
1399 croak("%s() can't target a substitution context", which);
1402 croak("%s() doesn't know how to leave a %s context",
1403 which, SU_CXNAME(cxstack + cxix));
1407 PL_stack_sp = MY_CXT.yield_storage.savesp;
1408 #if SU_HAS_PERL(5, 19, 4)
1411 SV **sp = PL_stack_sp;
1412 for (i = -items + 1; i <= 0; ++i)
1414 sv_2mortal(SvREFCNT_inc(sp[i]));
1418 if (cxstack_ix > cxix)
1421 /* Copy the arguments passed to yield() where the leave op expects to find
1424 Move(PL_stack_sp - items + 1, PL_stack_base + cx->blk_oldsp + 1, items, SV *);
1425 PL_stack_sp = PL_stack_base + cx->blk_oldsp + items;
1427 flags |= OP_GIMME_REVERSE(cx->blk_gimme);
1429 MY_CXT.yield_storage.leave_op.op_type = type;
1430 MY_CXT.yield_storage.leave_op.op_ppaddr = PL_ppaddr[type];
1431 MY_CXT.yield_storage.leave_op.op_flags = flags;
1432 MY_CXT.yield_storage.leave_op.op_next = next;
1434 PL_op = (OP *) &(MY_CXT.yield_storage.leave_op);
1435 PL_op = PL_op->op_ppaddr(aTHX);
1437 MY_CXT.yield_storage.proxy_op.op_next = PL_op;
1438 PL_op = &(MY_CXT.yield_storage.proxy_op);
1441 /* --- Uplevel ------------------------------------------------------------- */
1443 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1444 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1446 static su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1447 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1452 sud = MY_CXT.uplevel_storage.root;
1454 MY_CXT.uplevel_storage.root = sud->next;
1455 MY_CXT.uplevel_storage.count--;
1457 sud = su_uplevel_ud_new();
1460 sud->next = MY_CXT.uplevel_storage.top;
1461 MY_CXT.uplevel_storage.top = sud;
1463 depth = su_uid_depth(cxix);
1464 su_uid_storage_dup(&sud->tmp_uid_storage, &MY_CXT.uid_storage, depth);
1465 sud->old_uid_storage = MY_CXT.uid_storage;
1466 MY_CXT.uid_storage = sud->tmp_uid_storage;
1471 #if SU_HAS_PERL(5, 13, 7)
1473 static void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1474 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1477 sud->tmp_uid_storage = MY_CXT.uid_storage;
1478 MY_CXT.uid_storage = sud->old_uid_storage;
1482 map = sud->tmp_uid_storage.map;
1483 alloc = sud->tmp_uid_storage.alloc;
1484 for (i = 0; i < alloc; ++i)
1485 map[i].flags &= ~SU_UID_ACTIVE;
1487 MY_CXT.uplevel_storage.top = sud->next;
1489 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1490 su_uplevel_ud_delete(sud);
1492 sud->next = MY_CXT.uplevel_storage.root;
1493 MY_CXT.uplevel_storage.root = sud;
1494 MY_CXT.uplevel_storage.count++;
1500 static int su_uplevel_goto_static(const OP *o) {
1501 for (; o; o = OpSIBLING(o)) {
1502 /* goto ops are unops with kids. */
1503 if (!(o->op_flags & OPf_KIDS))
1506 switch (o->op_type) {
1509 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1514 if (su_uplevel_goto_static(((const UNOP *) o)->op_first))
1523 #if SU_UPLEVEL_HIJACKS_RUNOPS
1525 static int su_uplevel_goto_runops(pTHX) {
1526 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1532 if (op->op_type == OP_GOTO) {
1533 AV *argarray = NULL;
1536 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1537 const PERL_CONTEXT *cx = cxstack + cxix;
1539 switch (CxTYPE(cx)) {
1541 if (CxHASARGS(cx)) {
1542 argarray = cx->blk_sub.argarray;
1558 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1559 AV *args = GvAV(PL_defgv);
1560 I32 items = AvFILLp(args);
1562 av_extend(argarray, items);
1563 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1564 AvFILLp(argarray) = items;
1569 PL_op = op = op->op_ppaddr(aTHX);
1571 #if !SU_HAS_PERL(5, 13, 0)
1581 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1583 #define su_at_underscore(C) PadARRAY(PadlistARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1585 static void su_uplevel_restore(pTHX_ void *sus_) {
1586 su_uplevel_ud *sud = sus_;
1587 PERL_SI *cur = sud->old_curstackinfo;
1588 PERL_SI *si = sud->si;
1590 #if SU_UPLEVEL_HIJACKS_RUNOPS
1591 if (PL_runops == su_uplevel_goto_runops)
1592 PL_runops = sud->old_runops;
1595 if (sud->callback) {
1596 PERL_CONTEXT *cx = cxstack + sud->cxix;
1597 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1599 /* We have to fix the pad entry for @_ in the original callback because it
1600 * may have been reified. */
1601 if (AvREAL(argarray)) {
1602 const I32 fill = AvFILLp(argarray);
1603 SvREFCNT_dec(argarray);
1605 AvREAL_off(argarray);
1606 AvREIFY_on(argarray);
1607 av_extend(argarray, fill);
1608 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1610 CLEAR_ARGARRAY(argarray);
1613 /* If the old cv member is our renamed CV, it means that this place has been
1614 * reached without a goto() happening, and the old argarray member is
1615 * actually our fake argarray. Destroy it properly in that case. */
1616 if (cx->blk_sub.cv == sud->renamed) {
1617 SvREFCNT_dec(cx->blk_sub.argarray);
1618 cx->blk_sub.argarray = argarray;
1621 CvDEPTH(sud->callback)--;
1622 SvREFCNT_dec(sud->callback);
1625 /* Free the renamed CV. We must do it ourselves so that we can force the
1626 * depth to be 0, or perl would complain about it being "still in use".
1627 * But we *know* that it cannot be so. */
1629 if (!CvISXSUB(sud->renamed)) {
1630 CvDEPTH(sud->renamed) = 0;
1631 CvPADLIST(sud->renamed) = NULL;
1633 SvREFCNT_dec(sud->renamed);
1636 CATCH_SET(sud->old_catch);
1638 SU_UPLEVEL_RESTORE(op);
1640 /* stack_grow() wants PL_curstack so restore the old stack first */
1641 if (PL_curstackinfo == si) {
1642 PL_curstack = cur->si_stack;
1643 if (sud->old_mainstack)
1644 SU_UPLEVEL_RESTORE(mainstack);
1645 SU_UPLEVEL_RESTORE(curstackinfo);
1648 CV *target = sud->target;
1651 /* When we die, the depth of the target CV is not updated because of the
1652 * stack switcheroo. So we have to look at all the frames between the
1653 * uplevel call and the catch block to count how many call frames to the
1654 * target CV were skipped. */
1655 for (i = cur->si_cxix; i > sud->cxix; i--) {
1656 register const PERL_CONTEXT *cx = cxstack + i;
1658 if (CxTYPE(cx) == CXt_SUB) {
1659 if (cx->blk_sub.cv == target)
1664 /* If we died, the replacement stack was already unwinded to the first
1665 * eval frame, and all the contexts down there were popped. We don't have
1666 * to pop manually any context of the original stack, because they must
1667 * have been in the replacement stack as well (since the second was copied
1668 * from the first). Thus we only have to make sure the original stack index
1669 * points to the context just below the first eval scope under the target
1671 for (; i >= 0; i--) {
1672 register const PERL_CONTEXT *cx = cxstack + i;
1674 switch (CxTYPE(cx)) {
1676 if (cx->blk_sub.cv == target)
1688 CvDEPTH(target) = sud->target_depth - levels;
1689 PL_curstackinfo->si_cxix = i - 1;
1691 #if !SU_HAS_PERL(5, 13, 1)
1692 /* Since $@ was maybe localized between the target frame and the uplevel
1693 * call, we forcefully flush the save stack to get rid of it and then
1694 * reset $@ to its proper value. Note that the the call to
1695 * su_uplevel_restore() must happen before the "reset $@" item of the save
1696 * stack is processed, as uplevel was called after the localization.
1697 * Andrew's changes to how $@ was handled, which were mainly integrated
1698 * between perl 5.13.0 and 5.13.1, fixed this. */
1699 if (ERRSV && SvTRUE(ERRSV)) {
1700 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1701 SV *errsv = SvREFCNT_inc(ERRSV);
1702 PL_scopestack_ix = cx->blk_oldscopesp;
1703 leave_scope(PL_scopestack[PL_scopestack_ix]);
1704 sv_setsv(ERRSV, errsv);
1705 SvREFCNT_dec(errsv);
1711 SU_UPLEVEL_RESTORE(curcop);
1713 SvREFCNT_dec(sud->target);
1715 PL_stack_base = AvARRAY(cur->si_stack);
1716 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1717 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1719 /* When an exception is thrown from the uplevel'd subroutine,
1720 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1721 * die_where() in more recent perls), which has the sad habit of keeping a
1722 * pointer to the current context frame across this call. This means that we
1723 * can't free the temporary context stack we used for the uplevel call right
1724 * now, or that pointer upwards would point to garbage. */
1725 #if SU_HAS_PERL(5, 13, 7)
1726 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1727 * public in perl 5.13.7. */
1728 su_uplevel_storage_delete(sud);
1730 /* Otherwise, we just enqueue it back in the global storage list. */
1734 sud->tmp_uid_storage = MY_CXT.uid_storage;
1735 MY_CXT.uid_storage = sud->old_uid_storage;
1737 MY_CXT.uplevel_storage.top = sud->next;
1738 sud->next = MY_CXT.uplevel_storage.root;
1739 MY_CXT.uplevel_storage.root = sud;
1740 MY_CXT.uplevel_storage.count++;
1747 static CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1748 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1752 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1754 CvFLAGS(cv) = CvFLAGS(proto);
1756 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1758 CvDEPTH(cv) = CvDEPTH(proto);
1760 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1762 CvFILE(cv) = CvFILE(proto);
1766 #if SU_RELEASE && SU_HAS_PERL_EXACT(5, 21, 4)
1769 CvSTASH_set(cv, CvSTASH(proto));
1770 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1771 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1772 * (which was part of perl 5.13.7). */
1773 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1775 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1778 if (CvISXSUB(proto)) {
1779 CvXSUB(cv) = CvXSUB(proto);
1780 CvXSUBANY(cv) = CvXSUBANY(proto);
1783 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1785 CvSTART(cv) = CvSTART(proto);
1786 CvPADLIST(cv) = CvPADLIST(proto);
1788 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1789 #ifdef CVf_WEAKOUTSIDE
1790 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1792 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1793 #ifdef CvOUTSIDE_SEQ
1794 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1798 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1808 static I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1809 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1811 const PERL_CONTEXT *cx = cxstack + cxix;
1813 PERL_SI *cur = PL_curstackinfo;
1819 I32 old_mark, new_mark;
1826 /* Make PL_stack_sp point just before the CV. */
1827 PL_stack_sp -= args + 1;
1828 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1831 sud = su_uplevel_storage_new(cxix);
1835 sud->callback = NULL;
1836 sud->renamed = NULL;
1837 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1841 si->si_type = cur->si_type;
1843 si->si_prev = cur->si_prev;
1845 si->si_markoff = cx->blk_oldmarksp;
1848 /* Allocate enough space for all the elements of the original stack up to the
1849 * target context, plus the forthcoming arguments. */
1850 new_mark = cx->blk_oldsp;
1851 av_extend(si->si_stack, new_mark + 1 + args + 1);
1852 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1853 AvFILLp(si->si_stack) = new_mark;
1854 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1856 /* Specialized SWITCHSTACK() */
1857 PL_stack_base = AvARRAY(si->si_stack);
1858 old_stack_sp = PL_stack_sp;
1859 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1860 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1863 /* Copy the context stack up to the context just below the target. */
1864 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1865 if (si->si_cxmax < cxix) {
1866 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1867 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1868 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1870 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1871 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1873 target = cx->blk_sub.cv;
1874 sud->target = (CV *) SvREFCNT_inc(target);
1875 sud->target_depth = CvDEPTH(target);
1877 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1878 * run-time implication, since PL_curcop will be overwritten as soon as we
1879 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1880 * make it point to the blk_oldcop for the target frame, so that caller()
1881 * reports the right file name, line number and lexical hints. */
1882 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1883 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1884 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1886 SU_UPLEVEL_SAVE(curstackinfo, si);
1887 /* If those two are equal, we need to fool POPSTACK_TO() */
1888 if (PL_mainstack == PL_curstack)
1889 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1891 sud->old_mainstack = NULL;
1892 PL_curstack = si->si_stack;
1894 renamed = su_cv_clone(callback, CvGV(target));
1895 sud->renamed = renamed;
1898 /* Both SP and old_stack_sp point just before the CV. */
1899 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1901 PUSHs((SV *) renamed);
1904 Zero(&sub_op, 1, UNOP);
1905 sub_op.op_type = OP_ENTERSUB;
1906 sub_op.op_next = NULL;
1907 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1909 sub_op.op_flags |= OPpENTERSUB_DB;
1911 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1913 #if SU_UPLEVEL_HIJACKS_RUNOPS
1914 sud->old_runops = PL_runops;
1917 sud->old_catch = CATCH_GET;
1920 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1921 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1923 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1926 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1927 CvDEPTH(callback)++;
1929 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1930 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1931 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1932 * with what we put on the stack. But we want to fake up the same arguments
1933 * as the ones in use at the context we uplevel to, so we replace the
1934 * argarray with an unreal copy of the original @_. */
1938 av_extend(av, AvMAX(cx->blk_sub.argarray));
1939 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1940 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1941 sub_cx->blk_sub.argarray = av;
1943 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1946 if (su_uplevel_goto_static(CvROOT(renamed))) {
1947 #if SU_UPLEVEL_HIJACKS_RUNOPS
1948 if (PL_runops != PL_runops_std) {
1949 if (PL_runops == PL_runops_dbg) {
1951 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1952 } else if (PL_runops != su_uplevel_goto_runops)
1953 croak("uplevel() can't execute code that calls goto with a custom runloop");
1956 PL_runops = su_uplevel_goto_runops;
1957 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1958 croak("uplevel() can't execute code that calls goto before perl 5.8");
1959 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1967 ret = PL_stack_sp - (PL_stack_base + new_mark);
1969 AV *old_stack = sud->old_curstackinfo->si_stack;
1971 if (old_mark + ret > AvMAX(old_stack)) {
1972 /* Specialized EXTEND(old_sp, ret) */
1973 av_extend(old_stack, old_mark + ret + 1);
1974 old_stack_sp = AvARRAY(old_stack) + old_mark;
1977 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1979 AvFILLp(old_stack) += ret;
1987 /* --- Unique context ID --------------------------------------------------- */
1989 static su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1990 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1995 map = MY_CXT.uid_storage.map;
1996 alloc = MY_CXT.uid_storage.alloc;
1998 if (depth >= alloc) {
2001 Renew(map, depth + 1, su_uid);
2002 for (i = alloc; i <= depth; ++i) {
2007 MY_CXT.uid_storage.map = map;
2008 MY_CXT.uid_storage.alloc = depth + 1;
2011 if (depth >= MY_CXT.uid_storage.used)
2012 MY_CXT.uid_storage.used = depth + 1;
2017 static int su_uid_storage_check(pTHX_ UV depth, UV seq) {
2018 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
2022 if (depth >= MY_CXT.uid_storage.used)
2025 uid = MY_CXT.uid_storage.map + depth;
2027 return (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
2030 static SV *su_uid_get(pTHX_ I32 cxix) {
2031 #define su_uid_get(I) su_uid_get(aTHX_ (I))
2036 depth = su_uid_depth(cxix);
2037 uid = su_uid_storage_fetch(depth);
2039 if (!(uid->flags & SU_UID_ACTIVE)) {
2042 uid->seq = su_uid_seq_next(depth);
2043 uid->flags |= SU_UID_ACTIVE;
2045 Newx(ud, 1, su_ud_uid);
2046 SU_UD_TYPE(ud) = SU_UD_TYPE_UID;
2048 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2051 uid_sv = sv_newmortal();
2052 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
2059 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
2061 #else /* grok_number */
2063 #define IS_NUMBER_IN_UV 0x1
2065 static int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
2066 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
2070 /* This crude check should be good enough for a fallback implementation.
2071 * Better be too strict than too lax. */
2072 for (i = 0; i < len; ++i) {
2077 tmpsv = sv_newmortal();
2078 sv_setpvn(tmpsv, s, len);
2079 *valuep = sv_2uv(tmpsv);
2081 return IS_NUMBER_IN_UV;
2084 #endif /* !grok_number */
2086 static int su_uid_validate(pTHX_ SV *uid) {
2087 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
2093 s = SvPV_const(uid, len);
2095 while (p < len && s[p] != '-')
2098 croak("UID contains only one part");
2100 type = su_grok_number(s, p, &depth);
2101 if (type != IS_NUMBER_IN_UV)
2102 croak("First UID part is not an unsigned integer");
2104 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
2106 type = su_grok_number(s + p, len - p, &seq);
2107 if (type != IS_NUMBER_IN_UV)
2108 croak("Second UID part is not an unsigned integer");
2110 return su_uid_storage_check(depth, seq);
2113 /* --- Context operations -------------------------------------------------- */
2115 /* Remove sequences of BLOCKs having DB for stash, followed by a SUB context
2116 * for the debugger callback. */
2118 static I32 su_context_skip_db(pTHX_ I32 cxix) {
2119 #define su_context_skip_db(C) su_context_skip_db(aTHX_ (C))
2125 for (i = cxix; i > 0; --i) {
2126 PERL_CONTEXT *cx = cxstack + i;
2128 switch (CxTYPE(cx)) {
2129 #if SU_HAS_PERL(5, 17, 1)
2130 case CXt_LOOP_PLAIN:
2133 if (cx->blk_oldcop && CopSTASH(cx->blk_oldcop) == GvSTASH(PL_DBgv))
2137 if (cx->blk_sub.cv == GvCV(PL_DBsub)) {
2153 static I32 su_context_normalize_up(pTHX_ I32 cxix) {
2154 #define su_context_normalize_up(C) su_context_normalize_up(aTHX_ (C))
2160 cx = cxstack + cxix;
2161 if (CxTYPE(cx) == CXt_BLOCK) {
2162 PERL_CONTEXT *prev = cx - 1;
2164 switch (CxTYPE(prev)) {
2165 #if SU_HAS_PERL(5, 10, 0)
2169 #if SU_HAS_PERL(5, 11, 0)
2170 /* That's the only subcategory that can cause an extra BLOCK context */
2171 case CXt_LOOP_PLAIN:
2175 if (cx->blk_oldcop == prev->blk_oldcop)
2179 if (cx->blk_oldcop && OpSIBLING(cx->blk_oldcop)
2180 && OpSIBLING(cx->blk_oldcop)->op_type == OP_SUBST)
2189 static I32 su_context_normalize_down(pTHX_ I32 cxix) {
2190 #define su_context_normalize_down(C) su_context_normalize_down(aTHX_ (C))
2193 if (cxix >= cxstack_ix)
2196 next = cxstack + cxix + 1;
2197 if (CxTYPE(next) == CXt_BLOCK) {
2198 PERL_CONTEXT *cx = next - 1;
2200 switch (CxTYPE(cx)) {
2201 #if SU_HAS_PERL(5, 10, 0)
2205 #if SU_HAS_PERL(5, 11, 0)
2206 /* That's the only subcategory that can cause an extra BLOCK context */
2207 case CXt_LOOP_PLAIN:
2211 if (cx->blk_oldcop == next->blk_oldcop)
2215 if (next->blk_oldcop && OpSIBLING(next->blk_oldcop)
2216 && OpSIBLING(next->blk_oldcop)->op_type == OP_SUBST)
2225 #define su_context_here() su_context_normalize_up(su_context_skip_db(cxstack_ix))
2227 static I32 su_context_gimme(pTHX_ I32 cxix) {
2228 #define su_context_gimme(C) su_context_gimme(aTHX_ (C))
2231 for (i = cxix; i >= 0; --i) {
2232 PERL_CONTEXT *cx = cxstack + i;
2234 switch (CxTYPE(cx)) {
2235 /* gimme is always G_ARRAY for loop contexts. */
2236 #if SU_HAS_PERL(5, 11, 0)
2238 case CXt_LOOP_PLAIN:
2239 case CXt_LOOP_LAZYSV:
2240 case CXt_LOOP_LAZYIV:
2245 const COP *cop = cx->blk_oldcop;
2246 if (cop && OpSIBLING(cop)) {
2247 switch (OpSIBLING(cop)->op_flags & OPf_WANT) {
2250 case OPf_WANT_SCALAR:
2269 /* --- Global setup/teardown ----------------------------------------------- */
2271 static VOL U32 su_initialized = 0;
2273 static void su_global_teardown(pTHX_ void *root) {
2274 if (!su_initialized)
2282 SU_LOCK(&su_uid_seq_counter_mutex);
2283 PerlMemShared_free(su_uid_seq_counter.seqs);
2284 su_uid_seq_counter.size = 0;
2285 SU_UNLOCK(&su_uid_seq_counter_mutex);
2287 MUTEX_DESTROY(&su_uid_seq_counter_mutex);
2294 XS(XS_Scope__Upper_unwind);
2295 XS(XS_Scope__Upper_yield);
2296 XS(XS_Scope__Upper_leave);
2298 #if SU_HAS_PERL(5, 9, 0)
2299 # define SU_XS_FILE_TYPE const char
2301 # define SU_XS_FILE_TYPE char
2304 static void su_global_setup(pTHX_ SU_XS_FILE_TYPE *file) {
2305 #define su_global_setup(F) su_global_setup(aTHX_ (F))
2311 MUTEX_INIT(&su_uid_seq_counter_mutex);
2313 SU_LOCK(&su_uid_seq_counter_mutex);
2314 su_uid_seq_counter.seqs = NULL;
2315 su_uid_seq_counter.size = 0;
2316 SU_UNLOCK(&su_uid_seq_counter_mutex);
2318 stash = gv_stashpv(__PACKAGE__, 1);
2319 newCONSTSUB(stash, "TOP", newSViv(0));
2320 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
2322 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
2323 newXSproto("Scope::Upper::yield", XS_Scope__Upper_yield, file, NULL);
2324 newXSproto("Scope::Upper::leave", XS_Scope__Upper_leave, file, NULL);
2327 call_atexit(su_global_teardown, aTHX);
2329 call_atexit(su_global_teardown, NULL);
2337 /* --- Interpreter setup/teardown ------------------------------------------ */
2339 static void su_local_teardown(pTHX_ void *param) {
2343 Safefree(MY_CXT.uid_storage.map);
2345 cur = MY_CXT.uplevel_storage.root;
2347 su_uplevel_ud *prev;
2351 su_uplevel_ud_delete(prev);
2358 static void su_local_setup(pTHX) {
2359 #define su_local_setup() su_local_setup(aTHX)
2362 MY_CXT.stack_placeholder = NULL;
2364 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
2365 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
2366 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
2367 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
2369 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
2370 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
2371 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
2373 Zero(&(MY_CXT.yield_storage.leave_op), 1, UNOP);
2374 MY_CXT.yield_storage.leave_op.op_type = OP_STUB;
2375 MY_CXT.yield_storage.leave_op.op_ppaddr = NULL;
2377 Zero(&(MY_CXT.yield_storage.proxy_op), 1, OP);
2378 MY_CXT.yield_storage.proxy_op.op_type = OP_STUB;
2379 MY_CXT.yield_storage.proxy_op.op_ppaddr = NULL;
2381 MY_CXT.uplevel_storage.top = NULL;
2382 MY_CXT.uplevel_storage.root = NULL;
2383 MY_CXT.uplevel_storage.count = 0;
2385 MY_CXT.uid_storage.map = NULL;
2386 MY_CXT.uid_storage.used = 0;
2387 MY_CXT.uid_storage.alloc = 0;
2389 call_atexit(su_local_teardown, NULL);
2394 /* --- XS ------------------------------------------------------------------ */
2396 #define SU_GET_CONTEXT(A, B, D) \
2405 else if (cxix > cxstack_ix) \
2413 #define SU_GET_LEVEL(A, B) \
2419 level = SvIV(lsv); \
2426 #if SU_HAS_PERL(5, 10, 0)
2427 # define SU_INFO_COUNT 11
2429 # define SU_INFO_COUNT 10
2432 XS(XS_Scope__Upper_unwind) {
2441 PERL_UNUSED_VAR(cv); /* -W */
2442 PERL_UNUSED_VAR(ax); /* -Wall */
2444 SU_GET_CONTEXT(0, items - 1, cxstack_ix);
2446 PERL_CONTEXT *cx = cxstack + cxix;
2447 switch (CxTYPE(cx)) {
2449 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2453 MY_CXT.unwind_storage.cxix = cxix;
2454 MY_CXT.unwind_storage.items = items;
2455 MY_CXT.unwind_storage.savesp = PL_stack_sp;
2457 MY_CXT.unwind_storage.items--;
2458 MY_CXT.unwind_storage.savesp--;
2460 /* pp_entersub will want to sanitize the stack after returning from there
2461 * Screw that, we're insane!
2462 * dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
2463 if (GIMME_V == G_SCALAR)
2464 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2465 SAVEDESTRUCTOR_X(su_unwind, NULL);
2470 } while (--cxix >= 0);
2471 croak("Can't return outside a subroutine");
2474 static const char su_yield_name[] = "yield";
2476 XS(XS_Scope__Upper_yield) {
2485 PERL_UNUSED_VAR(cv); /* -W */
2486 PERL_UNUSED_VAR(ax); /* -Wall */
2488 SU_GET_CONTEXT(0, items - 1, su_context_here());
2489 MY_CXT.yield_storage.cxix = cxix;
2490 MY_CXT.yield_storage.items = items;
2491 MY_CXT.yield_storage.savesp = PL_stack_sp;
2493 MY_CXT.yield_storage.items--;
2494 MY_CXT.yield_storage.savesp--;
2496 /* See XS_Scope__Upper_unwind */
2497 if (GIMME_V == G_SCALAR)
2498 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2499 SAVEDESTRUCTOR_X(su_yield, su_yield_name);
2503 static const char su_leave_name[] = "leave";
2505 XS(XS_Scope__Upper_leave) {
2513 PERL_UNUSED_VAR(cv); /* -W */
2514 PERL_UNUSED_VAR(ax); /* -Wall */
2516 MY_CXT.yield_storage.cxix = su_context_here();
2517 MY_CXT.yield_storage.items = items;
2518 MY_CXT.yield_storage.savesp = PL_stack_sp;
2519 /* See XS_Scope__Upper_unwind */
2520 if (GIMME_V == G_SCALAR)
2521 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2522 SAVEDESTRUCTOR_X(su_yield, su_leave_name);
2526 MODULE = Scope::Upper PACKAGE = Scope::Upper
2532 su_global_setup(file);
2542 su_uid_storage new_cxt;
2549 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
2553 MY_CXT.uplevel_storage.top = NULL;
2554 MY_CXT.uplevel_storage.root = NULL;
2555 MY_CXT.uplevel_storage.count = 0;
2556 MY_CXT.uid_storage = new_cxt;
2560 #endif /* SU_THREADSAFE */
2568 cxix = su_context_here();
2579 SU_GET_CONTEXT(0, 0, su_context_here());
2582 cxix = su_context_skip_db(cxix);
2583 cxix = su_context_normalize_up(cxix);
2585 warn(su_stack_smash);
2597 SU_GET_CONTEXT(0, 0, cxstack_ix);
2599 for (; cxix >= 0; --cxix) {
2600 PERL_CONTEXT *cx = cxstack + cxix;
2601 switch (CxTYPE(cx)) {
2605 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2611 warn(su_no_such_target, "subroutine");
2620 SU_GET_CONTEXT(0, 0, cxstack_ix);
2622 for (; cxix >= 0; --cxix) {
2623 PERL_CONTEXT *cx = cxstack + cxix;
2624 switch (CxTYPE(cx)) {
2632 warn(su_no_such_target, "eval");
2642 cxix = su_context_here();
2643 while (--level >= 0) {
2645 warn(su_stack_smash);
2649 cxix = su_context_skip_db(cxix);
2650 cxix = su_context_normalize_up(cxix);
2663 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2664 PERL_CONTEXT *cx = cxstack + cxix;
2665 switch (CxTYPE(cx)) {
2667 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2678 warn(su_stack_smash);
2689 SU_GET_CONTEXT(0, 0, cxstack_ix);
2692 PERL_CONTEXT *cx = cxstack + cxix--;
2693 switch (CxTYPE(cx)) {
2695 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2699 I32 gimme = cx->blk_gimme;
2701 case G_VOID: XSRETURN_UNDEF; break;
2702 case G_SCALAR: XSRETURN_NO; break;
2703 case G_ARRAY: XSRETURN_YES; break;
2716 const PERL_CONTEXT *cx, *dbcx;
2719 SU_GET_CONTEXT(0, 0, su_context_skip_db(cxstack_ix));
2720 cxix = su_context_normalize_up(cxix);
2721 cx = cxstack + cxix;
2723 if (PL_DBsub && cxix && (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)) {
2724 I32 i = su_context_skip_db(cxix - 1) + 1;
2725 if (i < cxix && CxTYPE(cxstack + i) == CXt_SUB)
2728 cop = cx->blk_oldcop;
2729 EXTEND(SP, SU_INFO_COUNT);
2732 HV *stash = CopSTASH(cop);
2734 PUSHs(su_newmortal_pvn(HvNAME(stash), HvNAMELEN(stash)));
2736 PUSHs(&PL_sv_undef);
2739 PUSHs(su_newmortal_pvn(OutCopFILE(cop), OutCopFILE_len(cop)));
2741 mPUSHi(CopLINE(cop));
2742 /* subroutine (3) and has_args (4) */
2743 switch (CxTYPE(cx)) {
2746 GV *cvgv = CvGV(dbcx->blk_sub.cv);
2747 if (cvgv && isGV(cvgv)) {
2748 SV *sv = sv_newmortal();
2749 gv_efullname3(sv, cvgv, NULL);
2752 PUSHs(su_newmortal_pvs("(unknown)"));
2761 PUSHs(su_newmortal_pvs("(eval)"));
2765 PUSHs(&PL_sv_undef);
2766 PUSHs(&PL_sv_undef);
2769 switch (su_context_gimme(cxix)) {
2776 default: /* G_VOID */
2777 PUSHs(&PL_sv_undef);
2780 /* eval text (6) and is_require (7) */
2781 switch (CxTYPE(cx)) {
2783 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
2785 #if SU_HAS_PERL(5, 17, 4)
2786 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
2787 SvCUR(cx->blk_eval.cur_text)-2,
2788 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
2790 PUSHs(cx->blk_eval.cur_text);
2794 } else if (cx->blk_eval.old_namesv) {
2796 PUSHs(sv_mortalcopy(cx->blk_eval.old_namesv));
2802 /* Anything else including eval BLOCK */
2803 PUSHs(&PL_sv_undef);
2804 PUSHs(&PL_sv_undef);
2808 mPUSHi(CopHINTS_get(cop));
2812 #if SU_HAS_PERL(5, 9, 4)
2813 STRLEN *old_warnings = cop->cop_warnings;
2815 SV *old_warnings = cop->cop_warnings;
2817 if (old_warnings == pWARN_STD) {
2818 if (PL_dowarn & G_WARN_ON)
2819 goto context_info_warnings_on;
2821 #if SU_HAS_PERL(5, 17, 4)
2822 mask = &PL_sv_undef;
2824 goto context_info_warnings_off;
2826 } else if (old_warnings == pWARN_NONE) {
2827 #if !SU_HAS_PERL(5, 17, 4)
2828 context_info_warnings_off:
2830 mask = su_newmortal_pvn(WARN_NONEstring, WARNsize);
2831 } else if (old_warnings == pWARN_ALL) {
2833 context_info_warnings_on:
2834 #if SU_HAS_PERL(5, 8, 7)
2835 bits = get_hv("warnings::Bits", 0);
2837 SV **bits_all = hv_fetchs(bits, "all", FALSE);
2839 mask = sv_mortalcopy(*bits_all);
2843 mask = su_newmortal_pvn(WARN_ALLstring, WARNsize);
2845 #if SU_HAS_PERL(5, 9, 4)
2846 mask = su_newmortal_pvn((char *) (old_warnings + 1), old_warnings[0]);
2848 mask = sv_mortalcopy(old_warnings);
2853 #if SU_HAS_PERL(5, 10, 0)
2854 /* hints hash (10) */
2856 COPHH *hints_hash = CopHINTHASH_get(cop);
2858 SV *rhv = sv_2mortal(newRV_noinc((SV *) cophh_2hv(hints_hash, 0)));
2861 PUSHs(&PL_sv_undef);
2865 XSRETURN(SU_INFO_COUNT);
2874 SU_GET_CONTEXT(1, 1, su_context_skip_db(cxstack_ix));
2875 cxix = su_context_normalize_down(cxix);
2876 Newx(ud, 1, su_ud_reap);
2877 SU_UD_TYPE(ud) = SU_UD_TYPE_REAP;
2878 ud->cb = (SvROK(hook) && SvTYPE(SvRV(hook)) >= SVt_PVCV)
2879 ? SvRV(hook) : hook;
2880 SvREFCNT_inc_simple_void(ud->cb);
2881 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2884 localize(SV *sv, SV *val, ...)
2891 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2892 cxix = su_context_normalize_down(cxix);
2893 Newx(ud, 1, su_ud_localize);
2894 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2895 size = su_ud_localize_init(ud, sv, val, NULL);
2896 su_init(ud, cxix, size);
2899 localize_elem(SV *sv, SV *elem, SV *val, ...)
2906 if (SvTYPE(sv) >= SVt_PVGV)
2907 croak("Can't infer the element localization type from a glob and the value");
2908 SU_GET_CONTEXT(3, 3, su_context_skip_db(cxstack_ix));
2909 cxix = su_context_normalize_down(cxix);
2910 Newx(ud, 1, su_ud_localize);
2911 /* Initialize SU_UD_ORIGIN(ud) in case SU_UD_LOCALIZE_FREE(ud) needs it */
2912 SU_UD_ORIGIN(ud) = NULL;
2913 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2914 size = su_ud_localize_init(ud, sv, val, elem);
2915 if (SU_UD_PRIVATE(ud) != SVt_PVAV && SU_UD_PRIVATE(ud) != SVt_PVHV) {
2916 SU_UD_LOCALIZE_FREE(ud);
2917 croak("Can't localize an element of something that isn't an array or a hash");
2919 su_init(ud, cxix, size);
2922 localize_delete(SV *sv, SV *elem, ...)
2929 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2930 cxix = su_context_normalize_down(cxix);
2931 Newx(ud, 1, su_ud_localize);
2932 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2933 size = su_ud_localize_init(ud, sv, NULL, elem);
2934 su_init(ud, cxix, size);
2937 uplevel(SV *code, ...)
2940 I32 cxix, ret, args = 0;
2944 if (SvTYPE(code) < SVt_PVCV)
2945 croak("First argument to uplevel must be a code reference");
2946 SU_GET_CONTEXT(1, items - 1, cxstack_ix);
2948 PERL_CONTEXT *cx = cxstack + cxix;
2949 switch (CxTYPE(cx)) {
2951 croak("Can't uplevel to an eval frame");
2953 croak("Can't uplevel to a format frame");
2955 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2961 /* su_uplevel() takes care of extending the stack if needed. */
2962 ret = su_uplevel((CV *) code, cxix, args);
2967 } while (--cxix >= 0);
2968 croak("Can't uplevel outside a subroutine");
2977 SU_GET_CONTEXT(0, 0, su_context_here());
2978 uid = su_uid_get(cxix);
2984 validate_uid(SV *uid)
2989 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;