← all workloads

loop_unroll

A force-unrolled loop of `n` iterations. Stresses loop unrolling (unrollLoopsInModule) and the downstream SSA simplify on the unrolled body. Scaling null: the unrolled output is O(n), so ideal cost is linear in n (linear in output size).

bucket: loop_unroll  ·  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.

loop_unroll — phase composition vs N (v2026.12, median ms) loop_unroll 35.4× over N 75→600 0.0 1047 2094 75 150 300 600 N loop_unroll — parseTranslationUnit loop_unroll — SemanticChecking loop_unroll — generateIR loop_unroll — frontEndExecute (self) loop_unroll — specializeModule loop_unroll — simplifyIR loop_unroll — linkIR loop_unroll — unrollLoopsInModule loop_unroll — legalizeResourceTypes loop_unroll — legalizeExistentialTypeLayout loop_unroll — performMandatoryEarlyInlining loop_unroll — performForceInlining loop_unroll — generateOutput (self) loop_unroll — 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×
75–600141.850.9945519394.37×

Growth attribution (N=75 → N=600)

compileInner grows by 1884 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=75t@N=600Δ msshare× lin∝Nk
specializeModule11525+51427%4.51×1.91
unrollLoopsInModule7473+46525%4.96×1.99
generateOutput (self)7257+25013%4.69×1.90
simplifyIR8236+22812%3.23×1.69
legalizeExistentialTypeLayout3218+21411%5.27×2.01

Also growing (below top-5): legalizeResourceTypes (+212 ms, 11%).

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

Sweep numbers (median ms)

NcompileInnerunrollLoopsInModulesimplifyIR
755588
1501313224
30044312180
6001939601300