code wiki / _hdl_build / nx_sitegen_gate.nx
nx_sitegen_gate.nx
buildroot/runtime/_hdl_build/nx_sitegen_gate.nx
about
nx_sitegen_gate.nx -- gate for the AUTO-BUILDER ENGINE (nx_sitegen). Proves a whole site page builds from a
DECLARATIVE BLUEPRINT (data) via the sovereign emitters, deterministically, with refuse-by-construction and
graceful-unknown-block. Positive AND negative controls. It builds the andelinwest legal site FROM A DATA
BLUEPRINT (the same content the hand-written nx_web_builder_test emitted by procedural calls -- now driven
by data), reads the output back over a real fd, and asserts: the UX elements are present; non-compliant
blueprints are REFUSED with ZERO bytes emitted; an unknown block kind is skipped without corrupting the
page; and the same blueprint builds BYTE-IDENTICAL twice (reproducible = the anti-vendor-lock property).
Appends "CMSGATE row=nx_sitegen site-builder ... verdict=PASS" to knowledge/status/cms_gate.log ONLY on
all-pass. Exit 0 iff all pass. license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_sitegen.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
| 13 | func sg_w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 14 | func sg_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 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(1,bb,k); return 0 } |
| 15 | func sg_cat(dst: *u8, off: i64, s: *u8) -> i64 { var o: i64=off; var k: i64=0; while s[k]!=(0 as u8){dst[o]=s[k];o=o+1;k=k+1} return o } called by 1: main |
| 16 | func sg_catnum(dst: *u8, off: i64, v: i64) -> i64 { var o: i64=off; let t: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; 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{dst[o]=t[k-1-i];o=o+1;i=i+1} return o } |
| 18 | func sg_row(id: i64, ok: i64, what: *u8) -> i64 |
| 26 | func sg_slurp(path: *u8, buf: *u8, cap: i64) -> i64 |
| 42 | func sg_contains(hay: *u8, hn: i64, needle: *u8) -> i64 called by 1: main |
| 62 | func sg_bytes_eq(a: *u8, an: i64, b: *u8, bn: i64) -> i64 called by 1: main |
| 69 | func main() -> i64 |