code wiki / _hdl_build / nx_onsite_exceed.nx
nx_onsite_exceed.nx
buildroot/runtime/_hdl_build/nx_onsite_exceed.nx
about
nx_onsite_exceed.nx -- MEASURED, ORGAN-GRADED exceed census for the reusable onsite search, vs the
world-class incumbents. The operator's doctrine: an "S-class exceed" verdict must be MEASURED + cited,
NEVER self-scored. So this organ does NOT assert grades -- it DERIVES each one MECHANICALLY by grepping a
real Nishi codebase file and a real sovereign-FETCHED incumbent page (knowledge/fetched/srch_*.raw + the
BM25 page), and it REFUSES to grade any axis whose evidence file is missing (the liar-kill). The verdict is
the honest per-axis tally -- parity on the core ranker, exceed on the sovereignty axes incumbents
structurally can't win, behind on the BM25F/neural rungs that ARE the build worklist. "GREEN" here means
CITATION INTEGRITY (every cell backed by a real file), NOT "we beat everyone". 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
| 10 | const POL_MAGIC_8388608: i64 = 8388608 |
| 11 | const POL_MAGIC_2026: i64 = 2026 |
| 13 | const POL_CAP: i64 = 0 // capability (presence = good): parity / behind / exceed |
| 14 | const POL_SOV: i64 = 1 // sovereignty: nishi-sovereign vs incumbent-hard-dependency -> exceeds |
| 15 | const POL_NISHI: i64 = 2 // nishi-only advantage: nishi has it, incumbent doesn't -> exceeds |
| 17 | const G_PARITY: i64 = 1 |
| 18 | const G_BEHIND: i64 = 2 |
| 19 | const G_EXCEED: i64 = 3 |
| 20 | const G_NEITHER: i64 = 4 |
| 21 | const G_UNCITED: i64 = 9 |
functions
| 23 | func ox_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 24 | func ox_strlen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: ox_contains |
| 25 | func ox_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 } |
| 26 | func ox_pn(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 } |
| 27 | func ox_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 } |
| 30 | func ox_contains(path: *u8, needle: *u8) -> i64 |
| 46 | func ox_yn(v: i64) -> *u8 { if v==1 { return "YES " as *u8 } if v==0 { return "no " as *u8 } return "MISS" as *u8 } called by 1: ox_axis |
| 47 | func ox_grade_name(g: i64) -> *u8 called by 1: ox_axis |
| 56 | func ox_axis(name: *u8, nf: *u8, nm: *u8, if_: *u8, im: *u8, pol: i64) -> i64 |
| 80 | func main() -> i64 |