code wiki / _hdl_build / nx_sensor_gap_census.nx

nx_sensor_gap_census.nx

buildroot/runtime/_hdl_build/nx_sensor_gap_census.nx

15625 B344 linesdepth 5pulls 8 transitivereach 0 importersview sourcekind tool
docsdependenciesstructsconstsfunctions

about

nx_sensor_gap_census.nx -- THE live 4-axis SENSOR-DEPTH risk map across every gate in runtime/_hdl_build. Answers the operator's "get the gap in sensors fixed across the nishi environment": for the WHOLE gate universe, what fraction carries each of the four SENSORS that make a verdict trustworthy -- 1 LIAR-KILLER (neg-control / physics-invariant / evidence-grounding) -> can't pass a GAMED number 2 REGRESSION BASE (stored baseline + no-backslide) -> can't SILENTLY backslide 3 HANDOFF TELEMETRY (per-stage quality/bytes/time/fail) -> can LOCALIZE where it breaks 4 EXTERNAL-COMP (named industry oracle: x264/MSU, CUDA/WARP, V8, ...) -> EXTERNALLY judged not self-graded Per [[feedback-handoff-chain-sota-gate-doctrine]] #1 rule a self-judged verdict is worthless; axis 4 is deepest. Axis-4 here is a fast per-gate marker scan; the AUTHORITATIVE per-workstream WIRED/UNWIRED status lives in nx_benchmark_suite_registry -- the two reconcile (this flags coverage; that names the suite). Matching is CASE-INSENSITIVE (catches CUDA/X264/Baseline) with WORD-boundary mode for short ambiguous tokens (so "red" does NOT match inside "REQUIRED"/"STRUCTURED" -- a universe-inflation gaming vector, liar-killed below). This organ is ITSELF liar-killed: POS fixture classifies 5/5, NEG fixture 0/5, a REQUIRED/STRUCTURED neg-control must NOT register as a verdict-emitter, classification is deterministic, and an UNREADABLE gate is counted BLIND (never fabricated as covered). It carries a no-backslide regression gate on its OWN coverage (knowledge/status/sensor_gap_baseline.tsv). It PRINTS the honest risk map REGARDLESS; GREEN = classifier TRUSTWORTHY and coverage did NOT backslide (GREEN != "coverage good" -- the blind gates ARE the work). Sovereign nx_cc->nxasm (no gcc, no sh). Run with CWD = nxc2 root. expect_exit: 0 license_tier: ORIGINAL

dependencies 6 imports · 0 importers

syscalls.nx runtime.nx nx_axioms.nx nx_dirent.nx nx_fcntl.nx nx_handoff_gate.nx nx_sensor_gap_census.nx

imports: syscalls.nxruntime.nxnx_axioms.nxnx_dirent.nxnx_fcntl.nxnx_handoff_gate.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main print strlen slen has_any find_ci slen ↻ lc is_alnum read_gate sys_read nx_openat nx_dirent_read nx_dirent_iter nx_dirent_name_len ends_nx streqz byte_copy print_i64 itoa report print ↻ print_i64 ↻ pct hg_baseline_load sys_read ↻ hg_parse_ints hg_no_backslide hg_baseline_print print ↻ print_i64 ↻

structs

none

consts

29const K_MAGIC_1048576: i64 = 1048576
30const K_MAGIC_16384: i64 = 16384
31const K_MAGIC_1024: i64 = 1024

functions

34func slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n }
called by 2: find_cimain
36func lc(c: i64) -> i64 { if c >= 65 { if c <= 90 { return c + 32 } } return c }
called by 1: find_ci
38func is_alnum(c: i64) -> i64
called by 1: find_ci
46func streqz(a: *u8, b: *u8) -> i64
called by 1: main
53func byte_copy(dst: *u8, src: *u8, n: i64) -> i64
called by 1: main
60func find_ci(buf: *u8, lo: i64, hi: i64, ndl: *u8, word: i64) -> i64
called by 1: has_any calls 3: slenlcis_alnum
85func has_any(buf: *u8, len: i64, set: *i64, modes: *i64, n: i64) -> i64
called by 1: main calls 1: find_ci
95func read_gate(path: *u8, buf: *u8, cap: i64) -> i64
called by 1: main calls 1: sys_read
110func ends_nx(name: *u8, len: i64) -> i64
called by 1: main
118func pct(a: i64, b: i64) -> i64 { if b <= 0 { return 0 } return (100 * a) / b }
called by 1: report
120func report(tag: *u8, have: i64, univ: i64) -> i64
called by 1: main calls 3: printprint_i64pct
129func main() -> i64