code wiki / _hdl_build / nx_js_speed_bench.nx
nx_js_speed_bench.nx
buildroot/runtime/_hdl_build/nx_js_speed_bench.nx
about
nx_js_speed_bench.nx -- the BENCHMARK-FIRST baseline for the bytecode-VM arc: measure the tree-walker's
throughput on a hot arithmetic loop (the workload that makes production bundles 1000x too slow). The VM
must beat this number on the SAME workload -- measured, never asserted. license_tier: ORIGINAL
dependencies 1 imports · 0 importers
imports: nx_js_eval.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
| 5 | const K_MAGIC_200000: i64 = 200000 |
| 6 | const K_MAGIC_1000000: i64 = 1000000 |
functions
| 8 | func bw(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 |
| 9 | func bn(v: i64) -> i64 { if v==0 { sys_write(1,"0" as *u8,1); return 0 } var m: i64=v; if m<0 { sys_write(1,"-" as *u8,1); m=0-m } let t: *u8=sys_mmap(32); var k: i64=0; while m>0 { t[k]=(48+(m%10)) as u8; m=m/10; k=k+1 } let o: *u8=sys_mmap(32); var q: i64=k-1; var x: i64=0; while q>=0 { o[x]=t[q]; x=x+1; q=q-1 } sys_write(1,o,x); return 0 } called by 1: main |
| 10 | func bslen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: main |
| 12 | func main(argc: i64, argv: *i64) -> i64 |