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
13 /* --- Compatibility ------------------------------------------------------- */
16 # define STMT_START do
20 # define STMT_END while (0)
24 # define SU_D(X) STMT_START X STMT_END
30 # define Newx(v, n, c) New(0, v, n, c)
34 # define SvPV_const(S, L) SvPV(S, L)
37 #ifndef SvPV_nolen_const
38 # define SvPV_nolen_const(S) SvPV_nolen(S)
42 # define HvNAME_get(H) HvNAME(H)
45 #ifndef gv_fetchpvn_flags
46 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
49 #ifndef PERL_MAGIC_tied
50 # define PERL_MAGIC_tied 'P'
53 #ifndef PERL_MAGIC_env
54 # define PERL_MAGIC_env 'E'
57 #ifndef NEGATIVE_INDICES_VAR
58 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
61 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
63 /* --- Stack manipulations ------------------------------------------------- */
65 #ifndef SvCANEXISTDELETE
66 # define SvCANEXISTDELETE(sv) \
68 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
69 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
70 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
71 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
76 /* ... Saving array elements ............................................... */
78 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
79 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
85 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
86 #if SU_HAS_PERL(5, 8, 1)
88 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
91 SV * const * const negative_indices_glob =
92 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
93 NEGATIVE_INDICES_VAR, 16, 0);
94 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
100 idx = key + av_len(av) + 1;
114 STATIC void su_adelete(pTHX_ void *ud_) {
115 su_ud_adelete *ud = ud_;
117 av_delete(ud->av, ud->idx, G_DISCARD);
118 SvREFCNT_dec(ud->av);
123 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
124 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
127 Newx(ud, 1, su_ud_adelete);
132 SAVEDESTRUCTOR_X(su_adelete, ud);
135 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
137 #endif /* SAVEADELETE */
139 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
140 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
147 idx = su_av_key2idx(av, SvIV(key));
149 if (SvCANEXISTDELETE(av))
150 preeminent = av_exists(av, idx);
152 svp = av_fetch(av, idx, 1);
153 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
156 save_aelem(av, idx, svp);
158 SAVEADELETE(av, idx);
160 if (val) { /* local $x[$idx] = $val; */
161 SvSetMagicSV(*svp, val);
162 } else { /* local $x[$idx]; delete $x[$idx]; */
163 av_delete(av, idx, G_DISCARD);
167 /* ... Saving hash elements ................................................ */
169 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
170 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
177 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
178 preeminent = hv_exists_ent(hv, keysv, 0);
180 he = hv_fetch_ent(hv, keysv, 1, 0);
181 svp = he ? &HeVAL(he) : NULL;
182 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
184 if (HvNAME_get(hv) && isGV(*svp)) {
185 save_gp((GV *) *svp, 0);
190 save_helem(hv, keysv, svp);
193 const char * const key = SvPV_const(keysv, keylen);
194 SAVEDELETE(hv, savepvn(key, keylen),
195 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
198 if (val) { /* local $x{$keysv} = $val; */
199 SvSetMagicSV(*svp, val);
200 } else { /* local $x{$keysv}; delete $x{$keysv}; */
201 hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
205 /* --- Actions ------------------------------------------------------------- */
210 void (*handler)(pTHX_ void *);
213 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
214 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
215 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
217 #define SU_UD_FREE(U) STMT_START { \
218 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
222 /* ... Reap ................................................................ */
229 STATIC void su_call(pTHX_ void *ud_) {
230 su_ud_reap *ud = (su_ud_reap *) ud_;
231 #if SU_HAS_PERL(5, 10, 0)
232 I32 dieing = PL_op->op_type == OP_DIE;
237 SU_D(PerlIO_printf(Perl_debug_log, "%p: @@@ call at %d (save is %d)\n",
238 ud, PL_scopestack_ix, PL_savestack_ix));
245 /* If cxstack_ix isn't incremented there, the eval context will be overwritten
246 * when the new sub scope will be created in call_sv. */
248 #if SU_HAS_PERL(5, 10, 0)
250 if (cxstack_ix < cxstack_max)
253 cxstack_ix = Perl_cxinc(aTHX);
256 call_sv(ud->cb, G_VOID);
258 #if SU_HAS_PERL(5, 10, 0)
259 if (dieing && cxstack_ix > 0)
269 SvREFCNT_dec(ud->cb);
273 STATIC void su_reap(pTHX_ void *ud) {
274 #define su_reap(U) su_reap(aTHX_ (U))
275 SU_D(PerlIO_printf(Perl_debug_log, "%p: === reap at %d (save is %d)\n",
276 ud, PL_scopestack_ix, PL_savestack_ix));
277 SAVEDESTRUCTOR_X(su_call, ud);
278 SU_D(PerlIO_printf(Perl_debug_log, "%p: savestack is now at %d, base at %d\n",
280 PL_scopestack[PL_scopestack_ix]));
283 /* ... Localize & localize array/hash element .............................. */
292 STATIC void su_localize(pTHX_ void *ud_) {
293 #define su_localize(U) su_localize(aTHX_ (U))
294 su_ud_localize *ud = (su_ud_localize *) ud_;
302 if (SvTYPE(sv) >= SVt_PVGV) {
304 if (!val) { /* local *x; */
306 } else if (!SvROK(val)) { /* local *x = $val; */
308 } else { /* local *x = \$val; */
309 t = SvTYPE(SvRV(val));
314 const char *p = SvPV_const(sv, len), *s;
315 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
321 case '$': t = SVt_PV; break;
322 case '@': t = SVt_PVAV; break;
323 case '%': t = SVt_PVHV; break;
324 case '&': t = SVt_PVCV; break;
325 case '*': t = SVt_PVGV; break;
330 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
331 if (SvROK(val) && !sv_isobject(val)) {
332 t = SvTYPE(SvRV(val));
338 gv = gv_fetchpvn_flags(s, l, GV_ADDMULTI, SVt_PVGV);
342 SV *z = newSV_type(t);
343 PerlIO_printf(Perl_debug_log, "%p: === localize a %s at %d (save is %d)\n",
344 ud, sv_reftype(z, 0),
345 PL_scopestack_ix, PL_savestack_ix);
349 /* Inspired from Alias.pm */
353 su_save_aelem(GvAV(gv), elem, val);
360 su_save_helem(GvHV(gv), elem, val);
366 save_gp(gv, 1); /* hide previous entry in symtab */
373 gv = (GV *) save_scalar(gv);
375 if (deref) /* val != NULL */
380 SU_D(PerlIO_printf(Perl_debug_log, "%p: savestack is now at %d, base at %d\n",
382 PL_scopestack[PL_scopestack_ix]));
386 SvSetMagicSV((SV *) gv, val);
389 SvREFCNT_dec(ud->elem);
390 SvREFCNT_dec(ud->val);
391 SvREFCNT_dec(ud->sv);
395 /* --- Pop a context back -------------------------------------------------- */
399 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
401 # define SU_CXNAME "XXX"
405 STATIC void su_pop(pTHX_ void *ud) {
406 #define su_pop(U) su_pop(aTHX_ (U))
407 I32 depth, base, mark, *origin;
408 depth = SU_UD_DEPTH(ud);
410 SU_D(PerlIO_printf(Perl_debug_log, "%p: --- pop %s at %d from %d to %d [%d]\n",
412 PL_scopestack_ix, PL_savestack_ix,
413 PL_scopestack[PL_scopestack_ix],
416 origin = SU_UD_ORIGIN(ud);
417 mark = origin[depth];
418 base = origin[depth - 1];
420 SU_D(PerlIO_printf(Perl_debug_log, "%p: clean from %d down to %d\n",
424 PL_savestack_ix = mark;
427 PL_savestack_ix = base;
429 SU_UD_DEPTH(ud) = depth;
430 SU_D(PerlIO_printf(Perl_debug_log, "%p: save new destructor at %d [%d]\n",
431 ud, PL_savestack_ix, depth));
432 SAVEDESTRUCTOR_X(su_pop, ud);
433 SU_D(PerlIO_printf(Perl_debug_log, "%p: pop end at at %d [%d]\n",
434 ud, PL_savestack_ix, depth));
436 SU_UD_HANDLER(ud)(aTHX_ ud);
440 /* --- Initialize the stack and the action userdata ------------------------ */
442 STATIC I32 su_init(pTHX_ I32 level, void *ud, I32 size) {
443 #define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
444 I32 i, depth = 0, *origin;
450 SU_UD_HANDLER(ud)(aTHX_ ud);
454 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for level %d\n", ud, level));
456 for (i = 0; i < level; ++i) {
457 PERL_CONTEXT *cx = &cxstack[cxstack_ix - i];
458 switch (CxTYPE(cx)) {
459 #if SU_HAS_PERL(5, 11, 0)
462 case CXt_LOOP_LAZYSV:
463 case CXt_LOOP_LAZYIV:
467 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
471 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is normal\n", ud, i));
476 SU_D(PerlIO_printf(Perl_debug_log, "%p: depth is %d\n", ud, depth));
478 Newx(origin, depth + 1, I32);
479 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
480 PL_scopestack[PL_scopestack_ix - depth] += size;
481 for (i = depth - 1; i >= 1; --i) {
482 I32 j = PL_scopestack_ix - i;
483 origin[depth - i] = PL_scopestack[j];
484 PL_scopestack[j] += 3;
486 origin[depth] = PL_savestack_ix;
489 PerlIO_printf(Perl_debug_log, "%p: d=%d s=%d x=%d c=%d o=%d\n", ud,
490 depth, 0, PL_scopestack_ix - 1, PL_savestack_ix, origin[depth]);
491 for (i = depth - 1; i >= 0; --i) {
492 I32 x = PL_scopestack_ix - depth + i;
493 PerlIO_printf(Perl_debug_log, "%p: d=%d s=%d x=%d c=%d o=%d\n", ud,
494 i, depth - i, x, PL_scopestack[x], origin[i]);
498 SU_UD_ORIGIN(ud) = origin;
499 SU_UD_DEPTH(ud) = depth;
501 SU_D(PerlIO_printf(Perl_debug_log, "%p: set original destructor at %d [%d]\n",
502 ud, PL_savestack_ix, depth));
504 SAVEDESTRUCTOR_X(su_pop, ud);
512 #define SU_GET_LEVEL(A) \
520 if (level > cxstack_ix) \
523 /* --- XS ------------------------------------------------------------------ */
525 MODULE = Scope::Upper PACKAGE = Scope::Upper
533 RETVAL = newSViv(cxstack_ix);
545 Newx(ud, 1, su_ud_reap);
546 SU_UD_ORIGIN(ud) = NULL;
547 SU_UD_HANDLER(ud) = su_reap;
548 ud->cb = newSVsv(hook);
549 su_init(level, ud, 3);
552 localize(SV *sv, SV *val, ...)
559 Newx(ud, 1, su_ud_localize);
560 SU_UD_ORIGIN(ud) = NULL;
561 SU_UD_HANDLER(ud) = su_localize;
564 ud->val = newSVsv(val);
566 su_init(level, ud, 3);
569 localize_elem(SV *sv, SV *elem, SV *val, ...)
576 Newx(ud, 1, su_ud_localize);
577 SU_UD_ORIGIN(ud) = NULL;
578 SU_UD_HANDLER(ud) = su_localize;
581 ud->val = newSVsv(val);
584 su_init(level, ud, 4);
587 localize_delete(SV *sv, SV *elem, ...)
594 Newx(ud, 1, su_ud_localize);
595 SU_UD_ORIGIN(ud) = NULL;
596 SU_UD_HANDLER(ud) = su_localize;
602 su_init(level, ud, 4);