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";
262 static const char su_no_such_target[] = "No targetable %s scope in the current stack";
264 /* --- Unique context ID global storage ------------------------------------ */
266 /* ... Sequence ID counter ................................................. */
273 static su_uv_array su_uid_seq_counter;
277 static perl_mutex su_uid_seq_counter_mutex;
279 #define SU_LOCK(M) MUTEX_LOCK(M)
280 #define SU_UNLOCK(M) MUTEX_UNLOCK(M)
282 #else /* USE_ITHREADS */
287 #endif /* !USE_ITHREADS */
289 static UV su_uid_seq_next(pTHX_ UV depth) {
290 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
294 SU_LOCK(&su_uid_seq_counter_mutex);
296 seqs = su_uid_seq_counter.seqs;
298 if (depth >= su_uid_seq_counter.size) {
301 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
302 for (i = su_uid_seq_counter.size; i <= depth; ++i)
305 su_uid_seq_counter.seqs = seqs;
306 su_uid_seq_counter.size = depth + 1;
311 SU_UNLOCK(&su_uid_seq_counter_mutex);
316 /* ... UID storage ......................................................... */
323 #define SU_UID_ACTIVE 1
325 static UV su_uid_depth(pTHX_ I32 cxix) {
326 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
331 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
332 depth += si->si_cxix + 1;
343 static void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
344 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
345 su_uid *old_map = old_cxt->map;
348 su_uid *new_map = new_cxt->map;
349 STRLEN old_used = old_cxt->used;
350 STRLEN new_used, new_alloc;
353 new_used = max_depth < old_used ? max_depth : old_used;
354 new_cxt->used = new_used;
356 if (new_used <= new_cxt->alloc) {
357 new_alloc = new_cxt->alloc;
359 new_alloc = new_used;
360 Renew(new_map, new_alloc, su_uid);
361 new_cxt->map = new_map;
362 new_cxt->alloc = new_alloc;
365 for (i = 0; i < new_alloc; ++i) {
366 su_uid *new_uid = new_map + i;
368 if (i < new_used) { /* => i < max_depth && i < old_used */
369 su_uid *old_uid = old_map + i;
371 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
385 /* --- unwind() global storage --------------------------------------------- */
395 /* --- yield() global storage ---------------------------------------------- */
405 /* --- uplevel() data tokens and global storage ---------------------------- */
407 #define SU_UPLEVEL_HIJACKS_RUNOPS SU_HAS_PERL(5, 8, 0)
412 su_uid_storage tmp_uid_storage;
413 su_uid_storage old_uid_storage;
424 PERL_SI *old_curstackinfo;
430 #if SU_UPLEVEL_HIJACKS_RUNOPS
431 runops_proc_t old_runops;
438 static su_uplevel_ud *su_uplevel_ud_new(pTHX) {
439 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
443 Newx(sud, 1, su_uplevel_ud);
446 sud->tmp_uid_storage.map = NULL;
447 sud->tmp_uid_storage.used = 0;
448 sud->tmp_uid_storage.alloc = 0;
450 Newx(si, 1, PERL_SI);
451 si->si_stack = newAV();
452 AvREAL_off(si->si_stack);
453 si->si_cxstack = NULL;
461 static void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
462 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
463 PERL_SI *si = sud->si;
465 Safefree(si->si_cxstack);
466 SvREFCNT_dec(si->si_stack);
469 Safefree(sud->tmp_uid_storage.map);
480 } su_uplevel_storage;
482 #ifndef SU_UPLEVEL_STORAGE_SIZE
483 # define SU_UPLEVEL_STORAGE_SIZE 4
486 /* --- Global data --------------------------------------------------------- */
488 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
491 char *stack_placeholder;
492 su_unwind_storage unwind_storage;
493 su_yield_storage yield_storage;
494 su_uplevel_storage uplevel_storage;
495 su_uid_storage uid_storage;
500 /* --- Stack manipulations ------------------------------------------------- */
502 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
504 #define SU_SAVE_DESTRUCTOR_SIZE 3
505 #define SU_SAVE_PLACEHOLDER_SIZE 3
507 #define SU_SAVE_SCALAR_SIZE 3
509 #define SU_SAVE_ARY_SIZE 3
510 #define SU_SAVE_AELEM_SIZE 4
512 # define SU_SAVE_ADELETE_SIZE 3
514 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
516 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
517 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
519 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
522 #define SU_SAVE_HASH_SIZE 3
523 #define SU_SAVE_HELEM_SIZE 4
524 #define SU_SAVE_HDELETE_SIZE 4
525 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
526 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
528 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
531 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
533 #if !SU_HAS_PERL(5, 8, 9)
534 # define SU_SAVE_GP_SIZE 6
535 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
536 # define SU_SAVE_GP_SIZE 3
537 #elif !SU_HAS_PERL(5, 13, 8)
538 # define SU_SAVE_GP_SIZE 4
540 # define SU_SAVE_GP_SIZE 3
543 #ifndef SvCANEXISTDELETE
544 # define SvCANEXISTDELETE(sv) \
546 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
547 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
548 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
549 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
554 /* ... Saving array elements ............................................... */
556 static I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
557 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
563 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
564 #if SU_HAS_PERL(5, 8, 1)
565 if (SvRMAGICAL(av)) {
566 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
568 SV * const * const negative_indices_glob =
569 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
570 NEGATIVE_INDICES_VAR, 16, 0);
571 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
577 idx = key + av_len(av) + 1;
591 static void su_adelete(pTHX_ void *ud_) {
592 su_ud_adelete *ud = (su_ud_adelete *) ud_;
594 av_delete(ud->av, ud->idx, G_DISCARD);
595 SvREFCNT_dec(ud->av);
600 static void su_save_adelete(pTHX_ AV *av, I32 idx) {
601 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
604 Newx(ud, 1, su_ud_adelete);
607 SvREFCNT_inc_simple_void(av);
609 SAVEDESTRUCTOR_X(su_adelete, ud);
612 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
614 #endif /* SAVEADELETE */
616 static void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
617 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
624 idx = su_av_key2idx(av, SvIV(key));
626 if (SvCANEXISTDELETE(av))
627 preeminent = av_exists(av, idx);
629 svp = av_fetch(av, idx, 1);
630 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
633 save_aelem(av, idx, svp);
635 SAVEADELETE(av, idx);
637 if (val) { /* local $x[$idx] = $val; */
638 SvSetMagicSV(*svp, val);
639 } else { /* local $x[$idx]; delete $x[$idx]; */
640 av_delete(av, idx, G_DISCARD);
644 /* ... Saving hash elements ................................................ */
646 static void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
647 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
654 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
655 preeminent = hv_exists_ent(hv, keysv, 0);
657 he = hv_fetch_ent(hv, keysv, 1, 0);
658 svp = he ? &HeVAL(he) : NULL;
659 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
661 if (HvNAME_get(hv) && isGV(*svp)) {
662 save_gp((GV *) *svp, 0);
667 save_helem(hv, keysv, svp);
670 const char * const key = SvPV_const(keysv, keylen);
671 SAVEDELETE(hv, savepvn(key, keylen),
672 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
675 if (val) { /* local $x{$keysv} = $val; */
676 SvSetMagicSV(*svp, val);
677 } else { /* local $x{$keysv}; delete $x{$keysv}; */
678 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
682 /* ... Saving code slots from a glob ....................................... */
684 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
685 # define mro_method_changed_in(G) PL_sub_generation++
693 static void su_restore_gvcv(pTHX_ void *ud_) {
694 su_save_gvcv_ud *ud = ud_;
697 GvCV_set(gv, ud->old_cv);
699 mro_method_changed_in(GvSTASH(gv));
704 static void su_save_gvcv(pTHX_ GV *gv) {
705 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
708 Newx(ud, 1, su_save_gvcv_ud);
710 ud->old_cv = GvCV(gv);
714 mro_method_changed_in(GvSTASH(gv));
716 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
719 /* --- Actions ------------------------------------------------------------- */
730 #define SU_UD_TYPE(U) (((su_ud_common *) (U))->type)
731 #define SU_UD_PRIVATE(U) (((su_ud_common *) (U))->private)
732 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
733 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
734 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
736 #define SU_UD_TYPE_REAP 0
737 #define SU_UD_TYPE_LOCALIZE 1
738 #define SU_UD_TYPE_UID 2
740 #define SU_UD_FREE(U) STMT_START { \
741 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
745 /* ... Reap ................................................................ */
747 #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))
754 #define SU_UD_REAP_CB(U) (((su_ud_reap *) (U))->cb)
756 static void su_call(pTHX_ SV *cb) {
759 PERL_CONTEXT saved_cx;
760 #endif /* SU_SAVE_LAST_CX */
765 PerlIO_printf(Perl_debug_log,
766 "@@@ call scope_ix=%2d save_ix=%2d\n",
767 PL_scopestack_ix, PL_savestack_ix);
777 /* If the recently popped context isn't saved there, it will be overwritten by
778 * the sub scope from call_sv, although it's still needed in our caller. */
779 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
780 saved_cx = cxstack[cxix];
781 #endif /* SU_SAVE_LAST_CX */
786 cxstack[cxix] = saved_cx;
787 #endif /* SU_SAVE_LAST_CX */
799 /* ... Localize & localize array/hash element .............................. */
808 #define SU_UD_LOCALIZE_SV(U) (((su_ud_localize *) (U))->sv)
809 #define SU_UD_LOCALIZE_VAL(U) (((su_ud_localize *) (U))->val)
810 #define SU_UD_LOCALIZE_ELEM(U) (((su_ud_localize *) (U))->elem)
812 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
813 SvREFCNT_dec(SU_UD_LOCALIZE_ELEM(U)); \
814 SvREFCNT_dec(SU_UD_LOCALIZE_VAL(U)); \
815 SvREFCNT_dec(SU_UD_LOCALIZE_SV(U)); \
819 static I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
820 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
825 SvREFCNT_inc_simple_void(sv);
827 if (SvTYPE(sv) >= SVt_PVGV) {
828 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
830 } else { /* local *x = \$val; */
831 t = SvTYPE(SvRV(val));
834 } else if (SvROK(sv)) {
835 croak("Invalid %s reference as the localization target",
836 sv_reftype(SvRV(sv), 0));
839 const char *p = SvPV_const(sv, len), *s;
840 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
846 case '$': t = SVt_PV; break;
847 case '@': t = SVt_PVAV; break;
848 case '%': t = SVt_PVHV; break;
849 case '&': t = SVt_PVCV; break;
850 case '*': t = SVt_PVGV; break;
855 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
856 if (SvROK(val) && !sv_isobject(val)) {
857 t = SvTYPE(SvRV(val));
869 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
874 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
879 size = SU_SAVE_GP_SIZE;
883 size = SU_SAVE_GVCV_SIZE;
887 size = SU_SAVE_SCALAR_SIZE;
890 /* When deref is set, val isn't NULL */
892 SU_UD_PRIVATE(ud) = t;
895 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
896 ud->elem = SvREFCNT_inc(elem);
901 static void su_localize(pTHX_ void *ud_) {
902 #define su_localize(U) su_localize(aTHX_ (U))
903 su_ud_localize *ud = (su_ud_localize *) ud_;
907 svtype t = SU_UD_PRIVATE(ud);
910 if (SvTYPE(sv) >= SVt_PVGV) {
914 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
917 const char *name = SvPV_const(sv, len);
918 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
925 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
926 PerlIO_printf(Perl_debug_log,
927 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
928 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
932 /* Inspired from Alias.pm */
936 su_save_aelem(GvAV(gv), elem, val);
943 su_save_helem(GvHV(gv), elem, val);
949 save_gp(gv, 1); /* hide previous entry in symtab */
955 gv = (GV *) save_scalar(gv);
960 SvSetMagicSV((SV *) gv, val);
965 /* ... Unique context ID ................................................... */
967 /* We must pass the index because MY_CXT.uid_storage might be reallocated
968 * between the UID fetch and the invalidation at the end of scope. */
975 static void su_uid_drop(pTHX_ void *ud_) {
979 MY_CXT.uid_storage.map[ud->idx].flags &= ~SU_UID_ACTIVE;
986 /* --- Pop a context back -------------------------------------------------- */
989 # define SU_CXNAME(C) PL_block_type[CxTYPE(C)]
991 # if SU_HAS_PERL(5, 11, 0)
992 static const char *su_block_type[] = {
1006 # elif SU_HAS_PERL(5, 9, 3)
1007 static const char *su_block_type[] = {
1022 static const char *su_block_type[] = {
1031 # define SU_CXNAME(C) su_block_type[CxTYPE(C)]
1034 static void su_pop(pTHX_ void *ud) {
1035 #define su_pop(U) su_pop(aTHX_ (U))
1036 I32 depth, base, mark, *origin;
1037 depth = SU_UD_DEPTH(ud);
1040 PerlIO_printf(Perl_debug_log,
1041 "%p: --- pop a %s\n"
1042 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
1043 ud, SU_CXNAME(cxstack + cxstack_ix),
1044 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
1047 origin = SU_UD_ORIGIN(ud);
1048 mark = origin[depth];
1049 base = origin[depth - 1];
1051 SU_D(PerlIO_printf(Perl_debug_log,
1052 "%p: original scope was %*c top=%2d base=%2d\n",
1053 ud, 24, ' ', mark, base));
1056 #if SU_HAS_PERL(5, 19, 4)
1061 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
1063 #if SU_HAS_PERL(5, 19, 4)
1064 cx = cxstack + cxstack_ix;
1065 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1066 save = PL_scopestack[cx->blk_oldscopesp - 1];
1069 PL_savestack_ix = mark;
1072 #if SU_HAS_PERL(5, 19, 4)
1073 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1074 PL_scopestack[cx->blk_oldscopesp - 1] = save;
1077 PL_savestack_ix = base;
1079 SU_UD_DEPTH(ud) = --depth;
1084 if ((pad = SU_UD_PAD(ud)) > 0) {
1087 SU_D(PerlIO_printf(Perl_debug_log,
1088 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
1089 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1090 SU_SAVE_PLACEHOLDER();
1094 SU_D(PerlIO_printf(Perl_debug_log,
1095 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
1096 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1097 SAVEDESTRUCTOR_X(su_pop, ud);
1099 switch (SU_UD_TYPE(ud)) {
1100 case SU_UD_TYPE_REAP: {
1102 PerlIO_printf(Perl_debug_log,
1103 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
1104 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
1106 SAVEDESTRUCTOR_X(su_call, SU_UD_REAP_CB(ud));
1110 case SU_UD_TYPE_LOCALIZE:
1112 SU_UD_LOCALIZE_FREE(ud);
1114 case SU_UD_TYPE_UID:
1115 SAVEDESTRUCTOR_X(su_uid_drop, ud);
1120 SU_D(PerlIO_printf(Perl_debug_log,
1121 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
1122 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
1125 /* --- Initialize the stack and the action userdata ------------------------ */
1127 static I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
1128 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
1129 I32 i, depth, offset, base, *origin;
1132 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
1134 /* su_pop() is going to be called from leave_scope(), so before pushing the
1135 * next callback, we'll want to flush the current scope stack slice first.
1136 * However, if we want the next callback not to be processed immediately by
1137 * the current leave_scope(), we'll need to hide it by artificially
1138 * incrementing the scope stack marker before. For the intermediate bumps,
1139 * we will only need a bump of SU_SAVE_DESTRUCTOR_SIZE items, but for the
1140 * last one we will need a bump of size items. However, in order to preserve
1141 * the natural ordering between scope stack markers, we cannot bump lower
1142 * markers more than higher ones. This is why we bump the intermediate markers
1143 * by the smallest multiple of SU_SAVE_PLACEHOLDER_SIZE greater or equal to
1144 * max(SU_SAVE_DESTRUCTOR_SIZE, size). */
1146 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
1149 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
1150 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
1151 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
1154 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
1156 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
1157 ud, size, pad, offset));
1159 depth = PL_scopestack_ix - cxstack[cxix].blk_oldscopesp;
1160 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
1162 /* We need to bump all the intermediary stack markers just in case an
1163 * exception is thrown before the target scope is reached. Indeed, in this
1164 * case there might be arbitrary many scope frames flushed at the same time,
1165 * and since we cannot know in advance whether this will happen or not, we
1166 * have to make sure the final frame is protected for the actual action. But
1167 * of course, in order to do that, we also need to bump all the previous stack
1168 * markers. If not for this, it should have been possible to just bump the two
1169 * next frames in su_pop(). */
1171 Newx(origin, depth + 1, I32);
1172 base = PL_scopestack_ix - depth;
1173 origin[0] = PL_scopestack[base];
1174 PL_scopestack[base] += size;
1175 for (i = 1; i < depth; ++i) {
1177 origin[i] = PL_scopestack[j];
1178 PL_scopestack[j] += offset;
1180 origin[depth] = PL_savestack_ix;
1182 SU_UD_PAD(ud) = pad;
1183 SU_UD_DEPTH(ud) = depth;
1184 SU_UD_ORIGIN(ud) = origin;
1186 /* Make sure the first destructor fires by pushing enough fake slots on the
1188 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1189 <= PL_scopestack[PL_scopestack_ix - 1]) {
1192 SU_D(PerlIO_printf(Perl_debug_log,
1193 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1194 ud, PL_scopestack_ix, PL_savestack_ix));
1195 SU_SAVE_PLACEHOLDER();
1196 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1197 <= PL_scopestack[PL_scopestack_ix - 1]);
1199 SU_D(PerlIO_printf(Perl_debug_log,
1200 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1201 ud, PL_scopestack_ix, PL_savestack_ix));
1202 SAVEDESTRUCTOR_X(su_pop, ud);
1205 for (i = 0; i <= depth; ++i) {
1206 I32 j = PL_scopestack_ix - i;
1207 PerlIO_printf(Perl_debug_log,
1208 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1209 ud, i, j, origin[depth - i],
1210 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1217 /* --- Unwind stack -------------------------------------------------------- */
1219 static void su_unwind(pTHX_ void *ud_) {
1221 I32 cxix = MY_CXT.unwind_storage.cxix;
1222 I32 items = MY_CXT.unwind_storage.items;
1225 PERL_UNUSED_VAR(ud_);
1227 PL_stack_sp = MY_CXT.unwind_storage.savesp;
1228 #if SU_HAS_PERL(5, 19, 4)
1231 SV **sp = PL_stack_sp;
1232 for (i = -items + 1; i <= 0; ++i)
1234 sv_2mortal(SvREFCNT_inc(sp[i]));
1238 if (cxstack_ix > cxix)
1241 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1242 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1245 I32 gimme = GIMME_V;
1246 PerlIO_printf(Perl_debug_log,
1247 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1249 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1250 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1253 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1254 PL_op = PL_op->op_ppaddr(aTHX);
1256 *PL_markstack_ptr = mark;
1258 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1259 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1262 /* --- Yield --------------------------------------------------------------- */
1264 #if SU_HAS_PERL(5, 10, 0)
1265 # define SU_RETOP_SUB(C) ((C)->blk_sub.retop)
1266 # define SU_RETOP_EVAL(C) ((C)->blk_eval.retop)
1267 # define SU_RETOP_LOOP(C) ((C)->blk_loop.my_op->op_lastop->op_next)
1268 # define SU_RETOP_GIVEN(C) ((C)->blk_givwhen.leave_op->op_next)
1270 # define SU_RETOP_SUB(C) ((C)->blk_oldretsp > 0 ? PL_retstack[(C)->blk_oldretsp - 1] : NULL)
1271 # define SU_RETOP_EVAL(C) SU_RETOP_SUB(C)
1272 # define SU_RETOP_LOOP(C) ((C)->blk_loop.last_op->op_next)
1275 static void su_yield(pTHX_ void *ud_) {
1278 const char *which = ud_;
1279 I32 cxix = MY_CXT.yield_storage.cxix;
1280 I32 items = MY_CXT.yield_storage.items;
1281 opcode type = OP_NULL;
1285 PERL_UNUSED_VAR(ud_);
1287 cx = cxstack + cxix;
1288 switch (CxTYPE(cx)) {
1290 I32 i, cur = cxstack_ix, n = 1;
1292 /* Is this actually a given/when block? This may occur only when yield was
1293 * called with HERE (or nothing) as the context. */
1294 #if SU_HAS_PERL(5, 10, 0)
1296 PERL_CONTEXT *prev = cx - 1;
1297 U8 prev_type = CxTYPE(prev);
1298 if ((prev_type == CXt_GIVEN || prev_type == CXt_WHEN)
1299 && (prev->blk_oldcop == cx->blk_oldcop)) {
1302 if (prev_type == CXt_GIVEN)
1311 /* Bare blocks (that appear as do { ... } blocks, map { ... } blocks or
1312 * constant folded blcoks) don't need to save the op to return to anywhere
1313 * since 'last' isn't supposed to work inside them. So we climb higher in
1314 * the context stack until we reach a context that has a return op (i.e. a
1315 * sub, an eval, a format or a real loop), recording how many blocks we
1316 * crossed. Then we follow the op_next chain until we get to the leave op
1317 * that closes the original block, which we are assured to reach since
1318 * everything is static (the blocks we have crossed cannot be evals or
1319 * subroutine calls). */
1320 for (i = cxix + 1; i <= cur; ++i) {
1321 PERL_CONTEXT *cx2 = cxstack + i;
1322 switch (CxTYPE(cx2)) {
1328 o = SU_RETOP_SUB(cx2);
1331 o = SU_RETOP_EVAL(cx2);
1333 #if SU_HAS_PERL(5, 11, 0)
1335 case CXt_LOOP_PLAIN:
1336 case CXt_LOOP_LAZYSV:
1337 case CXt_LOOP_LAZYIV:
1341 o = SU_RETOP_LOOP(cx2);
1350 /* We may find other enter/leave blocks on our way to the matching leave.
1351 * Make sure the depth is incremented/decremented appropriately. */
1352 if (o->op_type == OP_ENTER) {
1354 } else if (o->op_type == OP_LEAVE) {
1368 next = SU_RETOP_SUB(cx);
1371 type = CxTRYBLOCK(cx) ? OP_LEAVETRY : OP_LEAVEEVAL;
1372 next = SU_RETOP_EVAL(cx);
1374 #if SU_HAS_PERL(5, 11, 0)
1376 case CXt_LOOP_PLAIN:
1377 case CXt_LOOP_LAZYSV:
1378 case CXt_LOOP_LAZYIV:
1382 type = OP_LEAVELOOP;
1383 next = SU_RETOP_LOOP(cx);
1385 #if SU_HAS_PERL(5, 10, 0)
1388 type = OP_LEAVEGIVEN;
1389 next = SU_RETOP_GIVEN(cx);
1393 #if SU_HAS_PERL(5, 15, 1)
1394 type = OP_LEAVEWHEN;
1397 flags |= OPf_SPECIAL;
1403 croak("%s() can't target a substitution context", which);
1406 croak("%s() doesn't know how to leave a %s context",
1407 which, SU_CXNAME(cxstack + cxix));
1411 PL_stack_sp = MY_CXT.yield_storage.savesp;
1412 #if SU_HAS_PERL(5, 19, 4)
1415 SV **sp = PL_stack_sp;
1416 for (i = -items + 1; i <= 0; ++i)
1418 sv_2mortal(SvREFCNT_inc(sp[i]));
1422 if (cxstack_ix > cxix)
1425 /* Copy the arguments passed to yield() where the leave op expects to find
1428 Move(PL_stack_sp - items + 1, PL_stack_base + cx->blk_oldsp + 1, items, SV *);
1429 PL_stack_sp = PL_stack_base + cx->blk_oldsp + items;
1431 flags |= OP_GIMME_REVERSE(cx->blk_gimme);
1433 MY_CXT.yield_storage.leave_op.op_type = type;
1434 MY_CXT.yield_storage.leave_op.op_ppaddr = PL_ppaddr[type];
1435 MY_CXT.yield_storage.leave_op.op_flags = flags;
1436 MY_CXT.yield_storage.leave_op.op_next = next;
1438 PL_op = (OP *) &(MY_CXT.yield_storage.leave_op);
1439 PL_op = PL_op->op_ppaddr(aTHX);
1441 MY_CXT.yield_storage.proxy_op.op_next = PL_op;
1442 PL_op = &(MY_CXT.yield_storage.proxy_op);
1445 /* --- Uplevel ------------------------------------------------------------- */
1447 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1448 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1450 static su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1451 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1456 sud = MY_CXT.uplevel_storage.root;
1458 MY_CXT.uplevel_storage.root = sud->next;
1459 MY_CXT.uplevel_storage.count--;
1461 sud = su_uplevel_ud_new();
1464 sud->next = MY_CXT.uplevel_storage.top;
1465 MY_CXT.uplevel_storage.top = sud;
1467 depth = su_uid_depth(cxix);
1468 su_uid_storage_dup(&sud->tmp_uid_storage, &MY_CXT.uid_storage, depth);
1469 sud->old_uid_storage = MY_CXT.uid_storage;
1470 MY_CXT.uid_storage = sud->tmp_uid_storage;
1475 #if SU_HAS_PERL(5, 13, 7)
1477 static void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1478 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1481 sud->tmp_uid_storage = MY_CXT.uid_storage;
1482 MY_CXT.uid_storage = sud->old_uid_storage;
1486 map = sud->tmp_uid_storage.map;
1487 alloc = sud->tmp_uid_storage.alloc;
1488 for (i = 0; i < alloc; ++i)
1489 map[i].flags &= ~SU_UID_ACTIVE;
1491 MY_CXT.uplevel_storage.top = sud->next;
1493 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1494 su_uplevel_ud_delete(sud);
1496 sud->next = MY_CXT.uplevel_storage.root;
1497 MY_CXT.uplevel_storage.root = sud;
1498 MY_CXT.uplevel_storage.count++;
1504 static int su_uplevel_goto_static(const OP *o) {
1505 for (; o; o = OpSIBLING(o)) {
1506 /* goto ops are unops with kids. */
1507 if (!(o->op_flags & OPf_KIDS))
1510 switch (o->op_type) {
1513 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1518 if (su_uplevel_goto_static(((const UNOP *) o)->op_first))
1527 #if SU_UPLEVEL_HIJACKS_RUNOPS
1529 static int su_uplevel_goto_runops(pTHX) {
1530 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1536 if (op->op_type == OP_GOTO) {
1537 AV *argarray = NULL;
1540 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1541 const PERL_CONTEXT *cx = cxstack + cxix;
1543 switch (CxTYPE(cx)) {
1545 if (CxHASARGS(cx)) {
1546 argarray = cx->blk_sub.argarray;
1562 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1563 AV *args = GvAV(PL_defgv);
1564 I32 items = AvFILLp(args);
1566 av_extend(argarray, items);
1567 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1568 AvFILLp(argarray) = items;
1573 PL_op = op = op->op_ppaddr(aTHX);
1575 #if !SU_HAS_PERL(5, 13, 0)
1585 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1587 #define su_at_underscore(C) PadARRAY(PadlistARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1589 static void su_uplevel_restore(pTHX_ void *sus_) {
1590 su_uplevel_ud *sud = sus_;
1591 PERL_SI *cur = sud->old_curstackinfo;
1592 PERL_SI *si = sud->si;
1594 #if SU_UPLEVEL_HIJACKS_RUNOPS
1595 if (PL_runops == su_uplevel_goto_runops)
1596 PL_runops = sud->old_runops;
1599 if (sud->callback) {
1600 PERL_CONTEXT *cx = cxstack + sud->cxix;
1601 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1603 /* We have to fix the pad entry for @_ in the original callback because it
1604 * may have been reified. */
1605 if (AvREAL(argarray)) {
1606 const I32 fill = AvFILLp(argarray);
1607 SvREFCNT_dec(argarray);
1609 AvREAL_off(argarray);
1610 AvREIFY_on(argarray);
1611 av_extend(argarray, fill);
1612 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1614 CLEAR_ARGARRAY(argarray);
1617 /* If the old cv member is our renamed CV, it means that this place has been
1618 * reached without a goto() happening, and the old argarray member is
1619 * actually our fake argarray. Destroy it properly in that case. */
1620 if (cx->blk_sub.cv == sud->renamed) {
1621 SvREFCNT_dec(cx->blk_sub.argarray);
1622 cx->blk_sub.argarray = argarray;
1625 CvDEPTH(sud->callback)--;
1626 SvREFCNT_dec(sud->callback);
1629 /* Free the renamed CV. We must do it ourselves so that we can force the
1630 * depth to be 0, or perl would complain about it being "still in use".
1631 * But we *know* that it cannot be so. */
1633 if (!CvISXSUB(sud->renamed)) {
1634 CvDEPTH(sud->renamed) = 0;
1635 CvPADLIST(sud->renamed) = NULL;
1637 SvREFCNT_dec(sud->renamed);
1640 CATCH_SET(sud->old_catch);
1642 SU_UPLEVEL_RESTORE(op);
1644 /* stack_grow() wants PL_curstack so restore the old stack first */
1645 if (PL_curstackinfo == si) {
1646 PL_curstack = cur->si_stack;
1647 if (sud->old_mainstack)
1648 SU_UPLEVEL_RESTORE(mainstack);
1649 SU_UPLEVEL_RESTORE(curstackinfo);
1652 CV *target = sud->target;
1655 /* When we die, the depth of the target CV is not updated because of the
1656 * stack switcheroo. So we have to look at all the frames between the
1657 * uplevel call and the catch block to count how many call frames to the
1658 * target CV were skipped. */
1659 for (i = cur->si_cxix; i > sud->cxix; i--) {
1660 register const PERL_CONTEXT *cx = cxstack + i;
1662 if (CxTYPE(cx) == CXt_SUB) {
1663 if (cx->blk_sub.cv == target)
1668 /* If we died, the replacement stack was already unwinded to the first
1669 * eval frame, and all the contexts down there were popped. We don't have
1670 * to pop manually any context of the original stack, because they must
1671 * have been in the replacement stack as well (since the second was copied
1672 * from the first). Thus we only have to make sure the original stack index
1673 * points to the context just below the first eval scope under the target
1675 for (; i >= 0; i--) {
1676 register const PERL_CONTEXT *cx = cxstack + i;
1678 switch (CxTYPE(cx)) {
1680 if (cx->blk_sub.cv == target)
1692 CvDEPTH(target) = sud->target_depth - levels;
1693 PL_curstackinfo->si_cxix = i - 1;
1695 #if !SU_HAS_PERL(5, 13, 1)
1696 /* Since $@ was maybe localized between the target frame and the uplevel
1697 * call, we forcefully flush the save stack to get rid of it and then
1698 * reset $@ to its proper value. Note that the the call to
1699 * su_uplevel_restore() must happen before the "reset $@" item of the save
1700 * stack is processed, as uplevel was called after the localization.
1701 * Andrew's changes to how $@ was handled, which were mainly integrated
1702 * between perl 5.13.0 and 5.13.1, fixed this. */
1703 if (ERRSV && SvTRUE(ERRSV)) {
1704 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1705 SV *errsv = SvREFCNT_inc(ERRSV);
1706 PL_scopestack_ix = cx->blk_oldscopesp;
1707 leave_scope(PL_scopestack[PL_scopestack_ix]);
1708 sv_setsv(ERRSV, errsv);
1709 SvREFCNT_dec(errsv);
1715 SU_UPLEVEL_RESTORE(curcop);
1717 SvREFCNT_dec(sud->target);
1719 PL_stack_base = AvARRAY(cur->si_stack);
1720 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1721 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1723 /* When an exception is thrown from the uplevel'd subroutine,
1724 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1725 * die_where() in more recent perls), which has the sad habit of keeping a
1726 * pointer to the current context frame across this call. This means that we
1727 * can't free the temporary context stack we used for the uplevel call right
1728 * now, or that pointer upwards would point to garbage. */
1729 #if SU_HAS_PERL(5, 13, 7)
1730 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1731 * public in perl 5.13.7. */
1732 su_uplevel_storage_delete(sud);
1734 /* Otherwise, we just enqueue it back in the global storage list. */
1738 sud->tmp_uid_storage = MY_CXT.uid_storage;
1739 MY_CXT.uid_storage = sud->old_uid_storage;
1741 MY_CXT.uplevel_storage.top = sud->next;
1742 sud->next = MY_CXT.uplevel_storage.root;
1743 MY_CXT.uplevel_storage.root = sud;
1744 MY_CXT.uplevel_storage.count++;
1751 static CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1752 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1756 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1758 CvFLAGS(cv) = CvFLAGS(proto);
1760 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1762 CvDEPTH(cv) = CvDEPTH(proto);
1764 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1766 CvFILE(cv) = CvFILE(proto);
1770 #if SU_RELEASE && SU_HAS_PERL_EXACT(5, 21, 4)
1773 CvSTASH_set(cv, CvSTASH(proto));
1774 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1775 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1776 * (which was part of perl 5.13.7). */
1777 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1779 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1782 if (CvISXSUB(proto)) {
1783 CvXSUB(cv) = CvXSUB(proto);
1784 CvXSUBANY(cv) = CvXSUBANY(proto);
1787 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1789 CvSTART(cv) = CvSTART(proto);
1790 CvPADLIST(cv) = CvPADLIST(proto);
1792 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1793 #ifdef CVf_WEAKOUTSIDE
1794 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1796 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1797 #ifdef CvOUTSIDE_SEQ
1798 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1802 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1812 static I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1813 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1815 const PERL_CONTEXT *cx = cxstack + cxix;
1817 PERL_SI *cur = PL_curstackinfo;
1823 I32 old_mark, new_mark;
1830 /* Make PL_stack_sp point just before the CV. */
1831 PL_stack_sp -= args + 1;
1832 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1835 sud = su_uplevel_storage_new(cxix);
1839 sud->callback = NULL;
1840 sud->renamed = NULL;
1841 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1845 si->si_type = cur->si_type;
1847 si->si_prev = cur->si_prev;
1849 si->si_markoff = cx->blk_oldmarksp;
1852 /* Allocate enough space for all the elements of the original stack up to the
1853 * target context, plus the forthcoming arguments. */
1854 new_mark = cx->blk_oldsp;
1855 av_extend(si->si_stack, new_mark + 1 + args + 1);
1856 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1857 AvFILLp(si->si_stack) = new_mark;
1858 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1860 /* Specialized SWITCHSTACK() */
1861 PL_stack_base = AvARRAY(si->si_stack);
1862 old_stack_sp = PL_stack_sp;
1863 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1864 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1867 /* Copy the context stack up to the context just below the target. */
1868 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1869 if (si->si_cxmax < cxix) {
1870 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1871 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1872 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1874 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1875 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1877 target = cx->blk_sub.cv;
1878 sud->target = (CV *) SvREFCNT_inc(target);
1879 sud->target_depth = CvDEPTH(target);
1881 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1882 * run-time implication, since PL_curcop will be overwritten as soon as we
1883 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1884 * make it point to the blk_oldcop for the target frame, so that caller()
1885 * reports the right file name, line number and lexical hints. */
1886 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1887 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1888 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1890 SU_UPLEVEL_SAVE(curstackinfo, si);
1891 /* If those two are equal, we need to fool POPSTACK_TO() */
1892 if (PL_mainstack == PL_curstack)
1893 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1895 sud->old_mainstack = NULL;
1896 PL_curstack = si->si_stack;
1898 renamed = su_cv_clone(callback, CvGV(target));
1899 sud->renamed = renamed;
1902 /* Both SP and old_stack_sp point just before the CV. */
1903 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1905 PUSHs((SV *) renamed);
1908 Zero(&sub_op, 1, UNOP);
1909 sub_op.op_type = OP_ENTERSUB;
1910 sub_op.op_next = NULL;
1911 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1913 sub_op.op_flags |= OPpENTERSUB_DB;
1915 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1917 #if SU_UPLEVEL_HIJACKS_RUNOPS
1918 sud->old_runops = PL_runops;
1921 sud->old_catch = CATCH_GET;
1924 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1925 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1927 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1930 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1931 CvDEPTH(callback)++;
1933 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1934 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1935 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1936 * with what we put on the stack. But we want to fake up the same arguments
1937 * as the ones in use at the context we uplevel to, so we replace the
1938 * argarray with an unreal copy of the original @_. */
1942 av_extend(av, AvMAX(cx->blk_sub.argarray));
1943 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1944 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1945 sub_cx->blk_sub.argarray = av;
1947 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1950 if (su_uplevel_goto_static(CvROOT(renamed))) {
1951 #if SU_UPLEVEL_HIJACKS_RUNOPS
1952 if (PL_runops != PL_runops_std) {
1953 if (PL_runops == PL_runops_dbg) {
1955 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1956 } else if (PL_runops != su_uplevel_goto_runops)
1957 croak("uplevel() can't execute code that calls goto with a custom runloop");
1960 PL_runops = su_uplevel_goto_runops;
1961 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1962 croak("uplevel() can't execute code that calls goto before perl 5.8");
1963 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1971 ret = PL_stack_sp - (PL_stack_base + new_mark);
1973 AV *old_stack = sud->old_curstackinfo->si_stack;
1975 if (old_mark + ret > AvMAX(old_stack)) {
1976 /* Specialized EXTEND(old_sp, ret) */
1977 av_extend(old_stack, old_mark + ret + 1);
1978 old_stack_sp = AvARRAY(old_stack) + old_mark;
1981 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1983 AvFILLp(old_stack) += ret;
1991 /* --- Unique context ID --------------------------------------------------- */
1993 static su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1994 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1999 map = MY_CXT.uid_storage.map;
2000 alloc = MY_CXT.uid_storage.alloc;
2002 if (depth >= alloc) {
2005 Renew(map, depth + 1, su_uid);
2006 for (i = alloc; i <= depth; ++i) {
2011 MY_CXT.uid_storage.map = map;
2012 MY_CXT.uid_storage.alloc = depth + 1;
2015 if (depth >= MY_CXT.uid_storage.used)
2016 MY_CXT.uid_storage.used = depth + 1;
2021 static int su_uid_storage_check(pTHX_ UV depth, UV seq) {
2022 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
2026 if (depth >= MY_CXT.uid_storage.used)
2029 uid = MY_CXT.uid_storage.map + depth;
2031 return (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
2034 static SV *su_uid_get(pTHX_ I32 cxix) {
2035 #define su_uid_get(I) su_uid_get(aTHX_ (I))
2040 depth = su_uid_depth(cxix);
2041 uid = su_uid_storage_fetch(depth);
2043 if (!(uid->flags & SU_UID_ACTIVE)) {
2046 uid->seq = su_uid_seq_next(depth);
2047 uid->flags |= SU_UID_ACTIVE;
2049 Newx(ud, 1, su_ud_uid);
2050 SU_UD_TYPE(ud) = SU_UD_TYPE_UID;
2052 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2055 uid_sv = sv_newmortal();
2056 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
2063 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
2065 #else /* grok_number */
2067 #define IS_NUMBER_IN_UV 0x1
2069 static int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
2070 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
2074 /* This crude check should be good enough for a fallback implementation.
2075 * Better be too strict than too lax. */
2076 for (i = 0; i < len; ++i) {
2081 tmpsv = sv_newmortal();
2082 sv_setpvn(tmpsv, s, len);
2083 *valuep = sv_2uv(tmpsv);
2085 return IS_NUMBER_IN_UV;
2088 #endif /* !grok_number */
2090 static int su_uid_validate(pTHX_ SV *uid) {
2091 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
2097 s = SvPV_const(uid, len);
2099 while (p < len && s[p] != '-')
2102 croak("UID contains only one part");
2104 type = su_grok_number(s, p, &depth);
2105 if (type != IS_NUMBER_IN_UV)
2106 croak("First UID part is not an unsigned integer");
2108 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
2110 type = su_grok_number(s + p, len - p, &seq);
2111 if (type != IS_NUMBER_IN_UV)
2112 croak("Second UID part is not an unsigned integer");
2114 return su_uid_storage_check(depth, seq);
2117 /* --- Context operations -------------------------------------------------- */
2119 /* Remove sequences of BLOCKs having DB for stash, followed by a SUB context
2120 * for the debugger callback. */
2122 static I32 su_context_skip_db(pTHX_ I32 cxix) {
2123 #define su_context_skip_db(C) su_context_skip_db(aTHX_ (C))
2129 for (i = cxix; i > 0; --i) {
2130 PERL_CONTEXT *cx = cxstack + i;
2132 switch (CxTYPE(cx)) {
2133 #if SU_HAS_PERL(5, 17, 1)
2134 case CXt_LOOP_PLAIN:
2137 if (cx->blk_oldcop && CopSTASH(cx->blk_oldcop) == GvSTASH(PL_DBgv))
2141 if (cx->blk_sub.cv == GvCV(PL_DBsub)) {
2157 static I32 su_context_normalize_up(pTHX_ I32 cxix) {
2158 #define su_context_normalize_up(C) su_context_normalize_up(aTHX_ (C))
2164 cx = cxstack + cxix;
2165 if (CxTYPE(cx) == CXt_BLOCK) {
2166 PERL_CONTEXT *prev = cx - 1;
2168 switch (CxTYPE(prev)) {
2169 #if SU_HAS_PERL(5, 10, 0)
2173 #if SU_HAS_PERL(5, 11, 0)
2174 /* That's the only subcategory that can cause an extra BLOCK context */
2175 case CXt_LOOP_PLAIN:
2179 if (cx->blk_oldcop == prev->blk_oldcop)
2183 if (cx->blk_oldcop && OpSIBLING(cx->blk_oldcop)
2184 && OpSIBLING(cx->blk_oldcop)->op_type == OP_SUBST)
2193 static I32 su_context_normalize_down(pTHX_ I32 cxix) {
2194 #define su_context_normalize_down(C) su_context_normalize_down(aTHX_ (C))
2197 if (cxix >= cxstack_ix)
2200 next = cxstack + cxix + 1;
2201 if (CxTYPE(next) == CXt_BLOCK) {
2202 PERL_CONTEXT *cx = next - 1;
2204 switch (CxTYPE(cx)) {
2205 #if SU_HAS_PERL(5, 10, 0)
2209 #if SU_HAS_PERL(5, 11, 0)
2210 /* That's the only subcategory that can cause an extra BLOCK context */
2211 case CXt_LOOP_PLAIN:
2215 if (cx->blk_oldcop == next->blk_oldcop)
2219 if (next->blk_oldcop && OpSIBLING(next->blk_oldcop)
2220 && OpSIBLING(next->blk_oldcop)->op_type == OP_SUBST)
2229 #define su_context_here() su_context_normalize_up(su_context_skip_db(cxstack_ix))
2231 static I32 su_context_gimme(pTHX_ I32 cxix) {
2232 #define su_context_gimme(C) su_context_gimme(aTHX_ (C))
2235 for (i = cxix; i >= 0; --i) {
2236 PERL_CONTEXT *cx = cxstack + i;
2238 switch (CxTYPE(cx)) {
2239 /* gimme is always G_ARRAY for loop contexts. */
2240 #if SU_HAS_PERL(5, 11, 0)
2242 case CXt_LOOP_PLAIN:
2243 case CXt_LOOP_LAZYSV:
2244 case CXt_LOOP_LAZYIV:
2249 const COP *cop = cx->blk_oldcop;
2250 if (cop && OpSIBLING(cop)) {
2251 switch (OpSIBLING(cop)->op_flags & OPf_WANT) {
2254 case OPf_WANT_SCALAR:
2273 /* --- Global setup/teardown ----------------------------------------------- */
2275 static VOL U32 su_initialized = 0;
2277 static void su_global_teardown(pTHX_ void *root) {
2278 if (!su_initialized)
2286 SU_LOCK(&su_uid_seq_counter_mutex);
2287 PerlMemShared_free(su_uid_seq_counter.seqs);
2288 su_uid_seq_counter.size = 0;
2289 SU_UNLOCK(&su_uid_seq_counter_mutex);
2291 MUTEX_DESTROY(&su_uid_seq_counter_mutex);
2298 XS(XS_Scope__Upper_unwind);
2299 XS(XS_Scope__Upper_yield);
2300 XS(XS_Scope__Upper_leave);
2302 #if SU_HAS_PERL(5, 9, 0)
2303 # define SU_XS_FILE_TYPE const char
2305 # define SU_XS_FILE_TYPE char
2308 static void su_global_setup(pTHX_ SU_XS_FILE_TYPE *file) {
2309 #define su_global_setup(F) su_global_setup(aTHX_ (F))
2315 MUTEX_INIT(&su_uid_seq_counter_mutex);
2317 SU_LOCK(&su_uid_seq_counter_mutex);
2318 su_uid_seq_counter.seqs = NULL;
2319 su_uid_seq_counter.size = 0;
2320 SU_UNLOCK(&su_uid_seq_counter_mutex);
2322 stash = gv_stashpv(__PACKAGE__, 1);
2323 newCONSTSUB(stash, "TOP", newSViv(0));
2324 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
2326 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
2327 newXSproto("Scope::Upper::yield", XS_Scope__Upper_yield, file, NULL);
2328 newXSproto("Scope::Upper::leave", XS_Scope__Upper_leave, file, NULL);
2331 call_atexit(su_global_teardown, aTHX);
2333 call_atexit(su_global_teardown, NULL);
2341 /* --- Interpreter setup/teardown ------------------------------------------ */
2343 static void su_local_teardown(pTHX_ void *param) {
2347 Safefree(MY_CXT.uid_storage.map);
2349 cur = MY_CXT.uplevel_storage.root;
2351 su_uplevel_ud *prev;
2355 su_uplevel_ud_delete(prev);
2362 static void su_local_setup(pTHX) {
2363 #define su_local_setup() su_local_setup(aTHX)
2366 MY_CXT.stack_placeholder = NULL;
2368 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
2369 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
2370 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
2371 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
2373 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
2374 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
2375 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
2377 Zero(&(MY_CXT.yield_storage.leave_op), 1, UNOP);
2378 MY_CXT.yield_storage.leave_op.op_type = OP_STUB;
2379 MY_CXT.yield_storage.leave_op.op_ppaddr = NULL;
2381 Zero(&(MY_CXT.yield_storage.proxy_op), 1, OP);
2382 MY_CXT.yield_storage.proxy_op.op_type = OP_STUB;
2383 MY_CXT.yield_storage.proxy_op.op_ppaddr = NULL;
2385 MY_CXT.uplevel_storage.top = NULL;
2386 MY_CXT.uplevel_storage.root = NULL;
2387 MY_CXT.uplevel_storage.count = 0;
2389 MY_CXT.uid_storage.map = NULL;
2390 MY_CXT.uid_storage.used = 0;
2391 MY_CXT.uid_storage.alloc = 0;
2393 call_atexit(su_local_teardown, NULL);
2398 /* --- XS ------------------------------------------------------------------ */
2400 #define SU_GET_CONTEXT(A, B, D) \
2409 else if (cxix > cxstack_ix) \
2417 #define SU_GET_LEVEL(A, B) \
2423 level = SvIV(lsv); \
2430 #if SU_HAS_PERL(5, 10, 0)
2431 # define SU_INFO_COUNT 11
2433 # define SU_INFO_COUNT 10
2436 XS(XS_Scope__Upper_unwind) {
2445 PERL_UNUSED_VAR(cv); /* -W */
2446 PERL_UNUSED_VAR(ax); /* -Wall */
2448 SU_GET_CONTEXT(0, items - 1, cxstack_ix);
2450 PERL_CONTEXT *cx = cxstack + cxix;
2451 switch (CxTYPE(cx)) {
2453 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2457 MY_CXT.unwind_storage.cxix = cxix;
2458 MY_CXT.unwind_storage.items = items;
2459 MY_CXT.unwind_storage.savesp = PL_stack_sp;
2461 MY_CXT.unwind_storage.items--;
2462 MY_CXT.unwind_storage.savesp--;
2464 /* pp_entersub will want to sanitize the stack after returning from there
2465 * Screw that, we're insane!
2466 * dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
2467 if (GIMME_V == G_SCALAR)
2468 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2469 SAVEDESTRUCTOR_X(su_unwind, NULL);
2474 } while (--cxix >= 0);
2475 croak("Can't return outside a subroutine");
2478 static const char su_yield_name[] = "yield";
2480 XS(XS_Scope__Upper_yield) {
2489 PERL_UNUSED_VAR(cv); /* -W */
2490 PERL_UNUSED_VAR(ax); /* -Wall */
2492 SU_GET_CONTEXT(0, items - 1, su_context_here());
2493 MY_CXT.yield_storage.cxix = cxix;
2494 MY_CXT.yield_storage.items = items;
2495 MY_CXT.yield_storage.savesp = PL_stack_sp;
2497 MY_CXT.yield_storage.items--;
2498 MY_CXT.yield_storage.savesp--;
2500 /* See XS_Scope__Upper_unwind */
2501 if (GIMME_V == G_SCALAR)
2502 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2503 SAVEDESTRUCTOR_X(su_yield, su_yield_name);
2507 static const char su_leave_name[] = "leave";
2509 XS(XS_Scope__Upper_leave) {
2517 PERL_UNUSED_VAR(cv); /* -W */
2518 PERL_UNUSED_VAR(ax); /* -Wall */
2520 MY_CXT.yield_storage.cxix = su_context_here();
2521 MY_CXT.yield_storage.items = items;
2522 MY_CXT.yield_storage.savesp = PL_stack_sp;
2523 /* See XS_Scope__Upper_unwind */
2524 if (GIMME_V == G_SCALAR)
2525 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2526 SAVEDESTRUCTOR_X(su_yield, su_leave_name);
2530 MODULE = Scope::Upper PACKAGE = Scope::Upper
2536 su_global_setup(file);
2546 su_uid_storage new_cxt;
2553 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
2557 MY_CXT.uplevel_storage.top = NULL;
2558 MY_CXT.uplevel_storage.root = NULL;
2559 MY_CXT.uplevel_storage.count = 0;
2560 MY_CXT.uid_storage = new_cxt;
2564 #endif /* SU_THREADSAFE */
2572 cxix = su_context_here();
2583 SU_GET_CONTEXT(0, 0, su_context_here());
2586 cxix = su_context_skip_db(cxix);
2587 cxix = su_context_normalize_up(cxix);
2589 warn(su_stack_smash);
2601 SU_GET_CONTEXT(0, 0, cxstack_ix);
2603 for (; cxix >= 0; --cxix) {
2604 PERL_CONTEXT *cx = cxstack + cxix;
2605 switch (CxTYPE(cx)) {
2609 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2615 warn(su_no_such_target, "subroutine");
2624 SU_GET_CONTEXT(0, 0, cxstack_ix);
2626 for (; cxix >= 0; --cxix) {
2627 PERL_CONTEXT *cx = cxstack + cxix;
2628 switch (CxTYPE(cx)) {
2636 warn(su_no_such_target, "eval");
2646 cxix = su_context_here();
2647 while (--level >= 0) {
2649 warn(su_stack_smash);
2653 cxix = su_context_skip_db(cxix);
2654 cxix = su_context_normalize_up(cxix);
2667 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2668 PERL_CONTEXT *cx = cxstack + cxix;
2669 switch (CxTYPE(cx)) {
2671 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2682 warn(su_stack_smash);
2693 SU_GET_CONTEXT(0, 0, cxstack_ix);
2696 PERL_CONTEXT *cx = cxstack + cxix--;
2697 switch (CxTYPE(cx)) {
2699 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2703 I32 gimme = cx->blk_gimme;
2705 case G_VOID: XSRETURN_UNDEF; break;
2706 case G_SCALAR: XSRETURN_NO; break;
2707 case G_ARRAY: XSRETURN_YES; break;
2720 const PERL_CONTEXT *cx, *dbcx;
2723 SU_GET_CONTEXT(0, 0, su_context_skip_db(cxstack_ix));
2724 cxix = su_context_normalize_up(cxix);
2725 cx = cxstack + cxix;
2727 if (PL_DBsub && cxix && (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)) {
2728 I32 i = su_context_skip_db(cxix - 1) + 1;
2729 if (i < cxix && CxTYPE(cxstack + i) == CXt_SUB)
2732 cop = cx->blk_oldcop;
2733 EXTEND(SP, SU_INFO_COUNT);
2736 HV *stash = CopSTASH(cop);
2738 PUSHs(su_newmortal_pvn(HvNAME(stash), HvNAMELEN(stash)));
2740 PUSHs(&PL_sv_undef);
2743 PUSHs(su_newmortal_pvn(OutCopFILE(cop), OutCopFILE_len(cop)));
2745 mPUSHi(CopLINE(cop));
2746 /* subroutine (3) and has_args (4) */
2747 switch (CxTYPE(cx)) {
2750 GV *cvgv = CvGV(dbcx->blk_sub.cv);
2751 if (cvgv && isGV(cvgv)) {
2752 SV *sv = sv_newmortal();
2753 gv_efullname3(sv, cvgv, NULL);
2756 PUSHs(su_newmortal_pvs("(unknown)"));
2765 PUSHs(su_newmortal_pvs("(eval)"));
2769 PUSHs(&PL_sv_undef);
2770 PUSHs(&PL_sv_undef);
2773 switch (su_context_gimme(cxix)) {
2780 default: /* G_VOID */
2781 PUSHs(&PL_sv_undef);
2784 /* eval text (6) and is_require (7) */
2785 switch (CxTYPE(cx)) {
2787 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
2789 #if SU_HAS_PERL(5, 17, 4)
2790 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
2791 SvCUR(cx->blk_eval.cur_text)-2,
2792 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
2794 PUSHs(cx->blk_eval.cur_text);
2798 } else if (cx->blk_eval.old_namesv) {
2800 PUSHs(sv_mortalcopy(cx->blk_eval.old_namesv));
2806 /* Anything else including eval BLOCK */
2807 PUSHs(&PL_sv_undef);
2808 PUSHs(&PL_sv_undef);
2812 mPUSHi(CopHINTS_get(cop));
2816 #if SU_HAS_PERL(5, 9, 4)
2817 STRLEN *old_warnings = cop->cop_warnings;
2819 SV *old_warnings = cop->cop_warnings;
2821 if (old_warnings == pWARN_STD) {
2822 if (PL_dowarn & G_WARN_ON)
2823 goto context_info_warnings_on;
2825 #if SU_HAS_PERL(5, 17, 4)
2826 mask = &PL_sv_undef;
2828 goto context_info_warnings_off;
2830 } else if (old_warnings == pWARN_NONE) {
2831 #if !SU_HAS_PERL(5, 17, 4)
2832 context_info_warnings_off:
2834 mask = su_newmortal_pvn(WARN_NONEstring, WARNsize);
2835 } else if (old_warnings == pWARN_ALL) {
2837 context_info_warnings_on:
2838 #if SU_HAS_PERL(5, 8, 7)
2839 bits = get_hv("warnings::Bits", 0);
2841 SV **bits_all = hv_fetchs(bits, "all", FALSE);
2843 mask = sv_mortalcopy(*bits_all);
2847 mask = su_newmortal_pvn(WARN_ALLstring, WARNsize);
2849 #if SU_HAS_PERL(5, 9, 4)
2850 mask = su_newmortal_pvn((char *) (old_warnings + 1), old_warnings[0]);
2852 mask = sv_mortalcopy(old_warnings);
2857 #if SU_HAS_PERL(5, 10, 0)
2858 /* hints hash (10) */
2860 COPHH *hints_hash = CopHINTHASH_get(cop);
2862 SV *rhv = sv_2mortal(newRV_noinc((SV *) cophh_2hv(hints_hash, 0)));
2865 PUSHs(&PL_sv_undef);
2869 XSRETURN(SU_INFO_COUNT);
2878 SU_GET_CONTEXT(1, 1, su_context_skip_db(cxstack_ix));
2879 cxix = su_context_normalize_down(cxix);
2880 Newx(ud, 1, su_ud_reap);
2881 SU_UD_TYPE(ud) = SU_UD_TYPE_REAP;
2882 ud->cb = (SvROK(hook) && SvTYPE(SvRV(hook)) >= SVt_PVCV)
2883 ? SvRV(hook) : hook;
2884 SvREFCNT_inc_simple_void(ud->cb);
2885 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2888 localize(SV *sv, SV *val, ...)
2895 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2896 cxix = su_context_normalize_down(cxix);
2897 Newx(ud, 1, su_ud_localize);
2898 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2899 size = su_ud_localize_init(ud, sv, val, NULL);
2900 su_init(ud, cxix, size);
2903 localize_elem(SV *sv, SV *elem, SV *val, ...)
2910 if (SvTYPE(sv) >= SVt_PVGV)
2911 croak("Can't infer the element localization type from a glob and the value");
2912 SU_GET_CONTEXT(3, 3, su_context_skip_db(cxstack_ix));
2913 cxix = su_context_normalize_down(cxix);
2914 Newx(ud, 1, su_ud_localize);
2915 /* Initialize SU_UD_ORIGIN(ud) in case SU_UD_LOCALIZE_FREE(ud) needs it */
2916 SU_UD_ORIGIN(ud) = NULL;
2917 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2918 size = su_ud_localize_init(ud, sv, val, elem);
2919 if (SU_UD_PRIVATE(ud) != SVt_PVAV && SU_UD_PRIVATE(ud) != SVt_PVHV) {
2920 SU_UD_LOCALIZE_FREE(ud);
2921 croak("Can't localize an element of something that isn't an array or a hash");
2923 su_init(ud, cxix, size);
2926 localize_delete(SV *sv, SV *elem, ...)
2933 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2934 cxix = su_context_normalize_down(cxix);
2935 Newx(ud, 1, su_ud_localize);
2936 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2937 size = su_ud_localize_init(ud, sv, NULL, elem);
2938 su_init(ud, cxix, size);
2941 uplevel(SV *code, ...)
2944 I32 cxix, ret, args = 0;
2948 if (SvTYPE(code) < SVt_PVCV)
2949 croak("First argument to uplevel must be a code reference");
2950 SU_GET_CONTEXT(1, items - 1, cxstack_ix);
2952 PERL_CONTEXT *cx = cxstack + cxix;
2953 switch (CxTYPE(cx)) {
2955 croak("Can't uplevel to an eval frame");
2957 croak("Can't uplevel to a format frame");
2959 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2965 /* su_uplevel() takes care of extending the stack if needed. */
2966 ret = su_uplevel((CV *) code, cxix, args);
2971 } while (--cxix >= 0);
2972 croak("Can't uplevel outside a subroutine");
2981 SU_GET_CONTEXT(0, 0, su_context_here());
2982 uid = su_uid_get(cxix);
2988 validate_uid(SV *uid)
2993 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;