code wiki / _hdl_build / nx_ad_reach_gate.nx

nx_ad_reach_gate.nx

buildroot/runtime/_hdl_build/nx_ad_reach_gate.nx

4460 B79 linesdepth 4pulls 8 transitivereach 0 importersview sourcekind gate/prooftopic ad
docsdependenciesstructsconstsfunctions

about

nx_ad_reach_gate.nx -- GATE (runnable) for HONEST BILLABLE REACH (nx_ad_reach). Proves the charge basis is ONLY genuinely-seen humans, on a baked funnel + the store-resident bot rules: funnel : served=95 -> viewable=70 -> billable=50 (bot, unseen, under-dwell all stripped) liar-kill: a VIEWABLE BOT is NOT billable; an UNSEEN human is NOT billable; a seen human IS honesty: billable < viewable < served (we never charge for the gap = "no fake impressions") Evidence -> knowledge/status/ad_reach.log (REACHGATE ... verdict=GREEN). license_tier: ORIGINAL

dependencies 4 imports · 0 importers

nx_ad_reach.nx nx_ad_store.nx nx_syscalls.nx nx_gate_verdict.nx nx_ad_reach_gate.nx

imports: nx_ad_reach.nxnx_ad_store.nxnx_syscalls.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

main 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 ↻ ads_botrules sys_mmap ↻ ads_get ss_get sys_mmap ↻ ss_scan sys_mmap ↻ ss_manifest_dyn ss_manifest_file_dyn ss_scan_seglist ss_len sys_mmap ↻ ss_cat ss_readall ss_r32 bf_parse_rules sys_mmap ↻ bf_int ar_tally av_viewable ar_billable_one av_viewable ↻ bf_invalid bf_field

structs

none

consts

12const RG_LOG: *u8 = "knowledge/status/ad_reach.log"

functions

14func rg_w(fd: i64, s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(fd, s, n); return 0 }
called by 1: main calls 1: sys_write
15func rg_wn(fd: i64, v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m; sys_write(fd,"-" as *u8,1)}; let t: *u8 = sys_mmap(28); var k: i64=0; if m==0 {t[0]=48;k=1}; while m>0 {t[k]=(48+(m%10)) as u8; m=m/10; k=k+1}; var i: i64=0; while i<k {bb[i]=t[k-1-i]; i=i+1}; sys_write(fd, bb, k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
17func main() -> i64