A large module of `n` public functions, compiled to a .slang-module. Stresses IR/AST serialization (writeSerializedModule*) — the write side of the cost whose read side (readSerializedModule*) the `minimal` floor test and module loading exercise. Scaling null: n scales function count; ideal serialization cost is O(n).
bucket: ir_infra · mode: module · flags: (none)
compileInner split into phase buckets (named leaves + (self) residuals) stacked across the sweep sizes — the top edge is compileInner, so you can see which phase drives the scaling.
floor-subtracted power-law fit (t − floor) = a·Nk; floor = the minimal workload (fixed per-compile cost), k the global exponent, top-2× the local high-end doubling ratio.
| N range | floor (ms) | k (work) | fit R² | t(Nmin) | t(Nmax) | top-2× |
|---|---|---|---|---|---|---|
| 375–3000 | 14 | 1.22 | 0.997 | 43 | 394 | 2.52× |
compileInner grows by 351 ms across the sweep; the mutually-exclusive phase buckets below partition that growth exactly (no nested-timer double counting). × lin is the same metric as the top-level panels, per bucket: the end point vs a linear expectation anchored to the bucket's share of the minimal floor and fitted on the low-N half — 1.0 = grew exactly linearly, >1 bends up. The super-linearity lives where × lin (and k) are red.
| bucket | t@N=375 | t@N=3000 | Δ ms | share | × lin | ∝Nk |
|---|---|---|---|---|---|---|
| generateIR | 12 | 197 | +185 | 53% | 2.20× | 1.38 |
| SemanticChecking | 24 | 145 | +121 | 35% | 0.97× | 0.99 |
| generateOutput (self) | 5 | 34 | +29 | 8% | 1.20× | 1.17 |
| parseTranslationUnit | 2 | 15 | +13 | 4% | 1.10× | 1.03 |
Near-constant (≤2% of growth each): compileInner (self) (0→3 ms), frontEndExecute (self) (0→0 ms).
| N | compileInner | writeSerializedModuleAST |
|---|---|---|
| 375 | 43 | 2 |
| 750 | 79 | 4 |
| 1500 | 156 | 9 |
| 3000 | 394 | 19 |