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
55 static void su_debug_log(const char *fmt, ...) {
59 PerlIO_vprintf(Perl_debug_log, fmt, va);
68 # define Newx(v, n, c) New(0, v, n, c)
73 # define SU_POISON(D, N, T) PoisonNew((D), (N), T)
74 # elif defined(Poison)
75 # define SU_POISON(D, N, T) Poison((D), (N), T)
79 # define SU_POISON(D, N, T) NOOP
83 static SV *su_newSV_type(pTHX_ svtype t) {
88 # define newSV_type(T) su_newSV_type(aTHX_ (T))
92 # define su_newmortal_pvn(S, L) newSVpvn_flags((S), (L), SVs_TEMP)
94 # define su_newmortal_pvn(S, L) sv_2mortal(newSVpvn((S), (L)))
96 #define su_newmortal_pvs(S) su_newmortal_pvn((S), sizeof(S)-1)
99 # define SvPV_const(S, L) SvPV(S, L)
103 # define SvPVX_const(S) SvPVX(S)
106 #ifndef SvPV_nolen_const
107 # define SvPV_nolen_const(S) SvPV_nolen(S)
110 #ifndef SvREFCNT_inc_simple_void
111 # define SvREFCNT_inc_simple_void(sv) ((void) SvREFCNT_inc(sv))
115 # define mPUSHi(I) PUSHs(sv_2mortal(newSViv(I)))
119 # define GvCV_set(G, C) (GvCV(G) = (C))
123 # define CvGV_set(C, G) (CvGV(C) = (G))
127 # define CvSTASH_set(C, S) (CvSTASH(C) = (S))
131 # define CvISXSUB(C) CvXSUB(C)
135 # define PadlistARRAY(P) AvARRAY(P)
136 # define PadARRAY(P) AvARRAY(P)
140 # define CxHASARGS(C) ((C)->blk_sub.hasargs)
145 # define CxGIMME(C) ((C)->blk_gimme & G_WANT)
147 # define CxGIMME(C) ((C)->blk_gimme)
151 #ifndef CxOLD_OP_TYPE
152 # define CxOLD_OP_TYPE(C) (C)->blk_eval.old_op_type
156 # define OutCopFILE(C) CopFILE(C)
159 #ifndef OutCopFILE_len
160 # define OutCopFILE_len(C) strlen(OutCopFILE(C))
164 # define CopHINTS_get(C) ((I32) (C)->op_private & HINT_PRIVATE_MASK)
167 #ifndef CopHINTHASH_get
168 # define CopHINTHASH_get(C) (C)->cop_hints_hash
172 # define COPHH struct refcounted_he
173 # define cophh_2hv(H, F) Perl_refcounted_he_chain_2hv(aTHX_ (H))
177 # define HvNAME_get(H) HvNAME(H)
181 # define HvNAMELEN(H) strlen(HvNAME(H))
184 #ifndef gv_fetchpvn_flags
185 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
189 # define hv_fetchs(H, K, L) hv_fetch((H), (K), sizeof(K)-1, (L))
192 #ifndef OP_GIMME_REVERSE
193 static U8 su_op_gimme_reverse(U8 gimme) {
196 return OPf_WANT_VOID;
198 return OPf_WANT_LIST;
203 return OPf_WANT_SCALAR;
205 #define OP_GIMME_REVERSE(G) su_op_gimme_reverse(G)
210 # define OpSIBLING(O) OP_SIBLING(O)
212 # define OpSIBLING(O) ((O)->op_sibling)
216 #ifndef PERL_MAGIC_tied
217 # define PERL_MAGIC_tied 'P'
220 #ifndef PERL_MAGIC_env
221 # define PERL_MAGIC_env 'E'
224 #ifndef NEGATIVE_INDICES_VAR
225 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
228 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
229 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
231 /* --- Threads and multiplicity -------------------------------------------- */
233 #ifndef SU_MULTIPLICITY
234 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
235 # define SU_MULTIPLICITY 1
237 # define SU_MULTIPLICITY 0
240 #if SU_MULTIPLICITY && !defined(tTHX)
241 # define tTHX PerlInterpreter*
244 #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))
245 # define SU_THREADSAFE 1
246 # ifndef MY_CXT_CLONE
247 # define MY_CXT_CLONE \
249 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
250 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
251 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
254 # define SU_THREADSAFE 0
256 # define dMY_CXT dNOOP
258 # define MY_CXT su_globaldata
260 # define START_MY_CXT static my_cxt_t MY_CXT;
262 # define MY_CXT_INIT NOOP
264 # define MY_CXT_CLONE NOOP
267 /* --- Error messages ------------------------------------------------------ */
269 static const char su_stack_smash[] = "Cannot target a scope outside of the current stack";
270 static const char su_no_such_target[] = "No targetable %s scope in the current stack";
272 /* --- Unique context ID global storage ------------------------------------ */
274 /* ... Sequence ID counter ................................................. */
281 static su_uv_array su_uid_seq_counter;
285 static perl_mutex su_uid_seq_counter_mutex;
287 #define SU_LOCK(M) MUTEX_LOCK(M)
288 #define SU_UNLOCK(M) MUTEX_UNLOCK(M)
290 #else /* USE_ITHREADS */
295 #endif /* !USE_ITHREADS */
297 static UV su_uid_seq_next(pTHX_ UV depth) {
298 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
302 SU_LOCK(&su_uid_seq_counter_mutex);
304 seqs = su_uid_seq_counter.seqs;
306 if (depth >= su_uid_seq_counter.size) {
309 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
310 for (i = su_uid_seq_counter.size; i <= depth; ++i)
313 su_uid_seq_counter.seqs = seqs;
314 su_uid_seq_counter.size = depth + 1;
319 SU_UNLOCK(&su_uid_seq_counter_mutex);
324 /* ... UID storage ......................................................... */
331 #define SU_UID_ACTIVE 1
333 static UV su_uid_depth(pTHX_ I32 cxix) {
334 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
339 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
340 depth += si->si_cxix + 1;
351 static void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
352 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
353 su_uid *old_map = old_cxt->map;
356 su_uid *new_map = new_cxt->map;
357 STRLEN old_used = old_cxt->used;
358 STRLEN new_used, new_alloc;
361 new_used = max_depth < old_used ? max_depth : old_used;
362 new_cxt->used = new_used;
364 if (new_used <= new_cxt->alloc) {
365 new_alloc = new_cxt->alloc;
367 new_alloc = new_used;
368 Renew(new_map, new_alloc, su_uid);
369 new_cxt->map = new_map;
370 new_cxt->alloc = new_alloc;
373 for (i = 0; i < new_alloc; ++i) {
374 su_uid *new_uid = new_map + i;
376 if (i < new_used) { /* => i < max_depth && i < old_used */
377 su_uid *old_uid = old_map + i;
379 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
393 /* --- unwind() global storage --------------------------------------------- */
403 /* --- yield() global storage ---------------------------------------------- */
413 /* --- uplevel() data tokens and global storage ---------------------------- */
415 #define SU_UPLEVEL_HIJACKS_RUNOPS SU_HAS_PERL(5, 8, 0)
420 su_uid_storage tmp_uid_storage;
421 su_uid_storage old_uid_storage;
432 PERL_SI *old_curstackinfo;
438 #if SU_UPLEVEL_HIJACKS_RUNOPS
439 runops_proc_t old_runops;
446 static su_uplevel_ud *su_uplevel_ud_new(pTHX) {
447 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
451 Newx(sud, 1, su_uplevel_ud);
454 sud->tmp_uid_storage.map = NULL;
455 sud->tmp_uid_storage.used = 0;
456 sud->tmp_uid_storage.alloc = 0;
458 Newx(si, 1, PERL_SI);
459 si->si_stack = newAV();
460 AvREAL_off(si->si_stack);
461 si->si_cxstack = NULL;
469 static void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
470 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
471 PERL_SI *si = sud->si;
473 Safefree(si->si_cxstack);
474 SvREFCNT_dec(si->si_stack);
477 Safefree(sud->tmp_uid_storage.map);
488 } su_uplevel_storage;
490 #ifndef SU_UPLEVEL_STORAGE_SIZE
491 # define SU_UPLEVEL_STORAGE_SIZE 4
494 /* --- Global data --------------------------------------------------------- */
496 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
499 char *stack_placeholder;
500 su_unwind_storage unwind_storage;
501 su_yield_storage yield_storage;
502 su_uplevel_storage uplevel_storage;
503 su_uid_storage uid_storage;
508 /* --- Stack manipulations ------------------------------------------------- */
510 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_CXT.stack_placeholder)
512 #define SU_SAVE_DESTRUCTOR_SIZE 3
513 #define SU_SAVE_PLACEHOLDER_SIZE 3
515 #define SU_SAVE_SCALAR_SIZE 3
517 #define SU_SAVE_ARY_SIZE 3
518 #define SU_SAVE_AELEM_SIZE 4
520 # define SU_SAVE_ADELETE_SIZE 3
522 # define SU_SAVE_ADELETE_SIZE SU_SAVE_DESTRUCTOR_SIZE
524 #if SU_SAVE_AELEM_SIZE < SU_SAVE_ADELETE_SIZE
525 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_ADELETE_SIZE
527 # define SU_SAVE_AELEM_OR_ADELETE_SIZE SU_SAVE_AELEM_SIZE
530 #define SU_SAVE_HASH_SIZE 3
531 #define SU_SAVE_HELEM_SIZE 4
532 #define SU_SAVE_HDELETE_SIZE 4
533 #if SU_SAVE_HELEM_SIZE < SU_SAVE_HDELETE_SIZE
534 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HDELETE_SIZE
536 # define SU_SAVE_HELEM_OR_HDELETE_SIZE SU_SAVE_HELEM_SIZE
539 #define SU_SAVE_GVCV_SIZE SU_SAVE_DESTRUCTOR_SIZE
541 #if !SU_HAS_PERL(5, 8, 9)
542 # define SU_SAVE_GP_SIZE 6
543 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
544 # define SU_SAVE_GP_SIZE 3
545 #elif !SU_HAS_PERL(5, 13, 8)
546 # define SU_SAVE_GP_SIZE 4
548 # define SU_SAVE_GP_SIZE 3
551 #ifndef SvCANEXISTDELETE
552 # define SvCANEXISTDELETE(sv) \
554 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
555 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
556 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
557 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
562 /* ... Saving array elements ............................................... */
564 static I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
565 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
571 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
572 #if SU_HAS_PERL(5, 8, 1)
573 if (SvRMAGICAL(av)) {
574 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
576 SV * const * const negative_indices_glob =
577 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
578 NEGATIVE_INDICES_VAR, 16, 0);
579 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
585 idx = key + av_len(av) + 1;
599 static void su_adelete(pTHX_ void *ud_) {
600 su_ud_adelete *ud = (su_ud_adelete *) ud_;
602 av_delete(ud->av, ud->idx, G_DISCARD);
603 SvREFCNT_dec(ud->av);
608 static void su_save_adelete(pTHX_ AV *av, I32 idx) {
609 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
612 Newx(ud, 1, su_ud_adelete);
615 SvREFCNT_inc_simple_void(av);
617 SAVEDESTRUCTOR_X(su_adelete, ud);
620 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
622 #endif /* SAVEADELETE */
624 static void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
625 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
632 idx = su_av_key2idx(av, SvIV(key));
634 if (SvCANEXISTDELETE(av))
635 preeminent = av_exists(av, idx);
637 svp = av_fetch(av, idx, 1);
638 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
641 save_aelem(av, idx, svp);
643 SAVEADELETE(av, idx);
645 if (val) { /* local $x[$idx] = $val; */
646 SvSetMagicSV(*svp, val);
647 } else { /* local $x[$idx]; delete $x[$idx]; */
648 av_delete(av, idx, G_DISCARD);
652 /* ... Saving hash elements ................................................ */
654 static void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
655 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
662 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
663 preeminent = hv_exists_ent(hv, keysv, 0);
665 he = hv_fetch_ent(hv, keysv, 1, 0);
666 svp = he ? &HeVAL(he) : NULL;
667 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
669 if (HvNAME_get(hv) && isGV(*svp)) {
670 save_gp((GV *) *svp, 0);
675 save_helem(hv, keysv, svp);
678 const char * const key = SvPV_const(keysv, keylen);
679 SAVEDELETE(hv, savepvn(key, keylen),
680 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
683 if (val) { /* local $x{$keysv} = $val; */
684 SvSetMagicSV(*svp, val);
685 } else { /* local $x{$keysv}; delete $x{$keysv}; */
686 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
690 /* ... Saving code slots from a glob ....................................... */
692 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
693 # define mro_method_changed_in(G) PL_sub_generation++
701 static void su_restore_gvcv(pTHX_ void *ud_) {
702 su_save_gvcv_ud *ud = ud_;
705 GvCV_set(gv, ud->old_cv);
707 mro_method_changed_in(GvSTASH(gv));
712 static void su_save_gvcv(pTHX_ GV *gv) {
713 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
716 Newx(ud, 1, su_save_gvcv_ud);
718 ud->old_cv = GvCV(gv);
722 mro_method_changed_in(GvSTASH(gv));
724 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
727 /* --- Actions ------------------------------------------------------------- */
738 #define SU_UD_TYPE(U) (((su_ud_common *) (U))->type)
739 #define SU_UD_PRIVATE(U) (((su_ud_common *) (U))->private)
740 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
741 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
742 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
744 #define SU_UD_TYPE_REAP 0
745 #define SU_UD_TYPE_LOCALIZE 1
746 #define SU_UD_TYPE_UID 2
748 #define SU_UD_FREE(U) STMT_START { \
749 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
753 /* ... Reap ................................................................ */
755 #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))
762 #define SU_UD_REAP_CB(U) (((su_ud_reap *) (U))->cb)
764 static void su_call(pTHX_ SV *cb) {
767 PERL_CONTEXT saved_cx;
768 #endif /* SU_SAVE_LAST_CX */
772 SU_D(su_debug_log("@@@ call scope_ix=%2d save_ix=%2d\n",
773 PL_scopestack_ix, PL_savestack_ix));
782 /* If the recently popped context isn't saved there, it will be overwritten by
783 * the sub scope from call_sv, although it's still needed in our caller. */
784 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
785 saved_cx = cxstack[cxix];
786 #endif /* SU_SAVE_LAST_CX */
791 cxstack[cxix] = saved_cx;
792 #endif /* SU_SAVE_LAST_CX */
804 /* ... Localize & localize array/hash element .............................. */
813 #define SU_UD_LOCALIZE_SV(U) (((su_ud_localize *) (U))->sv)
814 #define SU_UD_LOCALIZE_VAL(U) (((su_ud_localize *) (U))->val)
815 #define SU_UD_LOCALIZE_ELEM(U) (((su_ud_localize *) (U))->elem)
817 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
818 SvREFCNT_dec(SU_UD_LOCALIZE_ELEM(U)); \
819 SvREFCNT_dec(SU_UD_LOCALIZE_VAL(U)); \
820 SvREFCNT_dec(SU_UD_LOCALIZE_SV(U)); \
824 static I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
825 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
830 SvREFCNT_inc_simple_void(sv);
832 if (SvTYPE(sv) >= SVt_PVGV) {
833 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
835 } else { /* local *x = \$val; */
836 t = SvTYPE(SvRV(val));
839 } else if (SvROK(sv)) {
840 croak("Invalid %s reference as the localization target",
841 sv_reftype(SvRV(sv), 0));
844 const char *p = SvPV_const(sv, len), *s;
845 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
851 case '$': t = SVt_PV; break;
852 case '@': t = SVt_PVAV; break;
853 case '%': t = SVt_PVHV; break;
854 case '&': t = SVt_PVCV; break;
855 case '*': t = SVt_PVGV; break;
860 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
861 if (SvROK(val) && !sv_isobject(val)) {
862 t = SvTYPE(SvRV(val));
874 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
879 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
884 size = SU_SAVE_GP_SIZE;
888 size = SU_SAVE_GVCV_SIZE;
892 size = SU_SAVE_SCALAR_SIZE;
895 /* When deref is set, val isn't NULL */
897 SU_UD_PRIVATE(ud) = t;
900 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
901 ud->elem = SvREFCNT_inc(elem);
906 static void su_localize(pTHX_ void *ud_) {
907 #define su_localize(U) su_localize(aTHX_ (U))
908 su_ud_localize *ud = (su_ud_localize *) ud_;
912 svtype t = SU_UD_PRIVATE(ud);
915 if (SvTYPE(sv) >= SVt_PVGV) {
919 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
922 const char *name = SvPV_const(sv, len);
923 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
930 su_debug_log("%p: === localize a %s\n",ud, sv_reftype(z, 0));
931 su_debug_log("%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
932 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
936 /* Inspired from Alias.pm */
940 su_save_aelem(GvAV(gv), elem, val);
947 su_save_helem(GvHV(gv), elem, val);
953 save_gp(gv, 1); /* hide previous entry in symtab */
959 gv = (GV *) save_scalar(gv);
964 SvSetMagicSV((SV *) gv, val);
969 /* ... Unique context ID ................................................... */
971 /* We must pass the index because MY_CXT.uid_storage might be reallocated
972 * between the UID fetch and the invalidation at the end of scope. */
979 static void su_uid_drop(pTHX_ void *ud_) {
983 MY_CXT.uid_storage.map[ud->idx].flags &= ~SU_UID_ACTIVE;
990 /* --- Pop a context back -------------------------------------------------- */
993 # define SU_CXNAME(C) PL_block_type[CxTYPE(C)]
995 # if SU_HAS_PERL(5, 11, 0)
996 static const char *su_block_type[] = {
1010 # elif SU_HAS_PERL(5, 9, 3)
1011 static const char *su_block_type[] = {
1026 static const char *su_block_type[] = {
1035 # define SU_CXNAME(C) su_block_type[CxTYPE(C)]
1038 static void su_pop(pTHX_ void *ud) {
1039 #define su_pop(U) su_pop(aTHX_ (U))
1040 I32 depth, base, mark, *origin;
1041 depth = SU_UD_DEPTH(ud);
1044 "%p: --- pop a %s\n"
1045 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
1046 ud, SU_CXNAME(cxstack + cxstack_ix),
1047 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix]
1050 origin = SU_UD_ORIGIN(ud);
1051 mark = origin[depth];
1052 base = origin[depth - 1];
1054 SU_D(su_debug_log("%p: original scope was %*c top=%2d base=%2d\n",
1055 ud, 24, ' ', mark, base));
1058 #if SU_HAS_PERL(5, 19, 4)
1063 SU_D(su_debug_log("%p: clear leftovers\n", ud));
1065 #if SU_HAS_PERL(5, 19, 4)
1066 cx = cxstack + cxstack_ix;
1067 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1068 save = PL_scopestack[cx->blk_oldscopesp - 1];
1071 PL_savestack_ix = mark;
1074 #if SU_HAS_PERL(5, 19, 4)
1075 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)
1076 PL_scopestack[cx->blk_oldscopesp - 1] = save;
1079 PL_savestack_ix = base;
1081 SU_UD_DEPTH(ud) = --depth;
1086 if ((pad = SU_UD_PAD(ud)) > 0) {
1090 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
1091 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1092 SU_SAVE_PLACEHOLDER();
1097 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
1098 ud, depth, PL_scopestack_ix, PL_savestack_ix));
1099 SAVEDESTRUCTOR_X(su_pop, ud);
1101 switch (SU_UD_TYPE(ud)) {
1102 case SU_UD_TYPE_REAP: {
1103 SU_D(su_debug_log("%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));
1105 SAVEDESTRUCTOR_X(su_call, SU_UD_REAP_CB(ud));
1109 case SU_UD_TYPE_LOCALIZE:
1111 SU_UD_LOCALIZE_FREE(ud);
1113 case SU_UD_TYPE_UID:
1114 SAVEDESTRUCTOR_X(su_uid_drop, ud);
1119 SU_D(su_debug_log("%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
1120 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
1123 /* --- Initialize the stack and the action userdata ------------------------ */
1125 static I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
1126 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
1127 I32 i, depth, offset, base, *origin;
1130 SU_D(su_debug_log("%p: ### init for cx %d\n", ud, cxix));
1132 /* su_pop() is going to be called from leave_scope(), so before pushing the
1133 * next callback, we'll want to flush the current scope stack slice first.
1134 * However, if we want the next callback not to be processed immediately by
1135 * the current leave_scope(), we'll need to hide it by artificially
1136 * incrementing the scope stack marker before. For the intermediate bumps,
1137 * we will only need a bump of SU_SAVE_DESTRUCTOR_SIZE items, but for the
1138 * last one we will need a bump of size items. However, in order to preserve
1139 * the natural ordering between scope stack markers, we cannot bump lower
1140 * markers more than higher ones. This is why we bump the intermediate markers
1141 * by the smallest multiple of SU_SAVE_PLACEHOLDER_SIZE greater or equal to
1142 * max(SU_SAVE_DESTRUCTOR_SIZE, size). */
1144 if (size <= SU_SAVE_DESTRUCTOR_SIZE) {
1147 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
1148 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
1149 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
1152 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
1153 SU_D(su_debug_log("%p: size=%d pad=%d offset=%d\n", ud, size, pad, offset));
1155 depth = PL_scopestack_ix - cxstack[cxix].blk_oldscopesp;
1156 SU_D(su_debug_log("%p: going down to depth %d\n", ud, depth));
1158 /* We need to bump all the intermediary stack markers just in case an
1159 * exception is thrown before the target scope is reached. Indeed, in this
1160 * case there might be arbitrary many scope frames flushed at the same time,
1161 * and since we cannot know in advance whether this will happen or not, we
1162 * have to make sure the final frame is protected for the actual action. But
1163 * of course, in order to do that, we also need to bump all the previous stack
1164 * markers. If not for this, it should have been possible to just bump the two
1165 * next frames in su_pop(). */
1167 Newx(origin, depth + 1, I32);
1168 base = PL_scopestack_ix - depth;
1169 origin[0] = PL_scopestack[base];
1170 PL_scopestack[base] += size;
1171 for (i = 1; i < depth; ++i) {
1173 /* origin[depth - i] == PL_scopestack[PL_scopestack_ix - i] */
1174 origin[i] = PL_scopestack[j];
1175 PL_scopestack[j] += offset;
1177 origin[depth] = PL_savestack_ix;
1179 SU_UD_PAD(ud) = pad;
1180 SU_UD_DEPTH(ud) = depth;
1181 SU_UD_ORIGIN(ud) = origin;
1183 /* Make sure the first destructor fires by pushing enough fake slots on the
1185 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1186 <= PL_scopestack[PL_scopestack_ix - 1]) {
1189 SU_D(su_debug_log("%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1190 ud, PL_scopestack_ix, PL_savestack_ix));
1191 SU_SAVE_PLACEHOLDER();
1192 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1193 <= PL_scopestack[PL_scopestack_ix - 1]);
1195 SU_D(su_debug_log("%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1196 ud, PL_scopestack_ix, PL_savestack_ix));
1197 SAVEDESTRUCTOR_X(su_pop, ud);
1200 for (i = 0; i <= depth; ++i) {
1201 I32 j = PL_scopestack_ix - i;
1202 su_debug_log("%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1203 ud, i, j, origin[depth - i],
1204 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1211 /* --- Unwind stack -------------------------------------------------------- */
1213 static void su_unwind(pTHX_ void *ud_) {
1215 I32 cxix = MY_CXT.unwind_storage.cxix;
1216 I32 items = MY_CXT.unwind_storage.items;
1219 PERL_UNUSED_VAR(ud_);
1221 PL_stack_sp = MY_CXT.unwind_storage.savesp;
1222 #if SU_HAS_PERL(5, 19, 4)
1225 SV **sp = PL_stack_sp;
1226 for (i = -items + 1; i <= 0; ++i)
1228 sv_2mortal(SvREFCNT_inc(sp[i]));
1232 if (cxstack_ix > cxix)
1235 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1236 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1239 I32 gimme = GIMME_V;
1240 su_debug_log("%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1242 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1243 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1246 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1247 PL_op = PL_op->op_ppaddr(aTHX);
1249 *PL_markstack_ptr = mark;
1251 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1252 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1255 /* --- Yield --------------------------------------------------------------- */
1257 #if SU_HAS_PERL(5, 10, 0)
1258 # define SU_RETOP_SUB(C) ((C)->blk_sub.retop)
1259 # define SU_RETOP_EVAL(C) ((C)->blk_eval.retop)
1260 # define SU_RETOP_LOOP(C) ((C)->blk_loop.my_op->op_lastop->op_next)
1261 # define SU_RETOP_GIVEN(C) ((C)->blk_givwhen.leave_op->op_next)
1263 # define SU_RETOP_SUB(C) ((C)->blk_oldretsp > 0 ? PL_retstack[(C)->blk_oldretsp - 1] : NULL)
1264 # define SU_RETOP_EVAL(C) SU_RETOP_SUB(C)
1265 # define SU_RETOP_LOOP(C) ((C)->blk_loop.last_op->op_next)
1268 static void su_yield(pTHX_ void *ud_) {
1271 const char *which = ud_;
1272 I32 cxix = MY_CXT.yield_storage.cxix;
1273 I32 items = MY_CXT.yield_storage.items;
1274 opcode type = OP_NULL;
1278 PERL_UNUSED_VAR(ud_);
1280 cx = cxstack + cxix;
1281 switch (CxTYPE(cx)) {
1283 I32 i, cur = cxstack_ix, n = 1;
1285 /* Is this actually a given/when block? This may occur only when yield was
1286 * called with HERE (or nothing) as the context. */
1287 #if SU_HAS_PERL(5, 10, 0)
1289 PERL_CONTEXT *prev = cx - 1;
1290 U8 prev_type = CxTYPE(prev);
1291 if ((prev_type == CXt_GIVEN || prev_type == CXt_WHEN)
1292 && (prev->blk_oldcop == cx->blk_oldcop)) {
1295 if (prev_type == CXt_GIVEN)
1304 /* Bare blocks (that appear as do { ... } blocks, map { ... } blocks or
1305 * constant folded blcoks) don't need to save the op to return to anywhere
1306 * since 'last' isn't supposed to work inside them. So we climb higher in
1307 * the context stack until we reach a context that has a return op (i.e. a
1308 * sub, an eval, a format or a real loop), recording how many blocks we
1309 * crossed. Then we follow the op_next chain until we get to the leave op
1310 * that closes the original block, which we are assured to reach since
1311 * everything is static (the blocks we have crossed cannot be evals or
1312 * subroutine calls). */
1313 for (i = cxix + 1; i <= cur; ++i) {
1314 PERL_CONTEXT *cx2 = cxstack + i;
1315 switch (CxTYPE(cx2)) {
1321 o = SU_RETOP_SUB(cx2);
1324 o = SU_RETOP_EVAL(cx2);
1326 #if SU_HAS_PERL(5, 11, 0)
1328 case CXt_LOOP_PLAIN:
1329 case CXt_LOOP_LAZYSV:
1330 case CXt_LOOP_LAZYIV:
1334 o = SU_RETOP_LOOP(cx2);
1343 /* We may find other enter/leave blocks on our way to the matching leave.
1344 * Make sure the depth is incremented/decremented appropriately. */
1345 if (o->op_type == OP_ENTER) {
1347 } else if (o->op_type == OP_LEAVE) {
1361 next = SU_RETOP_SUB(cx);
1364 type = CxTRYBLOCK(cx) ? OP_LEAVETRY : OP_LEAVEEVAL;
1365 next = SU_RETOP_EVAL(cx);
1367 #if SU_HAS_PERL(5, 11, 0)
1369 case CXt_LOOP_PLAIN:
1370 case CXt_LOOP_LAZYSV:
1371 case CXt_LOOP_LAZYIV:
1375 type = OP_LEAVELOOP;
1376 next = SU_RETOP_LOOP(cx);
1378 #if SU_HAS_PERL(5, 10, 0)
1381 type = OP_LEAVEGIVEN;
1382 next = SU_RETOP_GIVEN(cx);
1386 #if SU_HAS_PERL(5, 15, 1)
1387 type = OP_LEAVEWHEN;
1390 flags |= OPf_SPECIAL;
1396 croak("%s() can't target a substitution context", which);
1399 croak("%s() doesn't know how to leave a %s context",
1400 which, SU_CXNAME(cxstack + cxix));
1404 PL_stack_sp = MY_CXT.yield_storage.savesp;
1405 #if SU_HAS_PERL(5, 19, 4)
1408 SV **sp = PL_stack_sp;
1409 for (i = -items + 1; i <= 0; ++i)
1411 sv_2mortal(SvREFCNT_inc(sp[i]));
1415 if (cxstack_ix > cxix)
1418 /* Copy the arguments passed to yield() where the leave op expects to find
1421 Move(PL_stack_sp - items + 1, PL_stack_base + cx->blk_oldsp + 1, items, SV *);
1422 PL_stack_sp = PL_stack_base + cx->blk_oldsp + items;
1424 flags |= OP_GIMME_REVERSE(cx->blk_gimme);
1426 MY_CXT.yield_storage.leave_op.op_type = type;
1427 MY_CXT.yield_storage.leave_op.op_ppaddr = PL_ppaddr[type];
1428 MY_CXT.yield_storage.leave_op.op_flags = flags;
1429 MY_CXT.yield_storage.leave_op.op_next = next;
1431 PL_op = (OP *) &(MY_CXT.yield_storage.leave_op);
1432 PL_op = PL_op->op_ppaddr(aTHX);
1434 MY_CXT.yield_storage.proxy_op.op_next = PL_op;
1435 PL_op = &(MY_CXT.yield_storage.proxy_op);
1438 /* --- Uplevel ------------------------------------------------------------- */
1440 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1441 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1443 static su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1444 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1449 sud = MY_CXT.uplevel_storage.root;
1451 MY_CXT.uplevel_storage.root = sud->next;
1452 MY_CXT.uplevel_storage.count--;
1454 sud = su_uplevel_ud_new();
1457 sud->next = MY_CXT.uplevel_storage.top;
1458 MY_CXT.uplevel_storage.top = sud;
1460 depth = su_uid_depth(cxix);
1461 su_uid_storage_dup(&sud->tmp_uid_storage, &MY_CXT.uid_storage, depth);
1462 sud->old_uid_storage = MY_CXT.uid_storage;
1463 MY_CXT.uid_storage = sud->tmp_uid_storage;
1468 #if SU_HAS_PERL(5, 13, 7)
1470 static void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1471 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1474 sud->tmp_uid_storage = MY_CXT.uid_storage;
1475 MY_CXT.uid_storage = sud->old_uid_storage;
1479 map = sud->tmp_uid_storage.map;
1480 alloc = sud->tmp_uid_storage.alloc;
1481 for (i = 0; i < alloc; ++i)
1482 map[i].flags &= ~SU_UID_ACTIVE;
1484 MY_CXT.uplevel_storage.top = sud->next;
1486 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1487 su_uplevel_ud_delete(sud);
1489 sud->next = MY_CXT.uplevel_storage.root;
1490 MY_CXT.uplevel_storage.root = sud;
1491 MY_CXT.uplevel_storage.count++;
1497 static int su_uplevel_goto_static(const OP *o) {
1498 for (; o; o = OpSIBLING(o)) {
1499 /* goto ops are unops with kids. */
1500 if (!(o->op_flags & OPf_KIDS))
1503 switch (o->op_type) {
1506 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1511 if (su_uplevel_goto_static(((const UNOP *) o)->op_first))
1520 #if SU_UPLEVEL_HIJACKS_RUNOPS
1522 static int su_uplevel_goto_runops(pTHX) {
1523 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1529 if (op->op_type == OP_GOTO) {
1530 AV *argarray = NULL;
1533 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1534 const PERL_CONTEXT *cx = cxstack + cxix;
1536 switch (CxTYPE(cx)) {
1538 if (CxHASARGS(cx)) {
1539 argarray = cx->blk_sub.argarray;
1555 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1556 AV *args = GvAV(PL_defgv);
1557 I32 items = AvFILLp(args);
1559 av_extend(argarray, items);
1560 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1561 AvFILLp(argarray) = items;
1566 PL_op = op = op->op_ppaddr(aTHX);
1568 #if !SU_HAS_PERL(5, 13, 0)
1578 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1580 #define su_at_underscore(C) PadARRAY(PadlistARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1582 static void su_uplevel_restore(pTHX_ void *sus_) {
1583 su_uplevel_ud *sud = sus_;
1584 PERL_SI *cur = sud->old_curstackinfo;
1585 PERL_SI *si = sud->si;
1587 #if SU_UPLEVEL_HIJACKS_RUNOPS
1588 if (PL_runops == su_uplevel_goto_runops)
1589 PL_runops = sud->old_runops;
1592 if (sud->callback) {
1593 PERL_CONTEXT *cx = cxstack + sud->cxix;
1594 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1596 /* We have to fix the pad entry for @_ in the original callback because it
1597 * may have been reified. */
1598 if (AvREAL(argarray)) {
1599 const I32 fill = AvFILLp(argarray);
1600 SvREFCNT_dec(argarray);
1602 AvREAL_off(argarray);
1603 AvREIFY_on(argarray);
1604 av_extend(argarray, fill);
1605 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1607 CLEAR_ARGARRAY(argarray);
1610 /* If the old cv member is our renamed CV, it means that this place has been
1611 * reached without a goto() happening, and the old argarray member is
1612 * actually our fake argarray. Destroy it properly in that case. */
1613 if (cx->blk_sub.cv == sud->renamed) {
1614 SvREFCNT_dec(cx->blk_sub.argarray);
1615 cx->blk_sub.argarray = argarray;
1618 CvDEPTH(sud->callback)--;
1619 SvREFCNT_dec(sud->callback);
1622 /* Free the renamed CV. We must do it ourselves so that we can force the
1623 * depth to be 0, or perl would complain about it being "still in use".
1624 * But we *know* that it cannot be so. */
1626 if (!CvISXSUB(sud->renamed)) {
1627 CvDEPTH(sud->renamed) = 0;
1628 CvPADLIST(sud->renamed) = NULL;
1630 SvREFCNT_dec(sud->renamed);
1633 CATCH_SET(sud->old_catch);
1635 SU_UPLEVEL_RESTORE(op);
1637 /* stack_grow() wants PL_curstack so restore the old stack first */
1638 if (PL_curstackinfo == si) {
1639 PL_curstack = cur->si_stack;
1640 if (sud->old_mainstack)
1641 SU_UPLEVEL_RESTORE(mainstack);
1642 SU_UPLEVEL_RESTORE(curstackinfo);
1645 CV *target = sud->target;
1648 /* When we die, the depth of the target CV is not updated because of the
1649 * stack switcheroo. So we have to look at all the frames between the
1650 * uplevel call and the catch block to count how many call frames to the
1651 * target CV were skipped. */
1652 for (i = cur->si_cxix; i > sud->cxix; i--) {
1653 register const PERL_CONTEXT *cx = cxstack + i;
1655 if (CxTYPE(cx) == CXt_SUB) {
1656 if (cx->blk_sub.cv == target)
1661 /* If we died, the replacement stack was already unwinded to the first
1662 * eval frame, and all the contexts down there were popped. We don't have
1663 * to pop manually any context of the original stack, because they must
1664 * have been in the replacement stack as well (since the second was copied
1665 * from the first). Thus we only have to make sure the original stack index
1666 * points to the context just below the first eval scope under the target
1668 for (; i >= 0; i--) {
1669 register const PERL_CONTEXT *cx = cxstack + i;
1671 switch (CxTYPE(cx)) {
1673 if (cx->blk_sub.cv == target)
1685 CvDEPTH(target) = sud->target_depth - levels;
1686 PL_curstackinfo->si_cxix = i - 1;
1688 #if !SU_HAS_PERL(5, 13, 1)
1689 /* Since $@ was maybe localized between the target frame and the uplevel
1690 * call, we forcefully flush the save stack to get rid of it and then
1691 * reset $@ to its proper value. Note that the the call to
1692 * su_uplevel_restore() must happen before the "reset $@" item of the save
1693 * stack is processed, as uplevel was called after the localization.
1694 * Andrew's changes to how $@ was handled, which were mainly integrated
1695 * between perl 5.13.0 and 5.13.1, fixed this. */
1696 if (ERRSV && SvTRUE(ERRSV)) {
1697 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1698 SV *errsv = SvREFCNT_inc(ERRSV);
1699 PL_scopestack_ix = cx->blk_oldscopesp;
1700 leave_scope(PL_scopestack[PL_scopestack_ix]);
1701 sv_setsv(ERRSV, errsv);
1702 SvREFCNT_dec(errsv);
1708 SU_UPLEVEL_RESTORE(curcop);
1710 SvREFCNT_dec(sud->target);
1712 PL_stack_base = AvARRAY(cur->si_stack);
1713 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1714 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1716 /* When an exception is thrown from the uplevel'd subroutine,
1717 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1718 * die_where() in more recent perls), which has the sad habit of keeping a
1719 * pointer to the current context frame across this call. This means that we
1720 * can't free the temporary context stack we used for the uplevel call right
1721 * now, or that pointer upwards would point to garbage. */
1722 #if SU_HAS_PERL(5, 13, 7)
1723 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1724 * public in perl 5.13.7. */
1725 su_uplevel_storage_delete(sud);
1727 /* Otherwise, we just enqueue it back in the global storage list. */
1731 sud->tmp_uid_storage = MY_CXT.uid_storage;
1732 MY_CXT.uid_storage = sud->old_uid_storage;
1734 MY_CXT.uplevel_storage.top = sud->next;
1735 sud->next = MY_CXT.uplevel_storage.root;
1736 MY_CXT.uplevel_storage.root = sud;
1737 MY_CXT.uplevel_storage.count++;
1744 static CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1745 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1749 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1751 CvFLAGS(cv) = CvFLAGS(proto);
1753 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1755 CvDEPTH(cv) = CvDEPTH(proto);
1757 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1759 CvFILE(cv) = CvFILE(proto);
1763 #if SU_RELEASE && SU_HAS_PERL_EXACT(5, 21, 4)
1766 CvSTASH_set(cv, CvSTASH(proto));
1767 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1768 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1769 * (which was part of perl 5.13.7). */
1770 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1772 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1775 if (CvISXSUB(proto)) {
1776 CvXSUB(cv) = CvXSUB(proto);
1777 CvXSUBANY(cv) = CvXSUBANY(proto);
1780 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1782 CvSTART(cv) = CvSTART(proto);
1783 CvPADLIST(cv) = CvPADLIST(proto);
1785 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1786 #ifdef CVf_WEAKOUTSIDE
1787 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1789 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1790 #ifdef CvOUTSIDE_SEQ
1791 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1795 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1805 static I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1806 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1808 const PERL_CONTEXT *cx = cxstack + cxix;
1810 PERL_SI *cur = PL_curstackinfo;
1816 I32 old_mark, new_mark;
1823 /* Make PL_stack_sp point just before the CV. */
1824 PL_stack_sp -= args + 1;
1825 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1828 sud = su_uplevel_storage_new(cxix);
1832 sud->callback = NULL;
1833 sud->renamed = NULL;
1834 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1838 si->si_type = cur->si_type;
1840 si->si_prev = cur->si_prev;
1842 si->si_markoff = cx->blk_oldmarksp;
1845 /* Allocate enough space for all the elements of the original stack up to the
1846 * target context, plus the forthcoming arguments. */
1847 new_mark = cx->blk_oldsp;
1848 av_extend(si->si_stack, new_mark + 1 + args + 1);
1849 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1850 AvFILLp(si->si_stack) = new_mark;
1851 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1853 /* Specialized SWITCHSTACK() */
1854 PL_stack_base = AvARRAY(si->si_stack);
1855 old_stack_sp = PL_stack_sp;
1856 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1857 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1860 /* Copy the context stack up to the context just below the target. */
1861 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1862 if (si->si_cxmax < cxix) {
1863 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1864 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1865 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1867 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1868 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1870 target = cx->blk_sub.cv;
1871 sud->target = (CV *) SvREFCNT_inc(target);
1872 sud->target_depth = CvDEPTH(target);
1874 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1875 * run-time implication, since PL_curcop will be overwritten as soon as we
1876 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1877 * make it point to the blk_oldcop for the target frame, so that caller()
1878 * reports the right file name, line number and lexical hints. */
1879 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1880 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1881 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1883 SU_UPLEVEL_SAVE(curstackinfo, si);
1884 /* If those two are equal, we need to fool POPSTACK_TO() */
1885 if (PL_mainstack == PL_curstack)
1886 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1888 sud->old_mainstack = NULL;
1889 PL_curstack = si->si_stack;
1891 renamed = su_cv_clone(callback, CvGV(target));
1892 sud->renamed = renamed;
1895 /* Both SP and old_stack_sp point just before the CV. */
1896 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1898 PUSHs((SV *) renamed);
1901 Zero(&sub_op, 1, UNOP);
1902 sub_op.op_type = OP_ENTERSUB;
1903 sub_op.op_next = NULL;
1904 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1906 sub_op.op_flags |= OPpENTERSUB_DB;
1908 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1910 #if SU_UPLEVEL_HIJACKS_RUNOPS
1911 sud->old_runops = PL_runops;
1914 sud->old_catch = CATCH_GET;
1917 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1918 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1920 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1923 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1924 CvDEPTH(callback)++;
1926 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1927 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1928 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1929 * with what we put on the stack. But we want to fake up the same arguments
1930 * as the ones in use at the context we uplevel to, so we replace the
1931 * argarray with an unreal copy of the original @_. */
1935 av_extend(av, AvMAX(cx->blk_sub.argarray));
1936 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1937 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1938 sub_cx->blk_sub.argarray = av;
1940 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1943 if (su_uplevel_goto_static(CvROOT(renamed))) {
1944 #if SU_UPLEVEL_HIJACKS_RUNOPS
1945 if (PL_runops != PL_runops_std) {
1946 if (PL_runops == PL_runops_dbg) {
1948 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1949 } else if (PL_runops != su_uplevel_goto_runops)
1950 croak("uplevel() can't execute code that calls goto with a custom runloop");
1953 PL_runops = su_uplevel_goto_runops;
1954 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1955 croak("uplevel() can't execute code that calls goto before perl 5.8");
1956 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1964 ret = PL_stack_sp - (PL_stack_base + new_mark);
1966 AV *old_stack = sud->old_curstackinfo->si_stack;
1968 if (old_mark + ret > AvMAX(old_stack)) {
1969 /* Specialized EXTEND(old_sp, ret) */
1970 av_extend(old_stack, old_mark + ret + 1);
1971 old_stack_sp = AvARRAY(old_stack) + old_mark;
1974 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1976 AvFILLp(old_stack) += ret;
1984 /* --- Unique context ID --------------------------------------------------- */
1986 static su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1987 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1992 map = MY_CXT.uid_storage.map;
1993 alloc = MY_CXT.uid_storage.alloc;
1995 if (depth >= alloc) {
1998 Renew(map, depth + 1, su_uid);
1999 for (i = alloc; i <= depth; ++i) {
2004 MY_CXT.uid_storage.map = map;
2005 MY_CXT.uid_storage.alloc = depth + 1;
2008 if (depth >= MY_CXT.uid_storage.used)
2009 MY_CXT.uid_storage.used = depth + 1;
2014 static int su_uid_storage_check(pTHX_ UV depth, UV seq) {
2015 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
2019 if (depth >= MY_CXT.uid_storage.used)
2022 uid = MY_CXT.uid_storage.map + depth;
2024 return (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
2027 static SV *su_uid_get(pTHX_ I32 cxix) {
2028 #define su_uid_get(I) su_uid_get(aTHX_ (I))
2033 depth = su_uid_depth(cxix);
2034 uid = su_uid_storage_fetch(depth);
2036 if (!(uid->flags & SU_UID_ACTIVE)) {
2039 uid->seq = su_uid_seq_next(depth);
2040 uid->flags |= SU_UID_ACTIVE;
2042 Newx(ud, 1, su_ud_uid);
2043 SU_UD_TYPE(ud) = SU_UD_TYPE_UID;
2045 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2048 uid_sv = sv_newmortal();
2049 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
2056 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
2058 #else /* grok_number */
2060 #define IS_NUMBER_IN_UV 0x1
2062 static int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
2063 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
2067 /* This crude check should be good enough for a fallback implementation.
2068 * Better be too strict than too lax. */
2069 for (i = 0; i < len; ++i) {
2074 tmpsv = sv_newmortal();
2075 sv_setpvn(tmpsv, s, len);
2076 *valuep = sv_2uv(tmpsv);
2078 return IS_NUMBER_IN_UV;
2081 #endif /* !grok_number */
2083 static int su_uid_validate(pTHX_ SV *uid) {
2084 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
2090 s = SvPV_const(uid, len);
2092 while (p < len && s[p] != '-')
2095 croak("UID contains only one part");
2097 type = su_grok_number(s, p, &depth);
2098 if (type != IS_NUMBER_IN_UV)
2099 croak("First UID part is not an unsigned integer");
2101 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
2103 type = su_grok_number(s + p, len - p, &seq);
2104 if (type != IS_NUMBER_IN_UV)
2105 croak("Second UID part is not an unsigned integer");
2107 return su_uid_storage_check(depth, seq);
2110 /* --- Context operations -------------------------------------------------- */
2112 /* Remove sequences of BLOCKs having DB for stash, followed by a SUB context
2113 * for the debugger callback. */
2115 static I32 su_context_skip_db(pTHX_ I32 cxix) {
2116 #define su_context_skip_db(C) su_context_skip_db(aTHX_ (C))
2122 for (i = cxix; i > 0; --i) {
2123 PERL_CONTEXT *cx = cxstack + i;
2125 switch (CxTYPE(cx)) {
2126 #if SU_HAS_PERL(5, 17, 1)
2127 case CXt_LOOP_PLAIN:
2130 if (cx->blk_oldcop && CopSTASH(cx->blk_oldcop) == GvSTASH(PL_DBgv))
2134 if (cx->blk_sub.cv == GvCV(PL_DBsub)) {
2150 static I32 su_context_normalize_up(pTHX_ I32 cxix) {
2151 #define su_context_normalize_up(C) su_context_normalize_up(aTHX_ (C))
2157 cx = cxstack + cxix;
2158 if (CxTYPE(cx) == CXt_BLOCK) {
2159 PERL_CONTEXT *prev = cx - 1;
2161 switch (CxTYPE(prev)) {
2162 #if SU_HAS_PERL(5, 10, 0)
2166 #if SU_HAS_PERL(5, 11, 0)
2167 /* That's the only subcategory that can cause an extra BLOCK context */
2168 case CXt_LOOP_PLAIN:
2172 if (cx->blk_oldcop == prev->blk_oldcop)
2176 if (cx->blk_oldcop && OpSIBLING(cx->blk_oldcop)
2177 && OpSIBLING(cx->blk_oldcop)->op_type == OP_SUBST)
2186 static I32 su_context_normalize_down(pTHX_ I32 cxix) {
2187 #define su_context_normalize_down(C) su_context_normalize_down(aTHX_ (C))
2190 if (cxix >= cxstack_ix)
2193 next = cxstack + cxix + 1;
2194 if (CxTYPE(next) == CXt_BLOCK) {
2195 PERL_CONTEXT *cx = next - 1;
2197 switch (CxTYPE(cx)) {
2198 #if SU_HAS_PERL(5, 10, 0)
2202 #if SU_HAS_PERL(5, 11, 0)
2203 /* That's the only subcategory that can cause an extra BLOCK context */
2204 case CXt_LOOP_PLAIN:
2208 if (cx->blk_oldcop == next->blk_oldcop)
2212 if (next->blk_oldcop && OpSIBLING(next->blk_oldcop)
2213 && OpSIBLING(next->blk_oldcop)->op_type == OP_SUBST)
2222 #define su_context_here() su_context_normalize_up(su_context_skip_db(cxstack_ix))
2224 static I32 su_context_gimme(pTHX_ I32 cxix) {
2225 #define su_context_gimme(C) su_context_gimme(aTHX_ (C))
2228 for (i = cxix; i >= 0; --i) {
2229 PERL_CONTEXT *cx = cxstack + i;
2231 switch (CxTYPE(cx)) {
2232 /* gimme is always G_ARRAY for loop contexts. */
2233 #if SU_HAS_PERL(5, 11, 0)
2235 case CXt_LOOP_PLAIN:
2236 case CXt_LOOP_LAZYSV:
2237 case CXt_LOOP_LAZYIV:
2242 const COP *cop = cx->blk_oldcop;
2243 if (cop && OpSIBLING(cop)) {
2244 switch (OpSIBLING(cop)->op_flags & OPf_WANT) {
2247 case OPf_WANT_SCALAR:
2266 /* --- Global setup/teardown ----------------------------------------------- */
2268 static VOL U32 su_initialized = 0;
2270 static void su_global_teardown(pTHX_ void *root) {
2271 if (!su_initialized)
2279 SU_LOCK(&su_uid_seq_counter_mutex);
2280 PerlMemShared_free(su_uid_seq_counter.seqs);
2281 su_uid_seq_counter.size = 0;
2282 SU_UNLOCK(&su_uid_seq_counter_mutex);
2284 MUTEX_DESTROY(&su_uid_seq_counter_mutex);
2291 XS(XS_Scope__Upper_unwind);
2292 XS(XS_Scope__Upper_yield);
2293 XS(XS_Scope__Upper_leave);
2295 #if SU_HAS_PERL(5, 9, 0)
2296 # define SU_XS_FILE_TYPE const char
2298 # define SU_XS_FILE_TYPE char
2301 static void su_global_setup(pTHX_ SU_XS_FILE_TYPE *file) {
2302 #define su_global_setup(F) su_global_setup(aTHX_ (F))
2308 MUTEX_INIT(&su_uid_seq_counter_mutex);
2310 SU_LOCK(&su_uid_seq_counter_mutex);
2311 su_uid_seq_counter.seqs = NULL;
2312 su_uid_seq_counter.size = 0;
2313 SU_UNLOCK(&su_uid_seq_counter_mutex);
2315 stash = gv_stashpv(__PACKAGE__, 1);
2316 newCONSTSUB(stash, "TOP", newSViv(0));
2317 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
2319 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
2320 newXSproto("Scope::Upper::yield", XS_Scope__Upper_yield, file, NULL);
2321 newXSproto("Scope::Upper::leave", XS_Scope__Upper_leave, file, NULL);
2324 call_atexit(su_global_teardown, aTHX);
2326 call_atexit(su_global_teardown, NULL);
2334 /* --- Interpreter setup/teardown ------------------------------------------ */
2336 static void su_local_teardown(pTHX_ void *param) {
2340 Safefree(MY_CXT.uid_storage.map);
2342 cur = MY_CXT.uplevel_storage.root;
2344 su_uplevel_ud *prev;
2348 su_uplevel_ud_delete(prev);
2355 static void su_local_setup(pTHX) {
2356 #define su_local_setup() su_local_setup(aTHX)
2359 MY_CXT.stack_placeholder = NULL;
2361 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
2362 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
2363 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
2364 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
2366 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
2367 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
2368 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
2370 Zero(&(MY_CXT.yield_storage.leave_op), 1, UNOP);
2371 MY_CXT.yield_storage.leave_op.op_type = OP_STUB;
2372 MY_CXT.yield_storage.leave_op.op_ppaddr = NULL;
2374 Zero(&(MY_CXT.yield_storage.proxy_op), 1, OP);
2375 MY_CXT.yield_storage.proxy_op.op_type = OP_STUB;
2376 MY_CXT.yield_storage.proxy_op.op_ppaddr = NULL;
2378 MY_CXT.uplevel_storage.top = NULL;
2379 MY_CXT.uplevel_storage.root = NULL;
2380 MY_CXT.uplevel_storage.count = 0;
2382 MY_CXT.uid_storage.map = NULL;
2383 MY_CXT.uid_storage.used = 0;
2384 MY_CXT.uid_storage.alloc = 0;
2386 call_atexit(su_local_teardown, NULL);
2391 /* --- XS ------------------------------------------------------------------ */
2393 #define SU_GET_CONTEXT(A, B, D) \
2402 else if (cxix > cxstack_ix) \
2410 #define SU_GET_LEVEL(A, B) \
2416 level = SvIV(lsv); \
2423 #if SU_HAS_PERL(5, 10, 0)
2424 # define SU_INFO_COUNT 11
2426 # define SU_INFO_COUNT 10
2429 XS(XS_Scope__Upper_unwind) {
2438 PERL_UNUSED_VAR(cv); /* -W */
2439 PERL_UNUSED_VAR(ax); /* -Wall */
2441 SU_GET_CONTEXT(0, items - 1, cxstack_ix);
2443 PERL_CONTEXT *cx = cxstack + cxix;
2444 switch (CxTYPE(cx)) {
2446 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2450 MY_CXT.unwind_storage.cxix = cxix;
2451 MY_CXT.unwind_storage.items = items;
2452 MY_CXT.unwind_storage.savesp = PL_stack_sp;
2454 MY_CXT.unwind_storage.items--;
2455 MY_CXT.unwind_storage.savesp--;
2457 /* pp_entersub will want to sanitize the stack after returning from there
2458 * Screw that, we're insane!
2459 * dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
2460 if (GIMME_V == G_SCALAR)
2461 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2462 SAVEDESTRUCTOR_X(su_unwind, NULL);
2467 } while (--cxix >= 0);
2468 croak("Can't return outside a subroutine");
2471 static const char su_yield_name[] = "yield";
2473 XS(XS_Scope__Upper_yield) {
2482 PERL_UNUSED_VAR(cv); /* -W */
2483 PERL_UNUSED_VAR(ax); /* -Wall */
2485 SU_GET_CONTEXT(0, items - 1, su_context_here());
2486 MY_CXT.yield_storage.cxix = cxix;
2487 MY_CXT.yield_storage.items = items;
2488 MY_CXT.yield_storage.savesp = PL_stack_sp;
2490 MY_CXT.yield_storage.items--;
2491 MY_CXT.yield_storage.savesp--;
2493 /* See XS_Scope__Upper_unwind */
2494 if (GIMME_V == G_SCALAR)
2495 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2496 SAVEDESTRUCTOR_X(su_yield, su_yield_name);
2500 static const char su_leave_name[] = "leave";
2502 XS(XS_Scope__Upper_leave) {
2510 PERL_UNUSED_VAR(cv); /* -W */
2511 PERL_UNUSED_VAR(ax); /* -Wall */
2513 MY_CXT.yield_storage.cxix = su_context_here();
2514 MY_CXT.yield_storage.items = items;
2515 MY_CXT.yield_storage.savesp = PL_stack_sp;
2516 /* See XS_Scope__Upper_unwind */
2517 if (GIMME_V == G_SCALAR)
2518 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2519 SAVEDESTRUCTOR_X(su_yield, su_leave_name);
2523 MODULE = Scope::Upper PACKAGE = Scope::Upper
2529 su_global_setup(file);
2539 su_uid_storage new_cxt;
2546 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
2550 MY_CXT.uplevel_storage.top = NULL;
2551 MY_CXT.uplevel_storage.root = NULL;
2552 MY_CXT.uplevel_storage.count = 0;
2553 MY_CXT.uid_storage = new_cxt;
2557 #endif /* SU_THREADSAFE */
2565 cxix = su_context_here();
2576 SU_GET_CONTEXT(0, 0, su_context_here());
2579 cxix = su_context_skip_db(cxix);
2580 cxix = su_context_normalize_up(cxix);
2582 warn(su_stack_smash);
2594 SU_GET_CONTEXT(0, 0, cxstack_ix);
2596 for (; cxix >= 0; --cxix) {
2597 PERL_CONTEXT *cx = cxstack + cxix;
2598 switch (CxTYPE(cx)) {
2602 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2608 warn(su_no_such_target, "subroutine");
2617 SU_GET_CONTEXT(0, 0, cxstack_ix);
2619 for (; cxix >= 0; --cxix) {
2620 PERL_CONTEXT *cx = cxstack + cxix;
2621 switch (CxTYPE(cx)) {
2629 warn(su_no_such_target, "eval");
2639 cxix = su_context_here();
2640 while (--level >= 0) {
2642 warn(su_stack_smash);
2646 cxix = su_context_skip_db(cxix);
2647 cxix = su_context_normalize_up(cxix);
2660 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2661 PERL_CONTEXT *cx = cxstack + cxix;
2662 switch (CxTYPE(cx)) {
2664 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2675 warn(su_stack_smash);
2686 SU_GET_CONTEXT(0, 0, cxstack_ix);
2689 PERL_CONTEXT *cx = cxstack + cxix--;
2690 switch (CxTYPE(cx)) {
2692 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2696 I32 gimme = cx->blk_gimme;
2698 case G_VOID: XSRETURN_UNDEF; break;
2699 case G_SCALAR: XSRETURN_NO; break;
2700 case G_ARRAY: XSRETURN_YES; break;
2713 const PERL_CONTEXT *cx, *dbcx;
2716 SU_GET_CONTEXT(0, 0, su_context_skip_db(cxstack_ix));
2717 cxix = su_context_normalize_up(cxix);
2718 cx = cxstack + cxix;
2720 if (PL_DBsub && cxix && (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT)) {
2721 I32 i = su_context_skip_db(cxix - 1) + 1;
2722 if (i < cxix && CxTYPE(cxstack + i) == CXt_SUB)
2725 cop = cx->blk_oldcop;
2726 EXTEND(SP, SU_INFO_COUNT);
2729 HV *stash = CopSTASH(cop);
2731 PUSHs(su_newmortal_pvn(HvNAME(stash), HvNAMELEN(stash)));
2733 PUSHs(&PL_sv_undef);
2736 PUSHs(su_newmortal_pvn(OutCopFILE(cop), OutCopFILE_len(cop)));
2738 mPUSHi(CopLINE(cop));
2739 /* subroutine (3) and has_args (4) */
2740 switch (CxTYPE(cx)) {
2743 GV *cvgv = CvGV(dbcx->blk_sub.cv);
2744 if (cvgv && isGV(cvgv)) {
2745 SV *sv = sv_newmortal();
2746 gv_efullname3(sv, cvgv, NULL);
2749 PUSHs(su_newmortal_pvs("(unknown)"));
2758 PUSHs(su_newmortal_pvs("(eval)"));
2762 PUSHs(&PL_sv_undef);
2763 PUSHs(&PL_sv_undef);
2766 switch (su_context_gimme(cxix)) {
2773 default: /* G_VOID */
2774 PUSHs(&PL_sv_undef);
2777 /* eval text (6) and is_require (7) */
2778 switch (CxTYPE(cx)) {
2780 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
2782 #if SU_HAS_PERL(5, 17, 4)
2783 PUSHs(newSVpvn_flags(SvPVX(cx->blk_eval.cur_text),
2784 SvCUR(cx->blk_eval.cur_text)-2,
2785 SvUTF8(cx->blk_eval.cur_text)|SVs_TEMP));
2787 PUSHs(cx->blk_eval.cur_text);
2791 } else if (cx->blk_eval.old_namesv) {
2793 PUSHs(sv_mortalcopy(cx->blk_eval.old_namesv));
2799 /* Anything else including eval BLOCK */
2800 PUSHs(&PL_sv_undef);
2801 PUSHs(&PL_sv_undef);
2805 mPUSHi(CopHINTS_get(cop));
2809 #if SU_HAS_PERL(5, 9, 4)
2810 STRLEN *old_warnings = cop->cop_warnings;
2812 SV *old_warnings = cop->cop_warnings;
2814 if (old_warnings == pWARN_STD) {
2815 if (PL_dowarn & G_WARN_ON)
2816 goto context_info_warnings_on;
2818 #if SU_HAS_PERL(5, 17, 4)
2819 mask = &PL_sv_undef;
2821 goto context_info_warnings_off;
2823 } else if (old_warnings == pWARN_NONE) {
2824 #if !SU_HAS_PERL(5, 17, 4)
2825 context_info_warnings_off:
2827 mask = su_newmortal_pvn(WARN_NONEstring, WARNsize);
2828 } else if (old_warnings == pWARN_ALL) {
2830 context_info_warnings_on:
2831 #if SU_HAS_PERL(5, 8, 7)
2832 bits = get_hv("warnings::Bits", 0);
2834 SV **bits_all = hv_fetchs(bits, "all", FALSE);
2836 mask = sv_mortalcopy(*bits_all);
2840 mask = su_newmortal_pvn(WARN_ALLstring, WARNsize);
2842 #if SU_HAS_PERL(5, 9, 4)
2843 mask = su_newmortal_pvn((char *) (old_warnings + 1), old_warnings[0]);
2845 mask = sv_mortalcopy(old_warnings);
2850 #if SU_HAS_PERL(5, 10, 0)
2851 /* hints hash (10) */
2853 COPHH *hints_hash = CopHINTHASH_get(cop);
2855 SV *rhv = sv_2mortal(newRV_noinc((SV *) cophh_2hv(hints_hash, 0)));
2858 PUSHs(&PL_sv_undef);
2862 XSRETURN(SU_INFO_COUNT);
2871 SU_GET_CONTEXT(1, 1, su_context_skip_db(cxstack_ix));
2872 cxix = su_context_normalize_down(cxix);
2873 Newx(ud, 1, su_ud_reap);
2874 SU_UD_TYPE(ud) = SU_UD_TYPE_REAP;
2875 ud->cb = (SvROK(hook) && SvTYPE(SvRV(hook)) >= SVt_PVCV)
2876 ? SvRV(hook) : hook;
2877 SvREFCNT_inc_simple_void(ud->cb);
2878 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2881 localize(SV *sv, SV *val, ...)
2888 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2889 cxix = su_context_normalize_down(cxix);
2890 Newx(ud, 1, su_ud_localize);
2891 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2892 size = su_ud_localize_init(ud, sv, val, NULL);
2893 su_init(ud, cxix, size);
2896 localize_elem(SV *sv, SV *elem, SV *val, ...)
2903 if (SvTYPE(sv) >= SVt_PVGV)
2904 croak("Can't infer the element localization type from a glob and the value");
2905 SU_GET_CONTEXT(3, 3, su_context_skip_db(cxstack_ix));
2906 cxix = su_context_normalize_down(cxix);
2907 Newx(ud, 1, su_ud_localize);
2908 /* Initialize SU_UD_ORIGIN(ud) in case SU_UD_LOCALIZE_FREE(ud) needs it */
2909 SU_UD_ORIGIN(ud) = NULL;
2910 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2911 size = su_ud_localize_init(ud, sv, val, elem);
2912 if (SU_UD_PRIVATE(ud) != SVt_PVAV && SU_UD_PRIVATE(ud) != SVt_PVHV) {
2913 SU_UD_LOCALIZE_FREE(ud);
2914 croak("Can't localize an element of something that isn't an array or a hash");
2916 su_init(ud, cxix, size);
2919 localize_delete(SV *sv, SV *elem, ...)
2926 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2927 cxix = su_context_normalize_down(cxix);
2928 Newx(ud, 1, su_ud_localize);
2929 SU_UD_TYPE(ud) = SU_UD_TYPE_LOCALIZE;
2930 size = su_ud_localize_init(ud, sv, NULL, elem);
2931 su_init(ud, cxix, size);
2934 uplevel(SV *code, ...)
2937 I32 cxix, ret, args = 0;
2941 if (SvTYPE(code) < SVt_PVCV)
2942 croak("First argument to uplevel must be a code reference");
2943 SU_GET_CONTEXT(1, items - 1, cxstack_ix);
2945 PERL_CONTEXT *cx = cxstack + cxix;
2946 switch (CxTYPE(cx)) {
2948 croak("Can't uplevel to an eval frame");
2950 croak("Can't uplevel to a format frame");
2952 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2958 /* su_uplevel() takes care of extending the stack if needed. */
2959 ret = su_uplevel((CV *) code, cxix, args);
2964 } while (--cxix >= 0);
2965 croak("Can't uplevel outside a subroutine");
2974 SU_GET_CONTEXT(0, 0, su_context_here());
2975 uid = su_uid_get(cxix);
2981 validate_uid(SV *uid)
2986 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;