code wiki / _hdl_build / nx_js_gc_gate.nx
nx_js_gc_gate.nx
buildroot/runtime/_hdl_build/nx_js_gc_gate.nx
about
nx_js_gc_gate.nx -- prove the non-moving mark-sweep collector (conservative word-scan made EXACT by the
block-start bitmap). Under a TINY 64KB threshold (a collection fires ~every 500 objects):
(A) RECLAIM -- 100k garbage objects leave resident memory BOUNDED (nx_pool_hp plateaus; collections fire).
(B) RETAIN -- large structures kept live across many collections SURVIVE intact (missing root=crash/wrong).
(C) EXACT -- every result stays V8-exact under aggressive GC, incl the 6 self-validating Octane benches.
Any missing root manifests as a use-after-free the self-checking programs catch. expect_exit: 0 license_tier: ORIGINAL
NOTE: helpers take <=2 data args -- nx_cc miscompiled a 3-arg helper call here (crash before/at the callee),
so `want` is threaded through a module global instead of a 3rd parameter.
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
| 10 | 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 } |
| 11 | 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 } |
| 13 | func tck(label: *u8, src: *u8) -> i64 { // check a snippet against the pre-set g_want |
| 21 | func run_octane(path: *u8, label: *u8) -> i64 |
| 37 | func main(argc: i64, argv: *i64) -> i64 |