code wiki / (root) / nx_browser_struct_col_gate.nx

nx_browser_struct_col_gate.nx

buildroot/runtime/nx_browser_struct_col_gate.nx

12929 B218 linesdepth 4pulls 5 transitivereach 0 importersview sourcekind gate/prooftopic browser
docsdependenciesstructsconstsfunctions

about

nx_browser_struct_col_gate.nx -- the BR2 structural-exactness column, proven IN PROCESS. Subject: nx_browser_struct_col_lib.nx, IMPORTED (not forked), so every tooth here sits inside the mutation harness's build closure and a planted defect in the lib actually kills a mutant. A gate that exec'd the promoted census binary would read NOT-REACHED for every mutant and its GREEN would mean nothing. The three things this gate exists to stop, each measured on real data on 2026-08-26 BEFORE it was written, so no tooth here is a hypothetical: 1. A permil computed over TWO oracle bands published as "1000" (goog_raw.html), and a permil computed over ZERO oracle bands published as "0" (so_aug.html, x_aug.html). Both are arithmetic on an empty subject wearing a number -- a perfect score and a total failure, neither of them evidence. 2. A bar reported MET on partial coverage -- one bar site measured out of the four the browser.plan done-rule names. 3. A CSS-ON/CSS-OFF flip taken on a difference smaller than the census's own measured variance. license_tier: ORIGINAL No hw writes (Rule 26).

dependencies 2 imports · 0 importers

nx_gate_verdict.nx nx_browser_struct_col_lib.nx nx_browser_struct_col_gate.nx

imports: nx_gate_verdict.nxnx_browser_struct_col_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 ↻ bsc_bar_sites lcf_str_of sys_mmap ↻ sys_read_file sys_openat_rd sys_lseek sys_mmap ↻ sys_read sys_munmap sys_close lcf_str lcf_find bsc_bar_pm bsc_conf_int lcf_int_of sys_mmap ↻ sys_read_file ↻ lcf_int lcf_find ↻ bsc_bar_dy

structs

none

consts

21const BG_SITECAP: i64 = 512
22const BG_BAR_SHIPPING_PM: i64 = 900
23const BG_BAR_SHIPPING_DY: i64 = 4
24const BG_BAR_SHIPPING_SITES: i64 = 4
25const BG_FLOOR_AT_900: i64 = 10
26const BG_BAR_TIGHT: i64 = 950
27const BG_FLOOR_AT_950: i64 = 20
29const BG_LIVE_OFF: i64 = 426
30const BG_LIVE_ON: i64 = 311
31const BG_LEGN: i64 = 13
33const BG_WIKI_PM: i64 = 845
34const BG_WIKI_DY: i64 = 7
35const BG_WIKI_DX: i64 = 80
36const BG_WIKI_BANDS: i64 = 84
37const BG_HN_PM: i64 = 769
38const BG_HN_DY: i64 = 12
39const BG_HN_DX: i64 = 91
40const BG_HN_BANDS: i64 = 26
42const BG_GOOG_PM: i64 = 1000
43const BG_GOOG_BANDS: i64 = 2
44const BG_SO_BANDS: i64 = 0

functions

46func bg_is_neg(v: i64) -> i64 { if v < 0 { return 1 } return 0 }
called by 1: main
47func bg_is_zero(v: i64) -> i64 { if v == 0 { return 1 } return 0 }
called by 1: main
48func bg_is_unobs(v: i64) -> i64 { if v == BSC_UNOBSERVABLE { return 1 } return 0 }
called by 1: main
49func bg_is_tied(v: i64) -> i64 { if v == BSC_PAIR_TIED { return 1 } return 0 }
called by 1: main
50func bg_is_pair_unobs(v: i64) -> i64 { if v == BSC_PAIR_UNOBSERVABLE { return 1 } return 0 }
called by 1: main
53func bg_bar_refused(csv: *u8, floor: i64, bar_pm: i64, bar_dy: i64, pm: i64, dy: i64) -> i64
called by 1: main calls 2: bsc_accbsc_row
60func main() -> i64