code wiki / _hdl_build / nx_eco_graph_gate.nx
nx_eco_graph_gate.nx
buildroot/runtime/_hdl_build/nx_eco_graph_gate.nx
about
nx_eco_graph_gate.nx -- proves the R0 graph query engine (roots-to-god / children / coupling / orphan) on a
synthetic KNOWN graph (diamond + orphan + isolated island), deterministically, with a NEG-CONTROL (the
isolated node reaches nothing = the traversal is real, not returning everything). license_tier: ORIGINAL expect_exit: 0
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_eco_graph.nxnx_gate_verdict.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
| 8 | func hw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 9 | func pn(v: i64) -> i64 { let b: *u8=sys_mmap(24); var m: i64=v; if m<0{sys_write(1,"-" as *u8,1);m=0-m} let t: *u8=sys_mmap(24); var k: i64=0; if m==0{t[0]=48 as u8;k=1} while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1} var j: i64=0; while j<k{b[j]=t[k-1-j];j=j+1} sys_write(1,b,k); return 0 } |
| 10 | func slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: gi |
| 11 | func gi(g: *EcoGraph, s: *u8) -> i64 { return eg_intern(g, s, slen(s)) } |
| 12 | func zero(v: *u8, n: i64) -> i64 { var i: i64=0; while i<n { v[i]=0 as u8; i=i+1 } return 0 } called by 1: main |
| 14 | func main() -> i64 |