code wiki / _hdl_build / nx_publish_account_admin.nx
nx_publish_account_admin.nx
buildroot/runtime/_hdl_build/nx_publish_account_admin.nx
about
nx_publish_account_admin.nx -- the SOVEREIGN deploy SUBMISSION for this workstream, through THE NISHI PUBLISHER
(the operator's law: workstreams REQUEST, the publisher SHIPS -- no direct pushes). It enqueues the two staged HR
stores as publish requests; the publisher later verifies + (for an outward site) HOLDS them for operator approval
(its R6) and atomically promotes. This organ NEVER touches the live site -- it only appends a framed request.
Self-verifying: (1) NEG CONTROL -- a missing source fails closed (-9); (2) a test-queue submit produces ONE framed
PENDING line carrying site/requester/dest/sha; (3) the REAL submit is IDEMPOTENT (#10) -- it skips an artifact
whose (sha+dest) is already queued, so re-runs don't pile up duplicates; (4) readback confirms both dests are queued.
The daemon BINARIES are NOT submitted here -- they are owner-rebuilt-from-source at promote (source = SSOT); this
submits the deployable DATA (the HR roster stores the daemons hot-read). license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_publisher.nxnx_runpath.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
| 32 | const PAA_SITE: *u8 = "nishifamily.com" as *u8 |
| 33 | const PAA_REQ: *u8 = "acct-cleanup-32992a14" as *u8 |
| 34 | const PAA_POLICY: *u8 = "outward-data:hotreload" as *u8 // outward -> the publisher HOLDS for operator approval (R6) |
| 35 | const PAA_SRC1: *u8 = "knowledge/publish/staging/nishi_hr.log" as *u8 |
| 36 | const PAA_DST1: *u8 = "/volume1/homes/elderwesto/nishihost/nishi_hr.log" as *u8 |
| 37 | const PAA_SRC2: *u8 = "knowledge/publish/staging/andelinwest_hr.log" as *u8 |
| 38 | const PAA_DST2: *u8 = "/volume1/homes/elderwesto/nishihost/andelinwest_hr.log" as *u8 |
functions
| 15 | 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 } |
| 16 | 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 } |
| 17 | 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 } |
| 18 | func gtrunc(path: *u8) -> i64 { let fd: i64 = sys_openat_wr(path, 0x1a4); if fd>=0 { sys_close(fd) } return 0 } |
| 19 | func paa_count(buf: *u8, n: i64, needle: *u8) -> i64 { var nl: i64=0; while needle[nl]!=(0 as u8){nl=nl+1} if nl==0 {return 0} var c: i64=0; var i: i64=0; while i+nl<=n { var j: i64=0; var ok: i64=1; while j<nl { if buf[i+j]!=needle[j]{ok=0;j=nl} else {j=j+1} } if ok==1 {c=c+1;i=i+nl} else {i=i+1} } return c } |
| 20 | func paa_has(buf: *u8, n: i64, needle: *u8) -> i64 { if paa_count(buf,n,needle)>0 {return 1} return 0 } |
| 22 | func paa_read(path: *u8, lenp: *i64) -> *u8 { lenp[0]=0; return sys_read_file(path, lenp) } |
| 24 | func paa_already(qbuf: *u8, qn: i64, src: *u8, dest: *u8) -> i64 |
| 40 | func main() -> i64 |