Files
AILang/examples/bench_hof_pipeline.ailx
T
Brummel 07bff24527 bench: 21'b — closure-pair + HOF/poly fixtures, 47-metric baseline
Two new throughput fixtures targeting blind spots in the 21'a
corpus:

- bench_closure_chain exercises the build_pair_drop_fn codegen
  path (the 18c.4 doubled-braces trigger). Each iteration of
  run_loop allocates a {thunk, env} closure pair via the
  let-rec-name-as-value escape route. Sizes 10k / 100k / 500k.
  rc/bump = 4.14x — materially worse than the 2.91x / 2.59x of
  the linear/tree fixtures, exposing that closure work pays the
  RC alloc tax twice (pair + env-struct).

- bench_hof_pipeline exercises poly-ADT instantiation and
  indirect dispatch via fold_with_fn over List<a>. Sizes 100k /
  1M / 3M elements. Ratios essentially match bench_list_sum,
  confirming the 13b static-template-plus-ctor-inline design
  has zero measurable overhead at this scale.

Baseline file extends from 31 to 47 metrics. The two new fixtures
build clean under all three allocators; the rc-arm build exercises
the per-type drop fn for the closure-pair, providing a tripwire
for any future 18c.4-class IR malformedness.

JOURNAL records both surprises (4.14x closure tax, ~zero HOF/poly
overhead) and explicitly notes the dispersion observation on
explicit_at_rc.p99 — three captures today (357.5 / 294.6 / 251.5)
confirm wide run-to-run variance on that fixture. Methodology
upgrade (n>=10 captures or tighter fixture) deferred to 21'c.

bench/run.sh fixtures array updated. bench/check.py needed no
changes — its parser handles the wider table by metric name.
2026-05-09 00:55:57 +02:00

88 lines
2.9 KiB
Plaintext

; Bench fixture: HOF + polymorphic ADT pipeline.
;
; Builds a polymorphic List<Int> of length n, then folds it with a
; higher-order function `inc` to compute the sum of incremented
; elements. Distinct from bench_list_sum:
; 1. Uses `(data List (vars a) ...)` — polymorphic ADT, exercises
; the 13b/14a polymorphism-at-runtime path. The Cons cell
; layout is the same width as bench_list_sum's IntList ICons,
; but the type-arg substitution is the additional code path.
; 2. The traversal is via `fold_with_fn` — an HOF taking
; `(fn-type (params a) (ret (con Int)))` as its first param.
; Each step calls `(app f h)` — an indirect call through the
; fn-arg. This is the only fixture that exercises tight-loop
; indirect dispatch.
;
; Build phase is alloc-heavy (n Cons cells); fold phase is
; dispatch-heavy (n indirect calls). Per-iteration cost should be
; visibly higher than bench_list_sum's direct sum.
;
; Result for size n (using inc(x) = x+1):
; sum (inc 0) + (inc 1) + ... + (inc (n-1)) = sum 1..n = n*(n+1)/2
;
; Sizes:
; 100_000 -> 5_000_050_000
; 1_000_000 -> 500_000_500_000
; 3_000_000 -> 4_500_001_500_000
(module bench_hof_pipeline
(data List (vars a)
(doc "Polymorphic singly-linked list. Same shape as list_map_poly's List, replicated here so the bench fixture is self-contained.")
(ctor Nil)
(ctor Cons a (con List a)))
(fn build_n
(doc "Build [0, 1, ..., n-1] :: List Int. Tail-recursive accumulator form.")
(type
(fn-type
(params (con Int) (con List (con Int)))
(ret (con List (con Int)))))
(params n acc)
(body
(if (app == n 0)
acc
(tail-app build_n
(app - n 1)
(term-ctor List Cons (app - n 1) acc)))))
(fn inc
(doc "Add 1 to an Int. Used as the HOF argument to fold_with_fn.")
(type (fn-type (params (con Int)) (ret (con Int))))
(params x)
(body (app + x 1)))
(fn fold_with_fn
(doc "Polymorphic foldl-with-mapping. Apply f:(a)->Int to every element of xs, sum into acc. Tail-recursive on (xs, acc); the f arg is forwarded unchanged.")
(type
(forall (vars a)
(fn-type
(params (fn-type (params a) (ret (con Int)))
(con List a)
(con Int))
(ret (con Int)))))
(params f xs acc)
(body
(match xs
(case (pat-ctor Nil) acc)
(case (pat-ctor Cons h t)
(tail-app fold_with_fn f t (app + acc (app f h)))))))
(fn run_one
(doc "Build [0..n-1], fold with inc, print sum of (inc x).")
(type (fn-type (params (con Int)) (ret (con Unit)) (effects IO)))
(params n)
(body
(do io/print_int
(app fold_with_fn inc
(app build_n n (term-ctor List Nil))
0))))
(fn main
(type (fn-type (params) (ret (con Unit)) (effects IO)))
(params)
(body
(seq (app run_one 100000)
(seq (app run_one 1000000)
(app run_one 3000000))))))