123 lines
3.2 KiB
C
123 lines
3.2 KiB
C
typedef struct FillArr {
|
|
struct Arr;
|
|
B fill;
|
|
B a[];
|
|
} FillArr;
|
|
typedef struct FillSlice {
|
|
struct Slice;
|
|
B* a;
|
|
} FillSlice;
|
|
|
|
B asFill(B x); // consumes
|
|
void validateFill(B x);
|
|
|
|
B withFill(B x, B fill); // consumes both
|
|
static B qWithFill(B x, B fill) { // consumes both
|
|
assert(isArr(x));
|
|
if (noFill(fill) || TI(x,elType)!=el_B) return x;
|
|
return withFill(x, fill);
|
|
}
|
|
|
|
NOINLINE bool fillEqualR(B w, B x);
|
|
static bool fillEqual(B w, B x) {
|
|
if (w.u==x.u) return true;
|
|
if (isAtm(w)|isAtm(x)) return false;
|
|
return fillEqualR(w, x);
|
|
}
|
|
|
|
|
|
static B getFillR(B x) { // doesn't consume; can return bi_noFill
|
|
if (isArr(x)) {
|
|
switch(TI(x,elType)) { default: UD;
|
|
case el_i8: case el_i16: case el_i32: case el_f64: case el_bit: return m_i32(0);
|
|
case el_c8: case el_c16: case el_c32: return m_c32(' ');
|
|
case el_B:;
|
|
u8 t = v(x)->type;
|
|
if (t==t_fillarr ) return inc(c(FillArr,x )->fill);
|
|
if (t==t_fillslice) return inc(((FillArr*)c(Slice,x)->p)->fill);
|
|
return bi_noFill;
|
|
}
|
|
}
|
|
if (isNum(x)) return m_i32(0);
|
|
if (isC32(x)) return m_c32(' ');
|
|
return bi_noFill;
|
|
}
|
|
static B getFillQ(B x) { // doesn't consume; returns 0 if !CATCH_ERRORS
|
|
B r = getFillR(x);
|
|
#if CATCH_ERRORS
|
|
return r;
|
|
#endif
|
|
return noFill(r)? m_f64(0) : r;
|
|
}
|
|
static B getFillE(B x) { // errors if there's no fill
|
|
B xf = getFillQ(x);
|
|
if (noFill(xf)) {
|
|
if (PROPER_FILLS) thrM("No fill found");
|
|
else return m_f64(0);
|
|
}
|
|
return xf;
|
|
}
|
|
|
|
|
|
static Arr* m_fillarrp(usz ia) {
|
|
return m_arr(fsizeof(FillArr,a,B,ia), t_fillarr, ia);
|
|
}
|
|
static void fillarr_setFill(Arr* x, B fill) { assert(x->type==t_fillarr); ((FillArr*)x)->fill = fill; } // consumes fill
|
|
static B* fillarr_ptr(Arr* x) { assert(x->type==t_fillarr); return ((FillArr*)x)->a; }
|
|
|
|
|
|
static B m_unit(B x) {
|
|
B xf = asFill(inc(x));
|
|
if (noFill(xf)) {
|
|
HArr_p r = m_harrUp(1);
|
|
arr_shAlloc((Arr*)r.c, 0);
|
|
r.a[0] = x;
|
|
return r.b;
|
|
}
|
|
FillArr* r = m_arr(fsizeof(FillArr,a,B,1), t_fillarr, 1);
|
|
arr_shAlloc((Arr*)r, 0);
|
|
r->fill = xf;
|
|
r->a[0] = x;
|
|
return taga(r);
|
|
}
|
|
|
|
static B m_atomUnit(B x) {
|
|
if (isNum(x)) {
|
|
Arr* r;
|
|
i32 xi = (i32)x.f;
|
|
if (RARE(xi!=x.f)) { f64* rp; r = m_f64arrp(&rp, 1); rp[0] = x.f; }
|
|
else if (q_ibit(xi)) { u64* rp; r = m_bitarrp(&rp, 1); rp[0] = bitx(x); }
|
|
else if (xi==(i8 )xi) { i8* rp; r = m_i8arrp (&rp, 1); rp[0] = xi; }
|
|
else if (xi==(i16)xi) { i16* rp; r = m_i16arrp(&rp, 1); rp[0] = xi; }
|
|
else { i32* rp; r = m_i32arrp(&rp, 1); rp[0] = xi; }
|
|
arr_shAlloc(r, 0);
|
|
return taga(r);
|
|
}
|
|
if (isC32(x)) {
|
|
Arr* r;
|
|
u32 xi = o2cu(x);
|
|
if (xi==(i8 )xi) { u8* rp; r = m_c8arrp (&rp, 1); rp[0] = xi; }
|
|
else if (xi==(i16)xi) { u16* rp; r = m_c16arrp(&rp, 1); rp[0] = xi; }
|
|
else { u32* rp; r = m_c32arrp(&rp, 1); rp[0] = xi; }
|
|
arr_shAlloc(r,0);
|
|
return taga(r);
|
|
}
|
|
return m_unit(x);
|
|
}
|
|
|
|
static B fill_or(B wf, B xf) { // consumes
|
|
if (fillEqual(wf, xf)) {
|
|
dec(wf);
|
|
return xf;
|
|
}
|
|
dec(wf); dec(xf);
|
|
return bi_noFill;
|
|
}
|
|
|
|
static B fill_both(B w, B x) { // doesn't consume
|
|
B wf = getFillQ(w);
|
|
if (noFill(wf)) return bi_noFill;
|
|
B xf = getFillQ(x);
|
|
return fill_or(wf, xf);
|
|
}
|