nx_gate_total_scan.nx
buildroot/runtime/nx_gate_total_scan.nx
about
nx_gate_total_scan.nx -- scans *_gate.nx sources for the DUPLICATED tooth-total magic number.
The corpus-dominant gate epilogue writes the total TWICE:
g_puts("/15 verdict=" ...) <- the printed denominator
if pass[0] == 15 { GREEN } <- the verdict comparison
Both must also agree with a THIRD thing (the real number of assertions), so it is a three-way
drift. This organ proves the mechanically-checkable half exactly: printed N vs compared N.
A gate printing /15 while comparing ==14 is LYING ABOUT ITS OWN COVERAGE.
Verdicts per file: OK (both found, equal) · MISMATCH (both found, differ) ·
UNPAIRED (printed N with no comparison to check it against) · SKIP (neither)
usage: nx_gate_total_scan <dir> [dir2] [dir3] exit 0 clean, 1 if any MISMATCH
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
| 15 | const S_NAMECAP: i64 = 4096 |
| 16 | const S_DENTCAP: i64 = 65536 |
functions
| 18 | func s_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 19 | func s_putn(v: i64) -> i64 |
| 31 | func s_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } |
| 33 | func s_find(hay: *u8, hn: i64, needle: *u8, from: i64) -> i64 |
| 47 | func s_int(hay: *u8, hn: i64, p: i64) -> i64 |
| 66 | func s_printed(buf: *u8, n: i64) -> i64 |
| 93 | func s_has_cmp(buf: *u8, n: i64, pv: i64) -> i64 |
| 112 | func s_is_gate(name: *u8) -> i64 |
| 121 | func main(argc: i64, argv: *i64) -> i64 |