`null` is now a real pointer literal and null-tests are comparisons, instead of `ptr_null()` and `ptr_is_null(x)`: ptr_null() -> null ptr_is_null(x) -> (x == null) not ptr_is_null(x) -> (x != null) Mechanics: a new E_NULL primary (`null`, like true/false) lowers to the `null` pointer; emit_bin's comparison path now picks `ptr` vs `i32` from operand type (via llty), so `==`/`!=` work on any pointer/record/slice. The two intrinsics are deleted. Two reseeds: (A) add the literal + ptr comparison keeping the intrinsics; (B) migrate all 182 call sites (compiler + runtime, via a balanced-paren script that skips string-literal args and rewrites `not ptr_is_null` to `!= null`) and delete the intrinsics. Node/Val/Buf/Tok field defaults now read `ptr = null`. Vocabulary drops the two from LUDIC_INTRINSICS; `null` joins true/false as a language constant (grammar + ludic_syntax.h). LANGUAGE.md notes the literal. Reseeded (21664 lines); C-free fixpoint holds; goldens identical; 17/17; vocab + doc-fences clean. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
39 lines
1.6 KiB
Text
39 lines
1.6 KiB
Text
# emit_machine.ludic — `machine <reg> { state Name = v { .. } }` dispatches on a
|
|
# register's value; `become Name` stores the target state's value back. Both are
|
|
# reg()/set_reg() calls, resolved to the runtime like any other builtin.
|
|
|
|
fn emit_machine(st: Node) -> void {
|
|
let regv = emit_expr(st.a)
|
|
let s = emit_bind(sconcat("call i32 @fn_rt_reg(i32 ", sconcat(regv.code, ")")))
|
|
if nmach < len(mach_stk) { mach_stk[nmach] = st } else { push(mach_stk, st) }
|
|
nmach = nmach + 1
|
|
let endl = lbl("smend")
|
|
var i = 0
|
|
while i < len(st.kids) {
|
|
let state = st.kids[i]
|
|
let v = emit_expr(state.b)
|
|
let c = emit_bind(sconcat("icmp eq i32 ", sconcat(s, sconcat(", ", v.code))))
|
|
let body = lbl("sbody"); let nxt = lbl("sarm")
|
|
emit(" br i1 "); emit(c); emit(", label %"); emit(body); emit(", label %"); emit(nxt); emit("\n")
|
|
emit(body); emit(":\n"); g_term = false
|
|
emit_block(state.a)
|
|
if not g_term { emit(" br label %"); emit(endl); emit("\n") }
|
|
emit(nxt); emit(":\n"); g_term = false
|
|
i = i + 1
|
|
}
|
|
if not g_term { emit(" br label %"); emit(endl); emit("\n") }
|
|
emit(endl); emit(":\n"); g_term = false
|
|
nmach = nmach - 1
|
|
}
|
|
|
|
fn emit_become(st: Node) -> void {
|
|
if nmach == 0 { perr("'become' outside a machine") }
|
|
let m = mach_stk[nmach - 1]
|
|
var target: Node = null
|
|
var i = 0
|
|
while i < len(m.kids) { if streq(m.kids[i].s, st.s) { target = m.kids[i] }; i = i + 1 }
|
|
if (target == null) { perr(sconcat("become: no state ", st.s)) }
|
|
let regv = emit_expr(m.a)
|
|
let sv = emit_expr(target.b)
|
|
emit(" call void @fn_rt_set_reg(i32 "); emit(regv.code); emit(", i32 "); emit(sv.code); emit(")\n")
|
|
}
|