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 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
59 /* --- Stack manipulations ------------------------------------------------- */
61 #ifndef SvCANEXISTDELETE
62 # define SvCANEXISTDELETE(sv) \
64 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
65 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
66 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
67 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
72 /* ... Saving array elements ............................................... */
74 STATIC I32 su_av_preeminent(pTHX_ AV *av, I32 key) {
75 #define su_av_preeminent(A, K) su_av_preeminent(aTHX_ (A), (K))
80 if (SvCANEXISTDELETE(av))
81 return av_exists(av, key);
93 STATIC void su_adelete(pTHX_ void *ud_) {
94 su_ud_adelete *ud = ud_;
96 av_delete(ud->av, ud->key, G_DISCARD);
102 STATIC void su_save_adelete(pTHX_ AV *av, I32 key) {
103 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
106 Newx(ud, 1, su_ud_adelete);
111 SAVEDESTRUCTOR_X(su_adelete, ud);
114 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
116 #endif /* SAVEADELETE */
118 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
119 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
125 preeminent = su_av_preeminent(av, idx);
126 svp = av_fetch(av, idx, 1);
127 if (!*svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
130 save_aelem(av, idx, svp);
132 SAVEADELETE(av, idx);
134 if (val) { /* local $x[$idx] = $val; */
135 SvSetMagicSV(*svp, val);
136 } else { /* local $x[$idx]; delete $x[$idx]; */
137 av_delete(av, idx, G_DISCARD);
141 /* ... Saving hash elements ................................................ */
143 STATIC I32 su_hv_preeminent(pTHX_ HV *hv, SV *keysv) {
144 #define su_hv_preeminent(H, K) su_hv_preeminent(aTHX_ (H), (K))
149 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
150 return hv_exists_ent(hv, keysv, 0);
155 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
156 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
161 preeminent = su_hv_preeminent(hv, keysv);
162 he = hv_fetch_ent(hv, keysv, 1, 0);
163 svp = he ? &HeVAL(he) : NULL;
164 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
166 if (HvNAME_get(hv) && isGV(*svp)) {
167 save_gp((GV *) *svp, 0);
172 save_helem(hv, keysv, svp);
175 const char * const key = SvPV_const(keysv, keylen);
176 SAVEDELETE(hv, savepvn(key, keylen),
177 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
180 if (val) { /* local $x{$keysv} = $val; */
181 SvSetMagicSV(*svp, val);
182 } else { /* local $x{$keysv}; delete $x{$keysv}; */
183 hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
187 /* --- Actions ------------------------------------------------------------- */
192 void (*handler)(pTHX_ void *);
195 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
196 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
197 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
199 #define SU_UD_FREE(U) STMT_START { \
200 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
204 /* ... Reap ................................................................ */
211 STATIC void su_call(pTHX_ void *ud_) {
212 su_ud_reap *ud = (su_ud_reap *) ud_;
213 #if SU_HAS_PERL(5, 10, 0)
214 I32 dieing = PL_op->op_type == OP_DIE;
219 SU_D(PerlIO_printf(Perl_debug_log, "%p: @@@ call at %d (save is %d)\n",
220 ud, PL_scopestack_ix, PL_savestack_ix));
227 /* If cxstack_ix isn't incremented there, the eval context will be overwritten
228 * when the new sub scope will be created in call_sv. */
230 #if SU_HAS_PERL(5, 10, 0)
232 if (cxstack_ix < cxstack_max)
235 cxstack_ix = Perl_cxinc(aTHX);
238 call_sv(ud->cb, G_VOID);
240 #if SU_HAS_PERL(5, 10, 0)
241 if (dieing && cxstack_ix > 0)
251 SvREFCNT_dec(ud->cb);
255 STATIC void su_reap(pTHX_ void *ud) {
256 #define su_reap(U) su_reap(aTHX_ (U))
257 SU_D(PerlIO_printf(Perl_debug_log, "%p: === reap at %d (save is %d)\n",
258 ud, PL_scopestack_ix, PL_savestack_ix));
259 SAVEDESTRUCTOR_X(su_call, ud);
260 SU_D(PerlIO_printf(Perl_debug_log, "%p: savestack is now at %d, base at %d\n",
262 PL_scopestack[PL_scopestack_ix]));
265 /* ... Localize & localize array/hash element .............................. */
274 STATIC void su_localize(pTHX_ void *ud_) {
275 #define su_localize(U) su_localize(aTHX_ (U))
276 su_ud_localize *ud = (su_ud_localize *) ud_;
284 if (SvTYPE(sv) >= SVt_PVGV) {
286 if (!val) { /* local *x; */
288 } else if (!SvROK(val)) { /* local *x = $val; */
290 } else { /* local *x = \$val; */
291 t = SvTYPE(SvRV(val));
296 const char *p = SvPV_const(sv, len), *s;
297 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
303 case '$': t = SVt_PV; break;
304 case '@': t = SVt_PVAV; break;
305 case '%': t = SVt_PVHV; break;
306 case '&': t = SVt_PVCV; break;
307 case '*': t = SVt_PVGV; break;
312 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
313 if (SvROK(val) && !sv_isobject(val)) {
314 t = SvTYPE(SvRV(val));
320 gv = gv_fetchpvn_flags(s, l, GV_ADDMULTI, SVt_PVGV);
324 SV *z = newSV_type(t);
325 PerlIO_printf(Perl_debug_log, "%p: === localize a %s at %d (save is %d)\n",
326 ud, sv_reftype(z, 0),
327 PL_scopestack_ix, PL_savestack_ix);
331 /* Inspired from Alias.pm */
336 su_save_aelem(av, elem, val);
344 su_save_helem(hv, elem, val);
350 save_gp(gv, 1); /* hide previous entry in symtab */
357 gv = (GV *) save_scalar(gv);
359 if (deref) /* val != NULL */
364 SU_D(PerlIO_printf(Perl_debug_log, "%p: savestack is now at %d, base at %d\n",
366 PL_scopestack[PL_scopestack_ix]));
370 SvSetMagicSV((SV *) gv, val);
373 SvREFCNT_dec(ud->elem);
374 SvREFCNT_dec(ud->val);
375 SvREFCNT_dec(ud->sv);
379 /* --- Pop a context back -------------------------------------------------- */
383 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
385 # define SU_CXNAME "XXX"
389 STATIC void su_pop(pTHX_ void *ud) {
390 #define su_pop(U) su_pop(aTHX_ (U))
391 I32 depth, base, mark, *origin;
392 depth = SU_UD_DEPTH(ud);
394 SU_D(PerlIO_printf(Perl_debug_log, "%p: --- pop %s at %d from %d to %d [%d]\n",
396 PL_scopestack_ix, PL_savestack_ix,
397 PL_scopestack[PL_scopestack_ix],
400 origin = SU_UD_ORIGIN(ud);
401 mark = origin[depth];
402 base = origin[depth - 1];
404 SU_D(PerlIO_printf(Perl_debug_log, "%p: clean from %d down to %d\n",
408 PL_savestack_ix = mark;
411 PL_savestack_ix = base;
413 SU_UD_DEPTH(ud) = depth;
414 SU_D(PerlIO_printf(Perl_debug_log, "%p: save new destructor at %d [%d]\n",
415 ud, PL_savestack_ix, depth));
416 SAVEDESTRUCTOR_X(su_pop, ud);
417 SU_D(PerlIO_printf(Perl_debug_log, "%p: pop end at at %d [%d]\n",
418 ud, PL_savestack_ix, depth));
420 SU_UD_HANDLER(ud)(aTHX_ ud);
424 /* --- Initialize the stack and the action userdata ------------------------ */
426 STATIC I32 su_init(pTHX_ I32 level, void *ud, I32 size) {
427 #define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
428 I32 i, depth = 0, *origin;
434 SU_UD_HANDLER(ud)(aTHX_ ud);
438 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for level %d\n", ud, level));
440 for (i = 0; i < level; ++i) {
441 PERL_CONTEXT *cx = &cxstack[cxstack_ix - i];
442 switch (CxTYPE(cx)) {
443 #if SU_HAS_PERL(5, 11, 0)
446 case CXt_LOOP_LAZYSV:
447 case CXt_LOOP_LAZYIV:
451 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
455 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is normal\n", ud, i));
460 SU_D(PerlIO_printf(Perl_debug_log, "%p: depth is %d\n", ud, depth));
462 Newx(origin, depth + 1, I32);
463 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
464 PL_scopestack[PL_scopestack_ix - depth] += size;
465 for (i = depth - 1; i >= 1; --i) {
466 I32 j = PL_scopestack_ix - i;
467 origin[depth - i] = PL_scopestack[j];
468 PL_scopestack[j] += 3;
470 origin[depth] = PL_savestack_ix;
473 PerlIO_printf(Perl_debug_log, "%p: d=%d s=%d x=%d c=%d o=%d\n", ud,
474 depth, 0, PL_scopestack_ix - 1, PL_savestack_ix, origin[depth]);
475 for (i = depth - 1; i >= 0; --i) {
476 I32 x = PL_scopestack_ix - depth + i;
477 PerlIO_printf(Perl_debug_log, "%p: d=%d s=%d x=%d c=%d o=%d\n", ud,
478 i, depth - i, x, PL_scopestack[x], origin[i]);
482 SU_UD_ORIGIN(ud) = origin;
483 SU_UD_DEPTH(ud) = depth;
485 SU_D(PerlIO_printf(Perl_debug_log, "%p: set original destructor at %d [%d]\n",
486 ud, PL_savestack_ix, depth));
488 SAVEDESTRUCTOR_X(su_pop, ud);
496 #define SU_GET_LEVEL(A) \
504 if (level > cxstack_ix) \
507 /* --- XS ------------------------------------------------------------------ */
509 MODULE = Scope::Upper PACKAGE = Scope::Upper
517 RETVAL = newSViv(cxstack_ix);
529 Newx(ud, 1, su_ud_reap);
530 SU_UD_ORIGIN(ud) = NULL;
531 SU_UD_HANDLER(ud) = su_reap;
532 ud->cb = newSVsv(hook);
533 su_init(level, ud, 3);
536 localize(SV *sv, SV *val, ...)
543 Newx(ud, 1, su_ud_localize);
544 SU_UD_ORIGIN(ud) = NULL;
545 SU_UD_HANDLER(ud) = su_localize;
548 ud->val = newSVsv(val);
550 su_init(level, ud, 3);
553 localize_elem(SV *sv, SV *elem, SV *val, ...)
560 Newx(ud, 1, su_ud_localize);
561 SU_UD_ORIGIN(ud) = NULL;
562 SU_UD_HANDLER(ud) = su_localize;
565 ud->val = newSVsv(val);
568 su_init(level, ud, 4);
571 localize_delete(SV *sv, SV *elem, ...)
578 Newx(ud, 1, su_ud_localize);
579 SU_UD_ORIGIN(ud) = NULL;
580 SU_UD_HANDLER(ud) = su_localize;
586 su_init(level, ud, 4);