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 /* --- XS helpers ---------------------------------------------------------- */
11 #define XSH_PACKAGE "Scope::Upper"
15 #include "xsh/debug.h"
17 /* --- Compatibility ------------------------------------------------------- */
24 # define MUTABLE_SV(S) ((SV *) (S))
28 # define MUTABLE_AV(A) ((AV *) (A))
32 # define MUTABLE_CV(C) ((CV *) (C))
35 #ifndef PERL_UNUSED_VAR
36 # define PERL_UNUSED_VAR(V)
40 # define Newx(v, n, c) New(0, v, n, c)
45 # define SU_POISON(D, N, T) PoisonNew((D), (N), T)
46 # elif defined(Poison)
47 # define SU_POISON(D, N, T) Poison((D), (N), T)
51 # define SU_POISON(D, N, T) NOOP
55 static SV *su_newSV_type(pTHX_ svtype t) {
60 # define newSV_type(T) su_newSV_type(aTHX_ (T))
64 # define su_newmortal_pvn(S, L) newSVpvn_flags((S), (L), SVs_TEMP)
66 # define su_newmortal_pvn(S, L) sv_2mortal(newSVpvn((S), (L)))
68 #define su_newmortal_pvs(S) su_newmortal_pvn((S), sizeof(S)-1)
71 # define SvPV_const(S, L) SvPV(S, L)
75 # define SvPVX_const(S) SvPVX(S)
78 #ifndef SvPV_nolen_const
79 # define SvPV_nolen_const(S) SvPV_nolen(S)
82 #ifndef SvREFCNT_inc_simple_void
83 # define SvREFCNT_inc_simple_void(sv) ((void) SvREFCNT_inc(sv))
87 # define mPUSHi(I) PUSHs(sv_2mortal(newSViv(I)))
91 # define GvCV_set(G, C) (GvCV(G) = (C))
95 # define CvGV_set(C, G) (CvGV(C) = (G))
99 # define CvSTASH_set(C, S) (CvSTASH(C) = (S))
103 # define CvISXSUB(C) CvXSUB(C)
107 # define PadlistARRAY(P) AvARRAY(P)
108 # define PadARRAY(P) AvARRAY(P)
112 # define CxHASARGS(C) ((C)->blk_sub.hasargs)
117 # define CxGIMME(C) ((C)->blk_gimme & G_WANT)
119 # define CxGIMME(C) ((C)->blk_gimme)
123 #ifndef CxOLD_OP_TYPE
124 # define CxOLD_OP_TYPE(C) (C)->blk_eval.old_op_type
128 # define OutCopFILE(C) CopFILE(C)
131 #ifndef OutCopFILE_len
132 # define OutCopFILE_len(C) strlen(OutCopFILE(C))
136 # define CopHINTS_get(C) ((I32) (C)->op_private & HINT_PRIVATE_MASK)
139 #ifndef CopHINTHASH_get
140 # define CopHINTHASH_get(C) (C)->cop_hints_hash
144 # define COPHH struct refcounted_he
145 # define cophh_2hv(H, F) Perl_refcounted_he_chain_2hv(aTHX_ (H))
149 # define HvNAME_get(H) HvNAME(H)
153 # define HvNAMELEN(H) strlen(HvNAME(H))
156 #ifndef gv_fetchpvn_flags
157 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
161 # define hv_fetchs(H, K, L) hv_fetch((H), (K), sizeof(K)-1, (L))
164 #ifndef OP_GIMME_REVERSE
165 static U8 su_op_gimme_reverse(U8 gimme) {
168 return OPf_WANT_VOID;
170 return OPf_WANT_LIST;
175 return OPf_WANT_SCALAR;
177 #define OP_GIMME_REVERSE(G) su_op_gimme_reverse(G)
182 # define OpSIBLING(O) OP_SIBLING(O)
184 # define OpSIBLING(O) ((O)->op_sibling)
188 #ifndef PERL_MAGIC_tied
189 # define PERL_MAGIC_tied 'P'
192 #ifndef PERL_MAGIC_env
193 # define PERL_MAGIC_env 'E'
196 #ifndef NEGATIVE_INDICES_VAR
197 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
200 /* --- Error messages ------------------------------------------------------ */
202 static const char su_stack_smash[] = "Cannot target a scope outside of the current stack";
203 static const char su_no_such_target[] = "No targetable %s scope in the current stack";
205 /* --- Unique context ID global storage ------------------------------------ */
207 /* ... Sequence ID counter ................................................. */
214 static su_uv_array su_uid_seq_counter;
218 static perl_mutex su_uid_seq_counter_mutex;
220 #endif /* USE_ITHREADS */
222 static UV su_uid_seq_next(pTHX_ UV depth) {
223 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
227 XSH_LOCK(&su_uid_seq_counter_mutex);
229 seqs = su_uid_seq_counter.seqs;
231 if (depth >= su_uid_seq_counter.size) {
234 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
235 for (i = su_uid_seq_counter.size; i <= depth; ++i)
238 su_uid_seq_counter.seqs = seqs;
239 su_uid_seq_counter.size = depth + 1;
244 XSH_UNLOCK(&su_uid_seq_counter_mutex);
249 /* ... UID storage ......................................................... */
256 #define SU_UID_ACTIVE 1
258 static UV su_uid_depth(pTHX_ I32 cxix) {
259 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
264 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
265 depth += si->si_cxix + 1;
276 static void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
277 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
278 su_uid *old_map = old_cxt->map;
281 su_uid *new_map = new_cxt->map;
282 STRLEN old_used = old_cxt->used;
283 STRLEN new_used, new_alloc;
286 new_used = max_depth < old_used ? max_depth : old_used;
287 new_cxt->used = new_used;
289 if (new_used <= new_cxt->alloc) {
290 new_alloc = new_cxt->alloc;
292 new_alloc = new_used;
293 Renew(new_map, new_alloc, su_uid);
294 new_cxt->map = new_map;
295 new_cxt->alloc = new_alloc;
298 for (i = 0; i < new_alloc; ++i) {
299 su_uid *new_uid = new_map + i;
301 if (i < new_used) { /* => i < max_depth && i < old_used */
302 su_uid *old_uid = old_map + i;
304 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
318 /* --- unwind() global storage --------------------------------------------- */
328 /* --- yield() global storage ---------------------------------------------- */
338 /* --- uplevel() data tokens and global storage ---------------------------- */
340 #define SU_UPLEVEL_HIJACKS_RUNOPS XSH_HAS_PERL(5, 8, 0)
345 su_uid_storage tmp_uid_storage;
346 su_uid_storage old_uid_storage;
357 PERL_SI *old_curstackinfo;
363 #if SU_UPLEVEL_HIJACKS_RUNOPS
364 runops_proc_t old_runops;
371 static su_uplevel_ud *su_uplevel_ud_new(pTHX) {
372 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
376 Newx(sud, 1, su_uplevel_ud);
379 sud->tmp_uid_storage.map = NULL;
380 sud->tmp_uid_storage.used = 0;
381 sud->tmp_uid_storage.alloc = 0;
383 Newx(si, 1, PERL_SI);
384 si->si_stack = newAV();
385 AvREAL_off(si->si_stack);
386 si->si_cxstack = NULL;
394 static void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
395 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
396 PERL_SI *si = sud->si;
398 Safefree(si->si_cxstack);
399 SvREFCNT_dec(si->si_stack);
402 Safefree(sud->tmp_uid_storage.map);
413 } su_uplevel_storage;
415 #ifndef SU_UPLEVEL_STORAGE_SIZE
416 # define SU_UPLEVEL_STORAGE_SIZE 4
419 /* --- Global data --------------------------------------------------------- */
422 char *stack_placeholder;
423 su_unwind_storage unwind_storage;
424 su_yield_storage yield_storage;
425 su_uplevel_storage uplevel_storage;
426 su_uid_storage uid_storage;
429 #define XSH_THREADS_USER_CONTEXT 1
430 #define XSH_THREADS_USER_CLONE_NEEDS_DUP 0
431 #define XSH_THREADS_COMPILE_TIME_PROTECTION 0
435 static void xsh_user_clone(pTHX_ const xsh_user_cxt_t *old_cxt, xsh_user_cxt_t *new_cxt) {
436 new_cxt->uplevel_storage.top = NULL;
437 new_cxt->uplevel_storage.root = NULL;
438 new_cxt->uplevel_storage.count = 0;
440 new_cxt->uid_storage.map = NULL;
441 new_cxt->uid_storage.used = 0;
442 new_cxt->uid_storage.alloc = 0;
444 su_uid_storage_dup(&new_cxt->uid_storage, &old_cxt->uid_storage,
445 old_cxt->uid_storage.used);
450 #endif /* XSH_THREADSAFE */
452 #include "xsh/threads.h"
454 /* --- Stack manipulations ------------------------------------------------- */
456 #define SU_SAVE_PLACEHOLDER() save_pptr(&XSH_CXT.stack_placeholder)
458 #define SU_SAVE_DESTRUCTOR_SIZE 3
459 #define SU_SAVE_PLACEHOLDER_SIZE 3
461 #define SU_SAVE_SCALAR_SIZE 3
463 #define SU_SAVE_ARY_SIZE 3
464 #define SU_SAVE_AELEM_SIZE 4
466 # define SU_SAVE_ADELETE_SIZE 3
468 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
470 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
471 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
473 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
476 #define SU_SAVE_HASH_SIZE 3
477 #define SU_SAVE_HELEM_SIZE 4
478 #define SU_SAVE_HDELETE_SIZE 4
479 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
480 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
482 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
485 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
487 #if !XSH_HAS_PERL(5, 8, 9)
488 # define SU_SAVE_GP_SIZE 6
489 #elif !XSH_HAS_PERL(5, 13, 0) || (SU_RELEASE && XSH_HAS_PERL_EXACT(5, 13, 0))
490 # define SU_SAVE_GP_SIZE 3
491 #elif !XSH_HAS_PERL(5, 13, 8)
492 # define SU_SAVE_GP_SIZE 4
494 # define SU_SAVE_GP_SIZE 3
497 #ifndef SvCANEXISTDELETE
498 # define SvCANEXISTDELETE(sv) \
500 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
501 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
502 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
503 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
508 /* ... Saving array elements ............................................... */
510 static I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
511 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
517 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
518 #if XSH_HAS_PERL(5, 8, 1)
519 if (SvRMAGICAL(av)) {
520 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
522 SV * const * const negative_indices_glob = hv_fetch(
523 SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
524 NEGATIVE_INDICES_VAR, sizeof(NEGATIVE_INDICES_VAR)-1, 0
526 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
532 idx = key + av_len(av) + 1;
546 static void su_adelete(pTHX_ void *ud_) {
547 su_ud_adelete *ud = (su_ud_adelete *) ud_;
549 av_delete(ud->av, ud->idx, G_DISCARD);
550 SvREFCNT_dec(ud->av);
555 static void su_save_adelete(pTHX_ AV *av, I32 idx) {
556 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
559 Newx(ud, 1, su_ud_adelete);
562 SvREFCNT_inc_simple_void(av);
564 SAVEDESTRUCTOR_X(su_adelete, ud);
567 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
569 #endif /* SAVEADELETE */
571 static void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
572 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
579 idx = su_av_key2idx(av, SvIV(key));
581 if (SvCANEXISTDELETE(av))
582 preeminent = av_exists(av, idx);
584 svp = av_fetch(av, idx, 1);
585 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
588 save_aelem(av, idx, svp);
590 SAVEADELETE(av, idx);
592 if (val) { /* local $x[$idx] = $val; */
593 SvSetMagicSV(*svp, val);
594 } else { /* local $x[$idx]; delete $x[$idx]; */
595 av_delete(av, idx, G_DISCARD);
599 /* ... Saving hash elements ................................................ */
601 static void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
602 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
609 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
610 preeminent = hv_exists_ent(hv, keysv, 0);
612 he = hv_fetch_ent(hv, keysv, 1, 0);
613 svp = he ? &HeVAL(he) : NULL;
614 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
616 if (HvNAME_get(hv) && isGV(*svp)) {
617 save_gp((GV *) *svp, 0);
622 save_helem(hv, keysv, svp);
625 const char * const key = SvPV_const(keysv, keylen);
626 SAVEDELETE(hv, savepvn(key, keylen),
627 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
630 if (val) { /* local $x{$keysv} = $val; */
631 SvSetMagicSV(*svp, val);
632 } else { /* local $x{$keysv}; delete $x{$keysv}; */
633 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
637 /* ... Saving code slots from a glob ....................................... */
639 #if !XSH_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
640 # define mro_method_changed_in(G) PL_sub_generation++
648 static void su_restore_gvcv(pTHX_ void *ud_) {
649 su_save_gvcv_ud *ud = ud_;
652 GvCV_set(gv, ud->old_cv);
654 mro_method_changed_in(GvSTASH(gv));
659 static void su_save_gvcv(pTHX_ GV *gv) {
660 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
663 Newx(ud, 1, su_save_gvcv_ud);
665 ud->old_cv = GvCV(gv);
669 mro_method_changed_in(GvSTASH(gv));
671 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
674 /* --- Actions ------------------------------------------------------------- */
685 #define SU_UD_TYPE(U) (((su_ud_common *) (U))->type)
686 #define SU_UD_PRIVATE(U) (((su_ud_common *) (U))->private)
687 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
688 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
689 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
691 #define SU_UD_TYPE_REAP 0
692 #define SU_UD_TYPE_LOCALIZE 1
693 #define SU_UD_TYPE_UID 2
695 #define SU_UD_FREE(U) STMT_START { \
696 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
700 /* ... Reap ................................................................ */
702 #define SU_SAVE_LAST_CX (!XSH_HAS_PERL(5, 8, 4) || (XSH_HAS_PERL(5, 9, 5) && !XSH_HAS_PERL(5, 14, 0)) || XSH_HAS_PERL(5, 15, 0))
709 #define SU_UD_REAP_CB(U) (((su_ud_reap *) (U))->cb)
711 static void su_call(pTHX_ SV *cb) {
714 PERL_CONTEXT saved_cx;
715 #endif /* SU_SAVE_LAST_CX */
719 XSH_D(su_debug_log("@@@ call scope_ix=%2d save_ix=%2d\n",
720 PL_scopestack_ix, PL_savestack_ix));
729 /* If the recently popped context isn't saved there, it will be overwritten by
730 * the sub scope from call_sv, although it's still needed in our caller. */
731 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
732 saved_cx = cxstack[cxix];
733 #endif /* SU_SAVE_LAST_CX */
738 cxstack[cxix] = saved_cx;
739 #endif /* SU_SAVE_LAST_CX */
751 /* ... Localize & localize array/hash element .............................. */
760 #define SU_UD_LOCALIZE_SV(U) (((su_ud_localize *) (U))->sv)
761 #define SU_UD_LOCALIZE_VAL(U) (((su_ud_localize *) (U))->val)
762 #define SU_UD_LOCALIZE_ELEM(U) (((su_ud_localize *) (U))->elem)
764 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
765 SvREFCNT_dec(SU_UD_LOCALIZE_ELEM(U)); \
766 SvREFCNT_dec(SU_UD_LOCALIZE_VAL(U)); \
767 SvREFCNT_dec(SU_UD_LOCALIZE_SV(U)); \
771 static I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
772 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
777 SvREFCNT_inc_simple_void(sv);
779 if (SvTYPE(sv) >= SVt_PVGV) {
780 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
782 } else { /* local *x = \$val; */
783 t = SvTYPE(SvRV(val));
786 } else if (SvROK(sv)) {
787 croak("Invalid %s reference as the localization target",
788 sv_reftype(SvRV(sv), 0));
791 const char *p = SvPV_const(sv, len), *s;
792 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
798 case '$': t = SVt_PV; break;
799 case '@': t = SVt_PVAV; break;
800 case '%': t = SVt_PVHV; break;
801 case '&': t = SVt_PVCV; break;
802 case '*': t = SVt_PVGV; break;
807 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
808 if (SvROK(val) && !sv_isobject(val)) {
809 t = SvTYPE(SvRV(val));
821 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
826 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
831 size = SU_SAVE_GP_SIZE;
835 size = SU_SAVE_GVCV_SIZE;
839 size = SU_SAVE_SCALAR_SIZE;
842 /* When deref is set, val isn't NULL */
844 SU_UD_PRIVATE(ud) = t;
847 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
848 ud->elem = SvREFCNT_inc(elem);
853 static void su_localize(pTHX_ void *ud_) {
854 #define su_localize(U) su_localize(aTHX_ (U))
855 su_ud_localize *ud = (su_ud_localize *) ud_;
859 svtype t = SU_UD_PRIVATE(ud);
862 if (SvTYPE(sv) >= SVt_PVGV) {
866 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
869 const char *name = SvPV_const(sv, len);
870 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
877 su_debug_log("%p: === localize a %s\n",ud, sv_reftype(z, 0));
878 su_debug_log("%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
879 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
883 /* Inspired from Alias.pm */
887 su_save_aelem(GvAV(gv), elem, val);
894 su_save_helem(GvHV(gv), elem, val);
900 save_gp(gv, 1); /* hide previous entry in symtab */
906 gv = (GV *) save_scalar(gv);
911 SvSetMagicSV((SV *) gv, val);
916 /* ... Unique context ID ................................................... */
918 /* We must pass the index because XSH_CXT.uid_storage might be reallocated
919 * between the UID fetch and the invalidation at the end of scope. */
926 static void su_uid_drop(pTHX_ void *ud_) {
930 XSH_CXT.uid_storage.map[ud->idx].flags &= ~SU_UID_ACTIVE;
937 /* --- Pop a context back -------------------------------------------------- */
940 # define SU_CXNAME(C) PL_block_type[CxTYPE(C)]
942 # if XSH_HAS_PERL(5, 11, 0)
943 static const char *su_block_type[] = {
957 # elif XSH_HAS_PERL(5, 9, 3)
958 static const char *su_block_type[] = {
973 static const char *su_block_type[] = {
982 # define SU_CXNAME(C) su_block_type[CxTYPE(C)]
985 static void su_pop(pTHX_ void *ud) {
986 #define su_pop(U) su_pop(aTHX_ (U))
987 I32 depth, base, mark, *origin;
988 depth = SU_UD_DEPTH(ud);
992 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
993 ud, SU_CXNAME(cxstack + cxstack_ix),
994 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix]
997 origin = SU_UD_ORIGIN(ud);
998 mark = origin[depth];
999 base = origin[depth - 1];
1001 XSH_D(su_debug_log("%p: original scope was %*c top=%2d base=%2d\n",
1002 ud, 24, ' ', mark, base));
1005 #if XSH_HAS_PERL(5, 19, 4)
1010 XSH_D(su_debug_log("%p: clear leftovers\n", ud));
1012 #if XSH_HAS_PERL(5, 19, 4)
1013 cx = cxstack + cxstack_ix;
1014 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1015 save = PL_scopestack[cx->blk_oldscopesp - 1];
1018 PL_savestack_ix = mark;
1021 #if XSH_HAS_PERL(5, 19, 4)
1022 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1023 PL_scopestack[cx->blk_oldscopesp - 1] = save;
1026 PL_savestack_ix = base;
1028 SU_UD_DEPTH(ud) = --depth;
1033 if ((pad = SU_UD_PAD(ud)) > 0) {
1037 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
1038 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1039 SU_SAVE_PLACEHOLDER();
1044 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
1045 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1046 SAVEDESTRUCTOR_X(su_pop, ud);
1048 switch (SU_UD_TYPE(ud)) {
1049 case SU_UD_TYPE_REAP: {
1050 XSH_D(su_debug_log("%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
1051 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix));
1052 SAVEDESTRUCTOR_X(su_call, SU_UD_REAP_CB(ud));
1056 case SU_UD_TYPE_LOCALIZE:
1058 SU_UD_LOCALIZE_FREE(ud);
1060 case SU_UD_TYPE_UID:
1061 SAVEDESTRUCTOR_X(su_uid_drop, ud);
1066 XSH_D(su_debug_log("%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
1067 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
1070 /* --- Initialize the stack and the action userdata ------------------------ */
1072 static I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
1073 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
1074 I32 i, depth, offset, base, *origin;
1077 XSH_D(su_debug_log("%p: ### init for cx %d\n", ud, cxix));
1079 /* su_pop() is going to be called from leave_scope(), so before pushing the
1080 * next callback, we'll want to flush the current scope stack slice first.
1081 * However, if we want the next callback not to be processed immediately by
1082 * the current leave_scope(), we'll need to hide it by artificially
1083 * incrementing the scope stack marker before. For the intermediate bumps,
1084 * we will only need a bump of SU_SAVE_DESTRUCTOR_SIZE items, but for the
1085 * last one we will need a bump of size items. However, in order to preserve
1086 * the natural ordering between scope stack markers, we cannot bump lower
1087 * markers more than higher ones. This is why we bump the intermediate markers
1088 * by the smallest multiple of SU_SAVE_PLACEHOLDER_SIZE greater or equal to
1089 * max(SU_SAVE_DESTRUCTOR_SIZE, size). */
1091 if (size <= SU_SAVE_DESTRUCTOR_SIZE) {
1094 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
1095 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
1096 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
1099 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
1100 XSH_D(su_debug_log("%p: size=%d pad=%d offset=%d\n", ud, size, pad, offset));
1102 depth = PL_scopestack_ix - cxstack[cxix].blk_oldscopesp;
1103 XSH_D(su_debug_log("%p: going down to depth %d\n", ud, depth));
1105 /* We need to bump all the intermediary stack markers just in case an
1106 * exception is thrown before the target scope is reached. Indeed, in this
1107 * case there might be arbitrary many scope frames flushed at the same time,
1108 * and since we cannot know in advance whether this will happen or not, we
1109 * have to make sure the final frame is protected for the actual action. But
1110 * of course, in order to do that, we also need to bump all the previous stack
1111 * markers. If not for this, it should have been possible to just bump the two
1112 * next frames in su_pop(). */
1114 Newx(origin, depth + 1, I32);
1115 base = PL_scopestack_ix - depth;
1116 origin[0] = PL_scopestack[base];
1117 PL_scopestack[base] += size;
1118 for (i = 1; i < depth; ++i) {
1120 /* origin[depth - i] == PL_scopestack[PL_scopestack_ix - i] */
1121 origin[i] = PL_scopestack[j];
1122 PL_scopestack[j] += offset;
1124 origin[depth] = PL_savestack_ix;
1126 SU_UD_PAD(ud) = pad;
1127 SU_UD_DEPTH(ud) = depth;
1128 SU_UD_ORIGIN(ud) = origin;
1130 /* Make sure the first destructor fires by pushing enough fake slots on the
1132 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1133 <= PL_scopestack[PL_scopestack_ix - 1]) {
1136 XSH_D(su_debug_log("%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1137 ud, PL_scopestack_ix, PL_savestack_ix));
1138 SU_SAVE_PLACEHOLDER();
1139 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1140 <= PL_scopestack[PL_scopestack_ix - 1]);
1142 XSH_D(su_debug_log("%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1143 ud, PL_scopestack_ix, PL_savestack_ix));
1144 SAVEDESTRUCTOR_X(su_pop, ud);
1147 for (i = 0; i <= depth; ++i) {
1148 I32 j = PL_scopestack_ix - i;
1149 su_debug_log("%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1150 ud, i, j, origin[depth - i],
1151 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1158 /* --- Unwind stack -------------------------------------------------------- */
1160 static void su_unwind(pTHX_ void *ud_) {
1162 I32 cxix = XSH_CXT.unwind_storage.cxix;
1163 I32 items = XSH_CXT.unwind_storage.items;
1166 PERL_UNUSED_VAR(ud_);
1168 PL_stack_sp = XSH_CXT.unwind_storage.savesp;
1169 #if XSH_HAS_PERL(5, 19, 4)
1172 SV **sp = PL_stack_sp;
1173 for (i = -items + 1; i <= 0; ++i)
1175 sv_2mortal(SvREFCNT_inc(sp[i]));
1179 if (cxstack_ix > cxix)
1182 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1183 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1186 I32 gimme = GIMME_V;
1187 su_debug_log("%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1189 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1190 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1193 PL_op = (OP *) &(XSH_CXT.unwind_storage.return_op);
1194 PL_op = PL_op->op_ppaddr(aTHX);
1196 *PL_markstack_ptr = mark;
1198 XSH_CXT.unwind_storage.proxy_op.op_next = PL_op;
1199 PL_op = &(XSH_CXT.unwind_storage.proxy_op);
1202 /* --- Yield --------------------------------------------------------------- */
1204 #if XSH_HAS_PERL(5, 10, 0)
1205 # define SU_RETOP_SUB(C) ((C)->blk_sub.retop)
1206 # define SU_RETOP_EVAL(C) ((C)->blk_eval.retop)
1207 # define SU_RETOP_LOOP(C) ((C)->blk_loop.my_op->op_lastop->op_next)
1208 # define SU_RETOP_GIVEN(C) ((C)->blk_givwhen.leave_op->op_next)
1210 # define SU_RETOP_SUB(C) ((C)->blk_oldretsp > 0 ? PL_retstack[(C)->blk_oldretsp - 1] : NULL)
1211 # define SU_RETOP_EVAL(C) SU_RETOP_SUB(C)
1212 # define SU_RETOP_LOOP(C) ((C)->blk_loop.last_op->op_next)
1215 static void su_yield(pTHX_ void *ud_) {
1218 const char *which = ud_;
1219 I32 cxix = XSH_CXT.yield_storage.cxix;
1220 I32 items = XSH_CXT.yield_storage.items;
1221 opcode type = OP_NULL;
1225 PERL_UNUSED_VAR(ud_);
1227 cx = cxstack + cxix;
1228 switch (CxTYPE(cx)) {
1230 I32 i, cur = cxstack_ix, n = 1;
1232 /* Is this actually a given/when block? This may occur only when yield was
1233 * called with HERE (or nothing) as the context. */
1234 #if XSH_HAS_PERL(5, 10, 0)
1236 PERL_CONTEXT *prev = cx - 1;
1237 U8 prev_type = CxTYPE(prev);
1238 if ((prev_type == CXt_GIVEN || prev_type == CXt_WHEN)
1239 && (prev->blk_oldcop == cx->blk_oldcop)) {
1242 if (prev_type == CXt_GIVEN)
1251 /* Bare blocks (that appear as do { ... } blocks, map { ... } blocks or
1252 * constant folded blcoks) don't need to save the op to return to anywhere
1253 * since 'last' isn't supposed to work inside them. So we climb higher in
1254 * the context stack until we reach a context that has a return op (i.e. a
1255 * sub, an eval, a format or a real loop), recording how many blocks we
1256 * crossed. Then we follow the op_next chain until we get to the leave op
1257 * that closes the original block, which we are assured to reach since
1258 * everything is static (the blocks we have crossed cannot be evals or
1259 * subroutine calls). */
1260 for (i = cxix + 1; i <= cur; ++i) {
1261 PERL_CONTEXT *cx2 = cxstack + i;
1262 switch (CxTYPE(cx2)) {
1268 o = SU_RETOP_SUB(cx2);
1271 o = SU_RETOP_EVAL(cx2);
1273 #if XSH_HAS_PERL(5, 11, 0)
1275 case CXt_LOOP_PLAIN:
1276 case CXt_LOOP_LAZYSV:
1277 case CXt_LOOP_LAZYIV:
1281 o = SU_RETOP_LOOP(cx2);
1290 /* We may find other enter/leave blocks on our way to the matching leave.
1291 * Make sure the depth is incremented/decremented appropriately. */
1292 if (o->op_type == OP_ENTER) {
1294 } else if (o->op_type == OP_LEAVE) {
1308 next = SU_RETOP_SUB(cx);
1311 type = CxTRYBLOCK(cx) ? OP_LEAVETRY : OP_LEAVEEVAL;
1312 next = SU_RETOP_EVAL(cx);
1314 #if XSH_HAS_PERL(5, 11, 0)
1316 case CXt_LOOP_PLAIN:
1317 case CXt_LOOP_LAZYSV:
1318 case CXt_LOOP_LAZYIV:
1322 type = OP_LEAVELOOP;
1323 next = SU_RETOP_LOOP(cx);
1325 #if XSH_HAS_PERL(5, 10, 0)
1328 type = OP_LEAVEGIVEN;
1329 next = SU_RETOP_GIVEN(cx);
1333 #if XSH_HAS_PERL(5, 15, 1)
1334 type = OP_LEAVEWHEN;
1337 flags |= OPf_SPECIAL;
1343 croak("%s() can't target a substitution context", which);
1346 croak("%s() doesn't know how to leave a %s context",
1347 which, SU_CXNAME(cxstack + cxix));
1351 PL_stack_sp = XSH_CXT.yield_storage.savesp;
1352 #if XSH_HAS_PERL(5, 19, 4)
1355 SV **sp = PL_stack_sp;
1356 for (i = -items + 1; i <= 0; ++i)
1358 sv_2mortal(SvREFCNT_inc(sp[i]));
1362 if (cxstack_ix > cxix)
1365 /* Copy the arguments passed to yield() where the leave op expects to find
1368 Move(PL_stack_sp - items + 1, PL_stack_base + cx->blk_oldsp + 1, items, SV *);
1369 PL_stack_sp = PL_stack_base + cx->blk_oldsp + items;
1371 flags |= OP_GIMME_REVERSE(cx->blk_gimme);
1373 XSH_CXT.yield_storage.leave_op.op_type = type;
1374 XSH_CXT.yield_storage.leave_op.op_ppaddr = PL_ppaddr[type];
1375 XSH_CXT.yield_storage.leave_op.op_flags = flags;
1376 XSH_CXT.yield_storage.leave_op.op_next = next;
1378 PL_op = (OP *) &(XSH_CXT.yield_storage.leave_op);
1379 PL_op = PL_op->op_ppaddr(aTHX);
1381 XSH_CXT.yield_storage.proxy_op.op_next = PL_op;
1382 PL_op = &(XSH_CXT.yield_storage.proxy_op);
1385 /* --- Uplevel ------------------------------------------------------------- */
1387 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1388 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1390 static su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1391 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1396 sud = XSH_CXT.uplevel_storage.root;
1398 XSH_CXT.uplevel_storage.root = sud->next;
1399 XSH_CXT.uplevel_storage.count--;
1401 sud = su_uplevel_ud_new();
1404 sud->next = XSH_CXT.uplevel_storage.top;
1405 XSH_CXT.uplevel_storage.top = sud;
1407 depth = su_uid_depth(cxix);
1408 su_uid_storage_dup(&sud->tmp_uid_storage, &XSH_CXT.uid_storage, depth);
1409 sud->old_uid_storage = XSH_CXT.uid_storage;
1410 XSH_CXT.uid_storage = sud->tmp_uid_storage;
1415 #if XSH_HAS_PERL(5, 13, 7)
1417 static void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1418 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1421 sud->tmp_uid_storage = XSH_CXT.uid_storage;
1422 XSH_CXT.uid_storage = sud->old_uid_storage;
1426 map = sud->tmp_uid_storage.map;
1427 alloc = sud->tmp_uid_storage.alloc;
1428 for (i = 0; i < alloc; ++i)
1429 map[i].flags &= ~SU_UID_ACTIVE;
1431 XSH_CXT.uplevel_storage.top = sud->next;
1433 if (XSH_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1434 su_uplevel_ud_delete(sud);
1436 sud->next = XSH_CXT.uplevel_storage.root;
1437 XSH_CXT.uplevel_storage.root = sud;
1438 XSH_CXT.uplevel_storage.count++;
1444 static int su_uplevel_goto_static(const OP *o) {
1445 for (; o; o = OpSIBLING(o)) {
1446 /* goto ops are unops with kids. */
1447 if (!(o->op_flags & OPf_KIDS))
1450 switch (o->op_type) {
1453 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1458 if (su_uplevel_goto_static(((const UNOP *) o)->op_first))
1467 #if SU_UPLEVEL_HIJACKS_RUNOPS
1469 static int su_uplevel_goto_runops(pTHX) {
1470 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1476 if (op->op_type == OP_GOTO) {
1477 AV *argarray = NULL;
1480 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1481 const PERL_CONTEXT *cx = cxstack + cxix;
1483 switch (CxTYPE(cx)) {
1485 if (CxHASARGS(cx)) {
1486 argarray = cx->blk_sub.argarray;
1502 if (XSH_CXT.uplevel_storage.top->cxix == cxix) {
1503 AV *args = GvAV(PL_defgv);
1504 I32 items = AvFILLp(args);
1506 av_extend(argarray, items);
1507 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1508 AvFILLp(argarray) = items;
1513 PL_op = op = op->op_ppaddr(aTHX);
1515 #if !XSH_HAS_PERL(5, 13, 0)
1525 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1527 #define su_at_underscore(C) PadARRAY(PadlistARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1529 static void su_uplevel_restore(pTHX_ void *sus_) {
1530 su_uplevel_ud *sud = sus_;
1531 PERL_SI *cur = sud->old_curstackinfo;
1532 PERL_SI *si = sud->si;
1534 #if SU_UPLEVEL_HIJACKS_RUNOPS
1535 if (PL_runops == su_uplevel_goto_runops)
1536 PL_runops = sud->old_runops;
1539 if (sud->callback) {
1540 PERL_CONTEXT *cx = cxstack + sud->cxix;
1541 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1543 /* We have to fix the pad entry for @_ in the original callback because it
1544 * may have been reified. */
1545 if (AvREAL(argarray)) {
1546 const I32 fill = AvFILLp(argarray);
1547 SvREFCNT_dec(argarray);
1549 AvREAL_off(argarray);
1550 AvREIFY_on(argarray);
1551 av_extend(argarray, fill);
1552 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1554 CLEAR_ARGARRAY(argarray);
1557 /* If the old cv member is our renamed CV, it means that this place has been
1558 * reached without a goto() happening, and the old argarray member is
1559 * actually our fake argarray. Destroy it properly in that case. */
1560 if (cx->blk_sub.cv == sud->renamed) {
1561 SvREFCNT_dec(cx->blk_sub.argarray);
1562 cx->blk_sub.argarray = argarray;
1565 CvDEPTH(sud->callback)--;
1566 SvREFCNT_dec(sud->callback);
1569 /* Free the renamed CV. We must do it ourselves so that we can force the
1570 * depth to be 0, or perl would complain about it being "still in use".
1571 * But we *know* that it cannot be so. */
1573 if (!CvISXSUB(sud->renamed)) {
1574 CvDEPTH(sud->renamed) = 0;
1575 CvPADLIST(sud->renamed) = NULL;
1577 SvREFCNT_dec(sud->renamed);
1580 CATCH_SET(sud->old_catch);
1582 SU_UPLEVEL_RESTORE(op);
1584 /* stack_grow() wants PL_curstack so restore the old stack first */
1585 if (PL_curstackinfo == si) {
1586 PL_curstack = cur->si_stack;
1587 if (sud->old_mainstack)
1588 SU_UPLEVEL_RESTORE(mainstack);
1589 SU_UPLEVEL_RESTORE(curstackinfo);
1592 CV *target = sud->target;
1595 /* When we die, the depth of the target CV is not updated because of the
1596 * stack switcheroo. So we have to look at all the frames between the
1597 * uplevel call and the catch block to count how many call frames to the
1598 * target CV were skipped. */
1599 for (i = cur->si_cxix; i > sud->cxix; i--) {
1600 register const PERL_CONTEXT *cx = cxstack + i;
1602 if (CxTYPE(cx) == CXt_SUB) {
1603 if (cx->blk_sub.cv == target)
1608 /* If we died, the replacement stack was already unwinded to the first
1609 * eval frame, and all the contexts down there were popped. We don't have
1610 * to pop manually any context of the original stack, because they must
1611 * have been in the replacement stack as well (since the second was copied
1612 * from the first). Thus we only have to make sure the original stack index
1613 * points to the context just below the first eval scope under the target
1615 for (; i >= 0; i--) {
1616 register const PERL_CONTEXT *cx = cxstack + i;
1618 switch (CxTYPE(cx)) {
1620 if (cx->blk_sub.cv == target)
1632 CvDEPTH(target) = sud->target_depth - levels;
1633 PL_curstackinfo->si_cxix = i - 1;
1635 #if !XSH_HAS_PERL(5, 13, 1)
1636 /* Since $@ was maybe localized between the target frame and the uplevel
1637 * call, we forcefully flush the save stack to get rid of it and then
1638 * reset $@ to its proper value. Note that the the call to
1639 * su_uplevel_restore() must happen before the "reset $@" item of the save
1640 * stack is processed, as uplevel was called after the localization.
1641 * Andrew's changes to how $@ was handled, which were mainly integrated
1642 * between perl 5.13.0 and 5.13.1, fixed this. */
1643 if (ERRSV && SvTRUE(ERRSV)) {
1644 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1645 SV *errsv = SvREFCNT_inc(ERRSV);
1646 PL_scopestack_ix = cx->blk_oldscopesp;
1647 leave_scope(PL_scopestack[PL_scopestack_ix]);
1648 sv_setsv(ERRSV, errsv);
1649 SvREFCNT_dec(errsv);
1655 SU_UPLEVEL_RESTORE(curcop);
1657 SvREFCNT_dec(sud->target);
1659 PL_stack_base = AvARRAY(cur->si_stack);
1660 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1661 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1663 /* When an exception is thrown from the uplevel'd subroutine,
1664 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1665 * die_where() in more recent perls), which has the sad habit of keeping a
1666 * pointer to the current context frame across this call. This means that we
1667 * can't free the temporary context stack we used for the uplevel call right
1668 * now, or that pointer upwards would point to garbage. */
1669 #if XSH_HAS_PERL(5, 13, 7)
1670 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1671 * public in perl 5.13.7. */
1672 su_uplevel_storage_delete(sud);
1674 /* Otherwise, we just enqueue it back in the global storage list. */
1678 sud->tmp_uid_storage = XSH_CXT.uid_storage;
1679 XSH_CXT.uid_storage = sud->old_uid_storage;
1681 XSH_CXT.uplevel_storage.top = sud->next;
1682 sud->next = XSH_CXT.uplevel_storage.root;
1683 XSH_CXT.uplevel_storage.root = sud;
1684 XSH_CXT.uplevel_storage.count++;
1691 static CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1692 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1696 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1698 CvFLAGS(cv) = CvFLAGS(proto);
1700 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1702 CvDEPTH(cv) = CvDEPTH(proto);
1704 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1706 CvFILE(cv) = CvFILE(proto);
1710 #if SU_RELEASE && XSH_HAS_PERL_EXACT(5, 21, 4)
1713 CvSTASH_set(cv, CvSTASH(proto));
1714 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1715 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1716 * (which was part of perl 5.13.7). */
1717 #if XSH_HAS_PERL(5, 13, 3) && !XSH_HAS_PERL(5, 13, 7)
1719 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1722 if (CvISXSUB(proto)) {
1723 CvXSUB(cv) = CvXSUB(proto);
1724 CvXSUBANY(cv) = CvXSUBANY(proto);
1727 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1729 CvSTART(cv) = CvSTART(proto);
1730 CvPADLIST(cv) = CvPADLIST(proto);
1732 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1733 #ifdef CVf_WEAKOUTSIDE
1734 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1736 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1737 #ifdef CvOUTSIDE_SEQ
1738 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1742 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1752 static I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1753 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1755 const PERL_CONTEXT *cx = cxstack + cxix;
1757 PERL_SI *cur = PL_curstackinfo;
1763 I32 old_mark, new_mark;
1770 /* Make PL_stack_sp point just before the CV. */
1771 PL_stack_sp -= args + 1;
1772 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1775 sud = su_uplevel_storage_new(cxix);
1779 sud->callback = NULL;
1780 sud->renamed = NULL;
1781 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1785 si->si_type = cur->si_type;
1787 si->si_prev = cur->si_prev;
1789 si->si_markoff = cx->blk_oldmarksp;
1792 /* Allocate enough space for all the elements of the original stack up to the
1793 * target context, plus the forthcoming arguments. */
1794 new_mark = cx->blk_oldsp;
1795 av_extend(si->si_stack, new_mark + 1 + args + 1);
1796 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1797 AvFILLp(si->si_stack) = new_mark;
1798 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1800 /* Specialized SWITCHSTACK() */
1801 PL_stack_base = AvARRAY(si->si_stack);
1802 old_stack_sp = PL_stack_sp;
1803 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1804 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1807 /* Copy the context stack up to the context just below the target. */
1808 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1809 if (si->si_cxmax < cxix) {
1810 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1811 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1812 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1814 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1815 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1817 target = cx->blk_sub.cv;
1818 sud->target = (CV *) SvREFCNT_inc(target);
1819 sud->target_depth = CvDEPTH(target);
1821 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1822 * run-time implication, since PL_curcop will be overwritten as soon as we
1823 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1824 * make it point to the blk_oldcop for the target frame, so that caller()
1825 * reports the right file name, line number and lexical hints. */
1826 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1827 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1828 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1830 SU_UPLEVEL_SAVE(curstackinfo, si);
1831 /* If those two are equal, we need to fool POPSTACK_TO() */
1832 if (PL_mainstack == PL_curstack)
1833 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1835 sud->old_mainstack = NULL;
1836 PL_curstack = si->si_stack;
1838 renamed = su_cv_clone(callback, CvGV(target));
1839 sud->renamed = renamed;
1842 /* Both SP and old_stack_sp point just before the CV. */
1843 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1845 PUSHs((SV *) renamed);
1848 Zero(&sub_op, 1, UNOP);
1849 sub_op.op_type = OP_ENTERSUB;
1850 sub_op.op_next = NULL;
1851 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1853 sub_op.op_flags |= OPpENTERSUB_DB;
1855 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1857 #if SU_UPLEVEL_HIJACKS_RUNOPS
1858 sud->old_runops = PL_runops;
1861 sud->old_catch = CATCH_GET;
1864 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1865 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1867 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1870 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1871 CvDEPTH(callback)++;
1873 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1874 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1875 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1876 * with what we put on the stack. But we want to fake up the same arguments
1877 * as the ones in use at the context we uplevel to, so we replace the
1878 * argarray with an unreal copy of the original @_. */
1882 av_extend(av, AvMAX(cx->blk_sub.argarray));
1883 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1884 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1885 sub_cx->blk_sub.argarray = av;
1887 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1890 if (su_uplevel_goto_static(CvROOT(renamed))) {
1891 #if SU_UPLEVEL_HIJACKS_RUNOPS
1892 if (PL_runops != PL_runops_std) {
1893 if (PL_runops == PL_runops_dbg) {
1895 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1896 } else if (PL_runops != su_uplevel_goto_runops)
1897 croak("uplevel() can't execute code that calls goto with a custom runloop");
1900 PL_runops = su_uplevel_goto_runops;
1901 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1902 croak("uplevel() can't execute code that calls goto before perl 5.8");
1903 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1911 ret = PL_stack_sp - (PL_stack_base + new_mark);
1913 AV *old_stack = sud->old_curstackinfo->si_stack;
1915 if (old_mark + ret > AvMAX(old_stack)) {
1916 /* Specialized EXTEND(old_sp, ret) */
1917 av_extend(old_stack, old_mark + ret + 1);
1918 old_stack_sp = AvARRAY(old_stack) + old_mark;
1921 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1923 AvFILLp(old_stack) += ret;
1931 /* --- Unique context ID --------------------------------------------------- */
1933 static su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1934 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1939 map = XSH_CXT.uid_storage.map;
1940 alloc = XSH_CXT.uid_storage.alloc;
1942 if (depth >= alloc) {
1945 Renew(map, depth + 1, su_uid);
1946 for (i = alloc; i <= depth; ++i) {
1951 XSH_CXT.uid_storage.map = map;
1952 XSH_CXT.uid_storage.alloc = depth + 1;
1955 if (depth >= XSH_CXT.uid_storage.used)
1956 XSH_CXT.uid_storage.used = depth + 1;
1961 static int su_uid_storage_check(pTHX_ UV depth, UV seq) {
1962 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
1966 if (depth >= XSH_CXT.uid_storage.used)
1969 uid = XSH_CXT.uid_storage.map + depth;
1971 return (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
1974 static SV *su_uid_get(pTHX_ I32 cxix) {
1975 #define su_uid_get(I) su_uid_get(aTHX_ (I))
1980 depth = su_uid_depth(cxix);
1981 uid = su_uid_storage_fetch(depth);
1983 if (!(uid->flags & SU_UID_ACTIVE)) {
1986 uid->seq = su_uid_seq_next(depth);
1987 uid->flags |= SU_UID_ACTIVE;
1989 Newx(ud, 1, su_ud_uid);
1990 SU_UD_TYPE(ud) = SU_UD_TYPE_UID;
1992 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1995 uid_sv = sv_newmortal();
1996 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
2003 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
2005 #else /* grok_number */
2007 #define IS_NUMBER_IN_UV 0x1
2009 static int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
2010 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
2014 /* This crude check should be good enough for a fallback implementation.
2015 * Better be too strict than too lax. */
2016 for (i = 0; i < len; ++i) {
2021 tmpsv = sv_newmortal();
2022 sv_setpvn(tmpsv, s, len);
2023 *valuep = sv_2uv(tmpsv);
2025 return IS_NUMBER_IN_UV;
2028 #endif /* !grok_number */
2030 static int su_uid_validate(pTHX_ SV *uid) {
2031 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
2037 s = SvPV_const(uid, len);
2039 while (p < len && s[p] != '-')
2042 croak("UID contains only one part");
2044 type = su_grok_number(s, p, &depth);
2045 if (type != IS_NUMBER_IN_UV)
2046 croak("First UID part is not an unsigned integer");
2048 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
2050 type = su_grok_number(s + p, len - p, &seq);
2051 if (type != IS_NUMBER_IN_UV)
2052 croak("Second UID part is not an unsigned integer");
2054 return su_uid_storage_check(depth, seq);
2057 /* --- Context operations -------------------------------------------------- */
2059 /* Remove sequences of BLOCKs having DB for stash, followed by a SUB context
2060 * for the debugger callback. */
2062 static I32 su_context_skip_db(pTHX_ I32 cxix) {
2063 #define su_context_skip_db(C) su_context_skip_db(aTHX_ (C))
2069 for (i = cxix; i > 0; --i) {
2070 PERL_CONTEXT *cx = cxstack + i;
2072 switch (CxTYPE(cx)) {
2073 #if XSH_HAS_PERL(5, 17, 1)
2074 case CXt_LOOP_PLAIN:
2077 if (cx->blk_oldcop && CopSTASH(cx->blk_oldcop) == GvSTASH(PL_DBgv))
2081 if (cx->blk_sub.cv == GvCV(PL_DBsub)) {
2097 static I32 su_context_normalize_up(pTHX_ I32 cxix) {
2098 #define su_context_normalize_up(C) su_context_normalize_up(aTHX_ (C))
2104 cx = cxstack + cxix;
2105 if (CxTYPE(cx) == CXt_BLOCK) {
2106 PERL_CONTEXT *prev = cx - 1;
2108 switch (CxTYPE(prev)) {
2109 #if XSH_HAS_PERL(5, 10, 0)
2113 #if XSH_HAS_PERL(5, 11, 0)
2114 /* That's the only subcategory that can cause an extra BLOCK context */
2115 case CXt_LOOP_PLAIN:
2119 if (cx->blk_oldcop == prev->blk_oldcop)
2123 if (cx->blk_oldcop && OpSIBLING(cx->blk_oldcop)
2124 && OpSIBLING(cx->blk_oldcop)->op_type == OP_SUBST)
2133 static I32 su_context_normalize_down(pTHX_ I32 cxix) {
2134 #define su_context_normalize_down(C) su_context_normalize_down(aTHX_ (C))
2137 if (cxix >= cxstack_ix)
2140 next = cxstack + cxix + 1;
2141 if (CxTYPE(next) == CXt_BLOCK) {
2142 PERL_CONTEXT *cx = next - 1;
2144 switch (CxTYPE(cx)) {
2145 #if XSH_HAS_PERL(5, 10, 0)
2149 #if XSH_HAS_PERL(5, 11, 0)
2150 /* That's the only subcategory that can cause an extra BLOCK context */
2151 case CXt_LOOP_PLAIN:
2155 if (cx->blk_oldcop == next->blk_oldcop)
2159 if (next->blk_oldcop && OpSIBLING(next->blk_oldcop)
2160 && OpSIBLING(next->blk_oldcop)->op_type == OP_SUBST)
2169 #define su_context_here() su_context_normalize_up(su_context_skip_db(cxstack_ix))
2171 static I32 su_context_gimme(pTHX_ I32 cxix) {
2172 #define su_context_gimme(C) su_context_gimme(aTHX_ (C))
2175 for (i = cxix; i >= 0; --i) {
2176 PERL_CONTEXT *cx = cxstack + i;
2178 switch (CxTYPE(cx)) {
2179 /* gimme is always G_ARRAY for loop contexts. */
2180 #if XSH_HAS_PERL(5, 11, 0)
2182 case CXt_LOOP_PLAIN:
2183 case CXt_LOOP_LAZYSV:
2184 case CXt_LOOP_LAZYIV:
2189 const COP *cop = cx->blk_oldcop;
2190 if (cop && OpSIBLING(cop)) {
2191 switch (OpSIBLING(cop)->op_flags & OPf_WANT) {
2194 case OPf_WANT_SCALAR:
2213 /* --- Module setup/teardown ----------------------------------------------- */
2215 static void xsh_user_global_setup(pTHX) {
2218 MUTEX_INIT(&su_uid_seq_counter_mutex);
2220 XSH_LOCK(&su_uid_seq_counter_mutex);
2221 su_uid_seq_counter.seqs = NULL;
2222 su_uid_seq_counter.size = 0;
2223 XSH_UNLOCK(&su_uid_seq_counter_mutex);
2225 stash = gv_stashpv(XSH_PACKAGE, 1);
2226 newCONSTSUB(stash, "TOP", newSViv(0));
2227 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(XSH_THREADSAFE));
2232 static void xsh_user_local_setup(pTHX_ xsh_user_cxt_t *cxt) {
2233 cxt->stack_placeholder = NULL;
2235 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
2236 Zero(&(cxt->unwind_storage.return_op), 1, LISTOP);
2237 cxt->unwind_storage.return_op.op_type = OP_RETURN;
2238 cxt->unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
2240 Zero(&(cxt->unwind_storage.proxy_op), 1, OP);
2241 cxt->unwind_storage.proxy_op.op_type = OP_STUB;
2242 cxt->unwind_storage.proxy_op.op_ppaddr = NULL;
2244 Zero(&(cxt->yield_storage.leave_op), 1, UNOP);
2245 cxt->yield_storage.leave_op.op_type = OP_STUB;
2246 cxt->yield_storage.leave_op.op_ppaddr = NULL;
2248 Zero(&(cxt->yield_storage.proxy_op), 1, OP);
2249 cxt->yield_storage.proxy_op.op_type = OP_STUB;
2250 cxt->yield_storage.proxy_op.op_ppaddr = NULL;
2252 cxt->uplevel_storage.top = NULL;
2253 cxt->uplevel_storage.root = NULL;
2254 cxt->uplevel_storage.count = 0;
2256 cxt->uid_storage.map = NULL;
2257 cxt->uid_storage.used = 0;
2258 cxt->uid_storage.alloc = 0;
2263 static void xsh_user_local_teardown(pTHX_ xsh_user_cxt_t *cxt) {
2266 Safefree(cxt->uid_storage.map);
2268 cur = cxt->uplevel_storage.root;
2270 su_uplevel_ud *prev;
2274 su_uplevel_ud_delete(prev);
2281 static void xsh_user_global_teardown(pTHX) {
2282 XSH_LOCK(&su_uid_seq_counter_mutex);
2283 PerlMemShared_free(su_uid_seq_counter.seqs);
2284 su_uid_seq_counter.size = 0;
2285 XSH_UNLOCK(&su_uid_seq_counter_mutex);
2287 MUTEX_DESTROY(&su_uid_seq_counter_mutex);
2292 /* --- XS ------------------------------------------------------------------ */
2294 #define SU_GET_CONTEXT(A, B, D) \
2303 else if (cxix > cxstack_ix) \
2311 #define SU_GET_LEVEL(A, B) \
2317 level = SvIV(lsv); \
2324 #if XSH_HAS_PERL(5, 10, 0)
2325 # define SU_INFO_COUNT 11
2327 # define SU_INFO_COUNT 10
2330 XS(XS_Scope__Upper_unwind) {
2339 PERL_UNUSED_VAR(cv); /* -W */
2340 PERL_UNUSED_VAR(ax); /* -Wall */
2342 SU_GET_CONTEXT(0, items - 1, cxstack_ix);
2344 PERL_CONTEXT *cx = cxstack + cxix;
2345 switch (CxTYPE(cx)) {
2347 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2351 XSH_CXT.unwind_storage.cxix = cxix;
2352 XSH_CXT.unwind_storage.items = items;
2353 XSH_CXT.unwind_storage.savesp = PL_stack_sp;
2355 XSH_CXT.unwind_storage.items--;
2356 XSH_CXT.unwind_storage.savesp--;
2358 /* pp_entersub will want to sanitize the stack after returning from there
2359 * Screw that, we're insane!
2360 * dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
2361 if (GIMME_V == G_SCALAR)
2362 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2363 SAVEDESTRUCTOR_X(su_unwind, NULL);
2368 } while (--cxix >= 0);
2369 croak("Can't return outside a subroutine");
2372 static const char su_yield_name[] = "yield";
2374 XS(XS_Scope__Upper_yield) {
2383 PERL_UNUSED_VAR(cv); /* -W */
2384 PERL_UNUSED_VAR(ax); /* -Wall */
2386 SU_GET_CONTEXT(0, items - 1, su_context_here());
2387 XSH_CXT.yield_storage.cxix = cxix;
2388 XSH_CXT.yield_storage.items = items;
2389 XSH_CXT.yield_storage.savesp = PL_stack_sp;
2391 XSH_CXT.yield_storage.items--;
2392 XSH_CXT.yield_storage.savesp--;
2394 /* See XS_Scope__Upper_unwind */
2395 if (GIMME_V == G_SCALAR)
2396 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2397 SAVEDESTRUCTOR_X(su_yield, su_yield_name);
2401 static const char su_leave_name[] = "leave";
2403 XS(XS_Scope__Upper_leave) {
2411 PERL_UNUSED_VAR(cv); /* -W */
2412 PERL_UNUSED_VAR(ax); /* -Wall */
2414 XSH_CXT.yield_storage.cxix = su_context_here();
2415 XSH_CXT.yield_storage.items = items;
2416 XSH_CXT.yield_storage.savesp = PL_stack_sp;
2417 /* See XS_Scope__Upper_unwind */
2418 if (GIMME_V == G_SCALAR)
2419 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2420 SAVEDESTRUCTOR_X(su_yield, su_leave_name);
2424 MODULE = Scope::Upper PACKAGE = Scope::Upper
2431 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
2432 newXSproto("Scope::Upper::yield", XS_Scope__Upper_yield, file, NULL);
2433 newXSproto("Scope::Upper::leave", XS_Scope__Upper_leave, file, NULL);
2445 #endif /* XSH_THREADSAFE */
2453 cxix = su_context_here();
2464 SU_GET_CONTEXT(0, 0, su_context_here());
2467 cxix = su_context_skip_db(cxix);
2468 cxix = su_context_normalize_up(cxix);
2470 warn(su_stack_smash);
2482 SU_GET_CONTEXT(0, 0, cxstack_ix);
2484 for (; cxix >= 0; --cxix) {
2485 PERL_CONTEXT *cx = cxstack + cxix;
2486 switch (CxTYPE(cx)) {
2490 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2496 warn(su_no_such_target, "subroutine");
2505 SU_GET_CONTEXT(0, 0, cxstack_ix);
2507 for (; cxix >= 0; --cxix) {
2508 PERL_CONTEXT *cx = cxstack + cxix;
2509 switch (CxTYPE(cx)) {
2517 warn(su_no_such_target, "eval");
2527 cxix = su_context_here();
2528 while (--level >= 0) {
2530 warn(su_stack_smash);
2534 cxix = su_context_skip_db(cxix);
2535 cxix = su_context_normalize_up(cxix);
2548 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2549 PERL_CONTEXT *cx = cxstack + cxix;
2550 switch (CxTYPE(cx)) {
2552 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2563 warn(su_stack_smash);
2574 SU_GET_CONTEXT(0, 0, cxstack_ix);
2577 PERL_CONTEXT *cx = cxstack + cxix--;
2578 switch (CxTYPE(cx)) {
2580 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2584 I32 gimme = cx->blk_gimme;
2586 case G_VOID: XSRETURN_UNDEF; break;
2587 case G_SCALAR: XSRETURN_NO; break;
2588 case G_ARRAY: XSRETURN_YES; break;
2601 const PERL_CONTEXT *cx, *dbcx;
2604 SU_GET_CONTEXT(0, 0, su_context_skip_db(cxstack_ix));
2605 cxix = su_context_normalize_up(cxix);
2606 cx = cxstack + cxix;
2608 if (PL_DBsub && cxix && (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)) {
2609 I32 i = su_context_skip_db(cxix - 1) + 1;
2610 if (i < cxix && CxTYPE(cxstack + i) == CXt_SUB)
2613 cop = cx->blk_oldcop;
2614 EXTEND(SP, SU_INFO_COUNT);
2617 HV *stash = CopSTASH(cop);
2619 PUSHs(su_newmortal_pvn(HvNAME(stash), HvNAMELEN(stash)));
2621 PUSHs(&PL_sv_undef);
2624 PUSHs(su_newmortal_pvn(OutCopFILE(cop), OutCopFILE_len(cop)));
2626 mPUSHi(CopLINE(cop));
2627 /* subroutine (3) and has_args (4) */
2628 switch (CxTYPE(cx)) {
2631 GV *cvgv = CvGV(dbcx->blk_sub.cv);
2632 if (cvgv && isGV(cvgv)) {
2633 SV *sv = sv_newmortal();
2634 gv_efullname3(sv, cvgv, NULL);
2637 PUSHs(su_newmortal_pvs("(unknown)"));
2646 PUSHs(su_newmortal_pvs("(eval)"));
2650 PUSHs(&PL_sv_undef);
2651 PUSHs(&PL_sv_undef);
2654 switch (su_context_gimme(cxix)) {
2661 default: /* G_VOID */
2662 PUSHs(&PL_sv_undef);
2665 /* eval text (6) and is_require (7) */
2666 switch (CxTYPE(cx)) {
2668 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
2670 #if XSH_HAS_PERL(5, 17, 4)
2671 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
2672 SvCUR(cx->blk_eval.cur_text)-2,
2673 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
2675 PUSHs(cx->blk_eval.cur_text);
2679 } else if (cx->blk_eval.old_namesv) {
2681 PUSHs(sv_mortalcopy(cx->blk_eval.old_namesv));
2687 /* Anything else including eval BLOCK */
2688 PUSHs(&PL_sv_undef);
2689 PUSHs(&PL_sv_undef);
2693 mPUSHi(CopHINTS_get(cop));
2697 #if XSH_HAS_PERL(5, 9, 4)
2698 STRLEN *old_warnings = cop->cop_warnings;
2700 SV *old_warnings = cop->cop_warnings;
2702 if (old_warnings == pWARN_STD) {
2703 if (PL_dowarn & G_WARN_ON)
2704 goto context_info_warnings_on;
2706 #if XSH_HAS_PERL(5, 17, 4)
2707 mask = &PL_sv_undef;
2709 goto context_info_warnings_off;
2711 } else if (old_warnings == pWARN_NONE) {
2712 #if !XSH_HAS_PERL(5, 17, 4)
2713 context_info_warnings_off:
2715 mask = su_newmortal_pvn(WARN_NONEstring, WARNsize);
2716 } else if (old_warnings == pWARN_ALL) {
2718 context_info_warnings_on:
2719 #if XSH_HAS_PERL(5, 8, 7)
2720 bits = get_hv("warnings::Bits", 0);
2722 SV **bits_all = hv_fetchs(bits, "all", FALSE);
2724 mask = sv_mortalcopy(*bits_all);
2728 mask = su_newmortal_pvn(WARN_ALLstring, WARNsize);
2730 #if XSH_HAS_PERL(5, 9, 4)
2731 mask = su_newmortal_pvn((char *) (old_warnings + 1), old_warnings[0]);
2733 mask = sv_mortalcopy(old_warnings);
2738 #if XSH_HAS_PERL(5, 10, 0)
2739 /* hints hash (10) */
2741 COPHH *hints_hash = CopHINTHASH_get(cop);
2743 SV *rhv = sv_2mortal(newRV_noinc((SV *) cophh_2hv(hints_hash, 0)));
2746 PUSHs(&PL_sv_undef);
2750 XSRETURN(SU_INFO_COUNT);
2759 SU_GET_CONTEXT(1, 1, su_context_skip_db(cxstack_ix));
2760 cxix = su_context_normalize_down(cxix);
2761 Newx(ud, 1, su_ud_reap);
2762 SU_UD_TYPE(ud) = SU_UD_TYPE_REAP;
2763 ud->cb = (SvROK(hook) && SvTYPE(SvRV(hook)) >= SVt_PVCV)
2764 ? SvRV(hook) : hook;
2765 SvREFCNT_inc_simple_void(ud->cb);
2766 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2769 localize(SV *sv, SV *val, ...)
2776 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2777 cxix = su_context_normalize_down(cxix);
2778 Newx(ud, 1, su_ud_localize);
2779 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2780 size = su_ud_localize_init(ud, sv, val, NULL);
2781 su_init(ud, cxix, size);
2784 localize_elem(SV *sv, SV *elem, SV *val, ...)
2791 if (SvTYPE(sv) >= SVt_PVGV)
2792 croak("Can't infer the element localization type from a glob and the value");
2793 SU_GET_CONTEXT(3, 3, su_context_skip_db(cxstack_ix));
2794 cxix = su_context_normalize_down(cxix);
2795 Newx(ud, 1, su_ud_localize);
2796 /* Initialize SU_UD_ORIGIN(ud) in case SU_UD_LOCALIZE_FREE(ud) needs it */
2797 SU_UD_ORIGIN(ud) = NULL;
2798 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2799 size = su_ud_localize_init(ud, sv, val, elem);
2800 if (SU_UD_PRIVATE(ud) != SVt_PVAV && SU_UD_PRIVATE(ud) != SVt_PVHV) {
2801 SU_UD_LOCALIZE_FREE(ud);
2802 croak("Can't localize an element of something that isn't an array or a hash");
2804 su_init(ud, cxix, size);
2807 localize_delete(SV *sv, SV *elem, ...)
2814 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2815 cxix = su_context_normalize_down(cxix);
2816 Newx(ud, 1, su_ud_localize);
2817 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2818 size = su_ud_localize_init(ud, sv, NULL, elem);
2819 su_init(ud, cxix, size);
2822 uplevel(SV *code, ...)
2825 I32 cxix, ret, args = 0;
2829 if (SvTYPE(code) < SVt_PVCV)
2830 croak("First argument to uplevel must be a code reference");
2831 SU_GET_CONTEXT(1, items - 1, cxstack_ix);
2833 PERL_CONTEXT *cx = cxstack + cxix;
2834 switch (CxTYPE(cx)) {
2836 croak("Can't uplevel to an eval frame");
2838 croak("Can't uplevel to a format frame");
2840 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2846 /* su_uplevel() takes care of extending the stack if needed. */
2847 ret = su_uplevel((CV *) code, cxix, args);
2852 } while (--cxix >= 0);
2853 croak("Can't uplevel outside a subroutine");
2862 SU_GET_CONTEXT(0, 0, su_context_here());
2863 uid = su_uid_get(cxix);
2869 validate_uid(SV *uid)
2874 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;