code wiki / _hdl_build / _census_run_gate_authored.nx
_census_run_gate_authored.nx
buildroot/runtime/_hdl_build/_census_run_gate_authored.nx
about
_census_run_gate_authored.nx -- gate for X-AUT-003 (nx_census_run). Scratch worlds:
K1 GAP-NAMED universe item absent from target -> CENSUS-GAP row + verdict=GAPS (exit 0)
K2 COVERED all items present -> gaps=0 + verdict=COVERED
K3 LIVE real census.conf -> exit 0 + CENSUS-RUN row present
Markers: CSG-*; final CSGATE row -> knowledge/status/census_run.log
license_tier: 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
| none |
functions
| 8 | func cg_p(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 cg_f(fd: i64, s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(fd,s,n); return 0 } |
| 10 | func cg_n(fd: i64, v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m; sys_write(fd,"-" 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{bb[i]=t[k-1-i];i=i+1}; sys_write(fd,bb,k); return 0 } |
| 11 | func cg_len(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } |
| 12 | func cg_cat(dst: *u8, off: i64, s: *u8) -> i64 { var i: i64 = 0; while s[i] != (0 as u8) { dst[off+i] = s[i]; i = i + 1 } return off + i } |
| 13 | func cg_numcat(dst: *u8, off: i64, v: i64) -> i64 |
| 24 | func cg_mkpath(dst: *u8, epoch: i64, suffix: *u8) -> i64 |
| 31 | func cg_writes(path: *u8, s: *u8) -> i64 |
| 38 | func cg_writeb(path: *u8, buf: *u8, n: i64) -> i64 |
| 45 | func cg_run(cp: *u8, lp: *u8, live: i64) -> i64 |
| 69 | func cg_has(path: *u8, pat: *u8) -> i64 |
| 89 | func cg_chk(label: *u8, ok: i64, bad: *i64) -> i64 |
| 95 | func main() -> i64 |