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)
202 # define OpSIBLING(O) OP_SIBLING(O)
204 # define OpSIBLING(O) ((O)->op_sibling)
208 #ifndef PERL_MAGIC_tied
209 # define PERL_MAGIC_tied 'P'
212 #ifndef PERL_MAGIC_env
213 # define PERL_MAGIC_env 'E'
216 #ifndef NEGATIVE_INDICES_VAR
217 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
220 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
221 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
223 /* --- Threads and multiplicity -------------------------------------------- */
225 #ifndef SU_MULTIPLICITY
226 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
227 # define SU_MULTIPLICITY 1
229 # define SU_MULTIPLICITY 0
232 #if SU_MULTIPLICITY && !defined(tTHX)
233 # define tTHX PerlInterpreter*
236 #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))
237 # define SU_THREADSAFE 1
238 # ifndef MY_CXT_CLONE
239 # define MY_CXT_CLONE \
241 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
242 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
243 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
246 # define SU_THREADSAFE 0
248 # define dMY_CXT dNOOP
250 # define MY_CXT su_globaldata
252 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
254 # define MY_CXT_INIT NOOP
256 # define MY_CXT_CLONE NOOP
259 /* --- Unique context ID global storage ------------------------------------ */
261 /* ... Sequence ID counter ................................................. */
268 STATIC su_uv_array su_uid_seq_counter;
272 STATIC perl_mutex su_uid_seq_counter_mutex;
274 #define SU_LOCK(M) MUTEX_LOCK(M)
275 #define SU_UNLOCK(M) MUTEX_UNLOCK(M)
277 #else /* USE_ITHREADS */
282 #endif /* !USE_ITHREADS */
284 STATIC UV su_uid_seq_next(pTHX_ UV depth) {
285 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
289 SU_LOCK(&su_uid_seq_counter_mutex);
291 seqs = su_uid_seq_counter.seqs;
293 if (depth >= su_uid_seq_counter.size) {
296 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
297 for (i = su_uid_seq_counter.size; i <= depth; ++i)
300 su_uid_seq_counter.seqs = seqs;
301 su_uid_seq_counter.size = depth + 1;
306 SU_UNLOCK(&su_uid_seq_counter_mutex);
311 /* ... UID storage ......................................................... */
318 #define SU_UID_ACTIVE 1
320 STATIC UV su_uid_depth(pTHX_ I32 cxix) {
321 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
326 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
327 depth += si->si_cxix + 1;
338 STATIC void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
339 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
340 su_uid **old_map = old_cxt->map;
343 su_uid **new_map = new_cxt->map;
344 STRLEN old_used = old_cxt->used;
345 STRLEN new_used, new_alloc;
348 new_used = max_depth < old_used ? max_depth : old_used;
349 new_cxt->used = new_used;
351 if (new_used <= new_cxt->alloc)
352 new_alloc = new_cxt->alloc;
354 new_alloc = new_used;
355 Renew(new_map, new_alloc, su_uid *);
356 for (i = new_cxt->alloc; i < new_alloc; ++i)
358 new_cxt->map = new_map;
359 new_cxt->alloc = new_alloc;
362 for (i = 0; i < new_alloc; ++i) {
363 su_uid *new_uid = new_map[i];
365 if (i < new_used) { /* => i < max_depth && i < old_used */
366 su_uid *old_uid = old_map[i];
368 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
370 Newx(new_uid, 1, su_uid);
371 new_map[i] = new_uid;
379 new_uid->flags &= ~SU_UID_ACTIVE;
386 /* --- unwind() global storage --------------------------------------------- */
396 /* --- yield() global storage ---------------------------------------------- */
406 /* --- uplevel() data tokens and global storage ---------------------------- */
408 #define SU_UPLEVEL_HIJACKS_RUNOPS SU_HAS_PERL(5, 8, 0)
413 su_uid_storage tmp_uid_storage;
414 su_uid_storage old_uid_storage;
425 PERL_SI *old_curstackinfo;
431 #if SU_UPLEVEL_HIJACKS_RUNOPS
432 runops_proc_t old_runops;
439 STATIC su_uplevel_ud *su_uplevel_ud_new(pTHX) {
440 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
444 Newx(sud, 1, su_uplevel_ud);
447 sud->tmp_uid_storage.map = NULL;
448 sud->tmp_uid_storage.used = 0;
449 sud->tmp_uid_storage.alloc = 0;
451 Newx(si, 1, PERL_SI);
452 si->si_stack = newAV();
453 AvREAL_off(si->si_stack);
454 si->si_cxstack = NULL;
462 STATIC void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
463 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
464 PERL_SI *si = sud->si;
466 Safefree(si->si_cxstack);
467 SvREFCNT_dec(si->si_stack);
470 if (sud->tmp_uid_storage.map) {
471 su_uid **map = sud->tmp_uid_storage.map;
472 STRLEN alloc = sud->tmp_uid_storage.alloc;
475 for (i = 0; i < alloc; ++i)
490 } su_uplevel_storage;
492 #ifndef SU_UPLEVEL_STORAGE_SIZE
493 # define SU_UPLEVEL_STORAGE_SIZE 4
496 /* --- Global data --------------------------------------------------------- */
498 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
501 char *stack_placeholder;
502 su_unwind_storage unwind_storage;
503 su_yield_storage yield_storage;
504 su_uplevel_storage uplevel_storage;
505 su_uid_storage uid_storage;
510 /* --- Stack manipulations ------------------------------------------------- */
512 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
514 #define SU_SAVE_DESTRUCTOR_SIZE 3
515 #define SU_SAVE_PLACEHOLDER_SIZE 3
517 #define SU_SAVE_SCALAR_SIZE 3
519 #define SU_SAVE_ARY_SIZE 3
520 #define SU_SAVE_AELEM_SIZE 4
522 # define SU_SAVE_ADELETE_SIZE 3
524 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
526 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
527 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
529 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
532 #define SU_SAVE_HASH_SIZE 3
533 #define SU_SAVE_HELEM_SIZE 4
534 #define SU_SAVE_HDELETE_SIZE 4
535 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
536 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
538 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
541 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
543 #if !SU_HAS_PERL(5, 8, 9)
544 # define SU_SAVE_GP_SIZE 6
545 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
546 # define SU_SAVE_GP_SIZE 3
547 #elif !SU_HAS_PERL(5, 13, 8)
548 # define SU_SAVE_GP_SIZE 4
550 # define SU_SAVE_GP_SIZE 3
553 #ifndef SvCANEXISTDELETE
554 # define SvCANEXISTDELETE(sv) \
556 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
557 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
558 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
559 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
564 /* ... Saving array elements ............................................... */
566 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
567 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
573 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
574 #if SU_HAS_PERL(5, 8, 1)
575 if (SvRMAGICAL(av)) {
576 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
578 SV * const * const negative_indices_glob =
579 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
580 NEGATIVE_INDICES_VAR, 16, 0);
581 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
587 idx = key + av_len(av) + 1;
601 STATIC void su_adelete(pTHX_ void *ud_) {
602 su_ud_adelete *ud = (su_ud_adelete *) ud_;
604 av_delete(ud->av, ud->idx, G_DISCARD);
605 SvREFCNT_dec(ud->av);
610 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
611 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
614 Newx(ud, 1, su_ud_adelete);
617 SvREFCNT_inc_simple_void(av);
619 SAVEDESTRUCTOR_X(su_adelete, ud);
622 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
624 #endif /* SAVEADELETE */
626 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
627 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
634 idx = su_av_key2idx(av, SvIV(key));
636 if (SvCANEXISTDELETE(av))
637 preeminent = av_exists(av, idx);
639 svp = av_fetch(av, idx, 1);
640 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
643 save_aelem(av, idx, svp);
645 SAVEADELETE(av, idx);
647 if (val) { /* local $x[$idx] = $val; */
648 SvSetMagicSV(*svp, val);
649 } else { /* local $x[$idx]; delete $x[$idx]; */
650 av_delete(av, idx, G_DISCARD);
654 /* ... Saving hash elements ................................................ */
656 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
657 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
664 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
665 preeminent = hv_exists_ent(hv, keysv, 0);
667 he = hv_fetch_ent(hv, keysv, 1, 0);
668 svp = he ? &HeVAL(he) : NULL;
669 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
671 if (HvNAME_get(hv) && isGV(*svp)) {
672 save_gp((GV *) *svp, 0);
677 save_helem(hv, keysv, svp);
680 const char * const key = SvPV_const(keysv, keylen);
681 SAVEDELETE(hv, savepvn(key, keylen),
682 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
685 if (val) { /* local $x{$keysv} = $val; */
686 SvSetMagicSV(*svp, val);
687 } else { /* local $x{$keysv}; delete $x{$keysv}; */
688 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
692 /* ... Saving code slots from a glob ....................................... */
694 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
695 # define mro_method_changed_in(G) PL_sub_generation++
703 STATIC void su_restore_gvcv(pTHX_ void *ud_) {
704 su_save_gvcv_ud *ud = ud_;
707 GvCV_set(gv, ud->old_cv);
709 mro_method_changed_in(GvSTASH(gv));
714 STATIC void su_save_gvcv(pTHX_ GV *gv) {
715 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
718 Newx(ud, 1, su_save_gvcv_ud);
720 ud->old_cv = GvCV(gv);
724 mro_method_changed_in(GvSTASH(gv));
726 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
729 /* --- Actions ------------------------------------------------------------- */
735 void (*handler)(pTHX_ void *);
738 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
739 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
740 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
741 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
743 #define SU_UD_FREE(U) STMT_START { \
744 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
748 /* ... Reap ................................................................ */
750 #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))
757 STATIC void su_call(pTHX_ void *ud_) {
758 su_ud_reap *ud = (su_ud_reap *) ud_;
761 PERL_CONTEXT saved_cx;
762 #endif /* SU_SAVE_LAST_CX */
767 PerlIO_printf(Perl_debug_log,
768 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
769 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
779 /* If the recently popped context isn't saved there, it will be overwritten by
780 * the sub scope from call_sv, although it's still needed in our caller. */
781 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
782 saved_cx = cxstack[cxix];
783 #endif /* SU_SAVE_LAST_CX */
785 call_sv(ud->cb, G_VOID);
788 cxstack[cxix] = saved_cx;
789 #endif /* SU_SAVE_LAST_CX */
796 SvREFCNT_dec(ud->cb);
800 STATIC void su_reap(pTHX_ void *ud) {
801 #define su_reap(U) su_reap(aTHX_ (U))
803 PerlIO_printf(Perl_debug_log,
804 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
805 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
808 SAVEDESTRUCTOR_X(su_call, ud);
811 /* ... Localize & localize array/hash element .............................. */
821 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
822 SvREFCNT_dec((U)->elem); \
823 SvREFCNT_dec((U)->val); \
824 SvREFCNT_dec((U)->sv); \
828 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
829 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
834 SvREFCNT_inc_simple_void(sv);
836 if (SvTYPE(sv) >= SVt_PVGV) {
837 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
839 } else { /* local *x = \$val; */
840 t = SvTYPE(SvRV(val));
843 } else if (SvROK(sv)) {
844 croak("Invalid %s reference as the localization target",
845 sv_reftype(SvRV(sv), 0));
848 const char *p = SvPV_const(sv, len), *s;
849 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
855 case '$': t = SVt_PV; break;
856 case '@': t = SVt_PVAV; break;
857 case '%': t = SVt_PVHV; break;
858 case '&': t = SVt_PVCV; break;
859 case '*': t = SVt_PVGV; break;
864 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
865 if (SvROK(val) && !sv_isobject(val)) {
866 t = SvTYPE(SvRV(val));
878 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
883 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
888 size = SU_SAVE_GP_SIZE;
892 size = SU_SAVE_GVCV_SIZE;
896 size = SU_SAVE_SCALAR_SIZE;
899 /* When deref is set, val isn't NULL */
902 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
903 ud->elem = SvREFCNT_inc(elem);
909 STATIC void su_localize(pTHX_ void *ud_) {
910 #define su_localize(U) su_localize(aTHX_ (U))
911 su_ud_localize *ud = (su_ud_localize *) ud_;
918 if (SvTYPE(sv) >= SVt_PVGV) {
922 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
925 const char *name = SvPV_const(sv, len);
926 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
933 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
934 PerlIO_printf(Perl_debug_log,
935 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
936 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
940 /* Inspired from Alias.pm */
944 su_save_aelem(GvAV(gv), elem, val);
951 su_save_helem(GvHV(gv), elem, val);
957 save_gp(gv, 1); /* hide previous entry in symtab */
963 gv = (GV *) save_scalar(gv);
968 SvSetMagicSV((SV *) gv, val);
971 SU_UD_LOCALIZE_FREE(ud);
974 /* --- Pop a context back -------------------------------------------------- */
976 #if SU_DEBUG && defined(DEBUGGING)
977 # define SU_CXNAME(C) PL_block_type[CxTYPE(C)]
979 # define SU_CXNAME(C) "XXX"
982 STATIC void su_pop(pTHX_ void *ud) {
983 #define su_pop(U) su_pop(aTHX_ (U))
984 I32 depth, base, mark, *origin;
985 depth = SU_UD_DEPTH(ud);
988 PerlIO_printf(Perl_debug_log,
990 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
991 ud, SU_CXNAME(cxstack + cxstack_ix),
992 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
995 origin = SU_UD_ORIGIN(ud);
996 mark = origin[depth];
997 base = origin[depth - 1];
999 SU_D(PerlIO_printf(Perl_debug_log,
1000 "%p: original scope was %*c top=%2d base=%2d\n",
1001 ud, 24, ' ', mark, base));
1004 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
1005 PL_savestack_ix = mark;
1008 PL_savestack_ix = base;
1010 SU_UD_DEPTH(ud) = --depth;
1015 if ((pad = SU_UD_PAD(ud))) {
1018 SU_D(PerlIO_printf(Perl_debug_log,
1019 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
1020 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1021 SU_SAVE_PLACEHOLDER();
1025 SU_D(PerlIO_printf(Perl_debug_log,
1026 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
1027 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1028 SAVEDESTRUCTOR_X(su_pop, ud);
1030 SU_UD_HANDLER(ud)(aTHX_ ud);
1033 SU_D(PerlIO_printf(Perl_debug_log,
1034 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
1035 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
1038 /* --- Initialize the stack and the action userdata ------------------------ */
1040 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
1041 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
1042 I32 i, depth = 1, pad, offset, *origin;
1044 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
1046 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
1049 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
1050 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
1051 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
1054 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
1056 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
1057 ud, size, pad, offset));
1059 for (i = cxstack_ix; i > cxix; --i) {
1060 PERL_CONTEXT *cx = cxstack + i;
1061 switch (CxTYPE(cx)) {
1062 #if SU_HAS_PERL(5, 11, 0)
1064 case CXt_LOOP_PLAIN:
1065 case CXt_LOOP_LAZYSV:
1066 case CXt_LOOP_LAZYIV:
1070 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
1074 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
1079 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
1081 Newx(origin, depth + 1, I32);
1082 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
1083 PL_scopestack[PL_scopestack_ix - depth] += size;
1084 for (i = depth - 1; i >= 1; --i) {
1085 I32 j = PL_scopestack_ix - i;
1086 origin[depth - i] = PL_scopestack[j];
1087 PL_scopestack[j] += offset;
1089 origin[depth] = PL_savestack_ix;
1091 SU_UD_ORIGIN(ud) = origin;
1092 SU_UD_DEPTH(ud) = depth;
1093 SU_UD_PAD(ud) = pad;
1095 /* Make sure the first destructor fires by pushing enough fake slots on the
1097 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1098 <= PL_scopestack[PL_scopestack_ix - 1]) {
1101 SU_D(PerlIO_printf(Perl_debug_log,
1102 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1103 ud, PL_scopestack_ix, PL_savestack_ix));
1104 SU_SAVE_PLACEHOLDER();
1105 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1106 <= PL_scopestack[PL_scopestack_ix - 1]);
1108 SU_D(PerlIO_printf(Perl_debug_log,
1109 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1110 ud, PL_scopestack_ix, PL_savestack_ix));
1111 SAVEDESTRUCTOR_X(su_pop, ud);
1114 for (i = 0; i <= depth; ++i) {
1115 I32 j = PL_scopestack_ix - i;
1116 PerlIO_printf(Perl_debug_log,
1117 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1118 ud, i, j, origin[depth - i],
1119 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1126 /* --- Unwind stack -------------------------------------------------------- */
1128 STATIC void su_unwind(pTHX_ void *ud_) {
1130 I32 cxix = MY_CXT.unwind_storage.cxix;
1131 I32 items = MY_CXT.unwind_storage.items;
1134 PERL_UNUSED_VAR(ud_);
1136 PL_stack_sp = MY_CXT.unwind_storage.savesp;
1137 #if SU_HAS_PERL(5, 19, 4)
1140 SV **sp = PL_stack_sp;
1141 for (i = -items + 1; i <= 0; ++i)
1143 sv_2mortal(SvREFCNT_inc(sp[i]));
1147 if (cxstack_ix > cxix)
1150 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1151 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1154 I32 gimme = GIMME_V;
1155 PerlIO_printf(Perl_debug_log,
1156 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1158 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1159 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1162 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1163 PL_op = PL_op->op_ppaddr(aTHX);
1165 *PL_markstack_ptr = mark;
1167 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1168 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1171 /* --- Yield --------------------------------------------------------------- */
1173 #if SU_HAS_PERL(5, 10, 0)
1174 # define SU_RETOP_SUB(C) ((C)->blk_sub.retop)
1175 # define SU_RETOP_EVAL(C) ((C)->blk_eval.retop)
1176 # define SU_RETOP_LOOP(C) ((C)->blk_loop.my_op->op_lastop->op_next)
1177 # define SU_RETOP_GIVEN(C) ((C)->blk_givwhen.leave_op->op_next)
1179 # define SU_RETOP_SUB(C) ((C)->blk_oldretsp > 0 ? PL_retstack[(C)->blk_oldretsp - 1] : NULL)
1180 # define SU_RETOP_EVAL(C) SU_RETOP_SUB(C)
1181 # define SU_RETOP_LOOP(C) ((C)->blk_loop.last_op->op_next)
1184 STATIC void su_yield(pTHX_ void *ud_) {
1187 const char *which = ud_;
1188 I32 cxix = MY_CXT.yield_storage.cxix;
1189 I32 items = MY_CXT.yield_storage.items;
1190 opcode type = OP_NULL;
1194 PERL_UNUSED_VAR(ud_);
1196 cx = cxstack + cxix;
1197 switch (CxTYPE(cx)) {
1199 I32 i, cur = cxstack_ix, n = 1;
1201 /* Is this actually a given/when block? This may occur only when yield was
1202 * called with HERE (or nothing) as the context. */
1203 #if SU_HAS_PERL(5, 10, 0)
1205 PERL_CONTEXT *prev = cx - 1;
1206 U8 type = CxTYPE(prev);
1207 if ((type == CXt_GIVEN || type == CXt_WHEN)
1208 && (prev->blk_oldcop == cx->blk_oldcop)) {
1211 if (type == CXt_GIVEN)
1220 /* Bare blocks (that appear as do { ... } blocks, map { ... } blocks or
1221 * constant folded blcoks) don't need to save the op to return to anywhere
1222 * since 'last' isn't supposed to work inside them. So we climb higher in
1223 * the context stack until we reach a context that has a return op (i.e. a
1224 * sub, an eval, a format or a real loop), recording how many blocks we
1225 * crossed. Then we follow the op_next chain until we get to the leave op
1226 * that closes the original block, which we are assured to reach since
1227 * everything is static (the blocks we have crossed cannot be evals or
1228 * subroutine calls). */
1229 for (i = cxix + 1; i <= cur; ++i) {
1230 PERL_CONTEXT *cx2 = cxstack + i;
1231 switch (CxTYPE(cx2)) {
1237 o = SU_RETOP_SUB(cx2);
1240 o = SU_RETOP_EVAL(cx2);
1242 #if SU_HAS_PERL(5, 11, 0)
1244 case CXt_LOOP_PLAIN:
1245 case CXt_LOOP_LAZYSV:
1246 case CXt_LOOP_LAZYIV:
1250 o = SU_RETOP_LOOP(cx2);
1259 /* We may find other enter/leave blocks on our way to the matching leave.
1260 * Make sure the depth is incremented/decremented appropriately. */
1261 if (o->op_type == OP_ENTER) {
1263 } else if (o->op_type == OP_LEAVE) {
1277 next = SU_RETOP_SUB(cx);
1280 type = CxTRYBLOCK(cx) ? OP_LEAVETRY : OP_LEAVEEVAL;
1281 next = SU_RETOP_EVAL(cx);
1283 #if SU_HAS_PERL(5, 11, 0)
1285 case CXt_LOOP_PLAIN:
1286 case CXt_LOOP_LAZYSV:
1287 case CXt_LOOP_LAZYIV:
1291 type = OP_LEAVELOOP;
1292 next = SU_RETOP_LOOP(cx);
1294 #if SU_HAS_PERL(5, 10, 0)
1297 type = OP_LEAVEGIVEN;
1298 next = SU_RETOP_GIVEN(cx);
1302 #if SU_HAS_PERL(5, 15, 1)
1303 type = OP_LEAVEWHEN;
1306 flags |= OPf_SPECIAL;
1312 croak("%s() can't target a substitution context", which);
1315 croak("%s() doesn't know how to leave a %s context",
1316 which, SU_CXNAME(cxstack + cxix));
1320 PL_stack_sp = MY_CXT.yield_storage.savesp;
1321 #if SU_HAS_PERL(5, 19, 4)
1324 SV **sp = PL_stack_sp;
1325 for (i = -items + 1; i <= 0; ++i)
1327 sv_2mortal(SvREFCNT_inc(sp[i]));
1331 if (cxstack_ix > cxix)
1334 /* Copy the arguments passed to yield() where the leave op expects to find
1337 Move(PL_stack_sp - items + 1, PL_stack_base + cx->blk_oldsp + 1, items, SV *);
1338 PL_stack_sp = PL_stack_base + cx->blk_oldsp + items;
1340 flags |= OP_GIMME_REVERSE(cx->blk_gimme);
1342 MY_CXT.yield_storage.leave_op.op_type = type;
1343 MY_CXT.yield_storage.leave_op.op_ppaddr = PL_ppaddr[type];
1344 MY_CXT.yield_storage.leave_op.op_flags = flags;
1345 MY_CXT.yield_storage.leave_op.op_next = next;
1347 PL_op = (OP *) &(MY_CXT.yield_storage.leave_op);
1348 PL_op = PL_op->op_ppaddr(aTHX);
1350 MY_CXT.yield_storage.proxy_op.op_next = PL_op;
1351 PL_op = &(MY_CXT.yield_storage.proxy_op);
1354 /* --- Uplevel ------------------------------------------------------------- */
1356 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1357 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1359 STATIC su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1360 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1365 sud = MY_CXT.uplevel_storage.root;
1367 MY_CXT.uplevel_storage.root = sud->next;
1368 MY_CXT.uplevel_storage.count--;
1370 sud = su_uplevel_ud_new();
1373 sud->next = MY_CXT.uplevel_storage.top;
1374 MY_CXT.uplevel_storage.top = sud;
1376 depth = su_uid_depth(cxix);
1377 su_uid_storage_dup(&sud->tmp_uid_storage, &MY_CXT.uid_storage, depth);
1378 sud->old_uid_storage = MY_CXT.uid_storage;
1379 MY_CXT.uid_storage = sud->tmp_uid_storage;
1384 STATIC void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1385 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1388 sud->tmp_uid_storage = MY_CXT.uid_storage;
1389 MY_CXT.uid_storage = sud->old_uid_storage;
1393 map = sud->tmp_uid_storage.map;
1394 alloc = sud->tmp_uid_storage.alloc;
1395 for (i = 0; i < alloc; ++i) {
1397 map[i]->flags &= SU_UID_ACTIVE;
1400 MY_CXT.uplevel_storage.top = sud->next;
1402 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1403 su_uplevel_ud_delete(sud);
1405 sud->next = MY_CXT.uplevel_storage.root;
1406 MY_CXT.uplevel_storage.root = sud;
1407 MY_CXT.uplevel_storage.count++;
1411 STATIC int su_uplevel_goto_static(const OP *o) {
1412 for (; o; o = OpSIBLING(o)) {
1413 /* goto ops are unops with kids. */
1414 if (!(o->op_flags & OPf_KIDS))
1417 switch (o->op_type) {
1420 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1425 if (su_uplevel_goto_static(((const UNOP *) o)->op_first))
1434 #if SU_UPLEVEL_HIJACKS_RUNOPS
1436 STATIC int su_uplevel_goto_runops(pTHX) {
1437 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1443 if (op->op_type == OP_GOTO) {
1444 AV *argarray = NULL;
1447 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1448 const PERL_CONTEXT *cx = cxstack + cxix;
1450 switch (CxTYPE(cx)) {
1452 if (CxHASARGS(cx)) {
1453 argarray = cx->blk_sub.argarray;
1469 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1470 AV *args = GvAV(PL_defgv);
1471 I32 items = AvFILLp(args);
1473 av_extend(argarray, items);
1474 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1475 AvFILLp(argarray) = items;
1480 PL_op = op = op->op_ppaddr(aTHX);
1482 #if !SU_HAS_PERL(5, 13, 0)
1492 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1494 #define su_at_underscore(C) PadARRAY(PadlistARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1496 STATIC void su_uplevel_restore(pTHX_ void *sus_) {
1497 su_uplevel_ud *sud = sus_;
1498 PERL_SI *cur = sud->old_curstackinfo;
1499 PERL_SI *si = sud->si;
1501 #if SU_UPLEVEL_HIJACKS_RUNOPS
1502 if (PL_runops == su_uplevel_goto_runops)
1503 PL_runops = sud->old_runops;
1506 if (sud->callback) {
1507 PERL_CONTEXT *cx = cxstack + sud->cxix;
1508 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1510 /* We have to fix the pad entry for @_ in the original callback because it
1511 * may have been reified. */
1512 if (AvREAL(argarray)) {
1513 const I32 fill = AvFILLp(argarray);
1514 SvREFCNT_dec(argarray);
1516 AvREAL_off(argarray);
1517 AvREIFY_on(argarray);
1518 av_extend(argarray, fill);
1519 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1521 CLEAR_ARGARRAY(argarray);
1524 /* If the old cv member is our renamed CV, it means that this place has been
1525 * reached without a goto() happening, and the old argarray member is
1526 * actually our fake argarray. Destroy it properly in that case. */
1527 if (cx->blk_sub.cv == sud->renamed) {
1528 SvREFCNT_dec(cx->blk_sub.argarray);
1529 cx->blk_sub.argarray = argarray;
1532 CvDEPTH(sud->callback)--;
1533 SvREFCNT_dec(sud->callback);
1536 /* Free the renamed CV. We must do it ourselves so that we can force the
1537 * depth to be 0, or perl would complain about it being "still in use".
1538 * But we *know* that it cannot be so. */
1540 CvDEPTH(sud->renamed) = 0;
1541 CvPADLIST(sud->renamed) = NULL;
1542 SvREFCNT_dec(sud->renamed);
1545 CATCH_SET(sud->old_catch);
1547 SU_UPLEVEL_RESTORE(op);
1549 /* stack_grow() wants PL_curstack so restore the old stack first */
1550 if (PL_curstackinfo == si) {
1551 PL_curstack = cur->si_stack;
1552 if (sud->old_mainstack)
1553 SU_UPLEVEL_RESTORE(mainstack);
1554 SU_UPLEVEL_RESTORE(curstackinfo);
1557 CV *target = sud->target;
1560 /* When we die, the depth of the target CV is not updated because of the
1561 * stack switcheroo. So we have to look at all the frames between the
1562 * uplevel call and the catch block to count how many call frames to the
1563 * target CV were skipped. */
1564 for (i = cur->si_cxix; i > sud->cxix; i--) {
1565 register const PERL_CONTEXT *cx = cxstack + i;
1567 if (CxTYPE(cx) == CXt_SUB) {
1568 if (cx->blk_sub.cv == target)
1573 /* If we died, the replacement stack was already unwinded to the first
1574 * eval frame, and all the contexts down there were popped. We don't have
1575 * to pop manually any context of the original stack, because they must
1576 * have been in the replacement stack as well (since the second was copied
1577 * from the first). Thus we only have to make sure the original stack index
1578 * points to the context just below the first eval scope under the target
1580 for (; i >= 0; i--) {
1581 register const PERL_CONTEXT *cx = cxstack + i;
1583 switch (CxTYPE(cx)) {
1585 if (cx->blk_sub.cv == target)
1597 CvDEPTH(target) = sud->target_depth - levels;
1598 PL_curstackinfo->si_cxix = i - 1;
1600 #if !SU_HAS_PERL(5, 13, 1)
1601 /* Since $@ was maybe localized between the target frame and the uplevel
1602 * call, we forcefully flush the save stack to get rid of it and then
1603 * reset $@ to its proper value. Note that the the call to
1604 * su_uplevel_restore() must happen before the "reset $@" item of the save
1605 * stack is processed, as uplevel was called after the localization.
1606 * Andrew's changes to how $@ was handled, which were mainly integrated
1607 * between perl 5.13.0 and 5.13.1, fixed this. */
1608 if (ERRSV && SvTRUE(ERRSV)) {
1609 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1610 SV *errsv = SvREFCNT_inc(ERRSV);
1611 PL_scopestack_ix = cx->blk_oldscopesp;
1612 leave_scope(PL_scopestack[PL_scopestack_ix]);
1613 sv_setsv(ERRSV, errsv);
1614 SvREFCNT_dec(errsv);
1620 SU_UPLEVEL_RESTORE(curcop);
1622 SvREFCNT_dec(sud->target);
1624 PL_stack_base = AvARRAY(cur->si_stack);
1625 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1626 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1628 /* When an exception is thrown from the uplevel'd subroutine,
1629 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1630 * die_where() in more recent perls), which has the sad habit of keeping a
1631 * pointer to the current context frame across this call. This means that we
1632 * can't free the temporary context stack we used for the uplevel call right
1633 * now, or that pointer upwards would point to garbage. */
1634 #if SU_HAS_PERL(5, 13, 7)
1635 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1636 * public in perl 5.13.7. */
1637 su_uplevel_storage_delete(sud);
1639 /* Otherwise, we just enqueue it back in the global storage list. */
1643 sud->tmp_uid_storage = MY_CXT.uid_storage;
1644 MY_CXT.uid_storage = sud->old_uid_storage;
1646 MY_CXT.uplevel_storage.top = sud->next;
1647 sud->next = MY_CXT.uplevel_storage.root;
1648 MY_CXT.uplevel_storage.root = sud;
1649 MY_CXT.uplevel_storage.count++;
1656 STATIC CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1657 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1661 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1663 CvFLAGS(cv) = CvFLAGS(proto);
1665 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1667 CvDEPTH(cv) = CvDEPTH(proto);
1669 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1671 CvFILE(cv) = CvFILE(proto);
1675 #if SU_RELEASE && SU_HAS_PERL_EXACT(5, 21, 4)
1678 CvSTASH_set(cv, CvSTASH(proto));
1679 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1680 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1681 * (which was part of perl 5.13.7). */
1682 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1684 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1687 if (CvISXSUB(proto)) {
1688 CvXSUB(cv) = CvXSUB(proto);
1689 CvXSUBANY(cv) = CvXSUBANY(proto);
1692 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1694 CvSTART(cv) = CvSTART(proto);
1696 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1697 #ifdef CVf_WEAKOUTSIDE
1698 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1700 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1701 CvPADLIST(cv) = CvPADLIST(proto);
1702 #ifdef CvOUTSIDE_SEQ
1703 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1707 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1717 STATIC I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1718 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1720 const PERL_CONTEXT *cx = cxstack + cxix;
1722 PERL_SI *cur = PL_curstackinfo;
1728 I32 old_mark, new_mark;
1735 /* Make PL_stack_sp point just before the CV. */
1736 PL_stack_sp -= args + 1;
1737 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1740 sud = su_uplevel_storage_new(cxix);
1744 sud->callback = NULL;
1745 sud->renamed = NULL;
1746 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1750 si->si_type = cur->si_type;
1752 si->si_prev = cur->si_prev;
1754 si->si_markoff = cx->blk_oldmarksp;
1757 /* Allocate enough space for all the elements of the original stack up to the
1758 * target context, plus the forthcoming arguments. */
1759 new_mark = cx->blk_oldsp;
1760 av_extend(si->si_stack, new_mark + 1 + args + 1);
1761 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1762 AvFILLp(si->si_stack) = new_mark;
1763 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1765 /* Specialized SWITCHSTACK() */
1766 PL_stack_base = AvARRAY(si->si_stack);
1767 old_stack_sp = PL_stack_sp;
1768 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1769 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1772 /* Copy the context stack up to the context just below the target. */
1773 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1774 if (si->si_cxmax < cxix) {
1775 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1776 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1777 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1779 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1780 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1782 target = cx->blk_sub.cv;
1783 sud->target = (CV *) SvREFCNT_inc(target);
1784 sud->target_depth = CvDEPTH(target);
1786 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1787 * run-time implication, since PL_curcop will be overwritten as soon as we
1788 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1789 * make it point to the blk_oldcop for the target frame, so that caller()
1790 * reports the right file name, line number and lexical hints. */
1791 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1792 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1793 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1795 SU_UPLEVEL_SAVE(curstackinfo, si);
1796 /* If those two are equal, we need to fool POPSTACK_TO() */
1797 if (PL_mainstack == PL_curstack)
1798 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1800 sud->old_mainstack = NULL;
1801 PL_curstack = si->si_stack;
1803 renamed = su_cv_clone(callback, CvGV(target));
1804 sud->renamed = renamed;
1807 /* Both SP and old_stack_sp point just before the CV. */
1808 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1810 PUSHs((SV *) renamed);
1813 Zero(&sub_op, 1, UNOP);
1814 sub_op.op_type = OP_ENTERSUB;
1815 sub_op.op_next = NULL;
1816 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1818 sub_op.op_flags |= OPpENTERSUB_DB;
1820 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1822 #if SU_UPLEVEL_HIJACKS_RUNOPS
1823 sud->old_runops = PL_runops;
1826 sud->old_catch = CATCH_GET;
1829 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1830 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1832 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1835 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1836 CvDEPTH(callback)++;
1838 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1839 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1840 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1841 * with what we put on the stack. But we want to fake up the same arguments
1842 * as the ones in use at the context we uplevel to, so we replace the
1843 * argarray with an unreal copy of the original @_. */
1847 av_extend(av, AvMAX(cx->blk_sub.argarray));
1848 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1849 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1850 sub_cx->blk_sub.argarray = av;
1852 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1855 if (su_uplevel_goto_static(CvROOT(renamed))) {
1856 #if SU_UPLEVEL_HIJACKS_RUNOPS
1857 if (PL_runops != PL_runops_std) {
1858 if (PL_runops == PL_runops_dbg) {
1860 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1861 } else if (PL_runops != su_uplevel_goto_runops)
1862 croak("uplevel() can't execute code that calls goto with a custom runloop");
1865 PL_runops = su_uplevel_goto_runops;
1866 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1867 croak("uplevel() can't execute code that calls goto before perl 5.8");
1868 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1876 ret = PL_stack_sp - (PL_stack_base + new_mark);
1878 AV *old_stack = sud->old_curstackinfo->si_stack;
1880 if (old_mark + ret > AvMAX(old_stack)) {
1881 /* Specialized EXTEND(old_sp, ret) */
1882 av_extend(old_stack, old_mark + ret + 1);
1883 old_stack_sp = AvARRAY(old_stack) + old_mark;
1886 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1888 AvFILLp(old_stack) += ret;
1896 /* --- Unique context ID --------------------------------------------------- */
1898 STATIC su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1899 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1904 map = MY_CXT.uid_storage.map;
1905 alloc = MY_CXT.uid_storage.alloc;
1907 if (depth >= alloc) {
1910 Renew(map, depth + 1, su_uid *);
1911 for (i = alloc; i <= depth; ++i)
1914 MY_CXT.uid_storage.map = map;
1915 MY_CXT.uid_storage.alloc = depth + 1;
1921 Newx(uid, 1, su_uid);
1927 if (depth >= MY_CXT.uid_storage.used)
1928 MY_CXT.uid_storage.used = depth + 1;
1933 STATIC int su_uid_storage_check(pTHX_ UV depth, UV seq) {
1934 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
1938 if (depth >= MY_CXT.uid_storage.used)
1941 uid = MY_CXT.uid_storage.map[depth];
1943 return uid && (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
1946 STATIC void su_uid_drop(pTHX_ void *ud_) {
1949 uid->flags &= ~SU_UID_ACTIVE;
1952 STATIC void su_uid_bump(pTHX_ void *ud_) {
1953 su_ud_reap *ud = ud_;
1955 SAVEDESTRUCTOR_X(su_uid_drop, ud->cb);
1958 STATIC SV *su_uid_get(pTHX_ I32 cxix) {
1959 #define su_uid_get(I) su_uid_get(aTHX_ (I))
1964 depth = su_uid_depth(cxix);
1965 uid = su_uid_storage_fetch(depth);
1967 if (!(uid->flags & SU_UID_ACTIVE)) {
1970 uid->seq = su_uid_seq_next(depth);
1971 uid->flags |= SU_UID_ACTIVE;
1973 Newx(ud, 1, su_ud_reap);
1974 SU_UD_ORIGIN(ud) = NULL;
1975 SU_UD_HANDLER(ud) = su_uid_bump;
1976 ud->cb = (SV *) uid;
1977 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1980 uid_sv = sv_newmortal();
1981 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
1987 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
1989 #else /* grok_number */
1991 #define IS_NUMBER_IN_UV 0x1
1993 STATIC int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
1994 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
1998 /* This crude check should be good enough for a fallback implementation.
1999 * Better be too strict than too lax. */
2000 for (i = 0; i < len; ++i) {
2005 tmpsv = sv_newmortal();
2006 sv_setpvn(tmpsv, s, len);
2007 *valuep = sv_2uv(tmpsv);
2009 return IS_NUMBER_IN_UV;
2012 #endif /* !grok_number */
2014 STATIC int su_uid_validate(pTHX_ SV *uid) {
2015 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
2021 s = SvPV_const(uid, len);
2023 while (p < len && s[p] != '-')
2026 croak("UID contains only one part");
2028 type = su_grok_number(s, p, &depth);
2029 if (type != IS_NUMBER_IN_UV)
2030 croak("First UID part is not an unsigned integer");
2032 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
2034 type = su_grok_number(s + p, len - p, &seq);
2035 if (type != IS_NUMBER_IN_UV)
2036 croak("Second UID part is not an unsigned integer");
2038 return su_uid_storage_check(depth, seq);
2041 /* --- Context operations -------------------------------------------------- */
2043 /* Remove sequences of BLOCKs having DB for stash, followed by a SUB context
2044 * for the debugger callback. */
2046 STATIC I32 su_context_skip_db(pTHX_ I32 cxix) {
2047 #define su_context_skip_db(C) su_context_skip_db(aTHX_ (C))
2053 for (i = cxix; i > 0; --i) {
2054 PERL_CONTEXT *cx = cxstack + i;
2056 switch (CxTYPE(cx)) {
2057 #if SU_HAS_PERL(5, 17, 1)
2058 case CXt_LOOP_PLAIN:
2061 if (cx->blk_oldcop && CopSTASH(cx->blk_oldcop) == GvSTASH(PL_DBgv))
2065 if (cx->blk_sub.cv == GvCV(PL_DBsub)) {
2081 STATIC I32 su_context_normalize_up(pTHX_ I32 cxix) {
2082 #define su_context_normalize_up(C) su_context_normalize_up(aTHX_ (C))
2088 cx = cxstack + cxix;
2089 if (CxTYPE(cx) == CXt_BLOCK) {
2090 PERL_CONTEXT *prev = cx - 1;
2092 switch (CxTYPE(prev)) {
2093 #if SU_HAS_PERL(5, 10, 0)
2097 #if SU_HAS_PERL(5, 11, 0)
2098 /* That's the only subcategory that can cause an extra BLOCK context */
2099 case CXt_LOOP_PLAIN:
2103 if (cx->blk_oldcop == prev->blk_oldcop)
2107 if (cx->blk_oldcop && OpSIBLING(cx->blk_oldcop)
2108 && OpSIBLING(cx->blk_oldcop)->op_type == OP_SUBST)
2117 STATIC I32 su_context_normalize_down(pTHX_ I32 cxix) {
2118 #define su_context_normalize_down(C) su_context_normalize_down(aTHX_ (C))
2121 if (cxix >= cxstack_ix)
2124 next = cxstack + cxix + 1;
2125 if (CxTYPE(next) == CXt_BLOCK) {
2126 PERL_CONTEXT *cx = next - 1;
2128 switch (CxTYPE(cx)) {
2129 #if SU_HAS_PERL(5, 10, 0)
2133 #if SU_HAS_PERL(5, 11, 0)
2134 /* That's the only subcategory that can cause an extra BLOCK context */
2135 case CXt_LOOP_PLAIN:
2139 if (cx->blk_oldcop == next->blk_oldcop)
2143 if (next->blk_oldcop && OpSIBLING(next->blk_oldcop)
2144 && OpSIBLING(next->blk_oldcop)->op_type == OP_SUBST)
2153 #define su_context_here() su_context_normalize_up(su_context_skip_db(cxstack_ix))
2155 STATIC I32 su_context_gimme(pTHX_ I32 cxix) {
2156 #define su_context_gimme(C) su_context_gimme(aTHX_ (C))
2159 for (i = cxix; i >= 0; --i) {
2160 PERL_CONTEXT *cx = cxstack + i;
2162 switch (CxTYPE(cx)) {
2163 /* gimme is always G_ARRAY for loop contexts. */
2164 #if SU_HAS_PERL(5, 11, 0)
2166 case CXt_LOOP_PLAIN:
2167 case CXt_LOOP_LAZYSV:
2168 case CXt_LOOP_LAZYIV:
2173 const COP *cop = cx->blk_oldcop;
2174 if (cop && OpSIBLING(cop)) {
2175 switch (OpSIBLING(cop)->op_flags & OPf_WANT) {
2178 case OPf_WANT_SCALAR:
2197 /* --- Interpreter setup/teardown ------------------------------------------ */
2199 STATIC void su_teardown(pTHX_ void *param) {
2204 map = MY_CXT.uid_storage.map;
2207 for (i = 0; i < MY_CXT.uid_storage.used; ++i)
2212 cur = MY_CXT.uplevel_storage.root;
2214 su_uplevel_ud *prev;
2218 su_uplevel_ud_delete(prev);
2225 STATIC void su_setup(pTHX) {
2226 #define su_setup() su_setup(aTHX)
2229 MY_CXT.stack_placeholder = NULL;
2231 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
2232 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
2233 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
2234 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
2236 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
2237 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
2238 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
2240 Zero(&(MY_CXT.yield_storage.leave_op), 1, UNOP);
2241 MY_CXT.yield_storage.leave_op.op_type = OP_STUB;
2242 MY_CXT.yield_storage.leave_op.op_ppaddr = NULL;
2244 Zero(&(MY_CXT.yield_storage.proxy_op), 1, OP);
2245 MY_CXT.yield_storage.proxy_op.op_type = OP_STUB;
2246 MY_CXT.yield_storage.proxy_op.op_ppaddr = NULL;
2248 MY_CXT.uplevel_storage.top = NULL;
2249 MY_CXT.uplevel_storage.root = NULL;
2250 MY_CXT.uplevel_storage.count = 0;
2252 MY_CXT.uid_storage.map = NULL;
2253 MY_CXT.uid_storage.used = 0;
2254 MY_CXT.uid_storage.alloc = 0;
2256 call_atexit(su_teardown, NULL);
2261 /* --- XS ------------------------------------------------------------------ */
2263 #define SU_GET_CONTEXT(A, B, D) \
2272 else if (cxix > cxstack_ix) \
2280 #define SU_GET_LEVEL(A, B) \
2286 level = SvIV(lsv); \
2293 #if SU_HAS_PERL(5, 10, 0)
2294 # define SU_INFO_COUNT 11
2296 # define SU_INFO_COUNT 10
2299 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
2301 XS(XS_Scope__Upper_unwind) {
2310 PERL_UNUSED_VAR(cv); /* -W */
2311 PERL_UNUSED_VAR(ax); /* -Wall */
2313 SU_GET_CONTEXT(0, items - 1, cxstack_ix);
2315 PERL_CONTEXT *cx = cxstack + cxix;
2316 switch (CxTYPE(cx)) {
2318 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2322 MY_CXT.unwind_storage.cxix = cxix;
2323 MY_CXT.unwind_storage.items = items;
2324 MY_CXT.unwind_storage.savesp = PL_stack_sp;
2326 MY_CXT.unwind_storage.items--;
2327 MY_CXT.unwind_storage.savesp--;
2329 /* pp_entersub will want to sanitize the stack after returning from there
2330 * Screw that, we're insane!
2331 * dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
2332 if (GIMME_V == G_SCALAR)
2333 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2334 SAVEDESTRUCTOR_X(su_unwind, NULL);
2339 } while (--cxix >= 0);
2340 croak("Can't return outside a subroutine");
2343 STATIC const char su_yield_name[] = "yield";
2345 XS(XS_Scope__Upper_yield); /* prototype to pass -Wmissing-prototypes */
2347 XS(XS_Scope__Upper_yield) {
2356 PERL_UNUSED_VAR(cv); /* -W */
2357 PERL_UNUSED_VAR(ax); /* -Wall */
2359 SU_GET_CONTEXT(0, items - 1, su_context_here());
2360 MY_CXT.yield_storage.cxix = cxix;
2361 MY_CXT.yield_storage.items = items;
2362 MY_CXT.yield_storage.savesp = PL_stack_sp;
2364 MY_CXT.yield_storage.items--;
2365 MY_CXT.yield_storage.savesp--;
2367 /* See XS_Scope__Upper_unwind */
2368 if (GIMME_V == G_SCALAR)
2369 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2370 SAVEDESTRUCTOR_X(su_yield, su_yield_name);
2374 STATIC const char su_leave_name[] = "leave";
2376 XS(XS_Scope__Upper_leave); /* prototype to pass -Wmissing-prototypes */
2378 XS(XS_Scope__Upper_leave) {
2386 PERL_UNUSED_VAR(cv); /* -W */
2387 PERL_UNUSED_VAR(ax); /* -Wall */
2389 MY_CXT.yield_storage.cxix = su_context_here();
2390 MY_CXT.yield_storage.items = items;
2391 MY_CXT.yield_storage.savesp = PL_stack_sp;
2392 /* See XS_Scope__Upper_unwind */
2393 if (GIMME_V == G_SCALAR)
2394 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2395 SAVEDESTRUCTOR_X(su_yield, su_leave_name);
2399 MODULE = Scope::Upper PACKAGE = Scope::Upper
2407 MUTEX_INIT(&su_uid_seq_counter_mutex);
2409 su_uid_seq_counter.seqs = NULL;
2410 su_uid_seq_counter.size = 0;
2412 stash = gv_stashpv(__PACKAGE__, 1);
2413 newCONSTSUB(stash, "TOP", newSViv(0));
2414 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
2416 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
2417 newXSproto("Scope::Upper::yield", XS_Scope__Upper_yield, file, NULL);
2418 newXSproto("Scope::Upper::leave", XS_Scope__Upper_leave, file, NULL);
2429 su_uid_storage new_cxt;
2436 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
2440 MY_CXT.uplevel_storage.top = NULL;
2441 MY_CXT.uplevel_storage.root = NULL;
2442 MY_CXT.uplevel_storage.count = 0;
2443 MY_CXT.uid_storage = new_cxt;
2447 #endif /* SU_THREADSAFE */
2455 cxix = su_context_here();
2466 SU_GET_CONTEXT(0, 0, su_context_here());
2469 cxix = su_context_skip_db(cxix);
2470 cxix = su_context_normalize_up(cxix);
2482 SU_GET_CONTEXT(0, 0, cxstack_ix);
2484 for (; cxix >= 0; --cxix) {
2485 PERL_CONTEXT *cx = cxstack + cxix;
2486 switch (CxTYPE(cx)) {
2490 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2504 SU_GET_CONTEXT(0, 0, cxstack_ix);
2506 for (; cxix >= 0; --cxix) {
2507 PERL_CONTEXT *cx = cxstack + cxix;
2508 switch (CxTYPE(cx)) {
2525 cxix = su_context_here();
2526 while (--level >= 0) {
2530 cxix = su_context_skip_db(cxix);
2531 cxix = su_context_normalize_up(cxix);
2544 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2545 PERL_CONTEXT *cx = cxstack + cxix;
2546 switch (CxTYPE(cx)) {
2548 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2568 SU_GET_CONTEXT(0, 0, cxstack_ix);
2571 PERL_CONTEXT *cx = cxstack + cxix--;
2572 switch (CxTYPE(cx)) {
2574 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2578 I32 gimme = cx->blk_gimme;
2580 case G_VOID: XSRETURN_UNDEF; break;
2581 case G_SCALAR: XSRETURN_NO; break;
2582 case G_ARRAY: XSRETURN_YES; break;
2595 const PERL_CONTEXT *cx, *dbcx;
2598 SU_GET_CONTEXT(0, 0, su_context_skip_db(cxstack_ix));
2599 cxix = su_context_normalize_up(cxix);
2600 cx = cxstack + cxix;
2602 if (PL_DBsub && cxix && (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)) {
2603 I32 i = su_context_skip_db(cxix - 1) + 1;
2604 if (i < cxix && CxTYPE(cxstack + i) == CXt_SUB)
2607 cop = cx->blk_oldcop;
2608 EXTEND(SP, SU_INFO_COUNT);
2611 HV *stash = CopSTASH(cop);
2613 PUSHs(su_newmortal_pvn(HvNAME(stash), HvNAMELEN(stash)));
2615 PUSHs(&PL_sv_undef);
2618 PUSHs(su_newmortal_pvn(OutCopFILE(cop), OutCopFILE_len(cop)));
2620 mPUSHi(CopLINE(cop));
2621 /* subroutine (3) and has_args (4) */
2622 switch (CxTYPE(cx)) {
2625 GV *cvgv = CvGV(dbcx->blk_sub.cv);
2626 if (cvgv && isGV(cvgv)) {
2627 SV *sv = sv_newmortal();
2628 gv_efullname3(sv, cvgv, NULL);
2631 PUSHs(su_newmortal_pvs("(unknown)"));
2640 PUSHs(su_newmortal_pvs("(eval)"));
2644 PUSHs(&PL_sv_undef);
2645 PUSHs(&PL_sv_undef);
2648 switch (su_context_gimme(cxix)) {
2655 default: /* G_VOID */
2656 PUSHs(&PL_sv_undef);
2659 /* eval text (6) and is_require (7) */
2660 switch (CxTYPE(cx)) {
2662 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
2664 #if SU_HAS_PERL(5, 17, 4)
2665 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
2666 SvCUR(cx->blk_eval.cur_text)-2,
2667 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
2669 PUSHs(cx->blk_eval.cur_text);
2673 } else if (cx->blk_eval.old_namesv) {
2675 PUSHs(sv_mortalcopy(cx->blk_eval.old_namesv));
2681 /* Anything else including eval BLOCK */
2682 PUSHs(&PL_sv_undef);
2683 PUSHs(&PL_sv_undef);
2687 mPUSHi(CopHINTS_get(cop));
2691 #if SU_HAS_PERL(5, 9, 4)
2692 STRLEN *old_warnings = cop->cop_warnings;
2694 SV *old_warnings = cop->cop_warnings;
2696 if (old_warnings == pWARN_STD) {
2697 if (PL_dowarn & G_WARN_ON)
2698 goto context_info_warnings_on;
2700 #if SU_HAS_PERL(5, 17, 4)
2701 mask = &PL_sv_undef;
2703 goto context_info_warnings_off;
2705 } else if (old_warnings == pWARN_NONE) {
2706 context_info_warnings_off:
2707 mask = su_newmortal_pvn(WARN_NONEstring, WARNsize);
2708 } else if (old_warnings == pWARN_ALL) {
2710 context_info_warnings_on:
2711 #if SU_HAS_PERL(5, 8, 7)
2712 bits = get_hv("warnings::Bits", 0);
2714 SV **bits_all = hv_fetchs(bits, "all", FALSE);
2716 mask = sv_mortalcopy(*bits_all);
2720 mask = su_newmortal_pvn(WARN_ALLstring, WARNsize);
2722 #if SU_HAS_PERL(5, 9, 4)
2723 mask = su_newmortal_pvn((char *) (old_warnings + 1), old_warnings[0]);
2725 mask = sv_mortalcopy(old_warnings);
2730 #if SU_HAS_PERL(5, 10, 0)
2731 /* hints hash (10) */
2733 COPHH *hints_hash = CopHINTHASH_get(cop);
2735 SV *rhv = sv_2mortal(newRV_noinc((SV *) cophh_2hv(hints_hash, 0)));
2738 PUSHs(&PL_sv_undef);
2742 XSRETURN(SU_INFO_COUNT);
2751 SU_GET_CONTEXT(1, 1, su_context_skip_db(cxstack_ix));
2752 cxix = su_context_normalize_down(cxix);
2753 Newx(ud, 1, su_ud_reap);
2754 SU_UD_ORIGIN(ud) = NULL;
2755 SU_UD_HANDLER(ud) = su_reap;
2756 ud->cb = newSVsv(hook);
2757 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2760 localize(SV *sv, SV *val, ...)
2767 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2768 cxix = su_context_normalize_down(cxix);
2769 Newx(ud, 1, su_ud_localize);
2770 SU_UD_ORIGIN(ud) = NULL;
2771 SU_UD_HANDLER(ud) = su_localize;
2772 size = su_ud_localize_init(ud, sv, val, NULL);
2773 su_init(ud, cxix, size);
2776 localize_elem(SV *sv, SV *elem, SV *val, ...)
2783 if (SvTYPE(sv) >= SVt_PVGV)
2784 croak("Can't infer the element localization type from a glob and the value");
2785 SU_GET_CONTEXT(3, 3, su_context_skip_db(cxstack_ix));
2786 cxix = su_context_normalize_down(cxix);
2787 Newx(ud, 1, su_ud_localize);
2788 SU_UD_ORIGIN(ud) = NULL;
2789 SU_UD_HANDLER(ud) = su_localize;
2790 size = su_ud_localize_init(ud, sv, val, elem);
2791 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
2792 SU_UD_LOCALIZE_FREE(ud);
2793 croak("Can't localize an element of something that isn't an array or a hash");
2795 su_init(ud, cxix, size);
2798 localize_delete(SV *sv, SV *elem, ...)
2805 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2806 cxix = su_context_normalize_down(cxix);
2807 Newx(ud, 1, su_ud_localize);
2808 SU_UD_ORIGIN(ud) = NULL;
2809 SU_UD_HANDLER(ud) = su_localize;
2810 size = su_ud_localize_init(ud, sv, NULL, elem);
2811 su_init(ud, cxix, size);
2814 uplevel(SV *code, ...)
2817 I32 cxix, ret, args = 0;
2821 if (SvTYPE(code) < SVt_PVCV)
2822 croak("First argument to uplevel must be a code reference");
2823 SU_GET_CONTEXT(1, items - 1, cxstack_ix);
2825 PERL_CONTEXT *cx = cxstack + cxix;
2826 switch (CxTYPE(cx)) {
2828 croak("Can't uplevel to an eval frame");
2830 croak("Can't uplevel to a format frame");
2832 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2838 /* su_uplevel() takes care of extending the stack if needed. */
2839 ret = su_uplevel((CV *) code, cxix, args);
2844 } while (--cxix >= 0);
2845 croak("Can't uplevel outside a subroutine");
2854 SU_GET_CONTEXT(0, 0, su_context_here());
2855 uid = su_uid_get(cxix);
2861 validate_uid(SV *uid)
2866 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;