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 ------------------------------------------------------- */
17 #ifndef PERL_UNUSED_VAR
18 # define PERL_UNUSED_VAR(V)
22 # define STMT_START do
26 # define STMT_END while (0)
30 # define SU_D(X) STMT_START X STMT_END
36 # define Newx(v, n, c) New(0, v, n, c)
40 # define SvPV_const(S, L) SvPV(S, L)
43 #ifndef SvPV_nolen_const
44 # define SvPV_nolen_const(S) SvPV_nolen(S)
48 # define HvNAME_get(H) HvNAME(H)
51 #ifndef ENTER_with_name
52 # define ENTER_with_name(N) ENTER
55 #ifndef LEAVE_with_name
56 # define LEAVE_with_name(N) LEAVE
59 #ifndef gv_fetchpvn_flags
60 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
63 #ifndef PERL_MAGIC_tied
64 # define PERL_MAGIC_tied 'P'
67 #ifndef PERL_MAGIC_env
68 # define PERL_MAGIC_env 'E'
71 #ifndef NEGATIVE_INDICES_VAR
72 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
75 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
77 /* --- Threads and multiplicity -------------------------------------------- */
87 #ifndef SU_MULTIPLICITY
88 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
89 # define SU_MULTIPLICITY 1
91 # define SU_MULTIPLICITY 0
94 #if SU_MULTIPLICITY && !defined(tTHX)
95 # define tTHX PerlInterpreter*
98 #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))
99 # define SU_THREADSAFE 1
100 # ifndef MY_CXT_CLONE
101 # define MY_CXT_CLONE \
103 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
104 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
105 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
108 # define SU_THREADSAFE 0
110 # define dMY_CXT dNOOP
112 # define MY_CXT su_globaldata
114 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
116 # define MY_CXT_INIT NOOP
118 # define MY_CXT_CLONE NOOP
121 /* --- Stack manipulations ------------------------------------------------- */
123 #ifndef SvCANEXISTDELETE
124 # define SvCANEXISTDELETE(sv) \
126 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
127 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
128 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
129 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
134 /* ... Saving array elements ............................................... */
136 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
137 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
143 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
144 #if SU_HAS_PERL(5, 8, 1)
145 if (SvRMAGICAL(av)) {
146 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
148 SV * const * const negative_indices_glob =
149 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
150 NEGATIVE_INDICES_VAR, 16, 0);
151 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
157 idx = key + av_len(av) + 1;
171 STATIC void su_adelete(pTHX_ void *ud_) {
172 su_ud_adelete *ud = (su_ud_adelete *) ud_;
174 av_delete(ud->av, ud->idx, G_DISCARD);
175 SvREFCNT_dec(ud->av);
180 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
181 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
184 Newx(ud, 1, su_ud_adelete);
189 SAVEDESTRUCTOR_X(su_adelete, ud);
192 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
194 #endif /* SAVEADELETE */
196 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
197 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
204 idx = su_av_key2idx(av, SvIV(key));
206 if (SvCANEXISTDELETE(av))
207 preeminent = av_exists(av, idx);
209 svp = av_fetch(av, idx, 1);
210 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
213 save_aelem(av, idx, svp);
215 SAVEADELETE(av, idx);
217 if (val) { /* local $x[$idx] = $val; */
218 SvSetMagicSV(*svp, val);
219 } else { /* local $x[$idx]; delete $x[$idx]; */
220 av_delete(av, idx, G_DISCARD);
224 /* ... Saving hash elements ................................................ */
226 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
227 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
234 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
235 preeminent = hv_exists_ent(hv, keysv, 0);
237 he = hv_fetch_ent(hv, keysv, 1, 0);
238 svp = he ? &HeVAL(he) : NULL;
239 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
241 if (HvNAME_get(hv) && isGV(*svp)) {
242 save_gp((GV *) *svp, 0);
247 save_helem(hv, keysv, svp);
250 const char * const key = SvPV_const(keysv, keylen);
251 SAVEDELETE(hv, savepvn(key, keylen),
252 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
255 if (val) { /* local $x{$keysv} = $val; */
256 SvSetMagicSV(*svp, val);
257 } else { /* local $x{$keysv}; delete $x{$keysv}; */
258 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
262 /* --- Actions ------------------------------------------------------------- */
267 void (*handler)(pTHX_ void *);
270 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
271 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
272 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
274 #define SU_UD_FREE(U) STMT_START { \
275 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
279 /* ... Reap ................................................................ */
286 STATIC void su_call(pTHX_ void *ud_) {
287 su_ud_reap *ud = (su_ud_reap *) ud_;
288 #if SU_HAS_PERL(5, 9, 5)
289 PERL_CONTEXT saved_cx;
290 I32 dieing = PL_op->op_type == OP_DIE;
297 PerlIO_printf(Perl_debug_log,
298 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
299 ud, ud, PL_scopestack_ix, PL_savestack_ix);
308 /* If the recently popped context isn't saved there, it will be overwritten by
309 * the sub scope from call_sv, although it's still needed in our caller. */
311 #if SU_HAS_PERL(5, 9, 5)
313 if (cxstack_ix < cxstack_max)
314 cxix = cxstack_ix + 1;
316 cxix = Perl_cxinc(aTHX);
317 saved_cx = cxstack[cxix];
321 call_sv(ud->cb, G_VOID);
323 #if SU_HAS_PERL(5, 9, 5)
325 cxstack[cxix] = saved_cx;
333 SvREFCNT_dec(ud->cb);
337 STATIC void su_reap(pTHX_ void *ud) {
338 #define su_reap(U) su_reap(aTHX_ (U))
340 PerlIO_printf(Perl_debug_log,
341 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
342 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
345 SAVEDESTRUCTOR_X(su_call, ud);
348 /* ... Localize & localize array/hash element .............................. */
357 STATIC void su_localize(pTHX_ void *ud_) {
358 #define su_localize(U) su_localize(aTHX_ (U))
359 su_ud_localize *ud = (su_ud_localize *) ud_;
367 if (SvTYPE(sv) >= SVt_PVGV) {
369 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
371 } else { /* local *x = \$val; */
372 t = SvTYPE(SvRV(val));
377 const char *p = SvPV_const(sv, len), *s;
378 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
384 case '$': t = SVt_PV; break;
385 case '@': t = SVt_PVAV; break;
386 case '%': t = SVt_PVHV; break;
387 case '&': t = SVt_PVCV; break;
388 case '*': t = SVt_PVGV; break;
393 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
394 if (SvROK(val) && !sv_isobject(val)) {
395 t = SvTYPE(SvRV(val));
401 gv = gv_fetchpvn_flags(s, l, GV_ADDMULTI, SVt_PVGV);
407 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
408 PerlIO_printf(Perl_debug_log,
409 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
410 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
414 /* Inspired from Alias.pm */
418 su_save_aelem(GvAV(gv), elem, val);
425 su_save_helem(GvHV(gv), elem, val);
431 save_gp(gv, 1); /* hide previous entry in symtab */
438 gv = (GV *) save_scalar(gv);
439 if (deref) /* val != NULL */
445 SvSetMagicSV((SV *) gv, val);
448 SvREFCNT_dec(ud->elem);
449 SvREFCNT_dec(ud->val);
450 SvREFCNT_dec(ud->sv);
454 /* --- Pop a context back -------------------------------------------------- */
458 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
460 # define SU_CXNAME "XXX"
464 STATIC void su_pop(pTHX_ void *ud) {
465 #define su_pop(U) su_pop(aTHX_ (U))
466 I32 depth, base, mark, *origin;
467 depth = SU_UD_DEPTH(ud);
470 PerlIO_printf(Perl_debug_log, "%p: --- pop a %s\n", ud, SU_CXNAME);
471 PerlIO_printf(Perl_debug_log,
472 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n", ud,
473 depth, PL_scopestack_ix, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]);
476 origin = SU_UD_ORIGIN(ud);
477 mark = origin[depth];
478 base = origin[depth - 1];
480 SU_D(PerlIO_printf(Perl_debug_log,
481 "%p: original scope was %*c top=%2d base=%2d\n",
482 ud, 20, ' ', mark, base));
485 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
486 PL_savestack_ix = mark;
489 PL_savestack_ix = base;
491 SU_UD_DEPTH(ud) = --depth;
494 SU_D(PerlIO_printf(Perl_debug_log,
495 "%p: set new destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
496 ud, depth, PL_scopestack_ix, PL_savestack_ix));
498 SAVEDESTRUCTOR_X(su_pop, ud);
500 SU_UD_HANDLER(ud)(aTHX_ ud);
503 SU_D(PerlIO_printf(Perl_debug_log,
504 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
505 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
508 /* --- Initialize the stack and the action userdata ------------------------ */
510 STATIC I32 su_init(pTHX_ I32 cxix, void *ud, I32 size) {
511 #define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
512 I32 i, depth = 0, *origin;
514 LEAVE_with_name("sub");
516 if (cxix >= cxstack_ix) {
517 SU_UD_HANDLER(ud)(aTHX_ ud);
521 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
523 for (i = cxstack_ix; i > cxix; --i) {
524 PERL_CONTEXT *cx = cxstack + i;
525 switch (CxTYPE(cx)) {
526 #if SU_HAS_PERL(5, 10, 0)
528 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
529 /* Given and when blocks are actually followed by a simple block, so skip
531 if (cxix > 0) { /* Implies i > 0 */
532 PERL_CONTEXT *next = cx - 1;
533 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
539 #if SU_HAS_PERL(5, 11, 0)
542 case CXt_LOOP_LAZYSV:
543 case CXt_LOOP_LAZYIV:
547 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
551 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
556 SU_D(PerlIO_printf(Perl_debug_log, "%p: depth is %d\n", ud, depth));
558 Newx(origin, depth + 1, I32);
559 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
560 PL_scopestack[PL_scopestack_ix - depth] += size;
561 for (i = depth - 1; i >= 1; --i) {
562 I32 j = PL_scopestack_ix - i;
563 origin[depth - i] = PL_scopestack[j];
564 PL_scopestack[j] += 3;
566 origin[depth] = PL_savestack_ix;
568 SU_UD_ORIGIN(ud) = origin;
569 SU_UD_DEPTH(ud) = depth;
571 SU_D(PerlIO_printf(Perl_debug_log,
572 "%p: set original destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
573 ud, depth, PL_scopestack_ix - 1, PL_savestack_ix));
575 SAVEDESTRUCTOR_X(su_pop, ud);
578 for (i = 0; i <= depth; ++i) {
579 I32 j = PL_scopestack_ix - i;
580 PerlIO_printf(Perl_debug_log,
581 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
582 ud, i, j, origin[depth - i],
583 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
588 ENTER_with_name("sub");
593 /* --- Global data --------------------------------------------------------- */
595 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
606 /* --- Unwind stack -------------------------------------------------------- */
608 STATIC void su_unwind(pTHX_ void *ud_) {
610 I32 cxix = MY_CXT.cxix;
611 I32 items = MY_CXT.items - 1;
612 SV **savesp = MY_CXT.savesp;
615 PERL_UNUSED_VAR(ud_);
618 PL_stack_sp = savesp;
620 if (cxstack_ix > cxix)
627 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
628 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
632 PerlIO_printf(Perl_debug_log,
633 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
635 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
636 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
639 PL_op = PL_ppaddr[OP_RETURN](aTHX);
640 *PL_markstack_ptr = mark;
642 MY_CXT.fakeop.op_next = PL_op;
643 PL_op = &(MY_CXT.fakeop);
646 /* --- XS ------------------------------------------------------------------ */
648 #if SU_HAS_PERL(5, 8, 9)
649 # define SU_SKIP_DB_MAX 2
651 # define SU_SKIP_DB_MAX 3
654 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
655 * followed by a DB sub */
657 #define SU_SKIP_DB(C) \
660 PERL_CONTEXT *cx = cxstack + (C); \
662 if (CxTYPE(cx) == CXt_BLOCK && (C) >= i) { \
664 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.cv == GvCV(PL_DBsub)) { \
670 } while (++i <= SU_SKIP_DB_MAX); \
673 #define SU_GET_CONTEXT(A, B) \
682 else if (cxix > cxstack_ix) \
692 #define SU_GET_LEVEL(A, B) \
705 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
707 XS(XS_Scope__Upper_unwind) {
716 PERL_UNUSED_VAR(cv); /* -W */
717 PERL_UNUSED_VAR(ax); /* -Wall */
719 SU_GET_CONTEXT(0, items - 1);
721 PERL_CONTEXT *cx = cxstack + cxix;
722 switch (CxTYPE(cx)) {
724 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
729 MY_CXT.items = items;
730 /* pp_entersub will want to sanitize the stack after returning from there
731 * Screw that, we're insane */
732 if (GIMME_V == G_SCALAR) {
733 MY_CXT.savesp = PL_stack_sp;
734 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
735 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
737 MY_CXT.savesp = NULL;
739 SAVEDESTRUCTOR_X(su_unwind, NULL);
744 } while (--cxix >= 0);
745 croak("Can't return outside a subroutine");
748 MODULE = Scope::Upper PACKAGE = Scope::Upper
756 stash = gv_stashpv(__PACKAGE__, 1);
757 newCONSTSUB(stash, "TOP", newSViv(0));
758 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
759 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
768 PERL_UNUSED_VAR(items);
773 #endif /* SU_THREADSAFE */
779 I32 cxix = cxstack_ix;
783 RETVAL = newSViv(cxix);
793 SU_GET_CONTEXT(0, 0);
798 RETVAL = newSViv(cxix);
808 SU_GET_CONTEXT(0, 0);
809 for (; cxix >= 0; --cxix) {
810 PERL_CONTEXT *cx = cxstack + cxix;
811 switch (CxTYPE(cx)) {
815 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
817 ST(0) = sv_2mortal(newSViv(cxix));
829 SU_GET_CONTEXT(0, 0);
830 for (; cxix >= 0; --cxix) {
831 PERL_CONTEXT *cx = cxstack + cxix;
832 switch (CxTYPE(cx)) {
836 ST(0) = sv_2mortal(newSViv(cxix));
863 ST(0) = sv_2mortal(newSViv(cxix));
873 for (cxix = cxstack_ix; cxix > 0; --cxix) {
874 PERL_CONTEXT *cx = cxstack + cxix;
875 switch (CxTYPE(cx)) {
877 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
887 ST(0) = sv_2mortal(newSViv(cxix));
896 SU_GET_CONTEXT(0, 0);
898 PERL_CONTEXT *cx = cxstack + cxix--;
899 switch (CxTYPE(cx)) {
903 I32 gimme = cx->blk_gimme;
905 case G_VOID: XSRETURN_UNDEF; break;
906 case G_SCALAR: XSRETURN_NO; break;
907 case G_ARRAY: XSRETURN_YES; break;
922 SU_GET_CONTEXT(1, 1);
923 Newx(ud, 1, su_ud_reap);
924 SU_UD_ORIGIN(ud) = NULL;
925 SU_UD_HANDLER(ud) = su_reap;
926 ud->cb = newSVsv(hook);
927 su_init(cxix, ud, 3);
930 localize(SV *sv, SV *val, ...)
936 SU_GET_CONTEXT(2, 2);
937 Newx(ud, 1, su_ud_localize);
938 SU_UD_ORIGIN(ud) = NULL;
939 SU_UD_HANDLER(ud) = su_localize;
942 ud->val = newSVsv(val);
944 su_init(cxix, ud, 3);
947 localize_elem(SV *sv, SV *elem, SV *val, ...)
953 SU_GET_CONTEXT(3, 3);
954 Newx(ud, 1, su_ud_localize);
955 SU_UD_ORIGIN(ud) = NULL;
956 SU_UD_HANDLER(ud) = su_localize;
959 ud->val = newSVsv(val);
962 su_init(cxix, ud, 4);
965 localize_delete(SV *sv, SV *elem, ...)
971 SU_GET_CONTEXT(2, 2);
972 Newx(ud, 1, su_ud_localize);
973 SU_UD_ORIGIN(ud) = NULL;
974 SU_UD_HANDLER(ud) = su_localize;
980 su_init(cxix, ud, 4);