nx_tool_run_gate.nx
buildroot/runtime/nx_tool_run_gate.nx
about
nx_tool_run_gate.nx -- GATE for R0 of the executable-API rung (nx_tool_run). Proves the sovereign
exec+capture primitive forks a child, runs a REAL ELF, captures its true stdout, and returns its true
exit code -- with a never-brick negative control (a bad path can only yield exit 127 + empty capture,
never a shell injection or a persistent-state write). Target = the canonical no-op nx_tool_ping (a
SEPARATE tiny ELF, so there is zero recursion risk). Mirrors the nx_*_gate idiom (pass/tot -> GREEN/RED).
PREREQ: build nx_tool_ping FIRST (produces _offc/nx_tool_ping.elf).
license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_tool_run.nxnx_gate_verdict.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
| 11 | const TR_PING: *u8 = "_offc/nx_tool_ping.elf" as *u8 // relative to CWD (nxc2 root at gate time) |
| 12 | const TR_BADPATH: *u8 = "/nonexistent/nope.elf" as *u8 |
functions
| 14 | func gw(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 1: main |
| 15 | func gn(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{sys_write(1,"-" as *u8,1);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 } called by 1: main |
| 17 | func main() -> i64 |