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 /* --- Error messages ------------------------------------------------------ */
261 static const char su_stack_smash[] = "Cannot target a scope outside of the current stack";
263 /* --- Unique context ID global storage ------------------------------------ */
265 /* ... Sequence ID counter ................................................. */
272 static su_uv_array su_uid_seq_counter;
276 static perl_mutex su_uid_seq_counter_mutex;
278 #define SU_LOCK(M) MUTEX_LOCK(M)
279 #define SU_UNLOCK(M) MUTEX_UNLOCK(M)
281 #else /* USE_ITHREADS */
286 #endif /* !USE_ITHREADS */
288 static UV su_uid_seq_next(pTHX_ UV depth) {
289 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
293 SU_LOCK(&su_uid_seq_counter_mutex);
295 seqs = su_uid_seq_counter.seqs;
297 if (depth >= su_uid_seq_counter.size) {
300 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
301 for (i = su_uid_seq_counter.size; i <= depth; ++i)
304 su_uid_seq_counter.seqs = seqs;
305 su_uid_seq_counter.size = depth + 1;
310 SU_UNLOCK(&su_uid_seq_counter_mutex);
315 /* ... UID storage ......................................................... */
322 #define SU_UID_ACTIVE 1
324 static UV su_uid_depth(pTHX_ I32 cxix) {
325 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
330 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
331 depth += si->si_cxix + 1;
342 static void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
343 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
344 su_uid **old_map = old_cxt->map;
347 su_uid **new_map = new_cxt->map;
348 STRLEN old_used = old_cxt->used;
349 STRLEN new_used, new_alloc;
352 new_used = max_depth < old_used ? max_depth : old_used;
353 new_cxt->used = new_used;
355 if (new_used <= new_cxt->alloc)
356 new_alloc = new_cxt->alloc;
358 new_alloc = new_used;
359 Renew(new_map, new_alloc, su_uid *);
360 for (i = new_cxt->alloc; i < new_alloc; ++i)
362 new_cxt->map = new_map;
363 new_cxt->alloc = new_alloc;
366 for (i = 0; i < new_alloc; ++i) {
367 su_uid *new_uid = new_map[i];
369 if (i < new_used) { /* => i < max_depth && i < old_used */
370 su_uid *old_uid = old_map[i];
372 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
374 Newx(new_uid, 1, su_uid);
375 new_map[i] = new_uid;
383 new_uid->flags &= ~SU_UID_ACTIVE;
390 /* --- unwind() global storage --------------------------------------------- */
400 /* --- yield() global storage ---------------------------------------------- */
410 /* --- uplevel() data tokens and global storage ---------------------------- */
412 #define SU_UPLEVEL_HIJACKS_RUNOPS SU_HAS_PERL(5, 8, 0)
417 su_uid_storage tmp_uid_storage;
418 su_uid_storage old_uid_storage;
429 PERL_SI *old_curstackinfo;
435 #if SU_UPLEVEL_HIJACKS_RUNOPS
436 runops_proc_t old_runops;
443 static su_uplevel_ud *su_uplevel_ud_new(pTHX) {
444 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
448 Newx(sud, 1, su_uplevel_ud);
451 sud->tmp_uid_storage.map = NULL;
452 sud->tmp_uid_storage.used = 0;
453 sud->tmp_uid_storage.alloc = 0;
455 Newx(si, 1, PERL_SI);
456 si->si_stack = newAV();
457 AvREAL_off(si->si_stack);
458 si->si_cxstack = NULL;
466 static void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
467 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
468 PERL_SI *si = sud->si;
470 Safefree(si->si_cxstack);
471 SvREFCNT_dec(si->si_stack);
474 if (sud->tmp_uid_storage.map) {
475 su_uid **map = sud->tmp_uid_storage.map;
476 STRLEN alloc = sud->tmp_uid_storage.alloc;
479 for (i = 0; i < alloc; ++i)
494 } su_uplevel_storage;
496 #ifndef SU_UPLEVEL_STORAGE_SIZE
497 # define SU_UPLEVEL_STORAGE_SIZE 4
500 /* --- Global data --------------------------------------------------------- */
502 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
505 char *stack_placeholder;
506 su_unwind_storage unwind_storage;
507 su_yield_storage yield_storage;
508 su_uplevel_storage uplevel_storage;
509 su_uid_storage uid_storage;
514 /* --- Stack manipulations ------------------------------------------------- */
516 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
518 #define SU_SAVE_DESTRUCTOR_SIZE 3
519 #define SU_SAVE_PLACEHOLDER_SIZE 3
521 #define SU_SAVE_SCALAR_SIZE 3
523 #define SU_SAVE_ARY_SIZE 3
524 #define SU_SAVE_AELEM_SIZE 4
526 # define SU_SAVE_ADELETE_SIZE 3
528 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
530 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
531 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
533 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
536 #define SU_SAVE_HASH_SIZE 3
537 #define SU_SAVE_HELEM_SIZE 4
538 #define SU_SAVE_HDELETE_SIZE 4
539 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
540 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
542 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
545 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
547 #if !SU_HAS_PERL(5, 8, 9)
548 # define SU_SAVE_GP_SIZE 6
549 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
550 # define SU_SAVE_GP_SIZE 3
551 #elif !SU_HAS_PERL(5, 13, 8)
552 # define SU_SAVE_GP_SIZE 4
554 # define SU_SAVE_GP_SIZE 3
557 #ifndef SvCANEXISTDELETE
558 # define SvCANEXISTDELETE(sv) \
560 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
561 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
562 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
563 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
568 /* ... Saving array elements ............................................... */
570 static I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
571 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
577 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
578 #if SU_HAS_PERL(5, 8, 1)
579 if (SvRMAGICAL(av)) {
580 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
582 SV * const * const negative_indices_glob =
583 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
584 NEGATIVE_INDICES_VAR, 16, 0);
585 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
591 idx = key + av_len(av) + 1;
605 static void su_adelete(pTHX_ void *ud_) {
606 su_ud_adelete *ud = (su_ud_adelete *) ud_;
608 av_delete(ud->av, ud->idx, G_DISCARD);
609 SvREFCNT_dec(ud->av);
614 static void su_save_adelete(pTHX_ AV *av, I32 idx) {
615 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
618 Newx(ud, 1, su_ud_adelete);
621 SvREFCNT_inc_simple_void(av);
623 SAVEDESTRUCTOR_X(su_adelete, ud);
626 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
628 #endif /* SAVEADELETE */
630 static void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
631 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
638 idx = su_av_key2idx(av, SvIV(key));
640 if (SvCANEXISTDELETE(av))
641 preeminent = av_exists(av, idx);
643 svp = av_fetch(av, idx, 1);
644 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
647 save_aelem(av, idx, svp);
649 SAVEADELETE(av, idx);
651 if (val) { /* local $x[$idx] = $val; */
652 SvSetMagicSV(*svp, val);
653 } else { /* local $x[$idx]; delete $x[$idx]; */
654 av_delete(av, idx, G_DISCARD);
658 /* ... Saving hash elements ................................................ */
660 static void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
661 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
668 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
669 preeminent = hv_exists_ent(hv, keysv, 0);
671 he = hv_fetch_ent(hv, keysv, 1, 0);
672 svp = he ? &HeVAL(he) : NULL;
673 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
675 if (HvNAME_get(hv) && isGV(*svp)) {
676 save_gp((GV *) *svp, 0);
681 save_helem(hv, keysv, svp);
684 const char * const key = SvPV_const(keysv, keylen);
685 SAVEDELETE(hv, savepvn(key, keylen),
686 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
689 if (val) { /* local $x{$keysv} = $val; */
690 SvSetMagicSV(*svp, val);
691 } else { /* local $x{$keysv}; delete $x{$keysv}; */
692 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
696 /* ... Saving code slots from a glob ....................................... */
698 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
699 # define mro_method_changed_in(G) PL_sub_generation++
707 static void su_restore_gvcv(pTHX_ void *ud_) {
708 su_save_gvcv_ud *ud = ud_;
711 GvCV_set(gv, ud->old_cv);
713 mro_method_changed_in(GvSTASH(gv));
718 static void su_save_gvcv(pTHX_ GV *gv) {
719 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
722 Newx(ud, 1, su_save_gvcv_ud);
724 ud->old_cv = GvCV(gv);
728 mro_method_changed_in(GvSTASH(gv));
730 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
733 /* --- Actions ------------------------------------------------------------- */
744 #define SU_UD_TYPE(U) (((su_ud_common *) (U))->type)
745 #define SU_UD_PRIVATE(U) (((su_ud_common *) (U))->private)
746 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
747 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
748 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
750 #define SU_UD_TYPE_REAP 0
751 #define SU_UD_TYPE_LOCALIZE 1
752 #define SU_UD_TYPE_UID 2
754 #define SU_UD_FREE(U) STMT_START { \
755 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
759 /* ... Reap ................................................................ */
761 #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))
768 #define SU_UD_REAP_CB(U) (((su_ud_reap *) (U))->cb)
770 static void su_call(pTHX_ SV *cb) {
773 PERL_CONTEXT saved_cx;
774 #endif /* SU_SAVE_LAST_CX */
779 PerlIO_printf(Perl_debug_log,
780 "@@@ call scope_ix=%2d save_ix=%2d\n",
781 PL_scopestack_ix, PL_savestack_ix);
791 /* If the recently popped context isn't saved there, it will be overwritten by
792 * the sub scope from call_sv, although it's still needed in our caller. */
793 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
794 saved_cx = cxstack[cxix];
795 #endif /* SU_SAVE_LAST_CX */
800 cxstack[cxix] = saved_cx;
801 #endif /* SU_SAVE_LAST_CX */
813 /* ... Localize & localize array/hash element .............................. */
822 #define SU_UD_LOCALIZE_SV(U) (((su_ud_localize *) (U))->sv)
823 #define SU_UD_LOCALIZE_VAL(U) (((su_ud_localize *) (U))->val)
824 #define SU_UD_LOCALIZE_ELEM(U) (((su_ud_localize *) (U))->elem)
826 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
827 SvREFCNT_dec(SU_UD_LOCALIZE_ELEM(U)); \
828 SvREFCNT_dec(SU_UD_LOCALIZE_VAL(U)); \
829 SvREFCNT_dec(SU_UD_LOCALIZE_SV(U)); \
833 static I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
834 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
839 SvREFCNT_inc_simple_void(sv);
841 if (SvTYPE(sv) >= SVt_PVGV) {
842 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
844 } else { /* local *x = \$val; */
845 t = SvTYPE(SvRV(val));
848 } else if (SvROK(sv)) {
849 croak("Invalid %s reference as the localization target",
850 sv_reftype(SvRV(sv), 0));
853 const char *p = SvPV_const(sv, len), *s;
854 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
860 case '$': t = SVt_PV; break;
861 case '@': t = SVt_PVAV; break;
862 case '%': t = SVt_PVHV; break;
863 case '&': t = SVt_PVCV; break;
864 case '*': t = SVt_PVGV; break;
869 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
870 if (SvROK(val) && !sv_isobject(val)) {
871 t = SvTYPE(SvRV(val));
883 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
888 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
893 size = SU_SAVE_GP_SIZE;
897 size = SU_SAVE_GVCV_SIZE;
901 size = SU_SAVE_SCALAR_SIZE;
904 /* When deref is set, val isn't NULL */
906 SU_UD_PRIVATE(ud) = t;
909 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
910 ud->elem = SvREFCNT_inc(elem);
915 static void su_localize(pTHX_ void *ud_) {
916 #define su_localize(U) su_localize(aTHX_ (U))
917 su_ud_localize *ud = (su_ud_localize *) ud_;
921 svtype t = SU_UD_PRIVATE(ud);
924 if (SvTYPE(sv) >= SVt_PVGV) {
928 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
931 const char *name = SvPV_const(sv, len);
932 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
939 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
940 PerlIO_printf(Perl_debug_log,
941 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
942 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
946 /* Inspired from Alias.pm */
950 su_save_aelem(GvAV(gv), elem, val);
957 su_save_helem(GvHV(gv), elem, val);
963 save_gp(gv, 1); /* hide previous entry in symtab */
969 gv = (GV *) save_scalar(gv);
974 SvSetMagicSV((SV *) gv, val);
979 /* ... Unique context ID ................................................... */
986 #define SU_UD_UID_UID(U) (((su_ud_uid *) (U))->uid)
988 static void su_uid_drop(pTHX_ void *ud_) {
991 uid->flags &= ~SU_UID_ACTIVE;
996 /* --- Pop a context back -------------------------------------------------- */
999 # define SU_CXNAME(C) PL_block_type[CxTYPE(C)]
1001 # if SU_HAS_PERL(5, 11, 0)
1002 static const char *su_block_type[] = {
1016 # elif SU_HAS_PERL(5, 9, 3)
1017 static const char *su_block_type[] = {
1032 static const char *su_block_type[] = {
1041 # define SU_CXNAME(C) su_block_type[CxTYPE(C)]
1044 static void su_pop(pTHX_ void *ud) {
1045 #define su_pop(U) su_pop(aTHX_ (U))
1046 I32 depth, base, mark, *origin;
1047 depth = SU_UD_DEPTH(ud);
1050 PerlIO_printf(Perl_debug_log,
1051 "%p: --- pop a %s\n"
1052 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
1053 ud, SU_CXNAME(cxstack + cxstack_ix),
1054 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
1057 origin = SU_UD_ORIGIN(ud);
1058 mark = origin[depth];
1059 base = origin[depth - 1];
1061 SU_D(PerlIO_printf(Perl_debug_log,
1062 "%p: original scope was %*c top=%2d base=%2d\n",
1063 ud, 24, ' ', mark, base));
1066 #if SU_HAS_PERL(5, 19, 4)
1071 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
1073 #if SU_HAS_PERL(5, 19, 4)
1074 cx = cxstack + cxstack_ix;
1075 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1076 save = PL_scopestack[cx->blk_oldscopesp - 1];
1079 PL_savestack_ix = mark;
1082 #if SU_HAS_PERL(5, 19, 4)
1083 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1084 PL_scopestack[cx->blk_oldscopesp - 1] = save;
1087 PL_savestack_ix = base;
1089 SU_UD_DEPTH(ud) = --depth;
1094 if ((pad = SU_UD_PAD(ud)) > 0) {
1097 SU_D(PerlIO_printf(Perl_debug_log,
1098 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
1099 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1100 SU_SAVE_PLACEHOLDER();
1104 SU_D(PerlIO_printf(Perl_debug_log,
1105 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
1106 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1107 SAVEDESTRUCTOR_X(su_pop, ud);
1109 switch (SU_UD_TYPE(ud)) {
1110 case SU_UD_TYPE_REAP: {
1112 PerlIO_printf(Perl_debug_log,
1113 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
1114 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
1116 SAVEDESTRUCTOR_X(su_call, SU_UD_REAP_CB(ud));
1120 case SU_UD_TYPE_LOCALIZE:
1122 SU_UD_LOCALIZE_FREE(ud);
1124 case SU_UD_TYPE_UID:
1125 SAVEDESTRUCTOR_X(su_uid_drop, SU_UD_UID_UID(ud));
1131 SU_D(PerlIO_printf(Perl_debug_log,
1132 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
1133 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
1136 /* --- Initialize the stack and the action userdata ------------------------ */
1138 static I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
1139 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
1140 I32 i, depth, offset, base, *origin;
1143 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
1145 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
1148 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
1149 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
1150 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
1153 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
1155 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
1156 ud, size, pad, offset));
1158 depth = PL_scopestack_ix - cxstack[cxix].blk_oldscopesp;
1159 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
1161 Newx(origin, depth + 1, I32);
1162 base = PL_scopestack_ix - depth;
1163 origin[0] = PL_scopestack[base];
1164 PL_scopestack[base] += size;
1165 for (i = 1; i < depth; ++i) {
1167 origin[i] = PL_scopestack[j];
1168 PL_scopestack[j] += offset;
1170 origin[depth] = PL_savestack_ix;
1172 SU_UD_PAD(ud) = pad;
1173 SU_UD_DEPTH(ud) = depth;
1174 SU_UD_ORIGIN(ud) = origin;
1176 /* Make sure the first destructor fires by pushing enough fake slots on the
1178 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1179 <= PL_scopestack[PL_scopestack_ix - 1]) {
1182 SU_D(PerlIO_printf(Perl_debug_log,
1183 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1184 ud, PL_scopestack_ix, PL_savestack_ix));
1185 SU_SAVE_PLACEHOLDER();
1186 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1187 <= PL_scopestack[PL_scopestack_ix - 1]);
1189 SU_D(PerlIO_printf(Perl_debug_log,
1190 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1191 ud, PL_scopestack_ix, PL_savestack_ix));
1192 SAVEDESTRUCTOR_X(su_pop, ud);
1195 for (i = 0; i <= depth; ++i) {
1196 I32 j = PL_scopestack_ix - i;
1197 PerlIO_printf(Perl_debug_log,
1198 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1199 ud, i, j, origin[depth - i],
1200 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1207 /* --- Unwind stack -------------------------------------------------------- */
1209 static void su_unwind(pTHX_ void *ud_) {
1211 I32 cxix = MY_CXT.unwind_storage.cxix;
1212 I32 items = MY_CXT.unwind_storage.items;
1215 PERL_UNUSED_VAR(ud_);
1217 PL_stack_sp = MY_CXT.unwind_storage.savesp;
1218 #if SU_HAS_PERL(5, 19, 4)
1221 SV **sp = PL_stack_sp;
1222 for (i = -items + 1; i <= 0; ++i)
1224 sv_2mortal(SvREFCNT_inc(sp[i]));
1228 if (cxstack_ix > cxix)
1231 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1232 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1235 I32 gimme = GIMME_V;
1236 PerlIO_printf(Perl_debug_log,
1237 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1239 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1240 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1243 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1244 PL_op = PL_op->op_ppaddr(aTHX);
1246 *PL_markstack_ptr = mark;
1248 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1249 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1252 /* --- Yield --------------------------------------------------------------- */
1254 #if SU_HAS_PERL(5, 10, 0)
1255 # define SU_RETOP_SUB(C) ((C)->blk_sub.retop)
1256 # define SU_RETOP_EVAL(C) ((C)->blk_eval.retop)
1257 # define SU_RETOP_LOOP(C) ((C)->blk_loop.my_op->op_lastop->op_next)
1258 # define SU_RETOP_GIVEN(C) ((C)->blk_givwhen.leave_op->op_next)
1260 # define SU_RETOP_SUB(C) ((C)->blk_oldretsp > 0 ? PL_retstack[(C)->blk_oldretsp - 1] : NULL)
1261 # define SU_RETOP_EVAL(C) SU_RETOP_SUB(C)
1262 # define SU_RETOP_LOOP(C) ((C)->blk_loop.last_op->op_next)
1265 static void su_yield(pTHX_ void *ud_) {
1268 const char *which = ud_;
1269 I32 cxix = MY_CXT.yield_storage.cxix;
1270 I32 items = MY_CXT.yield_storage.items;
1271 opcode type = OP_NULL;
1275 PERL_UNUSED_VAR(ud_);
1277 cx = cxstack + cxix;
1278 switch (CxTYPE(cx)) {
1280 I32 i, cur = cxstack_ix, n = 1;
1282 /* Is this actually a given/when block? This may occur only when yield was
1283 * called with HERE (or nothing) as the context. */
1284 #if SU_HAS_PERL(5, 10, 0)
1286 PERL_CONTEXT *prev = cx - 1;
1287 U8 prev_type = CxTYPE(prev);
1288 if ((prev_type == CXt_GIVEN || prev_type == CXt_WHEN)
1289 && (prev->blk_oldcop == cx->blk_oldcop)) {
1292 if (prev_type == CXt_GIVEN)
1301 /* Bare blocks (that appear as do { ... } blocks, map { ... } blocks or
1302 * constant folded blcoks) don't need to save the op to return to anywhere
1303 * since 'last' isn't supposed to work inside them. So we climb higher in
1304 * the context stack until we reach a context that has a return op (i.e. a
1305 * sub, an eval, a format or a real loop), recording how many blocks we
1306 * crossed. Then we follow the op_next chain until we get to the leave op
1307 * that closes the original block, which we are assured to reach since
1308 * everything is static (the blocks we have crossed cannot be evals or
1309 * subroutine calls). */
1310 for (i = cxix + 1; i <= cur; ++i) {
1311 PERL_CONTEXT *cx2 = cxstack + i;
1312 switch (CxTYPE(cx2)) {
1318 o = SU_RETOP_SUB(cx2);
1321 o = SU_RETOP_EVAL(cx2);
1323 #if SU_HAS_PERL(5, 11, 0)
1325 case CXt_LOOP_PLAIN:
1326 case CXt_LOOP_LAZYSV:
1327 case CXt_LOOP_LAZYIV:
1331 o = SU_RETOP_LOOP(cx2);
1340 /* We may find other enter/leave blocks on our way to the matching leave.
1341 * Make sure the depth is incremented/decremented appropriately. */
1342 if (o->op_type == OP_ENTER) {
1344 } else if (o->op_type == OP_LEAVE) {
1358 next = SU_RETOP_SUB(cx);
1361 type = CxTRYBLOCK(cx) ? OP_LEAVETRY : OP_LEAVEEVAL;
1362 next = SU_RETOP_EVAL(cx);
1364 #if SU_HAS_PERL(5, 11, 0)
1366 case CXt_LOOP_PLAIN:
1367 case CXt_LOOP_LAZYSV:
1368 case CXt_LOOP_LAZYIV:
1372 type = OP_LEAVELOOP;
1373 next = SU_RETOP_LOOP(cx);
1375 #if SU_HAS_PERL(5, 10, 0)
1378 type = OP_LEAVEGIVEN;
1379 next = SU_RETOP_GIVEN(cx);
1383 #if SU_HAS_PERL(5, 15, 1)
1384 type = OP_LEAVEWHEN;
1387 flags |= OPf_SPECIAL;
1393 croak("%s() can't target a substitution context", which);
1396 croak("%s() doesn't know how to leave a %s context",
1397 which, SU_CXNAME(cxstack + cxix));
1401 PL_stack_sp = MY_CXT.yield_storage.savesp;
1402 #if SU_HAS_PERL(5, 19, 4)
1405 SV **sp = PL_stack_sp;
1406 for (i = -items + 1; i <= 0; ++i)
1408 sv_2mortal(SvREFCNT_inc(sp[i]));
1412 if (cxstack_ix > cxix)
1415 /* Copy the arguments passed to yield() where the leave op expects to find
1418 Move(PL_stack_sp - items + 1, PL_stack_base + cx->blk_oldsp + 1, items, SV *);
1419 PL_stack_sp = PL_stack_base + cx->blk_oldsp + items;
1421 flags |= OP_GIMME_REVERSE(cx->blk_gimme);
1423 MY_CXT.yield_storage.leave_op.op_type = type;
1424 MY_CXT.yield_storage.leave_op.op_ppaddr = PL_ppaddr[type];
1425 MY_CXT.yield_storage.leave_op.op_flags = flags;
1426 MY_CXT.yield_storage.leave_op.op_next = next;
1428 PL_op = (OP *) &(MY_CXT.yield_storage.leave_op);
1429 PL_op = PL_op->op_ppaddr(aTHX);
1431 MY_CXT.yield_storage.proxy_op.op_next = PL_op;
1432 PL_op = &(MY_CXT.yield_storage.proxy_op);
1435 /* --- Uplevel ------------------------------------------------------------- */
1437 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1438 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1440 static su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1441 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1446 sud = MY_CXT.uplevel_storage.root;
1448 MY_CXT.uplevel_storage.root = sud->next;
1449 MY_CXT.uplevel_storage.count--;
1451 sud = su_uplevel_ud_new();
1454 sud->next = MY_CXT.uplevel_storage.top;
1455 MY_CXT.uplevel_storage.top = sud;
1457 depth = su_uid_depth(cxix);
1458 su_uid_storage_dup(&sud->tmp_uid_storage, &MY_CXT.uid_storage, depth);
1459 sud->old_uid_storage = MY_CXT.uid_storage;
1460 MY_CXT.uid_storage = sud->tmp_uid_storage;
1465 #if SU_HAS_PERL(5, 13, 7)
1467 static void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1468 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1471 sud->tmp_uid_storage = MY_CXT.uid_storage;
1472 MY_CXT.uid_storage = sud->old_uid_storage;
1476 map = sud->tmp_uid_storage.map;
1477 alloc = sud->tmp_uid_storage.alloc;
1478 for (i = 0; i < alloc; ++i) {
1480 map[i]->flags &= SU_UID_ACTIVE;
1483 MY_CXT.uplevel_storage.top = sud->next;
1485 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1486 su_uplevel_ud_delete(sud);
1488 sud->next = MY_CXT.uplevel_storage.root;
1489 MY_CXT.uplevel_storage.root = sud;
1490 MY_CXT.uplevel_storage.count++;
1496 static int su_uplevel_goto_static(const OP *o) {
1497 for (; o; o = OpSIBLING(o)) {
1498 /* goto ops are unops with kids. */
1499 if (!(o->op_flags & OPf_KIDS))
1502 switch (o->op_type) {
1505 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1510 if (su_uplevel_goto_static(((const UNOP *) o)->op_first))
1519 #if SU_UPLEVEL_HIJACKS_RUNOPS
1521 static int su_uplevel_goto_runops(pTHX) {
1522 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1528 if (op->op_type == OP_GOTO) {
1529 AV *argarray = NULL;
1532 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1533 const PERL_CONTEXT *cx = cxstack + cxix;
1535 switch (CxTYPE(cx)) {
1537 if (CxHASARGS(cx)) {
1538 argarray = cx->blk_sub.argarray;
1554 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1555 AV *args = GvAV(PL_defgv);
1556 I32 items = AvFILLp(args);
1558 av_extend(argarray, items);
1559 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1560 AvFILLp(argarray) = items;
1565 PL_op = op = op->op_ppaddr(aTHX);
1567 #if !SU_HAS_PERL(5, 13, 0)
1577 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1579 #define su_at_underscore(C) PadARRAY(PadlistARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1581 static void su_uplevel_restore(pTHX_ void *sus_) {
1582 su_uplevel_ud *sud = sus_;
1583 PERL_SI *cur = sud->old_curstackinfo;
1584 PERL_SI *si = sud->si;
1586 #if SU_UPLEVEL_HIJACKS_RUNOPS
1587 if (PL_runops == su_uplevel_goto_runops)
1588 PL_runops = sud->old_runops;
1591 if (sud->callback) {
1592 PERL_CONTEXT *cx = cxstack + sud->cxix;
1593 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1595 /* We have to fix the pad entry for @_ in the original callback because it
1596 * may have been reified. */
1597 if (AvREAL(argarray)) {
1598 const I32 fill = AvFILLp(argarray);
1599 SvREFCNT_dec(argarray);
1601 AvREAL_off(argarray);
1602 AvREIFY_on(argarray);
1603 av_extend(argarray, fill);
1604 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1606 CLEAR_ARGARRAY(argarray);
1609 /* If the old cv member is our renamed CV, it means that this place has been
1610 * reached without a goto() happening, and the old argarray member is
1611 * actually our fake argarray. Destroy it properly in that case. */
1612 if (cx->blk_sub.cv == sud->renamed) {
1613 SvREFCNT_dec(cx->blk_sub.argarray);
1614 cx->blk_sub.argarray = argarray;
1617 CvDEPTH(sud->callback)--;
1618 SvREFCNT_dec(sud->callback);
1621 /* Free the renamed CV. We must do it ourselves so that we can force the
1622 * depth to be 0, or perl would complain about it being "still in use".
1623 * But we *know* that it cannot be so. */
1625 if (!CvISXSUB(sud->renamed)) {
1626 CvDEPTH(sud->renamed) = 0;
1627 CvPADLIST(sud->renamed) = NULL;
1629 SvREFCNT_dec(sud->renamed);
1632 CATCH_SET(sud->old_catch);
1634 SU_UPLEVEL_RESTORE(op);
1636 /* stack_grow() wants PL_curstack so restore the old stack first */
1637 if (PL_curstackinfo == si) {
1638 PL_curstack = cur->si_stack;
1639 if (sud->old_mainstack)
1640 SU_UPLEVEL_RESTORE(mainstack);
1641 SU_UPLEVEL_RESTORE(curstackinfo);
1644 CV *target = sud->target;
1647 /* When we die, the depth of the target CV is not updated because of the
1648 * stack switcheroo. So we have to look at all the frames between the
1649 * uplevel call and the catch block to count how many call frames to the
1650 * target CV were skipped. */
1651 for (i = cur->si_cxix; i > sud->cxix; i--) {
1652 register const PERL_CONTEXT *cx = cxstack + i;
1654 if (CxTYPE(cx) == CXt_SUB) {
1655 if (cx->blk_sub.cv == target)
1660 /* If we died, the replacement stack was already unwinded to the first
1661 * eval frame, and all the contexts down there were popped. We don't have
1662 * to pop manually any context of the original stack, because they must
1663 * have been in the replacement stack as well (since the second was copied
1664 * from the first). Thus we only have to make sure the original stack index
1665 * points to the context just below the first eval scope under the target
1667 for (; i >= 0; i--) {
1668 register const PERL_CONTEXT *cx = cxstack + i;
1670 switch (CxTYPE(cx)) {
1672 if (cx->blk_sub.cv == target)
1684 CvDEPTH(target) = sud->target_depth - levels;
1685 PL_curstackinfo->si_cxix = i - 1;
1687 #if !SU_HAS_PERL(5, 13, 1)
1688 /* Since $@ was maybe localized between the target frame and the uplevel
1689 * call, we forcefully flush the save stack to get rid of it and then
1690 * reset $@ to its proper value. Note that the the call to
1691 * su_uplevel_restore() must happen before the "reset $@" item of the save
1692 * stack is processed, as uplevel was called after the localization.
1693 * Andrew's changes to how $@ was handled, which were mainly integrated
1694 * between perl 5.13.0 and 5.13.1, fixed this. */
1695 if (ERRSV && SvTRUE(ERRSV)) {
1696 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1697 SV *errsv = SvREFCNT_inc(ERRSV);
1698 PL_scopestack_ix = cx->blk_oldscopesp;
1699 leave_scope(PL_scopestack[PL_scopestack_ix]);
1700 sv_setsv(ERRSV, errsv);
1701 SvREFCNT_dec(errsv);
1707 SU_UPLEVEL_RESTORE(curcop);
1709 SvREFCNT_dec(sud->target);
1711 PL_stack_base = AvARRAY(cur->si_stack);
1712 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1713 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1715 /* When an exception is thrown from the uplevel'd subroutine,
1716 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1717 * die_where() in more recent perls), which has the sad habit of keeping a
1718 * pointer to the current context frame across this call. This means that we
1719 * can't free the temporary context stack we used for the uplevel call right
1720 * now, or that pointer upwards would point to garbage. */
1721 #if SU_HAS_PERL(5, 13, 7)
1722 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1723 * public in perl 5.13.7. */
1724 su_uplevel_storage_delete(sud);
1726 /* Otherwise, we just enqueue it back in the global storage list. */
1730 sud->tmp_uid_storage = MY_CXT.uid_storage;
1731 MY_CXT.uid_storage = sud->old_uid_storage;
1733 MY_CXT.uplevel_storage.top = sud->next;
1734 sud->next = MY_CXT.uplevel_storage.root;
1735 MY_CXT.uplevel_storage.root = sud;
1736 MY_CXT.uplevel_storage.count++;
1743 static CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1744 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1748 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1750 CvFLAGS(cv) = CvFLAGS(proto);
1752 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1754 CvDEPTH(cv) = CvDEPTH(proto);
1756 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1758 CvFILE(cv) = CvFILE(proto);
1762 #if SU_RELEASE && SU_HAS_PERL_EXACT(5, 21, 4)
1765 CvSTASH_set(cv, CvSTASH(proto));
1766 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1767 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1768 * (which was part of perl 5.13.7). */
1769 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1771 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1774 if (CvISXSUB(proto)) {
1775 CvXSUB(cv) = CvXSUB(proto);
1776 CvXSUBANY(cv) = CvXSUBANY(proto);
1779 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1781 CvSTART(cv) = CvSTART(proto);
1782 CvPADLIST(cv) = CvPADLIST(proto);
1784 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1785 #ifdef CVf_WEAKOUTSIDE
1786 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1788 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1789 #ifdef CvOUTSIDE_SEQ
1790 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1794 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1804 static I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1805 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1807 const PERL_CONTEXT *cx = cxstack + cxix;
1809 PERL_SI *cur = PL_curstackinfo;
1815 I32 old_mark, new_mark;
1822 /* Make PL_stack_sp point just before the CV. */
1823 PL_stack_sp -= args + 1;
1824 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1827 sud = su_uplevel_storage_new(cxix);
1831 sud->callback = NULL;
1832 sud->renamed = NULL;
1833 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1837 si->si_type = cur->si_type;
1839 si->si_prev = cur->si_prev;
1841 si->si_markoff = cx->blk_oldmarksp;
1844 /* Allocate enough space for all the elements of the original stack up to the
1845 * target context, plus the forthcoming arguments. */
1846 new_mark = cx->blk_oldsp;
1847 av_extend(si->si_stack, new_mark + 1 + args + 1);
1848 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1849 AvFILLp(si->si_stack) = new_mark;
1850 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1852 /* Specialized SWITCHSTACK() */
1853 PL_stack_base = AvARRAY(si->si_stack);
1854 old_stack_sp = PL_stack_sp;
1855 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1856 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1859 /* Copy the context stack up to the context just below the target. */
1860 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1861 if (si->si_cxmax < cxix) {
1862 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1863 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1864 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1866 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1867 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1869 target = cx->blk_sub.cv;
1870 sud->target = (CV *) SvREFCNT_inc(target);
1871 sud->target_depth = CvDEPTH(target);
1873 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1874 * run-time implication, since PL_curcop will be overwritten as soon as we
1875 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1876 * make it point to the blk_oldcop for the target frame, so that caller()
1877 * reports the right file name, line number and lexical hints. */
1878 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1879 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1880 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1882 SU_UPLEVEL_SAVE(curstackinfo, si);
1883 /* If those two are equal, we need to fool POPSTACK_TO() */
1884 if (PL_mainstack == PL_curstack)
1885 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1887 sud->old_mainstack = NULL;
1888 PL_curstack = si->si_stack;
1890 renamed = su_cv_clone(callback, CvGV(target));
1891 sud->renamed = renamed;
1894 /* Both SP and old_stack_sp point just before the CV. */
1895 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1897 PUSHs((SV *) renamed);
1900 Zero(&sub_op, 1, UNOP);
1901 sub_op.op_type = OP_ENTERSUB;
1902 sub_op.op_next = NULL;
1903 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1905 sub_op.op_flags |= OPpENTERSUB_DB;
1907 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1909 #if SU_UPLEVEL_HIJACKS_RUNOPS
1910 sud->old_runops = PL_runops;
1913 sud->old_catch = CATCH_GET;
1916 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1917 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1919 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1922 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1923 CvDEPTH(callback)++;
1925 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1926 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1927 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1928 * with what we put on the stack. But we want to fake up the same arguments
1929 * as the ones in use at the context we uplevel to, so we replace the
1930 * argarray with an unreal copy of the original @_. */
1934 av_extend(av, AvMAX(cx->blk_sub.argarray));
1935 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1936 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1937 sub_cx->blk_sub.argarray = av;
1939 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1942 if (su_uplevel_goto_static(CvROOT(renamed))) {
1943 #if SU_UPLEVEL_HIJACKS_RUNOPS
1944 if (PL_runops != PL_runops_std) {
1945 if (PL_runops == PL_runops_dbg) {
1947 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1948 } else if (PL_runops != su_uplevel_goto_runops)
1949 croak("uplevel() can't execute code that calls goto with a custom runloop");
1952 PL_runops = su_uplevel_goto_runops;
1953 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1954 croak("uplevel() can't execute code that calls goto before perl 5.8");
1955 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1963 ret = PL_stack_sp - (PL_stack_base + new_mark);
1965 AV *old_stack = sud->old_curstackinfo->si_stack;
1967 if (old_mark + ret > AvMAX(old_stack)) {
1968 /* Specialized EXTEND(old_sp, ret) */
1969 av_extend(old_stack, old_mark + ret + 1);
1970 old_stack_sp = AvARRAY(old_stack) + old_mark;
1973 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1975 AvFILLp(old_stack) += ret;
1983 /* --- Unique context ID --------------------------------------------------- */
1985 static su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1986 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1991 map = MY_CXT.uid_storage.map;
1992 alloc = MY_CXT.uid_storage.alloc;
1994 if (depth >= alloc) {
1997 Renew(map, depth + 1, su_uid *);
1998 for (i = alloc; i <= depth; ++i)
2001 MY_CXT.uid_storage.map = map;
2002 MY_CXT.uid_storage.alloc = depth + 1;
2008 Newx(uid, 1, su_uid);
2014 if (depth >= MY_CXT.uid_storage.used)
2015 MY_CXT.uid_storage.used = depth + 1;
2020 static int su_uid_storage_check(pTHX_ UV depth, UV seq) {
2021 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
2025 if (depth >= MY_CXT.uid_storage.used)
2028 uid = MY_CXT.uid_storage.map[depth];
2030 return uid && (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
2033 static SV *su_uid_get(pTHX_ I32 cxix) {
2034 #define su_uid_get(I) su_uid_get(aTHX_ (I))
2039 depth = su_uid_depth(cxix);
2040 uid = su_uid_storage_fetch(depth);
2042 if (!(uid->flags & SU_UID_ACTIVE)) {
2045 uid->seq = su_uid_seq_next(depth);
2046 uid->flags |= SU_UID_ACTIVE;
2048 Newx(ud, 1, su_ud_uid);
2049 SU_UD_TYPE(ud) = SU_UD_TYPE_UID;
2051 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2054 uid_sv = sv_newmortal();
2055 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
2061 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
2063 #else /* grok_number */
2065 #define IS_NUMBER_IN_UV 0x1
2067 static int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
2068 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
2072 /* This crude check should be good enough for a fallback implementation.
2073 * Better be too strict than too lax. */
2074 for (i = 0; i < len; ++i) {
2079 tmpsv = sv_newmortal();
2080 sv_setpvn(tmpsv, s, len);
2081 *valuep = sv_2uv(tmpsv);
2083 return IS_NUMBER_IN_UV;
2086 #endif /* !grok_number */
2088 static int su_uid_validate(pTHX_ SV *uid) {
2089 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
2095 s = SvPV_const(uid, len);
2097 while (p < len && s[p] != '-')
2100 croak("UID contains only one part");
2102 type = su_grok_number(s, p, &depth);
2103 if (type != IS_NUMBER_IN_UV)
2104 croak("First UID part is not an unsigned integer");
2106 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
2108 type = su_grok_number(s + p, len - p, &seq);
2109 if (type != IS_NUMBER_IN_UV)
2110 croak("Second UID part is not an unsigned integer");
2112 return su_uid_storage_check(depth, seq);
2115 /* --- Context operations -------------------------------------------------- */
2117 /* Remove sequences of BLOCKs having DB for stash, followed by a SUB context
2118 * for the debugger callback. */
2120 static I32 su_context_skip_db(pTHX_ I32 cxix) {
2121 #define su_context_skip_db(C) su_context_skip_db(aTHX_ (C))
2127 for (i = cxix; i > 0; --i) {
2128 PERL_CONTEXT *cx = cxstack + i;
2130 switch (CxTYPE(cx)) {
2131 #if SU_HAS_PERL(5, 17, 1)
2132 case CXt_LOOP_PLAIN:
2135 if (cx->blk_oldcop && CopSTASH(cx->blk_oldcop) == GvSTASH(PL_DBgv))
2139 if (cx->blk_sub.cv == GvCV(PL_DBsub)) {
2155 static I32 su_context_normalize_up(pTHX_ I32 cxix) {
2156 #define su_context_normalize_up(C) su_context_normalize_up(aTHX_ (C))
2162 cx = cxstack + cxix;
2163 if (CxTYPE(cx) == CXt_BLOCK) {
2164 PERL_CONTEXT *prev = cx - 1;
2166 switch (CxTYPE(prev)) {
2167 #if SU_HAS_PERL(5, 10, 0)
2171 #if SU_HAS_PERL(5, 11, 0)
2172 /* That's the only subcategory that can cause an extra BLOCK context */
2173 case CXt_LOOP_PLAIN:
2177 if (cx->blk_oldcop == prev->blk_oldcop)
2181 if (cx->blk_oldcop && OpSIBLING(cx->blk_oldcop)
2182 && OpSIBLING(cx->blk_oldcop)->op_type == OP_SUBST)
2191 static I32 su_context_normalize_down(pTHX_ I32 cxix) {
2192 #define su_context_normalize_down(C) su_context_normalize_down(aTHX_ (C))
2195 if (cxix >= cxstack_ix)
2198 next = cxstack + cxix + 1;
2199 if (CxTYPE(next) == CXt_BLOCK) {
2200 PERL_CONTEXT *cx = next - 1;
2202 switch (CxTYPE(cx)) {
2203 #if SU_HAS_PERL(5, 10, 0)
2207 #if SU_HAS_PERL(5, 11, 0)
2208 /* That's the only subcategory that can cause an extra BLOCK context */
2209 case CXt_LOOP_PLAIN:
2213 if (cx->blk_oldcop == next->blk_oldcop)
2217 if (next->blk_oldcop && OpSIBLING(next->blk_oldcop)
2218 && OpSIBLING(next->blk_oldcop)->op_type == OP_SUBST)
2227 #define su_context_here() su_context_normalize_up(su_context_skip_db(cxstack_ix))
2229 static I32 su_context_gimme(pTHX_ I32 cxix) {
2230 #define su_context_gimme(C) su_context_gimme(aTHX_ (C))
2233 for (i = cxix; i >= 0; --i) {
2234 PERL_CONTEXT *cx = cxstack + i;
2236 switch (CxTYPE(cx)) {
2237 /* gimme is always G_ARRAY for loop contexts. */
2238 #if SU_HAS_PERL(5, 11, 0)
2240 case CXt_LOOP_PLAIN:
2241 case CXt_LOOP_LAZYSV:
2242 case CXt_LOOP_LAZYIV:
2247 const COP *cop = cx->blk_oldcop;
2248 if (cop && OpSIBLING(cop)) {
2249 switch (OpSIBLING(cop)->op_flags & OPf_WANT) {
2252 case OPf_WANT_SCALAR:
2271 /* --- Global setup/teardown ----------------------------------------------- */
2273 static VOL U32 su_initialized = 0;
2275 static void su_global_teardown(pTHX_ void *root) {
2276 if (!su_initialized)
2284 SU_LOCK(&su_uid_seq_counter_mutex);
2285 PerlMemShared_free(su_uid_seq_counter.seqs);
2286 su_uid_seq_counter.size = 0;
2287 SU_UNLOCK(&su_uid_seq_counter_mutex);
2289 MUTEX_DESTROY(&su_uid_seq_counter_mutex);
2296 XS(XS_Scope__Upper_unwind);
2297 XS(XS_Scope__Upper_yield);
2298 XS(XS_Scope__Upper_leave);
2300 #if SU_HAS_PERL(5, 9, 0)
2301 # define SU_XS_FILE_TYPE const char
2303 # define SU_XS_FILE_TYPE char
2306 static void su_global_setup(pTHX_ SU_XS_FILE_TYPE *file) {
2307 #define su_global_setup(F) su_global_setup(aTHX_ (F))
2313 MUTEX_INIT(&su_uid_seq_counter_mutex);
2315 SU_LOCK(&su_uid_seq_counter_mutex);
2316 su_uid_seq_counter.seqs = NULL;
2317 su_uid_seq_counter.size = 0;
2318 SU_UNLOCK(&su_uid_seq_counter_mutex);
2320 stash = gv_stashpv(__PACKAGE__, 1);
2321 newCONSTSUB(stash, "TOP", newSViv(0));
2322 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
2324 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
2325 newXSproto("Scope::Upper::yield", XS_Scope__Upper_yield, file, NULL);
2326 newXSproto("Scope::Upper::leave", XS_Scope__Upper_leave, file, NULL);
2329 call_atexit(su_global_teardown, aTHX);
2331 call_atexit(su_global_teardown, NULL);
2339 /* --- Interpreter setup/teardown ------------------------------------------ */
2341 static void su_local_teardown(pTHX_ void *param) {
2346 map = MY_CXT.uid_storage.map;
2349 for (i = 0; i < MY_CXT.uid_storage.used; ++i)
2354 cur = MY_CXT.uplevel_storage.root;
2356 su_uplevel_ud *prev;
2360 su_uplevel_ud_delete(prev);
2367 static void su_local_setup(pTHX) {
2368 #define su_local_setup() su_local_setup(aTHX)
2371 MY_CXT.stack_placeholder = NULL;
2373 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
2374 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
2375 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
2376 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
2378 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
2379 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
2380 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
2382 Zero(&(MY_CXT.yield_storage.leave_op), 1, UNOP);
2383 MY_CXT.yield_storage.leave_op.op_type = OP_STUB;
2384 MY_CXT.yield_storage.leave_op.op_ppaddr = NULL;
2386 Zero(&(MY_CXT.yield_storage.proxy_op), 1, OP);
2387 MY_CXT.yield_storage.proxy_op.op_type = OP_STUB;
2388 MY_CXT.yield_storage.proxy_op.op_ppaddr = NULL;
2390 MY_CXT.uplevel_storage.top = NULL;
2391 MY_CXT.uplevel_storage.root = NULL;
2392 MY_CXT.uplevel_storage.count = 0;
2394 MY_CXT.uid_storage.map = NULL;
2395 MY_CXT.uid_storage.used = 0;
2396 MY_CXT.uid_storage.alloc = 0;
2398 call_atexit(su_local_teardown, NULL);
2403 /* --- XS ------------------------------------------------------------------ */
2405 #define SU_GET_CONTEXT(A, B, D) \
2414 else if (cxix > cxstack_ix) \
2422 #define SU_GET_LEVEL(A, B) \
2428 level = SvIV(lsv); \
2435 #if SU_HAS_PERL(5, 10, 0)
2436 # define SU_INFO_COUNT 11
2438 # define SU_INFO_COUNT 10
2441 XS(XS_Scope__Upper_unwind) {
2450 PERL_UNUSED_VAR(cv); /* -W */
2451 PERL_UNUSED_VAR(ax); /* -Wall */
2453 SU_GET_CONTEXT(0, items - 1, cxstack_ix);
2455 PERL_CONTEXT *cx = cxstack + cxix;
2456 switch (CxTYPE(cx)) {
2458 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2462 MY_CXT.unwind_storage.cxix = cxix;
2463 MY_CXT.unwind_storage.items = items;
2464 MY_CXT.unwind_storage.savesp = PL_stack_sp;
2466 MY_CXT.unwind_storage.items--;
2467 MY_CXT.unwind_storage.savesp--;
2469 /* pp_entersub will want to sanitize the stack after returning from there
2470 * Screw that, we're insane!
2471 * dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
2472 if (GIMME_V == G_SCALAR)
2473 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2474 SAVEDESTRUCTOR_X(su_unwind, NULL);
2479 } while (--cxix >= 0);
2480 croak("Can't return outside a subroutine");
2483 static const char su_yield_name[] = "yield";
2485 XS(XS_Scope__Upper_yield) {
2494 PERL_UNUSED_VAR(cv); /* -W */
2495 PERL_UNUSED_VAR(ax); /* -Wall */
2497 SU_GET_CONTEXT(0, items - 1, su_context_here());
2498 MY_CXT.yield_storage.cxix = cxix;
2499 MY_CXT.yield_storage.items = items;
2500 MY_CXT.yield_storage.savesp = PL_stack_sp;
2502 MY_CXT.yield_storage.items--;
2503 MY_CXT.yield_storage.savesp--;
2505 /* See XS_Scope__Upper_unwind */
2506 if (GIMME_V == G_SCALAR)
2507 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2508 SAVEDESTRUCTOR_X(su_yield, su_yield_name);
2512 static const char su_leave_name[] = "leave";
2514 XS(XS_Scope__Upper_leave) {
2522 PERL_UNUSED_VAR(cv); /* -W */
2523 PERL_UNUSED_VAR(ax); /* -Wall */
2525 MY_CXT.yield_storage.cxix = su_context_here();
2526 MY_CXT.yield_storage.items = items;
2527 MY_CXT.yield_storage.savesp = PL_stack_sp;
2528 /* See XS_Scope__Upper_unwind */
2529 if (GIMME_V == G_SCALAR)
2530 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2531 SAVEDESTRUCTOR_X(su_yield, su_leave_name);
2535 MODULE = Scope::Upper PACKAGE = Scope::Upper
2541 su_global_setup(file);
2551 su_uid_storage new_cxt;
2558 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
2562 MY_CXT.uplevel_storage.top = NULL;
2563 MY_CXT.uplevel_storage.root = NULL;
2564 MY_CXT.uplevel_storage.count = 0;
2565 MY_CXT.uid_storage = new_cxt;
2569 #endif /* SU_THREADSAFE */
2577 cxix = su_context_here();
2588 SU_GET_CONTEXT(0, 0, su_context_here());
2591 cxix = su_context_skip_db(cxix);
2592 cxix = su_context_normalize_up(cxix);
2594 warn(su_stack_smash);
2606 SU_GET_CONTEXT(0, 0, cxstack_ix);
2608 for (; cxix >= 0; --cxix) {
2609 PERL_CONTEXT *cx = cxstack + cxix;
2610 switch (CxTYPE(cx)) {
2614 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2628 SU_GET_CONTEXT(0, 0, cxstack_ix);
2630 for (; cxix >= 0; --cxix) {
2631 PERL_CONTEXT *cx = cxstack + cxix;
2632 switch (CxTYPE(cx)) {
2649 cxix = su_context_here();
2650 while (--level >= 0) {
2652 warn(su_stack_smash);
2656 cxix = su_context_skip_db(cxix);
2657 cxix = su_context_normalize_up(cxix);
2670 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2671 PERL_CONTEXT *cx = cxstack + cxix;
2672 switch (CxTYPE(cx)) {
2674 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2685 warn(su_stack_smash);
2696 SU_GET_CONTEXT(0, 0, cxstack_ix);
2699 PERL_CONTEXT *cx = cxstack + cxix--;
2700 switch (CxTYPE(cx)) {
2702 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2706 I32 gimme = cx->blk_gimme;
2708 case G_VOID: XSRETURN_UNDEF; break;
2709 case G_SCALAR: XSRETURN_NO; break;
2710 case G_ARRAY: XSRETURN_YES; break;
2723 const PERL_CONTEXT *cx, *dbcx;
2726 SU_GET_CONTEXT(0, 0, su_context_skip_db(cxstack_ix));
2727 cxix = su_context_normalize_up(cxix);
2728 cx = cxstack + cxix;
2730 if (PL_DBsub && cxix && (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)) {
2731 I32 i = su_context_skip_db(cxix - 1) + 1;
2732 if (i < cxix && CxTYPE(cxstack + i) == CXt_SUB)
2735 cop = cx->blk_oldcop;
2736 EXTEND(SP, SU_INFO_COUNT);
2739 HV *stash = CopSTASH(cop);
2741 PUSHs(su_newmortal_pvn(HvNAME(stash), HvNAMELEN(stash)));
2743 PUSHs(&PL_sv_undef);
2746 PUSHs(su_newmortal_pvn(OutCopFILE(cop), OutCopFILE_len(cop)));
2748 mPUSHi(CopLINE(cop));
2749 /* subroutine (3) and has_args (4) */
2750 switch (CxTYPE(cx)) {
2753 GV *cvgv = CvGV(dbcx->blk_sub.cv);
2754 if (cvgv && isGV(cvgv)) {
2755 SV *sv = sv_newmortal();
2756 gv_efullname3(sv, cvgv, NULL);
2759 PUSHs(su_newmortal_pvs("(unknown)"));
2768 PUSHs(su_newmortal_pvs("(eval)"));
2772 PUSHs(&PL_sv_undef);
2773 PUSHs(&PL_sv_undef);
2776 switch (su_context_gimme(cxix)) {
2783 default: /* G_VOID */
2784 PUSHs(&PL_sv_undef);
2787 /* eval text (6) and is_require (7) */
2788 switch (CxTYPE(cx)) {
2790 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
2792 #if SU_HAS_PERL(5, 17, 4)
2793 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
2794 SvCUR(cx->blk_eval.cur_text)-2,
2795 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
2797 PUSHs(cx->blk_eval.cur_text);
2801 } else if (cx->blk_eval.old_namesv) {
2803 PUSHs(sv_mortalcopy(cx->blk_eval.old_namesv));
2809 /* Anything else including eval BLOCK */
2810 PUSHs(&PL_sv_undef);
2811 PUSHs(&PL_sv_undef);
2815 mPUSHi(CopHINTS_get(cop));
2819 #if SU_HAS_PERL(5, 9, 4)
2820 STRLEN *old_warnings = cop->cop_warnings;
2822 SV *old_warnings = cop->cop_warnings;
2824 if (old_warnings == pWARN_STD) {
2825 if (PL_dowarn & G_WARN_ON)
2826 goto context_info_warnings_on;
2828 #if SU_HAS_PERL(5, 17, 4)
2829 mask = &PL_sv_undef;
2831 goto context_info_warnings_off;
2833 } else if (old_warnings == pWARN_NONE) {
2834 #if !SU_HAS_PERL(5, 17, 4)
2835 context_info_warnings_off:
2837 mask = su_newmortal_pvn(WARN_NONEstring, WARNsize);
2838 } else if (old_warnings == pWARN_ALL) {
2840 context_info_warnings_on:
2841 #if SU_HAS_PERL(5, 8, 7)
2842 bits = get_hv("warnings::Bits", 0);
2844 SV **bits_all = hv_fetchs(bits, "all", FALSE);
2846 mask = sv_mortalcopy(*bits_all);
2850 mask = su_newmortal_pvn(WARN_ALLstring, WARNsize);
2852 #if SU_HAS_PERL(5, 9, 4)
2853 mask = su_newmortal_pvn((char *) (old_warnings + 1), old_warnings[0]);
2855 mask = sv_mortalcopy(old_warnings);
2860 #if SU_HAS_PERL(5, 10, 0)
2861 /* hints hash (10) */
2863 COPHH *hints_hash = CopHINTHASH_get(cop);
2865 SV *rhv = sv_2mortal(newRV_noinc((SV *) cophh_2hv(hints_hash, 0)));
2868 PUSHs(&PL_sv_undef);
2872 XSRETURN(SU_INFO_COUNT);
2881 SU_GET_CONTEXT(1, 1, su_context_skip_db(cxstack_ix));
2882 cxix = su_context_normalize_down(cxix);
2883 Newx(ud, 1, su_ud_reap);
2884 SU_UD_TYPE(ud) = SU_UD_TYPE_REAP;
2885 ud->cb = (SvROK(hook) && SvTYPE(SvRV(hook)) >= SVt_PVCV)
2886 ? SvRV(hook) : hook;
2887 SvREFCNT_inc_simple_void(ud->cb);
2888 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2891 localize(SV *sv, SV *val, ...)
2898 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2899 cxix = su_context_normalize_down(cxix);
2900 Newx(ud, 1, su_ud_localize);
2901 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2902 size = su_ud_localize_init(ud, sv, val, NULL);
2903 su_init(ud, cxix, size);
2906 localize_elem(SV *sv, SV *elem, SV *val, ...)
2913 if (SvTYPE(sv) >= SVt_PVGV)
2914 croak("Can't infer the element localization type from a glob and the value");
2915 SU_GET_CONTEXT(3, 3, su_context_skip_db(cxstack_ix));
2916 cxix = su_context_normalize_down(cxix);
2917 Newx(ud, 1, su_ud_localize);
2918 /* Initialize SU_UD_ORIGIN(ud) in case SU_UD_LOCALIZE_FREE(ud) needs it */
2919 SU_UD_ORIGIN(ud) = NULL;
2920 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2921 size = su_ud_localize_init(ud, sv, val, elem);
2922 if (SU_UD_PRIVATE(ud) != SVt_PVAV && SU_UD_PRIVATE(ud) != SVt_PVHV) {
2923 SU_UD_LOCALIZE_FREE(ud);
2924 croak("Can't localize an element of something that isn't an array or a hash");
2926 su_init(ud, cxix, size);
2929 localize_delete(SV *sv, SV *elem, ...)
2936 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2937 cxix = su_context_normalize_down(cxix);
2938 Newx(ud, 1, su_ud_localize);
2939 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2940 size = su_ud_localize_init(ud, sv, NULL, elem);
2941 su_init(ud, cxix, size);
2944 uplevel(SV *code, ...)
2947 I32 cxix, ret, args = 0;
2951 if (SvTYPE(code) < SVt_PVCV)
2952 croak("First argument to uplevel must be a code reference");
2953 SU_GET_CONTEXT(1, items - 1, cxstack_ix);
2955 PERL_CONTEXT *cx = cxstack + cxix;
2956 switch (CxTYPE(cx)) {
2958 croak("Can't uplevel to an eval frame");
2960 croak("Can't uplevel to a format frame");
2962 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2968 /* su_uplevel() takes care of extending the stack if needed. */
2969 ret = su_uplevel((CV *) code, cxix, args);
2974 } while (--cxix >= 0);
2975 croak("Can't uplevel outside a subroutine");
2984 SU_GET_CONTEXT(0, 0, su_context_here());
2985 uid = su_uid_get(cxix);
2991 validate_uid(SV *uid)
2996 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;