245 lines
11 KiB
C
245 lines
11 KiB
C
#include "../core.h"
|
||
#include "../utils/mut.h"
|
||
#include "../builtins.h"
|
||
|
||
#if !USE_VALGRIND
|
||
static u64 vg_rand(u64 x) { return x; }
|
||
#endif
|
||
|
||
#if SINGELI
|
||
#pragma GCC diagnostic push
|
||
#pragma GCC diagnostic ignored "-Wunused-variable"
|
||
#include "../singeli/gen/scan.c"
|
||
#pragma GCC diagnostic pop
|
||
#endif
|
||
|
||
#if SINGELI && __PCLMUL__
|
||
#pragma GCC diagnostic push
|
||
#pragma GCC diagnostic ignored "-Wunused-variable"
|
||
#include "../singeli/gen/neq.c"
|
||
#pragma GCC diagnostic pop
|
||
#endif
|
||
B scan_ne(B x, u64 p, u64 ia) { // consumes x
|
||
u64* xp = bitarr_ptr(x);
|
||
u64* rp; B r=m_bitarrv(&rp,ia);
|
||
#if SINGELI && __PCLMUL__
|
||
clmul_scan_ne(p, xp, rp, BIT_N(ia));
|
||
#else
|
||
for (usz i = 0; i < BIT_N(ia); i++) {
|
||
u64 c = xp[i];
|
||
u64 r = c ^ (c<<1);
|
||
r^= r<< 2; r^= r<< 4; r^= r<<8;
|
||
r^= r<<16; r^= r<<32; r^= p;
|
||
rp[i] = r;
|
||
p = -(r>>63); // repeat sign bit
|
||
}
|
||
#endif
|
||
decG(x); return r;
|
||
}
|
||
|
||
static B scan_or(B x, u64 ia) { // consumes x
|
||
u64* xp = bitarr_ptr(x);
|
||
u64* rp; B r=m_bitarrv(&rp,ia);
|
||
usz n=BIT_N(ia); u64 xi; usz i=0;
|
||
while (i<n) if ((xi= vg_rand(xp[i]))!=0) { rp[i] = -(xi&-xi) ; i++; while(i<n) rp[i++] = ~0LL; break; } else rp[i++]=0;
|
||
decG(x); return FL_SET(r, fl_asc|fl_squoze);
|
||
}
|
||
static B scan_and(B x, u64 ia) { // consumes x
|
||
u64* xp = bitarr_ptr(x);
|
||
u64* rp; B r=m_bitarrv(&rp,ia);
|
||
usz n=BIT_N(ia); u64 xi; usz i=0;
|
||
while (i<n) if ((xi=~vg_rand(xp[i]))!=0) { rp[i] = (xi&-xi)-1; i++; while(i<n) rp[i++] = 0 ; break; } else rp[i++]=~0LL;
|
||
decG(x); return FL_SET(r, fl_dsc|fl_squoze);
|
||
}
|
||
|
||
B slash_c1(B f, B x);
|
||
B scan_add_bool(B x, u64 ia) { // consumes x
|
||
u64* xp = bitarr_ptr(x);
|
||
u64 xs = bit_sum(xp, ia);
|
||
if (xs<=1) return xs==0? x : scan_or(x, ia);
|
||
B r;
|
||
u8 re = xs<=I8_MAX? el_i8 : xs<=I16_MAX? el_i16 : xs<=I32_MAX? el_i32 : el_f64;
|
||
if (xs < ia/128) {
|
||
B ones = slash_c1(m_f64(0), x);
|
||
MAKE_MUT(r0, ia) mut_init(r0, re); MUTG_INIT(r0);
|
||
SGetU(ones)
|
||
usz ri = 0;
|
||
for (usz i = 0; i < xs; i++) {
|
||
usz e = o2s(GetU(ones, i));
|
||
mut_fillG(r0, ri, m_usz(i), e-ri);
|
||
ri = e;
|
||
}
|
||
if (ri<ia) mut_fillG(r0, ri, m_usz(xs), ia-ri);
|
||
decG(ones);
|
||
r = mut_fv(r0);
|
||
} else {
|
||
void* rp = m_tyarrv(&r, elWidth(re), ia, el2t(re));
|
||
#define SUM_BITWISE(T) { T c=0; for (usz i=0; i<ia; i++) { c+= bitp_get(xp,i); ((T*)rp)[i]=c; } }
|
||
#if SINGELI
|
||
#define SUM(W,T) avx2_bcs##W(xp, rp, ia);
|
||
#else
|
||
#define SUM(W,T) SUM_BITWISE(T)
|
||
#endif
|
||
#define CASE(W) case el_i##W: SUM(W, i##W) break;
|
||
switch (re) { default:UD;
|
||
CASE(8) CASE(16) CASE(32) case el_f64: SUM_BITWISE(f64) break;
|
||
}
|
||
#undef CASE
|
||
#undef SUM
|
||
#undef SUM_BITWISE
|
||
decG(x);
|
||
}
|
||
return FL_SET(r, fl_asc|fl_squoze);
|
||
}
|
||
|
||
#if SINGELI
|
||
#define MINMAX_SCAN(T,NAME,C,I) avx2_scan_##NAME##_##T(xp, rp, ia);
|
||
#else
|
||
#define MINMAX_SCAN(T,NAME,C,I) T c=I; for (usz i=0; i<ia; i++) { if (xp[i] C c)c=xp[i]; rp[i]=c; }
|
||
#endif
|
||
#define MM_CASE(T,N,C,I) \
|
||
case el_##T : { T* xp=T##any_ptr(x); T* rp; r=m_##T##arrv(&rp, ia); MINMAX_SCAN(T,N,C,I); break; }
|
||
#define MINMAX(NAME,C,INIT,ORD) \
|
||
B r; switch (xe) { default:UD; \
|
||
MM_CASE(i8 ,NAME,C,I8_##INIT ) \
|
||
MM_CASE(i16,NAME,C,I16_##INIT) \
|
||
MM_CASE(i32,NAME,C,I32_##INIT) \
|
||
} \
|
||
decG(x); return FL_SET(r, fl_##ORD);
|
||
static B scan_min_int(B x, u8 xe, usz ia) { MINMAX(min,<,MAX,dsc) }
|
||
static B scan_max_int(B x, u8 xe, usz ia) { MINMAX(max,>,MIN,asc) }
|
||
#undef MM_CASE
|
||
#undef MINMAX
|
||
#undef MINMAX_SCAN
|
||
|
||
B scan_c1(Md1D* d, B x) { B f = d->f;
|
||
if (isAtm(x) || RNK(x)==0) thrM("`: Argument cannot have rank 0");
|
||
ur xr = RNK(x);
|
||
usz ia = IA(x);
|
||
if (ia==0) return x;
|
||
B xf = getFillQ(x);
|
||
u8 xe = TI(x,elType);
|
||
if (xr==1 && xe<=el_f64 && isFun(f) && v(f)->flags) {
|
||
u8 rtid = v(f)->flags-1;
|
||
if (xe==el_bit) {
|
||
u64* xp=bitarr_ptr(x);
|
||
if (rtid==n_add ) return scan_add_bool(x, ia);
|
||
if (rtid==n_or | rtid==n_ceil ) return scan_or(x, ia);
|
||
if (rtid==n_and | rtid==n_mul | rtid==n_floor) return scan_and(x, ia);
|
||
if (rtid==n_ne ) return scan_ne(x, 0, ia);
|
||
if (rtid==n_lt) {
|
||
u64* rp; B r=m_bitarrv(&rp,ia); usz n=BIT_N(ia);
|
||
u64 m10 = 0x5555555555555555;
|
||
u64 p = 0;
|
||
for (usz i=0; i<n; i++) {
|
||
u64 x = xp[i];
|
||
u64 c = (m10 & ~(x<<1)) & ~(p>>63);
|
||
rp[i] = p = x & (m10 ^ (x + c));
|
||
}
|
||
decG(x); return r;
|
||
}
|
||
goto base;
|
||
}
|
||
if (rtid==n_add) { // +
|
||
if (xe==el_i8 ) { i8* xp=i8any_ptr (x); i32* rp; B r=m_i32arrv(&rp, ia); i32 c=0; for (usz i=0; i<ia; i++) { if(addOn(c,xp[i]))goto base; rp[i]=c; } decG(x); return r; }
|
||
if (xe==el_i16) { i16* xp=i16any_ptr(x); i32* rp; B r=m_i32arrv(&rp, ia); i32 c=0; for (usz i=0; i<ia; i++) { if(addOn(c,xp[i]))goto base; rp[i]=c; } decG(x); return r; }
|
||
if (xe==el_i32) { i32* xp=i32any_ptr(x); i32* rp; B r=m_i32arrv(&rp, ia); i32 c=0; for (usz i=0; i<ia; i++) { if(addOn(c,xp[i]))goto base; rp[i]=c; } decG(x); return r; }
|
||
}
|
||
if (rtid==n_floor && xe<el_f64) return scan_min_int(x, xe, ia); // ⌊
|
||
if (rtid==n_ceil && xe<el_f64) return scan_max_int(x, xe, ia); // ⌈
|
||
if (rtid==n_ne) { // ≠
|
||
f64 x0 = IGetU(x,0).f; if (x0!=0 && x0!=1) goto base;
|
||
if (xe==el_i8 ) { i8* xp=i8any_ptr (x); u64* rp; B r=m_bitarrv(&rp,ia); bool c=x0; rp[0]=c; for (usz i=1; i<ia; i++) { c = c!=xp[i]; bitp_set(rp,i,c); } decG(x); return r; }
|
||
if (xe==el_i16) { i16* xp=i16any_ptr(x); u64* rp; B r=m_bitarrv(&rp,ia); bool c=x0; rp[0]=c; for (usz i=1; i<ia; i++) { c = c!=xp[i]; bitp_set(rp,i,c); } decG(x); return r; }
|
||
if (xe==el_i32) { i32* xp=i32any_ptr(x); u64* rp; B r=m_bitarrv(&rp,ia); bool c=x0; rp[0]=c; for (usz i=1; i<ia; i++) { c = c!=xp[i]; bitp_set(rp,i,c); } decG(x); return r; }
|
||
}
|
||
if (rtid==n_or) { // ∨
|
||
if (xe==el_i8 ) { i8* xp=i8any_ptr (x); u64* rp; B r=m_bitarrv(&rp,ia); bool c=0; for (usz i=0; i<ia; i++) { if ((xp[i]&1)!=xp[i])goto base; c|=xp[i]; bitp_set(rp,i,c); } decG(x); return r; }
|
||
if (xe==el_i16) { i16* xp=i16any_ptr(x); u64* rp; B r=m_bitarrv(&rp,ia); bool c=0; for (usz i=0; i<ia; i++) { if ((xp[i]&1)!=xp[i])goto base; c|=xp[i]; bitp_set(rp,i,c); } decG(x); return r; }
|
||
if (xe==el_i32) { i32* xp=i32any_ptr(x); u64* rp; B r=m_bitarrv(&rp,ia); bool c=0; for (usz i=0; i<ia; i++) { if ((xp[i]&1)!=xp[i])goto base; c|=xp[i]; bitp_set(rp,i,c); } decG(x); return r; }
|
||
}
|
||
}
|
||
base:;
|
||
SLOW2("𝕎` 𝕩", f, x);
|
||
|
||
bool reuse = TY(x)==t_harr && reusable(x);
|
||
HArr_p r = reuse? harr_parts(REUSE(x)) : m_harr0c(x);
|
||
AS2B xget = reuse? TI(x,getU) : TI(x,get); Arr* xa = a(x);
|
||
BBB2B fc2 = c2fn(f);
|
||
|
||
if (xr==1) {
|
||
r.a[0] = xget(xa,0);
|
||
for (usz i=1; i<ia; i++) r.a[i] = fc2(f, inc(r.a[i-1]), xget(xa,i));
|
||
} else {
|
||
usz csz = arr_csz(x);
|
||
usz i = 0;
|
||
for (; i<csz; i++) r.a[i] = xget(xa,i);
|
||
for (; i<ia; i++) r.a[i] = fc2(f, inc(r.a[i-csz]), xget(xa,i));
|
||
}
|
||
if (!reuse) decG(x);
|
||
return withFill(r.b, xf);
|
||
}
|
||
|
||
B scan_c2(Md1D* d, B w, B x) { B f = d->f;
|
||
if (isAtm(x) || RNK(x)==0) thrM("`: 𝕩 cannot have rank 0");
|
||
ur xr = RNK(x); usz* xsh = SH(x); usz ia = IA(x);
|
||
B wf = getFillQ(w);
|
||
u8 xe = TI(x,elType);
|
||
if (xr==1 && q_i32(w) && elInt(xe) && isFun(f) && v(f)->flags) {
|
||
u8 rtid = v(f)->flags-1;
|
||
i32 wv = o2iG(w);
|
||
if (xe==el_bit) {
|
||
u64* xp=bitarr_ptr(x);
|
||
if (rtid==n_add) { i32* rp; B r=m_i32arrv(&rp, ia); i64 c=wv; for (usz i=0; i<ia; i++) { c+= bitp_get(xp,i); rp[i]=c; } decG(x); return r; }
|
||
if (rtid==n_ne) return scan_ne(x, -(u64)(q_ibit(wv)?wv:1&~*xp), ia);
|
||
goto base;
|
||
}
|
||
if (rtid==n_add) { // +
|
||
if (xe==el_i8 ) { i8* xp=i8any_ptr (x); i32* rp; B r=m_i32arrv(&rp, ia); i32 c=wv; for (usz i=0; i<ia; i++) { if(addOn(c,xp[i]))goto base; rp[i]=c; } decG(x); return r; }
|
||
if (xe==el_i16) { i16* xp=i16any_ptr(x); i32* rp; B r=m_i32arrv(&rp, ia); i32 c=wv; for (usz i=0; i<ia; i++) { if(addOn(c,xp[i]))goto base; rp[i]=c; } decG(x); return r; }
|
||
if (xe==el_i32) { i32* xp=i32any_ptr(x); i32* rp; B r=m_i32arrv(&rp, ia); i32 c=wv; for (usz i=0; i<ia; i++) { if(addOn(c,xp[i]))goto base; rp[i]=c; } decG(x); return r; }
|
||
}
|
||
if (rtid==n_floor) { // ⌊
|
||
if (xe==el_i8 && wv==(i8 )wv) { i8* xp=i8any_ptr (x); i8* rp; B r=m_i8arrv (&rp, ia); i8 c=wv; for (usz i=0; i<ia; i++) { if (xp[i]<c)c=xp[i]; rp[i]=c; } decG(x); return r; }
|
||
if (xe==el_i16 && wv==(i16)wv) { i16* xp=i16any_ptr(x); i16* rp; B r=m_i16arrv(&rp, ia); i16 c=wv; for (usz i=0; i<ia; i++) { if (xp[i]<c)c=xp[i]; rp[i]=c; } decG(x); return r; }
|
||
if (xe==el_i32 && wv==(i32)wv) { i32* xp=i32any_ptr(x); i32* rp; B r=m_i32arrv(&rp, ia); i32 c=wv; for (usz i=0; i<ia; i++) { if (xp[i]<c)c=xp[i]; rp[i]=c; } decG(x); return r; }
|
||
}
|
||
if (rtid==n_ceil) { // ⌈
|
||
if (xe==el_i8 && wv==(i8 )wv) { i8* xp=i8any_ptr (x); i8* rp; B r=m_i8arrv (&rp, ia); i8 c=wv; for (usz i=0; i<ia; i++) { if (xp[i]>c)c=xp[i]; rp[i]=c; } decG(x); return r; }
|
||
if (xe==el_i16 && wv==(i16)wv) { i16* xp=i16any_ptr(x); i16* rp; B r=m_i16arrv(&rp, ia); i16 c=wv; for (usz i=0; i<ia; i++) { if (xp[i]>c)c=xp[i]; rp[i]=c; } decG(x); return r; }
|
||
if (xe==el_i32 && wv==(i32)wv) { i32* xp=i32any_ptr(x); i32* rp; B r=m_i32arrv(&rp, ia); i32 c=wv; for (usz i=0; i<ia; i++) { if (xp[i]>c)c=xp[i]; rp[i]=c; } decG(x); return r; }
|
||
}
|
||
if (rtid==n_ne) { // ≠
|
||
if (!q_ibit(wv)) { goto base; } bool c=wv;
|
||
if (xe==el_i8 ) { i8* xp=i8any_ptr (x); u64* rp; B r=m_bitarrv(&rp, ia); for (usz i=0; i<ia; i++) { c^= xp[i]; bitp_set(rp,i,c); } decG(x); return r; }
|
||
if (xe==el_i16) { i16* xp=i16any_ptr(x); u64* rp; B r=m_bitarrv(&rp, ia); for (usz i=0; i<ia; i++) { c^= xp[i]; bitp_set(rp,i,c); } decG(x); return r; }
|
||
if (xe==el_i32) { i32* xp=i32any_ptr(x); u64* rp; B r=m_bitarrv(&rp, ia); for (usz i=0; i<ia; i++) { c^= xp[i]; bitp_set(rp,i,c); } decG(x); return r; }
|
||
}
|
||
}
|
||
base:;
|
||
SLOW3("𝕨 F` 𝕩", w, x, f);
|
||
|
||
bool reuse = (TY(x)==t_harr && reusable(x)) | !ia;
|
||
usz i = 0;
|
||
HArr_p r = reuse? harr_parts(REUSE(x)) : m_harr0c(x);
|
||
AS2B xget = reuse? TI(x,getU) : TI(x,get); Arr* xa = a(x);
|
||
BBB2B fc2 = c2fn(f);
|
||
|
||
if (isArr(w)) {
|
||
ur wr = RNK(w); usz* wsh = SH(w); SGet(w)
|
||
if (wr+1!=xr || !eqShPart(wsh, xsh+1, wr)) thrF("`: Shape of 𝕨 must match the cell of 𝕩 (%H ≡ ≢𝕨, %H ≡ ≢𝕩)", w, x);
|
||
if (ia==0) return x;
|
||
usz csz = arr_csz(x);
|
||
for (; i < csz; i++) r.a[i] = fc2(f, Get(w,i), xget(xa,i));
|
||
for (; i < ia; i++) r.a[i] = fc2(f, inc(r.a[i-csz]), xget(xa,i));
|
||
decG(w);
|
||
} else {
|
||
if (xr!=1) thrF("`: Shape of 𝕨 must match the cell of 𝕩 (%H ≡ ≢𝕨, %H ≡ ≢𝕩)", w, x);
|
||
if (ia==0) return x;
|
||
B pr = r.a[0] = fc2(f, w, xget(xa,0)); i++;
|
||
for (; i < ia; i++) r.a[i] = pr = fc2(f, inc(pr), xget(xa,i));
|
||
}
|
||
if (!reuse) decG(x);
|
||
return withFill(r.b, wf);
|
||
}
|