code wiki / _hdl_build / nx_ad_intake_gate.nx

nx_ad_intake_gate.nx

buildroot/runtime/_hdl_build/nx_ad_intake_gate.nx

5394 B105 linesdepth 5pulls 7 transitivereach 0 importersview sourcekind gate/prooftopic ad
docsdependenciesstructsconstsfunctions

about

nx_ad_intake_gate.nx -- GATE (runnable) for advertiser self-serve signup (nx_ad_intake). Proves: create : a valid campaign returns IN_OK and reads back with business + goal + fee + status liar-kill: every invalid intake is REFUSED with the right code AND not persisted -- unknown goal (-1, absent in store), negative fee (-2), over-ceiling fee (-2), empty business (-3) privacy : the persisted record carries NO site-visitor identity (scan for a visitor token = 0), and the scanner FIRES on a planted token (anti-false-green) -- the LAW made load-bearing Evidence -> knowledge/status/ad_intake.log (INTAKEGATE ... verdict=GREEN). license_tier: ORIGINAL

dependencies 3 imports · 0 importers

nx_ad_intake.nx nx_ad_store.nx nx_syscalls.nx nx_ad_intake_gate.nx

imports: nx_ad_intake.nxnx_ad_store.nxnx_syscalls.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main in_create_campaign in_goal_known sys_mmap as_append ads_get ss_get sys_mmap ↻ ss_scan sys_mmap ↻ ss_manifest_dyn ss_scan_seglist in_fee_max sys_mmap ↻ ads_get ↻ in_creative_ok as_len sys_mmap ↻ in_build_record as_append ↻ in_appn sys_mmap ↻ in_campaign_key as_append ↻ in_streq_store sys_mmap ↻ ads_get ↻ ss_begin ss_begin_cap sys_mmap ↻ ss_add ss_add2 ss_w32 ss_len ads_seg_next sys_mmap ↻ ss_manifest ss_manifest_file sys_mmap ↻ ss_cat

structs

none

consts

13const IG_LOG: *u8 = "knowledge/status/ad_intake.log"

functions

15func ig_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
16func ig_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
19func ig_record_has(key: *u8, needle: *u8) -> i64
called by 1: main calls 3: sys_mmapads_getas_contains
27func ig_present(key: *u8) -> i64
called by 1: main calls 2: sys_mmapads_get
34func main() -> i64