#include "../core.h" B asFill(B x) { // consumes if (isArr(x)) { u8 xe = TI(x,elType); usz ia = IA(x); if (elNum(xe)) { B r = taga(arr_shCopy(allZeroesFl(ia), x)); decG(x); return r; } if (elChr(xe)) { u8* rp; B r = m_c8arrc(&rp, x); for (usz i = 0; i < ia; i++) rp[i] = ' '; decG(x); return r; } M_HARR(r, IA(x)) SGet(x) for (usz i = 0; i < ia; i++) { if (noFill(HARR_ADD(r, i, asFill(Get(x,i))))) { HARR_ABANDON(r); decG(x); return bi_noFill; } } B xf = getFillR(x); return withFill(HARR_FCD(r, x), xf); } if (isF64(x)) return m_i32(0); if (isC32(x)) return m_c32(' '); dec(x); return bi_noFill; } static Arr* m_fillslice(Arr* p, B* ptr, usz ia, B fill) { FillSlice* r = m_arr(sizeof(FillSlice), t_fillslice, ia); r->p = p; r->a = ptr; r->fill = fill; return (Arr*)r; } static Arr* fillarr_slice (B x, usz s, usz ia) { FillArr* a=c(FillArr ,x); return m_fillslice((Arr*)a, a->a+s, ia, inc(a->fill)); } static Arr* fillslice_slice(B x, usz s, usz ia) { FillSlice* a=c(FillSlice,x); Arr* r=m_fillslice(ptr_inc(a->p), a->a+s, ia, inc(a->fill)); decG(x); return r; } static B fillarr_get (Arr* x, usz n) { assert(PTY(x)==t_fillarr ); return inc(((FillArr* )x)->a[n]); } static B fillslice_get (Arr* x, usz n) { assert(PTY(x)==t_fillslice); return inc(((FillSlice*)x)->a[n]); } static B fillarr_getU (Arr* x, usz n) { assert(PTY(x)==t_fillarr ); return ((FillArr* )x)->a[n] ; } static B fillslice_getU(Arr* x, usz n) { assert(PTY(x)==t_fillslice); return ((FillSlice*)x)->a[n] ; } DEF_FREE(fillarr) { decSh(x); B* p = ((FillArr*)x)->a; dec(((FillArr*)x)->fill); usz ia = PIA((Arr*)x); for (usz i = 0; i < ia; i++) dec(p[i]); } static void fillarr_visit(Value* x) { assert(PTY(x) == t_fillarr); VISIT_SHAPE(x); usz ia = PIA((Arr*)x); B* p = ((FillArr*)x)->a; mm_visit(((FillArr*)x)->fill); for (usz i = 0; i < ia; i++) mm_visit(p[i]); } static bool fillarr_canStore(B x) { return true; } static void fillarr_freeT(Value* x) { FillArr* s=(void*)x; dec(s->fill); decSh(x); mm_free(x); } static void fillslice_visit(Value* x) { FillSlice* s=(void*)x; mm_visitP(s->p); mm_visit(s->fill); VISIT_SHAPE(x); } static void fillslice_freeO(Value* x) { FillSlice* s=(void*)x; ptr_dec(s->p); dec(s->fill); decSh(x); } static void fillslice_freeF(Value* x) { fillslice_freeO(x); mm_free(x); } void fillarr_init(void) { TIi(t_fillarr,get) = fillarr_get; TIi(t_fillslice,get) = fillslice_get; TIi(t_fillarr,getU) = fillarr_getU; TIi(t_fillslice,getU) = fillslice_getU; TIi(t_fillarr,slice) = fillarr_slice; TIi(t_fillslice,slice) = fillslice_slice; TIi(t_fillarr,freeO) = fillarr_freeO; TIi(t_fillslice,freeO) = fillslice_freeO; TIi(t_fillarr,freeF) = fillarr_freeF; TIi(t_fillslice,freeF) = fillslice_freeF; TIi(t_fillarr,freeT) = fillarr_freeT; TIi(t_fillarr,visit) = fillarr_visit; TIi(t_fillslice,visit) = fillslice_visit; TIi(t_fillarr,print) = farr_print; TIi(t_fillslice,print) = farr_print; TIi(t_fillarr,isArr) = true; TIi(t_fillslice,isArr) = true; TIi(t_fillarr,canStore) = fillarr_canStore; } void validateFill(B x) { if (isArr(x)) { SGetU(x) usz ia = IA(x); for (usz i = 0; i < ia; i++) validateFill(GetU(x,i)); } else if (isF64(x)) { assert(x.f==0); } else if (isC32(x)) { assert(' '==(u32)x.u); } } NOINLINE bool fillEqualF(B w, B x) { // doesn't consume; both args must be arrays if (!eqShape(w, x)) return false; usz ia = IA(w); if (ia==0) return true; u8 we = TI(w,elType); u8 xe = TI(x,elType); if (we!=el_B && xe!=el_B) return elNum(we) == elNum(xe); SGetU(x) SGetU(w) for (usz i = 0; i < ia; i++) if(!fillEqual(GetU(w,i),GetU(x,i))) return false; return true; } B withFill(B x, B fill) { // consumes both assert(isArr(x)); if (DEBUG) validateFill(fill); u8 xt = TY(x); if (noFill(fill) && xt!=t_fillarr && xt!=t_fillslice) return x; switch(xt) { case t_f64arr: case t_f64slice: case t_bitarr: case t_i32arr: case t_i32slice: case t_i16arr: case t_i16slice: case t_i8arr: case t_i8slice: if(numFill(fill)) return x; break; case t_c32arr: case t_c32slice: case t_c16arr: case t_c16slice: case t_c8arr: case t_c8slice: if(chrFill(fill)) return x; break; case t_fillslice: if (fillEqual(c(FillSlice,x)->fill, fill)) { dec(fill); return x; } break; case t_fillarr: if (fillEqual(c(FillArr, x)->fill, fill)) { dec(fill); return x; } if (reusable(x)) { // keeping flags is fine probably dec(c(FillArr, x)->fill); c(FillArr, x)->fill = fill; return x; } break; } usz ia = IA(x); if (!FL_HAS(x,fl_squoze)) { u8 xe; if (numFill(fill)) { x = squeeze_numTry(x, &xe, SQ_ANY); if (elNum(xe)) return x; } else if (chrFill(fill)) { x = squeeze_chrTry(x, &xe, SQ_ANY); if (elChr(xe)) return x; } } Arr* r; B* xbp = arr_bptr(x); if (xbp!=NULL) { Arr* xa = a(x); if (IS_SLICE(PTY(xa))) xa = ptr_inc(((Slice*)xa)->p); else ptr_inc(xa); r = m_fillslice(xa, xbp, ia, fill); } else { FillArr* rf = m_arr(fsizeof(FillArr,a,B,ia), t_fillarr, ia); rf->fill = fill; COPY_TO(rf->a, el_B, 0, x, 0, ia); r = (Arr*)rf; } arr_shCopy(r, x); decG(x); return taga(r); } NOINLINE B m_funit(B x) { B xf = asFill(inc(x)); if (noFill(xf)) return m_hunit(x); FillArr* r = m_arr(fsizeof(FillArr,a,B,1), t_fillarr, 1); arr_shAtm((Arr*)r); r->fill = xf; r->a[0] = x; return taga(r); } NOINLINE B m_fvec1(B x) { Arr* ra = arr_shVec(m_fillarrp(1)); fillarrv_ptr(ra)[0] = x; fillarr_setFill(ra, m_f64(0)); NOGC_E; fillarr_setFill(ra, asFill(inc(x))); return taga(ra); } FORCE_INLINE B m_oneItemArr(B x, ur rr) { assert(rr<=1); u64 data; assert(sizeof(f64)<=8); u8 t; u64 sz; if (isF64(x)) { i32 xi = (i32)x.f; if (RARE(xi!=x.f)) { f64 v=x.f; memcpy(&data, &v, sz=sizeof(v)); t=t_f64arr; } else if (q_ibit(xi)) { u64 v=xi; memcpy(&data, &v, sz=sizeof(v)); t=t_bitarr; } else if (xi==(i8 )xi) { i8 v=xi; memcpy(&data, &v, sz=sizeof(v)); t=t_i8arr; } else if (xi==(i16)xi) { i16 v=xi; memcpy(&data, &v, sz=sizeof(v)); t=t_i16arr; } else { i32 v=xi; memcpy(&data, &v, sz=sizeof(v)); t=t_i32arr; } } else if (isC32(x)) { u32 xi = o2cG(x); if (xi==(u8 )xi) { u8 v=xi; memcpy(&data, &v, sz=sizeof(v)); t=t_c8arr; } else if (xi==(u16)xi) { u16 v=xi; memcpy(&data, &v, sz=sizeof(v)); t=t_c16arr; } else { u32 v=xi; memcpy(&data, &v, sz=sizeof(v)); t=t_c32arr; } } else { return rr==0? m_funit(x) : m_fvec1(x); } TyArr* r = m_arr(offsetof(TyArr,a) + sizeof(u64), t, 1); *((u64*)r->a) = data; FINISH_OVERALLOC(r, offsetof(TyArr,a)+sz, offsetof(TyArr,a)+sizeof(u64)); arr_rnk01((Arr*)r, rr); return taga(r); } NOINLINE B m_unit(B x) { return m_oneItemArr(x, 0); } NOINLINE B m_vec1(B x) { return m_oneItemArr(x, 1); } NOINLINE Arr* emptyArr(B x, ur xr) { assert(isArr(x)); u8 xe = TI(x,elType); if (xr==1) { if (elNum(xe)) goto numVec; if (elChr(xe)) goto chrVec; assert(xe == el_B); } B xf = getFillR(x); if (xr==1) { if (numFill(xf)) numVec: return a(emptyIVec()); if ( noFill(xf)) return a(emptyHVec()); if (chrFill(xf)) chrVec: return a(emptyCVec()); } Arr* r; if (numFill(xf)) { u64* rp; r = m_bitarrp(&rp, 0); } else if ( noFill(xf)) { r = (Arr*) m_harrUp(0).c; } else if (chrFill(xf)) { u8* rp; r = m_c8arrp(&rp, 0); } else { r = m_fillarrpEmpty(xf); } if (xr<=1) arr_rnk01(r, xr); return r; } NOINLINE Arr* emptyWithFill(B fill) { u8 type; if (numFill(fill)) { type = t_bitarr; goto tyarr; } if (chrFill(fill)) { type = t_c8arr; goto tyarr; } if ( noFill(fill)) return (Arr*) m_harrUp(0).c; return m_fillarrpEmpty(fill); tyarr:; Arr* r; m_tyarrp(&r, 0, 0, type); return r; } NOINLINE B emptyNumsWithShape(B x) { assert(IA(x)==0); if (RNK(x)==1) { decG(x); return emptyIVec(); } u64* tmp; B r = m_bitarrc(&tmp, x); decG(x); return r; } NOINLINE B emptyChrsWithShape(B x) { assert(IA(x)==0); if (RNK(x)==1) { decG(x); return emptyCVec(); } u8* tmp; B r = m_c8arrc(&tmp, x); decG(x); return r; }