code wiki / _hdl_build / nx_roadmap_test.nx

nx_roadmap_test.nx

buildroot/runtime/_hdl_build/nx_roadmap_test.nx

3038 B39 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_roadmap_test.nx -- the team generates its OWN roadmap (L8->L0 toward a SOTA-beating quantizer) and items CHECK THEMSELVES OFF as gates pass. Proves: progress is computed from gate status, the next build is the deepest still-TODO item (bits-up, not cherry-picked), and completing an item flips it to DONE automatically. Exit 0 if all hold. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_roadmap.nx nx_syscalls.nx nx_roadmap_test.nx

imports: nx_roadmap.nxnx_syscalls.nx

imported by: nobody (leaf or entry point)

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

main rt_puts sys_write sys_mmap rt_num sys_mmap ↻ sys_write ↻ rm_progress rm_count_done rm_layer_done rm_next sys_exit

structs

none

consts

none

functions

9func rt_puts(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
10func rt_num(v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m}; let t: *u8 = sys_mmap(28); var k: i64=0; if m==0 {t[0]=48;k=1}; while m>0 {t[k]=48+(m%10); m=m/10; k=k+1}; var i: i64=0; while i<k {bb[i]=t[k-1-i]; i=i+1}; sys_write(1, bb, k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
12func main() -> i64