Brummel
6fdb45d2f2
Single iter shipping the post-milestone-24 follow-up named in
docs/specs/2026-05-14-retire-per-type-print-effects.md. After this
iter the only surviving direct-output effect-op is `io/print_str`;
all per-type print primitives are replaced by the polymorphic
`print` helper (prelude, iter 24.3).
Components:
- 92 examples/*.ail fixtures migrated (do io/print_<T> x) →
(app print x); 6 .prose.txt snapshots regenerated via `ail prose`.
- Four-site lockstep compiler deletion: crates/ailang-check/src/builtins.rs
(3 effect_ops.insert blocks + 3 list() rows + the
install_io_print_float_signature test + module + EffectOpSig
doc-comments); crates/ailang-codegen/src/lib.rs lower_app
(3 arms + lowers_io_print_float test); crates/ailang-codegen/src/synth.rs
builtin_effect_op_ret match-arm pattern. Dead `intern_string`
helper removed as a follow-up.
- Five incidental test-body migrations (ailang-check x2, ailang-core
spec_drift + design_schema_drift, ailang-surface/src/lex.rs,
ailang-prose/src/lib.rs round-trip test).
- Cat B test-harness patch: six IR-shape tests in
crates/ail/tests/e2e.rs gained a monomorphise_workspace call
before lower_workspace_with_alloc so they follow the same
pipeline as `ail build` (the home-rolled desugar+lift loop
stayed because mono's precondition is "already lifted"; mono
inserts after lift).
- Six doc-comment touch-ups (lex.rs module doc, parse.rs
diagnostic example, ail/src/main.rs x2, runtime/str.c %g anchor,
crates/ailang-core/specs/form_a.md surface-spec example).
- DESIGN.md seven-site sweep (Decision 11 example, Polymorphic
print past-tense, Heap-Str output sentence, effect-op
invocation comment, Float NaN paragraph re-anchored on
float_to_str, two "What is supported" lists).
- Three E2E test-comment polish + four IR-snapshot refresh + one
canonical-hash pin update (plan-unanticipated downstream
consequences of the corpus migration).
- bench/{check,compile_check,cross_lang}.py: all exit 0; no
ratification needed.
- Roadmap entry struck through; per-iter journal at
docs/journals/2026-05-14-iter-rpe.1.md.
Tests 564/0/3. cargo clippy and cargo doc: zero warnings.
Two upstream codegen bugs surfaced during the first BLOCKED
attempt and were fixed in separate iters before this retry:
- 1fb225e bugfix: mono cursor misalignment at poly-free-fn Var
with class-constrained Forall.
- feb9413 bugfix: print leak — propagate ret_mode through rigid
substitution + prelude Show.show ret_mode.
Known debt (carried forward for next /audit):
- Emitter.strings field is functionally dead post-iter (orphan
after intern_string removal); cycles over empty map harmlessly.
79 lines
2.7 KiB
Plaintext
79 lines
2.7 KiB
Plaintext
; Bench fixture (Bench iter): balanced-tree build + sum.
|
|
;
|
|
; Allocates a balanced binary tree of `Node value left right` cells,
|
|
; then walks it summing the value field. Distinct from
|
|
; `bench_list_sum` in two ways:
|
|
; 1. Each tree node has an additional pointer field versus a list
|
|
; cell — 32-byte alloc instead of 24-byte. The branching shape
|
|
; means the recursion structure is genuinely tree-shaped: the
|
|
; build cannot be made tail-recursive without explicit
|
|
; continuation passing, so this fixture is constrained to depths
|
|
; where the recursion stack fits.
|
|
; 2. The traversal pattern hits two children per node, exercising
|
|
; the GC's mark-phase pointer-chasing heuristics differently from
|
|
; a plain linked-list walk.
|
|
;
|
|
; Depth picked: 20 -> 2^20 - 1 = 1_048_575 nodes -> 32 MB heap usage.
|
|
; Recursion depth in `build_tree` and `sum_tree` matches `depth`,
|
|
; which fits comfortably in the default 8 MB system stack.
|
|
;
|
|
; Hardcoded multi-call form: build/sum the same tree thrice for
|
|
; signal averaging. The depths are different per call so the GC has
|
|
; to deal with three independent live-set sizes.
|
|
;
|
|
; Expected stdout (one int per line):
|
|
; depth 16: 2^16 - 1 = 65535 nodes, sum = 65535
|
|
; depth 18: 2^18 - 1 = 262143 nodes, sum = 262143
|
|
; depth 20: 2^20 - 1 = 1048575 nodes, sum = 1048575
|
|
;
|
|
; (Each node stores literal `1`; sum is therefore node count.)
|
|
|
|
(module bench_tree_walk
|
|
|
|
(data Tree
|
|
(ctor Leaf)
|
|
(ctor Node (con Int) (con Tree) (con Tree)))
|
|
|
|
(fn build_tree
|
|
(doc "Balanced binary tree of given depth, every value = 1.")
|
|
(type
|
|
(fn-type
|
|
(params (con Int))
|
|
(ret (con Tree))))
|
|
(params depth)
|
|
(body
|
|
(if (app == depth 0)
|
|
(term-ctor Tree Leaf)
|
|
(term-ctor Tree Node
|
|
1
|
|
(app build_tree (app - depth 1))
|
|
(app build_tree (app - depth 1))))))
|
|
|
|
(fn sum_tree
|
|
(doc "Sum every Node value via match recursion. Constructor-blocked: not tail-recursive, but recursion depth = tree depth so fits.")
|
|
(type
|
|
(fn-type
|
|
(params (con Tree))
|
|
(ret (con Int))))
|
|
(params t)
|
|
(body
|
|
(match t
|
|
(case (pat-ctor Leaf) 0)
|
|
(case (pat-ctor Node v l r)
|
|
(app + v (app + (app sum_tree l) (app sum_tree r)))))))
|
|
|
|
(fn run_one
|
|
(doc "Build a tree of given depth, sum it, print the sum.")
|
|
(type (fn-type (params (con Int)) (ret (con Unit)) (effects IO)))
|
|
(params depth)
|
|
(body
|
|
(app print (app sum_tree (app build_tree depth)))))
|
|
|
|
(fn main
|
|
(type (fn-type (params) (ret (con Unit)) (effects IO)))
|
|
(params)
|
|
(body
|
|
(seq (app run_one 16)
|
|
(seq (app run_one 18)
|
|
(app run_one 20))))))
|