code wiki / _hdl_build / nx_pub_loop_gate.nx

nx_pub_loop_gate.nx

buildroot/runtime/_hdl_build/nx_pub_loop_gate.nx

6270 B106 linesdepth 6pulls 11 transitivereach 0 importersview sourcekind gate/prooftopic pub

docs dependencies structs consts functions

about

nx_pub_loop_gate.nx -- R2 proof for THE NISHI PUBLISHER core loop. A queue of 5 requests (3 unique + 2 exact duplicates) is processed by pub_run, which must: (1) DEDUP -- publish each unique (sha,dest) exactly once; (2) be IDEMPOTENT on re-run -- a second pass over the same queue publishes nothing; (3) SERIALIZE -- two concurrent sys_fork publisher instances (with a forced race window) still produce exactly 3 ledger entries, never double-publishing; (4) NEG-CONTROL -- the SAME two publishers with the lock OFF DO double-publish (ledger > 3), proving fl_acquire is load-bearing. Sovereign + per-wsid isolated. license_tier: ORIGINAL expect_exit: 0

dependencies 3 imports · 0 importers

imports: nx_syscalls.nxnx_publisher.nxnx_runpath.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

11	func g_w(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 3: g_n g_row main calls 1: sys_write
12	func g_n(v: i64) -> i64 { var m: i64=v; if m<0{g_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 } called by 1: main calls 3: g_w sys_mmap sys_write
13	func g_row(id: u8, ok: i64, pass: i64) -> i64 { g_w(" " as u8); g_w(id); g_w(": " as u8); if ok==1 { g_w("OK\n" as u8); pass[0]=pass[0]+1 } else { g_w("FAIL\n" as u8) } return 0 } called by 1: main calls 1: g_w
15	func lg_reset(path: *u8) -> i64 { let fd: i64 = sys_openat_wr(path, 0x1a4); if fd >= 0 { sys_close(fd) } return 0 } called by 1: main calls 2: sys_openat_wr sys_close
16	func lg_make(path: u8, content: u8) -> i64 called by 1: main calls 3: sys_openat_wr sys_write sys_close
22	func lg_count(path: *u8) -> i64 called by 1: main calls 2: sys_mmap sys_read_file
32	func lg_rec(qpath: u8, sha: u8, dest: *u8) -> i64 called by 1: lg_seed calls 3: sys_mmap pub_build_rec fa_appendz
39	func lg_seed(qpath: u8, sa: u8, sb: u8, sc: u8) -> i64 called by 1: main calls 3: sys_mmap pub_sha_file lg_rec
50	func lg_child(qpath: u8, ledpath: u8, lockres: *u8, locked: i64) -> i64 { pub_run(qpath, ledpath, lockres, locked, 500); sys_exit(0); return 0 } called by 1: lg_concurrent calls 2: pub_run sys_exit
51	func lg_concurrent(qpath: u8, ledpath: u8, lockres: *u8, locked: i64) -> i64 called by 1: main calls 4: sys_fork lg_child sys_mmap sys_wait4
59	func main() -> i64 calls 14: sys_mmap g_w rp_wsid rp_ensure rp_path lg_make+8