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_ void *av_, SV *key, SV *val) {
119 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
126 preeminent = su_av_preeminent(av, idx);
127 svp = av_fetch(av, idx, 1);
128 if (!*svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
131 save_aelem(av, idx, svp);
133 SAVEADELETE(av, idx);
135 if (val) { /* local $x[$idx] = $val; */
136 SvSetMagicSV(*svp, val);
137 } else { /* local $x[$idx]; delete $x[$idx]; */
138 av_delete(av, idx, G_DISCARD);
142 /* ... Saving hash elements ................................................ */
144 STATIC I32 su_hv_preeminent(pTHX_ HV *hv, SV *keysv) {
145 #define su_hv_preeminent(H, K) su_hv_preeminent(aTHX_ (H), (K))
150 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
151 return hv_exists_ent(hv, keysv, 0);
156 STATIC void su_save_helem(pTHX_ void *hv_, SV *keysv, SV *val) {
157 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
163 preeminent = su_hv_preeminent(hv, keysv);
164 he = hv_fetch_ent(hv, keysv, 1, 0);
165 svp = he ? &HeVAL(he) : NULL;
166 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
168 if (HvNAME_get(hv) && isGV(*svp)) {
169 save_gp((GV *) *svp, 0);
174 save_helem(hv, keysv, svp);
177 const char * const key = SvPV_const(keysv, keylen);
178 SAVEDELETE(hv, savepvn(key, keylen),
179 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
182 if (val) { /* local $x{$keysv} = $val; */
183 SvSetMagicSV(*svp, val);
184 } else { /* local $x{$keysv}; delete $x{$keysv}; */
185 hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
189 /* --- Actions ------------------------------------------------------------- */
194 void (*handler)(pTHX_ void *);
197 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
198 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
199 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
201 #define SU_UD_FREE(U) STMT_START { \
202 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
206 /* ... Reap ................................................................ */
213 STATIC void su_call(pTHX_ void *ud_) {
214 su_ud_reap *ud = (su_ud_reap *) ud_;
215 #if SU_HAS_PERL(5, 10, 0)
216 I32 dieing = PL_op->op_type == OP_DIE;
221 SU_D(PerlIO_printf(Perl_debug_log, "%p: @@@ call at %d (save is %d)\n",
222 ud, PL_scopestack_ix, PL_savestack_ix));
229 /* If cxstack_ix isn't incremented there, the eval context will be overwritten
230 * when the new sub scope will be created in call_sv. */
232 #if SU_HAS_PERL(5, 10, 0)
234 if (cxstack_ix < cxstack_max)
237 cxstack_ix = Perl_cxinc(aTHX);
240 call_sv(ud->cb, G_VOID);
242 #if SU_HAS_PERL(5, 10, 0)
243 if (dieing && cxstack_ix > 0)
253 SvREFCNT_dec(ud->cb);
257 STATIC void su_reap(pTHX_ void *ud) {
258 #define su_reap(U) su_reap(aTHX_ (U))
259 SU_D(PerlIO_printf(Perl_debug_log, "%p: === reap at %d (save is %d)\n",
260 ud, PL_scopestack_ix, PL_savestack_ix));
261 SAVEDESTRUCTOR_X(su_call, ud);
262 SU_D(PerlIO_printf(Perl_debug_log, "%p: savestack is now at %d, base at %d\n",
264 PL_scopestack[PL_scopestack_ix]));
267 /* ... Localize & localize array/hash element .............................. */
276 STATIC void su_localize_elem(pTHX_ void *obj, SV *elem, SV *val, void (*do_elem)(pTHX_ void *, SV *, SV *)) {
277 #define su_localize_elem(O, E, V, D) su_localize_elem(aTHX_ (O), (E), (V), (D))
279 if (SvROK(elem) && (aelem = (AV *) SvRV(elem), SvTYPE(aelem) == SVt_PVAV)) {
280 I32 i, last = av_len(aelem);
283 for (i = 0; i <= last; ++i) {
284 svpe = av_fetch(aelem, i, 0);
286 do_elem(aTHX_ obj, *svpe, NULL);
288 } else if (SvROK(val) && (aval = (AV *) SvRV(val), SvTYPE(aval) == SVt_PVAV)){
289 for (i = 0; i <= last; ++i) {
290 svpe = av_fetch(aelem, i, 0);
292 svpv = av_fetch(aval, i, 0);
294 do_elem(aTHX_ obj, *svpe, *svpv);
298 do_elem(aTHX_ obj, elem, val);
302 STATIC void su_localize(pTHX_ void *ud_) {
303 #define su_localize(U) su_localize(aTHX_ (U))
304 su_ud_localize *ud = (su_ud_localize *) ud_;
312 if (SvTYPE(sv) >= SVt_PVGV) {
314 if (!val) { /* local *x; */
316 } else if (!SvROK(val)) { /* local *x = $val; */
318 } else { /* local *x = \$val; */
319 t = SvTYPE(SvRV(val));
324 const char *p = SvPV_const(sv, len), *s;
325 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
331 case '$': t = SVt_PV; break;
332 case '@': t = SVt_PVAV; break;
333 case '%': t = SVt_PVHV; break;
334 case '&': t = SVt_PVCV; break;
335 case '*': t = SVt_PVGV; break;
340 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
341 if (SvROK(val) && !sv_isobject(val)) {
342 t = SvTYPE(SvRV(val));
348 gv = gv_fetchpvn_flags(s, l, GV_ADDMULTI, SVt_PVGV);
352 SV *z = newSV_type(t);
353 PerlIO_printf(Perl_debug_log, "%p: === localize a %s at %d (save is %d)\n",
354 ud, sv_reftype(z, 0),
355 PL_scopestack_ix, PL_savestack_ix);
359 /* Inspired from Alias.pm */
363 su_localize_elem(GvAV(gv), elem, val, su_save_aelem);
370 su_localize_elem(GvHV(gv), elem, val, su_save_helem);
376 save_gp(gv, 1); /* hide previous entry in symtab */
383 gv = (GV *) save_scalar(gv);
385 if (deref) /* val != NULL */
390 SU_D(PerlIO_printf(Perl_debug_log, "%p: savestack is now at %d, base at %d\n",
392 PL_scopestack[PL_scopestack_ix]));
396 SvSetMagicSV((SV *) gv, val);
399 SvREFCNT_dec(ud->elem);
400 SvREFCNT_dec(ud->val);
401 SvREFCNT_dec(ud->sv);
405 /* --- Pop a context back -------------------------------------------------- */
409 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
411 # define SU_CXNAME "XXX"
415 STATIC void su_pop(pTHX_ void *ud) {
416 #define su_pop(U) su_pop(aTHX_ (U))
417 I32 depth, base, mark, *origin;
418 depth = SU_UD_DEPTH(ud);
420 SU_D(PerlIO_printf(Perl_debug_log, "%p: --- pop %s at %d from %d to %d [%d]\n",
422 PL_scopestack_ix, PL_savestack_ix,
423 PL_scopestack[PL_scopestack_ix],
426 origin = SU_UD_ORIGIN(ud);
427 mark = origin[depth];
428 base = origin[depth - 1];
430 SU_D(PerlIO_printf(Perl_debug_log, "%p: clean from %d down to %d\n",
434 PL_savestack_ix = mark;
437 PL_savestack_ix = base;
439 SU_UD_DEPTH(ud) = depth;
440 SU_D(PerlIO_printf(Perl_debug_log, "%p: save new destructor at %d [%d]\n",
441 ud, PL_savestack_ix, depth));
442 SAVEDESTRUCTOR_X(su_pop, ud);
443 SU_D(PerlIO_printf(Perl_debug_log, "%p: pop end at at %d [%d]\n",
444 ud, PL_savestack_ix, depth));
446 SU_UD_HANDLER(ud)(aTHX_ ud);
450 /* --- Initialize the stack and the action userdata ------------------------ */
452 STATIC I32 su_init(pTHX_ I32 level, void *ud, I32 size) {
453 #define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
454 I32 i, depth = 0, *origin;
460 SU_UD_HANDLER(ud)(aTHX_ ud);
464 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for level %d\n", ud, level));
466 for (i = 0; i < level; ++i) {
467 PERL_CONTEXT *cx = &cxstack[cxstack_ix - i];
468 switch (CxTYPE(cx)) {
469 #if SU_HAS_PERL(5, 11, 0)
472 case CXt_LOOP_LAZYSV:
473 case CXt_LOOP_LAZYIV:
477 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
481 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is normal\n", ud, i));
486 SU_D(PerlIO_printf(Perl_debug_log, "%p: depth is %d\n", ud, depth));
488 Newx(origin, depth + 1, I32);
489 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
490 PL_scopestack[PL_scopestack_ix - depth] += size;
491 for (i = depth - 1; i >= 1; --i) {
492 I32 j = PL_scopestack_ix - i;
493 origin[depth - i] = PL_scopestack[j];
494 PL_scopestack[j] += 3;
496 origin[depth] = PL_savestack_ix;
499 PerlIO_printf(Perl_debug_log, "%p: d=%d s=%d x=%d c=%d o=%d\n", ud,
500 depth, 0, PL_scopestack_ix - 1, PL_savestack_ix, origin[depth]);
501 for (i = depth - 1; i >= 0; --i) {
502 I32 x = PL_scopestack_ix - depth + i;
503 PerlIO_printf(Perl_debug_log, "%p: d=%d s=%d x=%d c=%d o=%d\n", ud,
504 i, depth - i, x, PL_scopestack[x], origin[i]);
508 SU_UD_ORIGIN(ud) = origin;
509 SU_UD_DEPTH(ud) = depth;
511 SU_D(PerlIO_printf(Perl_debug_log, "%p: set original destructor at %d [%d]\n",
512 ud, PL_savestack_ix, depth));
514 SAVEDESTRUCTOR_X(su_pop, ud);
522 #define SU_GET_LEVEL(A) \
530 if (level > cxstack_ix) \
533 /* --- XS ------------------------------------------------------------------ */
535 MODULE = Scope::Upper PACKAGE = Scope::Upper
543 RETVAL = newSViv(cxstack_ix);
555 Newx(ud, 1, su_ud_reap);
556 SU_UD_ORIGIN(ud) = NULL;
557 SU_UD_HANDLER(ud) = su_reap;
558 ud->cb = newSVsv(hook);
559 su_init(level, ud, 3);
562 localize(SV *sv, SV *val, ...)
569 Newx(ud, 1, su_ud_localize);
570 SU_UD_ORIGIN(ud) = NULL;
571 SU_UD_HANDLER(ud) = su_localize;
574 ud->val = newSVsv(val);
576 su_init(level, ud, 3);
579 localize_elem(SV *sv, SV *elem, SV *val, ...)
582 I32 level = 0, slots = 1;
586 Newx(ud, 1, su_ud_localize);
587 SU_UD_ORIGIN(ud) = NULL;
588 SU_UD_HANDLER(ud) = su_localize;
591 ud->val = newSVsv(val);
594 if (SvROK(elem) && (elem = SvRV(elem), SvTYPE(elem) == SVt_PVAV))
595 slots = 1 + av_len((AV *) elem);
596 su_init(level, ud, slots * 4);
599 localize_delete(SV *sv, SV *elem, ...)
602 I32 level = 0, slots = 1;
606 Newx(ud, 1, su_ud_localize);
607 SU_UD_ORIGIN(ud) = NULL;
608 SU_UD_HANDLER(ud) = su_localize;
614 if (SvROK(elem) && (elem = SvRV(elem), SvTYPE(elem) == SVt_PVAV))
615 slots = 1 + av_len((AV *) elem);
616 su_init(level, ud, slots * 3);