code wiki / _hdl_build / nx_recycler_bench_compile.nx

nx_recycler_bench_compile.nx

buildroot/runtime/_hdl_build/nx_recycler_bench_compile.nx

4639 B78 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind benchtopic recycler

docs dependencies structs consts functions

about

nx_recycler_bench_compile.nx -- MEASURE Nishi compile speed to turn the benchmark's "compile-speed" axis from PROVABLE into PROVEN (the operator's "keep growing the provable evidence"). Times nx_cc_sovereign compiling the minimal program (nx_min, self-contained -- no imports, so nx_cc DIRECT is valid per CC-EXPIMP) to a .s, over N runs, with the monotonic-us clock. HONEST: Nishi's number is MEASURED here; the competitor baseline (Rust's slow compile times) is a DOCUMENTED criticism grounded in recyc_lang_rust.raw, NOT run by us. Self-gating. ORIGINAL

dependencies 1 imports · 0 importers

imports: nx_syscalls.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

structs

none

consts

7	const K_MAGIC_1000000: i64 = 1000000

functions

9	func gp(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } called by 1: main calls 1: sys_write
10	func gn(v0: i64) -> i64 { var v: i64=v0; if v<0{sys_write(1,"-" as u8,1);v=0-v} let b: u8=sys_mmap(24); var k: i64=0; if v==0{b[0]=48 as u8;k=1} while v>0{b[k]=(48+(v%10)) as u8;v=v/10;k=k+1} let o: *u8=sys_mmap(24); var j: i64=0; while j<k{o[j]=b[k-1-j];j=j+1} sys_write(1,o,k); return 0 } called by 1: main calls 2: sys_write sys_mmap
11	func lc(c: i64) -> i64 { if c>=65 { if c<=90 { return c+32 } } return c } called by 1: ground
12	func ground(file: u8, kw: u8) -> i64 called by 1: main calls 3: sys_mmap sys_read_file lc
23	func compile_once() -> i64 called by 1: main calls 8: sys_openat_wr sys_fork sys_dup3 sys_mmap sys_execve sys_exit+2
45	func main() -> i64 calls 8: gp compile_once sys_now_us sys_mmap sys_read_file ground+2