code wiki / _hdl_build / nx_studio_tiers_gate.nx
nx_studio_tiers_gate.nx
buildroot/runtime/_hdl_build/nx_studio_tiers_gate.nx
about
nx_studio_tiers_gate.nx -- gate for the CAPABILITY-ADAPTIVE WYSIWYG (nx_studio_tiers). Proves the operator's
design: a user picks the editing tier that matches their capability (GUIDED / BLOCK / FREE-FORM), but every
tier funnels through the ONE governed sovereign engine, so governance is TIER-INVARIANT:
* each tier's input normalizes + builds a real governed page (positive)
* a hostile field is ESCAPED whether typed in GUIDED or FREE-FORM (injection-safety invariant)
* an incomplete BLOCK doc is REFUSED (publish-gate invariant)
* the GUIDED tier is NOVICE-SAFE BY CONSTRUCTION: even a single answer (just a brand) yields a complete,
publishable page -- a novice cannot produce a broken site
* FREE-FORM layout-only `place|` lines never leak into the built HTML
* a tier-authored doc rebuilds byte-identical (portability invariant)
Positive AND negative controls. Appends a CMSGATE row to knowledge/status/cms_gate.log on all-pass.
license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_studio_tiers.nxnx_sitegen_studio.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
| 17 | func tw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 18 | func tnum(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 } |
| 19 | func tcat(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 |
| 20 | func tcatnum(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 } |
| 21 | func trow(id: i64, ok: i64, what: *u8) -> i64 { tw("TIERROW " as *u8); tnum(id); tw(" " as *u8); if ok==1 { tw("PASS " as *u8) } else { tw("FAIL " as *u8) } tw(what); tw("\n" as *u8); return ok } |
| 22 | func tlen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: tbuild |
| 23 | func tcontains(hay: *u8, hn: i64, needle: *u8) -> i64 called by 1: main |
| 30 | func teq(a: *u8, an: i64, b: *u8, bn: i64) -> i64 { if an!=bn { return 0 } var i: i64=0; while i<an { if (a[i] as i64)!=(b[i] as i64){return 0} i=i+1 } return 1 } called by 1: main |
| 33 | func tbuild(tier: i64, input: *u8, site: *u8, scap: i64, out: *u8, ocap: i64) -> i64 |
| 38 | func main() -> i64 |