code wiki / _hdl_build / nx_retarget_emit.nx
nx_retarget_emit.nx
buildroot/runtime/_hdl_build/nx_retarget_emit.nx
about
nx_retarget_emit.nx -- R3 APPLICATION LEG (debt 1785900608/1785900993): export the being as a SKINNED, WALKING .glb. Mesh the skin, bind each vertex to its nearest
part's deepest FK bone, export with a walk-cycle animation, self-verify the container + names. Writes nishi_being_walk.glb.
license_tier: ORIGINAL expect_exit: 0
dependencies 5 imports · 0 importers
imports: nx_syscalls.nxnx_trimesh.nxnx_isosurf.nxnx_bodyatlas.nxnx_gltf_anim.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
| 9 | const K_MAGIC_1231: i64 = 1231 |
| 10 | const K_MAGIC_1403: i64 = 1403 |
| 11 | const K_MAGIC_1067: i64 = 1067 |
| 12 | const K_MEASURED_CALF_1179: i64 = 1179 // theirs/ours fx1024, derived frame-cancelling via the CONVERGED thigh: (their shin->foot 0.38811 / their hip->knee 0.34247) / (our knee->ankle 400 / our hip->knee 390) * 1067 |
| 13 | const K_MAGIC_65536: i64 = 65536 |
| 14 | const K_MAGIC_8388608: i64 = 8388608 |
| 21 | const GX: i64 = 32 |
| 22 | const GY: i64 = 110 |
| 23 | const GZ: i64 = 20 |
| 24 | const GC: i64 = 18 |
| 25 | const OX: i64 = 0-288 |
| 26 | const OY: i64 = 0-990 |
| 27 | const OZ: i64 = 0-180 |
functions
| 16 | 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 } |
| 17 | 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 } |
| 18 | func ru32(buf: *u8, at: i64) -> i64 { return (buf[at] as i64) + ((buf[at+1] as i64)<<8) + ((buf[at+2] as i64)<<16) + ((buf[at+3] as i64)<<24) } called by 1: main |
| 19 | func hasstr(buf: *u8, n: i64, needle: *u8) -> i64 { var m: i64=0; while needle[m]!=(0 as u8){m=m+1} var i: i64=0; while i+m<=n { var k: i64=0; while k<m { if buf[i+k]!=needle[k] {k=m+9} else {k=k+1} } if k==m {return 1} i=i+1 } return 0 } called by 1: main |
| 29 | func main() -> i64 |