code wiki / (root) / nx_search_extern_gate.nx

nx_search_extern_gate.nx

buildroot/runtime/nx_search_extern_gate.nx

2660 B40 linesdepth 22pulls 148 transitivereach 0 importersview sourcekind gate/prooftopic search
docsdependenciesstructsconstsfunctions

about

nx_search_extern_gate.nx -- deterministic parser gate for the external-search federator (NO network: the live fetch is proven by running the organ; this locks the arXiv/GitHub response PARSING so a regression is caught reproducibly). Imports the federator (main stripped) + drives its pure parse fns.

dependencies 2 imports · 0 importers

nx_search_extern.nx nx_syscalls.nx nx_search_extern_gate.nx

imports: nx_search_extern.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 gp sys_write sys_mmap glen chk gp ↻ gnum sys_write ↻ sys_mmap ↻ se_count se_spans se_strlen sp sys_write ↻ sys_write ↻ gnum ↻ sys_exit

structs

none

consts

none

functions

7func gp(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: chkmain calls 1: sys_write
8func gnum(v: i64) -> i64 { if v==0 { sys_write(1,"0" as *u8,1); return 0 } var m: i64=v; if m<0 { sys_write(1,"-" as *u8,1); m=0-m } let t: *u8=sys_mmap(28); var k: i64=0; while m>0 { t[k]=(48+(m%10)) as u8; m=m/10; k=k+1 } while k>0 { k=k-1; sys_write(1,(((t as i64)+k) as *u8),1) } return 0 }
called by 2: chkmain calls 2: sys_writesys_mmap
9func glen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n }
called by 1: main
10func chk(name: *u8, got: i64, want: i64, pass: *i64, fail: *i64) -> i64
called by 1: main calls 2: gpgnum
16func main() -> i64