← all workloads

diagnostics_clean

N functions with distinct compile-time constants, no errors. Scaling null: n scales independent declarations; ideal cost is O(n).

bucket: diagnostics  ·  mode: target  ·  flags: -target spirv -emit-spirv-directly

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.

diagnostics_clean — phase composition vs N (v2026.5, median ms) diagnostics_clean 4.1× over N 400→3200 0.0 89 179 400 800 1600 3200 N diagnostics_clean — parseTranslationUnit diagnostics_clean — SemanticChecking diagnostics_clean — generateIR diagnostics_clean — frontEndExecute (self) diagnostics_clean — specializeModule diagnostics_clean — simplifyIR diagnostics_clean — linkIR diagnostics_clean — legalizeResourceTypes diagnostics_clean — legalizeExistentialTypeLayout diagnostics_clean — performMandatoryEarlyInlining diagnostics_clean — performForceInlining diagnostics_clean — linkAndOptimizeIR (self) diagnostics_clean — generateOutput (self) diagnostics_clean — 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×
400–320090.780.995401651.75×

Growth attribution (N=400 → N=3200)

compileInner grows by 125 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=400t@N=3200Δ msshare× lin∝Nk
SemanticChecking2587+6249%0.67×0.67
generateIR855+4737%0.93×0.93
parseTranslationUnit217+1512%1.13×1.06

Near-constant (≤2% of growth each): generateOutput (self) (2→3 ms), linkIR (1→2 ms), performMandatoryEarlyInlining (0→1 ms), compileInner (self) (0→0 ms), frontEndExecute (self) (1→0 ms), simplifyIR (0→0 ms), specializeModule (0→0 ms), legalizeExistentialTypeLayout (0→0 ms), legalizeResourceTypes (0→0 ms), performForceInlining (0→0 ms), linkAndOptimizeIR (self) (0→0 ms).

Sweep numbers (median ms)

NcompileInnerfrontEndExecuteSemanticChecking
400403625
800575333
1600948952
320016515987