195 lines
5.1 KiB
C
195 lines
5.1 KiB
C
// #define ATOM_I32
|
|
#ifdef DEBUG
|
|
// #define DEBUG_VM
|
|
#endif
|
|
// #define ALLOC_STAT
|
|
// #define FORMATTER
|
|
// #define TIME
|
|
#define FAKE_RUNTIME false
|
|
|
|
#include "h.h"
|
|
#include "mm_2buddy.c"
|
|
#include "harr.c"
|
|
#include "fillarr.c"
|
|
#include "i32arr.c"
|
|
#include "c32arr.c"
|
|
#include "utf.c"
|
|
#include "derv.c"
|
|
#include "arith.c"
|
|
#include "sfns.c"
|
|
#include "md1.c"
|
|
#include "md2.c"
|
|
#include "sysfn.c"
|
|
#include "vm.c"
|
|
|
|
void pr(char* a, B b) {
|
|
printf("%s", a);
|
|
print(b);
|
|
puts("");
|
|
dec(b);
|
|
fflush(stdout);
|
|
}
|
|
|
|
Block* ca3(B b) {
|
|
B* ps = harr_ptr(b);
|
|
Block* r = compile(inci(ps[0]),inci(ps[1]),inci(ps[2]));
|
|
dec(b);
|
|
return r;
|
|
}
|
|
|
|
#include <time.h>
|
|
u64 nsTime() {
|
|
struct timespec t;
|
|
timespec_get(&t, TIME_UTC);
|
|
return t.tv_sec*1000000000ull + t.tv_nsec;
|
|
}
|
|
|
|
u64 temp_heapUsage;
|
|
void heapUsedFn(Value* p) { temp_heapUsage+= mm_size(p); }
|
|
u64 heapUsed() {
|
|
temp_heapUsage = 0;
|
|
mm_forHeap(heapUsedFn);
|
|
return temp_heapUsage;
|
|
}
|
|
|
|
__ssize_t getline (char **__restrict __lineptr, size_t *restrict n, FILE *restrict stream);
|
|
|
|
int main() {
|
|
hdr_init();
|
|
harr_init();
|
|
fillarr_init();
|
|
i32arr_init();
|
|
c32arr_init();
|
|
arith_init();
|
|
sfns_init();
|
|
md1_init();
|
|
md2_init();
|
|
sysfn_init();
|
|
derv_init();
|
|
comp_init();
|
|
|
|
// fake runtime
|
|
B bi_N = bi_nothing;
|
|
B fruntime[] = {
|
|
/* +-×÷⋆√⌊⌈|¬ */ bi_add, bi_sub , bi_mul , bi_div, bi_pow, bi_N , bi_floor, bi_N , bi_N, bi_N,
|
|
/* ∧∨<>≠=≤≥≡≢ */ bi_N , bi_N , bi_N , bi_N , bi_N , bi_eq, bi_le , bi_N , bi_N, bi_fne,
|
|
/* ⊣⊢⥊∾≍↑↓↕«» */ bi_lt , bi_rt , bi_shape, bi_N , bi_N , bi_N , bi_N , bi_ud , bi_N, bi_N,
|
|
/* ⌽⍉/⍋⍒⊏⊑⊐⊒∊ */ bi_N , bi_N , bi_N , bi_N , bi_N , bi_N , bi_pick , bi_N , bi_N, bi_N,
|
|
/* ⍷⊔!˙˜˘¨⌜⁼´ */ bi_N , bi_N , bi_asrt , bi_N , bi_N , bi_N , bi_N , bi_tbl, bi_N, bi_N,
|
|
/* ˝`∘○⊸⟜⌾⊘◶⎉ */ bi_N , bi_scan, bi_N , bi_N , bi_N , bi_N , bi_N , bi_val, bi_N, bi_N,
|
|
/* ⚇⍟ */ bi_N , bi_fill
|
|
};
|
|
B frtObj = m_caB(62, fruntime);
|
|
|
|
Block* runtime_b = compile(
|
|
#include "runtime"
|
|
);
|
|
B rtRes = m_funBlock(runtime_b, 0); ptr_dec(runtime_b);
|
|
B rtObj = TI(rtRes).get(rtRes,0);
|
|
B rtFinish = TI(rtRes).get(rtRes,1);
|
|
B* runtime = toHArr(rtObj)->a;
|
|
runtimeLen = c(Arr,rtObj)->ia;
|
|
for (usz i = 0; i < runtimeLen; i++) {
|
|
if (isVal(runtime[i])) v(runtime[i])->flags|= i+1;
|
|
}
|
|
c1(rtFinish, m_v2(inci(bi_decp), inci(bi_primInd)));
|
|
|
|
// uncomment to use src/interp; needed for test.bqn
|
|
// Block* c = ca3(
|
|
// #include "interp"
|
|
// );
|
|
// B interp = m_funBlock(c, 0); ptr_dec(c);
|
|
// pr("result: ", interp);
|
|
// exit(0);
|
|
|
|
Block* comp_b = compile(
|
|
#include "compiler"
|
|
);
|
|
B comp = m_funBlock(comp_b, 0); ptr_dec(comp_b);
|
|
|
|
#ifdef FORMATTER
|
|
Block* fmt_b = compile(
|
|
#include "formatter"
|
|
);
|
|
B fmtM = m_funBlock(fmt_b, 0); ptr_dec(fmt_b);
|
|
B fmt = TI(fmtM).m1_d(fmtM, m_caB(4, (B[]){inci(bi_type), inci(bi_decp), inci(bi_fmtF), inci(bi_fmtN)}));
|
|
#endif
|
|
|
|
|
|
// uncomment to self-compile and use that for the REPL; expects a copy of mlochbaum/BQN/src/c.bqn to be at the execution directory
|
|
// char* c_src = 0;
|
|
// u64 c_len;
|
|
// FILE* f = fopen("c.bqn", "rb");
|
|
// if (f) {
|
|
// fseek(f, 0, SEEK_END);
|
|
// c_len = ftell(f);
|
|
// fseek(f, 0, SEEK_SET);
|
|
// c_src = malloc(c_len);
|
|
// if (c_src) fread(c_src, 1, c_len, f);
|
|
// fclose(f);
|
|
// } else {
|
|
// printf("couldn't read c.bqn\n");
|
|
// exit(1);
|
|
// }
|
|
// if (c_src) {
|
|
// B cbc = c2(comp, inci(rtObj), fromUTF8(c_src, c_len));
|
|
// Block* cbc_b = ca3(cbc);
|
|
// comp = m_funBlock(cbc_b, 0);
|
|
// free(c_src);
|
|
// }
|
|
|
|
B currentRuntime = FAKE_RUNTIME? frtObj : rtObj;
|
|
|
|
while (true) { // exit by evaluating an empty expression
|
|
char* ln = NULL;
|
|
size_t gl = 0;
|
|
getline(&ln, &gl, stdin);
|
|
if (ln[0]==10) break;
|
|
B obj = fromUTF8(ln, strlen(ln));
|
|
B cbc = c2(comp, inci(currentRuntime), obj);
|
|
free(ln);
|
|
Block* cbc_b = ca3(cbc);
|
|
|
|
#ifdef TIME
|
|
u64 sns = nsTime();
|
|
B res = m_funBlock(cbc_b, 0);
|
|
u64 ens = nsTime();
|
|
printf("%fms\n", (ens-sns)/1e6);
|
|
#else
|
|
B res = m_funBlock(cbc_b, 0);
|
|
#endif
|
|
|
|
#ifdef FORMATTER
|
|
B resFmt = c1(fmt, res);
|
|
printRaw(resFmt); dec(resFmt);
|
|
printf("\n");
|
|
#else
|
|
pr("", res);
|
|
#endif
|
|
|
|
}
|
|
|
|
dec(rtRes);
|
|
dec(comp);
|
|
|
|
|
|
// printf("done\n");fflush(stdout); while(1);
|
|
#ifdef ALLOC_STAT
|
|
printf("total ever allocated: %lu\n", talloc);
|
|
printf("final heap size: %ld\n", mm_totalAllocated());
|
|
printf("leaked heap size: %ld\n", heapUsed());
|
|
printf("ctrA←"); for (i64 i = 0; i < Type_MAX; i++) { if(i)printf("‿"); printf("%lu", ctr_a[i]); } printf("\n");
|
|
printf("ctrF←"); for (i64 i = 0; i < Type_MAX; i++) { if(i)printf("‿"); printf("%lu", ctr_f[i]); } printf("\n");
|
|
for(i64 i = 0; i < actrc; i++) {
|
|
u32* c = actrs[i];
|
|
bool any = false;
|
|
for (i64 j = 0; j < Type_MAX; j++) if (c[j]) any=true;
|
|
if (any) {
|
|
printf("%ld", i*4);
|
|
for (i64 k = 0; k < Type_MAX; k++) printf("‿%u", c[k]);
|
|
printf("\n");
|
|
}
|
|
}
|
|
#endif
|
|
}
|