nx_os_exceed_gate.nx
buildroot/runtime/nx_os_exceed_gate.nx
about
nx_os_exceed_gate.nx -- MEASURED OS exceed harness: Nishi vs Windows/macOS/Linux, organ-graded.
Turns "outperforms" from a slogan into NUMBERS. It MEASURES what it can (boot-image bytes, FB-driver
source bytes, lineage node count -- read off real files), and for incumbents uses BY-DESIGN facts (the
way the flasher used dd: "dd writes blind"). Grades each axis by a RULE, never by opinion. Crucially
it is HONEST: an OVERCLAIM CONTROL forces the gate RED if it fails to admit the axes where Nishi is
BEHIND -- so this can never become a self-congratulatory whitewash (feedback: measured exceed, never
self-scored; organ computes the grade, charter sets the frame).
VERDICT GREEN = "measured + honestly graded, exceeds on >=1 integrity axis AND admits >=1 breadth
deficit" -- i.e. an HONEST narrow exceed, NOT a claim of overall victory. expect_exit: 0 tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_gate_verdict.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
| 13 | 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 } |
| 14 | func ox_num(v: i64) -> i64 { let b: *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{b[i]=t[k-1-i];i=i+1} sys_write(1,b,k); return 0 } |
| 15 | func ox_len(path: *u8) -> i64 { let lenp: *i64 = sys_mmap(8) as *i64; let buf: *u8 = sys_read_file(path, lenp); if (buf as i64)==0 { return 0-1 } return lenp[0] } |
| 17 | func ox_rows(path: *u8) -> i64 { let lenp: *i64 = sys_mmap(8) as *i64; let buf: *u8 = sys_read_file(path, lenp); if (buf as i64)==0 { return 0 } let n: i64=lenp[0]; var rows: i64=0; var ls: i64=0; var i: i64=0; while i<=n { var atend: i64=0; if i==n { atend=1 } if i<n { if buf[i]==(10 as u8) { atend=1 } } if atend==1 { if i>ls { if buf[ls]!=(35 as u8) { rows=rows+1 } } ls=i+1 } i=i+1 } return rows } |
| 19 | func main() -> i64 |