code wiki / _hdl_build / nx_janitor_caps_gate.nx
nx_janitor_caps_gate.nx
buildroot/runtime/_hdl_build/nx_janitor_caps_gate.nx
about
nx_janitor_caps_gate.nx -- proves the silent-truncation CAP detector (nx_cap_detect_lib) has TEETH and NO
false positives on its discriminators. In-memory fixtures (no /tmp): one POSITIVE that MUST flag, and four
NEG-CONTROLS that MUST NOT -- data-driven size, no-source, byte-buffer(no '*'), and shift-not-bound. The
fixtures are code-representing strings passed straight to the CORE scan (the gate does NOT strip -- the
sweep strips real files; here the string IS the simulated code). GREEN iff all six checks pass.
license_tier: ORIGINAL | genealogy_id: nishi_janitor_caps_gate_2026_07_15
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_cap_detect_lib.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
| 10 | func gg(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 11 | func gg_slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } |
| 12 | func gg_num(v: i64) -> i64 { let bb: *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{bb[i]=t[k-1-i];i=i+1}; sys_write(1,bb,k); return 0 } |
| 15 | func gg_would_flag(buf: *u8) -> i64 |
| 21 | func gg_check(label: *u8, actual: i64, expect: i64) -> i64 |
| 29 | func main(argc: i64, argv: *i64) -> i64 |