code wiki / _hdl_build / nx_pub_selfheal_gate.nx
nx_pub_selfheal_gate.nx
buildroot/runtime/_hdl_build/nx_pub_selfheal_gate.nx
about
nx_pub_selfheal_gate.nx -- proves the autonomous Dr+Engineer self-heal: (1) ROOT-CAUSES each quarantined item
against the LIVE filesystem (grounded), (2) AUTO-FIXES an internal artifact that merely changed (re-queues it
with the current sha) -- BOUNDED so it can never loop, (3) does NOT auto-fix outward items (they stay gated).
Liar-killed: distinct causes from distinct real fs facts; the auto-resubmit is internal-only + once-per-item. license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_publisher.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
| 8 | func w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 9 | func wn(v: i64) -> i64 { var m: i64=v; if m<0{w("-" as *u8);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 i:i64=0; let o:*u8=sys_mmap(24); while i<k{o[i]=t[k-1-i];i=i+1} sys_write(1,o,k); return 0 } |
| 10 | func dmk(p: *u8) -> i64 { __syscall(83, p as i64, 493, 0, 0, 0, 0); return 0 } called by 1: main |
| 11 | func dun(p: *u8) -> i64 { __syscall(87, p as i64, 0, 0, 0, 0, 0); return 0 } called by 1: main |
| 12 | func mkfile(p: *u8, c: *u8) -> i64 { let fd: i64 = sys_openat_wr(p, 0x1a4); if fd<0 { return 0 } var n: i64=0; while c[n]!=(0 as u8){n=n+1} sys_write(fd,c,n); sys_close(fd); return 1 } |
| 13 | func qc(buf: *u8, o: i64, s: *u8) -> i64 { var w2: i64=o; var i: i64=0; while s[i]!=(0 as u8){buf[w2]=s[i];w2=w2+1;i=i+1} return w2 } called by 1: dlline |
| 14 | func file_has(path: *u8, ndl: *u8) -> i64 |
| 19 | func count_lines(path: *u8) -> i64 { let lp: *i64 = sys_mmap(8) as *i64; let d: *u8 = sys_read_file(path, lp); if (d as i64)==0 { return 0 } let n: i64 = lp[0]; var c: i64=0; var i: i64=0; while i<n { if d[i]==(10 as u8){c=c+1} i=i+1 } return c } |
| 20 | func dlline(buf: *u8, o: i64, reason: *u8, sha: *u8, src: *u8, dest: *u8, policy: *u8) -> i64 |
| 27 | func main(argc: i64, argv: *i64) -> i64 |