•internal Variation, ListVariations, ClearRefs, Unshare

This commit is contained in:
dzaima 2021-05-29 14:01:23 +03:00
parent 038b27072f
commit 41ffb0f2ef
2 changed files with 178 additions and 10 deletions

View File

@ -31,30 +31,197 @@ B isPure_c1(B t, B x) {
return r;
}
B info_c1(B t, B x) {
B info_c2(B t, B w, B x) {
B s = inc(bi_emptyCVec);
AFMT("%xl: ", x.u);
i32 m = o2i(w);
if (isVal(x)) {
if (m) AFMT("%xl: ", x.u);
else AFMT("%xl: ", x.u>>48);
Value* xv = v(x);
AFMT("refc:%i ", xv->refc);
AFMT("mmInfo:%i ", xv->mmInfo);
AFMT("flags:%i ", xv->flags);
AFMT("extra:%i ", xv->extra);
if (m) {
AFMT("mmInfo:%i ", xv->mmInfo);
AFMT("flags:%i ", xv->flags);
AFMT("extra:%i ", xv->extra);
}
AFMT("type:%i=%S ", xv->type, format_type(xv->type));
AFMT("alloc:%l", mm_size(xv));
dec(x);
} else {
AFMT("%xl: ", x.u);
A8("not heap-allocated");
}
return s;
}
B info_c1(B t, B x) {
return info_c2(t, m_i32(0), x);
}
B listVariations_c2(B t, B w, B x) {
if (!isArr(x)) thrM("•internal.ListVariations: Argument must be an array");
i32 wv = o2i(w);
B xf = getFillQ(x);
bool ah = wv || noFill(xf);
bool ai32=false, af64=false, ac32=false;
usz xia = a(x)->ia;
BS2B xgetU = TI(x).getU;
if (isNum(xf)) {
ai32=af64=true;
for (usz i = 0; i < xia; i++) {
B c = xgetU(x, i);
if (!isNum(c)) { ai32=af64=false; break; }
if (!q_i32(c)) ai32=false;
}
} else if (isC32(xf)) {
ac32=true;
for (usz i = 0; i < xia; i++) {
B c = xgetU(x, i);
if (!isC32(c)) { ac32=false; break; }
}
} else ai32=af64=false;
B r = inc(bi_emptyHVec);
if(ai32) { r=vec_add(r,m_str32(U"Ai32")); r=vec_add(r,m_str32(U"Ai32Inc")); r=vec_add(r,m_str32(U"Si32")); r=vec_add(r,m_str32(U"Si32Inc")); }
if(af64) { r=vec_add(r,m_str32(U"Af64")); r=vec_add(r,m_str32(U"Af64Inc")); r=vec_add(r,m_str32(U"Sf64")); r=vec_add(r,m_str32(U"Sf64Inc")); }
if(ac32) { r=vec_add(r,m_str32(U"Ac32")); r=vec_add(r,m_str32(U"Ac32Inc")); r=vec_add(r,m_str32(U"Sc32")); r=vec_add(r,m_str32(U"Sc32Inc")); }
if(ah) { r=vec_add(r,m_str32(U"Ah" )); r=vec_add(r,m_str32(U"AhInc")); r=vec_add(r,m_str32(U"Sh" )); r=vec_add(r,m_str32(U"ShInc")); }
{ r=vec_add(r,m_str32(U"Af" )); r=vec_add(r,m_str32(U"AfInc")); r=vec_add(r,m_str32(U"Sf" )); r=vec_add(r,m_str32(U"SfInc")); }
dec(x);
dec(xf);
return r;
}
B listVariations_c1(B t, B x) {
return listVariations_c2(t, m_i32(1), x);
}
static bool u32_get(u32** cv, u32* cE, u32* x) {
u32* c = *cv;
while (true) {
if (!*x) {
*cv = c;
return true;
}
if (c==cE || *c!=*x) return false;
c++; x++;
}
}
static B variation_refs;
static bool variation_rootAdded;
static void variation_root() {
mm_visit(variation_refs);
}
B variation_c2(B t, B w, B x) {
if (!isArr(x)) thrM("•internal.Variation: Non-array 𝕩");
usz xia = a(x)->ia;
BS2B xget = TI(x).get;
BS2B xgetU = TI(x).getU;
C32Arr* wc = toC32Arr(w);
u32* wp = wc->a;
u32* wpE = wp+wc->ia;
if (wc->ia==0) thrM("•internal.Variation: Zero-length 𝕨");
B res;
if (*wp == 'A' || *wp == 'S') {
bool slice = *wp == 'S';
wp++;
if (u32_get(&wp, wpE, U"i32")) {
i32* tp; res = m_i32arrc(&tp, x);
for (usz i = 0; i < xia; i++) tp[i] = o2i(xgetU(x,i));
} else if (u32_get(&wp, wpE, U"f64")) {
f64* tp; res = m_f64arrc(&tp, x);
for (usz i = 0; i < xia; i++) tp[i] = o2f(xgetU(x,i));
} else if (u32_get(&wp, wpE, U"c32")) {
u32* tp; res = m_c32arrc(&tp, x);
for (usz i = 0; i < xia; i++) tp[i] = o2c(xgetU(x,i));
} else if (u32_get(&wp, wpE, U"h")) {
HArr_p t = m_harrUc(x);
for (usz i = 0; i < xia; i++) t.a[i] = xget(x,i);
res = t.b;
} else if (u32_get(&wp, wpE, U"f")) {
res = m_fillarrp(xia);
fillarr_setFill(res, getFillQ(x));
arr_shCopy(res, x);
B* rp = fillarr_ptr(res);
for (usz i = 0; i < xia; i++) rp[i] = xget(x,i);
} else thrF("•internal.Variation: Bad type \"%R\"", tag(wc,ARR_TAG));
if (slice) {
B slice = TI(res).slice(res, 0);
arr_shCopy(slice, res);
res = slice;
}
if (u32_get(&wp, wpE, U"Inc")) {
if (!variation_refs.u) {
variation_refs = inc(bi_emptyHVec);
if (!variation_rootAdded) { gc_addFn(variation_root); variation_rootAdded = true; }
}
variation_refs = vec_add(variation_refs, inc(res));
}
if (wp!=wpE) thrM("•internal.Variation: Bad 𝕨");
} else thrM("•internal.Variation: Bad start of 𝕨");
dec(x);
ptr_dec(wc);
return res;
}
B clearRefs_c1(B t, B x) {
dec(x);
if (!isArr(variation_refs)) return m_f64(0);
usz res = a(variation_refs)->ia;
dec(variation_refs);
variation_refs = m_f64(0);
return m_f64(res);
}
static B unshare(B x) {
if (!isArr(x)) return x;
usz xia = a(x)->ia;
switch (v(x)->type) {
case t_i32arr: {
i32* rp; B r = m_i32arrc(&rp, x);
memcpy(rp, i32arr_ptr(x), xia*4);
return r;
}
case t_c32arr: {
u32* rp; B r = m_c32arrc(&rp, x);
memcpy(rp, c32arr_ptr(x), xia*4);
return r;
}
case t_f64arr: {
f64* rp; B r = m_f64arrc(&rp, x);
memcpy(rp, f64arr_ptr(x), xia*8);
return r;
}
case t_harr: {
HArr_p r = m_harrUc(x);
B* xp = harr_ptr(x);
for (usz i = 0; i < xia; i++) r.a[i] = unshare(xp[i]);
return r.b;
}
case t_fillarr: {
B r = m_fillarrp(xia); arr_shCopy(r, x);
fillarr_setFill(r, unshare(c(FillArr,x)->fill));
B* rp = fillarr_ptr(r); B* xp = fillarr_ptr(x);
for (usz i = 0; i < xia; i++) rp[i] = unshare(xp[i]);
return r;
}
default: thrF("•internal.Unshare: Cannot unshare array with type %i=%S", v(x)->type, format_type((v(x)->type)));
}
}
B unshare_c1(B t, B x) {
if (!isArr(x)) thrM("•internal.Unshare: Argument must be an array");
B r = unshare(x);
dec(x);
return r;
}
static B internalNS;
B getInternalNS() {
if (internalNS.u == 0) {
#define F(X) inc(bi_##X),
B fn = bqn_exec(m_str32(U"{ Type, Refc, Squeeze, IsPure, Info⟩⇐𝕩}"), inc(bi_emptyHVec), inc(bi_emptyHVec));
B arg = m_caB(7, (B[]){F(itype)F(refc)F(squeeze)F(isPure)F(info)});
B fn = bqn_exec(m_str32(U"{⟨ Type, Refc, Squeeze, IsPure, Info, ListVariations, Variation, ClearRefs, Unshare⟩⇐𝕩}"), inc(bi_emptyHVec), inc(bi_emptyHVec));
B arg = m_caB(9, (B[]){F(itype)F(refc)F(squeeze)F(isPure)F(info)F(listVariations)F(variation)F(clearRefs)F(unshare)});
#undef F
internalNS = c1(fn,arg);
gc_add(internalNS);

View File

@ -24,7 +24,7 @@
#define HEAP_MAX ~0ULL // default heap max size
// #define LOG_GC // log GC stats
// #define FORMATTER // use self-hosted formatter for output
#define FORMATTER // use self-hosted formatter for output
// #define TIME // output runtime of every expression
// #define RT_PERF // time runtime primitives
// #define RT_VERIFY // compare native and runtime versions of primitives
@ -162,7 +162,8 @@ char* format_type(u8 u);
/* sort.c*/A(gradeUp,"") A(gradeDown,"") \
/* sysfn.c*/M(type,"•Type") M(decp,"•Decompose") M(primInd,"•PrimInd") M(glyph,"•Glyph") A(fill,"•FillFn") M(sys,"•getsys") A(grLen,"•GroupLen") D(grOrd,"•groupOrd") \
/* sysfn.c*/M(repr,"•Repr") A(asrt,"!") M(out,"•Out") M(show,"•Show") M(bqn,"•BQN") D(cmp,"•Cmp") A(hash,"•Hash") \
/*internal.c*/M(itype,"•internal.Type") M(refc,"•internal.Refc") M(squeeze,"•internal.Squeeze") M(isPure,"•internal.IsPure") M(info,"•internal.Info")
/*internal.c*/M(itype,"•internal.Type") M(refc,"•internal.Refc") M(squeeze,"•internal.Squeeze") M(isPure,"•internal.IsPure") A(info,"•internal.Info") \
/*internal.c*/D(variation,"•internal.Variation") A(listVariations,"•internal.ListVariations") M(clearRefs,"•internal.ClearRefs") M(unshare,"•internal.Unshare")
#define FOR_PM1(A,M,D) \
/*md1.c*/ A(tbl,"") A(each,"¨") A(fold,"´") A(scan,"`") A(const,"˙") A(swap,"˜") A(cell,"˘") \
@ -393,7 +394,7 @@ typedef struct TypeInfo {
BBBBBB2B m2_ucw; // t,o,f,g,w,x→r; r≡O⌾(w⊸(F _T_ G)) x; consumes w,x
B2b canStore; // doesn't consume
u8 elType;
u8 elType; // guarantees that the corresponding i32any_ptr/f64any_ptr/c32any_ptr/… always succeeds
B2v print; // doesn't consume
V2v visit; // call mm_visit for all referents