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 ------------------------------------------------------------- */
740 #define SU_UD_TYPE(U) (((su_ud_common *) (U))->type)
741 #define SU_UD_PRIVATE(U) (((su_ud_common *) (U))->private)
742 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
743 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
744 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
746 #define SU_UD_TYPE_REAP 0
747 #define SU_UD_TYPE_LOCALIZE 1
748 #define SU_UD_TYPE_UID 2
750 #define SU_UD_FREE(U) STMT_START { \
751 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
755 /* ... Reap ................................................................ */
757 #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))
764 #define SU_UD_REAP_CB(U) (((su_ud_reap *) (U))->cb)
766 static void su_call(pTHX_ SV *cb) {
769 PERL_CONTEXT saved_cx;
770 #endif /* SU_SAVE_LAST_CX */
775 PerlIO_printf(Perl_debug_log,
776 "@@@ call scope_ix=%2d save_ix=%2d\n",
777 PL_scopestack_ix, PL_savestack_ix);
787 /* If the recently popped context isn't saved there, it will be overwritten by
788 * the sub scope from call_sv, although it's still needed in our caller. */
789 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
790 saved_cx = cxstack[cxix];
791 #endif /* SU_SAVE_LAST_CX */
796 cxstack[cxix] = saved_cx;
797 #endif /* SU_SAVE_LAST_CX */
809 /* ... Localize & localize array/hash element .............................. */
818 #define SU_UD_LOCALIZE_SV(U) (((su_ud_localize *) (U))->sv)
819 #define SU_UD_LOCALIZE_VAL(U) (((su_ud_localize *) (U))->val)
820 #define SU_UD_LOCALIZE_ELEM(U) (((su_ud_localize *) (U))->elem)
822 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
823 SvREFCNT_dec(SU_UD_LOCALIZE_ELEM(U)); \
824 SvREFCNT_dec(SU_UD_LOCALIZE_VAL(U)); \
825 SvREFCNT_dec(SU_UD_LOCALIZE_SV(U)); \
829 static I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
830 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
835 SvREFCNT_inc_simple_void(sv);
837 if (SvTYPE(sv) >= SVt_PVGV) {
838 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
840 } else { /* local *x = \$val; */
841 t = SvTYPE(SvRV(val));
844 } else if (SvROK(sv)) {
845 croak("Invalid %s reference as the localization target",
846 sv_reftype(SvRV(sv), 0));
849 const char *p = SvPV_const(sv, len), *s;
850 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
856 case '$': t = SVt_PV; break;
857 case '@': t = SVt_PVAV; break;
858 case '%': t = SVt_PVHV; break;
859 case '&': t = SVt_PVCV; break;
860 case '*': t = SVt_PVGV; break;
865 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
866 if (SvROK(val) && !sv_isobject(val)) {
867 t = SvTYPE(SvRV(val));
879 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
884 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
889 size = SU_SAVE_GP_SIZE;
893 size = SU_SAVE_GVCV_SIZE;
897 size = SU_SAVE_SCALAR_SIZE;
900 /* When deref is set, val isn't NULL */
902 SU_UD_PRIVATE(ud) = t;
905 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
906 ud->elem = SvREFCNT_inc(elem);
911 static void su_localize(pTHX_ void *ud_) {
912 #define su_localize(U) su_localize(aTHX_ (U))
913 su_ud_localize *ud = (su_ud_localize *) ud_;
917 svtype t = SU_UD_PRIVATE(ud);
920 if (SvTYPE(sv) >= SVt_PVGV) {
924 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
927 const char *name = SvPV_const(sv, len);
928 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
935 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
936 PerlIO_printf(Perl_debug_log,
937 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
938 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
942 /* Inspired from Alias.pm */
946 su_save_aelem(GvAV(gv), elem, val);
953 su_save_helem(GvHV(gv), elem, val);
959 save_gp(gv, 1); /* hide previous entry in symtab */
965 gv = (GV *) save_scalar(gv);
970 SvSetMagicSV((SV *) gv, val);
975 /* ... Unique context ID ................................................... */
982 #define SU_UD_UID_UID(U) (((su_ud_uid *) (U))->uid)
984 static void su_uid_drop(pTHX_ void *ud_) {
987 uid->flags &= ~SU_UID_ACTIVE;
992 /* --- Pop a context back -------------------------------------------------- */
995 # define SU_CXNAME(C) PL_block_type[CxTYPE(C)]
997 # if SU_HAS_PERL(5, 11, 0)
998 static const char *su_block_type[] = {
1012 # elif SU_HAS_PERL(5, 9, 3)
1013 static const char *su_block_type[] = {
1028 static const char *su_block_type[] = {
1037 # define SU_CXNAME(C) su_block_type[CxTYPE(C)]
1040 static void su_pop(pTHX_ void *ud) {
1041 #define su_pop(U) su_pop(aTHX_ (U))
1042 I32 depth, base, mark, *origin;
1043 depth = SU_UD_DEPTH(ud);
1046 PerlIO_printf(Perl_debug_log,
1047 "%p: --- pop a %s\n"
1048 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
1049 ud, SU_CXNAME(cxstack + cxstack_ix),
1050 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
1053 origin = SU_UD_ORIGIN(ud);
1054 mark = origin[depth];
1055 base = origin[depth - 1];
1057 SU_D(PerlIO_printf(Perl_debug_log,
1058 "%p: original scope was %*c top=%2d base=%2d\n",
1059 ud, 24, ' ', mark, base));
1062 #if SU_HAS_PERL(5, 19, 4)
1067 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
1069 #if SU_HAS_PERL(5, 19, 4)
1070 cx = cxstack + cxstack_ix;
1071 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1072 save = PL_scopestack[cx->blk_oldscopesp - 1];
1075 PL_savestack_ix = mark;
1078 #if SU_HAS_PERL(5, 19, 4)
1079 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1080 PL_scopestack[cx->blk_oldscopesp - 1] = save;
1083 PL_savestack_ix = base;
1085 SU_UD_DEPTH(ud) = --depth;
1090 if ((pad = SU_UD_PAD(ud)) > 0) {
1093 SU_D(PerlIO_printf(Perl_debug_log,
1094 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
1095 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1096 SU_SAVE_PLACEHOLDER();
1100 SU_D(PerlIO_printf(Perl_debug_log,
1101 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
1102 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1103 SAVEDESTRUCTOR_X(su_pop, ud);
1105 switch (SU_UD_TYPE(ud)) {
1106 case SU_UD_TYPE_REAP: {
1108 PerlIO_printf(Perl_debug_log,
1109 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
1110 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
1112 SAVEDESTRUCTOR_X(su_call, SU_UD_REAP_CB(ud));
1116 case SU_UD_TYPE_LOCALIZE:
1118 SU_UD_LOCALIZE_FREE(ud);
1120 case SU_UD_TYPE_UID:
1121 SAVEDESTRUCTOR_X(su_uid_drop, SU_UD_UID_UID(ud));
1127 SU_D(PerlIO_printf(Perl_debug_log,
1128 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
1129 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
1132 /* --- Initialize the stack and the action userdata ------------------------ */
1134 static I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
1135 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
1136 I32 i, depth, offset, base, *origin;
1139 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
1141 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
1144 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
1145 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
1146 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
1149 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
1151 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
1152 ud, size, pad, offset));
1154 depth = PL_scopestack_ix - cxstack[cxix].blk_oldscopesp;
1155 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
1157 Newx(origin, depth + 1, I32);
1158 base = PL_scopestack_ix - depth;
1159 origin[0] = PL_scopestack[base];
1160 PL_scopestack[base] += size;
1161 for (i = 1; i < depth; ++i) {
1163 origin[i] = PL_scopestack[j];
1164 PL_scopestack[j] += offset;
1166 origin[depth] = PL_savestack_ix;
1168 SU_UD_PAD(ud) = pad;
1169 SU_UD_DEPTH(ud) = depth;
1170 SU_UD_ORIGIN(ud) = origin;
1172 /* Make sure the first destructor fires by pushing enough fake slots on the
1174 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1175 <= PL_scopestack[PL_scopestack_ix - 1]) {
1178 SU_D(PerlIO_printf(Perl_debug_log,
1179 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1180 ud, PL_scopestack_ix, PL_savestack_ix));
1181 SU_SAVE_PLACEHOLDER();
1182 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1183 <= PL_scopestack[PL_scopestack_ix - 1]);
1185 SU_D(PerlIO_printf(Perl_debug_log,
1186 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1187 ud, PL_scopestack_ix, PL_savestack_ix));
1188 SAVEDESTRUCTOR_X(su_pop, ud);
1191 for (i = 0; i <= depth; ++i) {
1192 I32 j = PL_scopestack_ix - i;
1193 PerlIO_printf(Perl_debug_log,
1194 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1195 ud, i, j, origin[depth - i],
1196 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1203 /* --- Unwind stack -------------------------------------------------------- */
1205 static void su_unwind(pTHX_ void *ud_) {
1207 I32 cxix = MY_CXT.unwind_storage.cxix;
1208 I32 items = MY_CXT.unwind_storage.items;
1211 PERL_UNUSED_VAR(ud_);
1213 PL_stack_sp = MY_CXT.unwind_storage.savesp;
1214 #if SU_HAS_PERL(5, 19, 4)
1217 SV **sp = PL_stack_sp;
1218 for (i = -items + 1; i <= 0; ++i)
1220 sv_2mortal(SvREFCNT_inc(sp[i]));
1224 if (cxstack_ix > cxix)
1227 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1228 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1231 I32 gimme = GIMME_V;
1232 PerlIO_printf(Perl_debug_log,
1233 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1235 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1236 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1239 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1240 PL_op = PL_op->op_ppaddr(aTHX);
1242 *PL_markstack_ptr = mark;
1244 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1245 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1248 /* --- Yield --------------------------------------------------------------- */
1250 #if SU_HAS_PERL(5, 10, 0)
1251 # define SU_RETOP_SUB(C) ((C)->blk_sub.retop)
1252 # define SU_RETOP_EVAL(C) ((C)->blk_eval.retop)
1253 # define SU_RETOP_LOOP(C) ((C)->blk_loop.my_op->op_lastop->op_next)
1254 # define SU_RETOP_GIVEN(C) ((C)->blk_givwhen.leave_op->op_next)
1256 # define SU_RETOP_SUB(C) ((C)->blk_oldretsp > 0 ? PL_retstack[(C)->blk_oldretsp - 1] : NULL)
1257 # define SU_RETOP_EVAL(C) SU_RETOP_SUB(C)
1258 # define SU_RETOP_LOOP(C) ((C)->blk_loop.last_op->op_next)
1261 static void su_yield(pTHX_ void *ud_) {
1264 const char *which = ud_;
1265 I32 cxix = MY_CXT.yield_storage.cxix;
1266 I32 items = MY_CXT.yield_storage.items;
1267 opcode type = OP_NULL;
1271 PERL_UNUSED_VAR(ud_);
1273 cx = cxstack + cxix;
1274 switch (CxTYPE(cx)) {
1276 I32 i, cur = cxstack_ix, n = 1;
1278 /* Is this actually a given/when block? This may occur only when yield was
1279 * called with HERE (or nothing) as the context. */
1280 #if SU_HAS_PERL(5, 10, 0)
1282 PERL_CONTEXT *prev = cx - 1;
1283 U8 prev_type = CxTYPE(prev);
1284 if ((prev_type == CXt_GIVEN || prev_type == CXt_WHEN)
1285 && (prev->blk_oldcop == cx->blk_oldcop)) {
1288 if (prev_type == CXt_GIVEN)
1297 /* Bare blocks (that appear as do { ... } blocks, map { ... } blocks or
1298 * constant folded blcoks) don't need to save the op to return to anywhere
1299 * since 'last' isn't supposed to work inside them. So we climb higher in
1300 * the context stack until we reach a context that has a return op (i.e. a
1301 * sub, an eval, a format or a real loop), recording how many blocks we
1302 * crossed. Then we follow the op_next chain until we get to the leave op
1303 * that closes the original block, which we are assured to reach since
1304 * everything is static (the blocks we have crossed cannot be evals or
1305 * subroutine calls). */
1306 for (i = cxix + 1; i <= cur; ++i) {
1307 PERL_CONTEXT *cx2 = cxstack + i;
1308 switch (CxTYPE(cx2)) {
1314 o = SU_RETOP_SUB(cx2);
1317 o = SU_RETOP_EVAL(cx2);
1319 #if SU_HAS_PERL(5, 11, 0)
1321 case CXt_LOOP_PLAIN:
1322 case CXt_LOOP_LAZYSV:
1323 case CXt_LOOP_LAZYIV:
1327 o = SU_RETOP_LOOP(cx2);
1336 /* We may find other enter/leave blocks on our way to the matching leave.
1337 * Make sure the depth is incremented/decremented appropriately. */
1338 if (o->op_type == OP_ENTER) {
1340 } else if (o->op_type == OP_LEAVE) {
1354 next = SU_RETOP_SUB(cx);
1357 type = CxTRYBLOCK(cx) ? OP_LEAVETRY : OP_LEAVEEVAL;
1358 next = SU_RETOP_EVAL(cx);
1360 #if SU_HAS_PERL(5, 11, 0)
1362 case CXt_LOOP_PLAIN:
1363 case CXt_LOOP_LAZYSV:
1364 case CXt_LOOP_LAZYIV:
1368 type = OP_LEAVELOOP;
1369 next = SU_RETOP_LOOP(cx);
1371 #if SU_HAS_PERL(5, 10, 0)
1374 type = OP_LEAVEGIVEN;
1375 next = SU_RETOP_GIVEN(cx);
1379 #if SU_HAS_PERL(5, 15, 1)
1380 type = OP_LEAVEWHEN;
1383 flags |= OPf_SPECIAL;
1389 croak("%s() can't target a substitution context", which);
1392 croak("%s() doesn't know how to leave a %s context",
1393 which, SU_CXNAME(cxstack + cxix));
1397 PL_stack_sp = MY_CXT.yield_storage.savesp;
1398 #if SU_HAS_PERL(5, 19, 4)
1401 SV **sp = PL_stack_sp;
1402 for (i = -items + 1; i <= 0; ++i)
1404 sv_2mortal(SvREFCNT_inc(sp[i]));
1408 if (cxstack_ix > cxix)
1411 /* Copy the arguments passed to yield() where the leave op expects to find
1414 Move(PL_stack_sp - items + 1, PL_stack_base + cx->blk_oldsp + 1, items, SV *);
1415 PL_stack_sp = PL_stack_base + cx->blk_oldsp + items;
1417 flags |= OP_GIMME_REVERSE(cx->blk_gimme);
1419 MY_CXT.yield_storage.leave_op.op_type = type;
1420 MY_CXT.yield_storage.leave_op.op_ppaddr = PL_ppaddr[type];
1421 MY_CXT.yield_storage.leave_op.op_flags = flags;
1422 MY_CXT.yield_storage.leave_op.op_next = next;
1424 PL_op = (OP *) &(MY_CXT.yield_storage.leave_op);
1425 PL_op = PL_op->op_ppaddr(aTHX);
1427 MY_CXT.yield_storage.proxy_op.op_next = PL_op;
1428 PL_op = &(MY_CXT.yield_storage.proxy_op);
1431 /* --- Uplevel ------------------------------------------------------------- */
1433 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1434 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1436 static su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1437 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1442 sud = MY_CXT.uplevel_storage.root;
1444 MY_CXT.uplevel_storage.root = sud->next;
1445 MY_CXT.uplevel_storage.count--;
1447 sud = su_uplevel_ud_new();
1450 sud->next = MY_CXT.uplevel_storage.top;
1451 MY_CXT.uplevel_storage.top = sud;
1453 depth = su_uid_depth(cxix);
1454 su_uid_storage_dup(&sud->tmp_uid_storage, &MY_CXT.uid_storage, depth);
1455 sud->old_uid_storage = MY_CXT.uid_storage;
1456 MY_CXT.uid_storage = sud->tmp_uid_storage;
1461 #if SU_HAS_PERL(5, 13, 7)
1463 static void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1464 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1467 sud->tmp_uid_storage = MY_CXT.uid_storage;
1468 MY_CXT.uid_storage = sud->old_uid_storage;
1472 map = sud->tmp_uid_storage.map;
1473 alloc = sud->tmp_uid_storage.alloc;
1474 for (i = 0; i < alloc; ++i) {
1476 map[i]->flags &= SU_UID_ACTIVE;
1479 MY_CXT.uplevel_storage.top = sud->next;
1481 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1482 su_uplevel_ud_delete(sud);
1484 sud->next = MY_CXT.uplevel_storage.root;
1485 MY_CXT.uplevel_storage.root = sud;
1486 MY_CXT.uplevel_storage.count++;
1492 static int su_uplevel_goto_static(const OP *o) {
1493 for (; o; o = OpSIBLING(o)) {
1494 /* goto ops are unops with kids. */
1495 if (!(o->op_flags & OPf_KIDS))
1498 switch (o->op_type) {
1501 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1506 if (su_uplevel_goto_static(((const UNOP *) o)->op_first))
1515 #if SU_UPLEVEL_HIJACKS_RUNOPS
1517 static int su_uplevel_goto_runops(pTHX) {
1518 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1524 if (op->op_type == OP_GOTO) {
1525 AV *argarray = NULL;
1528 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1529 const PERL_CONTEXT *cx = cxstack + cxix;
1531 switch (CxTYPE(cx)) {
1533 if (CxHASARGS(cx)) {
1534 argarray = cx->blk_sub.argarray;
1550 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1551 AV *args = GvAV(PL_defgv);
1552 I32 items = AvFILLp(args);
1554 av_extend(argarray, items);
1555 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1556 AvFILLp(argarray) = items;
1561 PL_op = op = op->op_ppaddr(aTHX);
1563 #if !SU_HAS_PERL(5, 13, 0)
1573 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1575 #define su_at_underscore(C) PadARRAY(PadlistARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1577 static void su_uplevel_restore(pTHX_ void *sus_) {
1578 su_uplevel_ud *sud = sus_;
1579 PERL_SI *cur = sud->old_curstackinfo;
1580 PERL_SI *si = sud->si;
1582 #if SU_UPLEVEL_HIJACKS_RUNOPS
1583 if (PL_runops == su_uplevel_goto_runops)
1584 PL_runops = sud->old_runops;
1587 if (sud->callback) {
1588 PERL_CONTEXT *cx = cxstack + sud->cxix;
1589 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1591 /* We have to fix the pad entry for @_ in the original callback because it
1592 * may have been reified. */
1593 if (AvREAL(argarray)) {
1594 const I32 fill = AvFILLp(argarray);
1595 SvREFCNT_dec(argarray);
1597 AvREAL_off(argarray);
1598 AvREIFY_on(argarray);
1599 av_extend(argarray, fill);
1600 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1602 CLEAR_ARGARRAY(argarray);
1605 /* If the old cv member is our renamed CV, it means that this place has been
1606 * reached without a goto() happening, and the old argarray member is
1607 * actually our fake argarray. Destroy it properly in that case. */
1608 if (cx->blk_sub.cv == sud->renamed) {
1609 SvREFCNT_dec(cx->blk_sub.argarray);
1610 cx->blk_sub.argarray = argarray;
1613 CvDEPTH(sud->callback)--;
1614 SvREFCNT_dec(sud->callback);
1617 /* Free the renamed CV. We must do it ourselves so that we can force the
1618 * depth to be 0, or perl would complain about it being "still in use".
1619 * But we *know* that it cannot be so. */
1621 if (!CvISXSUB(sud->renamed)) {
1622 CvDEPTH(sud->renamed) = 0;
1623 CvPADLIST(sud->renamed) = NULL;
1625 SvREFCNT_dec(sud->renamed);
1628 CATCH_SET(sud->old_catch);
1630 SU_UPLEVEL_RESTORE(op);
1632 /* stack_grow() wants PL_curstack so restore the old stack first */
1633 if (PL_curstackinfo == si) {
1634 PL_curstack = cur->si_stack;
1635 if (sud->old_mainstack)
1636 SU_UPLEVEL_RESTORE(mainstack);
1637 SU_UPLEVEL_RESTORE(curstackinfo);
1640 CV *target = sud->target;
1643 /* When we die, the depth of the target CV is not updated because of the
1644 * stack switcheroo. So we have to look at all the frames between the
1645 * uplevel call and the catch block to count how many call frames to the
1646 * target CV were skipped. */
1647 for (i = cur->si_cxix; i > sud->cxix; i--) {
1648 register const PERL_CONTEXT *cx = cxstack + i;
1650 if (CxTYPE(cx) == CXt_SUB) {
1651 if (cx->blk_sub.cv == target)
1656 /* If we died, the replacement stack was already unwinded to the first
1657 * eval frame, and all the contexts down there were popped. We don't have
1658 * to pop manually any context of the original stack, because they must
1659 * have been in the replacement stack as well (since the second was copied
1660 * from the first). Thus we only have to make sure the original stack index
1661 * points to the context just below the first eval scope under the target
1663 for (; i >= 0; i--) {
1664 register const PERL_CONTEXT *cx = cxstack + i;
1666 switch (CxTYPE(cx)) {
1668 if (cx->blk_sub.cv == target)
1680 CvDEPTH(target) = sud->target_depth - levels;
1681 PL_curstackinfo->si_cxix = i - 1;
1683 #if !SU_HAS_PERL(5, 13, 1)
1684 /* Since $@ was maybe localized between the target frame and the uplevel
1685 * call, we forcefully flush the save stack to get rid of it and then
1686 * reset $@ to its proper value. Note that the the call to
1687 * su_uplevel_restore() must happen before the "reset $@" item of the save
1688 * stack is processed, as uplevel was called after the localization.
1689 * Andrew's changes to how $@ was handled, which were mainly integrated
1690 * between perl 5.13.0 and 5.13.1, fixed this. */
1691 if (ERRSV && SvTRUE(ERRSV)) {
1692 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1693 SV *errsv = SvREFCNT_inc(ERRSV);
1694 PL_scopestack_ix = cx->blk_oldscopesp;
1695 leave_scope(PL_scopestack[PL_scopestack_ix]);
1696 sv_setsv(ERRSV, errsv);
1697 SvREFCNT_dec(errsv);
1703 SU_UPLEVEL_RESTORE(curcop);
1705 SvREFCNT_dec(sud->target);
1707 PL_stack_base = AvARRAY(cur->si_stack);
1708 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1709 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1711 /* When an exception is thrown from the uplevel'd subroutine,
1712 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1713 * die_where() in more recent perls), which has the sad habit of keeping a
1714 * pointer to the current context frame across this call. This means that we
1715 * can't free the temporary context stack we used for the uplevel call right
1716 * now, or that pointer upwards would point to garbage. */
1717 #if SU_HAS_PERL(5, 13, 7)
1718 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1719 * public in perl 5.13.7. */
1720 su_uplevel_storage_delete(sud);
1722 /* Otherwise, we just enqueue it back in the global storage list. */
1726 sud->tmp_uid_storage = MY_CXT.uid_storage;
1727 MY_CXT.uid_storage = sud->old_uid_storage;
1729 MY_CXT.uplevel_storage.top = sud->next;
1730 sud->next = MY_CXT.uplevel_storage.root;
1731 MY_CXT.uplevel_storage.root = sud;
1732 MY_CXT.uplevel_storage.count++;
1739 static CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1740 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1744 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1746 CvFLAGS(cv) = CvFLAGS(proto);
1748 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1750 CvDEPTH(cv) = CvDEPTH(proto);
1752 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1754 CvFILE(cv) = CvFILE(proto);
1758 #if SU_RELEASE && SU_HAS_PERL_EXACT(5, 21, 4)
1761 CvSTASH_set(cv, CvSTASH(proto));
1762 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1763 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1764 * (which was part of perl 5.13.7). */
1765 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1767 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1770 if (CvISXSUB(proto)) {
1771 CvXSUB(cv) = CvXSUB(proto);
1772 CvXSUBANY(cv) = CvXSUBANY(proto);
1775 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1777 CvSTART(cv) = CvSTART(proto);
1778 CvPADLIST(cv) = CvPADLIST(proto);
1780 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1781 #ifdef CVf_WEAKOUTSIDE
1782 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1784 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1785 #ifdef CvOUTSIDE_SEQ
1786 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1790 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1800 static I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1801 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1803 const PERL_CONTEXT *cx = cxstack + cxix;
1805 PERL_SI *cur = PL_curstackinfo;
1811 I32 old_mark, new_mark;
1818 /* Make PL_stack_sp point just before the CV. */
1819 PL_stack_sp -= args + 1;
1820 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1823 sud = su_uplevel_storage_new(cxix);
1827 sud->callback = NULL;
1828 sud->renamed = NULL;
1829 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1833 si->si_type = cur->si_type;
1835 si->si_prev = cur->si_prev;
1837 si->si_markoff = cx->blk_oldmarksp;
1840 /* Allocate enough space for all the elements of the original stack up to the
1841 * target context, plus the forthcoming arguments. */
1842 new_mark = cx->blk_oldsp;
1843 av_extend(si->si_stack, new_mark + 1 + args + 1);
1844 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1845 AvFILLp(si->si_stack) = new_mark;
1846 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1848 /* Specialized SWITCHSTACK() */
1849 PL_stack_base = AvARRAY(si->si_stack);
1850 old_stack_sp = PL_stack_sp;
1851 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1852 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1855 /* Copy the context stack up to the context just below the target. */
1856 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1857 if (si->si_cxmax < cxix) {
1858 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1859 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1860 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1862 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1863 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1865 target = cx->blk_sub.cv;
1866 sud->target = (CV *) SvREFCNT_inc(target);
1867 sud->target_depth = CvDEPTH(target);
1869 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1870 * run-time implication, since PL_curcop will be overwritten as soon as we
1871 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1872 * make it point to the blk_oldcop for the target frame, so that caller()
1873 * reports the right file name, line number and lexical hints. */
1874 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1875 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1876 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1878 SU_UPLEVEL_SAVE(curstackinfo, si);
1879 /* If those two are equal, we need to fool POPSTACK_TO() */
1880 if (PL_mainstack == PL_curstack)
1881 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1883 sud->old_mainstack = NULL;
1884 PL_curstack = si->si_stack;
1886 renamed = su_cv_clone(callback, CvGV(target));
1887 sud->renamed = renamed;
1890 /* Both SP and old_stack_sp point just before the CV. */
1891 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1893 PUSHs((SV *) renamed);
1896 Zero(&sub_op, 1, UNOP);
1897 sub_op.op_type = OP_ENTERSUB;
1898 sub_op.op_next = NULL;
1899 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1901 sub_op.op_flags |= OPpENTERSUB_DB;
1903 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1905 #if SU_UPLEVEL_HIJACKS_RUNOPS
1906 sud->old_runops = PL_runops;
1909 sud->old_catch = CATCH_GET;
1912 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1913 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1915 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1918 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1919 CvDEPTH(callback)++;
1921 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1922 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1923 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1924 * with what we put on the stack. But we want to fake up the same arguments
1925 * as the ones in use at the context we uplevel to, so we replace the
1926 * argarray with an unreal copy of the original @_. */
1930 av_extend(av, AvMAX(cx->blk_sub.argarray));
1931 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1932 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1933 sub_cx->blk_sub.argarray = av;
1935 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1938 if (su_uplevel_goto_static(CvROOT(renamed))) {
1939 #if SU_UPLEVEL_HIJACKS_RUNOPS
1940 if (PL_runops != PL_runops_std) {
1941 if (PL_runops == PL_runops_dbg) {
1943 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1944 } else if (PL_runops != su_uplevel_goto_runops)
1945 croak("uplevel() can't execute code that calls goto with a custom runloop");
1948 PL_runops = su_uplevel_goto_runops;
1949 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1950 croak("uplevel() can't execute code that calls goto before perl 5.8");
1951 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1959 ret = PL_stack_sp - (PL_stack_base + new_mark);
1961 AV *old_stack = sud->old_curstackinfo->si_stack;
1963 if (old_mark + ret > AvMAX(old_stack)) {
1964 /* Specialized EXTEND(old_sp, ret) */
1965 av_extend(old_stack, old_mark + ret + 1);
1966 old_stack_sp = AvARRAY(old_stack) + old_mark;
1969 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1971 AvFILLp(old_stack) += ret;
1979 /* --- Unique context ID --------------------------------------------------- */
1981 static su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1982 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1987 map = MY_CXT.uid_storage.map;
1988 alloc = MY_CXT.uid_storage.alloc;
1990 if (depth >= alloc) {
1993 Renew(map, depth + 1, su_uid *);
1994 for (i = alloc; i <= depth; ++i)
1997 MY_CXT.uid_storage.map = map;
1998 MY_CXT.uid_storage.alloc = depth + 1;
2004 Newx(uid, 1, su_uid);
2010 if (depth >= MY_CXT.uid_storage.used)
2011 MY_CXT.uid_storage.used = depth + 1;
2016 static int su_uid_storage_check(pTHX_ UV depth, UV seq) {
2017 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
2021 if (depth >= MY_CXT.uid_storage.used)
2024 uid = MY_CXT.uid_storage.map[depth];
2026 return uid && (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
2029 static SV *su_uid_get(pTHX_ I32 cxix) {
2030 #define su_uid_get(I) su_uid_get(aTHX_ (I))
2035 depth = su_uid_depth(cxix);
2036 uid = su_uid_storage_fetch(depth);
2038 if (!(uid->flags & SU_UID_ACTIVE)) {
2041 uid->seq = su_uid_seq_next(depth);
2042 uid->flags |= SU_UID_ACTIVE;
2044 Newx(ud, 1, su_ud_uid);
2045 SU_UD_TYPE(ud) = SU_UD_TYPE_UID;
2047 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2050 uid_sv = sv_newmortal();
2051 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
2057 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
2059 #else /* grok_number */
2061 #define IS_NUMBER_IN_UV 0x1
2063 static int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
2064 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
2068 /* This crude check should be good enough for a fallback implementation.
2069 * Better be too strict than too lax. */
2070 for (i = 0; i < len; ++i) {
2075 tmpsv = sv_newmortal();
2076 sv_setpvn(tmpsv, s, len);
2077 *valuep = sv_2uv(tmpsv);
2079 return IS_NUMBER_IN_UV;
2082 #endif /* !grok_number */
2084 static int su_uid_validate(pTHX_ SV *uid) {
2085 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
2091 s = SvPV_const(uid, len);
2093 while (p < len && s[p] != '-')
2096 croak("UID contains only one part");
2098 type = su_grok_number(s, p, &depth);
2099 if (type != IS_NUMBER_IN_UV)
2100 croak("First UID part is not an unsigned integer");
2102 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
2104 type = su_grok_number(s + p, len - p, &seq);
2105 if (type != IS_NUMBER_IN_UV)
2106 croak("Second UID part is not an unsigned integer");
2108 return su_uid_storage_check(depth, seq);
2111 /* --- Context operations -------------------------------------------------- */
2113 /* Remove sequences of BLOCKs having DB for stash, followed by a SUB context
2114 * for the debugger callback. */
2116 static I32 su_context_skip_db(pTHX_ I32 cxix) {
2117 #define su_context_skip_db(C) su_context_skip_db(aTHX_ (C))
2123 for (i = cxix; i > 0; --i) {
2124 PERL_CONTEXT *cx = cxstack + i;
2126 switch (CxTYPE(cx)) {
2127 #if SU_HAS_PERL(5, 17, 1)
2128 case CXt_LOOP_PLAIN:
2131 if (cx->blk_oldcop && CopSTASH(cx->blk_oldcop) == GvSTASH(PL_DBgv))
2135 if (cx->blk_sub.cv == GvCV(PL_DBsub)) {
2151 static I32 su_context_normalize_up(pTHX_ I32 cxix) {
2152 #define su_context_normalize_up(C) su_context_normalize_up(aTHX_ (C))
2158 cx = cxstack + cxix;
2159 if (CxTYPE(cx) == CXt_BLOCK) {
2160 PERL_CONTEXT *prev = cx - 1;
2162 switch (CxTYPE(prev)) {
2163 #if SU_HAS_PERL(5, 10, 0)
2167 #if SU_HAS_PERL(5, 11, 0)
2168 /* That's the only subcategory that can cause an extra BLOCK context */
2169 case CXt_LOOP_PLAIN:
2173 if (cx->blk_oldcop == prev->blk_oldcop)
2177 if (cx->blk_oldcop && OpSIBLING(cx->blk_oldcop)
2178 && OpSIBLING(cx->blk_oldcop)->op_type == OP_SUBST)
2187 static I32 su_context_normalize_down(pTHX_ I32 cxix) {
2188 #define su_context_normalize_down(C) su_context_normalize_down(aTHX_ (C))
2191 if (cxix >= cxstack_ix)
2194 next = cxstack + cxix + 1;
2195 if (CxTYPE(next) == CXt_BLOCK) {
2196 PERL_CONTEXT *cx = next - 1;
2198 switch (CxTYPE(cx)) {
2199 #if SU_HAS_PERL(5, 10, 0)
2203 #if SU_HAS_PERL(5, 11, 0)
2204 /* That's the only subcategory that can cause an extra BLOCK context */
2205 case CXt_LOOP_PLAIN:
2209 if (cx->blk_oldcop == next->blk_oldcop)
2213 if (next->blk_oldcop && OpSIBLING(next->blk_oldcop)
2214 && OpSIBLING(next->blk_oldcop)->op_type == OP_SUBST)
2223 #define su_context_here() su_context_normalize_up(su_context_skip_db(cxstack_ix))
2225 static I32 su_context_gimme(pTHX_ I32 cxix) {
2226 #define su_context_gimme(C) su_context_gimme(aTHX_ (C))
2229 for (i = cxix; i >= 0; --i) {
2230 PERL_CONTEXT *cx = cxstack + i;
2232 switch (CxTYPE(cx)) {
2233 /* gimme is always G_ARRAY for loop contexts. */
2234 #if SU_HAS_PERL(5, 11, 0)
2236 case CXt_LOOP_PLAIN:
2237 case CXt_LOOP_LAZYSV:
2238 case CXt_LOOP_LAZYIV:
2243 const COP *cop = cx->blk_oldcop;
2244 if (cop && OpSIBLING(cop)) {
2245 switch (OpSIBLING(cop)->op_flags & OPf_WANT) {
2248 case OPf_WANT_SCALAR:
2267 /* --- Global setup/teardown ----------------------------------------------- */
2269 static VOL U32 su_initialized = 0;
2271 static void su_global_teardown(pTHX_ void *root) {
2272 if (!su_initialized)
2280 SU_LOCK(&su_uid_seq_counter_mutex);
2281 PerlMemShared_free(su_uid_seq_counter.seqs);
2282 su_uid_seq_counter.size = 0;
2283 SU_UNLOCK(&su_uid_seq_counter_mutex);
2285 MUTEX_DESTROY(&su_uid_seq_counter_mutex);
2292 XS(XS_Scope__Upper_unwind);
2293 XS(XS_Scope__Upper_yield);
2294 XS(XS_Scope__Upper_leave);
2296 #if SU_HAS_PERL(5, 9, 0)
2297 # define SU_XS_FILE_TYPE const char
2299 # define SU_XS_FILE_TYPE char
2302 static void su_global_setup(pTHX_ SU_XS_FILE_TYPE *file) {
2303 #define su_global_setup(F) su_global_setup(aTHX_ (F))
2309 MUTEX_INIT(&su_uid_seq_counter_mutex);
2311 SU_LOCK(&su_uid_seq_counter_mutex);
2312 su_uid_seq_counter.seqs = NULL;
2313 su_uid_seq_counter.size = 0;
2314 SU_UNLOCK(&su_uid_seq_counter_mutex);
2316 stash = gv_stashpv(__PACKAGE__, 1);
2317 newCONSTSUB(stash, "TOP", newSViv(0));
2318 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
2320 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
2321 newXSproto("Scope::Upper::yield", XS_Scope__Upper_yield, file, NULL);
2322 newXSproto("Scope::Upper::leave", XS_Scope__Upper_leave, file, NULL);
2325 call_atexit(su_global_teardown, aTHX);
2327 call_atexit(su_global_teardown, NULL);
2335 /* --- Interpreter setup/teardown ------------------------------------------ */
2337 static void su_local_teardown(pTHX_ void *param) {
2342 map = MY_CXT.uid_storage.map;
2345 for (i = 0; i < MY_CXT.uid_storage.used; ++i)
2350 cur = MY_CXT.uplevel_storage.root;
2352 su_uplevel_ud *prev;
2356 su_uplevel_ud_delete(prev);
2363 static void su_local_setup(pTHX) {
2364 #define su_local_setup() su_local_setup(aTHX)
2367 MY_CXT.stack_placeholder = NULL;
2369 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
2370 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
2371 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
2372 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
2374 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
2375 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
2376 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
2378 Zero(&(MY_CXT.yield_storage.leave_op), 1, UNOP);
2379 MY_CXT.yield_storage.leave_op.op_type = OP_STUB;
2380 MY_CXT.yield_storage.leave_op.op_ppaddr = NULL;
2382 Zero(&(MY_CXT.yield_storage.proxy_op), 1, OP);
2383 MY_CXT.yield_storage.proxy_op.op_type = OP_STUB;
2384 MY_CXT.yield_storage.proxy_op.op_ppaddr = NULL;
2386 MY_CXT.uplevel_storage.top = NULL;
2387 MY_CXT.uplevel_storage.root = NULL;
2388 MY_CXT.uplevel_storage.count = 0;
2390 MY_CXT.uid_storage.map = NULL;
2391 MY_CXT.uid_storage.used = 0;
2392 MY_CXT.uid_storage.alloc = 0;
2394 call_atexit(su_local_teardown, NULL);
2399 /* --- XS ------------------------------------------------------------------ */
2401 #define SU_GET_CONTEXT(A, B, D) \
2410 else if (cxix > cxstack_ix) \
2418 #define SU_GET_LEVEL(A, B) \
2424 level = SvIV(lsv); \
2431 #if SU_HAS_PERL(5, 10, 0)
2432 # define SU_INFO_COUNT 11
2434 # define SU_INFO_COUNT 10
2437 XS(XS_Scope__Upper_unwind) {
2446 PERL_UNUSED_VAR(cv); /* -W */
2447 PERL_UNUSED_VAR(ax); /* -Wall */
2449 SU_GET_CONTEXT(0, items - 1, cxstack_ix);
2451 PERL_CONTEXT *cx = cxstack + cxix;
2452 switch (CxTYPE(cx)) {
2454 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2458 MY_CXT.unwind_storage.cxix = cxix;
2459 MY_CXT.unwind_storage.items = items;
2460 MY_CXT.unwind_storage.savesp = PL_stack_sp;
2462 MY_CXT.unwind_storage.items--;
2463 MY_CXT.unwind_storage.savesp--;
2465 /* pp_entersub will want to sanitize the stack after returning from there
2466 * Screw that, we're insane!
2467 * dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
2468 if (GIMME_V == G_SCALAR)
2469 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2470 SAVEDESTRUCTOR_X(su_unwind, NULL);
2475 } while (--cxix >= 0);
2476 croak("Can't return outside a subroutine");
2479 static const char su_yield_name[] = "yield";
2481 XS(XS_Scope__Upper_yield) {
2490 PERL_UNUSED_VAR(cv); /* -W */
2491 PERL_UNUSED_VAR(ax); /* -Wall */
2493 SU_GET_CONTEXT(0, items - 1, su_context_here());
2494 MY_CXT.yield_storage.cxix = cxix;
2495 MY_CXT.yield_storage.items = items;
2496 MY_CXT.yield_storage.savesp = PL_stack_sp;
2498 MY_CXT.yield_storage.items--;
2499 MY_CXT.yield_storage.savesp--;
2501 /* See XS_Scope__Upper_unwind */
2502 if (GIMME_V == G_SCALAR)
2503 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2504 SAVEDESTRUCTOR_X(su_yield, su_yield_name);
2508 static const char su_leave_name[] = "leave";
2510 XS(XS_Scope__Upper_leave) {
2518 PERL_UNUSED_VAR(cv); /* -W */
2519 PERL_UNUSED_VAR(ax); /* -Wall */
2521 MY_CXT.yield_storage.cxix = su_context_here();
2522 MY_CXT.yield_storage.items = items;
2523 MY_CXT.yield_storage.savesp = PL_stack_sp;
2524 /* See XS_Scope__Upper_unwind */
2525 if (GIMME_V == G_SCALAR)
2526 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2527 SAVEDESTRUCTOR_X(su_yield, su_leave_name);
2531 MODULE = Scope::Upper PACKAGE = Scope::Upper
2537 su_global_setup(file);
2547 su_uid_storage new_cxt;
2554 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
2558 MY_CXT.uplevel_storage.top = NULL;
2559 MY_CXT.uplevel_storage.root = NULL;
2560 MY_CXT.uplevel_storage.count = 0;
2561 MY_CXT.uid_storage = new_cxt;
2565 #endif /* SU_THREADSAFE */
2573 cxix = su_context_here();
2584 SU_GET_CONTEXT(0, 0, su_context_here());
2587 cxix = su_context_skip_db(cxix);
2588 cxix = su_context_normalize_up(cxix);
2600 SU_GET_CONTEXT(0, 0, cxstack_ix);
2602 for (; cxix >= 0; --cxix) {
2603 PERL_CONTEXT *cx = cxstack + cxix;
2604 switch (CxTYPE(cx)) {
2608 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2622 SU_GET_CONTEXT(0, 0, cxstack_ix);
2624 for (; cxix >= 0; --cxix) {
2625 PERL_CONTEXT *cx = cxstack + cxix;
2626 switch (CxTYPE(cx)) {
2643 cxix = su_context_here();
2644 while (--level >= 0) {
2648 cxix = su_context_skip_db(cxix);
2649 cxix = su_context_normalize_up(cxix);
2662 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2663 PERL_CONTEXT *cx = cxstack + cxix;
2664 switch (CxTYPE(cx)) {
2666 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2686 SU_GET_CONTEXT(0, 0, cxstack_ix);
2689 PERL_CONTEXT *cx = cxstack + cxix--;
2690 switch (CxTYPE(cx)) {
2692 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2696 I32 gimme = cx->blk_gimme;
2698 case G_VOID: XSRETURN_UNDEF; break;
2699 case G_SCALAR: XSRETURN_NO; break;
2700 case G_ARRAY: XSRETURN_YES; break;
2713 const PERL_CONTEXT *cx, *dbcx;
2716 SU_GET_CONTEXT(0, 0, su_context_skip_db(cxstack_ix));
2717 cxix = su_context_normalize_up(cxix);
2718 cx = cxstack + cxix;
2720 if (PL_DBsub && cxix && (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)) {
2721 I32 i = su_context_skip_db(cxix - 1) + 1;
2722 if (i < cxix && CxTYPE(cxstack + i) == CXt_SUB)
2725 cop = cx->blk_oldcop;
2726 EXTEND(SP, SU_INFO_COUNT);
2729 HV *stash = CopSTASH(cop);
2731 PUSHs(su_newmortal_pvn(HvNAME(stash), HvNAMELEN(stash)));
2733 PUSHs(&PL_sv_undef);
2736 PUSHs(su_newmortal_pvn(OutCopFILE(cop), OutCopFILE_len(cop)));
2738 mPUSHi(CopLINE(cop));
2739 /* subroutine (3) and has_args (4) */
2740 switch (CxTYPE(cx)) {
2743 GV *cvgv = CvGV(dbcx->blk_sub.cv);
2744 if (cvgv && isGV(cvgv)) {
2745 SV *sv = sv_newmortal();
2746 gv_efullname3(sv, cvgv, NULL);
2749 PUSHs(su_newmortal_pvs("(unknown)"));
2758 PUSHs(su_newmortal_pvs("(eval)"));
2762 PUSHs(&PL_sv_undef);
2763 PUSHs(&PL_sv_undef);
2766 switch (su_context_gimme(cxix)) {
2773 default: /* G_VOID */
2774 PUSHs(&PL_sv_undef);
2777 /* eval text (6) and is_require (7) */
2778 switch (CxTYPE(cx)) {
2780 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
2782 #if SU_HAS_PERL(5, 17, 4)
2783 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
2784 SvCUR(cx->blk_eval.cur_text)-2,
2785 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
2787 PUSHs(cx->blk_eval.cur_text);
2791 } else if (cx->blk_eval.old_namesv) {
2793 PUSHs(sv_mortalcopy(cx->blk_eval.old_namesv));
2799 /* Anything else including eval BLOCK */
2800 PUSHs(&PL_sv_undef);
2801 PUSHs(&PL_sv_undef);
2805 mPUSHi(CopHINTS_get(cop));
2809 #if SU_HAS_PERL(5, 9, 4)
2810 STRLEN *old_warnings = cop->cop_warnings;
2812 SV *old_warnings = cop->cop_warnings;
2814 if (old_warnings == pWARN_STD) {
2815 if (PL_dowarn & G_WARN_ON)
2816 goto context_info_warnings_on;
2818 #if SU_HAS_PERL(5, 17, 4)
2819 mask = &PL_sv_undef;
2821 goto context_info_warnings_off;
2823 } else if (old_warnings == pWARN_NONE) {
2824 #if !SU_HAS_PERL(5, 17, 4)
2825 context_info_warnings_off:
2827 mask = su_newmortal_pvn(WARN_NONEstring, WARNsize);
2828 } else if (old_warnings == pWARN_ALL) {
2830 context_info_warnings_on:
2831 #if SU_HAS_PERL(5, 8, 7)
2832 bits = get_hv("warnings::Bits", 0);
2834 SV **bits_all = hv_fetchs(bits, "all", FALSE);
2836 mask = sv_mortalcopy(*bits_all);
2840 mask = su_newmortal_pvn(WARN_ALLstring, WARNsize);
2842 #if SU_HAS_PERL(5, 9, 4)
2843 mask = su_newmortal_pvn((char *) (old_warnings + 1), old_warnings[0]);
2845 mask = sv_mortalcopy(old_warnings);
2850 #if SU_HAS_PERL(5, 10, 0)
2851 /* hints hash (10) */
2853 COPHH *hints_hash = CopHINTHASH_get(cop);
2855 SV *rhv = sv_2mortal(newRV_noinc((SV *) cophh_2hv(hints_hash, 0)));
2858 PUSHs(&PL_sv_undef);
2862 XSRETURN(SU_INFO_COUNT);
2871 SU_GET_CONTEXT(1, 1, su_context_skip_db(cxstack_ix));
2872 cxix = su_context_normalize_down(cxix);
2873 Newx(ud, 1, su_ud_reap);
2874 SU_UD_TYPE(ud) = SU_UD_TYPE_REAP;
2875 ud->cb = (SvROK(hook) && SvTYPE(SvRV(hook)) >= SVt_PVCV)
2876 ? SvRV(hook) : hook;
2877 SvREFCNT_inc_simple_void(ud->cb);
2878 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2881 localize(SV *sv, SV *val, ...)
2888 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2889 cxix = su_context_normalize_down(cxix);
2890 Newx(ud, 1, su_ud_localize);
2891 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2892 size = su_ud_localize_init(ud, sv, val, NULL);
2893 su_init(ud, cxix, size);
2896 localize_elem(SV *sv, SV *elem, SV *val, ...)
2903 if (SvTYPE(sv) >= SVt_PVGV)
2904 croak("Can't infer the element localization type from a glob and the value");
2905 SU_GET_CONTEXT(3, 3, su_context_skip_db(cxstack_ix));
2906 cxix = su_context_normalize_down(cxix);
2907 Newx(ud, 1, su_ud_localize);
2908 /* Initialize SU_UD_ORIGIN(ud) in case SU_UD_LOCALIZE_FREE(ud) needs it */
2909 SU_UD_ORIGIN(ud) = NULL;
2910 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2911 size = su_ud_localize_init(ud, sv, val, elem);
2912 if (SU_UD_PRIVATE(ud) != SVt_PVAV && SU_UD_PRIVATE(ud) != SVt_PVHV) {
2913 SU_UD_LOCALIZE_FREE(ud);
2914 croak("Can't localize an element of something that isn't an array or a hash");
2916 su_init(ud, cxix, size);
2919 localize_delete(SV *sv, SV *elem, ...)
2926 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2927 cxix = su_context_normalize_down(cxix);
2928 Newx(ud, 1, su_ud_localize);
2929 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2930 size = su_ud_localize_init(ud, sv, NULL, elem);
2931 su_init(ud, cxix, size);
2934 uplevel(SV *code, ...)
2937 I32 cxix, ret, args = 0;
2941 if (SvTYPE(code) < SVt_PVCV)
2942 croak("First argument to uplevel must be a code reference");
2943 SU_GET_CONTEXT(1, items - 1, cxstack_ix);
2945 PERL_CONTEXT *cx = cxstack + cxix;
2946 switch (CxTYPE(cx)) {
2948 croak("Can't uplevel to an eval frame");
2950 croak("Can't uplevel to a format frame");
2952 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2958 /* su_uplevel() takes care of extending the stack if needed. */
2959 ret = su_uplevel((CV *) code, cxix, args);
2964 } while (--cxix >= 0);
2965 croak("Can't uplevel outside a subroutine");
2974 SU_GET_CONTEXT(0, 0, su_context_here());
2975 uid = su_uid_get(cxix);
2981 validate_uid(SV *uid)
2986 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;