code wiki / (root) / nx_galx_idx_backfill.nx

nx_galx_idx_backfill.nx

buildroot/runtime/nx_galx_idx_backfill.nx

6663 B105 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind tooltopic galx
docsdependenciesstructsconstsfunctions

about

nx_galx_idx_backfill.nx -- SOVEREIGN background indexer: build a NXVI index (knowledge/status/galxidx_<id>.idx) for every recording that lacks one, so recordings get MSE smooth-scrub (not just on first view). id = 0-indexed line in galx_vid_paths.tsv (matches gs_vid_line). NEWEST-FIRST: the gallery's Recordings grid is reverse-ordered (highest id = newest = what the operator clicks first), so we index from the highest id DOWN -> the visible recordings become smooth first. Sequential fork+wait = one-at-a-time (concurrency bound). Idempotent: skips indexes already at NXVI v2; (re)builds v1/missing/partial ones. Usage: nx_galx_idx_backfill [max_to_build] (default all). license_tier: ORIGINAL

dependencies 1 imports · 0 importers

nx_syscalls.nx nx_galx_idx_backfill.nx

imports: nx_syscalls.nx

imported by: nobody (leaf or entry point)

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

main sys_mmap nxa_die sys_write sys_exit nxa_lock_take nxa_lock_addr sys_write ↻ nxa_lock_give nxa_lock_addr ↻ nxa_report_overrun sys_write ↻ nxa_dump_printable sys_write ↻ nxa_dump_sizes sys_write ↻ sys_read_file sys_openat_rd sys_lseek sys_mmap ↻ sys_read sys_munmap sys_close bp sys_write ↻ bn sys_write ↻ sys_mmap ↻ bexists sys_openat_rd ↻ sys_close ↻ bitoa sys_mmap ↻ bidx_ok sys_openat_rd ↻ sys_mmap ↻ sys_read ↻ sys_close ↻ bfsize sys_openat_rd ↻

structs

none

consts

9const K_MAGIC_1000000: i64 = 1000000
10const K_MAGIC_4096: i64 = 4096

functions

12func bp(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return sys_write(1,s,n) }
called by 1: main calls 1: sys_write
13func bn(v: i64) -> i64 { var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as *u8,1)} let b: *u8=sys_mmap(32); var i: i64=32; if m==0{i=i-1;b[i]=(48 as u8)} while m>0{let q: i64=m/10; i=i-1; b[i]=((48+(m-q*10)) as u8); m=q} return sys_write(1,((b as i64)+i) as *u8,32-i) }
called by 1: main calls 2: sys_writesys_mmap
14func bitoa(v: i64, buf: *u8) -> i64 { var m: i64=v; let t: *u8=sys_mmap(32); var k: i64=0; if m==0{t[0]=(48 as u8);k=1} while m>0{let q: i64=m/10; t[k]=((48+(m-q*10)) as u8); m=q; k=k+1} var i: i64=0; while i<k{buf[i]=t[k-1-i];i=i+1} buf[k]=0 as u8; return k }
called by 1: main calls 1: sys_mmap
15func bexists(p: *u8) -> i64 { let fd: i64=sys_openat_rd(p); if fd<0 {return 0} sys_close(fd); return 1 }
called by 1: main calls 2: sys_openat_rdsys_close
17func bfsize(p: *u8) -> i64 { let fd: i64=sys_openat_rd(p); if fd<0 {return 0-1} let n: i64=sys_lseek(fd,0,2); sys_close(fd); return n }
called by 1: bidx_ok calls 3: sys_openat_rdsys_lseeksys_close
22func bidx_ok(ip: *u8, tp: *u8) -> i64
called by 1: main calls 5: sys_openat_rdsys_mmapsys_readsys_closebfsize
43func main(argc: i64, argv: *i64) -> i64
calls 12: sys_mmapsys_read_filebpbnbexistsbitoa+6