code wiki / _hdl_build / nx_prim_synth.nx
nx_prim_synth.nx
buildroot/runtime/_hdl_build/nx_prim_synth.nx
about
nx_prim_synth.nx -- prim lane F784 (SYNTHESIZE: compose validated primitives into a sovereign workflow).
The last of the 4 meet-in-the-middle pillars. Given ordered primitive ids (the agent's chosen composition
from F782/F783 matches), VALIDATE each exists in the F781 registry + pull its typed signature, then EMIT
the composed plan-workflow (seq/tool rows for nx_plan_run) + the seed recipe. If ANY id is unresolved it
REFUSES to emit a runnable plan (all_resolved=false, exit 3) and routes the caller to nx_prim_gap -- you
cannot synthesize over a primitive that does not exist. Sovereign orchestration = a plan- workflow run by
nx_plan_run, NOT LangGraph/Temporal. READ-ONLY over the registry; result to stdout + atomic out-file.
nx_prim_synth <primitive-id> [<primitive-id> ...]
exit: 0 all-resolved (runnable plan emitted) | 3 UNRESOLVED (>=1 id absent) | 4 registry unreadable | 2 usage.
license_tier: ORIGINAL expect_exit: 0
dependencies 1 imports · 0 importers
imports: nx_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
| 12 | const K_MAGIC_262100: i64 = 262100 |
| 13 | const K_MAGIC_262144: i64 = 262144 |
| 14 | const K_MAGIC_1024: i64 = 1024 |
functions
| 16 | func ps_w(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 } |
| 17 | func ps_b(rep: *u8, pos: i64, s: *u8) -> i64 { var p: i64 = pos; var i: i64 = 0; while s[i] != (0 as u8) { if p < K_MAGIC_262100 { rep[p] = s[i]; p = p + 1 } i = i + 1 } return p } called by 1: main |
| 18 | func ps_bn(rep: *u8, pos: i64, v: i64) -> i64 { var p: i64 = pos; var m: i64 = v; if m < 0 { if p < K_MAGIC_262100 { rep[p] = 45 as u8; p = p + 1 } m = 0 - m } 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 { if p < K_MAGIC_262100 { rep[p] = t[k - 1 - i]; p = p + 1 } i = i + 1 } return p } |
| 19 | func ps_q(rep: *u8, pos: i64) -> i64 { var p: i64 = pos; if p < K_MAGIC_262100 { rep[p] = 34 as u8; p = p + 1 } return p } called by 1: main |
| 20 | func ps_je(rep: *u8, pos: i64, src: *u8, s: i64, e: i64) -> i64 called by 1: main |
| 33 | func ps_reads(path: *u8, buf: *u8, cap: i64) -> i64 |
| 42 | func ps_off(buf: *u8, s: i64, e: i64, pat: *u8, pl: i64) -> i64 |
| 54 | func ps_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } called by 1: main |
| 55 | func ps_id(buf: *u8, ostart: i64, ce: i64, out: *u8) -> i64 called by 1: main |
| 63 | func ps_eq(idb: *u8, dl: i64, b: *u8) -> i64 called by 1: main |
| 70 | func ps_val(out: *u8, op: i64, buf: *u8, os: i64, ce: i64, key: *u8, klen: i64) -> i64 |
| 91 | func main(argc: i64, argv: *i64) -> i64 |