code wiki / (root) / nx_inv_bounded_gate.nx

nx_inv_bounded_gate.nx

buildroot/runtime/nx_inv_bounded_gate.nx

4040 B53 linesdepth 4pulls 4 transitivereach 0 importersview sourcekind gate/proof

docs dependencies structs consts functions

about

nx_inv_bounded_gate.nx -- proves the inverted index works with a BOUNDED, PE/bare-metal-portable footprint (nx_inv_new_bounded) instead of the 4 GiB Linux-lazy-mmap reservation. This removes the #1 friction blocking the index from compiling to a Windows PE / bare-metal target -> the multi-target / platform-independence path. Verified on Linux here; the same bounded index now fits a HeapAlloc/VirtualAlloc HAL. license_tier: ORIGINAL

dependencies 1 imports · 0 importers

imports: nx_search_inverted.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

7	func gw(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
8	func gn(v: i64) -> i64 { if v==0 { sys_write(1,"0" as u8,1); return 0 } 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; while m>0 { t[k]=(48+(m%10)) as u8; m=m/10; k=k+1 } let o: u8=sys_mmap(24); var w: i64=0; var q: i64=k-1; while q>=0 { o[w]=t[q]; w=w+1; q=q-1 } sys_write(1,o,w); return 0 } called by 1: main
9	func bg_slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 2: bg_has main
10	func bg_has(idx: NxInvIndex, term: u8, docid: i64) -> i64 called by 1: main calls 5: nx_inv_hash_bytes_lower bg_slen nx_inv_lookup_slot nx_inv_slot_write_cursor nx_inv_slot_postings_offset
20	func main() -> i64 calls 8: gw nx_inv_new_bounded nx_inv_index_row bg_slen nx_inv_finalize_offsets nx_inv_emit_row+2