← all workloads

emit_glsl

A single moderately complex shader. Compiled to multiple targets by the harness (same source, varying -target) to isolate generateOutput cost. ``n`` scales the amount of straight-line math the backend must emit. Scaling null: n scales op count and the emitted output is O(n); ideal codegen cost is O(n).

bucket: codegen_source  ·  mode: target  ·  flags: -target glsl -entry computeMain

Phase composition vs N (stacked sub-counters)

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.

emit_glsl — phase composition vs N (v2026.12, median ms) emit_glsl 39.0× over N 100→800 0.0 1809 3618 100 200 400 800 N emit_glsl — parseTranslationUnit emit_glsl — SemanticChecking emit_glsl — generateIR emit_glsl — frontEndExecute (self) emit_glsl — specializeModule emit_glsl — simplifyIR emit_glsl — linkIR emit_glsl — unrollLoopsInModule emit_glsl — legalizeResourceTypes emit_glsl — legalizeExistentialTypeLayout emit_glsl — performMandatoryEarlyInlining emit_glsl — performForceInlining emit_glsl — emitEntryPointsSourceFromIR emit_glsl — compileInner (self) phase buckets parseTranslationUnit SemanticChecking generateIR frontEndExecute (self) specializeModule simplifyIR linkIR unrollLoopsInModule legalizeResourceTypes legalizeExistentialTypeLayout performMandatoryEarlyInlining performForceInlining linkAndOptimizeIR (self) emitEntryPointsSourceFromIR generateOutput (self) compileInner (self)

Scaling analysis

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 rangefloor (ms)k (work)fit R²t(Nmin)t(Nmax)top-2×
100–800141.830.9928633504.72×

Growth attribution (N=100 → N=800)

compileInner grows by 3264 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.

buckett@N=100t@N=800Δ msshare× lin∝Nk
emitEntryPointsSourceFromIR321641+161049%4.70×1.89
legalizeExistentialTypeLayout10637+62719%5.66×2.03
legalizeResourceTypes8633+62519%5.46×2.09
simplifyIR7254+2478%3.90×1.75

Near-constant (≤2% of growth each): SemanticChecking (16→68 ms), specializeModule (4→63 ms), generateIR (6→50 ms), parseTranslationUnit (0→2 ms), linkIR (1→2 ms), frontEndExecute (self) (0→1 ms), performMandatoryEarlyInlining (0→0 ms), performForceInlining (0→0 ms), unrollLoopsInModule (0→0 ms), compileInner (self) (1→0 ms).

Sweep numbers (median ms)

NcompileInneremitEntryPointsSourceFromIRgenerateOutput
100866162
200222182182
400710658659
800335032353236