code wiki / _hdl_build / nx_bunny_gate.nx

nx_bunny_gate.nx

buildroot/runtime/_hdl_build/nx_bunny_gate.nx

4304 B77 linesdepth 4pulls 7 transitivereach 0 importersview sourcekind gate/proof

docs dependencies structs consts functions

about

nx_bunny_gate.nx -- ★STANFORD BUNNY on the Nishi renderer (field-evidence rung 2): the standard mesh corpus. The conformance claim is EXACTNESS: the banked Stanford ground truth says bun_zipper = 35947 vertices / 69451 triangles, and the loaded mesh must match those numbers exactly (provenance proven by the counts). Then it must render. T1 exact canonical counts. T2 renders (our largest mesh ever). T3 determinism. T4 evidence -> knowledge/nx_bunny.png. license_tier: ORIGINAL expect_exit: 0

dependencies 4 imports · 0 importers

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

16	const BG: i64 = 24 + 26256 + 3465536
17	const W: i64 = 300
18	const H: i64 = 300

functions

11	func hw(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 1: main calls 1: sys_write
12	func pn(v: i64) -> i64 { let b: u8=sys_mmap(32) as u8; var x: i64=v; var ng: i64=0; if x<0{ng=1;x=0-x} var i: i64=31; if x==0{b[i]=48 as u8;i=i-1} while x>0{b[i]=(48+x%10) as u8;x=x/10;i=i-1} if ng==1{b[i]=45 as u8;i=i-1} sys_write(1,(b as i64+i+1) as *u8,31-i); return 0 } called by 1: main calls 2: sys_mmap sys_write
13	func clearfb(fb: *i64, n: i64, c: i64) -> i64 { var i: i64=0; while i<n { fb[i]=c; i=i+1 } return 0 } called by 1: main
14	func filled(fb: *i64, n: i64, bg: i64) -> i64 { var c: i64=0; var i: i64=0; while i<n { if fb[i]!=bg { c=c+1 } i=i+1 } return c } called by 1: main
20	func main() -> i64 calls 15: hw sys_mmap tm_set_spec tm_set_tex obj_load tm_nv+9