code wiki / (root) / nx_memindex_budget_gate.nx

nx_memindex_budget_gate.nx

buildroot/runtime/nx_memindex_budget_gate.nx

8227 B173 linesdepth 4pulls 4 transitivereach 0 importersview sourcekind gate/prooftopic memindex
docsdependenciesstructsconstsfunctions

about

nx_memindex_budget_gate.nx -- liar-killed GATE for the memindex TOTAL-size budget (the remaining memindex-cap-treadmill rail feature). Forks the REAL built elf (_build/nx_memindex_emit.sov.elf) against byte-exact fixtures and proves: - budget split keeps the NEWEST entries in the md block, moves the OLDEST into the overflow file's COINDEX-OVFL block (presence AND absence checks = neg-controls) - NO-LOSS: every slug lands in exactly one of the two blocks - both files fully re-derive -> IDEMPOTENT (second identical run byte-identical) - FAIL-CLOSED: overflow file without markers is untouched AND nothing is evicted (the md gets the FULL block -- no entry ever silently vanishes) - the newest entry is NEVER evicted (budget=1 still keeps it live) - 2-arg form = unbudgeted back-compat (full block, no overflow writes) Fixture line sizes are chosen so budget=24 keeps exactly {e5,e6}: e6=14B + e5=8B = 22 <= 24, +e4(8B)=30 > 24. usage: nx_memindex_budget_gate [emit_elf] Exit 0 only on 9/9. license_tier: ORIGINAL expect_exit: 0

dependencies 2 imports · 0 importers

nx_syscalls.nx nx_crashresume_census_core.nx nx_memindex_budget_gate.nx

imports: nx_syscalls.nxnx_crashresume_census_core.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 g_write sys_openat_wr sys_write ccz_slen sys_close fixtures g_write ↻ g_run sys_fork sys_execve sys_exit sys_mmap ↻ sys_wait4 wait_exit_code g_bool g_puts sys_write ↻ g_putn nxi_out nxi_fd sys_mmap ↻ ccz_cat_num sys_write ↻ sys_munmap g_fhas sys_mmap ↻ ccz_read sys_openat_rd sys_read sys_close ↻ g_has ccz_slen ↻ ccz_read ↻ g_same sys_mmap ↻ ccz_read ↻ g_puts ↻ g_putn ↻

structs

none

consts

none

functions

21func g_puts(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 2: g_boolmain calls 1: sys_write
22func g_putn(v: i64) -> i64 { nxi_out(v); return 0 }
called by 2: g_boolmain calls 1: nxi_out
23func g_bool(name: *u8, got: i64, want: i64, passp: *i64) -> i64
called by 1: main calls 2: g_putsg_putn
28func g_write(path: *u8, s: *u8) -> i64 { let fd: i64 = sys_openat_wr(path, 420); if fd < 0 { return 0 - 1 } sys_write(fd, s, ccz_slen(s)); sys_close(fd); return 0 }
29func g_has(hay: *u8, hn: i64, needle: *u8) -> i64
called by 1: g_fhas calls 1: ccz_slen
42func g_same(p: *u8, q: *u8, qn: i64) -> i64
called by 1: main calls 2: sys_mmapccz_read
51func g_fhas(p: *u8, needle: *u8) -> i64
called by 1: main calls 3: sys_mmapccz_readg_has
59func g_run() -> i64
72func fixtures(md: *u8, ov: *u8) -> i64
called by 1: main calls 1: g_write
78func main(argc: i64, argv: *i64) -> i64