nx_uxf_tsv_persist.nx
buildroot/runtime/nx_uxf_tsv_persist.nx
about
nx_uxf_tsv_persist.nx -- UXF arc R2b: the FULL data pipeline, end to end on real data.
A real TSV -> per-row canonical content-addressed records -> PERSISTED into the immutable
seg_store (ss_add -> ss_build_keys -> ss_writefile+fsync) -> REOPENED -> every row RETRIEVED by
its content-address CID (binary search over the NXK1 index) and verified BYTE-IDENTICAL to the
original. This is "replace the TSVs" made real: not just migrate-in-memory, but store+retrieve.
Composes canon_cid + uxf_cid + seg_store. No hardware writes (Rule 26).
expect_exit: 0 license_tier: ORIGINAL
dependencies 4 imports · 0 importers
imports: nx_syscalls.nxnx_canon_cid.nxnx_uxf_cid.nxnx_seg_store.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
| 12 | const K_MAGIC_4096: i64 = 4096 |
| 13 | const K_MAGIC_1048576: i64 = 1048576 |
functions
| 15 | func p_puts(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 p_putn(v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64 = v; if m < 0 { m = 0 - m; sys_write(1, "-" as *u8, 1) } let t: *u8 = sys_mmap(28); 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; while i < k { bb[i] = t[k - 1 - i]; i = i + 1 } sys_write(1, bb, k); return 0 } |
| 18 | func p_keyname(idx: i64, dst: *u8) -> i64 |
| 31 | func p_bytes_eq(a: *u8, b: *u8, n: i64) -> i64 { var i: i64 = 0; while i < n { if a[i] != b[i] { return 0 } i = i + 1 } return 1 } called by 1: main |
| 34 | func p_get(idx: *u8, key: *u8, kl: i64, out: *i64) -> i64 |
| 52 | func main() -> i64 |