code wiki / _hdl_build / nx_adnet_bill_gate.nx

nx_adnet_bill_gate.nx

buildroot/runtime/_hdl_build/nx_adnet_bill_gate.nx

4684 B105 linesdepth 4pulls 4 transitivereach 0 importersview sourcekind gate/prooftopic adnet

docs dependencies structs consts functions

about

nx_adnet_bill_gate.nx -- GATE for CPM/CPC billing math (nx_adnet_bill). Proves exact integer math, the HONEST-BILLING refusals (missing rate / negative count -> REFUSED, never a fabricated charge), the no-charge-by-default zero case, the budgetable flat ceiling, per-AD log counting, and that the refusal is LOAD-BEARING through the invoice line (negative control). expect_exit: 0 license_tier: ORIGINAL

dependencies 2 imports · 0 importers

imports: nx_syscalls.nxnx_adnet_bill.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

none

functions

9	func bg_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } called by 2: bg_putn main calls 1: sys_write
10	func bg_putn(v: i64) -> i64 { var m: i64 = v; if m < 0 { bg_puts("-" as u8); m = 0 - m } let t: u8 = sys_mmap(24); var k: i64 = 0; if m == 0 { t[0] = 48 as u8; k = 1 } while m > 0 { t[k] = (48 + (m % 10)) as u8; m = m / 10; k = k + 1 } let o: *u8 = sys_mmap(24); var i: i64 = 0; while i < k { o[i] = t[k - 1 - i]; i = i + 1 } sys_write(1, o, k); return 0 } called by 1: main calls 3: bg_puts sys_mmap sys_write
11	func bg_cat(dst: u8, off: i64, s: u8) -> i64 { var o: i64 = off; var i: i64 = 0; while s[i] != (0 as u8) { dst[o] = s[i]; o = o + 1; i = i + 1 } return o } called by 1: main
13	func bg_has(hay: u8, n: i64, needle: u8) -> i64 called by 1: main
28	func main() -> i64 calls 13: bg_puts anb_total_milli anb_capped sys_mmap bg_cat anb_count+7