1 /* This file is part of the Scope::Upper Perl module.
2 * See http://search.cpan.org/dist/Scope-Upper/ */
4 #define PERL_NO_GET_CONTEXT
9 #define __PACKAGE__ "Scope::Upper"
15 /* --- Compatibility ------------------------------------------------------- */
30 # define MUTABLE_SV(S) ((SV *) (S))
34 # define MUTABLE_AV(A) ((AV *) (A))
38 # define MUTABLE_CV(C) ((CV *) (C))
41 #ifndef PERL_UNUSED_VAR
42 # define PERL_UNUSED_VAR(V)
46 # define STMT_START do
50 # define STMT_END while (0)
54 # define SU_D(X) STMT_START X STMT_END
60 # define Newx(v, n, c) New(0, v, n, c)
65 # define SU_POISON(D, N, T) PoisonNew((D), (N), T)
66 # elif defined(Poison)
67 # define SU_POISON(D, N, T) Poison((D), (N), T)
71 # define SU_POISON(D, N, T) NOOP
75 STATIC SV *su_newSV_type(pTHX_ svtype t) {
80 # define newSV_type(T) su_newSV_type(aTHX_ (T))
84 # define SvPV_const(S, L) SvPV(S, L)
88 # define SvPVX_const(S) SvPVX(S)
91 #ifndef SvPV_nolen_const
92 # define SvPV_nolen_const(S) SvPV_nolen(S)
95 #ifndef SvREFCNT_inc_simple_void
96 # define SvREFCNT_inc_simple_void(sv) ((void) SvREFCNT_inc(sv))
100 # define mPUSHi(I) PUSHs(sv_2mortal(newSViv(I)))
104 # define GvCV_set(G, C) (GvCV(G) = (C))
108 # define CvGV_set(C, G) (CvGV(C) = (G))
112 # define CvSTASH_set(C, S) (CvSTASH(C) = (S))
116 # define CvISXSUB(C) CvXSUB(C)
120 # define PadlistARRAY(P) AvARRAY(P)
121 # define PadARRAY(P) AvARRAY(P)
125 # define CxHASARGS(C) ((C)->blk_sub.hasargs)
129 # define HvNAME_get(H) HvNAME(H)
132 #ifndef gv_fetchpvn_flags
133 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
136 #ifndef OP_GIMME_REVERSE
137 STATIC U8 su_op_gimme_reverse(U8 gimme) {
140 return OPf_WANT_VOID;
142 return OPf_WANT_LIST;
147 return OPf_WANT_SCALAR;
149 #define OP_GIMME_REVERSE(G) su_op_gimme_reverse(G)
152 #ifndef PERL_MAGIC_tied
153 # define PERL_MAGIC_tied 'P'
156 #ifndef PERL_MAGIC_env
157 # define PERL_MAGIC_env 'E'
160 #ifndef NEGATIVE_INDICES_VAR
161 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
164 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
165 #define SU_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
167 /* --- Threads and multiplicity -------------------------------------------- */
169 #ifndef SU_MULTIPLICITY
170 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
171 # define SU_MULTIPLICITY 1
173 # define SU_MULTIPLICITY 0
176 #if SU_MULTIPLICITY && !defined(tTHX)
177 # define tTHX PerlInterpreter*
180 #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))
181 # define SU_THREADSAFE 1
182 # ifndef MY_CXT_CLONE
183 # define MY_CXT_CLONE \
185 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
186 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
187 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
190 # define SU_THREADSAFE 0
192 # define dMY_CXT dNOOP
194 # define MY_CXT su_globaldata
196 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
198 # define MY_CXT_INIT NOOP
200 # define MY_CXT_CLONE NOOP
203 /* --- Unique context ID global storage ------------------------------------ */
205 /* ... Sequence ID counter ................................................. */
212 STATIC su_uv_array su_uid_seq_counter;
216 STATIC perl_mutex su_uid_seq_counter_mutex;
218 #define SU_LOCK(M) MUTEX_LOCK(M)
219 #define SU_UNLOCK(M) MUTEX_UNLOCK(M)
221 #else /* USE_ITHREADS */
226 #endif /* !USE_ITHREADS */
228 STATIC UV su_uid_seq_next(pTHX_ UV depth) {
229 #define su_uid_seq_next(D) su_uid_seq_next(aTHX_ (D))
233 SU_LOCK(&su_uid_seq_counter_mutex);
235 seqs = su_uid_seq_counter.seqs;
237 if (depth >= su_uid_seq_counter.size) {
240 seqs = PerlMemShared_realloc(seqs, (depth + 1) * sizeof(UV));
241 for (i = su_uid_seq_counter.size; i <= depth; ++i)
244 su_uid_seq_counter.seqs = seqs;
245 su_uid_seq_counter.size = depth + 1;
250 SU_UNLOCK(&su_uid_seq_counter_mutex);
255 /* ... UID storage ......................................................... */
262 #define SU_UID_ACTIVE 1
264 STATIC UV su_uid_depth(pTHX_ I32 cxix) {
265 #define su_uid_depth(I) su_uid_depth(aTHX_ (I))
270 for (si = PL_curstackinfo->si_prev; si; si = si->si_prev)
271 depth += si->si_cxix + 1;
282 STATIC void su_uid_storage_dup(pTHX_ su_uid_storage *new_cxt, const su_uid_storage *old_cxt, UV max_depth) {
283 #define su_uid_storage_dup(N, O, D) su_uid_storage_dup(aTHX_ (N), (O), (D))
284 su_uid **old_map = old_cxt->map;
287 su_uid **new_map = new_cxt->map;
288 STRLEN old_used = old_cxt->used;
289 STRLEN new_used, new_alloc;
292 new_used = max_depth < old_used ? max_depth : old_used;
293 new_cxt->used = new_used;
295 if (new_used <= new_cxt->alloc)
296 new_alloc = new_cxt->alloc;
298 new_alloc = new_used;
299 Renew(new_map, new_alloc, su_uid *);
300 for (i = new_cxt->alloc; i < new_alloc; ++i)
302 new_cxt->map = new_map;
303 new_cxt->alloc = new_alloc;
306 for (i = 0; i < new_alloc; ++i) {
307 su_uid *new_uid = new_map[i];
309 if (i < new_used) { /* => i < max_depth && i < old_used */
310 su_uid *old_uid = old_map[i];
312 if (old_uid && (old_uid->flags & SU_UID_ACTIVE)) {
314 Newx(new_uid, 1, su_uid);
315 new_map[i] = new_uid;
323 new_uid->flags &= ~SU_UID_ACTIVE;
330 /* --- unwind() global storage --------------------------------------------- */
340 /* --- yield() global storage ---------------------------------------------- */
350 /* --- uplevel() data tokens and global storage ---------------------------- */
352 #define SU_UPLEVEL_HIJACKS_RUNOPS SU_HAS_PERL(5, 8, 0)
357 su_uid_storage tmp_uid_storage;
358 su_uid_storage old_uid_storage;
369 PERL_SI *old_curstackinfo;
375 #if SU_UPLEVEL_HIJACKS_RUNOPS
376 runops_proc_t old_runops;
383 STATIC su_uplevel_ud *su_uplevel_ud_new(pTHX) {
384 #define su_uplevel_ud_new() su_uplevel_ud_new(aTHX)
388 Newx(sud, 1, su_uplevel_ud);
391 sud->tmp_uid_storage.map = NULL;
392 sud->tmp_uid_storage.used = 0;
393 sud->tmp_uid_storage.alloc = 0;
395 Newx(si, 1, PERL_SI);
396 si->si_stack = newAV();
397 AvREAL_off(si->si_stack);
398 si->si_cxstack = NULL;
406 STATIC void su_uplevel_ud_delete(pTHX_ su_uplevel_ud *sud) {
407 #define su_uplevel_ud_delete(S) su_uplevel_ud_delete(aTHX_ (S))
408 PERL_SI *si = sud->si;
410 Safefree(si->si_cxstack);
411 SvREFCNT_dec(si->si_stack);
414 if (sud->tmp_uid_storage.map) {
415 su_uid **map = sud->tmp_uid_storage.map;
416 STRLEN alloc = sud->tmp_uid_storage.alloc;
419 for (i = 0; i < alloc; ++i)
434 } su_uplevel_storage;
436 #ifndef SU_UPLEVEL_STORAGE_SIZE
437 # define SU_UPLEVEL_STORAGE_SIZE 4
440 /* --- Global data --------------------------------------------------------- */
442 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
445 char *stack_placeholder;
446 su_unwind_storage unwind_storage;
447 su_yield_storage yield_storage;
448 su_uplevel_storage uplevel_storage;
449 su_uid_storage uid_storage;
454 /* --- Stack manipulations ------------------------------------------------- */
456 #define SU_SAVE_PLACEHOLDER() save_pptr(&MY_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 !SU_HAS_PERL(5, 8, 9)
488 # define SU_SAVE_GP_SIZE 6
489 #elif !SU_HAS_PERL(5, 13, 0) || (SU_RELEASE && SU_HAS_PERL_EXACT(5, 13, 0))
490 # define SU_SAVE_GP_SIZE 3
491 #elif !SU_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 SU_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 =
523 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
524 NEGATIVE_INDICES_VAR, 16, 0);
525 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
531 idx = key + av_len(av) + 1;
545 STATIC void su_adelete(pTHX_ void *ud_) {
546 su_ud_adelete *ud = (su_ud_adelete *) ud_;
548 av_delete(ud->av, ud->idx, G_DISCARD);
549 SvREFCNT_dec(ud->av);
554 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
555 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
558 Newx(ud, 1, su_ud_adelete);
561 SvREFCNT_inc_simple_void(av);
563 SAVEDESTRUCTOR_X(su_adelete, ud);
566 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
568 #endif /* SAVEADELETE */
570 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
571 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
578 idx = su_av_key2idx(av, SvIV(key));
580 if (SvCANEXISTDELETE(av))
581 preeminent = av_exists(av, idx);
583 svp = av_fetch(av, idx, 1);
584 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
587 save_aelem(av, idx, svp);
589 SAVEADELETE(av, idx);
591 if (val) { /* local $x[$idx] = $val; */
592 SvSetMagicSV(*svp, val);
593 } else { /* local $x[$idx]; delete $x[$idx]; */
594 av_delete(av, idx, G_DISCARD);
598 /* ... Saving hash elements ................................................ */
600 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
601 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
608 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
609 preeminent = hv_exists_ent(hv, keysv, 0);
611 he = hv_fetch_ent(hv, keysv, 1, 0);
612 svp = he ? &HeVAL(he) : NULL;
613 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
615 if (HvNAME_get(hv) && isGV(*svp)) {
616 save_gp((GV *) *svp, 0);
621 save_helem(hv, keysv, svp);
624 const char * const key = SvPV_const(keysv, keylen);
625 SAVEDELETE(hv, savepvn(key, keylen),
626 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
629 if (val) { /* local $x{$keysv} = $val; */
630 SvSetMagicSV(*svp, val);
631 } else { /* local $x{$keysv}; delete $x{$keysv}; */
632 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
636 /* ... Saving code slots from a glob ....................................... */
638 #if !SU_HAS_PERL(5, 10, 0) && !defined(mro_method_changed_in)
639 # define mro_method_changed_in(G) PL_sub_generation++
647 STATIC void su_restore_gvcv(pTHX_ void *ud_) {
648 su_save_gvcv_ud *ud = ud_;
651 GvCV_set(gv, ud->old_cv);
653 mro_method_changed_in(GvSTASH(gv));
658 STATIC void su_save_gvcv(pTHX_ GV *gv) {
659 #define su_save_gvcv(G) su_save_gvcv(aTHX_ (G))
662 Newx(ud, 1, su_save_gvcv_ud);
664 ud->old_cv = GvCV(gv);
668 mro_method_changed_in(GvSTASH(gv));
670 SAVEDESTRUCTOR_X(su_restore_gvcv, ud);
673 /* --- Actions ------------------------------------------------------------- */
679 void (*handler)(pTHX_ void *);
682 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
683 #define SU_UD_PAD(U) (((su_ud_common *) (U))->pad)
684 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
685 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
687 #define SU_UD_FREE(U) STMT_START { \
688 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
692 /* ... Reap ................................................................ */
694 #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))
701 STATIC void su_call(pTHX_ void *ud_) {
702 su_ud_reap *ud = (su_ud_reap *) ud_;
705 PERL_CONTEXT saved_cx;
706 #endif /* SU_SAVE_LAST_CX */
711 PerlIO_printf(Perl_debug_log,
712 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
713 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
723 /* If the recently popped context isn't saved there, it will be overwritten by
724 * the sub scope from call_sv, although it's still needed in our caller. */
725 cxix = (cxstack_ix < cxstack_max) ? (cxstack_ix + 1) : Perl_cxinc(aTHX);
726 saved_cx = cxstack[cxix];
727 #endif /* SU_SAVE_LAST_CX */
729 call_sv(ud->cb, G_VOID);
732 cxstack[cxix] = saved_cx;
733 #endif /* SU_SAVE_LAST_CX */
740 SvREFCNT_dec(ud->cb);
744 STATIC void su_reap(pTHX_ void *ud) {
745 #define su_reap(U) su_reap(aTHX_ (U))
747 PerlIO_printf(Perl_debug_log,
748 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
749 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
752 SAVEDESTRUCTOR_X(su_call, ud);
755 /* ... Localize & localize array/hash element .............................. */
765 #define SU_UD_LOCALIZE_FREE(U) STMT_START { \
766 SvREFCNT_dec((U)->elem); \
767 SvREFCNT_dec((U)->val); \
768 SvREFCNT_dec((U)->sv); \
772 STATIC I32 su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
773 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
778 SvREFCNT_inc_simple_void(sv);
780 if (SvTYPE(sv) >= SVt_PVGV) {
781 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
783 } else { /* local *x = \$val; */
784 t = SvTYPE(SvRV(val));
787 } else if (SvROK(sv)) {
788 croak("Invalid %s reference as the localization target",
789 sv_reftype(SvRV(sv), 0));
792 const char *p = SvPV_const(sv, len), *s;
793 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
799 case '$': t = SVt_PV; break;
800 case '@': t = SVt_PVAV; break;
801 case '%': t = SVt_PVHV; break;
802 case '&': t = SVt_PVCV; break;
803 case '*': t = SVt_PVGV; break;
808 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
809 if (SvROK(val) && !sv_isobject(val)) {
810 t = SvTYPE(SvRV(val));
822 size = elem ? SU_SAVE_AELEM_OR_ADELETE_SIZE
827 size = elem ? SU_SAVE_HELEM_OR_HDELETE_SIZE
832 size = SU_SAVE_GP_SIZE;
836 size = SU_SAVE_GVCV_SIZE;
840 size = SU_SAVE_SCALAR_SIZE;
843 /* When deref is set, val isn't NULL */
846 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
847 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_;
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 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
878 PerlIO_printf(Perl_debug_log,
879 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
880 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
884 /* Inspired from Alias.pm */
888 su_save_aelem(GvAV(gv), elem, val);
895 su_save_helem(GvHV(gv), elem, val);
901 save_gp(gv, 1); /* hide previous entry in symtab */
907 gv = (GV *) save_scalar(gv);
912 SvSetMagicSV((SV *) gv, val);
915 SU_UD_LOCALIZE_FREE(ud);
918 /* --- Pop a context back -------------------------------------------------- */
920 #if SU_DEBUG && defined(DEBUGGING)
921 # define SU_CXNAME(C) PL_block_type[CxTYPE(C)]
923 # define SU_CXNAME(C) "XXX"
926 STATIC void su_pop(pTHX_ void *ud) {
927 #define su_pop(U) su_pop(aTHX_ (U))
928 I32 depth, base, mark, *origin;
929 depth = SU_UD_DEPTH(ud);
932 PerlIO_printf(Perl_debug_log,
934 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
935 ud, SU_CXNAME(cxstack + cxstack_ix),
936 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
939 origin = SU_UD_ORIGIN(ud);
940 mark = origin[depth];
941 base = origin[depth - 1];
943 SU_D(PerlIO_printf(Perl_debug_log,
944 "%p: original scope was %*c top=%2d base=%2d\n",
945 ud, 24, ' ', mark, base));
948 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
949 PL_savestack_ix = mark;
952 PL_savestack_ix = base;
954 SU_UD_DEPTH(ud) = --depth;
959 if ((pad = SU_UD_PAD(ud))) {
962 SU_D(PerlIO_printf(Perl_debug_log,
963 "%p: push a pad slot at depth=%2d scope_ix=%2d save_ix=%2d\n",
964 ud, depth, PL_scopestack_ix, PL_savestack_ix));
965 SU_SAVE_PLACEHOLDER();
969 SU_D(PerlIO_printf(Perl_debug_log,
970 "%p: push destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
971 ud, depth, PL_scopestack_ix, PL_savestack_ix));
972 SAVEDESTRUCTOR_X(su_pop, ud);
974 SU_UD_HANDLER(ud)(aTHX_ ud);
977 SU_D(PerlIO_printf(Perl_debug_log,
978 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
979 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
982 /* --- Initialize the stack and the action userdata ------------------------ */
984 STATIC I32 su_init(pTHX_ void *ud, I32 cxix, I32 size) {
985 #define su_init(U, C, S) su_init(aTHX_ (U), (C), (S))
986 I32 i, depth = 1, pad, offset, *origin;
988 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
990 if (size <= SU_SAVE_DESTRUCTOR_SIZE)
993 I32 extra = size - SU_SAVE_DESTRUCTOR_SIZE;
994 pad = extra / SU_SAVE_PLACEHOLDER_SIZE;
995 if (extra % SU_SAVE_PLACEHOLDER_SIZE)
998 offset = SU_SAVE_DESTRUCTOR_SIZE + SU_SAVE_PLACEHOLDER_SIZE * pad;
1000 SU_D(PerlIO_printf(Perl_debug_log, "%p: size=%d pad=%d offset=%d\n",
1001 ud, size, pad, offset));
1003 for (i = cxstack_ix; i > cxix; --i) {
1004 PERL_CONTEXT *cx = cxstack + i;
1005 switch (CxTYPE(cx)) {
1006 #if SU_HAS_PERL(5, 11, 0)
1008 case CXt_LOOP_PLAIN:
1009 case CXt_LOOP_LAZYSV:
1010 case CXt_LOOP_LAZYIV:
1014 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
1018 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
1023 SU_D(PerlIO_printf(Perl_debug_log, "%p: going down to depth %d\n", ud, depth));
1025 Newx(origin, depth + 1, I32);
1026 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
1027 PL_scopestack[PL_scopestack_ix - depth] += size;
1028 for (i = depth - 1; i >= 1; --i) {
1029 I32 j = PL_scopestack_ix - i;
1030 origin[depth - i] = PL_scopestack[j];
1031 PL_scopestack[j] += offset;
1033 origin[depth] = PL_savestack_ix;
1035 SU_UD_ORIGIN(ud) = origin;
1036 SU_UD_DEPTH(ud) = depth;
1037 SU_UD_PAD(ud) = pad;
1039 /* Make sure the first destructor fires by pushing enough fake slots on the
1041 if (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1042 <= PL_scopestack[PL_scopestack_ix - 1]) {
1045 SU_D(PerlIO_printf(Perl_debug_log,
1046 "%p: push a fake slot at scope_ix=%2d save_ix=%2d\n",
1047 ud, PL_scopestack_ix, PL_savestack_ix));
1048 SU_SAVE_PLACEHOLDER();
1049 } while (PL_savestack_ix + SU_SAVE_DESTRUCTOR_SIZE
1050 <= PL_scopestack[PL_scopestack_ix - 1]);
1052 SU_D(PerlIO_printf(Perl_debug_log,
1053 "%p: push first destructor at scope_ix=%2d save_ix=%2d\n",
1054 ud, PL_scopestack_ix, PL_savestack_ix));
1055 SAVEDESTRUCTOR_X(su_pop, ud);
1058 for (i = 0; i <= depth; ++i) {
1059 I32 j = PL_scopestack_ix - i;
1060 PerlIO_printf(Perl_debug_log,
1061 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
1062 ud, i, j, origin[depth - i],
1063 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
1070 /* --- Unwind stack -------------------------------------------------------- */
1072 STATIC void su_unwind(pTHX_ void *ud_) {
1074 I32 cxix = MY_CXT.unwind_storage.cxix;
1075 I32 items = MY_CXT.unwind_storage.items;
1078 PERL_UNUSED_VAR(ud_);
1080 PL_stack_sp = MY_CXT.unwind_storage.savesp;
1082 if (cxstack_ix > cxix)
1085 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
1086 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
1089 I32 gimme = GIMME_V;
1090 PerlIO_printf(Perl_debug_log,
1091 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
1093 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
1094 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
1097 PL_op = (OP *) &(MY_CXT.unwind_storage.return_op);
1098 PL_op = PL_op->op_ppaddr(aTHX);
1100 *PL_markstack_ptr = mark;
1102 MY_CXT.unwind_storage.proxy_op.op_next = PL_op;
1103 PL_op = &(MY_CXT.unwind_storage.proxy_op);
1106 /* --- Yield --------------------------------------------------------------- */
1108 #if SU_HAS_PERL(5, 10, 0)
1109 # define SU_RETOP_SUB(C) ((C)->blk_sub.retop)
1110 # define SU_RETOP_EVAL(C) ((C)->blk_eval.retop)
1111 # define SU_RETOP_LOOP(C) ((C)->blk_loop.my_op->op_lastop->op_next)
1112 # define SU_RETOP_GIVEN(C) ((C)->blk_givwhen.leave_op->op_next)
1114 # define SU_RETOP_SUB(C) ((C)->blk_oldretsp > 0 ? PL_retstack[(C)->blk_oldretsp - 1] : NULL)
1115 # define SU_RETOP_EVAL(C) SU_RETOP_SUB(C)
1116 # define SU_RETOP_LOOP(C) ((C)->blk_loop.last_op->op_next)
1119 STATIC void su_yield(pTHX_ void *ud_) {
1122 I32 cxix = MY_CXT.yield_storage.cxix;
1123 I32 items = MY_CXT.yield_storage.items;
1124 opcode type = OP_NULL;
1128 PERL_UNUSED_VAR(ud_);
1130 cx = cxstack + cxix;
1131 switch (CxTYPE(cx)) {
1133 I32 i, cur = cxstack_ix, n = 1;
1135 /* Is this actually a given/when block? This may occur only when yield was
1136 * called with HERE (or nothing) as the context. */
1137 #if SU_HAS_PERL(5, 10, 0)
1139 PERL_CONTEXT *prev = cx - 1;
1140 U8 type = CxTYPE(prev);
1141 if ((type == CXt_GIVEN || type == CXt_WHEN)
1142 && (prev->blk_oldcop == cx->blk_oldcop)) {
1145 if (type == CXt_GIVEN)
1154 /* Bare blocks (that appear as do { ... } blocks, map { ... } blocks or
1155 * constant folded blcoks) don't need to save the op to return to anywhere
1156 * since 'last' isn't supposed to work inside them. So we climb higher in
1157 * the context stack until we reach a context that has a return op (i.e. a
1158 * sub, an eval, a format or a real loop), recording how many blocks we
1159 * crossed. Then we follow the op_next chain until we get to the leave op
1160 * that closes the original block, which we are assured to reach since
1161 * everything is static (the blocks we have crossed cannot be evals or
1162 * subroutine calls). */
1163 for (i = cxix + 1; i <= cur; ++i) {
1164 PERL_CONTEXT *cx2 = cxstack + i;
1165 switch (CxTYPE(cx2)) {
1171 o = SU_RETOP_SUB(cx2);
1174 o = SU_RETOP_EVAL(cx2);
1176 #if SU_HAS_PERL(5, 11, 0)
1178 case CXt_LOOP_PLAIN:
1179 case CXt_LOOP_LAZYSV:
1180 case CXt_LOOP_LAZYIV:
1184 o = SU_RETOP_LOOP(cx2);
1193 /* We may find other enter/leave blocks on our way to the matching leave.
1194 * Make sure the depth is incremented/decremented appropriately. */
1195 if (o->op_type == OP_ENTER) {
1197 } else if (o->op_type == OP_LEAVE) {
1211 next = SU_RETOP_SUB(cx);
1214 type = CxTRYBLOCK(cx) ? OP_LEAVETRY : OP_LEAVEEVAL;
1215 next = SU_RETOP_EVAL(cx);
1217 #if SU_HAS_PERL(5, 11, 0)
1219 case CXt_LOOP_PLAIN:
1220 case CXt_LOOP_LAZYSV:
1221 case CXt_LOOP_LAZYIV:
1225 type = OP_LEAVELOOP;
1226 next = SU_RETOP_LOOP(cx);
1228 #if SU_HAS_PERL(5, 10, 0)
1231 type = OP_LEAVEGIVEN;
1232 next = SU_RETOP_GIVEN(cx);
1236 #if SU_HAS_PERL(5, 15, 1)
1237 type = OP_LEAVEWHEN;
1240 flags |= OPf_SPECIAL;
1246 croak("yield() cannot target a substitution context");
1249 croak("yield() don't know how to leave a %s context", SU_CXNAME(cxstack + cxix));
1253 PL_stack_sp = MY_CXT.yield_storage.savesp;
1255 if (cxstack_ix > cxix)
1258 /* Copy the arguments passed to yield() where the leave op expects to find
1261 Move(PL_stack_sp - items + 1, PL_stack_base + cx->blk_oldsp + 1, items, SV *);
1262 PL_stack_sp = PL_stack_base + cx->blk_oldsp + items;
1264 flags |= OP_GIMME_REVERSE(cx->blk_gimme);
1266 MY_CXT.yield_storage.leave_op.op_type = type;
1267 MY_CXT.yield_storage.leave_op.op_ppaddr = PL_ppaddr[type];
1268 MY_CXT.yield_storage.leave_op.op_flags = flags;
1269 MY_CXT.yield_storage.leave_op.op_next = next;
1271 PL_op = (OP *) &(MY_CXT.yield_storage.leave_op);
1272 PL_op = PL_op->op_ppaddr(aTHX);
1274 MY_CXT.yield_storage.proxy_op.op_next = PL_op;
1275 PL_op = &(MY_CXT.yield_storage.proxy_op);
1278 /* --- Uplevel ------------------------------------------------------------- */
1280 #define SU_UPLEVEL_SAVE(f, t) STMT_START { sud->old_##f = PL_##f; PL_##f = (t); } STMT_END
1281 #define SU_UPLEVEL_RESTORE(f) STMT_START { PL_##f = sud->old_##f; } STMT_END
1283 STATIC su_uplevel_ud *su_uplevel_storage_new(pTHX_ I32 cxix) {
1284 #define su_uplevel_storage_new(I) su_uplevel_storage_new(aTHX_ (I))
1289 sud = MY_CXT.uplevel_storage.root;
1291 MY_CXT.uplevel_storage.root = sud->next;
1292 MY_CXT.uplevel_storage.count--;
1294 sud = su_uplevel_ud_new();
1297 sud->next = MY_CXT.uplevel_storage.top;
1298 MY_CXT.uplevel_storage.top = sud;
1300 depth = su_uid_depth(cxix);
1301 su_uid_storage_dup(&sud->tmp_uid_storage, &MY_CXT.uid_storage, depth);
1302 sud->old_uid_storage = MY_CXT.uid_storage;
1303 MY_CXT.uid_storage = sud->tmp_uid_storage;
1308 STATIC void su_uplevel_storage_delete(pTHX_ su_uplevel_ud *sud) {
1309 #define su_uplevel_storage_delete(S) su_uplevel_storage_delete(aTHX_ (S))
1312 sud->tmp_uid_storage = MY_CXT.uid_storage;
1313 MY_CXT.uid_storage = sud->old_uid_storage;
1317 map = sud->tmp_uid_storage.map;
1318 alloc = sud->tmp_uid_storage.alloc;
1319 for (i = 0; i < alloc; ++i) {
1321 map[i]->flags &= SU_UID_ACTIVE;
1324 MY_CXT.uplevel_storage.top = sud->next;
1326 if (MY_CXT.uplevel_storage.count >= SU_UPLEVEL_STORAGE_SIZE) {
1327 su_uplevel_ud_delete(sud);
1329 sud->next = MY_CXT.uplevel_storage.root;
1330 MY_CXT.uplevel_storage.root = sud;
1331 MY_CXT.uplevel_storage.count++;
1335 STATIC int su_uplevel_goto_static(const OP *o) {
1336 for (; o; o = o->op_sibling) {
1337 /* goto ops are unops with kids. */
1338 if (!(o->op_flags & OPf_KIDS))
1341 switch (o->op_type) {
1344 /* Don't care about gotos inside eval, as they are forbidden at run time. */
1349 if (su_uplevel_goto_static(((const UNOP *) o)->op_first))
1358 #if SU_UPLEVEL_HIJACKS_RUNOPS
1360 STATIC int su_uplevel_goto_runops(pTHX) {
1361 #define su_uplevel_goto_runops() su_uplevel_goto_runops(aTHX)
1367 if (op->op_type == OP_GOTO) {
1368 AV *argarray = NULL;
1371 for (cxix = cxstack_ix; cxix >= 0; --cxix) {
1372 const PERL_CONTEXT *cx = cxstack + cxix;
1374 switch (CxTYPE(cx)) {
1376 if (CxHASARGS(cx)) {
1377 argarray = cx->blk_sub.argarray;
1393 if (MY_CXT.uplevel_storage.top->cxix == cxix) {
1394 AV *args = GvAV(PL_defgv);
1395 I32 items = AvFILLp(args);
1397 av_extend(argarray, items);
1398 Copy(AvARRAY(args), AvARRAY(argarray), items + 1, SV *);
1399 AvFILLp(argarray) = items;
1404 PL_op = op = op->op_ppaddr(aTHX);
1406 #if !SU_HAS_PERL(5, 13, 0)
1416 #endif /* SU_UPLEVEL_HIJACKS_RUNOPS */
1418 #define su_at_underscore(C) PadARRAY(PadlistARRAY(CvPADLIST(C))[CvDEPTH(C)])[0]
1420 STATIC void su_uplevel_restore(pTHX_ void *sus_) {
1421 su_uplevel_ud *sud = sus_;
1422 PERL_SI *cur = sud->old_curstackinfo;
1423 PERL_SI *si = sud->si;
1425 #if SU_UPLEVEL_HIJACKS_RUNOPS
1426 if (PL_runops == su_uplevel_goto_runops)
1427 PL_runops = sud->old_runops;
1430 if (sud->callback) {
1431 PERL_CONTEXT *cx = cxstack + sud->cxix;
1432 AV *argarray = MUTABLE_AV(su_at_underscore(sud->callback));
1434 /* We have to fix the pad entry for @_ in the original callback because it
1435 * may have been reified. */
1436 if (AvREAL(argarray)) {
1437 const I32 fill = AvFILLp(argarray);
1438 SvREFCNT_dec(argarray);
1440 AvREAL_off(argarray);
1441 AvREIFY_on(argarray);
1442 av_extend(argarray, fill);
1443 su_at_underscore(sud->callback) = MUTABLE_SV(argarray);
1445 CLEAR_ARGARRAY(argarray);
1448 /* If the old cv member is our renamed CV, it means that this place has been
1449 * reached without a goto() happening, and the old argarray member is
1450 * actually our fake argarray. Destroy it properly in that case. */
1451 if (cx->blk_sub.cv == sud->renamed) {
1452 SvREFCNT_dec(cx->blk_sub.argarray);
1453 cx->blk_sub.argarray = argarray;
1456 CvDEPTH(sud->callback)--;
1457 SvREFCNT_dec(sud->callback);
1460 /* Free the renamed CV. We must do it ourselves so that we can force the
1461 * depth to be 0, or perl would complain about it being "still in use".
1462 * But we *know* that it cannot be so. */
1464 CvDEPTH(sud->renamed) = 0;
1465 CvPADLIST(sud->renamed) = NULL;
1466 SvREFCNT_dec(sud->renamed);
1469 CATCH_SET(sud->old_catch);
1471 SU_UPLEVEL_RESTORE(op);
1473 /* stack_grow() wants PL_curstack so restore the old stack first */
1474 if (PL_curstackinfo == si) {
1475 PL_curstack = cur->si_stack;
1476 if (sud->old_mainstack)
1477 SU_UPLEVEL_RESTORE(mainstack);
1478 SU_UPLEVEL_RESTORE(curstackinfo);
1481 CV *target = sud->target;
1484 /* When we die, the depth of the target CV is not updated because of the
1485 * stack switcheroo. So we have to look at all the frames between the
1486 * uplevel call and the catch block to count how many call frames to the
1487 * target CV were skipped. */
1488 for (i = cur->si_cxix; i > sud->cxix; i--) {
1489 register const PERL_CONTEXT *cx = cxstack + i;
1491 if (CxTYPE(cx) == CXt_SUB) {
1492 if (cx->blk_sub.cv == target)
1497 /* If we died, the replacement stack was already unwinded to the first
1498 * eval frame, and all the contexts down there were popped. We don't have
1499 * to pop manually any context of the original stack, because they must
1500 * have been in the replacement stack as well (since the second was copied
1501 * from the first). Thus we only have to make sure the original stack index
1502 * points to the context just below the first eval scope under the target
1504 for (; i >= 0; i--) {
1505 register const PERL_CONTEXT *cx = cxstack + i;
1507 switch (CxTYPE(cx)) {
1509 if (cx->blk_sub.cv == target)
1521 CvDEPTH(target) = sud->target_depth - levels;
1522 PL_curstackinfo->si_cxix = i - 1;
1524 #if !SU_HAS_PERL(5, 13, 1)
1525 /* Since $@ was maybe localized between the target frame and the uplevel
1526 * call, we forcefully flush the save stack to get rid of it and then
1527 * reset $@ to its proper value. Note that the the call to
1528 * su_uplevel_restore() must happen before the "reset $@" item of the save
1529 * stack is processed, as uplevel was called after the localization.
1530 * Andrew's changes to how $@ was handled, which were mainly integrated
1531 * between perl 5.13.0 and 5.13.1, fixed this. */
1532 if (ERRSV && SvTRUE(ERRSV)) {
1533 register const PERL_CONTEXT *cx = cxstack + i; /* This is the eval scope */
1534 SV *errsv = SvREFCNT_inc(ERRSV);
1535 PL_scopestack_ix = cx->blk_oldscopesp;
1536 leave_scope(PL_scopestack[PL_scopestack_ix]);
1537 sv_setsv(ERRSV, errsv);
1538 SvREFCNT_dec(errsv);
1544 SU_UPLEVEL_RESTORE(curcop);
1546 SvREFCNT_dec(sud->target);
1548 PL_stack_base = AvARRAY(cur->si_stack);
1549 PL_stack_sp = PL_stack_base + AvFILLp(cur->si_stack);
1550 PL_stack_max = PL_stack_base + AvMAX(cur->si_stack);
1552 /* When an exception is thrown from the uplevel'd subroutine,
1553 * su_uplevel_restore() may be called by the LEAVE in die_unwind() (renamed
1554 * die_where() in more recent perls), which has the sad habit of keeping a
1555 * pointer to the current context frame across this call. This means that we
1556 * can't free the temporary context stack we used for the uplevel call right
1557 * now, or that pointer upwards would point to garbage. */
1558 #if SU_HAS_PERL(5, 13, 7)
1559 /* This issue has been fixed in perl with commit 8f89e5a9, which was made
1560 * public in perl 5.13.7. */
1561 su_uplevel_storage_delete(sud);
1563 /* Otherwise, we just enqueue it back in the global storage list. */
1567 sud->tmp_uid_storage = MY_CXT.uid_storage;
1568 MY_CXT.uid_storage = sud->old_uid_storage;
1570 MY_CXT.uplevel_storage.top = sud->next;
1571 sud->next = MY_CXT.uplevel_storage.root;
1572 MY_CXT.uplevel_storage.root = sud;
1573 MY_CXT.uplevel_storage.count++;
1580 STATIC CV *su_cv_clone(pTHX_ CV *proto, GV *gv) {
1581 #define su_cv_clone(P, G) su_cv_clone(aTHX_ (P), (G))
1585 cv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1587 CvFLAGS(cv) = CvFLAGS(proto);
1589 CvFLAGS(cv) &= ~CVf_CVGV_RC;
1591 CvDEPTH(cv) = CvDEPTH(proto);
1593 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto) : savepv(CvFILE(proto));
1595 CvFILE(cv) = CvFILE(proto);
1599 CvSTASH_set(cv, CvSTASH(proto));
1600 /* Commit 4c74a7df, publicized with perl 5.13.3, began to add backrefs to
1601 * stashes. CvSTASH_set() started to do it as well with commit c68d95645
1602 * (which was part of perl 5.13.7). */
1603 #if SU_HAS_PERL(5, 13, 3) && !SU_HAS_PERL(5, 13, 7)
1605 Perl_sv_add_backref(aTHX_ CvSTASH(proto), MUTABLE_SV(cv));
1608 if (CvISXSUB(proto)) {
1609 CvXSUB(cv) = CvXSUB(proto);
1610 CvXSUBANY(cv) = CvXSUBANY(proto);
1613 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1615 CvSTART(cv) = CvSTART(proto);
1617 CvOUTSIDE(cv) = CvOUTSIDE(proto);
1618 #ifdef CVf_WEAKOUTSIDE
1619 if (!(CvFLAGS(proto) & CVf_WEAKOUTSIDE))
1621 SvREFCNT_inc_simple_void(CvOUTSIDE(cv));
1622 CvPADLIST(cv) = CvPADLIST(proto);
1623 #ifdef CvOUTSIDE_SEQ
1624 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1628 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1638 STATIC I32 su_uplevel(pTHX_ CV *callback, I32 cxix, I32 args) {
1639 #define su_uplevel(C, I, A) su_uplevel(aTHX_ (C), (I), (A))
1641 const PERL_CONTEXT *cx = cxstack + cxix;
1643 PERL_SI *cur = PL_curstackinfo;
1649 I32 old_mark, new_mark;
1656 /* Make PL_stack_sp point just before the CV. */
1657 PL_stack_sp -= args + 1;
1658 old_mark = AvFILLp(PL_curstack) = PL_stack_sp - PL_stack_base;
1661 sud = su_uplevel_storage_new(cxix);
1665 sud->callback = NULL;
1666 sud->renamed = NULL;
1667 SAVEDESTRUCTOR_X(su_uplevel_restore, sud);
1671 si->si_type = cur->si_type;
1673 si->si_prev = cur->si_prev;
1675 si->si_markoff = cx->blk_oldmarksp;
1678 /* Allocate enough space for all the elements of the original stack up to the
1679 * target context, plus the forthcoming arguments. */
1680 new_mark = cx->blk_oldsp;
1681 av_extend(si->si_stack, new_mark + 1 + args + 1);
1682 Copy(PL_curstack, AvARRAY(si->si_stack), new_mark + 1, SV *);
1683 AvFILLp(si->si_stack) = new_mark;
1684 SU_POISON(AvARRAY(si->si_stack) + new_mark + 1, args + 1, SV *);
1686 /* Specialized SWITCHSTACK() */
1687 PL_stack_base = AvARRAY(si->si_stack);
1688 old_stack_sp = PL_stack_sp;
1689 PL_stack_sp = PL_stack_base + AvFILLp(si->si_stack);
1690 PL_stack_max = PL_stack_base + AvMAX(si->si_stack);
1693 /* Copy the context stack up to the context just below the target. */
1694 si->si_cxix = (cxix < 0) ? -1 : (cxix - 1);
1695 if (si->si_cxmax < cxix) {
1696 /* The max size must be at least two so that GROW(max) = (max*3)/2 > max */
1697 si->si_cxmax = (cxix < 4) ? 4 : cxix;
1698 Renew(si->si_cxstack, si->si_cxmax + 1, PERL_CONTEXT);
1700 Copy(cur->si_cxstack, si->si_cxstack, cxix, PERL_CONTEXT);
1701 SU_POISON(si->si_cxstack + cxix, si->si_cxmax + 1 - cxix, PERL_CONTEXT);
1703 target = cx->blk_sub.cv;
1704 sud->target = (CV *) SvREFCNT_inc(target);
1705 sud->target_depth = CvDEPTH(target);
1707 /* blk_oldcop is essentially needed for caller() and stack traces. It has no
1708 * run-time implication, since PL_curcop will be overwritten as soon as we
1709 * enter a sub (a sub starts by a nextstate/dbstate). Hence it's safe to just
1710 * make it point to the blk_oldcop for the target frame, so that caller()
1711 * reports the right file name, line number and lexical hints. */
1712 SU_UPLEVEL_SAVE(curcop, cx->blk_oldcop);
1713 /* Don't reset PL_markstack_ptr, or we would overwrite the mark stack below
1714 * this point. Don't reset PL_curpm either, we want the most recent matches. */
1716 SU_UPLEVEL_SAVE(curstackinfo, si);
1717 /* If those two are equal, we need to fool POPSTACK_TO() */
1718 if (PL_mainstack == PL_curstack)
1719 SU_UPLEVEL_SAVE(mainstack, si->si_stack);
1721 sud->old_mainstack = NULL;
1722 PL_curstack = si->si_stack;
1724 renamed = su_cv_clone(callback, CvGV(target));
1725 sud->renamed = renamed;
1728 /* Both SP and old_stack_sp point just before the CV. */
1729 Copy(old_stack_sp + 2, SP + 1, args, SV *);
1731 PUSHs((SV *) renamed);
1734 Zero(&sub_op, 1, UNOP);
1735 sub_op.op_type = OP_ENTERSUB;
1736 sub_op.op_next = NULL;
1737 sub_op.op_flags = OP_GIMME_REVERSE(gimme) | OPf_STACKED;
1739 sub_op.op_flags |= OPpENTERSUB_DB;
1741 SU_UPLEVEL_SAVE(op, (OP *) &sub_op);
1743 #if SU_UPLEVEL_HIJACKS_RUNOPS
1744 sud->old_runops = PL_runops;
1747 sud->old_catch = CATCH_GET;
1750 if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) {
1751 PERL_CONTEXT *sub_cx = cxstack + cxstack_ix;
1753 /* If pp_entersub() returns a non-null OP, it means that the callback is not
1756 sud->callback = MUTABLE_CV(SvREFCNT_inc(callback));
1757 CvDEPTH(callback)++;
1759 if (CxHASARGS(cx) && cx->blk_sub.argarray) {
1760 /* The call to pp_entersub() has saved the current @_ (in XS terms,
1761 * GvAV(PL_defgv)) in the savearray member, and has created a new argarray
1762 * with what we put on the stack. But we want to fake up the same arguments
1763 * as the ones in use at the context we uplevel to, so we replace the
1764 * argarray with an unreal copy of the original @_. */
1768 av_extend(av, AvMAX(cx->blk_sub.argarray));
1769 AvFILLp(av) = AvFILLp(cx->blk_sub.argarray);
1770 Copy(AvARRAY(cx->blk_sub.argarray), AvARRAY(av), AvFILLp(av) + 1, SV *);
1771 sub_cx->blk_sub.argarray = av;
1773 SvREFCNT_inc_simple_void(sub_cx->blk_sub.argarray);
1776 if (su_uplevel_goto_static(CvROOT(renamed))) {
1777 #if SU_UPLEVEL_HIJACKS_RUNOPS
1778 if (PL_runops != PL_runops_std) {
1779 if (PL_runops == PL_runops_dbg) {
1781 croak("uplevel() can't execute code that calls goto when debugging flags are set");
1782 } else if (PL_runops != su_uplevel_goto_runops)
1783 croak("uplevel() can't execute code that calls goto with a custom runloop");
1786 PL_runops = su_uplevel_goto_runops;
1787 #else /* SU_UPLEVEL_HIJACKS_RUNOPS */
1788 croak("uplevel() can't execute code that calls goto before perl 5.8");
1789 #endif /* !SU_UPLEVEL_HIJACKS_RUNOPS */
1797 ret = PL_stack_sp - (PL_stack_base + new_mark);
1799 AV *old_stack = sud->old_curstackinfo->si_stack;
1801 if (old_mark + ret > AvMAX(old_stack)) {
1802 /* Specialized EXTEND(old_sp, ret) */
1803 av_extend(old_stack, old_mark + ret + 1);
1804 old_stack_sp = AvARRAY(old_stack) + old_mark;
1807 Copy(PL_stack_sp - ret + 1, old_stack_sp + 1, ret, SV *);
1809 AvFILLp(old_stack) += ret;
1817 /* --- Unique context ID --------------------------------------------------- */
1819 STATIC su_uid *su_uid_storage_fetch(pTHX_ UV depth) {
1820 #define su_uid_storage_fetch(D) su_uid_storage_fetch(aTHX_ (D))
1825 map = MY_CXT.uid_storage.map;
1826 alloc = MY_CXT.uid_storage.alloc;
1828 if (depth >= alloc) {
1831 Renew(map, depth + 1, su_uid *);
1832 for (i = alloc; i <= depth; ++i)
1835 MY_CXT.uid_storage.map = map;
1836 MY_CXT.uid_storage.alloc = depth + 1;
1842 Newx(uid, 1, su_uid);
1848 if (depth >= MY_CXT.uid_storage.used)
1849 MY_CXT.uid_storage.used = depth + 1;
1854 STATIC int su_uid_storage_check(pTHX_ UV depth, UV seq) {
1855 #define su_uid_storage_check(D, S) su_uid_storage_check(aTHX_ (D), (S))
1859 if (depth >= MY_CXT.uid_storage.used)
1862 uid = MY_CXT.uid_storage.map[depth];
1864 return uid && (uid->seq == seq) && (uid->flags & SU_UID_ACTIVE);
1867 STATIC void su_uid_drop(pTHX_ void *ud_) {
1870 uid->flags &= ~SU_UID_ACTIVE;
1873 STATIC void su_uid_bump(pTHX_ void *ud_) {
1874 su_ud_reap *ud = ud_;
1876 SAVEDESTRUCTOR_X(su_uid_drop, ud->cb);
1879 STATIC SV *su_uid_get(pTHX_ I32 cxix) {
1880 #define su_uid_get(I) su_uid_get(aTHX_ (I))
1885 depth = su_uid_depth(cxix);
1886 uid = su_uid_storage_fetch(depth);
1888 if (!(uid->flags & SU_UID_ACTIVE)) {
1891 uid->seq = su_uid_seq_next(depth);
1892 uid->flags |= SU_UID_ACTIVE;
1894 Newx(ud, 1, su_ud_reap);
1895 SU_UD_ORIGIN(ud) = NULL;
1896 SU_UD_HANDLER(ud) = su_uid_bump;
1897 ud->cb = (SV *) uid;
1898 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
1901 uid_sv = sv_newmortal();
1902 sv_setpvf(uid_sv, "%"UVuf"-%"UVuf, depth, uid->seq);
1908 #define su_grok_number(S, L, VP) grok_number((S), (L), (VP))
1910 #else /* grok_number */
1912 #define IS_NUMBER_IN_UV 0x1
1914 STATIC int su_grok_number(pTHX_ const char *s, STRLEN len, UV *valuep) {
1915 #define su_grok_number(S, L, VP) su_grok_number(aTHX_ (S), (L), (VP))
1919 /* This crude check should be good enough for a fallback implementation.
1920 * Better be too strict than too lax. */
1921 for (i = 0; i < len; ++i) {
1926 tmpsv = sv_newmortal();
1927 sv_setpvn(tmpsv, s, len);
1928 *valuep = sv_2uv(tmpsv);
1930 return IS_NUMBER_IN_UV;
1933 #endif /* !grok_number */
1935 STATIC int su_uid_validate(pTHX_ SV *uid) {
1936 #define su_uid_validate(U) su_uid_validate(aTHX_ (U))
1942 s = SvPV_const(uid, len);
1944 while (p < len && s[p] != '-')
1947 croak("UID contains only one part");
1949 type = su_grok_number(s, p, &depth);
1950 if (type != IS_NUMBER_IN_UV)
1951 croak("First UID part is not an unsigned integer");
1953 ++p; /* Skip '-'. As we used to have p < len, len - (p + 1) >= 0. */
1955 type = su_grok_number(s + p, len - p, &seq);
1956 if (type != IS_NUMBER_IN_UV)
1957 croak("Second UID part is not an unsigned integer");
1959 return su_uid_storage_check(depth, seq);
1962 /* --- Context operations -------------------------------------------------- */
1964 /* Remove sequences of BLOCKs having DB for stash, followed by a SUB context
1965 * for the debugger callback. */
1967 STATIC I32 su_context_skip_db(pTHX_ I32 cxix) {
1968 #define su_context_skip_db(C) su_context_skip_db(aTHX_ (C))
1974 for (i = cxix; i > 0; --i) {
1975 PERL_CONTEXT *cx = cxstack + i;
1977 switch (CxTYPE(cx)) {
1979 if (cx->blk_oldcop && CopSTASH(cx->blk_oldcop) == GvSTASH(PL_DBgv))
1983 if (cx->blk_sub.cv == GvCV(PL_DBsub)) {
1999 STATIC I32 su_context_normalize_up(pTHX_ I32 cxix) {
2000 #define su_context_normalize_up(C) su_context_normalize_up(aTHX_ (C))
2006 cx = cxstack + cxix;
2007 if (CxTYPE(cx) == CXt_BLOCK) {
2008 PERL_CONTEXT *prev = cx - 1;
2010 switch (CxTYPE(prev)) {
2011 #if SU_HAS_PERL(5, 10, 0)
2015 #if SU_HAS_PERL(5, 11, 0)
2016 /* That's the only subcategory that can cause an extra BLOCK context */
2017 case CXt_LOOP_PLAIN:
2021 if (cx->blk_oldcop == prev->blk_oldcop)
2025 if (cx->blk_oldcop && cx->blk_oldcop->op_sibling
2026 && cx->blk_oldcop->op_sibling->op_type == OP_SUBST)
2035 STATIC I32 su_context_normalize_down(pTHX_ I32 cxix) {
2036 #define su_context_normalize_down(C) su_context_normalize_down(aTHX_ (C))
2039 if (cxix >= cxstack_ix)
2042 next = cxstack + cxix + 1;
2043 if (CxTYPE(next) == CXt_BLOCK) {
2044 PERL_CONTEXT *cx = next - 1;
2046 switch (CxTYPE(cx)) {
2047 #if SU_HAS_PERL(5, 10, 0)
2051 #if SU_HAS_PERL(5, 11, 0)
2052 /* That's the only subcategory that can cause an extra BLOCK context */
2053 case CXt_LOOP_PLAIN:
2057 if (cx->blk_oldcop == next->blk_oldcop)
2061 if (next->blk_oldcop && next->blk_oldcop->op_sibling
2062 && next->blk_oldcop->op_sibling->op_type == OP_SUBST)
2071 #define su_context_here() su_context_normalize_up(su_context_skip_db(cxstack_ix))
2073 /* --- Interpreter setup/teardown ------------------------------------------ */
2075 STATIC void su_teardown(pTHX_ void *param) {
2080 map = MY_CXT.uid_storage.map;
2083 for (i = 0; i < MY_CXT.uid_storage.used; ++i)
2088 cur = MY_CXT.uplevel_storage.root;
2090 su_uplevel_ud *prev;
2094 su_uplevel_ud_delete(prev);
2101 STATIC void su_setup(pTHX) {
2102 #define su_setup() su_setup(aTHX)
2105 MY_CXT.stack_placeholder = NULL;
2107 /* NewOp() calls calloc() which just zeroes the memory with memset(). */
2108 Zero(&(MY_CXT.unwind_storage.return_op), 1, LISTOP);
2109 MY_CXT.unwind_storage.return_op.op_type = OP_RETURN;
2110 MY_CXT.unwind_storage.return_op.op_ppaddr = PL_ppaddr[OP_RETURN];
2112 Zero(&(MY_CXT.unwind_storage.proxy_op), 1, OP);
2113 MY_CXT.unwind_storage.proxy_op.op_type = OP_STUB;
2114 MY_CXT.unwind_storage.proxy_op.op_ppaddr = NULL;
2116 Zero(&(MY_CXT.yield_storage.leave_op), 1, UNOP);
2117 MY_CXT.yield_storage.leave_op.op_type = OP_STUB;
2118 MY_CXT.yield_storage.leave_op.op_ppaddr = NULL;
2120 Zero(&(MY_CXT.yield_storage.proxy_op), 1, OP);
2121 MY_CXT.yield_storage.proxy_op.op_type = OP_STUB;
2122 MY_CXT.yield_storage.proxy_op.op_ppaddr = NULL;
2124 MY_CXT.uplevel_storage.top = NULL;
2125 MY_CXT.uplevel_storage.root = NULL;
2126 MY_CXT.uplevel_storage.count = 0;
2128 MY_CXT.uid_storage.map = NULL;
2129 MY_CXT.uid_storage.used = 0;
2130 MY_CXT.uid_storage.alloc = 0;
2132 call_atexit(su_teardown, NULL);
2137 /* --- XS ------------------------------------------------------------------ */
2139 #define SU_GET_CONTEXT(A, B, D) \
2148 else if (cxix > cxstack_ix) \
2156 #define SU_GET_LEVEL(A, B) \
2162 level = SvIV(lsv); \
2169 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
2171 XS(XS_Scope__Upper_unwind) {
2180 PERL_UNUSED_VAR(cv); /* -W */
2181 PERL_UNUSED_VAR(ax); /* -Wall */
2183 SU_GET_CONTEXT(0, items - 1, cxstack_ix);
2185 PERL_CONTEXT *cx = cxstack + cxix;
2186 switch (CxTYPE(cx)) {
2188 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2192 MY_CXT.unwind_storage.cxix = cxix;
2193 MY_CXT.unwind_storage.items = items;
2194 MY_CXT.unwind_storage.savesp = PL_stack_sp;
2196 MY_CXT.unwind_storage.items--;
2197 MY_CXT.unwind_storage.savesp--;
2199 /* pp_entersub will want to sanitize the stack after returning from there
2200 * Screw that, we're insane!
2201 * dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
2202 if (GIMME_V == G_SCALAR)
2203 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2204 SAVEDESTRUCTOR_X(su_unwind, NULL);
2209 } while (--cxix >= 0);
2210 croak("Can't return outside a subroutine");
2213 XS(XS_Scope__Upper_yield); /* prototype to pass -Wmissing-prototypes */
2215 XS(XS_Scope__Upper_yield) {
2224 PERL_UNUSED_VAR(cv); /* -W */
2225 PERL_UNUSED_VAR(ax); /* -Wall */
2227 SU_GET_CONTEXT(0, items - 1, su_context_here());
2228 MY_CXT.yield_storage.cxix = cxix;
2229 MY_CXT.yield_storage.items = items;
2230 MY_CXT.yield_storage.savesp = PL_stack_sp;
2232 MY_CXT.yield_storage.items--;
2233 MY_CXT.yield_storage.savesp--;
2235 /* See XS_Scope__Upper_unwind */
2236 if (GIMME_V == G_SCALAR)
2237 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
2238 SAVEDESTRUCTOR_X(su_yield, NULL);
2242 MODULE = Scope::Upper PACKAGE = Scope::Upper
2250 MUTEX_INIT(&su_uid_seq_counter_mutex);
2252 su_uid_seq_counter.seqs = NULL;
2253 su_uid_seq_counter.size = 0;
2255 stash = gv_stashpv(__PACKAGE__, 1);
2256 newCONSTSUB(stash, "TOP", newSViv(0));
2257 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
2259 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
2260 newXSproto("Scope::Upper::yield", XS_Scope__Upper_yield, file, NULL);
2271 su_uid_storage new_cxt;
2278 su_uid_storage_dup(&new_cxt, &MY_CXT.uid_storage, MY_CXT.uid_storage.used);
2282 MY_CXT.uplevel_storage.top = NULL;
2283 MY_CXT.uplevel_storage.root = NULL;
2284 MY_CXT.uplevel_storage.count = 0;
2285 MY_CXT.uid_storage = new_cxt;
2289 #endif /* SU_THREADSAFE */
2297 cxix = su_context_here();
2308 SU_GET_CONTEXT(0, 0, su_context_here());
2311 cxix = su_context_skip_db(cxix);
2312 cxix = su_context_normalize_up(cxix);
2324 SU_GET_CONTEXT(0, 0, cxstack_ix);
2326 for (; cxix >= 0; --cxix) {
2327 PERL_CONTEXT *cx = cxstack + cxix;
2328 switch (CxTYPE(cx)) {
2332 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2346 SU_GET_CONTEXT(0, 0, cxstack_ix);
2348 for (; cxix >= 0; --cxix) {
2349 PERL_CONTEXT *cx = cxstack + cxix;
2350 switch (CxTYPE(cx)) {
2367 cxix = su_context_here();
2368 while (--level >= 0) {
2372 cxix = su_context_skip_db(cxix);
2373 cxix = su_context_normalize_up(cxix);
2386 for (cxix = cxstack_ix; cxix > 0; --cxix) {
2387 PERL_CONTEXT *cx = cxstack + cxix;
2388 switch (CxTYPE(cx)) {
2390 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2410 SU_GET_CONTEXT(0, 0, cxstack_ix);
2413 PERL_CONTEXT *cx = cxstack + cxix--;
2414 switch (CxTYPE(cx)) {
2416 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2420 I32 gimme = cx->blk_gimme;
2422 case G_VOID: XSRETURN_UNDEF; break;
2423 case G_SCALAR: XSRETURN_NO; break;
2424 case G_ARRAY: XSRETURN_YES; break;
2439 SU_GET_CONTEXT(1, 1, su_context_skip_db(cxstack_ix));
2440 cxix = su_context_normalize_down(cxix);
2441 Newx(ud, 1, su_ud_reap);
2442 SU_UD_ORIGIN(ud) = NULL;
2443 SU_UD_HANDLER(ud) = su_reap;
2444 ud->cb = newSVsv(hook);
2445 su_init(ud, cxix, SU_SAVE_DESTRUCTOR_SIZE);
2448 localize(SV *sv, SV *val, ...)
2455 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2456 cxix = su_context_normalize_down(cxix);
2457 Newx(ud, 1, su_ud_localize);
2458 SU_UD_ORIGIN(ud) = NULL;
2459 SU_UD_HANDLER(ud) = su_localize;
2460 size = su_ud_localize_init(ud, sv, val, NULL);
2461 su_init(ud, cxix, size);
2464 localize_elem(SV *sv, SV *elem, SV *val, ...)
2471 if (SvTYPE(sv) >= SVt_PVGV)
2472 croak("Can't infer the element localization type from a glob and the value");
2473 SU_GET_CONTEXT(3, 3, su_context_skip_db(cxstack_ix));
2474 cxix = su_context_normalize_down(cxix);
2475 Newx(ud, 1, su_ud_localize);
2476 SU_UD_ORIGIN(ud) = NULL;
2477 SU_UD_HANDLER(ud) = su_localize;
2478 size = su_ud_localize_init(ud, sv, val, elem);
2479 if (ud->type != SVt_PVAV && ud->type != SVt_PVHV) {
2480 SU_UD_LOCALIZE_FREE(ud);
2481 croak("Can't localize an element of something that isn't an array or a hash");
2483 su_init(ud, cxix, size);
2486 localize_delete(SV *sv, SV *elem, ...)
2493 SU_GET_CONTEXT(2, 2, su_context_skip_db(cxstack_ix));
2494 cxix = su_context_normalize_down(cxix);
2495 Newx(ud, 1, su_ud_localize);
2496 SU_UD_ORIGIN(ud) = NULL;
2497 SU_UD_HANDLER(ud) = su_localize;
2498 size = su_ud_localize_init(ud, sv, NULL, elem);
2499 su_init(ud, cxix, size);
2502 uplevel(SV *code, ...)
2505 I32 cxix, ret, args = 0;
2509 if (SvTYPE(code) < SVt_PVCV)
2510 croak("First argument to uplevel must be a code reference");
2511 SU_GET_CONTEXT(1, items - 1, cxstack_ix);
2513 PERL_CONTEXT *cx = cxstack + cxix;
2514 switch (CxTYPE(cx)) {
2516 croak("Can't uplevel to an eval frame");
2518 croak("Can't uplevel to a format frame");
2520 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
2526 /* su_uplevel() takes care of extending the stack if needed. */
2527 ret = su_uplevel((CV *) code, cxix, args);
2532 } while (--cxix >= 0);
2533 croak("Can't uplevel outside a subroutine");
2542 SU_GET_CONTEXT(0, 0, su_context_here());
2543 uid = su_uid_get(cxix);
2549 validate_uid(SV *uid)
2554 ret = su_uid_validate(uid) ? &PL_sv_yes : &PL_sv_no;