Large but semantically trivial source: many functions, each a long arithmetic expression. Stresses lex/parse with cheap sema. Scaling null: n scales statement count; ideal parse cost is O(n).
bucket: parse · 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× |
|---|---|---|---|---|---|---|
| 250–2000 | 14 | 1.17 | 0.999 | 44 | 362 | 2.07× |
compileInner grows by 318 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=250 | t@N=2000 | Δ ms | share | × lin | ∝Nk |
|---|---|---|---|---|---|---|
| generateIR | 17 | 148 | +131 | 41% | 1.12× | 1.07 |
| SemanticChecking | 16 | 122 | +106 | 33% | 1.24× | 1.20 |
| generateOutput (self) | 7 | 58 | +51 | 16% | 1.21× | 1.14 |
| parseTranslationUnit | 4 | 33 | +29 | 9% | 1.06× | 1.05 |
Near-constant (≤2% of growth each): compileInner (self) (0→2 ms), frontEndExecute (self) (0→0 ms).
| N | compileInner | parseTranslationUnit | frontEndExecute |
|---|---|---|---|
| 250 | 44 | 4 | 37 |
| 500 | 87 | 8 | 73 |
| 1000 | 175 | 17 | 148 |
| 2000 | 362 | 33 | 303 |