code wiki / _hdl_build / nx_capsweep_gate.nx

nx_capsweep_gate.nx

buildroot/runtime/_hdl_build/nx_capsweep_gate.nx

9074 B185 linesdepth 4pulls 5 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_capsweep_gate.nx -- teeth over nx_capsweep_lib. IN-PROCESS, with every fixture assembled IN MEMORY. WHY IN-PROCESS AND WHY NO FIXTURE FILES: a gate that forks the deployed elf measures whatever artifact happens to be installed, and a gate that writes scratch under knowledge/store shares its fixture with a production beat -- the estate has measured both defects. Every function under test here is PURE over a caller-supplied buffer, so the fixtures are built in RAM, nothing is written anywhere, and a mutation reaches every rule instead of stopping at a fork boundary. THE TOOTH THAT MATTERS IS T14 and it was named by a sibling seat reviewing this organ: hide a unit that IS on the surface and assert the on-surface count FALLS. Every other tooth here proves the arithmetic is self-consistent, and a partition can reconcile perfectly while the classifier reads the wrong column. ★A RECONCILING PARTITION IS EVIDENCE THE ARITHMETIC IS CONSISTENT, NEVER THAT THE CLASSIFIER IS RIGHT.

dependencies 3 imports · 0 importers

nx_syscalls.nx nx_gate_verdict.nx nx_capsweep_lib.nx nx_capsweep_gate.nx

imports: nx_syscalls.nxnx_gate_verdict.nxnx_capsweep_lib.nx

imported by: nobody (leaf or entry point)

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

main gv_ctr sys_mmap nxa_die sys_write sys_exit nxa_lock_take nxa_lock_addr sys_write ↻ nxa_lock_give nxa_lock_addr ↻ nxa_report_overrun sys_write ↻ nxa_dump_printable sys_write ↻ nxa_dump_sizes sys_write ↻ gv_head gv_puts sys_write ↻ sys_mmap ↻ cg_row cg_put cs_field_end gv_check gv_puts ↻ cs_field_start cs_field_end ↻ cs_surf_code cs_add cg_put ↻ cs_parse_surface cs_field_end ↻ cs_add ↻ cs_field_start ↻ cs_surf_code ↻ cs_footer_num cg_count_on_surface cs_partition_ok cs_stage_bits

structs

none

consts

18const CG_BUF: i64 = 65536
19const CG_SMALLCAP: i64 = 2 // a deliberately tiny table, so the truncation tooth can actually fill it

functions

21func cg_put(b: *u8, at: i64, s: *u8) -> i64
called by 2: cg_rowmain
30func cg_row(b: *u8, at: i64, name: *u8, surf: *u8) -> i64
called by 1: main calls 1: cg_put
45func cg_count_on_surface(surf: *i64, n: i64) -> i64
called by 1: main
55func main() -> i64