code wiki / _hdl_build / nx_queue_load.nx
nx_queue_load.nx
buildroot/runtime/_hdl_build/nx_queue_load.nx
about
nx_queue_load.nx -- IM-Q1: the PROGRAM'S OWN COORDINATION DATA becomes
first-class records on the sovereign store (operator 2026-06-11: "own our
information management -- a tsv file is not nishi; bottom up hardware rung
and each rung nishi"). The seg-store substrate is already hardware-up
(rungs 1-9, beats FTS5); this rung puts the QUEUE on it:
assignment_queue.tsv rows -> key "aq:"+<row-id>, value = canonical record
{kind: queue-row, id, row}. SAME key, NEW VERSION on every change --
`nx_store_query hist aq:X-Q-003` is the row's full status time-travel,
something the bare TSV can never answer. Idempotent: unchanged row =
identical canonical bytes = dup_instore, never re-added.
sponsor_decisions.tsv / planning_prefs.tsv / callouts.tsv lines ->
content-CID line records (sd:/pp:/co: prefixes, nx_log_load pattern) --
the sponsor's decisions + the training corpus gain provenance lineage.
The TSV files stay as the WRITE surface this rung (API stability); IM-Q2
(filed) moves writers store-first and derives the TSV as a render.
argv[1]=store prefix override, argv[2]=queue path override (gates).
Evidence: QUEUE-STORE row -> stdout + knowledge/status/infomgmt_store.log.
license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_canon_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
| 23 | const QL_MAGIC_3800: i64 = 3800 |
| 24 | const QL_MAGIC_4096: i64 = 4096 |
| 25 | const QL_MAGIC_8192: i64 = 8192 |
| 42 | const QL_CHUNK: i64 = 64 |
functions
| 27 | func ql_p(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 28 | func ql_fp(fd: i64, s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(fd,s,n); return 0 } |
| 29 | func ql_fn(fd: i64, v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m; sys_write(fd,"-" as *u8,1)}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=48;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(fd,bb,k); return 0 } |
| 31 | func ql_memeq(a: *u8, b: *u8, n: i64) -> i64 called by 1: ql_put |
| 44 | func ql_flush(prefix: *u8, st: *i64) -> i64 |
| 55 | func ql_put(prefix: *u8, st: *i64, kbuf: *u8, enc: *u8, el: i64) -> i64 |
| 70 | func ql_row(prefix: *u8, st: *i64, b: *u8, i: i64, lend: i64) -> i64 |
| 114 | func ql_load_queue(prefix: *u8, path: *u8, st: *i64) -> i64 |
| 135 | func ql_load_lines(prefix: *u8, path: *u8, tag: *u8, st: *i64) -> i64 |
| 185 | func main(argc: i64, argv: *i64) -> i64 |