code wiki / _hdl_build / nx_poolwidth_gate.nx
nx_poolwidth_gate.nx
buildroot/runtime/_hdl_build/nx_poolwidth_gate.nx
about
nx_poolwidth_gate.nx -- proves the width governor on the REAL measured numbers (seq1402).
T2 is the whole point: it quantifies the live defect. Today's policy gives every instance MAXP=32, and
nx_procchurn measured ~9 concurrent instances => an aggregate of 288 concurrent slots against a
32-slot budget, and pw_within_budget says 0. The governed policy yields 3 each = 27, within budget.
license_tier: ORIGINAL expect_exit: 0 No hw writes (Rule 26).
dependencies 2 imports · 0 importers
imports: nx_poolwidth_lib.nxnx_gate_verdict.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
| 11 | const PG_BUDGET: i64 = 32 |
| 12 | const PG_INSTANCES: i64 = 9 |
| 13 | const PG_TODAY_MAXP: i64 = 32 |
| 14 | const PG_TODAY_AGG: i64 = 288 |
| 15 | const PG_LOAD_QUIET: i64 = 400 |
| 16 | const PG_LOAD_MEASURED: i64 = 1172 |
| 17 | const PG_LOAD_2X: i64 = 1600 |
| 18 | const PG_CEILING: i64 = 800 |
| 19 | const PG_WMIN: i64 = 2 |
| 20 | const PG_WMAX: i64 = 32 |
functions
| 22 | func pg_eq(a: i64, b: i64) -> i64 { if a == b { return 1 } return 0 } called by 1: main |
| 23 | func cg_ge(a: i64, b: i64) -> i64 { if a >= b { return 1 } return 0 } called by 1: main |
| 25 | func main() -> i64 |