moon/zygotec/src/compiler/expr.zc, branch work/uninit-locals work-in-progress programming language.
https://git.downsta.ir/moon/zygotec/atom?h=work%2Funinit-locals2026-10-15T18:58:06+00:00uninit: track aggregate fills per part, sticky computed-index fills, &a[k] and method calls set the aggregate; fix test/example hits; docs2026-10-15T18:58:06+00:00zinczinc@downsta.ir2026-10-15T18:58:06+00:00urn:sha1:5a4dc62a79af6135c7050e81a82dbfdfb0a7d4e0definite 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:00zinczinc@downsta.ir2026-10-15T18:45:38+00:00urn:sha1:be43babc1886fc5efee898b2a3d0285012e511fb
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
constant expressions: c precedence and / % ^ (b.1.3); local const usable in constant expressions (b.1.7, b.2.16); zc0 matches2026-10-15T14:55:36+00:00zinczinc@downsta.ir2026-10-15T14:55:36+00:00urn:sha1:08173d7f88f8551caca81594ed8af79d82d3f71fmerge work/demo-fixes: analyzer ownership fixes (back links, loop-built lists, .u inference), Io.print any args, block-end borrow messages2026-10-15T14:20:10+00:00zinczinc@downsta.ir2026-10-15T14:20:10+00:00urn:sha1:251b0212f626d0f92eda51906d353712ef4a63b8std.Io.print/println take any mix of printable arguments (compiler expands per type); docs, conformance2026-10-15T11:30:36+00:00zinczinc@downsta.ir2026-10-15T11:30:36+00:00urn:sha1:a5a5029a80a14be46c244b5bcca63e5e2cd9026fhold blocks: top-level hold { shared let ...; fn ... } monitors; shared values kept by the host and copied in/out at the outermost call, reentrant per-block locks in declaration order (core, micro)2026-10-15T11:02:10+00:00zinczinc@downsta.ir2026-10-15T11:02:10+00:00urn:sha1:253ac862c696d73fb17c14a847270b6e08aa8769analyzer: check borrow returns of forward-called functions at the unit's end; borrows clause for prototypes, definitions, externs and function types, checked against the body2026-10-15T06:26:19+00:00zinczinc@downsta.ir2026-10-15T06:26:19+00:00urn:sha1:6bbac2edf7c50dac4d755a364b6dfd16471284d7analyzer: use-after-end messages name the borrower, the owner and how the owner ended (freed, moved, .d parameter, push, global, reassignment), with fixtures2026-10-15T06:18:10+00:00zinczinc@downsta.ir2026-10-15T06:18:10+00:00urn:sha1:0a87c4663fc52bf60f3d440200b3b3ad6b39bd3ewip: prover gaps (inline len bound, cross-array, rt.new depth, fixed new, affine i*n+k); unbuilt and untested2026-10-15T01:47:02+00:00zinczinc@downsta.ir2026-10-14T17:16:17+00:00urn:sha1:a1d546cc74a72abc4973bf96f72bbd529320d711o3: use new_k (size-class free lists) like plain code2026-10-15T01:46:53+00:00zinczinc@downsta.ir2026-10-15T01:46:53+00:00urn:sha1:b86db60d8b2a50b179d9a3e69a0b4951e0c196f9
Constant-size typed new inside o3 now calls rt.new_k instead of always
taking new_t/new_raw. new_k and recycle_leaf skip the o3 argument-fatten
path the way free/recycle already do. trees o3 new/free on the x86-64
jit dropped from about 4.1 ms to about 2.7 ms per iter (matches plain).