code wiki / _hdl_build / nx_polite_crawl_test.nx

nx_polite_crawl_test.nx

buildroot/runtime/_hdl_build/nx_polite_crawl_test.nx

7705 B141 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic polite
docsdependenciesstructsconstsfunctions

about

nx_polite_crawl_test.nx -- ACCEPTANCE GATE for the polite crawl governor. Exact-integer KATs + a SIMULATED crawl proving the synergy: spreading across many hosts is BOTH broad AND polite, and a host that pushes back (429) gets backed off, not hammered.

dependencies 2 imports · 0 importers

nx_polite_crawl.nx nx_syscalls.nx nx_polite_crawl_test.nx

imports: nx_polite_crawl.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 pc_backoff_ms ct_puts sys_write ct_putn sys_mmap sys_write ↻ pc_may_fetch sys_mmap ↻ pc_on_response pc_backoff_ms ↻ pc_next_host pc_may_fetch ↻ pc_breadth_permil pc_research_gate pc_is_broad pc_is_polite pc_breadth_permil ↻ pc_record pc_is_polite ↻ pc_is_broad ↻ sys_exit

structs

none

consts

none

functions

7func ct_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 1: main calls 1: sys_write
8func ct_putn(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as *u8,1)} let t: *u8=sys_mmap(28); 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} var i: i64=0; while i<k{bb[i]=t[k-1-i];i=i+1} sys_write(1,bb,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
10func main() -> i64
calls 13: pc_backoff_msct_putsct_putnpc_may_fetchsys_mmappc_on_response+7