#include "h.h" // a bunch of random things that don't really belong in any other file #include #include #ifndef MAP_NORESERVE #define MAP_NORESERVE 0 // apparently needed for freebsd or something #endif void empty_free(B x) { err("FREEING EMPTY\n"); } void builtin_free(B x) { err("FREEING BUILTIN\n"); } void def_visit(B x) { printf("(no visit for %d=%s)\n", v(x)->type, format_type(v(x)->type)); } void freed_visit(B x) { #ifndef CATCH_ERRORS err("visiting t_freed\n"); #endif } void def_print(B x) { printf("(%d=%s)", v(x)->type, format_type(v(x)->type)); } B def_identity(B f) { return bi_N; } B def_get (B x, usz n) { return inc(x); } B def_getU(B x, usz n) { return x; } B def_m1_d(B m, B f ) { thrM("cannot derive this"); } B def_m2_d(B m, B f, B g) { thrM("cannot derive this"); } B def_slice(B x, usz s) { thrM("cannot slice non-array!"); } bool def_canStore(B x) { return false; } void arr_print(B x) { // should accept refc=0 arguments for debugging purposes ur r = rnk(x); BS2B xgetU = TI(x).getU; usz ia = a(x)->ia; if (r!=1) { if (r==0) { printf("<"); print(xgetU(x,0)); return; } usz* sh = a(x)->sh; for (i32 i = 0; i < r; i++) { if(i==0)printf("%d",sh[i]); else printf("‿%d",sh[i]); } printf("⥊"); } else if (ia>0) { for (usz i = 0; i < ia; i++) { B c = xgetU(x,i); if (!isC32(c) || (u32)c.u=='\n') goto reg; } printf("\""); for (usz i = 0; i < ia; i++) printUTF8((u32)xgetU(x,i).u); // c32, no need to decrement printf("\""); return; } reg:; printf("⟨"); for (usz i = 0; i < ia; i++) { if (i!=0) printf(", "); print(xgetU(x,i)); } printf("⟩"); } void print(B x) { if (isF64(x)) { printf("%g", x.f); } else if (isC32(x)) { if ((u32)x.u>=32) { printf("'"); printUTF8((u32)x.u); printf("'"); } else if((u32)x.u>15) printf("\\x%x", (u32)x.u); else printf("\\x0%x", (u32)x.u); } else if (isI32(x)) { printf("%d", (i32)x.u); } else if (isVal(x)) { #ifdef DEBUG if (isVal(x) && (v(x)->type==t_freed || v(x)->type==t_empty)) { u8 t = v(x)->type; v(x)->type = v(x)->flags; printf(t==t_freed?"FREED:":"EMPTY:"); TI(x).print(x); v(x)->type = t; return; } #endif TI(x).print(x); } else if (isVar(x)) printf("(var d=%d i=%d)", (u16)(x.u>>32), (i32)x.u); else if (x.u==bi_N.u) printf("·"); else if (x.u==bi_optOut.u) printf("(value optimized out)"); else if (x.u==bi_noVar.u) printf("(unset variable placeholder)"); else if (x.u==bi_badHdr.u) printf("(bad header note)"); else if (x.u==bi_noFill.u) printf("(no fill placeholder)"); else printf("(todo tag %lx)", x.u>>48); } void printRaw(B x) { if (isAtm(x)) { if (isF64(x)) printf("%g", x.f); else if (isC32(x)) printUTF8((u32)x.u); else thrM("bad printRaw argument: atom arguments should be either numerical or characters"); } else { usz ia = a(x)->ia; BS2B xgetU = TI(x).getU; for (usz i = 0; i < ia; i++) { B c = xgetU(x,i); #ifndef CATCH_ERRORS if (c.u==0 || noFill(c)) { printf(" "); continue; } #endif if (!isC32(c)) thrM("bad printRaw argument: expected all character items"); printUTF8((u32)c.u); } } } B def_decompose(B x) { return m_v2(m_i32(isCallable(x)? 0 : -1),x); } bool atomEqual(B w, B x) { // doesn't consume (not that that matters really currently) if(isF64(w)&isF64(x)) return w.f==x.f; if (w.u==x.u) return true; if (!isVal(w) | !isVal(x)) return false; if (v(w)->type!=v(x)->type) return false; B2B dcf = TI(w).decompose; if (dcf == def_decompose) return false; B wd=dcf(inc(w)); B* wdp = harr_ptr(wd); B xd=dcf(inc(x)); B* xdp = harr_ptr(xd); if (o2i(wdp[0])<=1) { dec(wd);dec(xd); return false; } usz wia = a(wd)->ia; if (wia!=a(xd)->ia) { dec(wd);dec(xd); return false; } for (i32 i = 0; iia; BS2B xgetU = TI(x).getU; BS2B wgetU = TI(w).getU; for (usz i = 0; i < ia; i++) if(!equal(wgetU(w,i),xgetU(x,i))) return false; return true; } #define CMP(W,X) ({ AUTO wt = (W); AUTO xt = (X); (wt>xt?1:0)-(wtia; wr=rnk(w); wsh=a(w)->sh; wgetU=TI(w).getU; } if(xa) { xia=1; xr=0; xsh=NULL; xgetU=def_getU; } else { xia=a(x)->ia; xr=rnk(x); xsh=a(x)->sh; xgetU=TI(x).getU; } if (wia==0 || xia==0) return CMP(wia, xia); i32 rc = CMP(wr+(wa?0:1), xr+(xa?0:1)); ur rr = wrsh; ur xr = rnk(x); usz* xsh = a(x)->sh; if (wr!=xr) return false; if (wsh==xsh) return true; return eqShPrefix(wsh, xsh, wr); } usz arr_csz(B x) { ur xr = rnk(x); if (xr<=1) return 1; usz* sh = a(x)->sh; usz r = 1; for (i32 i = 1; i < xr; i++) r*= sh[i]; return r; } u8 fillElType(B x) { if (isNum(x)) return el_i32; if (isC32(x)) return el_c32; return el_B; } #ifdef DEBUG Value* VALIDATEP(Value* x) { if (x->refc<=0 || (x->refc>>28) == 'a' || x->type==t_empty) { printf("bad refcount for type %d: %d\nattempting to print: ", x->type, x->refc); fflush(stdout); print(tag(x,OBJ_TAG)); puts(""); fflush(stdout); err(""); } if (ti[x->type].isArr) { Arr* a = (Arr*)x; if (rnk(tag(x,ARR_TAG))<=1) assert(a->sh == &a->ia); else VALIDATE(tag(shObj(tag(x,ARR_TAG)),OBJ_TAG)); } return x; } B VALIDATE(B x) { if (!isVal(x)) return x; VALIDATEP(v(x)); if(isArr(x)!=TI(x).isArr && v(x)->type!=t_freed && v(x)->type!=t_harrPartial) { printf("wat %d %p\n", v(x)->type, (void*)x.u); print(x); err("\nk"); } return x; } #endif #ifdef USE_VALGRIND #include #include void pst(char* msg) { VALGRIND_PRINTF_BACKTRACE("%s", msg); } #endif static inline void hdr_init() { for (i32 i = 0; i < t_COUNT; i++) { ti[i].free = do_nothing; ti[i].visit = def_visit; ti[i].get = def_get; ti[i].getU = def_getU; ti[i].print = def_print; ti[i].m1_d = def_m1_d; ti[i].m2_d = def_m2_d; ti[i].isArr = false; ti[i].arrD1 = false; ti[i].elType = el_B; ti[i].identity = def_identity; ti[i].decompose = def_decompose; ti[i].slice = def_slice; ti[i].canStore = def_canStore; } ti[t_empty].free = empty_free; ti[t_freed].free = do_nothing; ti[t_freed].visit = freed_visit; ti[t_shape].visit = do_nothing; ti[t_funBI].visit = ti[t_md1BI].visit = ti[t_md2BI].visit = do_nothing; ti[t_funBI].free = ti[t_md1BI].free = ti[t_md2BI].free = builtin_free; bi_N = tag(0, TAG_TAG); bi_noVar = tag(1, TAG_TAG); bi_badHdr = tag(2, TAG_TAG); bi_optOut = tag(3, TAG_TAG); bi_noFill = tag(5, TAG_TAG); assert((MD1_TAG>>1) == (MD2_TAG>>1)); // just to be sure it isn't changed incorrectly, `isMd` depends on this } static NOINLINE B c1_invalid(B f, B x) { thrM("This function can't be called monadically"); } static NOINLINE B c2_invalid(B f, B w, B x) { thrM("This function can't be called dyadically"); } static B md_c1(B t, B x) { thrM("Cannot call a modifier"); } static B md_c2(B t, B w, B x) { thrM("Cannot call a modifier"); } static B arr_c1(B t, B x) { return inc(t); } static B arr_c2(B t, B w, B x) { return inc(t); } BB2B c1fn(B f) { if (isFun(f)) return c(Fun,f)->c1; if (isMd(f)) return md_c1; return arr_c1; } BBB2B c2fn(B f) { if (isFun(f)) return c(Fun,f)->c2; if (isMd(f)) return md_c2; return arr_c2; } #ifdef ALLOC_STAT u64* ctr_a = 0; u64* ctr_f = 0; u64 actrc = 21000; u64 talloc = 0; #ifdef ALLOC_SIZES u32** actrs; #endif #endif static inline void onAlloc(usz sz, u8 type) { #ifdef ALLOC_STAT if (!ctr_a) { #ifdef ALLOC_SIZES actrs = malloc(sizeof(u32*)*actrc); for (i32 i = 0; i < actrc; i++) actrs[i] = calloc(t_COUNT, sizeof(u32)); #endif ctr_a = calloc(t_COUNT, sizeof(u64)); ctr_f = calloc(t_COUNT, sizeof(u64)); } assert(type=actrc? actrc-1 : (sz+3)/4][type]++; #endif ctr_a[type]++; talloc+= sz; #endif } static inline void onFree(Value* x) { #ifdef ALLOC_STAT ctr_f[x->type]++; #endif #ifdef DEBUG if (x->type==t_empty) err("double-free"); // u32 undef; // x->refc = undef; x->refc = -1431655000; #endif // x->refc = 0x61616161; } void printAllocStats() { #ifdef ALLOC_STAT printf("total ever allocated: %lu\n", talloc); printf("allocated heap size: %ld\n", mm_heapAllocated()); printf("used heap size: %ld\n", mm_heapUsed()); ctr_a[t_harr]+= ctr_a[t_harrPartial]; ctr_a[t_harrPartial] = 0; printf("ctrA←"); for (i64 i = 0; i < t_COUNT; i++) { if(i)printf("‿"); printf("%lu", ctr_a[i]); } printf("\n"); printf("ctrF←"); for (i64 i = 0; i < t_COUNT; i++) { if(i)printf("‿"); printf("%lu", ctr_f[i]); } printf("\n"); u64 leakedCount = 0; for (i64 i = 0; i < t_COUNT; i++) leakedCount+= ctr_a[i]-ctr_f[i]; printf("leaked object count: %ld\n", leakedCount); #ifdef ALLOC_SIZES for(i64 i = 0; i < actrc; i++) { u32* c = actrs[i]; bool any = false; for (i64 j = 0; j < t_COUNT; j++) if (c[j]) any=true; if (any) { printf("%ld", i*4); for (i64 k = 0; k < t_COUNT; k++) printf("‿%u", c[k]); printf("\n"); } } #endif #endif } #define FOR_INIT(F) F(hdr) F(harr) F(fillarr) F(i32arr) F(c32arr) F(f64arr) F(fns) F(sfns) F(arith) F(grade) F(md1) F(md2) F(sysfn) F(derv) F(comp) F(rtPerf) F(ns) F(load) #define F(X) static inline void X##_init(); FOR_INIT(F) #undef F void cbqn_init() { #define F(X) X##_init(); FOR_INIT(F) #undef F } #undef FOR_INIT