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)
200 #ifndef PERL_MAGIC_tied
201 # define PERL_MAGIC_tied 'P'
204 #ifndef PERL_MAGIC_env
205 # define PERL_MAGIC_env 'E'
208 #ifndef NEGATIVE_INDICES_VAR
209 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
212 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
213 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
215 /* --- Threads and multiplicity -------------------------------------------- */
217 #ifndef SU_MULTIPLICITY
218 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
219 # define SU_MULTIPLICITY 1
221 # define SU_MULTIPLICITY 0
224 #if SU_MULTIPLICITY && !defined(tTHX)
225 # define tTHX PerlInterpreter*
228 #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))
229 # define SU_THREADSAFE 1
230 # ifndef MY_CXT_CLONE
231 # define MY_CXT_CLONE \
233 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
234 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
235 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
238 # define SU_THREADSAFE 0
240 # define dMY_CXT dNOOP
242 # define MY_CXT su_globaldata
244 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
246 # define MY_CXT_INIT NOOP
248 # define MY_CXT_CLONE NOOP
251 /* --- Unique context ID global storage ------------------------------------ */
253 /* ... Sequence ID counter ................................................. */
260 STATIC su_uv_array su_uid_seq_counter;
264 STATIC perl_mutex su_uid_seq_counter_mutex;
266 #define SU_LOCK(M) MUTEX_LOCK(M)
267 #define SU_UNLOCK(M) MUTEX_UNLOCK(M)
269 #else /* USE_ITHREADS */
274 #endif /* !USE_ITHREADS */
276 STATIC UV su_uid_seq_next(pTHX_ UV depth) {
277 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
281 SU_LOCK(&su_uid_seq_counter_mutex);
283 seqs = su_uid_seq_counter.seqs;
285 if (depth >= su_uid_seq_counter.size) {
288 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
289 for (i = su_uid_seq_counter.size; i <= depth; ++i)
292 su_uid_seq_counter.seqs = seqs;
293 su_uid_seq_counter.size = depth + 1;
298 SU_UNLOCK(&su_uid_seq_counter_mutex);
303 /* ... UID storage ......................................................... */
310 #define SU_UID_ACTIVE 1
312 STATIC UV su_uid_depth(pTHX_ I32 cxix) {
313 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
318 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
319 depth += si->si_cxix + 1;
330 STATIC void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
331 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
332 su_uid **old_map = old_cxt->map;
335 su_uid **new_map = new_cxt->map;
336 STRLEN old_used = old_cxt->used;
337 STRLEN new_used, new_alloc;
340 new_used = max_depth < old_used ? max_depth : old_used;
341 new_cxt->used = new_used;
343 if (new_used <= new_cxt->alloc)
344 new_alloc = new_cxt->alloc;
346 new_alloc = new_used;
347 Renew(new_map, new_alloc, su_uid *);
348 for (i = new_cxt->alloc; i < new_alloc; ++i)
350 new_cxt->map = new_map;
351 new_cxt->alloc = new_alloc;
354 for (i = 0; i < new_alloc; ++i) {
355 su_uid *new_uid = new_map[i];
357 if (i < new_used) { /* => i < max_depth && i < old_used */
358 su_uid *old_uid = old_map[i];
360 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
362 Newx(new_uid, 1, su_uid);
363 new_map[i] = new_uid;
371 new_uid->flags &= ~SU_UID_ACTIVE;
378 /* --- unwind() global storage --------------------------------------------- */
388 /* --- yield() global storage ---------------------------------------------- */
398 /* --- uplevel() data tokens and global storage ---------------------------- */
400 #define SU_UPLEVEL_HIJACKS_RUNOPS SU_HAS_PERL(5, 8, 0)
405 su_uid_storage tmp_uid_storage;
406 su_uid_storage old_uid_storage;
417 PERL_SI *old_curstackinfo;
423 #if SU_UPLEVEL_HIJACKS_RUNOPS
424 runops_proc_t old_runops;
431 STATIC su_uplevel_ud *su_uplevel_ud_new(pTHX) {
432 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
436 Newx(sud, 1, su_uplevel_ud);
439 sud->tmp_uid_storage.map = NULL;
440 sud->tmp_uid_storage.used = 0;
441 sud->tmp_uid_storage.alloc = 0;
443 Newx(si, 1, PERL_SI);
444 si->si_stack = newAV();
445 AvREAL_off(si->si_stack);
446 si->si_cxstack = NULL;
454 STATIC void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
455 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
456 PERL_SI *si = sud->si;
458 Safefree(si->si_cxstack);
459 SvREFCNT_dec(si->si_stack);
462 if (sud->tmp_uid_storage.map) {
463 su_uid **map = sud->tmp_uid_storage.map;
464 STRLEN alloc = sud->tmp_uid_storage.alloc;
467 for (i = 0; i < alloc; ++i)
482 } su_uplevel_storage;
484 #ifndef SU_UPLEVEL_STORAGE_SIZE
485 # define SU_UPLEVEL_STORAGE_SIZE 4
488 /* --- Global data --------------------------------------------------------- */
490 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
493 char *stack_placeholder;
494 su_unwind_storage unwind_storage;
495 su_yield_storage yield_storage;
496 su_uplevel_storage uplevel_storage;
497 su_uid_storage uid_storage;
502 /* --- Stack manipulations ------------------------------------------------- */
504 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
506 #define SU_SAVE_DESTRUCTOR_SIZE 3
507 #define SU_SAVE_PLACEHOLDER_SIZE 3
509 #define SU_SAVE_SCALAR_SIZE 3
511 #define SU_SAVE_ARY_SIZE 3
512 #define SU_SAVE_AELEM_SIZE 4
514 # define SU_SAVE_ADELETE_SIZE 3
516 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
518 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
519 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
521 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
524 #define SU_SAVE_HASH_SIZE 3
525 #define SU_SAVE_HELEM_SIZE 4
526 #define SU_SAVE_HDELETE_SIZE 4
527 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
528 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
530 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
533 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
535 #if !SU_HAS_PERL(5, 8, 9)
536 # define SU_SAVE_GP_SIZE 6
537 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
538 # define SU_SAVE_GP_SIZE 3
539 #elif !SU_HAS_PERL(5, 13, 8)
540 # define SU_SAVE_GP_SIZE 4
542 # define SU_SAVE_GP_SIZE 3
545 #ifndef SvCANEXISTDELETE
546 # define SvCANEXISTDELETE(sv) \
548 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
549 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
550 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
551 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
556 /* ... Saving array elements ............................................... */
558 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
559 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
565 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
566 #if SU_HAS_PERL(5, 8, 1)
567 if (SvRMAGICAL(av)) {
568 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
570 SV * const * const negative_indices_glob =
571 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
572 NEGATIVE_INDICES_VAR, 16, 0);
573 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
579 idx = key + av_len(av) + 1;
593 STATIC void su_adelete(pTHX_ void *ud_) {
594 su_ud_adelete *ud = (su_ud_adelete *) ud_;
596 av_delete(ud->av, ud->idx, G_DISCARD);
597 SvREFCNT_dec(ud->av);
602 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
603 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
606 Newx(ud, 1, su_ud_adelete);
609 SvREFCNT_inc_simple_void(av);
611 SAVEDESTRUCTOR_X(su_adelete, ud);
614 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
616 #endif /* SAVEADELETE */
618 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
619 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
626 idx = su_av_key2idx(av, SvIV(key));
628 if (SvCANEXISTDELETE(av))
629 preeminent = av_exists(av, idx);
631 svp = av_fetch(av, idx, 1);
632 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
635 save_aelem(av, idx, svp);
637 SAVEADELETE(av, idx);
639 if (val) { /* local $x[$idx] = $val; */
640 SvSetMagicSV(*svp, val);
641 } else { /* local $x[$idx]; delete $x[$idx]; */
642 av_delete(av, idx, G_DISCARD);
646 /* ... Saving hash elements ................................................ */
648 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
649 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
656 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
657 preeminent = hv_exists_ent(hv, keysv, 0);
659 he = hv_fetch_ent(hv, keysv, 1, 0);
660 svp = he ? &HeVAL(he) : NULL;
661 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
663 if (HvNAME_get(hv) && isGV(*svp)) {
664 save_gp((GV *) *svp, 0);
669 save_helem(hv, keysv, svp);
672 const char * const key = SvPV_const(keysv, keylen);
673 SAVEDELETE(hv, savepvn(key, keylen),
674 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
677 if (val) { /* local $x{$keysv} = $val; */
678 SvSetMagicSV(*svp, val);
679 } else { /* local $x{$keysv}; delete $x{$keysv}; */
680 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
684 /* ... Saving code slots from a glob ....................................... */
686 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
687 # define mro_method_changed_in(G) PL_sub_generation++
695 STATIC void su_restore_gvcv(pTHX_ void *ud_) {
696 su_save_gvcv_ud *ud = ud_;
699 GvCV_set(gv, ud->old_cv);
701 mro_method_changed_in(GvSTASH(gv));
706 STATIC void su_save_gvcv(pTHX_ GV *gv) {
707 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
710 Newx(ud, 1, su_save_gvcv_ud);
712 ud->old_cv = GvCV(gv);
716 mro_method_changed_in(GvSTASH(gv));
718 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
721 /* --- Actions ------------------------------------------------------------- */
727 void (*handler)(pTHX_ void *);
730 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
731 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
732 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
733 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
735 #define SU_UD_FREE(U) STMT_START { \
736 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
740 /* ... Reap ................................................................ */
742 #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))
749 STATIC void su_call(pTHX_ void *ud_) {
750 su_ud_reap *ud = (su_ud_reap *) ud_;
753 PERL_CONTEXT saved_cx;
754 #endif /* SU_SAVE_LAST_CX */
759 PerlIO_printf(Perl_debug_log,
760 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
761 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
771 /* If the recently popped context isn't saved there, it will be overwritten by
772 * the sub scope from call_sv, although it's still needed in our caller. */
773 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
774 saved_cx = cxstack[cxix];
775 #endif /* SU_SAVE_LAST_CX */
777 call_sv(ud->cb, G_VOID);
780 cxstack[cxix] = saved_cx;
781 #endif /* SU_SAVE_LAST_CX */
788 SvREFCNT_dec(ud->cb);
792 STATIC void su_reap(pTHX_ void *ud) {
793 #define su_reap(U) su_reap(aTHX_ (U))
795 PerlIO_printf(Perl_debug_log,
796 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
797 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
800 SAVEDESTRUCTOR_X(su_call, ud);
803 /* ... Localize & localize array/hash element .............................. */
813 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
814 SvREFCNT_dec((U)->elem); \
815 SvREFCNT_dec((U)->val); \
816 SvREFCNT_dec((U)->sv); \
820 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
821 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
826 SvREFCNT_inc_simple_void(sv);
828 if (SvTYPE(sv) >= SVt_PVGV) {
829 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
831 } else { /* local *x = \$val; */
832 t = SvTYPE(SvRV(val));
835 } else if (SvROK(sv)) {
836 croak("Invalid %s reference as the localization target",
837 sv_reftype(SvRV(sv), 0));
840 const char *p = SvPV_const(sv, len), *s;
841 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
847 case '$': t = SVt_PV; break;
848 case '@': t = SVt_PVAV; break;
849 case '%': t = SVt_PVHV; break;
850 case '&': t = SVt_PVCV; break;
851 case '*': t = SVt_PVGV; break;
856 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
857 if (SvROK(val) && !sv_isobject(val)) {
858 t = SvTYPE(SvRV(val));
870 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
875 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
880 size = SU_SAVE_GP_SIZE;
884 size = SU_SAVE_GVCV_SIZE;
888 size = SU_SAVE_SCALAR_SIZE;
891 /* When deref is set, val isn't NULL */
894 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
895 ud->elem = SvREFCNT_inc(elem);
901 STATIC void su_localize(pTHX_ void *ud_) {
902 #define su_localize(U) su_localize(aTHX_ (U))
903 su_ud_localize *ud = (su_ud_localize *) ud_;
910 if (SvTYPE(sv) >= SVt_PVGV) {
914 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
917 const char *name = SvPV_const(sv, len);
918 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
925 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
926 PerlIO_printf(Perl_debug_log,
927 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
928 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
932 /* Inspired from Alias.pm */
936 su_save_aelem(GvAV(gv), elem, val);
943 su_save_helem(GvHV(gv), elem, val);
949 save_gp(gv, 1); /* hide previous entry in symtab */
955 gv = (GV *) save_scalar(gv);
960 SvSetMagicSV((SV *) gv, val);
963 SU_UD_LOCALIZE_FREE(ud);
966 /* --- Pop a context back -------------------------------------------------- */
968 #if SU_DEBUG && defined(DEBUGGING)
969 # define SU_CXNAME(C) PL_block_type[CxTYPE(C)]
971 # define SU_CXNAME(C) "XXX"
974 STATIC void su_pop(pTHX_ void *ud) {
975 #define su_pop(U) su_pop(aTHX_ (U))
976 I32 depth, base, mark, *origin;
977 depth = SU_UD_DEPTH(ud);
980 PerlIO_printf(Perl_debug_log,
982 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
983 ud, SU_CXNAME(cxstack + cxstack_ix),
984 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
987 origin = SU_UD_ORIGIN(ud);
988 mark = origin[depth];
989 base = origin[depth - 1];
991 SU_D(PerlIO_printf(Perl_debug_log,
992 "%p: original scope was %*c top=%2d base=%2d\n",
993 ud, 24, ' ', mark, base));
996 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
997 PL_savestack_ix = mark;
1000 PL_savestack_ix = base;
1002 SU_UD_DEPTH(ud) = --depth;
1007 if ((pad = SU_UD_PAD(ud))) {
1010 SU_D(PerlIO_printf(Perl_debug_log,
1011 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
1012 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1013 SU_SAVE_PLACEHOLDER();
1017 SU_D(PerlIO_printf(Perl_debug_log,
1018 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
1019 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1020 SAVEDESTRUCTOR_X(su_pop, ud);
1022 SU_UD_HANDLER(ud)(aTHX_ ud);
1025 SU_D(PerlIO_printf(Perl_debug_log,
1026 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
1027 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
1030 /* --- Initialize the stack and the action userdata ------------------------ */
1032 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
1033 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
1034 I32 i, depth = 1, pad, offset, *origin;
1036 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
1038 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
1041 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
1042 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
1043 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
1046 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
1048 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
1049 ud, size, pad, offset));
1051 for (i = cxstack_ix; i > cxix; --i) {
1052 PERL_CONTEXT *cx = cxstack + i;
1053 switch (CxTYPE(cx)) {
1054 #if SU_HAS_PERL(5, 11, 0)
1056 case CXt_LOOP_PLAIN:
1057 case CXt_LOOP_LAZYSV:
1058 case CXt_LOOP_LAZYIV:
1062 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
1066 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
1071 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
1073 Newx(origin, depth + 1, I32);
1074 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
1075 PL_scopestack[PL_scopestack_ix - depth] += size;
1076 for (i = depth - 1; i >= 1; --i) {
1077 I32 j = PL_scopestack_ix - i;
1078 origin[depth - i] = PL_scopestack[j];
1079 PL_scopestack[j] += offset;
1081 origin[depth] = PL_savestack_ix;
1083 SU_UD_ORIGIN(ud) = origin;
1084 SU_UD_DEPTH(ud) = depth;
1085 SU_UD_PAD(ud) = pad;
1087 /* Make sure the first destructor fires by pushing enough fake slots on the
1089 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1090 <= PL_scopestack[PL_scopestack_ix - 1]) {
1093 SU_D(PerlIO_printf(Perl_debug_log,
1094 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1095 ud, PL_scopestack_ix, PL_savestack_ix));
1096 SU_SAVE_PLACEHOLDER();
1097 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1098 <= PL_scopestack[PL_scopestack_ix - 1]);
1100 SU_D(PerlIO_printf(Perl_debug_log,
1101 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1102 ud, PL_scopestack_ix, PL_savestack_ix));
1103 SAVEDESTRUCTOR_X(su_pop, ud);
1106 for (i = 0; i <= depth; ++i) {
1107 I32 j = PL_scopestack_ix - i;
1108 PerlIO_printf(Perl_debug_log,
1109 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1110 ud, i, j, origin[depth - i],
1111 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1118 /* --- Unwind stack -------------------------------------------------------- */
1120 STATIC void su_unwind(pTHX_ void *ud_) {
1122 I32 cxix = MY_CXT.unwind_storage.cxix;
1123 I32 items = MY_CXT.unwind_storage.items;
1126 PERL_UNUSED_VAR(ud_);
1128 PL_stack_sp = MY_CXT.unwind_storage.savesp;
1129 #if SU_HAS_PERL(5, 19, 4)
1132 SV **sp = PL_stack_sp;
1133 for (i = -items + 1; i <= 0; ++i)
1135 sv_2mortal(SvREFCNT_inc(sp[i]));
1139 if (cxstack_ix > cxix)
1142 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1143 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1146 I32 gimme = GIMME_V;
1147 PerlIO_printf(Perl_debug_log,
1148 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1150 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1151 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1154 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1155 PL_op = PL_op->op_ppaddr(aTHX);
1157 *PL_markstack_ptr = mark;
1159 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1160 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1163 /* --- Yield --------------------------------------------------------------- */
1165 #if SU_HAS_PERL(5, 10, 0)
1166 # define SU_RETOP_SUB(C) ((C)->blk_sub.retop)
1167 # define SU_RETOP_EVAL(C) ((C)->blk_eval.retop)
1168 # define SU_RETOP_LOOP(C) ((C)->blk_loop.my_op->op_lastop->op_next)
1169 # define SU_RETOP_GIVEN(C) ((C)->blk_givwhen.leave_op->op_next)
1171 # define SU_RETOP_SUB(C) ((C)->blk_oldretsp > 0 ? PL_retstack[(C)->blk_oldretsp - 1] : NULL)
1172 # define SU_RETOP_EVAL(C) SU_RETOP_SUB(C)
1173 # define SU_RETOP_LOOP(C) ((C)->blk_loop.last_op->op_next)
1176 STATIC void su_yield(pTHX_ void *ud_) {
1179 const char *which = ud_;
1180 I32 cxix = MY_CXT.yield_storage.cxix;
1181 I32 items = MY_CXT.yield_storage.items;
1182 opcode type = OP_NULL;
1186 PERL_UNUSED_VAR(ud_);
1188 cx = cxstack + cxix;
1189 switch (CxTYPE(cx)) {
1191 I32 i, cur = cxstack_ix, n = 1;
1193 /* Is this actually a given/when block? This may occur only when yield was
1194 * called with HERE (or nothing) as the context. */
1195 #if SU_HAS_PERL(5, 10, 0)
1197 PERL_CONTEXT *prev = cx - 1;
1198 U8 type = CxTYPE(prev);
1199 if ((type == CXt_GIVEN || type == CXt_WHEN)
1200 && (prev->blk_oldcop == cx->blk_oldcop)) {
1203 if (type == CXt_GIVEN)
1212 /* Bare blocks (that appear as do { ... } blocks, map { ... } blocks or
1213 * constant folded blcoks) don't need to save the op to return to anywhere
1214 * since 'last' isn't supposed to work inside them. So we climb higher in
1215 * the context stack until we reach a context that has a return op (i.e. a
1216 * sub, an eval, a format or a real loop), recording how many blocks we
1217 * crossed. Then we follow the op_next chain until we get to the leave op
1218 * that closes the original block, which we are assured to reach since
1219 * everything is static (the blocks we have crossed cannot be evals or
1220 * subroutine calls). */
1221 for (i = cxix + 1; i <= cur; ++i) {
1222 PERL_CONTEXT *cx2 = cxstack + i;
1223 switch (CxTYPE(cx2)) {
1229 o = SU_RETOP_SUB(cx2);
1232 o = SU_RETOP_EVAL(cx2);
1234 #if SU_HAS_PERL(5, 11, 0)
1236 case CXt_LOOP_PLAIN:
1237 case CXt_LOOP_LAZYSV:
1238 case CXt_LOOP_LAZYIV:
1242 o = SU_RETOP_LOOP(cx2);
1251 /* We may find other enter/leave blocks on our way to the matching leave.
1252 * Make sure the depth is incremented/decremented appropriately. */
1253 if (o->op_type == OP_ENTER) {
1255 } else if (o->op_type == OP_LEAVE) {
1269 next = SU_RETOP_SUB(cx);
1272 type = CxTRYBLOCK(cx) ? OP_LEAVETRY : OP_LEAVEEVAL;
1273 next = SU_RETOP_EVAL(cx);
1275 #if SU_HAS_PERL(5, 11, 0)
1277 case CXt_LOOP_PLAIN:
1278 case CXt_LOOP_LAZYSV:
1279 case CXt_LOOP_LAZYIV:
1283 type = OP_LEAVELOOP;
1284 next = SU_RETOP_LOOP(cx);
1286 #if SU_HAS_PERL(5, 10, 0)
1289 type = OP_LEAVEGIVEN;
1290 next = SU_RETOP_GIVEN(cx);
1294 #if SU_HAS_PERL(5, 15, 1)
1295 type = OP_LEAVEWHEN;
1298 flags |= OPf_SPECIAL;
1304 croak("%s() can't target a substitution context", which);
1307 croak("%s() doesn't know how to leave a %s context",
1308 which, SU_CXNAME(cxstack + cxix));
1312 PL_stack_sp = MY_CXT.yield_storage.savesp;
1313 #if SU_HAS_PERL(5, 19, 4)
1316 SV **sp = PL_stack_sp;
1317 for (i = -items + 1; i <= 0; ++i)
1319 sv_2mortal(SvREFCNT_inc(sp[i]));
1323 if (cxstack_ix > cxix)
1326 /* Copy the arguments passed to yield() where the leave op expects to find
1329 Move(PL_stack_sp - items + 1, PL_stack_base + cx->blk_oldsp + 1, items, SV *);
1330 PL_stack_sp = PL_stack_base + cx->blk_oldsp + items;
1332 flags |= OP_GIMME_REVERSE(cx->blk_gimme);
1334 MY_CXT.yield_storage.leave_op.op_type = type;
1335 MY_CXT.yield_storage.leave_op.op_ppaddr = PL_ppaddr[type];
1336 MY_CXT.yield_storage.leave_op.op_flags = flags;
1337 MY_CXT.yield_storage.leave_op.op_next = next;
1339 PL_op = (OP *) &(MY_CXT.yield_storage.leave_op);
1340 PL_op = PL_op->op_ppaddr(aTHX);
1342 MY_CXT.yield_storage.proxy_op.op_next = PL_op;
1343 PL_op = &(MY_CXT.yield_storage.proxy_op);
1346 /* --- Uplevel ------------------------------------------------------------- */
1348 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1349 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1351 STATIC su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1352 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1357 sud = MY_CXT.uplevel_storage.root;
1359 MY_CXT.uplevel_storage.root = sud->next;
1360 MY_CXT.uplevel_storage.count--;
1362 sud = su_uplevel_ud_new();
1365 sud->next = MY_CXT.uplevel_storage.top;
1366 MY_CXT.uplevel_storage.top = sud;
1368 depth = su_uid_depth(cxix);
1369 su_uid_storage_dup(&sud->tmp_uid_storage, &MY_CXT.uid_storage, depth);
1370 sud->old_uid_storage = MY_CXT.uid_storage;
1371 MY_CXT.uid_storage = sud->tmp_uid_storage;
1376 STATIC void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1377 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1380 sud->tmp_uid_storage = MY_CXT.uid_storage;
1381 MY_CXT.uid_storage = sud->old_uid_storage;
1385 map = sud->tmp_uid_storage.map;
1386 alloc = sud->tmp_uid_storage.alloc;
1387 for (i = 0; i < alloc; ++i) {
1389 map[i]->flags &= SU_UID_ACTIVE;
1392 MY_CXT.uplevel_storage.top = sud->next;
1394 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1395 su_uplevel_ud_delete(sud);
1397 sud->next = MY_CXT.uplevel_storage.root;
1398 MY_CXT.uplevel_storage.root = sud;
1399 MY_CXT.uplevel_storage.count++;
1403 STATIC int su_uplevel_goto_static(const OP *o) {
1404 for (; o; o = o->op_sibling) {
1405 /* goto ops are unops with kids. */
1406 if (!(o->op_flags & OPf_KIDS))
1409 switch (o->op_type) {
1412 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1417 if (su_uplevel_goto_static(((const UNOP *) o)->op_first))
1426 #if SU_UPLEVEL_HIJACKS_RUNOPS
1428 STATIC int su_uplevel_goto_runops(pTHX) {
1429 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1435 if (op->op_type == OP_GOTO) {
1436 AV *argarray = NULL;
1439 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1440 const PERL_CONTEXT *cx = cxstack + cxix;
1442 switch (CxTYPE(cx)) {
1444 if (CxHASARGS(cx)) {
1445 argarray = cx->blk_sub.argarray;
1461 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1462 AV *args = GvAV(PL_defgv);
1463 I32 items = AvFILLp(args);
1465 av_extend(argarray, items);
1466 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1467 AvFILLp(argarray) = items;
1472 PL_op = op = op->op_ppaddr(aTHX);
1474 #if !SU_HAS_PERL(5, 13, 0)
1484 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1486 #define su_at_underscore(C) PadARRAY(PadlistARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1488 STATIC void su_uplevel_restore(pTHX_ void *sus_) {
1489 su_uplevel_ud *sud = sus_;
1490 PERL_SI *cur = sud->old_curstackinfo;
1491 PERL_SI *si = sud->si;
1493 #if SU_UPLEVEL_HIJACKS_RUNOPS
1494 if (PL_runops == su_uplevel_goto_runops)
1495 PL_runops = sud->old_runops;
1498 if (sud->callback) {
1499 PERL_CONTEXT *cx = cxstack + sud->cxix;
1500 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1502 /* We have to fix the pad entry for @_ in the original callback because it
1503 * may have been reified. */
1504 if (AvREAL(argarray)) {
1505 const I32 fill = AvFILLp(argarray);
1506 SvREFCNT_dec(argarray);
1508 AvREAL_off(argarray);
1509 AvREIFY_on(argarray);
1510 av_extend(argarray, fill);
1511 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1513 CLEAR_ARGARRAY(argarray);
1516 /* If the old cv member is our renamed CV, it means that this place has been
1517 * reached without a goto() happening, and the old argarray member is
1518 * actually our fake argarray. Destroy it properly in that case. */
1519 if (cx->blk_sub.cv == sud->renamed) {
1520 SvREFCNT_dec(cx->blk_sub.argarray);
1521 cx->blk_sub.argarray = argarray;
1524 CvDEPTH(sud->callback)--;
1525 SvREFCNT_dec(sud->callback);
1528 /* Free the renamed CV. We must do it ourselves so that we can force the
1529 * depth to be 0, or perl would complain about it being "still in use".
1530 * But we *know* that it cannot be so. */
1532 CvDEPTH(sud->renamed) = 0;
1533 CvPADLIST(sud->renamed) = NULL;
1534 SvREFCNT_dec(sud->renamed);
1537 CATCH_SET(sud->old_catch);
1539 SU_UPLEVEL_RESTORE(op);
1541 /* stack_grow() wants PL_curstack so restore the old stack first */
1542 if (PL_curstackinfo == si) {
1543 PL_curstack = cur->si_stack;
1544 if (sud->old_mainstack)
1545 SU_UPLEVEL_RESTORE(mainstack);
1546 SU_UPLEVEL_RESTORE(curstackinfo);
1549 CV *target = sud->target;
1552 /* When we die, the depth of the target CV is not updated because of the
1553 * stack switcheroo. So we have to look at all the frames between the
1554 * uplevel call and the catch block to count how many call frames to the
1555 * target CV were skipped. */
1556 for (i = cur->si_cxix; i > sud->cxix; i--) {
1557 register const PERL_CONTEXT *cx = cxstack + i;
1559 if (CxTYPE(cx) == CXt_SUB) {
1560 if (cx->blk_sub.cv == target)
1565 /* If we died, the replacement stack was already unwinded to the first
1566 * eval frame, and all the contexts down there were popped. We don't have
1567 * to pop manually any context of the original stack, because they must
1568 * have been in the replacement stack as well (since the second was copied
1569 * from the first). Thus we only have to make sure the original stack index
1570 * points to the context just below the first eval scope under the target
1572 for (; i >= 0; i--) {
1573 register const PERL_CONTEXT *cx = cxstack + i;
1575 switch (CxTYPE(cx)) {
1577 if (cx->blk_sub.cv == target)
1589 CvDEPTH(target) = sud->target_depth - levels;
1590 PL_curstackinfo->si_cxix = i - 1;
1592 #if !SU_HAS_PERL(5, 13, 1)
1593 /* Since $@ was maybe localized between the target frame and the uplevel
1594 * call, we forcefully flush the save stack to get rid of it and then
1595 * reset $@ to its proper value. Note that the the call to
1596 * su_uplevel_restore() must happen before the "reset $@" item of the save
1597 * stack is processed, as uplevel was called after the localization.
1598 * Andrew's changes to how $@ was handled, which were mainly integrated
1599 * between perl 5.13.0 and 5.13.1, fixed this. */
1600 if (ERRSV && SvTRUE(ERRSV)) {
1601 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1602 SV *errsv = SvREFCNT_inc(ERRSV);
1603 PL_scopestack_ix = cx->blk_oldscopesp;
1604 leave_scope(PL_scopestack[PL_scopestack_ix]);
1605 sv_setsv(ERRSV, errsv);
1606 SvREFCNT_dec(errsv);
1612 SU_UPLEVEL_RESTORE(curcop);
1614 SvREFCNT_dec(sud->target);
1616 PL_stack_base = AvARRAY(cur->si_stack);
1617 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1618 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1620 /* When an exception is thrown from the uplevel'd subroutine,
1621 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1622 * die_where() in more recent perls), which has the sad habit of keeping a
1623 * pointer to the current context frame across this call. This means that we
1624 * can't free the temporary context stack we used for the uplevel call right
1625 * now, or that pointer upwards would point to garbage. */
1626 #if SU_HAS_PERL(5, 13, 7)
1627 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1628 * public in perl 5.13.7. */
1629 su_uplevel_storage_delete(sud);
1631 /* Otherwise, we just enqueue it back in the global storage list. */
1635 sud->tmp_uid_storage = MY_CXT.uid_storage;
1636 MY_CXT.uid_storage = sud->old_uid_storage;
1638 MY_CXT.uplevel_storage.top = sud->next;
1639 sud->next = MY_CXT.uplevel_storage.root;
1640 MY_CXT.uplevel_storage.root = sud;
1641 MY_CXT.uplevel_storage.count++;
1648 STATIC CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1649 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1653 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1655 CvFLAGS(cv) = CvFLAGS(proto);
1657 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1659 CvDEPTH(cv) = CvDEPTH(proto);
1661 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1663 CvFILE(cv) = CvFILE(proto);
1667 CvSTASH_set(cv, CvSTASH(proto));
1668 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1669 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1670 * (which was part of perl 5.13.7). */
1671 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1673 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1676 if (CvISXSUB(proto)) {
1677 CvXSUB(cv) = CvXSUB(proto);
1678 CvXSUBANY(cv) = CvXSUBANY(proto);
1681 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1683 CvSTART(cv) = CvSTART(proto);
1685 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1686 #ifdef CVf_WEAKOUTSIDE
1687 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1689 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1690 CvPADLIST(cv) = CvPADLIST(proto);
1691 #ifdef CvOUTSIDE_SEQ
1692 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1696 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1706 STATIC I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1707 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1709 const PERL_CONTEXT *cx = cxstack + cxix;
1711 PERL_SI *cur = PL_curstackinfo;
1717 I32 old_mark, new_mark;
1724 /* Make PL_stack_sp point just before the CV. */
1725 PL_stack_sp -= args + 1;
1726 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1729 sud = su_uplevel_storage_new(cxix);
1733 sud->callback = NULL;
1734 sud->renamed = NULL;
1735 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1739 si->si_type = cur->si_type;
1741 si->si_prev = cur->si_prev;
1743 si->si_markoff = cx->blk_oldmarksp;
1746 /* Allocate enough space for all the elements of the original stack up to the
1747 * target context, plus the forthcoming arguments. */
1748 new_mark = cx->blk_oldsp;
1749 av_extend(si->si_stack, new_mark + 1 + args + 1);
1750 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1751 AvFILLp(si->si_stack) = new_mark;
1752 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1754 /* Specialized SWITCHSTACK() */
1755 PL_stack_base = AvARRAY(si->si_stack);
1756 old_stack_sp = PL_stack_sp;
1757 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1758 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1761 /* Copy the context stack up to the context just below the target. */
1762 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1763 if (si->si_cxmax < cxix) {
1764 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1765 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1766 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1768 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1769 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1771 target = cx->blk_sub.cv;
1772 sud->target = (CV *) SvREFCNT_inc(target);
1773 sud->target_depth = CvDEPTH(target);
1775 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1776 * run-time implication, since PL_curcop will be overwritten as soon as we
1777 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1778 * make it point to the blk_oldcop for the target frame, so that caller()
1779 * reports the right file name, line number and lexical hints. */
1780 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1781 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1782 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1784 SU_UPLEVEL_SAVE(curstackinfo, si);
1785 /* If those two are equal, we need to fool POPSTACK_TO() */
1786 if (PL_mainstack == PL_curstack)
1787 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1789 sud->old_mainstack = NULL;
1790 PL_curstack = si->si_stack;
1792 renamed = su_cv_clone(callback, CvGV(target));
1793 sud->renamed = renamed;
1796 /* Both SP and old_stack_sp point just before the CV. */
1797 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1799 PUSHs((SV *) renamed);
1802 Zero(&sub_op, 1, UNOP);
1803 sub_op.op_type = OP_ENTERSUB;
1804 sub_op.op_next = NULL;
1805 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1807 sub_op.op_flags |= OPpENTERSUB_DB;
1809 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1811 #if SU_UPLEVEL_HIJACKS_RUNOPS
1812 sud->old_runops = PL_runops;
1815 sud->old_catch = CATCH_GET;
1818 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1819 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1821 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1824 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1825 CvDEPTH(callback)++;
1827 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1828 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1829 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1830 * with what we put on the stack. But we want to fake up the same arguments
1831 * as the ones in use at the context we uplevel to, so we replace the
1832 * argarray with an unreal copy of the original @_. */
1836 av_extend(av, AvMAX(cx->blk_sub.argarray));
1837 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1838 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1839 sub_cx->blk_sub.argarray = av;
1841 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1844 if (su_uplevel_goto_static(CvROOT(renamed))) {
1845 #if SU_UPLEVEL_HIJACKS_RUNOPS
1846 if (PL_runops != PL_runops_std) {
1847 if (PL_runops == PL_runops_dbg) {
1849 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1850 } else if (PL_runops != su_uplevel_goto_runops)
1851 croak("uplevel() can't execute code that calls goto with a custom runloop");
1854 PL_runops = su_uplevel_goto_runops;
1855 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1856 croak("uplevel() can't execute code that calls goto before perl 5.8");
1857 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1865 ret = PL_stack_sp - (PL_stack_base + new_mark);
1867 AV *old_stack = sud->old_curstackinfo->si_stack;
1869 if (old_mark + ret > AvMAX(old_stack)) {
1870 /* Specialized EXTEND(old_sp, ret) */
1871 av_extend(old_stack, old_mark + ret + 1);
1872 old_stack_sp = AvARRAY(old_stack) + old_mark;
1875 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1877 AvFILLp(old_stack) += ret;
1885 /* --- Unique context ID --------------------------------------------------- */
1887 STATIC su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1888 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1893 map = MY_CXT.uid_storage.map;
1894 alloc = MY_CXT.uid_storage.alloc;
1896 if (depth >= alloc) {
1899 Renew(map, depth + 1, su_uid *);
1900 for (i = alloc; i <= depth; ++i)
1903 MY_CXT.uid_storage.map = map;
1904 MY_CXT.uid_storage.alloc = depth + 1;
1910 Newx(uid, 1, su_uid);
1916 if (depth >= MY_CXT.uid_storage.used)
1917 MY_CXT.uid_storage.used = depth + 1;
1922 STATIC int su_uid_storage_check(pTHX_ UV depth, UV seq) {
1923 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
1927 if (depth >= MY_CXT.uid_storage.used)
1930 uid = MY_CXT.uid_storage.map[depth];
1932 return uid && (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
1935 STATIC void su_uid_drop(pTHX_ void *ud_) {
1938 uid->flags &= ~SU_UID_ACTIVE;
1941 STATIC void su_uid_bump(pTHX_ void *ud_) {
1942 su_ud_reap *ud = ud_;
1944 SAVEDESTRUCTOR_X(su_uid_drop, ud->cb);
1947 STATIC SV *su_uid_get(pTHX_ I32 cxix) {
1948 #define su_uid_get(I) su_uid_get(aTHX_ (I))
1953 depth = su_uid_depth(cxix);
1954 uid = su_uid_storage_fetch(depth);
1956 if (!(uid->flags & SU_UID_ACTIVE)) {
1959 uid->seq = su_uid_seq_next(depth);
1960 uid->flags |= SU_UID_ACTIVE;
1962 Newx(ud, 1, su_ud_reap);
1963 SU_UD_ORIGIN(ud) = NULL;
1964 SU_UD_HANDLER(ud) = su_uid_bump;
1965 ud->cb = (SV *) uid;
1966 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1969 uid_sv = sv_newmortal();
1970 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
1976 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
1978 #else /* grok_number */
1980 #define IS_NUMBER_IN_UV 0x1
1982 STATIC int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
1983 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
1987 /* This crude check should be good enough for a fallback implementation.
1988 * Better be too strict than too lax. */
1989 for (i = 0; i < len; ++i) {
1994 tmpsv = sv_newmortal();
1995 sv_setpvn(tmpsv, s, len);
1996 *valuep = sv_2uv(tmpsv);
1998 return IS_NUMBER_IN_UV;
2001 #endif /* !grok_number */
2003 STATIC int su_uid_validate(pTHX_ SV *uid) {
2004 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
2010 s = SvPV_const(uid, len);
2012 while (p < len && s[p] != '-')
2015 croak("UID contains only one part");
2017 type = su_grok_number(s, p, &depth);
2018 if (type != IS_NUMBER_IN_UV)
2019 croak("First UID part is not an unsigned integer");
2021 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
2023 type = su_grok_number(s + p, len - p, &seq);
2024 if (type != IS_NUMBER_IN_UV)
2025 croak("Second UID part is not an unsigned integer");
2027 return su_uid_storage_check(depth, seq);
2030 /* --- Context operations -------------------------------------------------- */
2032 /* Remove sequences of BLOCKs having DB for stash, followed by a SUB context
2033 * for the debugger callback. */
2035 STATIC I32 su_context_skip_db(pTHX_ I32 cxix) {
2036 #define su_context_skip_db(C) su_context_skip_db(aTHX_ (C))
2042 for (i = cxix; i > 0; --i) {
2043 PERL_CONTEXT *cx = cxstack + i;
2045 switch (CxTYPE(cx)) {
2046 #if SU_HAS_PERL(5, 17, 1)
2047 case CXt_LOOP_PLAIN:
2050 if (cx->blk_oldcop && CopSTASH(cx->blk_oldcop) == GvSTASH(PL_DBgv))
2054 if (cx->blk_sub.cv == GvCV(PL_DBsub)) {
2070 STATIC I32 su_context_normalize_up(pTHX_ I32 cxix) {
2071 #define su_context_normalize_up(C) su_context_normalize_up(aTHX_ (C))
2077 cx = cxstack + cxix;
2078 if (CxTYPE(cx) == CXt_BLOCK) {
2079 PERL_CONTEXT *prev = cx - 1;
2081 switch (CxTYPE(prev)) {
2082 #if SU_HAS_PERL(5, 10, 0)
2086 #if SU_HAS_PERL(5, 11, 0)
2087 /* That's the only subcategory that can cause an extra BLOCK context */
2088 case CXt_LOOP_PLAIN:
2092 if (cx->blk_oldcop == prev->blk_oldcop)
2096 if (cx->blk_oldcop && cx->blk_oldcop->op_sibling
2097 && cx->blk_oldcop->op_sibling->op_type == OP_SUBST)
2106 STATIC I32 su_context_normalize_down(pTHX_ I32 cxix) {
2107 #define su_context_normalize_down(C) su_context_normalize_down(aTHX_ (C))
2110 if (cxix >= cxstack_ix)
2113 next = cxstack + cxix + 1;
2114 if (CxTYPE(next) == CXt_BLOCK) {
2115 PERL_CONTEXT *cx = next - 1;
2117 switch (CxTYPE(cx)) {
2118 #if SU_HAS_PERL(5, 10, 0)
2122 #if SU_HAS_PERL(5, 11, 0)
2123 /* That's the only subcategory that can cause an extra BLOCK context */
2124 case CXt_LOOP_PLAIN:
2128 if (cx->blk_oldcop == next->blk_oldcop)
2132 if (next->blk_oldcop && next->blk_oldcop->op_sibling
2133 && next->blk_oldcop->op_sibling->op_type == OP_SUBST)
2142 #define su_context_here() su_context_normalize_up(su_context_skip_db(cxstack_ix))
2144 STATIC I32 su_context_gimme(pTHX_ I32 cxix) {
2145 #define su_context_gimme(C) su_context_gimme(aTHX_ (C))
2148 for (i = cxix; i >= 0; --i) {
2149 PERL_CONTEXT *cx = cxstack + i;
2151 switch (CxTYPE(cx)) {
2152 /* gimme is always G_ARRAY for loop contexts. */
2153 #if SU_HAS_PERL(5, 11, 0)
2155 case CXt_LOOP_PLAIN:
2156 case CXt_LOOP_LAZYSV:
2157 case CXt_LOOP_LAZYIV:
2162 const COP *cop = cx->blk_oldcop;
2163 if (cop && cop->op_sibling) {
2164 switch (cop->op_sibling->op_flags & OPf_WANT) {
2167 case OPf_WANT_SCALAR:
2186 /* --- Interpreter setup/teardown ------------------------------------------ */
2188 STATIC void su_teardown(pTHX_ void *param) {
2193 map = MY_CXT.uid_storage.map;
2196 for (i = 0; i < MY_CXT.uid_storage.used; ++i)
2201 cur = MY_CXT.uplevel_storage.root;
2203 su_uplevel_ud *prev;
2207 su_uplevel_ud_delete(prev);
2214 STATIC void su_setup(pTHX) {
2215 #define su_setup() su_setup(aTHX)
2218 MY_CXT.stack_placeholder = NULL;
2220 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
2221 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
2222 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
2223 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
2225 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
2226 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
2227 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
2229 Zero(&(MY_CXT.yield_storage.leave_op), 1, UNOP);
2230 MY_CXT.yield_storage.leave_op.op_type = OP_STUB;
2231 MY_CXT.yield_storage.leave_op.op_ppaddr = NULL;
2233 Zero(&(MY_CXT.yield_storage.proxy_op), 1, OP);
2234 MY_CXT.yield_storage.proxy_op.op_type = OP_STUB;
2235 MY_CXT.yield_storage.proxy_op.op_ppaddr = NULL;
2237 MY_CXT.uplevel_storage.top = NULL;
2238 MY_CXT.uplevel_storage.root = NULL;
2239 MY_CXT.uplevel_storage.count = 0;
2241 MY_CXT.uid_storage.map = NULL;
2242 MY_CXT.uid_storage.used = 0;
2243 MY_CXT.uid_storage.alloc = 0;
2245 call_atexit(su_teardown, NULL);
2250 /* --- XS ------------------------------------------------------------------ */
2252 #define SU_GET_CONTEXT(A, B, D) \
2261 else if (cxix > cxstack_ix) \
2269 #define SU_GET_LEVEL(A, B) \
2275 level = SvIV(lsv); \
2282 #if SU_HAS_PERL(5, 10, 0)
2283 # define SU_INFO_COUNT 11
2285 # define SU_INFO_COUNT 10
2288 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
2290 XS(XS_Scope__Upper_unwind) {
2299 PERL_UNUSED_VAR(cv); /* -W */
2300 PERL_UNUSED_VAR(ax); /* -Wall */
2302 SU_GET_CONTEXT(0, items - 1, cxstack_ix);
2304 PERL_CONTEXT *cx = cxstack + cxix;
2305 switch (CxTYPE(cx)) {
2307 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2311 MY_CXT.unwind_storage.cxix = cxix;
2312 MY_CXT.unwind_storage.items = items;
2313 MY_CXT.unwind_storage.savesp = PL_stack_sp;
2315 MY_CXT.unwind_storage.items--;
2316 MY_CXT.unwind_storage.savesp--;
2318 /* pp_entersub will want to sanitize the stack after returning from there
2319 * Screw that, we're insane!
2320 * dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
2321 if (GIMME_V == G_SCALAR)
2322 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2323 SAVEDESTRUCTOR_X(su_unwind, NULL);
2328 } while (--cxix >= 0);
2329 croak("Can't return outside a subroutine");
2332 STATIC const char su_yield_name[] = "yield";
2334 XS(XS_Scope__Upper_yield); /* prototype to pass -Wmissing-prototypes */
2336 XS(XS_Scope__Upper_yield) {
2345 PERL_UNUSED_VAR(cv); /* -W */
2346 PERL_UNUSED_VAR(ax); /* -Wall */
2348 SU_GET_CONTEXT(0, items - 1, su_context_here());
2349 MY_CXT.yield_storage.cxix = cxix;
2350 MY_CXT.yield_storage.items = items;
2351 MY_CXT.yield_storage.savesp = PL_stack_sp;
2353 MY_CXT.yield_storage.items--;
2354 MY_CXT.yield_storage.savesp--;
2356 /* See XS_Scope__Upper_unwind */
2357 if (GIMME_V == G_SCALAR)
2358 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2359 SAVEDESTRUCTOR_X(su_yield, su_yield_name);
2363 STATIC const char su_leave_name[] = "leave";
2365 XS(XS_Scope__Upper_leave); /* prototype to pass -Wmissing-prototypes */
2367 XS(XS_Scope__Upper_leave) {
2376 PERL_UNUSED_VAR(cv); /* -W */
2377 PERL_UNUSED_VAR(ax); /* -Wall */
2379 MY_CXT.yield_storage.cxix = su_context_here();
2380 MY_CXT.yield_storage.items = items;
2381 MY_CXT.yield_storage.savesp = PL_stack_sp;
2382 /* See XS_Scope__Upper_unwind */
2383 if (GIMME_V == G_SCALAR)
2384 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2385 SAVEDESTRUCTOR_X(su_yield, su_leave_name);
2389 MODULE = Scope::Upper PACKAGE = Scope::Upper
2397 MUTEX_INIT(&su_uid_seq_counter_mutex);
2399 su_uid_seq_counter.seqs = NULL;
2400 su_uid_seq_counter.size = 0;
2402 stash = gv_stashpv(__PACKAGE__, 1);
2403 newCONSTSUB(stash, "TOP", newSViv(0));
2404 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
2406 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
2407 newXSproto("Scope::Upper::yield", XS_Scope__Upper_yield, file, NULL);
2408 newXSproto("Scope::Upper::leave", XS_Scope__Upper_leave, file, NULL);
2419 su_uid_storage new_cxt;
2426 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
2430 MY_CXT.uplevel_storage.top = NULL;
2431 MY_CXT.uplevel_storage.root = NULL;
2432 MY_CXT.uplevel_storage.count = 0;
2433 MY_CXT.uid_storage = new_cxt;
2437 #endif /* SU_THREADSAFE */
2445 cxix = su_context_here();
2456 SU_GET_CONTEXT(0, 0, su_context_here());
2459 cxix = su_context_skip_db(cxix);
2460 cxix = su_context_normalize_up(cxix);
2472 SU_GET_CONTEXT(0, 0, cxstack_ix);
2474 for (; cxix >= 0; --cxix) {
2475 PERL_CONTEXT *cx = cxstack + cxix;
2476 switch (CxTYPE(cx)) {
2480 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2494 SU_GET_CONTEXT(0, 0, cxstack_ix);
2496 for (; cxix >= 0; --cxix) {
2497 PERL_CONTEXT *cx = cxstack + cxix;
2498 switch (CxTYPE(cx)) {
2515 cxix = su_context_here();
2516 while (--level >= 0) {
2520 cxix = su_context_skip_db(cxix);
2521 cxix = su_context_normalize_up(cxix);
2534 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2535 PERL_CONTEXT *cx = cxstack + cxix;
2536 switch (CxTYPE(cx)) {
2538 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2558 SU_GET_CONTEXT(0, 0, cxstack_ix);
2561 PERL_CONTEXT *cx = cxstack + cxix--;
2562 switch (CxTYPE(cx)) {
2564 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2568 I32 gimme = cx->blk_gimme;
2570 case G_VOID: XSRETURN_UNDEF; break;
2571 case G_SCALAR: XSRETURN_NO; break;
2572 case G_ARRAY: XSRETURN_YES; break;
2585 const PERL_CONTEXT *cx, *dbcx;
2588 SU_GET_CONTEXT(0, 0, su_context_skip_db(cxstack_ix));
2589 cxix = su_context_normalize_up(cxix);
2590 cx = cxstack + cxix;
2592 if (PL_DBsub && cxix && (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)) {
2593 I32 i = su_context_skip_db(cxix - 1) + 1;
2594 if (i < cxix && CxTYPE(cxstack + i) == CXt_SUB)
2597 cop = cx->blk_oldcop;
2598 EXTEND(SP, SU_INFO_COUNT);
2601 HV *stash = CopSTASH(cop);
2603 PUSHs(su_newmortal_pvn(HvNAME(stash), HvNAMELEN(stash)));
2605 PUSHs(&PL_sv_undef);
2608 PUSHs(su_newmortal_pvn(OutCopFILE(cop), OutCopFILE_len(cop)));
2610 mPUSHi(CopLINE(cop));
2611 /* subroutine (3) and has_args (4) */
2612 switch (CxTYPE(cx)) {
2615 GV *cvgv = CvGV(dbcx->blk_sub.cv);
2616 if (cvgv && isGV(cvgv)) {
2617 SV *sv = sv_newmortal();
2618 gv_efullname3(sv, cvgv, NULL);
2621 PUSHs(su_newmortal_pvs("(unknown)"));
2630 PUSHs(su_newmortal_pvs("(eval)"));
2634 PUSHs(&PL_sv_undef);
2635 PUSHs(&PL_sv_undef);
2638 switch (su_context_gimme(cxix)) {
2645 default: /* G_VOID */
2646 PUSHs(&PL_sv_undef);
2649 /* eval text (6) and is_require (7) */
2650 switch (CxTYPE(cx)) {
2652 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
2654 #if SU_HAS_PERL(5, 17, 4)
2655 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
2656 SvCUR(cx->blk_eval.cur_text)-2,
2657 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
2659 PUSHs(cx->blk_eval.cur_text);
2663 } else if (cx->blk_eval.old_namesv) {
2665 PUSHs(sv_mortalcopy(cx->blk_eval.old_namesv));
2671 /* Anything else including eval BLOCK */
2672 PUSHs(&PL_sv_undef);
2673 PUSHs(&PL_sv_undef);
2677 mPUSHi(CopHINTS_get(cop));
2681 #if SU_HAS_PERL(5, 9, 4)
2682 STRLEN *old_warnings = cop->cop_warnings;
2684 SV *old_warnings = cop->cop_warnings;
2686 if (old_warnings == pWARN_STD) {
2687 if (PL_dowarn & G_WARN_ON)
2688 goto context_info_warnings_on;
2690 #if SU_HAS_PERL(5, 17, 4)
2691 mask = &PL_sv_undef;
2693 goto context_info_warnings_off;
2695 } else if (old_warnings == pWARN_NONE) {
2696 context_info_warnings_off:
2697 mask = su_newmortal_pvn(WARN_NONEstring, WARNsize);
2698 } else if (old_warnings == pWARN_ALL) {
2700 context_info_warnings_on:
2701 #if SU_HAS_PERL(5, 8, 7)
2702 bits = get_hv("warnings::Bits", 0);
2704 SV **bits_all = hv_fetchs(bits, "all", FALSE);
2706 mask = sv_mortalcopy(*bits_all);
2710 mask = su_newmortal_pvn(WARN_ALLstring, WARNsize);
2712 #if SU_HAS_PERL(5, 9, 4)
2713 mask = su_newmortal_pvn((char *) (old_warnings + 1), old_warnings[0]);
2715 mask = sv_mortalcopy(old_warnings);
2720 #if SU_HAS_PERL(5, 10, 0)
2721 /* hints hash (10) */
2723 COPHH *hints_hash = CopHINTHASH_get(cop);
2725 SV *rhv = sv_2mortal(newRV_noinc((SV *) cophh_2hv(hints_hash, 0)));
2728 PUSHs(&PL_sv_undef);
2732 XSRETURN(SU_INFO_COUNT);
2741 SU_GET_CONTEXT(1, 1, su_context_skip_db(cxstack_ix));
2742 cxix = su_context_normalize_down(cxix);
2743 Newx(ud, 1, su_ud_reap);
2744 SU_UD_ORIGIN(ud) = NULL;
2745 SU_UD_HANDLER(ud) = su_reap;
2746 ud->cb = newSVsv(hook);
2747 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2750 localize(SV *sv, SV *val, ...)
2757 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2758 cxix = su_context_normalize_down(cxix);
2759 Newx(ud, 1, su_ud_localize);
2760 SU_UD_ORIGIN(ud) = NULL;
2761 SU_UD_HANDLER(ud) = su_localize;
2762 size = su_ud_localize_init(ud, sv, val, NULL);
2763 su_init(ud, cxix, size);
2766 localize_elem(SV *sv, SV *elem, SV *val, ...)
2773 if (SvTYPE(sv) >= SVt_PVGV)
2774 croak("Can't infer the element localization type from a glob and the value");
2775 SU_GET_CONTEXT(3, 3, su_context_skip_db(cxstack_ix));
2776 cxix = su_context_normalize_down(cxix);
2777 Newx(ud, 1, su_ud_localize);
2778 SU_UD_ORIGIN(ud) = NULL;
2779 SU_UD_HANDLER(ud) = su_localize;
2780 size = su_ud_localize_init(ud, sv, val, elem);
2781 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
2782 SU_UD_LOCALIZE_FREE(ud);
2783 croak("Can't localize an element of something that isn't an array or a hash");
2785 su_init(ud, cxix, size);
2788 localize_delete(SV *sv, SV *elem, ...)
2795 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2796 cxix = su_context_normalize_down(cxix);
2797 Newx(ud, 1, su_ud_localize);
2798 SU_UD_ORIGIN(ud) = NULL;
2799 SU_UD_HANDLER(ud) = su_localize;
2800 size = su_ud_localize_init(ud, sv, NULL, elem);
2801 su_init(ud, cxix, size);
2804 uplevel(SV *code, ...)
2807 I32 cxix, ret, args = 0;
2811 if (SvTYPE(code) < SVt_PVCV)
2812 croak("First argument to uplevel must be a code reference");
2813 SU_GET_CONTEXT(1, items - 1, cxstack_ix);
2815 PERL_CONTEXT *cx = cxstack + cxix;
2816 switch (CxTYPE(cx)) {
2818 croak("Can't uplevel to an eval frame");
2820 croak("Can't uplevel to a format frame");
2822 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2828 /* su_uplevel() takes care of extending the stack if needed. */
2829 ret = su_uplevel((CV *) code, cxix, args);
2834 } while (--cxix >= 0);
2835 croak("Can't uplevel outside a subroutine");
2844 SU_GET_CONTEXT(0, 0, su_context_here());
2845 uid = su_uid_get(cxix);
2851 validate_uid(SV *uid)
2856 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;