code wiki / _hdl_build / nx_frontier_put.nx
nx_frontier_put.nx
buildroot/runtime/_hdl_build/nx_frontier_put.nx
about
nx_frontier_put.nx -- STORE-NATIVE edit verb for the frontier plane (operator 2026-07-18: "we are
supposed to use the nishi information management formats and system"). The seg-store IS the edit
surface; the flat TSV becomes a GENERATED VIEW re-exported on every put, byte-consistent, so the
cron seed-before-emit and legacy readers stay true during the transition (F-201b retires it).
nx_frontier_put set <id> <T|D|X> [prefix] [exportpath]
nx_frontier_put add <tab-row-9col> [prefix] [exportpath]
Fail-closed: unknown id / duplicate id / bad status commit NOTHING. flock on <prefix>plock.
license_tier: ORIGINAL No hw writes (Rule 26). expect_exit: 0
dependencies 3 imports · 0 importers
imports: nx_store_seed_lib.nxnx_seg_store.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
| 13 | const FP_CAP: i64 = 1048576 |
| 14 | const FP_TAB: i64 = 9 |
| 15 | const FP_NL: i64 = 10 |
| 16 | const FP_STDERR: i64 = 2 |
| 17 | const FP_LOCK_EX: i64 = 2 |
| 18 | const FP_MODE: i64 = 420 |
| 19 | const FP_SPAN: i64 = 16 |
| 20 | const FP_PATHCAP: i64 = 256 |
| 21 | const FP_HDRCAP: i64 = 512 |
| 22 | const FP_EXIT_USAGE: i64 = 2 |
functions
| 24 | func fp_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } calls 1: sys_write |
| 25 | func fp_werr(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(FP_STDERR, s, n); return 0 } |
| 26 | func fp_vlen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } called by 1: main |
| 27 | func fp_cat(d: *u8, o: i64, s: *u8) -> i64 { var i: i64 = 0; while s[i] != (0 as u8) { d[o] = s[i]; o = o + 1; i = i + 1 } return o } |
| 28 | func fp_catn(d: *u8, o: i64, v: i64) -> i64 { let t: *u8 = sys_mmap(28); var m: i64 = v; if m < 0 { m = 0 } 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 { d[o] = t[k-1-i]; o = o + 1; i = i + 1 } return o } |
| 29 | func fp_le(q: *u8, i: i64, n: i64) -> i64 { var e: i64 = i; var s: i64 = 1; while s == 1 { if e >= n { s = 0 } else { if q[e] == (FP_NL as u8) { s = 0 } else { e = e + 1 } } } return e } |
| 30 | func fp_col(q: *u8, ls: i64, le: i64, c: i64, out: *i64) -> i64 |
| 46 | func fp_span_lit(q: *u8, s: i64, e: i64, lit: *u8) -> i64 called by 1: main |
| 56 | func fp_max_fid(q: *u8, n: i64, letter: i64) -> i64 |
| 78 | func fp_lock(prefix: *u8) -> i64 |
| 89 | func fp_export(path: *u8, rows: *u8, n: i64) -> i64 |
| 100 | func main(argc: i64, argv: *i64) -> i64 |