# define SU_DEBUG 0
#endif
+/* --- Compatibility ------------------------------------------------------- */
+
#ifndef STMT_START
# define STMT_START do
#endif
# define SU_D(X)
#endif
+#ifndef Newx
+# define Newx(v, n, c) New(0, v, n, c)
+#endif
+
#ifndef SvPV_const
# define SvPV_const(S, L) SvPV(S, L)
#endif
# define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
#endif
+#ifndef PERL_MAGIC_tied
+# define PERL_MAGIC_tied 'P'
+#endif
+
+#ifndef PERL_MAGIC_env
+# define PERL_MAGIC_env 'E'
+#endif
+
#define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
+/* --- Stack manipulations ------------------------------------------------- */
+
+#ifndef SvCANEXISTDELETE
+# define SvCANEXISTDELETE(sv) \
+ (!SvRMAGICAL(sv) \
+ || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
+ && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
+ && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
+ && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
+ ) \
+ )
+#endif
+
+/* ... Saving array elements ............................................... */
+
+STATIC I32 su_av_preeminent(pTHX_ AV *av, I32 key) {
+#define su_av_preeminent(A, K) su_av_preeminent(aTHX_ (A), (K))
+ MAGIC *mg;
+ HV *stash;
+
+ if (!av) return 0;
+ if (SvCANEXISTDELETE(av))
+ return av_exists(av, key);
+
+ return 1;
+}
+
+#ifndef SAVEADELETE
+
+typedef struct {
+ AV *av;
+ I32 key;
+} su_ud_adelete;
+
+STATIC void su_adelete(pTHX_ void *ud_) {
+ su_ud_adelete *ud = ud_;
+
+ av_delete(ud->av, ud->key, G_DISCARD);
+ SvREFCNT_dec(ud->av);
+
+ Safefree(ud);
+}
+
+STATIC void su_save_adelete(pTHX_ AV *av, I32 key) {
+#define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
+ su_ud_adelete *ud;
+
+ Newx(ud, 1, su_ud_adelete);
+ ud->av = av;
+ ud->key = key;
+ SvREFCNT_inc(av);
+
+ SAVEDESTRUCTOR_X(su_adelete, ud);
+}
+
+#define SAVEADELETE(A, K) su_save_adelete((A), (K))
+
+#endif /* SAVEADELETE */
+
+STATIC void su_save_aelem(pTHX_ void *av_, SV *key, SV *val) {
+#define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
+ AV *av = av_;
+ I32 idx;
+ I32 preeminent;
+ SV **svp;
+
+ idx = SvIV(key);
+ preeminent = su_av_preeminent(av, idx);
+ svp = av_fetch(av, idx, 1);
+ if (!*svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
+
+ if (preeminent)
+ save_aelem(av, idx, svp);
+ else
+ SAVEADELETE(av, idx);
+
+ if (val) { /* local $x[$idx] = $val; */
+ SvSetMagicSV(*svp, val);
+ } else { /* local $x[$idx]; delete $x[$idx]; */
+ av_delete(av, idx, G_DISCARD);
+ }
+}
+
+/* ... Saving hash elements ................................................ */
+
+STATIC I32 su_hv_preeminent(pTHX_ HV *hv, SV *keysv) {
+#define su_hv_preeminent(H, K) su_hv_preeminent(aTHX_ (H), (K))
+ MAGIC *mg;
+ HV *stash;
+
+ if (!hv) return 0;
+ if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
+ return hv_exists_ent(hv, keysv, 0);
+
+ return 1;
+}
+
+STATIC void su_save_helem(pTHX_ void *hv_, SV *keysv, SV *val) {
+#define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
+ HV *hv = hv_;
+ I32 preeminent;
+ HE *he;
+ SV **svp;
+
+ preeminent = su_hv_preeminent(hv, keysv);
+ he = hv_fetch_ent(hv, keysv, 1, 0);
+ svp = he ? &HeVAL(he) : NULL;
+ if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
+
+ if (HvNAME_get(hv) && isGV(*svp)) {
+ save_gp((GV *) *svp, 0);
+ return;
+ }
+
+ if (preeminent)
+ save_helem(hv, keysv, svp);
+ else {
+ STRLEN keylen;
+ const char * const key = SvPV_const(keysv, keylen);
+ SAVEDELETE(hv, savepvn(key, keylen),
+ SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
+ }
+
+ if (val) { /* local $x{$keysv} = $val; */
+ SvSetMagicSV(*svp, val);
+ } else { /* local $x{$keysv}; delete $x{$keysv}; */
+ hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
+ }
+}
+
+/* --- Actions ------------------------------------------------------------- */
+
typedef struct {
I32 depth;
I32 *origin;
#define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
#define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
-#define SU_UD_FREE(U) do { \
+#define SU_UD_FREE(U) STMT_START { \
if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
Safefree(U); \
-} while (0)
+} STMT_END
+
+/* ... Reap ................................................................ */
typedef struct {
su_ud_common ci;
PUTBACK;
FREETMPS;
- LEAVE;
+ LEAVE;
SvREFCNT_dec(ud->cb);
SU_UD_FREE(ud);
PL_scopestack[PL_scopestack_ix]));
}
+/* ... Localize & localize array/hash element .............................. */
+
typedef struct {
su_ud_common ci;
SV *sv;
SV *elem;
} su_ud_localize;
-/* Those two functions are courtesy of pp_hot.c:pp_helem */
-
-STATIC I32 su_hv_preeminent(pTHX_ HV *hv, SV *keysv) {
-#define su_hv_preeminent(H, K) su_hv_preeminent(aTHX_ (H), (K))
- MAGIC *mg;
- HV *stash;
- return (!SvRMAGICAL(hv)
- || mg_find((SV *) hv, PERL_MAGIC_env)
- || ((mg = mg_find((SV *) hv, PERL_MAGIC_tied))
- /* Try to preserve the existenceness of a tied hash
- * element by using EXISTS and DELETE if possible.
- * Fallback to FETCH and STORE otherwise */
- && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) hv, mg))))
- && gv_fetchmethod_autoload(stash, "EXISTS", TRUE)
- && gv_fetchmethod_autoload(stash, "DELETE", TRUE)
- )
- ) ? hv_exists_ent(hv, keysv, 0) : 1;
-}
-
-STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV **svp, I32 preeminent) {
-#define su_save_helem(H, K, S, P) su_save_helem(aTHX_ (H), (K), (S), (P))
- if (HvNAME_get(hv) && isGV(*svp)) {
- save_gp((GV *) *svp, 0);
- return;
- }
- if (!preeminent) {
- STRLEN keylen;
- const char * const key = SvPV_const(keysv, keylen);
- SAVEDELETE(hv, savepvn(key, keylen),
- SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
+STATIC void su_localize_elem(pTHX_ void *obj, SV *elem, SV *val, void (*do_elem)(pTHX_ void *, SV *, SV *)) {
+#define su_localize_elem(O, E, V, D) su_localize_elem(aTHX_ (O), (E), (V), (D))
+ AV *aelem, *aval;
+ if (SvROK(elem) && (aelem = (AV *) SvRV(elem), SvTYPE(aelem) == SVt_PVAV)) {
+ I32 i, last = av_len(aelem);
+ SV **svpe, **svpv;
+ if (!val) {
+ for (i = 0; i <= last; ++i) {
+ svpe = av_fetch(aelem, i, 0);
+ if (!svpe) continue;
+ do_elem(aTHX_ obj, *svpe, NULL);
+ }
+ } else if (SvROK(val) && (aval = (AV *) SvRV(val), SvTYPE(aval) == SVt_PVAV)){
+ for (i = 0; i <= last; ++i) {
+ svpe = av_fetch(aelem, i, 0);
+ if (!svpe) continue;
+ svpv = av_fetch(aval, i, 0);
+ if (!svpv) continue;
+ do_elem(aTHX_ obj, *svpe, *svpv);
+ }
+ }
} else {
- save_helem(hv, keysv, svp);
+ do_elem(aTHX_ obj, elem, val);
}
}
if (SvTYPE(sv) >= SVt_PVGV) {
gv = (GV *) sv;
- if (!SvROK(val))
+ if (!val) { /* local *x; */
+ t = SVt_PVGV;
+ } else if (!SvROK(val)) { /* local *x = $val; */
goto assign;
- t = SvTYPE(SvRV(val));
- deref = 1;
+ } else { /* local *x = \$val; */
+ t = SvTYPE(SvRV(val));
+ deref = 1;
+ }
} else {
STRLEN len, l;
const char *p = SvPV_const(sv, len), *s;
case '&': t = SVt_PVCV; break;
case '*': t = SVt_PVGV; break;
}
- if (t == SVt_NULL) {
+ if (t != SVt_NULL) {
+ ++s;
+ --l;
+ } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
if (SvROK(val) && !sv_isobject(val)) {
t = SvTYPE(SvRV(val));
deref = 1;
} else {
t = SvTYPE(val);
}
- } else {
- ++s;
- --l;
}
gv = gv_fetchpvn_flags(s, l, GV_ADDMULTI, SVt_PVGV);
}
switch (t) {
case SVt_PVAV:
if (elem) {
- I32 idx = SvIV(elem);
- AV *av = GvAV(gv);
- SV **svp = av_fetch(av, idx, 1);
- if (!*svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
- save_aelem(av, idx, svp);
- gv = (GV *) *svp;
- goto maybe_deref;
+ su_localize_elem(GvAV(gv), elem, val, su_save_aelem);
+ goto done;
} else
save_ary(gv);
break;
case SVt_PVHV:
if (elem) {
- HV *hv = GvHV(gv);
- I32 preeminent = hv ? su_hv_preeminent(hv, elem) : 0;
- HE *he = hv_fetch_ent(hv, elem, 1, 0);
- SV **svp = he ? &HeVAL(he) : NULL;
- if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
- su_save_helem(hv, elem, svp, preeminent);
- gv = (GV *) *svp;
- goto maybe_deref;
+ su_localize_elem(GvHV(gv), elem, val, su_save_helem);
+ goto done;
} else
save_hash(gv);
break;
default:
gv = (GV *) save_scalar(gv);
maybe_deref:
- if (deref)
+ if (deref) /* val != NULL */
val = SvRV(val);
break;
}
PL_scopestack[PL_scopestack_ix]));
assign:
- SvSetMagicSV((SV *) gv, val);
+ if (val)
+ SvSetMagicSV((SV *) gv, val);
+done:
SvREFCNT_dec(ud->elem);
SvREFCNT_dec(ud->val);
SvREFCNT_dec(ud->sv);
SU_UD_FREE(ud);
}
+/* --- Pop a context back -------------------------------------------------- */
+
#if SU_DEBUG
# ifdef DEBUGGING
# define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
}
}
+/* --- Initialize the stack and the action userdata ------------------------ */
+
STATIC I32 su_init(pTHX_ I32 level, void *ud, I32 size) {
#define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
I32 i, depth = 0, *origin;
I32 cur, last, step;
+ LEAVE;
+
+ if (level <= 0) {
+ SU_UD_HANDLER(ud)(aTHX_ ud);
+ goto done;
+ }
+
SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for level %d\n", ud, level));
for (i = 0; i < level; ++i) {
SU_UD_ORIGIN(ud) = origin;
SU_UD_DEPTH(ud) = depth;
+
+ SU_D(PerlIO_printf(Perl_debug_log, "%p: set original destructor at %d [%d]\n",
+ ud, PL_savestack_ix, depth));
+
+ SAVEDESTRUCTOR_X(su_pop, ud);
+
+done:
+ ENTER;
+
return depth;
}
SU_UD_ORIGIN(ud) = NULL;
SU_UD_HANDLER(ud) = su_reap;
ud->cb = newSVsv(hook);
- LEAVE;
- if (level) {
- I32 depth = su_init(level, ud, 3);
- SU_D(PerlIO_printf(Perl_debug_log, "%p: set original destructor at %d [%d]\n",
- ud, PL_savestack_ix, depth));
- SAVEDESTRUCTOR_X(su_pop, ud);
- } else
- su_reap(ud);
- ENTER;
+ su_init(level, ud, 3);
void
localize(SV *sv, SV *val, ...)
ud->sv = sv;
ud->val = newSVsv(val);
ud->elem = NULL;
- LEAVE;
- if (level) {
- I32 depth = su_init(level, ud, 3);
- SU_D(PerlIO_printf(Perl_debug_log, "%p: set original destructor at %d [%d]\n",
- ud, PL_savestack_ix, depth));
- SAVEDESTRUCTOR_X(su_pop, ud);
- } else
- su_localize(ud);
- ENTER;
+ su_init(level, ud, 3);
void
localize_elem(SV *sv, SV *elem, SV *val, ...)
PROTOTYPE: $$$;$
PREINIT:
- I32 level = 0;
+ I32 level = 0, slots = 1;
su_ud_localize *ud;
CODE:
SU_GET_LEVEL(3);
ud->val = newSVsv(val);
SvREFCNT_inc(elem);
ud->elem = elem;
- LEAVE;
- if (level) {
- I32 depth = su_init(level, ud, 4);
- SU_D(PerlIO_printf(Perl_debug_log, "%p: set original destructor at %d [%d]\n",
- ud, PL_savestack_ix, depth));
- SAVEDESTRUCTOR_X(su_pop, ud);
- } else
- su_localize(ud);
- ENTER;
+ if (SvROK(elem) && (elem = SvRV(elem), SvTYPE(elem) == SVt_PVAV))
+ slots = 1 + av_len((AV *) elem);
+ su_init(level, ud, slots * 4);
+void
+localize_delete(SV *sv, SV *elem, ...)
+PROTOTYPE: $$;$
+PREINIT:
+ I32 level = 0, slots = 1;
+ su_ud_localize *ud;
+CODE:
+ SU_GET_LEVEL(2);
+ Newx(ud, 1, su_ud_localize);
+ SU_UD_ORIGIN(ud) = NULL;
+ SU_UD_HANDLER(ud) = su_localize;
+ SvREFCNT_inc(sv);
+ ud->sv = sv;
+ ud->val = NULL;
+ SvREFCNT_inc(elem);
+ ud->elem = elem;
+ if (SvROK(elem) && (elem = SvRV(elem), SvTYPE(elem) == SVt_PVAV))
+ slots = 1 + av_len((AV *) elem);
+ su_init(level, ud, slots * 3);