code wiki / _hdl_build / nx_andelinwest_search_gate.nx

nx_andelinwest_search_gate.nx

buildroot/runtime/_hdl_build/nx_andelinwest_search_gate.nx

7219 B117 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind gate/prooftopic andelinwest

docs dependencies structs consts functions

about

nx_andelinwest_search_gate.nx -- the REAL, MEASURED search gate for andelinwest.com. REPLACES the dishonest nx_andelinwest_search demo (which hardcoded 6 strings and SELF-SCORED "REFEREE=EXCEED" -- exactly the self-grading the operator's doctrine forbids). This gate (1) rebuilds the andelinwest index from the REAL site content (knowledge/index/andelinwest_src.tsv, derived from web_assets/_sites/andelinwest.site) via the reusable ingestor, then (2) forks the REAL /tmp/nx_onsite_search.sov.elf client and checks each EXAMPLE QUERY from the site's own search box ("divorce, will, injury, contract...") lands the RIGHT practice page at rank #1. The verdict is MEASURED from the live client's output, never asserted. GREEN iff 4/4. Durable log appends to knowledge/status/andelinwest_search_gate.log. license_tier: ORIGINAL

dependencies 1 imports · 0 importers

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

11	func a_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: a_row main calls 1: sys_write
12	func a_num(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 2: a_row main calls 2: sys_mmap sys_write
13	func a_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 } calls 1: sys_write
14	func a_wn(fd: i64, v: i64) -> i64 { let bb: u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; 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(fd,bb,k); return 0 } calls 2: sys_mmap sys_write
15	func a_strlen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 3: a_write_file a_exec5 a_find
17	func a_write_file(path: u8, data: u8) -> i64 called by 1: main calls 4: sys_openat_wr sys_write a_strlen sys_close
22	func a_read_small(path: u8, buf: u8, cap: i64) -> i64 called by 1: a_row calls 3: sys_openat_rd sys_read sys_close
31	func a_exec5(path: u8, a1: u8, a2: u8, a3: u8, a4: u8, out_path: u8) -> i64 called by 1: main calls 8: sys_fork a_strlen sys_openat_wr sys_dup3 sys_mmap sys_execve+2
45	func a_client(sites: u8, site: u8, term: u8, out_path: u8) -> i64 called by 1: a_row calls 7: sys_fork sys_openat_wr sys_dup3 sys_mmap sys_execve sys_exit+1
58	func a_find(hay: u8, n: i64, needle: u8) -> i64 called by 1: a_rank_of calls 1: a_strlen
64	func a_rank_of(buf: u8, n: i64, expected: u8) -> i64 called by 1: a_row calls 1: a_find
76	func a_row(label: u8, term: u8, expect: u8, sites: u8, outp: u8, obuf: u8) -> i64 calls 5: a_client a_read_small a_rank_of a_puts a_num
85	func main() -> i64 calls 5: a_puts a_exec5 a_num sys_exit a_write_file