Brummel
ba516b8b39
Decision 9 ships. Through Iter 14e every ADT box, lambda env, and
closure pair was leaked. This iter substitutes GC_malloc for malloc
in all four IR allocation sites and links -lgc. No language change,
no AST change, no schema change.
Diff: 5 files modified, ~30 LOC net.
- codegen/lib.rs: 4 substitutions @malloc -> @GC_malloc.
- ail/main.rs: .arg("-lgc") in the clang invocation.
- 5 IR snapshot files: mechanical s/@malloc/@GC_malloc/, 9
occurrences. IR is bit-identical to pre-14f modulo this
substitution — exactly Decision 9's promise.
- e2e.rs: new test gc_handles_recursive_list_construction.
- examples/gc_stress.{ailx,ail.json}: new fixture, builds a 50-
element list via recursive Cons, sums it (1275).
Hash invariance verified: every existing fixture def hash
unchanged (codegen and link line are downstream of canonical
bytes; AST didn't move).
Tests 79 -> 80, all green. Existing 79 byte-identical stdout.
gc_stress -> 1275. list_map_poly -> 2/3/4 unchanged. sort
sorted-list unchanged. cargo doc 0 warnings.
GC notes (pertinent to future work):
- GC_INIT() not needed on Arch libgc 1.5.6 (auto-init via
__attribute__((constructor))).
- No conservative-scan over-retention observed.
- -lgc alone sufficient for link (pthread/dl transitive).
Pattern-shape note from gc_stress fixture writing: the post-14d
"if-then-else" replacement is `(match (app == n 0) (case
(pat-lit true) ...) (case (pat-wild) ...))`. Three lines for
what `if` used to do in one, but uniform with the language.
Worth flagging for the stdlib brief.
Language is feature-complete enough for stdlib. The three
blockers identified at the 14b boundary (redundancy 14d, tail
calls 14e, GC 14f) are all done. Plan 15a: first stdlib module
std_list.ailx with length/append/reverse/map/filter/fold_left/
fold_right/head/tail/is_empty.
Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
53 lines
1.2 KiB
LLVM
53 lines
1.2 KiB
LLVM
; AILang generated workspace; entry: sum
|
|
source_filename = "sum.ail"
|
|
target triple = "<NORMALIZED>"
|
|
|
|
@.str_sum_fmt_int_0 = private unnamed_addr constant [6 x i8] c"%lld\0A\00", align 1
|
|
|
|
declare i32 @printf(ptr, ...)
|
|
declare i32 @puts(ptr)
|
|
declare ptr @GC_malloc(i64)
|
|
|
|
@ail_sum_sum_clos = private unnamed_addr constant { ptr, ptr } { ptr @ail_sum_sum_adapter, ptr null }
|
|
@ail_sum_main_clos = private unnamed_addr constant { ptr, ptr } { ptr @ail_sum_main_adapter, ptr null }
|
|
define i64 @ail_sum_sum(i64 %arg_n) {
|
|
entry:
|
|
%v1 = icmp eq i64 %arg_n, 0
|
|
br i1 %v1, label %then.2, label %else.2
|
|
then.2:
|
|
br label %join.2
|
|
else.2:
|
|
%v3 = sub i64 %arg_n, 1
|
|
%v4 = call i64 @ail_sum_sum(i64 %v3)
|
|
%v5 = add i64 %arg_n, %v4
|
|
br label %join.2
|
|
join.2:
|
|
%v6 = phi i64 [ 0, %then.2 ], [ %v5, %else.2 ]
|
|
ret i64 %v6
|
|
}
|
|
|
|
define i64 @ail_sum_sum_adapter(ptr %_env, i64 %a0) {
|
|
entry:
|
|
%r = call i64 @ail_sum_sum(i64 %a0)
|
|
ret i64 %r
|
|
}
|
|
|
|
define i8 @ail_sum_main() {
|
|
entry:
|
|
%v1 = call i64 @ail_sum_sum(i64 10)
|
|
call i32 (ptr, ...) @printf(ptr @.str_sum_fmt_int_0, i64 %v1)
|
|
ret i8 0
|
|
}
|
|
|
|
define i8 @ail_sum_main_adapter(ptr %_env) {
|
|
entry:
|
|
%r = call i8 @ail_sum_main()
|
|
ret i8 %r
|
|
}
|
|
|
|
|
|
define i32 @main() {
|
|
call i8 @ail_sum_main()
|
|
ret i32 0
|
|
}
|