code wiki / _hdl_build / nx_suitebench_gate.nx
nx_suitebench_gate.nx
buildroot/runtime/_hdl_build/nx_suitebench_gate.nx
about
nx_suitebench_gate.nx -- the regression proof for the suite ruler. It imports nx_suitebench_lib, which is
the SAME code the shipped ruler runs, so these teeth verify the instrument rather than a copy of it.
The teeth that matter are the negative ones. An instrument that only demonstrates its happy path proves
nothing: the whole value of this ruler is that it REFUSES bad input, so the gate has to show the refusals
actually fire -- a fabricated citation must not be findable, a stub-worded claim must fall, and a cell an
incumbent does not ship must not reach the denominator. T9 goes further and MUTATES a real row to prove
the cynical bar is load-bearing: if the mutation does not lower the score, the bar is decoration.
license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_suitebench_lib.nxnx_honesty_grade_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
| 13 | const GT_AXBUF: i64 = 65536 |
| 14 | const GT_CORPUS: i64 = 262144 |
| 15 | const GT_ROWBUF: i64 = 512 |
functions
| 17 | func g_w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 18 | func g_n(v: i64) -> i64 {
called by 1: main |
| 28 | func g_t(pass: i64, label: *u8, fails: *i64) -> i64 { |
| 34 | func g_cp(dst: *u8, src: *u8) -> i64 {
called by 1: main |
| 41 | func main() -> i64 { |