code wiki / _hdl_build / nx_layered_backlog_test.nx
nx_layered_backlog_test.nx
buildroot/runtime/_hdl_build/nx_layered_backlog_test.nx
about
nx_layered_backlog_test.nx -- prove "next moves" are deterministic + L8-up + parallel + no-skip.
A backlog with the foundation (L8..L5) done and work remaining at L4/L3/L0 must: pick L4 as the
frontier, return BOTH L4 items as the parallel batch, refuse to build L3 or the L0 output yet,
and -- once L4 completes -- advance the frontier to L3. Exit 0 if all hold. license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_layered_backlog.nxnx_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
| none |
functions
| 9 | func bt_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 10 | func bt_num(v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m; sys_write(1,"-" as *u8,1)}; 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 } |
| 12 | func main() -> i64 |