Split the flat 38-file selfhost/ into concern-based subdirectories:
frontend/ lex, parse, parse_game, ast
support/ str, buf, io
backend/ core IR + expression/statement lowering
backend/game/ ECS/scene/event/world lowering
backend/stdlib/ the namespaced Math.*/Text.*/Crypto.*/… intrinsics
and split the three oversized emitters at responsibility boundaries so
no file mixes concerns:
emit_game.ludic -> + emit_world.ludic (reflection world table,
tick helpers, @main synthesis)
emit_expr.ludic -> + emit_call.ludic (namespaced builtins, call
lowering, expr dispatch)
emit_text.ludic -> + emit_text_prelude.ludic (emitted string-builder runtime)
FRAGS in tools/x/selfhost.ludic is updated to the new paths with the link
order preserved, and the Python doc/vocabulary tooling is updated to walk
the new layout. Because the build is a plain in-order concatenation and
every split lands on a blank-line boundary, the regenerated seed is
byte-identical: `x reseed` leaves selfhost/ludicc.seed.ll unchanged,
`x bootstrap-cfree` still reaches its fixed point, and both `x test` (56)
and `x selfhost-test` (29, incl. golden renders) stay green.
Closes #29
Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
29 lines
937 B
Text
29 lines
937 B
Text
# buf.ludic — a growable byte buffer for building IR text. The emitter writes
|
|
# module-level material (types, globals, string constants) into one buffer and
|
|
# function bodies into another, then prints them in order.
|
|
|
|
property Buf { data: pointer = null, len: int = 0, cap: int = 0 }
|
|
|
|
function buf_new() -> Buf {
|
|
let b = new Buf
|
|
b.cap = 256
|
|
b.data = bytes(b.cap)
|
|
b.len = 0
|
|
return b
|
|
}
|
|
function buf_ensure(b: Buf, extra: int) -> void {
|
|
if b.len + extra + 1 <= b.cap { return }
|
|
while b.len + extra + 1 > b.cap { b.cap = b.cap * 2 }
|
|
b.data = resize(b.data, b.cap)
|
|
}
|
|
function buf_putc(b: Buf, c: int) -> void {
|
|
buf_ensure(b, 1)
|
|
b.data[b.len] = c
|
|
b.len = b.len + 1
|
|
}
|
|
function buf_puts(b: Buf, s: pointer) -> void {
|
|
var i = 0
|
|
while s[i] != 0 { buf_putc(b, s[i]); i = i + 1 }
|
|
}
|
|
function buf_puti(b: Buf, n: int) -> void { buf_puts(b, itoa(n)) }
|
|
function buf_str(b: Buf) -> pointer { b.data[b.len] = 0; return b.data }
|