code wiki / _hdl_build / nx_simd_census.nx
nx_simd_census.nx
buildroot/runtime/_hdl_build/nx_simd_census.nx
about
nx_simd_census.nx -- SOVEREIGN vector-backend competitive census. The TEAM measures its OWN
SIMD/vector ISA coverage against the COMPLETE x86 vector target (knowledge/registry/
simd_incumbent_ref.tsv) from REAL EVIDENCE: a capability reads PRESENT iff the sovereign assembler
nxasm/nxasm_x86.nx actually DISPATCHES its mnemonic (the quoted "<probe>" literal appears in an
axc_tok_is). Non-circular, automatic, NEVER tutor-asserted -- the improvement the generic
re_has(self-model) census could not give the SIMD domain (it would need every mnemonic hand-added).
Writes knowledge/registry/simd_competitive_census.tsv (status\tfeature\tunion\tevidence -- the exact
format nx_backlog_gen consumes via census_set.tsv) + a SIMDCENSUSGATE coverage line (total + per
width 128/256/512/cross). Self-validating: pos control "paddd" MUST read PRESENT, neg control
"zzfakeop" MUST read ABSENT, else RED (proves the detector discriminates). license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_itoa_lib.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
| 14 | const SC_MAGIC_400000: i64 = 400000 |
| 15 | const SC_MAGIC_80000: i64 = 80000 |
| 16 | const SC_MAGIC_300000: i64 = 300000 |
| 18 | const SC_REF: *u8 = "knowledge/registry/simd_incumbent_ref.tsv" |
| 19 | const SC_ASM: *u8 = "nxasm/nxasm_x86.nx" |
| 20 | const SC_OUT: *u8 = "knowledge/registry/simd_competitive_census.tsv" |
| 21 | const SC_LOG: *u8 = "knowledge/status/simd_census.log" |
functions
| 23 | func sc_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 } |
| 28 | func sc_n(fd: i64, v: i64) -> i64 { nxi_fd(fd, v); return 0 } |
| 29 | func sc_w2(lfd: i64, s: *u8) -> i64 { sc_w(1, s); if lfd >= 0 { sc_w(lfd, s) } return 0 } |
| 30 | func sc_n2(lfd: i64, v: i64) -> i64 { sc_n(1, v); if lfd >= 0 { sc_n(lfd, v) } return 0 } |
| 32 | func sc_read_file(path: *u8, buf: *u8, cap: i64) -> i64 |
| 46 | func sc_scan_to(buf: *u8, n: i64, start: i64, delim: i64) -> i64 called by 1: main |
| 53 | func sc_app(dst: *u8, off: i64, s: *u8) -> i64 { var i: i64 = 0; while s[i] != (0 as u8) { dst[off+i] = s[i]; i = i + 1 } return off + i } called by 1: main |
| 56 | func sc_contains(hay: *u8, hn: i64, needle: *u8) -> i64 called by 1: sc_present |
| 74 | func sc_present(asm: *u8, an: i64, probe: *u8) -> i64 |
| 85 | func main() -> i64 |