code wiki / _hdl_build / nx_js_proto_vm_gate.nx
nx_js_proto_vm_gate.nx
buildroot/runtime/_hdl_build/nx_js_proto_vm_gate.nx
about
nx_js_proto_vm_gate.nx -- built-in prototype EXTENSION on the FAST tiers (VM interpreter BC_CALLM +
baseline JIT jit_callm_prep). Completes the tree-only rung proved by nx_js_proto_gate.nx: user code adds
methods to String.prototype / Array.prototype and calls them on string/array primitives (this=receiver)
while the program runs through compile_run (bytecode VM, and AOT baseline JIT when enabled). Each case is
run TWICE -- js_jit_disable(1) forces the VM interpreter path, js_jit_disable(0) forces the AOT JIT path --
so both mirrors are exercised deterministically (jit_compile is AOT, so JIT-on compiles the callee up front
and jit_callm_prep resolves its native entry). expect_exit: 0 license_tier: ORIGINAL
dependencies 1 imports · 0 importers
imports: nx_js_vm.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 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 nn(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(24); 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(24); 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 } |
| 12 | func vt(label: *u8, src: *u8) -> i64 { // VM/JIT-tier check vs g_want (tier chosen by js_jit_disable in main) |
| 21 | func suite() -> i64 |
| 33 | func main(argc: i64, argv: *i64) -> i64 |