code wiki / _hdl_build / nx_loop_gate.nx

nx_loop_gate.nx

buildroot/runtime/_hdl_build/nx_loop_gate.nx

4103 B71 linesdepth 4pulls 4 transitivereach 0 importersview sourcekind gate/prooftopic loop
docsdependenciesstructsconstsfunctions

about

nx_loop_gate.nx -- GATE for nx_loop (the bounded-loop discipline primitive; JPL Power-of-10 rule 2). Flagged by the HONESTY SYSTEM 2026-07-16: reach=421, 50 direct children, ZERO direct validation -- the loop-safety layer itself was unproven. Gate proves: verdict enum validity (+NEG), success/failure split, settle transitions, frame budget exhaustion (exactly N steps), and break-stops-immediately. license_tier: ORIGINAL expect_exit:0

dependencies 2 imports · 0 importers

nx_syscalls.nx nx_loop.nx nx_loop_gate.nx

imports: nx_syscalls.nxnx_loop.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main nx_loop_verdict_is_valid lw2 sys_write nx_loop_is_success nx_loop_is_failure nx_loop_settle nx_loop_begin sys_mmap nx_loop_step nx_clock_monotonic_ns sys_mmap ↻ sys_clock_gettime_mono ln2 sys_mmap ↻ sys_write ↻ nx_loop_break nx_loop_settle_counted

structs

none

consts

none

functions

9func lw2(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 calls 1: sys_write
10func ln2(v: i64) -> i64 { let b:*u8=sys_mmap(24); var m:i64=v; if m<0{sys_write(1,"-" as *u8,1);m=0-m} let t:*u8=sys_mmap(24); 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 j:i64=0; while j<k{b[j]=t[k-1-j];j=j+1} sys_write(1,b,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
12func main() -> i64
calls 10: nx_loop_verdict_is_validlw2nx_loop_is_successnx_loop_is_failurenx_loop_settlenx_loop_begin+4