code wiki / _hdl_build / nx_aw_stack_census.nx

nx_aw_stack_census.nx

buildroot/runtime/_hdl_build/nx_aw_stack_census.nx

9174 B159 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind tooltopic aw
docsdependenciesstructsconstsfunctions

about

nx_aw_stack_census.nx -- DATA <> IO <> FUNCTIONAL census for the andelinwest client stack (operator 2026-07-03: "get the data layer <> io <> functional to state of the art"). PROVE-NOT-ASSERT (the nx_rung_eval doctrine): a row is PROVEN only when a REAL gate's status log carries verdict=GREEN (the gate ran and its referee passed); a row whose organ exists but has no run-evidence is PARTIAL; everything else is GAP. NO file-existence green-washing. LIAR-KILL: a bogus log row must grade GAP. The three layers, as built (each row names its evidence): FUNCTIONAL = pure bytes-in/bytes-out routers + generators, gate-driven in-process (no sockets) IO = daemons/edge (loopback HTTP behind the SNI router, Content-Length contract, TLS) DATA = seg_store append-only + CID + tombstones; append-only auth/invite/mailmap stores; versioned .site configs + .prev backups (rule 13: history is sacred) license_tier: ORIGINAL expect_exit: 0

dependencies 1 imports · 0 importers

nx_syscalls.nx nx_aw_stack_census.nx

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

main c_w sys_write sys_mmap c_row c_proven sys_mmap ↻ sys_read_file sys_openat_rd sys_lseek sys_mmap ↻ sys_read sys_close c_contains c_len c_src sys_openat_rd ↻ sys_close ↻ c_w ↻ sys_exit c_n sys_mmap ↻ sys_write ↻ sys_openat_append sys_write ↻ sys_close ↻

structs

none

consts

14const K_MAGIC_4096: i64 = 4096

functions

16func c_w(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 2: c_rowmain calls 1: sys_write
17func c_n(v: i64) -> i64 { let b: *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 as u8;k=1} while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1} var i: i64=0; while i<k{b[i]=t[k-1-i];i=i+1} sys_write(1,b,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
18func c_len(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n }
called by 1: c_contains
19func c_contains(hay: *u8, n: i64, needle: *u8) -> i64
called by 1: c_proven calls 1: c_len
27func c_proven(logpath: *u8, marker: *u8) -> i64
40func c_src(path: *u8) -> i64
called by 1: c_row calls 2: sys_openat_rdsys_close
47func c_row(name: *u8, logpath: *u8, marker: *u8, srcpath: *u8, note: *u8, score: *i64, tot: *i64) -> i64
called by 1: main calls 3: c_provenc_srcc_w
61func main() -> i64