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 gv_fetchpvn_flags
52 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
55 #ifndef PERL_MAGIC_tied
56 # define PERL_MAGIC_tied 'P'
59 #ifndef PERL_MAGIC_env
60 # define PERL_MAGIC_env 'E'
63 #ifndef NEGATIVE_INDICES_VAR
64 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
67 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
69 /* --- Threads and multiplicity -------------------------------------------- */
79 #ifndef SU_MULTIPLICITY
80 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
81 # define SU_MULTIPLICITY 1
83 # define SU_MULTIPLICITY 0
86 #if SU_MULTIPLICITY && !defined(tTHX)
87 # define tTHX PerlInterpreter*
90 #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))
91 # define SU_THREADSAFE 1
93 # define MY_CXT_CLONE \
95 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
96 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
97 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
100 # define SU_THREADSAFE 0
102 # define dMY_CXT dNOOP
104 # define MY_CXT su_globaldata
106 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
108 # define MY_CXT_INIT NOOP
110 # define MY_CXT_CLONE NOOP
113 /* --- Stack manipulations ------------------------------------------------- */
115 #ifndef SvCANEXISTDELETE
116 # define SvCANEXISTDELETE(sv) \
118 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
119 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
120 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
121 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
126 /* ... Saving array elements ............................................... */
128 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
129 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
135 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
136 #if SU_HAS_PERL(5, 8, 1)
137 if (SvRMAGICAL(av)) {
138 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
140 SV * const * const negative_indices_glob =
141 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
142 NEGATIVE_INDICES_VAR, 16, 0);
143 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
149 idx = key + av_len(av) + 1;
163 STATIC void su_adelete(pTHX_ void *ud_) {
164 su_ud_adelete *ud = (su_ud_adelete *) ud_;
166 av_delete(ud->av, ud->idx, G_DISCARD);
167 SvREFCNT_dec(ud->av);
172 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
173 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
176 Newx(ud, 1, su_ud_adelete);
181 SAVEDESTRUCTOR_X(su_adelete, ud);
184 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
186 #endif /* SAVEADELETE */
188 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
189 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
196 idx = su_av_key2idx(av, SvIV(key));
198 if (SvCANEXISTDELETE(av))
199 preeminent = av_exists(av, idx);
201 svp = av_fetch(av, idx, 1);
202 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
205 save_aelem(av, idx, svp);
207 SAVEADELETE(av, idx);
209 if (val) { /* local $x[$idx] = $val; */
210 SvSetMagicSV(*svp, val);
211 } else { /* local $x[$idx]; delete $x[$idx]; */
212 av_delete(av, idx, G_DISCARD);
216 /* ... Saving hash elements ................................................ */
218 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
219 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
226 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
227 preeminent = hv_exists_ent(hv, keysv, 0);
229 he = hv_fetch_ent(hv, keysv, 1, 0);
230 svp = he ? &HeVAL(he) : NULL;
231 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
233 if (HvNAME_get(hv) && isGV(*svp)) {
234 save_gp((GV *) *svp, 0);
239 save_helem(hv, keysv, svp);
242 const char * const key = SvPV_const(keysv, keylen);
243 SAVEDELETE(hv, savepvn(key, keylen),
244 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
247 if (val) { /* local $x{$keysv} = $val; */
248 SvSetMagicSV(*svp, val);
249 } else { /* local $x{$keysv}; delete $x{$keysv}; */
250 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
254 /* --- Actions ------------------------------------------------------------- */
259 void (*handler)(pTHX_ void *);
262 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
263 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
264 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
266 #define SU_UD_FREE(U) STMT_START { \
267 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
271 /* ... Reap ................................................................ */
278 STATIC void su_call(pTHX_ void *ud_) {
279 su_ud_reap *ud = (su_ud_reap *) ud_;
280 #if SU_HAS_PERL(5, 9, 5)
281 PERL_CONTEXT saved_cx;
282 I32 dieing = PL_op->op_type == OP_DIE;
289 PerlIO_printf(Perl_debug_log,
290 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
291 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
300 /* If the recently popped context isn't saved there, it will be overwritten by
301 * the sub scope from call_sv, although it's still needed in our caller. */
303 #if SU_HAS_PERL(5, 9, 5)
305 if (cxstack_ix < cxstack_max)
306 cxix = cxstack_ix + 1;
308 cxix = Perl_cxinc(aTHX);
309 saved_cx = cxstack[cxix];
313 call_sv(ud->cb, G_VOID);
315 #if SU_HAS_PERL(5, 9, 5)
317 cxstack[cxix] = saved_cx;
325 SvREFCNT_dec(ud->cb);
329 STATIC void su_reap(pTHX_ void *ud) {
330 #define su_reap(U) su_reap(aTHX_ (U))
332 PerlIO_printf(Perl_debug_log,
333 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
334 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
337 SAVEDESTRUCTOR_X(su_call, ud);
340 /* ... Localize & localize array/hash element .............................. */
350 STATIC void su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
351 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
357 if (SvTYPE(sv) >= SVt_PVGV) {
358 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
360 } else { /* local *x = \$val; */
361 t = SvTYPE(SvRV(val));
366 const char *p = SvPV_const(sv, len), *s;
367 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
373 case '$': t = SVt_PV; break;
374 case '@': t = SVt_PVAV; break;
375 case '%': t = SVt_PVHV; break;
376 case '&': t = SVt_PVCV; break;
377 case '*': t = SVt_PVGV; break;
382 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
383 if (SvROK(val) && !sv_isobject(val)) {
384 t = SvTYPE(SvRV(val));
402 /* When deref is set, val isn't NULL */
405 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
406 ud->elem = SvREFCNT_inc(elem);
410 STATIC void su_localize(pTHX_ void *ud_) {
411 #define su_localize(U) su_localize(aTHX_ (U))
412 su_ud_localize *ud = (su_ud_localize *) ud_;
419 if (SvTYPE(sv) >= SVt_PVGV) {
423 gv = gv_fetchsv(sv, GV_ADDMULTI, SVt_PVGV);
426 const char *name = SvPV_const(sv, len);
427 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, SVt_PVGV);
434 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
435 PerlIO_printf(Perl_debug_log,
436 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
437 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
441 /* Inspired from Alias.pm */
445 su_save_aelem(GvAV(gv), elem, val);
452 su_save_helem(GvHV(gv), elem, val);
458 save_gp(gv, 1); /* hide previous entry in symtab */
465 gv = (GV *) save_scalar(gv);
470 SvSetMagicSV((SV *) gv, val);
473 SvREFCNT_dec(ud->elem);
474 SvREFCNT_dec(ud->val);
475 SvREFCNT_dec(ud->sv);
479 /* --- Pop a context back -------------------------------------------------- */
483 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
485 # define SU_CXNAME "XXX"
489 STATIC void su_pop(pTHX_ void *ud) {
490 #define su_pop(U) su_pop(aTHX_ (U))
491 I32 depth, base, mark, *origin;
492 depth = SU_UD_DEPTH(ud);
495 PerlIO_printf(Perl_debug_log,
497 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
499 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
502 origin = SU_UD_ORIGIN(ud);
503 mark = origin[depth];
504 base = origin[depth - 1];
506 SU_D(PerlIO_printf(Perl_debug_log,
507 "%p: original scope was %*c top=%2d base=%2d\n",
508 ud, 24, ' ', mark, base));
511 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
512 PL_savestack_ix = mark;
515 PL_savestack_ix = base;
517 SU_UD_DEPTH(ud) = --depth;
522 SAVEDESTRUCTOR_X(su_pop, ud);
524 /* Skip depths corresponding to scopes for which leave_scope() might not be
526 while (depth > 1 && PL_scopestack_ix >= i) {
527 I32 j = PL_scopestack[PL_scopestack_ix - i];
529 if (j < PL_savestack_ix)
532 SU_D(PerlIO_printf(Perl_debug_log,
533 "%p: skip scope%*cat depth=%2d scope_ix=%2d new_top=%2d >= cur_base=%2d\n",
534 ud, 6, ' ', depth, PL_scopestack_ix - i, j, PL_savestack_ix));
536 SU_UD_DEPTH(ud) = --depth;
541 SU_D(PerlIO_printf(Perl_debug_log,
542 "%p: set destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
543 ud, depth, PL_scopestack_ix, PL_savestack_ix));
545 SU_UD_HANDLER(ud)(aTHX_ ud);
548 SU_D(PerlIO_printf(Perl_debug_log,
549 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
550 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
553 /* --- Global data --------------------------------------------------------- */
555 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
558 int stack_placeholder;
567 /* --- Initialize the stack and the action userdata ------------------------ */
569 STATIC I32 su_init(pTHX_ I32 cxix, void *ud, I32 size) {
570 #define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
571 I32 i, depth = 1, *origin;
573 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
575 for (i = cxstack_ix; i > cxix; --i) {
576 PERL_CONTEXT *cx = cxstack + i;
577 switch (CxTYPE(cx)) {
578 #if SU_HAS_PERL(5, 10, 0)
580 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
581 /* Given and when blocks are actually followed by a simple block, so skip
583 if (cxix > 0) { /* Implies i > 0 */
584 PERL_CONTEXT *next = cx - 1;
585 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
591 #if SU_HAS_PERL(5, 11, 0)
594 case CXt_LOOP_LAZYSV:
595 case CXt_LOOP_LAZYIV:
599 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
603 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
608 SU_D(PerlIO_printf(Perl_debug_log, "%p: depth is %d\n", ud, depth));
610 Newx(origin, depth + 1, I32);
611 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
612 PL_scopestack[PL_scopestack_ix - depth] += size;
613 for (i = depth - 1; i >= 1; --i) {
614 I32 j = PL_scopestack_ix - i;
615 origin[depth - i] = PL_scopestack[j];
616 PL_scopestack[j] += 3;
618 origin[depth] = PL_savestack_ix;
620 SU_UD_ORIGIN(ud) = origin;
621 SU_UD_DEPTH(ud) = depth;
623 SU_D(PerlIO_printf(Perl_debug_log,
624 "%p: set original destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
625 ud, depth, PL_scopestack_ix - 1, PL_savestack_ix));
627 /* Make sure the first destructor fires by pushing enough fake slots on the
629 if (PL_savestack_ix + 3 <= PL_scopestack[PL_scopestack_ix - 1]) {
632 save_int(&MY_CXT.stack_placeholder);
633 } while (PL_savestack_ix + 3 <= PL_scopestack[PL_scopestack_ix - 1]);
636 SAVEDESTRUCTOR_X(su_pop, ud);
639 for (i = 0; i <= depth; ++i) {
640 I32 j = PL_scopestack_ix - i;
641 PerlIO_printf(Perl_debug_log,
642 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
643 ud, i, j, origin[depth - i],
644 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
651 /* --- Unwind stack -------------------------------------------------------- */
653 STATIC void su_unwind(pTHX_ void *ud_) {
655 I32 cxix = MY_CXT.cxix;
656 I32 items = MY_CXT.items - 1;
657 SV **savesp = MY_CXT.savesp;
660 PERL_UNUSED_VAR(ud_);
663 PL_stack_sp = savesp;
665 if (cxstack_ix > cxix)
672 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
673 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
677 PerlIO_printf(Perl_debug_log,
678 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
680 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
681 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
684 PL_op = PL_ppaddr[OP_RETURN](aTHX);
685 *PL_markstack_ptr = mark;
687 MY_CXT.fakeop.op_next = PL_op;
688 PL_op = &(MY_CXT.fakeop);
691 /* --- XS ------------------------------------------------------------------ */
693 #if SU_HAS_PERL(5, 8, 9)
694 # define SU_SKIP_DB_MAX 2
696 # define SU_SKIP_DB_MAX 3
699 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
700 * followed by a DB sub */
702 #define SU_SKIP_DB(C) \
705 PERL_CONTEXT *cx = cxstack + (C); \
707 if (CxTYPE(cx) == CXt_BLOCK && (C) >= i) { \
709 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.cv == GvCV(PL_DBsub)) { \
715 } while (++i <= SU_SKIP_DB_MAX); \
718 #define SU_GET_CONTEXT(A, B) \
727 else if (cxix > cxstack_ix) \
737 #define SU_GET_LEVEL(A, B) \
750 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
752 XS(XS_Scope__Upper_unwind) {
761 PERL_UNUSED_VAR(cv); /* -W */
762 PERL_UNUSED_VAR(ax); /* -Wall */
764 SU_GET_CONTEXT(0, items - 1);
766 PERL_CONTEXT *cx = cxstack + cxix;
767 switch (CxTYPE(cx)) {
769 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
774 MY_CXT.items = items;
775 /* pp_entersub will want to sanitize the stack after returning from there
776 * Screw that, we're insane */
777 if (GIMME_V == G_SCALAR) {
778 MY_CXT.savesp = PL_stack_sp;
779 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
780 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
782 MY_CXT.savesp = NULL;
784 SAVEDESTRUCTOR_X(su_unwind, NULL);
789 } while (--cxix >= 0);
790 croak("Can't return outside a subroutine");
793 MODULE = Scope::Upper PACKAGE = Scope::Upper
802 MY_CXT.stack_placeholder = 0;
804 stash = gv_stashpv(__PACKAGE__, 1);
805 newCONSTSUB(stash, "TOP", newSViv(0));
806 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
808 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
817 PERL_UNUSED_VAR(items);
822 #endif /* SU_THREADSAFE */
828 I32 cxix = cxstack_ix;
832 RETVAL = newSViv(cxix);
842 SU_GET_CONTEXT(0, 0);
847 RETVAL = newSViv(cxix);
857 SU_GET_CONTEXT(0, 0);
858 for (; cxix >= 0; --cxix) {
859 PERL_CONTEXT *cx = cxstack + cxix;
860 switch (CxTYPE(cx)) {
864 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
866 ST(0) = sv_2mortal(newSViv(cxix));
878 SU_GET_CONTEXT(0, 0);
879 for (; cxix >= 0; --cxix) {
880 PERL_CONTEXT *cx = cxstack + cxix;
881 switch (CxTYPE(cx)) {
885 ST(0) = sv_2mortal(newSViv(cxix));
912 ST(0) = sv_2mortal(newSViv(cxix));
922 for (cxix = cxstack_ix; cxix > 0; --cxix) {
923 PERL_CONTEXT *cx = cxstack + cxix;
924 switch (CxTYPE(cx)) {
926 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
936 ST(0) = sv_2mortal(newSViv(cxix));
945 SU_GET_CONTEXT(0, 0);
947 PERL_CONTEXT *cx = cxstack + cxix--;
948 switch (CxTYPE(cx)) {
952 I32 gimme = cx->blk_gimme;
954 case G_VOID: XSRETURN_UNDEF; break;
955 case G_SCALAR: XSRETURN_NO; break;
956 case G_ARRAY: XSRETURN_YES; break;
971 SU_GET_CONTEXT(1, 1);
972 Newx(ud, 1, su_ud_reap);
973 SU_UD_ORIGIN(ud) = NULL;
974 SU_UD_HANDLER(ud) = su_reap;
975 ud->cb = newSVsv(hook);
976 su_init(cxix, ud, 3);
979 localize(SV *sv, SV *val, ...)
986 SU_GET_CONTEXT(2, 2);
987 Newx(ud, 1, su_ud_localize);
988 SU_UD_ORIGIN(ud) = NULL;
989 SU_UD_HANDLER(ud) = su_localize;
990 su_ud_localize_init(ud, sv, val, NULL);
991 #if !SU_HAS_PERL(5, 8, 9)
992 if (ud->type >= SVt_PVGV)
995 su_init(cxix, ud, size);
998 localize_elem(SV *sv, SV *elem, SV *val, ...)
1004 SU_GET_CONTEXT(3, 3);
1005 Newx(ud, 1, su_ud_localize);
1006 SU_UD_ORIGIN(ud) = NULL;
1007 SU_UD_HANDLER(ud) = su_localize;
1008 su_ud_localize_init(ud, sv, val, elem);
1009 su_init(cxix, ud, 4);
1012 localize_delete(SV *sv, SV *elem, ...)
1019 SU_GET_CONTEXT(2, 2);
1020 Newx(ud, 1, su_ud_localize);
1021 SU_UD_ORIGIN(ud) = NULL;
1022 SU_UD_HANDLER(ud) = su_localize;
1023 su_ud_localize_init(ud, sv, NULL, elem);
1024 #if !SU_HAS_PERL(5, 8, 9)
1025 if (ud->type >= SVt_PVGV)
1028 su_init(cxix, ud, size);