code wiki / _hdl_build / nx_cidx_equiv_gate.nx
nx_cidx_equiv_gate.nx
buildroot/runtime/_hdl_build/nx_cidx_equiv_gate.nx
about
nx_cidx_equiv_gate.nx -- PROOF (re-runnable) that the per-box computed-decl INDEX (the eagler paint-cliff
fix) is a pure accelerator: for EVERY box of a real page and every paint-side resolver (bg, border,
color, font-size int), the bucketed answer EQUALS the full-scan answer. T2 is the can-fail control: the
index genuinely engages (buckets are smaller than the whole array). If the stable-bucket reorder ever
broke cascade order, T1 catches it on the first divergent box. license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_browser_render.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
| 9 | func gq_w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 10 | func gq_n(v: i64) -> i64 { let t: *u8=sys_mmap(24); var m: i64=v; if m<0{sys_write(1,"-" as *u8,1);m=0-m} 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} let b: *u8=sys_mmap(24); var j: i64=0; while j<k{b[j]=t[k-1-j];j=j+1} sys_write(1,b,k); return 0 } |
| 12 | func main() -> i64 |