#include "../core.h" #include "../utils/hash.h" #include "../utils/talloc.h" #include "../utils/calls.h" #define C2i(F, W, X) C2(F, m_i32(W), X) extern B eq_c2(B,B,B); extern B ne_c2(B,B,B); extern B or_c2(B,B,B); extern B add_c2(B,B,B); extern B sub_c2(B,B,B); extern B mul_c2(B,B,B); static u64 elRange(u8 eltype) { return 1ull<<(1<ft? it : ft; /* Table allocation width */ \ TALLOC(TY, tab0, t); TY* tab = tab0 + t/2; \ usz m=IN##ia, n=FOR##ia; \ void* ip = tyany_ptr(IN); \ void* fp = tyany_ptr(FOR); \ /* Initialize */ \ if (FOR##e==el_i16 && n16 && we20 && we<=el_i16 && xe<=el_i16) { B r; TABLE(w, x, i32, wia, i) return r; } i32* rp; B r = m_i32arrc(&rp, x); H_b2i* map = m_b2i(64); SGetU(x) SGetU(w) for (usz i = 0; i < wia; i++) { bool had; u64 p = mk_b2i(&map, GetU(w,i), &had); if (!had) map->a[p].val = i; } for (usz i = 0; i < xia; i++) rp[i] = getD_b2i(map, GetU(x,i), wia); free_b2i(map); decG(w); decG(x); return wia<=I8_MAX? taga(cpyI8Arr(r)) : wia<=I16_MAX? taga(cpyI16Arr(r)) : r; } } B enclosed_0; B enclosed_1; B memberOf_c2(B t, B w, B x) { if (isAtm(x) || RNK(x)!=1) { B2 t = splitCells(w, x, false); w = t.n; x = t.p; } if (isAtm(w)) goto single; ur wr = RNK(w); if (wr>0) goto many; B w0 = IGet(w, 0); dec(w); w = w0; goto single; B r; single: { usz xia = IA(x); SGetU(x) for (usz i = 0; i < xia; i++) if (equal(GetU(x, i), w)) { r = incG(enclosed_1); goto dec_wx; } r = incG(enclosed_0); dec_wx:; dec(w); goto dec_x; } many: { u8 we = TI(w,elType); usz wia = IA(w); u8 xe = TI(x,elType); usz xia = IA(x); if (xia == 0) { r=taga(arr_shCopy(allZeroes(wia), w)); decG(w); goto dec_x; } #define WEQ(V) C2(eq, incG(w), V) if (xe==el_bit) { u64* xp = bitarr_ptr(x); u64 x0 = 1 & xp[0]; r = WEQ(m_usz(x0)); if (bit_has(xp, xia, !x0)) r = C2(or, r, WEQ(m_usz(!x0))); decG(w); goto dec_x; } if (xia<=(xe==el_i16?8:16) && wia>16 && we20 && we<=el_i16 && xe<=el_i16) { B r; TABLE(x, w, i8, 0, 1) return num_squeeze(r); } H_Sb* set = m_Sb(64); SGetU(x) SGetU(w) bool had; for (usz i = 0; i < xia; i++) mk_Sb(&set, GetU(x,i), &had); u64* rp; r = m_bitarrc(&rp, w); for (usz i = 0; i < wia; i++) bitp_set(rp, i, has_Sb(set, GetU(w,i))); free_Sb(set); decG(w); goto dec_x; } dec_x:; decG(x); return r; } B count_c2(B t, B w, B x) { if (RARE(!isArr(w) || RNK(w)!=1)) { B2 t = splitCells(x, w, 2); w = t.p; x = t.n; } if (!isArr(x) || IA(x)<=1) return indexOf_c2(m_f64(0), w, x); u8 we = TI(w,elType); usz wia = IA(w); u8 xe = TI(x,elType); usz xia = IA(x); i32* rp; B r = m_i32arrc(&rp, x); TALLOC(usz, wnext, wia+1); wnext[wia] = wia; if (we<=el_i16 && xe<=el_i16) { if (we==el_bit) { w = toI8Any(w); we = TI(w,elType); } if (xe==el_bit) { x = toI8Any(x); xe = TI(x,elType); } usz it = elRange(we); // Range of writes usz ft = elRange(xe); // Range of lookups usz t = it>ft? it : ft; // Table allocation width TALLOC(i32, tab0, t); i32* tab = tab0 + t/2; usz m=wia, n=xia; void* ip = tyany_ptr(w); void* fp = tyany_ptr(x); // Initialize if (xe==el_i16 && na[p].val : wia; map->a[p].val = i; } for (usz i = 0; i < xia; i++) { bool had; u64 p = getQ_b2i(map, GetU(x,i), &had); usz j = wia; if (had) { j = map->a[p].val; map->a[p].val = wnext[j]; } rp[i] = j; } free_b2i(map); } TFREE(wnext); decG(w); decG(x); return wia<=I8_MAX? taga(cpyI8Arr(r)) : wia<=I16_MAX? taga(cpyI16Arr(r)) : r; } void search_init() { { u64* p; Arr* a=m_bitarrp(&p, 1); arr_shAtm(a); *p= 0; gc_add(enclosed_0=taga(a)); } { u64* p; Arr* a=m_bitarrp(&p, 1); arr_shAtm(a); *p=~0ULL; gc_add(enclosed_1=taga(a)); } }