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 su_newmortal_pvn(S, L) newSVpvn_flags((S), (L), SVs_TEMP)
86 # define su_newmortal_pvn(S, L) sv_2mortal(newSVpvn((S), (L)))
88 #define su_newmortal_pvs(S) su_newmortal_pvn((S), sizeof(S)-1)
91 # define SvPV_const(S, L) SvPV(S, L)
95 # define SvPVX_const(S) SvPVX(S)
98 #ifndef SvPV_nolen_const
99 # define SvPV_nolen_const(S) SvPV_nolen(S)
102 #ifndef SvREFCNT_inc_simple_void
103 # define SvREFCNT_inc_simple_void(sv) ((void) SvREFCNT_inc(sv))
107 # define mPUSHi(I) PUSHs(sv_2mortal(newSViv(I)))
111 # define GvCV_set(G, C) (GvCV(G) = (C))
115 # define CvGV_set(C, G) (CvGV(C) = (G))
119 # define CvSTASH_set(C, S) (CvSTASH(C) = (S))
123 # define CvISXSUB(C) CvXSUB(C)
127 # define PadlistARRAY(P) AvARRAY(P)
128 # define PadARRAY(P) AvARRAY(P)
132 # define CxHASARGS(C) ((C)->blk_sub.hasargs)
137 # define CxGIMME(C) ((C)->blk_gimme & G_WANT)
139 # define CxGIMME(C) ((C)->blk_gimme)
143 #ifndef CxOLD_OP_TYPE
144 # define CxOLD_OP_TYPE(C) (C)->blk_eval.old_op_type
148 # define OutCopFILE(C) CopFILE(C)
151 #ifndef OutCopFILE_len
152 # define OutCopFILE_len(C) strlen(OutCopFILE(C))
156 # define CopHINTS_get(C) ((I32) (C)->op_private & HINT_PRIVATE_MASK)
159 #ifndef CopHINTHASH_get
160 # define CopHINTHASH_get(C) (C)->cop_hints_hash
164 # define COPHH struct refcounted_he
165 # define cophh_2hv(H, F) Perl_refcounted_he_chain_2hv(aTHX_ (H))
169 # define HvNAME_get(H) HvNAME(H)
173 # define HvNAMELEN(H) strlen(HvNAME(H))
176 #ifndef gv_fetchpvn_flags
177 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
181 # define hv_fetchs(H, K, L) hv_fetch((H), (K), sizeof(K)-1, (L))
184 #ifndef OP_GIMME_REVERSE
185 STATIC U8 su_op_gimme_reverse(U8 gimme) {
188 return OPf_WANT_VOID;
190 return OPf_WANT_LIST;
195 return OPf_WANT_SCALAR;
197 #define OP_GIMME_REVERSE(G) su_op_gimme_reverse(G)
201 # define OP_SIBLING(O) ((O)->op_sibling)
204 #ifndef PERL_MAGIC_tied
205 # define PERL_MAGIC_tied 'P'
208 #ifndef PERL_MAGIC_env
209 # define PERL_MAGIC_env 'E'
212 #ifndef NEGATIVE_INDICES_VAR
213 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
216 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
217 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
219 /* --- Threads and multiplicity -------------------------------------------- */
221 #ifndef SU_MULTIPLICITY
222 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
223 # define SU_MULTIPLICITY 1
225 # define SU_MULTIPLICITY 0
228 #if SU_MULTIPLICITY && !defined(tTHX)
229 # define tTHX PerlInterpreter*
232 #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))
233 # define SU_THREADSAFE 1
234 # ifndef MY_CXT_CLONE
235 # define MY_CXT_CLONE \
237 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
238 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
239 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
242 # define SU_THREADSAFE 0
244 # define dMY_CXT dNOOP
246 # define MY_CXT su_globaldata
248 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
250 # define MY_CXT_INIT NOOP
252 # define MY_CXT_CLONE NOOP
255 /* --- Unique context ID global storage ------------------------------------ */
257 /* ... Sequence ID counter ................................................. */
264 STATIC su_uv_array su_uid_seq_counter;
268 STATIC perl_mutex su_uid_seq_counter_mutex;
270 #define SU_LOCK(M) MUTEX_LOCK(M)
271 #define SU_UNLOCK(M) MUTEX_UNLOCK(M)
273 #else /* USE_ITHREADS */
278 #endif /* !USE_ITHREADS */
280 STATIC UV su_uid_seq_next(pTHX_ UV depth) {
281 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
285 SU_LOCK(&su_uid_seq_counter_mutex);
287 seqs = su_uid_seq_counter.seqs;
289 if (depth >= su_uid_seq_counter.size) {
292 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
293 for (i = su_uid_seq_counter.size; i <= depth; ++i)
296 su_uid_seq_counter.seqs = seqs;
297 su_uid_seq_counter.size = depth + 1;
302 SU_UNLOCK(&su_uid_seq_counter_mutex);
307 /* ... UID storage ......................................................... */
314 #define SU_UID_ACTIVE 1
316 STATIC UV su_uid_depth(pTHX_ I32 cxix) {
317 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
322 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
323 depth += si->si_cxix + 1;
334 STATIC void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
335 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
336 su_uid **old_map = old_cxt->map;
339 su_uid **new_map = new_cxt->map;
340 STRLEN old_used = old_cxt->used;
341 STRLEN new_used, new_alloc;
344 new_used = max_depth < old_used ? max_depth : old_used;
345 new_cxt->used = new_used;
347 if (new_used <= new_cxt->alloc)
348 new_alloc = new_cxt->alloc;
350 new_alloc = new_used;
351 Renew(new_map, new_alloc, su_uid *);
352 for (i = new_cxt->alloc; i < new_alloc; ++i)
354 new_cxt->map = new_map;
355 new_cxt->alloc = new_alloc;
358 for (i = 0; i < new_alloc; ++i) {
359 su_uid *new_uid = new_map[i];
361 if (i < new_used) { /* => i < max_depth && i < old_used */
362 su_uid *old_uid = old_map[i];
364 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
366 Newx(new_uid, 1, su_uid);
367 new_map[i] = new_uid;
375 new_uid->flags &= ~SU_UID_ACTIVE;
382 /* --- unwind() global storage --------------------------------------------- */
392 /* --- yield() global storage ---------------------------------------------- */
402 /* --- uplevel() data tokens and global storage ---------------------------- */
404 #define SU_UPLEVEL_HIJACKS_RUNOPS SU_HAS_PERL(5, 8, 0)
409 su_uid_storage tmp_uid_storage;
410 su_uid_storage old_uid_storage;
421 PERL_SI *old_curstackinfo;
427 #if SU_UPLEVEL_HIJACKS_RUNOPS
428 runops_proc_t old_runops;
435 STATIC su_uplevel_ud *su_uplevel_ud_new(pTHX) {
436 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
440 Newx(sud, 1, su_uplevel_ud);
443 sud->tmp_uid_storage.map = NULL;
444 sud->tmp_uid_storage.used = 0;
445 sud->tmp_uid_storage.alloc = 0;
447 Newx(si, 1, PERL_SI);
448 si->si_stack = newAV();
449 AvREAL_off(si->si_stack);
450 si->si_cxstack = NULL;
458 STATIC void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
459 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
460 PERL_SI *si = sud->si;
462 Safefree(si->si_cxstack);
463 SvREFCNT_dec(si->si_stack);
466 if (sud->tmp_uid_storage.map) {
467 su_uid **map = sud->tmp_uid_storage.map;
468 STRLEN alloc = sud->tmp_uid_storage.alloc;
471 for (i = 0; i < alloc; ++i)
486 } su_uplevel_storage;
488 #ifndef SU_UPLEVEL_STORAGE_SIZE
489 # define SU_UPLEVEL_STORAGE_SIZE 4
492 /* --- Global data --------------------------------------------------------- */
494 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
497 char *stack_placeholder;
498 su_unwind_storage unwind_storage;
499 su_yield_storage yield_storage;
500 su_uplevel_storage uplevel_storage;
501 su_uid_storage uid_storage;
506 /* --- Stack manipulations ------------------------------------------------- */
508 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
510 #define SU_SAVE_DESTRUCTOR_SIZE 3
511 #define SU_SAVE_PLACEHOLDER_SIZE 3
513 #define SU_SAVE_SCALAR_SIZE 3
515 #define SU_SAVE_ARY_SIZE 3
516 #define SU_SAVE_AELEM_SIZE 4
518 # define SU_SAVE_ADELETE_SIZE 3
520 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
522 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
523 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
525 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
528 #define SU_SAVE_HASH_SIZE 3
529 #define SU_SAVE_HELEM_SIZE 4
530 #define SU_SAVE_HDELETE_SIZE 4
531 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
532 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
534 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
537 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
539 #if !SU_HAS_PERL(5, 8, 9)
540 # define SU_SAVE_GP_SIZE 6
541 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
542 # define SU_SAVE_GP_SIZE 3
543 #elif !SU_HAS_PERL(5, 13, 8)
544 # define SU_SAVE_GP_SIZE 4
546 # define SU_SAVE_GP_SIZE 3
549 #ifndef SvCANEXISTDELETE
550 # define SvCANEXISTDELETE(sv) \
552 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
553 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
554 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
555 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
560 /* ... Saving array elements ............................................... */
562 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
563 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
569 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
570 #if SU_HAS_PERL(5, 8, 1)
571 if (SvRMAGICAL(av)) {
572 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
574 SV * const * const negative_indices_glob =
575 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
576 NEGATIVE_INDICES_VAR, 16, 0);
577 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
583 idx = key + av_len(av) + 1;
597 STATIC void su_adelete(pTHX_ void *ud_) {
598 su_ud_adelete *ud = (su_ud_adelete *) ud_;
600 av_delete(ud->av, ud->idx, G_DISCARD);
601 SvREFCNT_dec(ud->av);
606 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
607 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
610 Newx(ud, 1, su_ud_adelete);
613 SvREFCNT_inc_simple_void(av);
615 SAVEDESTRUCTOR_X(su_adelete, ud);
618 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
620 #endif /* SAVEADELETE */
622 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
623 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
630 idx = su_av_key2idx(av, SvIV(key));
632 if (SvCANEXISTDELETE(av))
633 preeminent = av_exists(av, idx);
635 svp = av_fetch(av, idx, 1);
636 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
639 save_aelem(av, idx, svp);
641 SAVEADELETE(av, idx);
643 if (val) { /* local $x[$idx] = $val; */
644 SvSetMagicSV(*svp, val);
645 } else { /* local $x[$idx]; delete $x[$idx]; */
646 av_delete(av, idx, G_DISCARD);
650 /* ... Saving hash elements ................................................ */
652 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
653 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
660 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
661 preeminent = hv_exists_ent(hv, keysv, 0);
663 he = hv_fetch_ent(hv, keysv, 1, 0);
664 svp = he ? &HeVAL(he) : NULL;
665 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
667 if (HvNAME_get(hv) && isGV(*svp)) {
668 save_gp((GV *) *svp, 0);
673 save_helem(hv, keysv, svp);
676 const char * const key = SvPV_const(keysv, keylen);
677 SAVEDELETE(hv, savepvn(key, keylen),
678 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
681 if (val) { /* local $x{$keysv} = $val; */
682 SvSetMagicSV(*svp, val);
683 } else { /* local $x{$keysv}; delete $x{$keysv}; */
684 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
688 /* ... Saving code slots from a glob ....................................... */
690 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
691 # define mro_method_changed_in(G) PL_sub_generation++
699 STATIC void su_restore_gvcv(pTHX_ void *ud_) {
700 su_save_gvcv_ud *ud = ud_;
703 GvCV_set(gv, ud->old_cv);
705 mro_method_changed_in(GvSTASH(gv));
710 STATIC void su_save_gvcv(pTHX_ GV *gv) {
711 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
714 Newx(ud, 1, su_save_gvcv_ud);
716 ud->old_cv = GvCV(gv);
720 mro_method_changed_in(GvSTASH(gv));
722 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
725 /* --- Actions ------------------------------------------------------------- */
731 void (*handler)(pTHX_ void *);
734 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
735 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
736 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
737 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
739 #define SU_UD_FREE(U) STMT_START { \
740 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
744 /* ... Reap ................................................................ */
746 #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))
753 STATIC void su_call(pTHX_ void *ud_) {
754 su_ud_reap *ud = (su_ud_reap *) ud_;
757 PERL_CONTEXT saved_cx;
758 #endif /* SU_SAVE_LAST_CX */
763 PerlIO_printf(Perl_debug_log,
764 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
765 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
775 /* If the recently popped context isn't saved there, it will be overwritten by
776 * the sub scope from call_sv, although it's still needed in our caller. */
777 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
778 saved_cx = cxstack[cxix];
779 #endif /* SU_SAVE_LAST_CX */
781 call_sv(ud->cb, G_VOID);
784 cxstack[cxix] = saved_cx;
785 #endif /* SU_SAVE_LAST_CX */
792 SvREFCNT_dec(ud->cb);
796 STATIC void su_reap(pTHX_ void *ud) {
797 #define su_reap(U) su_reap(aTHX_ (U))
799 PerlIO_printf(Perl_debug_log,
800 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
801 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
804 SAVEDESTRUCTOR_X(su_call, ud);
807 /* ... Localize & localize array/hash element .............................. */
817 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
818 SvREFCNT_dec((U)->elem); \
819 SvREFCNT_dec((U)->val); \
820 SvREFCNT_dec((U)->sv); \
824 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
825 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
830 SvREFCNT_inc_simple_void(sv);
832 if (SvTYPE(sv) >= SVt_PVGV) {
833 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
835 } else { /* local *x = \$val; */
836 t = SvTYPE(SvRV(val));
839 } else if (SvROK(sv)) {
840 croak("Invalid %s reference as the localization target",
841 sv_reftype(SvRV(sv), 0));
844 const char *p = SvPV_const(sv, len), *s;
845 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
851 case '$': t = SVt_PV; break;
852 case '@': t = SVt_PVAV; break;
853 case '%': t = SVt_PVHV; break;
854 case '&': t = SVt_PVCV; break;
855 case '*': t = SVt_PVGV; break;
860 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
861 if (SvROK(val) && !sv_isobject(val)) {
862 t = SvTYPE(SvRV(val));
874 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
879 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
884 size = SU_SAVE_GP_SIZE;
888 size = SU_SAVE_GVCV_SIZE;
892 size = SU_SAVE_SCALAR_SIZE;
895 /* When deref is set, val isn't NULL */
898 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
899 ud->elem = SvREFCNT_inc(elem);
905 STATIC void su_localize(pTHX_ void *ud_) {
906 #define su_localize(U) su_localize(aTHX_ (U))
907 su_ud_localize *ud = (su_ud_localize *) ud_;
914 if (SvTYPE(sv) >= SVt_PVGV) {
918 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
921 const char *name = SvPV_const(sv, len);
922 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
929 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
930 PerlIO_printf(Perl_debug_log,
931 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
932 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
936 /* Inspired from Alias.pm */
940 su_save_aelem(GvAV(gv), elem, val);
947 su_save_helem(GvHV(gv), elem, val);
953 save_gp(gv, 1); /* hide previous entry in symtab */
959 gv = (GV *) save_scalar(gv);
964 SvSetMagicSV((SV *) gv, val);
967 SU_UD_LOCALIZE_FREE(ud);
970 /* --- Pop a context back -------------------------------------------------- */
972 #if SU_DEBUG && defined(DEBUGGING)
973 # define SU_CXNAME(C) PL_block_type[CxTYPE(C)]
975 # define SU_CXNAME(C) "XXX"
978 STATIC void su_pop(pTHX_ void *ud) {
979 #define su_pop(U) su_pop(aTHX_ (U))
980 I32 depth, base, mark, *origin;
981 depth = SU_UD_DEPTH(ud);
984 PerlIO_printf(Perl_debug_log,
986 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
987 ud, SU_CXNAME(cxstack + cxstack_ix),
988 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
991 origin = SU_UD_ORIGIN(ud);
992 mark = origin[depth];
993 base = origin[depth - 1];
995 SU_D(PerlIO_printf(Perl_debug_log,
996 "%p: original scope was %*c top=%2d base=%2d\n",
997 ud, 24, ' ', mark, base));
1000 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
1001 PL_savestack_ix = mark;
1004 PL_savestack_ix = base;
1006 SU_UD_DEPTH(ud) = --depth;
1011 if ((pad = SU_UD_PAD(ud))) {
1014 SU_D(PerlIO_printf(Perl_debug_log,
1015 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
1016 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1017 SU_SAVE_PLACEHOLDER();
1021 SU_D(PerlIO_printf(Perl_debug_log,
1022 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
1023 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1024 SAVEDESTRUCTOR_X(su_pop, ud);
1026 SU_UD_HANDLER(ud)(aTHX_ ud);
1029 SU_D(PerlIO_printf(Perl_debug_log,
1030 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
1031 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
1034 /* --- Initialize the stack and the action userdata ------------------------ */
1036 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
1037 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
1038 I32 i, depth = 1, pad, offset, *origin;
1040 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
1042 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
1045 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
1046 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
1047 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
1050 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
1052 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
1053 ud, size, pad, offset));
1055 for (i = cxstack_ix; i > cxix; --i) {
1056 PERL_CONTEXT *cx = cxstack + i;
1057 switch (CxTYPE(cx)) {
1058 #if SU_HAS_PERL(5, 11, 0)
1060 case CXt_LOOP_PLAIN:
1061 case CXt_LOOP_LAZYSV:
1062 case CXt_LOOP_LAZYIV:
1066 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
1070 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
1075 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
1077 Newx(origin, depth + 1, I32);
1078 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
1079 PL_scopestack[PL_scopestack_ix - depth] += size;
1080 for (i = depth - 1; i >= 1; --i) {
1081 I32 j = PL_scopestack_ix - i;
1082 origin[depth - i] = PL_scopestack[j];
1083 PL_scopestack[j] += offset;
1085 origin[depth] = PL_savestack_ix;
1087 SU_UD_ORIGIN(ud) = origin;
1088 SU_UD_DEPTH(ud) = depth;
1089 SU_UD_PAD(ud) = pad;
1091 /* Make sure the first destructor fires by pushing enough fake slots on the
1093 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1094 <= PL_scopestack[PL_scopestack_ix - 1]) {
1097 SU_D(PerlIO_printf(Perl_debug_log,
1098 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1099 ud, PL_scopestack_ix, PL_savestack_ix));
1100 SU_SAVE_PLACEHOLDER();
1101 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1102 <= PL_scopestack[PL_scopestack_ix - 1]);
1104 SU_D(PerlIO_printf(Perl_debug_log,
1105 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1106 ud, PL_scopestack_ix, PL_savestack_ix));
1107 SAVEDESTRUCTOR_X(su_pop, ud);
1110 for (i = 0; i <= depth; ++i) {
1111 I32 j = PL_scopestack_ix - i;
1112 PerlIO_printf(Perl_debug_log,
1113 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1114 ud, i, j, origin[depth - i],
1115 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1122 /* --- Unwind stack -------------------------------------------------------- */
1124 STATIC void su_unwind(pTHX_ void *ud_) {
1126 I32 cxix = MY_CXT.unwind_storage.cxix;
1127 I32 items = MY_CXT.unwind_storage.items;
1130 PERL_UNUSED_VAR(ud_);
1132 PL_stack_sp = MY_CXT.unwind_storage.savesp;
1133 #if SU_HAS_PERL(5, 19, 4)
1136 SV **sp = PL_stack_sp;
1137 for (i = -items + 1; i <= 0; ++i)
1139 sv_2mortal(SvREFCNT_inc(sp[i]));
1143 if (cxstack_ix > cxix)
1146 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1147 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1150 I32 gimme = GIMME_V;
1151 PerlIO_printf(Perl_debug_log,
1152 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1154 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1155 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1158 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1159 PL_op = PL_op->op_ppaddr(aTHX);
1161 *PL_markstack_ptr = mark;
1163 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1164 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1167 /* --- Yield --------------------------------------------------------------- */
1169 #if SU_HAS_PERL(5, 10, 0)
1170 # define SU_RETOP_SUB(C) ((C)->blk_sub.retop)
1171 # define SU_RETOP_EVAL(C) ((C)->blk_eval.retop)
1172 # define SU_RETOP_LOOP(C) ((C)->blk_loop.my_op->op_lastop->op_next)
1173 # define SU_RETOP_GIVEN(C) ((C)->blk_givwhen.leave_op->op_next)
1175 # define SU_RETOP_SUB(C) ((C)->blk_oldretsp > 0 ? PL_retstack[(C)->blk_oldretsp - 1] : NULL)
1176 # define SU_RETOP_EVAL(C) SU_RETOP_SUB(C)
1177 # define SU_RETOP_LOOP(C) ((C)->blk_loop.last_op->op_next)
1180 STATIC void su_yield(pTHX_ void *ud_) {
1183 const char *which = ud_;
1184 I32 cxix = MY_CXT.yield_storage.cxix;
1185 I32 items = MY_CXT.yield_storage.items;
1186 opcode type = OP_NULL;
1190 PERL_UNUSED_VAR(ud_);
1192 cx = cxstack + cxix;
1193 switch (CxTYPE(cx)) {
1195 I32 i, cur = cxstack_ix, n = 1;
1197 /* Is this actually a given/when block? This may occur only when yield was
1198 * called with HERE (or nothing) as the context. */
1199 #if SU_HAS_PERL(5, 10, 0)
1201 PERL_CONTEXT *prev = cx - 1;
1202 U8 type = CxTYPE(prev);
1203 if ((type == CXt_GIVEN || type == CXt_WHEN)
1204 && (prev->blk_oldcop == cx->blk_oldcop)) {
1207 if (type == CXt_GIVEN)
1216 /* Bare blocks (that appear as do { ... } blocks, map { ... } blocks or
1217 * constant folded blcoks) don't need to save the op to return to anywhere
1218 * since 'last' isn't supposed to work inside them. So we climb higher in
1219 * the context stack until we reach a context that has a return op (i.e. a
1220 * sub, an eval, a format or a real loop), recording how many blocks we
1221 * crossed. Then we follow the op_next chain until we get to the leave op
1222 * that closes the original block, which we are assured to reach since
1223 * everything is static (the blocks we have crossed cannot be evals or
1224 * subroutine calls). */
1225 for (i = cxix + 1; i <= cur; ++i) {
1226 PERL_CONTEXT *cx2 = cxstack + i;
1227 switch (CxTYPE(cx2)) {
1233 o = SU_RETOP_SUB(cx2);
1236 o = SU_RETOP_EVAL(cx2);
1238 #if SU_HAS_PERL(5, 11, 0)
1240 case CXt_LOOP_PLAIN:
1241 case CXt_LOOP_LAZYSV:
1242 case CXt_LOOP_LAZYIV:
1246 o = SU_RETOP_LOOP(cx2);
1255 /* We may find other enter/leave blocks on our way to the matching leave.
1256 * Make sure the depth is incremented/decremented appropriately. */
1257 if (o->op_type == OP_ENTER) {
1259 } else if (o->op_type == OP_LEAVE) {
1273 next = SU_RETOP_SUB(cx);
1276 type = CxTRYBLOCK(cx) ? OP_LEAVETRY : OP_LEAVEEVAL;
1277 next = SU_RETOP_EVAL(cx);
1279 #if SU_HAS_PERL(5, 11, 0)
1281 case CXt_LOOP_PLAIN:
1282 case CXt_LOOP_LAZYSV:
1283 case CXt_LOOP_LAZYIV:
1287 type = OP_LEAVELOOP;
1288 next = SU_RETOP_LOOP(cx);
1290 #if SU_HAS_PERL(5, 10, 0)
1293 type = OP_LEAVEGIVEN;
1294 next = SU_RETOP_GIVEN(cx);
1298 #if SU_HAS_PERL(5, 15, 1)
1299 type = OP_LEAVEWHEN;
1302 flags |= OPf_SPECIAL;
1308 croak("%s() can't target a substitution context", which);
1311 croak("%s() doesn't know how to leave a %s context",
1312 which, SU_CXNAME(cxstack + cxix));
1316 PL_stack_sp = MY_CXT.yield_storage.savesp;
1317 #if SU_HAS_PERL(5, 19, 4)
1320 SV **sp = PL_stack_sp;
1321 for (i = -items + 1; i <= 0; ++i)
1323 sv_2mortal(SvREFCNT_inc(sp[i]));
1327 if (cxstack_ix > cxix)
1330 /* Copy the arguments passed to yield() where the leave op expects to find
1333 Move(PL_stack_sp - items + 1, PL_stack_base + cx->blk_oldsp + 1, items, SV *);
1334 PL_stack_sp = PL_stack_base + cx->blk_oldsp + items;
1336 flags |= OP_GIMME_REVERSE(cx->blk_gimme);
1338 MY_CXT.yield_storage.leave_op.op_type = type;
1339 MY_CXT.yield_storage.leave_op.op_ppaddr = PL_ppaddr[type];
1340 MY_CXT.yield_storage.leave_op.op_flags = flags;
1341 MY_CXT.yield_storage.leave_op.op_next = next;
1343 PL_op = (OP *) &(MY_CXT.yield_storage.leave_op);
1344 PL_op = PL_op->op_ppaddr(aTHX);
1346 MY_CXT.yield_storage.proxy_op.op_next = PL_op;
1347 PL_op = &(MY_CXT.yield_storage.proxy_op);
1350 /* --- Uplevel ------------------------------------------------------------- */
1352 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1353 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1355 STATIC su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1356 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1361 sud = MY_CXT.uplevel_storage.root;
1363 MY_CXT.uplevel_storage.root = sud->next;
1364 MY_CXT.uplevel_storage.count--;
1366 sud = su_uplevel_ud_new();
1369 sud->next = MY_CXT.uplevel_storage.top;
1370 MY_CXT.uplevel_storage.top = sud;
1372 depth = su_uid_depth(cxix);
1373 su_uid_storage_dup(&sud->tmp_uid_storage, &MY_CXT.uid_storage, depth);
1374 sud->old_uid_storage = MY_CXT.uid_storage;
1375 MY_CXT.uid_storage = sud->tmp_uid_storage;
1380 STATIC void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1381 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1384 sud->tmp_uid_storage = MY_CXT.uid_storage;
1385 MY_CXT.uid_storage = sud->old_uid_storage;
1389 map = sud->tmp_uid_storage.map;
1390 alloc = sud->tmp_uid_storage.alloc;
1391 for (i = 0; i < alloc; ++i) {
1393 map[i]->flags &= SU_UID_ACTIVE;
1396 MY_CXT.uplevel_storage.top = sud->next;
1398 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1399 su_uplevel_ud_delete(sud);
1401 sud->next = MY_CXT.uplevel_storage.root;
1402 MY_CXT.uplevel_storage.root = sud;
1403 MY_CXT.uplevel_storage.count++;
1407 STATIC int su_uplevel_goto_static(const OP *o) {
1408 for (; o; o = OP_SIBLING(o)) {
1409 /* goto ops are unops with kids. */
1410 if (!(o->op_flags & OPf_KIDS))
1413 switch (o->op_type) {
1416 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1421 if (su_uplevel_goto_static(((const UNOP *) o)->op_first))
1430 #if SU_UPLEVEL_HIJACKS_RUNOPS
1432 STATIC int su_uplevel_goto_runops(pTHX) {
1433 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1439 if (op->op_type == OP_GOTO) {
1440 AV *argarray = NULL;
1443 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1444 const PERL_CONTEXT *cx = cxstack + cxix;
1446 switch (CxTYPE(cx)) {
1448 if (CxHASARGS(cx)) {
1449 argarray = cx->blk_sub.argarray;
1465 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1466 AV *args = GvAV(PL_defgv);
1467 I32 items = AvFILLp(args);
1469 av_extend(argarray, items);
1470 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1471 AvFILLp(argarray) = items;
1476 PL_op = op = op->op_ppaddr(aTHX);
1478 #if !SU_HAS_PERL(5, 13, 0)
1488 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1490 #define su_at_underscore(C) PadARRAY(PadlistARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1492 STATIC void su_uplevel_restore(pTHX_ void *sus_) {
1493 su_uplevel_ud *sud = sus_;
1494 PERL_SI *cur = sud->old_curstackinfo;
1495 PERL_SI *si = sud->si;
1497 #if SU_UPLEVEL_HIJACKS_RUNOPS
1498 if (PL_runops == su_uplevel_goto_runops)
1499 PL_runops = sud->old_runops;
1502 if (sud->callback) {
1503 PERL_CONTEXT *cx = cxstack + sud->cxix;
1504 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1506 /* We have to fix the pad entry for @_ in the original callback because it
1507 * may have been reified. */
1508 if (AvREAL(argarray)) {
1509 const I32 fill = AvFILLp(argarray);
1510 SvREFCNT_dec(argarray);
1512 AvREAL_off(argarray);
1513 AvREIFY_on(argarray);
1514 av_extend(argarray, fill);
1515 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1517 CLEAR_ARGARRAY(argarray);
1520 /* If the old cv member is our renamed CV, it means that this place has been
1521 * reached without a goto() happening, and the old argarray member is
1522 * actually our fake argarray. Destroy it properly in that case. */
1523 if (cx->blk_sub.cv == sud->renamed) {
1524 SvREFCNT_dec(cx->blk_sub.argarray);
1525 cx->blk_sub.argarray = argarray;
1528 CvDEPTH(sud->callback)--;
1529 SvREFCNT_dec(sud->callback);
1532 /* Free the renamed CV. We must do it ourselves so that we can force the
1533 * depth to be 0, or perl would complain about it being "still in use".
1534 * But we *know* that it cannot be so. */
1536 CvDEPTH(sud->renamed) = 0;
1537 CvPADLIST(sud->renamed) = NULL;
1538 SvREFCNT_dec(sud->renamed);
1541 CATCH_SET(sud->old_catch);
1543 SU_UPLEVEL_RESTORE(op);
1545 /* stack_grow() wants PL_curstack so restore the old stack first */
1546 if (PL_curstackinfo == si) {
1547 PL_curstack = cur->si_stack;
1548 if (sud->old_mainstack)
1549 SU_UPLEVEL_RESTORE(mainstack);
1550 SU_UPLEVEL_RESTORE(curstackinfo);
1553 CV *target = sud->target;
1556 /* When we die, the depth of the target CV is not updated because of the
1557 * stack switcheroo. So we have to look at all the frames between the
1558 * uplevel call and the catch block to count how many call frames to the
1559 * target CV were skipped. */
1560 for (i = cur->si_cxix; i > sud->cxix; i--) {
1561 register const PERL_CONTEXT *cx = cxstack + i;
1563 if (CxTYPE(cx) == CXt_SUB) {
1564 if (cx->blk_sub.cv == target)
1569 /* If we died, the replacement stack was already unwinded to the first
1570 * eval frame, and all the contexts down there were popped. We don't have
1571 * to pop manually any context of the original stack, because they must
1572 * have been in the replacement stack as well (since the second was copied
1573 * from the first). Thus we only have to make sure the original stack index
1574 * points to the context just below the first eval scope under the target
1576 for (; i >= 0; i--) {
1577 register const PERL_CONTEXT *cx = cxstack + i;
1579 switch (CxTYPE(cx)) {
1581 if (cx->blk_sub.cv == target)
1593 CvDEPTH(target) = sud->target_depth - levels;
1594 PL_curstackinfo->si_cxix = i - 1;
1596 #if !SU_HAS_PERL(5, 13, 1)
1597 /* Since $@ was maybe localized between the target frame and the uplevel
1598 * call, we forcefully flush the save stack to get rid of it and then
1599 * reset $@ to its proper value. Note that the the call to
1600 * su_uplevel_restore() must happen before the "reset $@" item of the save
1601 * stack is processed, as uplevel was called after the localization.
1602 * Andrew's changes to how $@ was handled, which were mainly integrated
1603 * between perl 5.13.0 and 5.13.1, fixed this. */
1604 if (ERRSV && SvTRUE(ERRSV)) {
1605 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1606 SV *errsv = SvREFCNT_inc(ERRSV);
1607 PL_scopestack_ix = cx->blk_oldscopesp;
1608 leave_scope(PL_scopestack[PL_scopestack_ix]);
1609 sv_setsv(ERRSV, errsv);
1610 SvREFCNT_dec(errsv);
1616 SU_UPLEVEL_RESTORE(curcop);
1618 SvREFCNT_dec(sud->target);
1620 PL_stack_base = AvARRAY(cur->si_stack);
1621 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1622 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1624 /* When an exception is thrown from the uplevel'd subroutine,
1625 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1626 * die_where() in more recent perls), which has the sad habit of keeping a
1627 * pointer to the current context frame across this call. This means that we
1628 * can't free the temporary context stack we used for the uplevel call right
1629 * now, or that pointer upwards would point to garbage. */
1630 #if SU_HAS_PERL(5, 13, 7)
1631 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1632 * public in perl 5.13.7. */
1633 su_uplevel_storage_delete(sud);
1635 /* Otherwise, we just enqueue it back in the global storage list. */
1639 sud->tmp_uid_storage = MY_CXT.uid_storage;
1640 MY_CXT.uid_storage = sud->old_uid_storage;
1642 MY_CXT.uplevel_storage.top = sud->next;
1643 sud->next = MY_CXT.uplevel_storage.root;
1644 MY_CXT.uplevel_storage.root = sud;
1645 MY_CXT.uplevel_storage.count++;
1652 STATIC CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1653 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1657 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1659 CvFLAGS(cv) = CvFLAGS(proto);
1661 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1663 CvDEPTH(cv) = CvDEPTH(proto);
1665 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1667 CvFILE(cv) = CvFILE(proto);
1671 #if SU_RELEASE && SU_HAS_PERL_EXACT(5, 21, 4)
1674 CvSTASH_set(cv, CvSTASH(proto));
1675 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1676 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1677 * (which was part of perl 5.13.7). */
1678 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1680 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1683 if (CvISXSUB(proto)) {
1684 CvXSUB(cv) = CvXSUB(proto);
1685 CvXSUBANY(cv) = CvXSUBANY(proto);
1688 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1690 CvSTART(cv) = CvSTART(proto);
1692 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1693 #ifdef CVf_WEAKOUTSIDE
1694 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1696 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1697 CvPADLIST(cv) = CvPADLIST(proto);
1698 #ifdef CvOUTSIDE_SEQ
1699 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1703 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1713 STATIC I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1714 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1716 const PERL_CONTEXT *cx = cxstack + cxix;
1718 PERL_SI *cur = PL_curstackinfo;
1724 I32 old_mark, new_mark;
1731 /* Make PL_stack_sp point just before the CV. */
1732 PL_stack_sp -= args + 1;
1733 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1736 sud = su_uplevel_storage_new(cxix);
1740 sud->callback = NULL;
1741 sud->renamed = NULL;
1742 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1746 si->si_type = cur->si_type;
1748 si->si_prev = cur->si_prev;
1750 si->si_markoff = cx->blk_oldmarksp;
1753 /* Allocate enough space for all the elements of the original stack up to the
1754 * target context, plus the forthcoming arguments. */
1755 new_mark = cx->blk_oldsp;
1756 av_extend(si->si_stack, new_mark + 1 + args + 1);
1757 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1758 AvFILLp(si->si_stack) = new_mark;
1759 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1761 /* Specialized SWITCHSTACK() */
1762 PL_stack_base = AvARRAY(si->si_stack);
1763 old_stack_sp = PL_stack_sp;
1764 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1765 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1768 /* Copy the context stack up to the context just below the target. */
1769 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1770 if (si->si_cxmax < cxix) {
1771 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1772 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1773 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1775 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1776 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1778 target = cx->blk_sub.cv;
1779 sud->target = (CV *) SvREFCNT_inc(target);
1780 sud->target_depth = CvDEPTH(target);
1782 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1783 * run-time implication, since PL_curcop will be overwritten as soon as we
1784 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1785 * make it point to the blk_oldcop for the target frame, so that caller()
1786 * reports the right file name, line number and lexical hints. */
1787 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1788 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1789 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1791 SU_UPLEVEL_SAVE(curstackinfo, si);
1792 /* If those two are equal, we need to fool POPSTACK_TO() */
1793 if (PL_mainstack == PL_curstack)
1794 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1796 sud->old_mainstack = NULL;
1797 PL_curstack = si->si_stack;
1799 renamed = su_cv_clone(callback, CvGV(target));
1800 sud->renamed = renamed;
1803 /* Both SP and old_stack_sp point just before the CV. */
1804 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1806 PUSHs((SV *) renamed);
1809 Zero(&sub_op, 1, UNOP);
1810 sub_op.op_type = OP_ENTERSUB;
1811 sub_op.op_next = NULL;
1812 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1814 sub_op.op_flags |= OPpENTERSUB_DB;
1816 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1818 #if SU_UPLEVEL_HIJACKS_RUNOPS
1819 sud->old_runops = PL_runops;
1822 sud->old_catch = CATCH_GET;
1825 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1826 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1828 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1831 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1832 CvDEPTH(callback)++;
1834 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1835 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1836 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1837 * with what we put on the stack. But we want to fake up the same arguments
1838 * as the ones in use at the context we uplevel to, so we replace the
1839 * argarray with an unreal copy of the original @_. */
1843 av_extend(av, AvMAX(cx->blk_sub.argarray));
1844 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1845 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1846 sub_cx->blk_sub.argarray = av;
1848 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1851 if (su_uplevel_goto_static(CvROOT(renamed))) {
1852 #if SU_UPLEVEL_HIJACKS_RUNOPS
1853 if (PL_runops != PL_runops_std) {
1854 if (PL_runops == PL_runops_dbg) {
1856 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1857 } else if (PL_runops != su_uplevel_goto_runops)
1858 croak("uplevel() can't execute code that calls goto with a custom runloop");
1861 PL_runops = su_uplevel_goto_runops;
1862 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1863 croak("uplevel() can't execute code that calls goto before perl 5.8");
1864 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1872 ret = PL_stack_sp - (PL_stack_base + new_mark);
1874 AV *old_stack = sud->old_curstackinfo->si_stack;
1876 if (old_mark + ret > AvMAX(old_stack)) {
1877 /* Specialized EXTEND(old_sp, ret) */
1878 av_extend(old_stack, old_mark + ret + 1);
1879 old_stack_sp = AvARRAY(old_stack) + old_mark;
1882 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1884 AvFILLp(old_stack) += ret;
1892 /* --- Unique context ID --------------------------------------------------- */
1894 STATIC su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1895 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1900 map = MY_CXT.uid_storage.map;
1901 alloc = MY_CXT.uid_storage.alloc;
1903 if (depth >= alloc) {
1906 Renew(map, depth + 1, su_uid *);
1907 for (i = alloc; i <= depth; ++i)
1910 MY_CXT.uid_storage.map = map;
1911 MY_CXT.uid_storage.alloc = depth + 1;
1917 Newx(uid, 1, su_uid);
1923 if (depth >= MY_CXT.uid_storage.used)
1924 MY_CXT.uid_storage.used = depth + 1;
1929 STATIC int su_uid_storage_check(pTHX_ UV depth, UV seq) {
1930 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
1934 if (depth >= MY_CXT.uid_storage.used)
1937 uid = MY_CXT.uid_storage.map[depth];
1939 return uid && (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
1942 STATIC void su_uid_drop(pTHX_ void *ud_) {
1945 uid->flags &= ~SU_UID_ACTIVE;
1948 STATIC void su_uid_bump(pTHX_ void *ud_) {
1949 su_ud_reap *ud = ud_;
1951 SAVEDESTRUCTOR_X(su_uid_drop, ud->cb);
1954 STATIC SV *su_uid_get(pTHX_ I32 cxix) {
1955 #define su_uid_get(I) su_uid_get(aTHX_ (I))
1960 depth = su_uid_depth(cxix);
1961 uid = su_uid_storage_fetch(depth);
1963 if (!(uid->flags & SU_UID_ACTIVE)) {
1966 uid->seq = su_uid_seq_next(depth);
1967 uid->flags |= SU_UID_ACTIVE;
1969 Newx(ud, 1, su_ud_reap);
1970 SU_UD_ORIGIN(ud) = NULL;
1971 SU_UD_HANDLER(ud) = su_uid_bump;
1972 ud->cb = (SV *) uid;
1973 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1976 uid_sv = sv_newmortal();
1977 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
1983 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
1985 #else /* grok_number */
1987 #define IS_NUMBER_IN_UV 0x1
1989 STATIC int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
1990 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
1994 /* This crude check should be good enough for a fallback implementation.
1995 * Better be too strict than too lax. */
1996 for (i = 0; i < len; ++i) {
2001 tmpsv = sv_newmortal();
2002 sv_setpvn(tmpsv, s, len);
2003 *valuep = sv_2uv(tmpsv);
2005 return IS_NUMBER_IN_UV;
2008 #endif /* !grok_number */
2010 STATIC int su_uid_validate(pTHX_ SV *uid) {
2011 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
2017 s = SvPV_const(uid, len);
2019 while (p < len && s[p] != '-')
2022 croak("UID contains only one part");
2024 type = su_grok_number(s, p, &depth);
2025 if (type != IS_NUMBER_IN_UV)
2026 croak("First UID part is not an unsigned integer");
2028 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
2030 type = su_grok_number(s + p, len - p, &seq);
2031 if (type != IS_NUMBER_IN_UV)
2032 croak("Second UID part is not an unsigned integer");
2034 return su_uid_storage_check(depth, seq);
2037 /* --- Context operations -------------------------------------------------- */
2039 /* Remove sequences of BLOCKs having DB for stash, followed by a SUB context
2040 * for the debugger callback. */
2042 STATIC I32 su_context_skip_db(pTHX_ I32 cxix) {
2043 #define su_context_skip_db(C) su_context_skip_db(aTHX_ (C))
2049 for (i = cxix; i > 0; --i) {
2050 PERL_CONTEXT *cx = cxstack + i;
2052 switch (CxTYPE(cx)) {
2053 #if SU_HAS_PERL(5, 17, 1)
2054 case CXt_LOOP_PLAIN:
2057 if (cx->blk_oldcop && CopSTASH(cx->blk_oldcop) == GvSTASH(PL_DBgv))
2061 if (cx->blk_sub.cv == GvCV(PL_DBsub)) {
2077 STATIC I32 su_context_normalize_up(pTHX_ I32 cxix) {
2078 #define su_context_normalize_up(C) su_context_normalize_up(aTHX_ (C))
2084 cx = cxstack + cxix;
2085 if (CxTYPE(cx) == CXt_BLOCK) {
2086 PERL_CONTEXT *prev = cx - 1;
2088 switch (CxTYPE(prev)) {
2089 #if SU_HAS_PERL(5, 10, 0)
2093 #if SU_HAS_PERL(5, 11, 0)
2094 /* That's the only subcategory that can cause an extra BLOCK context */
2095 case CXt_LOOP_PLAIN:
2099 if (cx->blk_oldcop == prev->blk_oldcop)
2103 if (cx->blk_oldcop && OP_SIBLING(cx->blk_oldcop)
2104 && OP_SIBLING(cx->blk_oldcop)->op_type == OP_SUBST)
2113 STATIC I32 su_context_normalize_down(pTHX_ I32 cxix) {
2114 #define su_context_normalize_down(C) su_context_normalize_down(aTHX_ (C))
2117 if (cxix >= cxstack_ix)
2120 next = cxstack + cxix + 1;
2121 if (CxTYPE(next) == CXt_BLOCK) {
2122 PERL_CONTEXT *cx = next - 1;
2124 switch (CxTYPE(cx)) {
2125 #if SU_HAS_PERL(5, 10, 0)
2129 #if SU_HAS_PERL(5, 11, 0)
2130 /* That's the only subcategory that can cause an extra BLOCK context */
2131 case CXt_LOOP_PLAIN:
2135 if (cx->blk_oldcop == next->blk_oldcop)
2139 if (next->blk_oldcop && OP_SIBLING(next->blk_oldcop)
2140 && OP_SIBLING(next->blk_oldcop)->op_type == OP_SUBST)
2149 #define su_context_here() su_context_normalize_up(su_context_skip_db(cxstack_ix))
2151 STATIC I32 su_context_gimme(pTHX_ I32 cxix) {
2152 #define su_context_gimme(C) su_context_gimme(aTHX_ (C))
2155 for (i = cxix; i >= 0; --i) {
2156 PERL_CONTEXT *cx = cxstack + i;
2158 switch (CxTYPE(cx)) {
2159 /* gimme is always G_ARRAY for loop contexts. */
2160 #if SU_HAS_PERL(5, 11, 0)
2162 case CXt_LOOP_PLAIN:
2163 case CXt_LOOP_LAZYSV:
2164 case CXt_LOOP_LAZYIV:
2169 const COP *cop = cx->blk_oldcop;
2170 if (cop && OP_SIBLING(cop)) {
2171 switch (OP_SIBLING(cop)->op_flags & OPf_WANT) {
2174 case OPf_WANT_SCALAR:
2193 /* --- Interpreter setup/teardown ------------------------------------------ */
2195 STATIC void su_teardown(pTHX_ void *param) {
2200 map = MY_CXT.uid_storage.map;
2203 for (i = 0; i < MY_CXT.uid_storage.used; ++i)
2208 cur = MY_CXT.uplevel_storage.root;
2210 su_uplevel_ud *prev;
2214 su_uplevel_ud_delete(prev);
2221 STATIC void su_setup(pTHX) {
2222 #define su_setup() su_setup(aTHX)
2225 MY_CXT.stack_placeholder = NULL;
2227 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
2228 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
2229 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
2230 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
2232 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
2233 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
2234 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
2236 Zero(&(MY_CXT.yield_storage.leave_op), 1, UNOP);
2237 MY_CXT.yield_storage.leave_op.op_type = OP_STUB;
2238 MY_CXT.yield_storage.leave_op.op_ppaddr = NULL;
2240 Zero(&(MY_CXT.yield_storage.proxy_op), 1, OP);
2241 MY_CXT.yield_storage.proxy_op.op_type = OP_STUB;
2242 MY_CXT.yield_storage.proxy_op.op_ppaddr = NULL;
2244 MY_CXT.uplevel_storage.top = NULL;
2245 MY_CXT.uplevel_storage.root = NULL;
2246 MY_CXT.uplevel_storage.count = 0;
2248 MY_CXT.uid_storage.map = NULL;
2249 MY_CXT.uid_storage.used = 0;
2250 MY_CXT.uid_storage.alloc = 0;
2252 call_atexit(su_teardown, NULL);
2257 /* --- XS ------------------------------------------------------------------ */
2259 #define SU_GET_CONTEXT(A, B, D) \
2268 else if (cxix > cxstack_ix) \
2276 #define SU_GET_LEVEL(A, B) \
2282 level = SvIV(lsv); \
2289 #if SU_HAS_PERL(5, 10, 0)
2290 # define SU_INFO_COUNT 11
2292 # define SU_INFO_COUNT 10
2295 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
2297 XS(XS_Scope__Upper_unwind) {
2306 PERL_UNUSED_VAR(cv); /* -W */
2307 PERL_UNUSED_VAR(ax); /* -Wall */
2309 SU_GET_CONTEXT(0, items - 1, cxstack_ix);
2311 PERL_CONTEXT *cx = cxstack + cxix;
2312 switch (CxTYPE(cx)) {
2314 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2318 MY_CXT.unwind_storage.cxix = cxix;
2319 MY_CXT.unwind_storage.items = items;
2320 MY_CXT.unwind_storage.savesp = PL_stack_sp;
2322 MY_CXT.unwind_storage.items--;
2323 MY_CXT.unwind_storage.savesp--;
2325 /* pp_entersub will want to sanitize the stack after returning from there
2326 * Screw that, we're insane!
2327 * dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
2328 if (GIMME_V == G_SCALAR)
2329 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2330 SAVEDESTRUCTOR_X(su_unwind, NULL);
2335 } while (--cxix >= 0);
2336 croak("Can't return outside a subroutine");
2339 STATIC const char su_yield_name[] = "yield";
2341 XS(XS_Scope__Upper_yield); /* prototype to pass -Wmissing-prototypes */
2343 XS(XS_Scope__Upper_yield) {
2352 PERL_UNUSED_VAR(cv); /* -W */
2353 PERL_UNUSED_VAR(ax); /* -Wall */
2355 SU_GET_CONTEXT(0, items - 1, su_context_here());
2356 MY_CXT.yield_storage.cxix = cxix;
2357 MY_CXT.yield_storage.items = items;
2358 MY_CXT.yield_storage.savesp = PL_stack_sp;
2360 MY_CXT.yield_storage.items--;
2361 MY_CXT.yield_storage.savesp--;
2363 /* See XS_Scope__Upper_unwind */
2364 if (GIMME_V == G_SCALAR)
2365 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2366 SAVEDESTRUCTOR_X(su_yield, su_yield_name);
2370 STATIC const char su_leave_name[] = "leave";
2372 XS(XS_Scope__Upper_leave); /* prototype to pass -Wmissing-prototypes */
2374 XS(XS_Scope__Upper_leave) {
2383 PERL_UNUSED_VAR(cv); /* -W */
2384 PERL_UNUSED_VAR(ax); /* -Wall */
2386 MY_CXT.yield_storage.cxix = su_context_here();
2387 MY_CXT.yield_storage.items = items;
2388 MY_CXT.yield_storage.savesp = PL_stack_sp;
2389 /* See XS_Scope__Upper_unwind */
2390 if (GIMME_V == G_SCALAR)
2391 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2392 SAVEDESTRUCTOR_X(su_yield, su_leave_name);
2396 MODULE = Scope::Upper PACKAGE = Scope::Upper
2404 MUTEX_INIT(&su_uid_seq_counter_mutex);
2406 su_uid_seq_counter.seqs = NULL;
2407 su_uid_seq_counter.size = 0;
2409 stash = gv_stashpv(__PACKAGE__, 1);
2410 newCONSTSUB(stash, "TOP", newSViv(0));
2411 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
2413 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
2414 newXSproto("Scope::Upper::yield", XS_Scope__Upper_yield, file, NULL);
2415 newXSproto("Scope::Upper::leave", XS_Scope__Upper_leave, file, NULL);
2426 su_uid_storage new_cxt;
2433 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
2437 MY_CXT.uplevel_storage.top = NULL;
2438 MY_CXT.uplevel_storage.root = NULL;
2439 MY_CXT.uplevel_storage.count = 0;
2440 MY_CXT.uid_storage = new_cxt;
2444 #endif /* SU_THREADSAFE */
2452 cxix = su_context_here();
2463 SU_GET_CONTEXT(0, 0, su_context_here());
2466 cxix = su_context_skip_db(cxix);
2467 cxix = su_context_normalize_up(cxix);
2479 SU_GET_CONTEXT(0, 0, cxstack_ix);
2481 for (; cxix >= 0; --cxix) {
2482 PERL_CONTEXT *cx = cxstack + cxix;
2483 switch (CxTYPE(cx)) {
2487 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2501 SU_GET_CONTEXT(0, 0, cxstack_ix);
2503 for (; cxix >= 0; --cxix) {
2504 PERL_CONTEXT *cx = cxstack + cxix;
2505 switch (CxTYPE(cx)) {
2522 cxix = su_context_here();
2523 while (--level >= 0) {
2527 cxix = su_context_skip_db(cxix);
2528 cxix = su_context_normalize_up(cxix);
2541 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2542 PERL_CONTEXT *cx = cxstack + cxix;
2543 switch (CxTYPE(cx)) {
2545 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2565 SU_GET_CONTEXT(0, 0, cxstack_ix);
2568 PERL_CONTEXT *cx = cxstack + cxix--;
2569 switch (CxTYPE(cx)) {
2571 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2575 I32 gimme = cx->blk_gimme;
2577 case G_VOID: XSRETURN_UNDEF; break;
2578 case G_SCALAR: XSRETURN_NO; break;
2579 case G_ARRAY: XSRETURN_YES; break;
2592 const PERL_CONTEXT *cx, *dbcx;
2595 SU_GET_CONTEXT(0, 0, su_context_skip_db(cxstack_ix));
2596 cxix = su_context_normalize_up(cxix);
2597 cx = cxstack + cxix;
2599 if (PL_DBsub && cxix && (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)) {
2600 I32 i = su_context_skip_db(cxix - 1) + 1;
2601 if (i < cxix && CxTYPE(cxstack + i) == CXt_SUB)
2604 cop = cx->blk_oldcop;
2605 EXTEND(SP, SU_INFO_COUNT);
2608 HV *stash = CopSTASH(cop);
2610 PUSHs(su_newmortal_pvn(HvNAME(stash), HvNAMELEN(stash)));
2612 PUSHs(&PL_sv_undef);
2615 PUSHs(su_newmortal_pvn(OutCopFILE(cop), OutCopFILE_len(cop)));
2617 mPUSHi(CopLINE(cop));
2618 /* subroutine (3) and has_args (4) */
2619 switch (CxTYPE(cx)) {
2622 GV *cvgv = CvGV(dbcx->blk_sub.cv);
2623 if (cvgv && isGV(cvgv)) {
2624 SV *sv = sv_newmortal();
2625 gv_efullname3(sv, cvgv, NULL);
2628 PUSHs(su_newmortal_pvs("(unknown)"));
2637 PUSHs(su_newmortal_pvs("(eval)"));
2641 PUSHs(&PL_sv_undef);
2642 PUSHs(&PL_sv_undef);
2645 switch (su_context_gimme(cxix)) {
2652 default: /* G_VOID */
2653 PUSHs(&PL_sv_undef);
2656 /* eval text (6) and is_require (7) */
2657 switch (CxTYPE(cx)) {
2659 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
2661 #if SU_HAS_PERL(5, 17, 4)
2662 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
2663 SvCUR(cx->blk_eval.cur_text)-2,
2664 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
2666 PUSHs(cx->blk_eval.cur_text);
2670 } else if (cx->blk_eval.old_namesv) {
2672 PUSHs(sv_mortalcopy(cx->blk_eval.old_namesv));
2678 /* Anything else including eval BLOCK */
2679 PUSHs(&PL_sv_undef);
2680 PUSHs(&PL_sv_undef);
2684 mPUSHi(CopHINTS_get(cop));
2688 #if SU_HAS_PERL(5, 9, 4)
2689 STRLEN *old_warnings = cop->cop_warnings;
2691 SV *old_warnings = cop->cop_warnings;
2693 if (old_warnings == pWARN_STD) {
2694 if (PL_dowarn & G_WARN_ON)
2695 goto context_info_warnings_on;
2697 #if SU_HAS_PERL(5, 17, 4)
2698 mask = &PL_sv_undef;
2700 goto context_info_warnings_off;
2702 } else if (old_warnings == pWARN_NONE) {
2703 context_info_warnings_off:
2704 mask = su_newmortal_pvn(WARN_NONEstring, WARNsize);
2705 } else if (old_warnings == pWARN_ALL) {
2707 context_info_warnings_on:
2708 #if SU_HAS_PERL(5, 8, 7)
2709 bits = get_hv("warnings::Bits", 0);
2711 SV **bits_all = hv_fetchs(bits, "all", FALSE);
2713 mask = sv_mortalcopy(*bits_all);
2717 mask = su_newmortal_pvn(WARN_ALLstring, WARNsize);
2719 #if SU_HAS_PERL(5, 9, 4)
2720 mask = su_newmortal_pvn((char *) (old_warnings + 1), old_warnings[0]);
2722 mask = sv_mortalcopy(old_warnings);
2727 #if SU_HAS_PERL(5, 10, 0)
2728 /* hints hash (10) */
2730 COPHH *hints_hash = CopHINTHASH_get(cop);
2732 SV *rhv = sv_2mortal(newRV_noinc((SV *) cophh_2hv(hints_hash, 0)));
2735 PUSHs(&PL_sv_undef);
2739 XSRETURN(SU_INFO_COUNT);
2748 SU_GET_CONTEXT(1, 1, su_context_skip_db(cxstack_ix));
2749 cxix = su_context_normalize_down(cxix);
2750 Newx(ud, 1, su_ud_reap);
2751 SU_UD_ORIGIN(ud) = NULL;
2752 SU_UD_HANDLER(ud) = su_reap;
2753 ud->cb = newSVsv(hook);
2754 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2757 localize(SV *sv, SV *val, ...)
2764 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2765 cxix = su_context_normalize_down(cxix);
2766 Newx(ud, 1, su_ud_localize);
2767 SU_UD_ORIGIN(ud) = NULL;
2768 SU_UD_HANDLER(ud) = su_localize;
2769 size = su_ud_localize_init(ud, sv, val, NULL);
2770 su_init(ud, cxix, size);
2773 localize_elem(SV *sv, SV *elem, SV *val, ...)
2780 if (SvTYPE(sv) >= SVt_PVGV)
2781 croak("Can't infer the element localization type from a glob and the value");
2782 SU_GET_CONTEXT(3, 3, su_context_skip_db(cxstack_ix));
2783 cxix = su_context_normalize_down(cxix);
2784 Newx(ud, 1, su_ud_localize);
2785 SU_UD_ORIGIN(ud) = NULL;
2786 SU_UD_HANDLER(ud) = su_localize;
2787 size = su_ud_localize_init(ud, sv, val, elem);
2788 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
2789 SU_UD_LOCALIZE_FREE(ud);
2790 croak("Can't localize an element of something that isn't an array or a hash");
2792 su_init(ud, cxix, size);
2795 localize_delete(SV *sv, SV *elem, ...)
2802 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2803 cxix = su_context_normalize_down(cxix);
2804 Newx(ud, 1, su_ud_localize);
2805 SU_UD_ORIGIN(ud) = NULL;
2806 SU_UD_HANDLER(ud) = su_localize;
2807 size = su_ud_localize_init(ud, sv, NULL, elem);
2808 su_init(ud, cxix, size);
2811 uplevel(SV *code, ...)
2814 I32 cxix, ret, args = 0;
2818 if (SvTYPE(code) < SVt_PVCV)
2819 croak("First argument to uplevel must be a code reference");
2820 SU_GET_CONTEXT(1, items - 1, cxstack_ix);
2822 PERL_CONTEXT *cx = cxstack + cxix;
2823 switch (CxTYPE(cx)) {
2825 croak("Can't uplevel to an eval frame");
2827 croak("Can't uplevel to a format frame");
2829 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2835 /* su_uplevel() takes care of extending the stack if needed. */
2836 ret = su_uplevel((CV *) code, cxix, args);
2841 } while (--cxix >= 0);
2842 croak("Can't uplevel outside a subroutine");
2851 SU_GET_CONTEXT(0, 0, su_context_here());
2852 uid = su_uid_get(cxix);
2858 validate_uid(SV *uid)
2863 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;