moon/zygotec/src/runtime/rt.zc, branch work/uninit-locals

definite assignment: reading a local before it is initialized is a compile error (spec 4.1.5, b.1.9)

2026-10-15T18:45:38+00:00

track linited per local alongside the ownership state; snapshots, exit records and joins carry it, and a join keeps a local set only when every reaching path set it. x = e, a declaration initializer, &x (out-parameter), a full array initializer, or using an aggregate as an address set a local; field and element writes do not set the aggregate. while/for bodies that may run zero times do not count; do/while does. compiler, runtime, std, actor and lsp sources initialize the locals the rule flagged; zc0 accepts = {} brace lists (zeroed). tests: tests/errors/uninit_*.zc, tests/conformance/4-statements/uninit_*.zc

duplicate case labels are an error (b.2.15); unterminated string literal reported where it starts (b.2.11); an unreachable droppable cycle drops whole in one collection (6.15.3)

2026-10-15T14:59:55+00:00

rt: recycle, new_k and own without helper calls or || chains

2026-10-15T04:00:53+00:00

perf (ZYPERFMAP) on plain trees new/free showed recycle, new_k and own taking about 70% of the time, mostly in calls to isobj, paylen, bdrop, bclass and fpush and in the truth values plain code builds for && and ||. recycle writes isobj, paylen and the class-list push out, calls scan_ptr only for 8 or more words left, and own and new_k test with nested ifs. frame_control grows to 22 words: a tag, &dbg and the entries of new_k, recycle_leaf and own for the x86-64 jit's inline fast paths (next commit).

rt: gc_drops finalizes a droppable value that reaches itself (a cycle, or a drop capturing its own value), one per collection, each once; before, each waited for the other forever; spec 6.15.3, drop_gc_cycle.zc, drop_gc_self_capture.zc, design doc lists what landed

2026-10-14T23:14:26+00:00

rt: memreport marks a leaked value whose drop never ran with (drop); spec 4.11, readme, memdebug_report_drop.zc

2026-10-14T23:10:51+00:00

genmap: default genome reservation 0x70000 words (the genome had 197 words left); the map constants in rt.zc and the README table move by 0x8000; gc.zc's reclaim bound is 900 (937 with the heap higher, 952 before) and the run-only section rewrites whatever its number

2026-10-14T23:10:51+00:00

rt: the free paths take one F_HASDROP test, and dropfree does the drop and the clearing out of line

2026-10-14T20:39:49+00:00

destructors: heap(v), drop(v, f) / v.drop(f) / v.drop = f, struct drop methods, collector drops after the sweep (once, resurrection), freed blocks forget their drop, temporaries drop at statement end with a hint, actor send check; o3: no collection inside a region (pending until the outermost exit), no drops set or ended inside o3; spec 3.11.6, 4.10.3-4, 6.15

2026-10-14T19:40:49+00:00

zy: a runtime trap exits 2 (rt.trap: index out of range, frame overflow, out of heap, bad pointer, use after free); compile errors stay 1; spec 8.1.3; exitstatus.sh checks exit 2

2026-10-14T17:45:13+00:00

rt: exact-size heap bounds; n, the words new asked for, lives in bits 32..62 of p[-4]

2026-10-14T15:05:03+00:00

the bnd recipe and paylen read n instead of the power-of-two block: bnd: r6 = sub p 3; r6 = ld r6; r7 = xor p 0x2B7E1516; r6 = eq r6 r7; r7 = sub p 4; r7 = ld r7; r7 = shr r7 32; r7 = mul r7 q; r8 = mul i m; r8 = ltu r8 r7; r8 = xor r8 1; r0 = and r6 r8 paylen: return p[-4] >> 32 two loads instead of three; osize, bchk, release, recycle and the memdebug leak report all read n (rt.new(4) has length 4, rt.new(0) has 0). writers: new_raw and new_k set n; stack.h line 87 and tinyvm.ts (BigInt) set it on stack segments. release clears n when a block goes into quarantine (len 0, indexing traps; under memdebug bchk reports a use after free); every free-list path (fpush, mkblock, bdrop, recycle_leaf, balloc hold) rewrites the word as k << 16, and an array that grows gets a fresh block. a request over 2^31-1-HDR words stops in new_raw (oom), and the compiler only takes the new_k fast path for constant sizes that fit, so n is never truncated. bit users checked (all mask or preserve bits 32..62; none compares or copies the whole word): gc mark and sweep; release, free, recycle, recycle_leaf; share and own; isobj, quar, checkptr, obj_base; bclass and the bfree buddy merge; balloc, mkblock, fpush, funlink, heap_grow; frame_grow; stack_allocate in src/core/stack.h and src/js/tinyvm.ts; micro.c and core.c (check word only); the compiler's two p[-4] | F_INTERNAL writes (base.zc, builtins.zc). 32-bit ports: none (baremetal, wasm and micro use int64 Cell). tests: tests/programs/exactsize.zc (n-1/n for non-power-of-two sizes, new(0), packed bytes, recycle, grow, stack growth); 8-runtime: exact_size_bounds, pointer_index_n_minus_1, pointer_index_n_traps, pointer_index_n_traps_memdebug, new_zero_index_traps, new_too_big_traps, stale_index_after_free_traps, stale_index_after_free_memdebug. expectations changed: leak report shows n (tests/test.sh line 169, examples/learn/13-memdebug.out, docs/LEARN.md, 4-statements/memdebug_report_line.zc). programs adjusted to keep test.sh expectations: quarantine.zc (unbounded), bounds_heap.zc (rt.new(11)). spec 3.7.4 and 4.11 updated. fixpoint 402204 words (main 402197).