nx_statuscensus_gate.nx
buildroot/runtime/nx_statuscensus_gate.nx
about
nx_statuscensus_gate.nx -- TS11 referee: drives the ONE classifier (nx_statuscensus_lib) IN-PROCESS over planted
journals in /tmp/nx_statuscensus_gate/ (never the production journals: a gate must not share its fixture with a
beat). Four runs: A RED (every bucket populated once, three planted rows that a naive body-bytes rule would
count as delivered), B GREEN (120 clean rows, tools journal ABSENT -> that axis abstains, never acquits),
C UNOBSERVED (min_rows above the fixture -> rc 3, no vote), D TAIL WINDOW (window five bytes short of the file
-> the cut first row is skipped and the byte count is announced). Then the trajectory log holds exactly one row
per run. Every number is asserted AND emitted (gv_check_eq) so an outside arithmetic can contradict it.
license_tier: ORIGINAL No hw writes (Rule 26).
dependencies 2 imports · 0 importers
imports: nx_statuscensus_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
| 12 | const G_DIR: *u8 = "/tmp/nx_statuscensus_gate" |
| 13 | const G_EDGE: *u8 = "/tmp/nx_statuscensus_gate/edge.log" |
| 14 | const G_EDGE_GREEN: *u8 = "/tmp/nx_statuscensus_gate/edge_green.log" |
| 15 | const G_ACT: *u8 = "/tmp/nx_statuscensus_gate/act.jrnl" |
| 16 | const G_ACT_ABSENT: *u8 = "/tmp/nx_statuscensus_gate/absent.jrnl" |
| 17 | const G_STATUS: *u8 = "/tmp/nx_statuscensus_gate/census.status" |
| 18 | const G_TMP: *u8 = "/tmp/nx_statuscensus_gate/census.status.tmp" |
| 19 | const G_LOG: *u8 = "/tmp/nx_statuscensus_gate/census.log" |
| 20 | const G_MODE_DIR: i64 = 493 |
| 21 | const G_MODE_FILE: i64 = 420 |
| 22 | const G_WINDOW: i64 = 1048576 |
| 23 | const G_SLA: i64 = 990 |
| 24 | const G_MINROWS_ONE: i64 = 1 |
| 25 | const G_MINROWS_HUGE: i64 = 100000 |
| 26 | const G_GREEN_ROWS: i64 = 120 |
| 27 | const G_CUT: i64 = 5 |
| 28 | const G_RUNS: i64 = 4 |
| 29 | const G_ABSENT_NUM: i64 = 0 - 999999 |
| 31 | const A_EDGE_TOTAL: i64 = 10 |
| 32 | const A_EDGE_DELIV: i64 = 6 |
| 33 | const A_EDGE_EMPTY: i64 = 1 |
| 34 | const A_EDGE_404: i64 = 1 |
| 35 | const A_EDGE_SYNTH: i64 = 1 |
| 36 | const A_EDGE_UNDEF: i64 = 1 |
| 37 | const A_EDGE_PROXIED: i64 = 1 |
| 38 | const A_EDGE_PERMIL: i64 = 600 |
| 39 | const A_ACT_TOTAL: i64 = 7 |
| 40 | const A_ACT_DELIV: i64 = 4 |
| 41 | const A_ACT_EMPTY: i64 = 1 |
| 42 | const A_ACT_ERROR: i64 = 1 |
| 43 | const A_ACT_RECEIPT: i64 = 1 |
| 44 | const A_ACT_PERMIL: i64 = 571 |
| 45 | const G_PERMIL_FULL: i64 = 1000 |
| 46 | const G_UNVOTED: i64 = 0 - 1 |
functions
| 48 | func g_tab(fd: i64) -> i64 { let b: *u8 = sys_mmap(2); b[0] = SC_TAB as u8; sys_write(fd, b, 1); return 0 } called by 1: g_act |
| 49 | func g_edge(fd: i64, ts: i64, acc: *u8, vh: i64, by: i64, rc: i64) -> i64 |
| 55 | func g_act(fd: i64, ts: i64, status: *u8, lane: *u8, ec: i64, by: i64) -> i64 |
| 62 | func g_num(buf: *u8, n: i64, key: *u8) -> i64 |
| 67 | func g_lastline_is(buf: *u8, n: i64, tail: *u8) -> i64 |
| 73 | func main() -> i64 |