← all workloads

emit_cuda

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 cuda

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_cuda — phase composition vs N (v2026.13, median ms) emit_cuda 37.3× over N 100→800 0.0 1521 3043 100 200 400 800 N emit_cuda — parseTranslationUnit emit_cuda — SemanticChecking emit_cuda — generateIR emit_cuda — frontEndExecute (self) emit_cuda — specializeModule emit_cuda — simplifyIR emit_cuda — linkIR emit_cuda — unrollLoopsInModule emit_cuda — performMandatoryEarlyInlining emit_cuda — performForceInlining emit_cuda — linkAndOptimizeIR (self) emit_cuda — emitEntryPointsSourceFromIR emit_cuda — 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–800101.800.9927628174.52×

Growth attribution (N=100 → N=800)

compileInner grows by 2742 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
emitEntryPointsSourceFromIR281373+134549%4.50×1.87
linkAndOptimizeIR (self)9771+76228%6.13×2.15
simplifyIR9432+42315%4.21×1.86
specializeModule5115+1094%2.39×1.47

Near-constant (≤2% of growth each): SemanticChecking (15→67 ms), generateIR (7→52 ms), linkIR (1→3 ms), parseTranslationUnit (0→2 ms), performMandatoryEarlyInlining (0→1 ms), performForceInlining (0→1 ms), frontEndExecute (self) (0→0 ms), compileInner (self) (0→0 ms), unrollLoopsInModule (0→0 ms).

Sweep numbers (median ms)

NcompileInneremitEntryPointsSourceFromIRgenerateOutput
100765253
200194158158
400623571572
800281726952696