import qualified GraphColor as Color
import RegLiveness
import RegSpill
+import RegSpillClean
import RegAllocStats
import MachRegs
import MachInstrs
-- | The top level of the graph coloring register allocator.
--
regAlloc
- :: UniqFM (UniqSet Reg) -- ^ the registers we can use for allocation
+ :: Bool -- ^ whether to generate RegAllocStats, or not.
+ -> UniqFM (UniqSet Reg) -- ^ the registers we can use for allocation
-> UniqSet Int -- ^ the set of available spill slots.
-> [LiveCmmTop] -- ^ code annotated with liveness information.
-> UniqSM
( [NatCmmTop] -- ^ code with registers allocated.
, [RegAllocStats] ) -- ^ stats for each stage of allocation
-regAlloc regsFree slotsFree code
+regAlloc dump regsFree slotsFree code
= do
(code_final, debug_codeGraphs, graph_final)
- <- regAlloc_spin 0 trivColorable regsFree slotsFree [] code
+ <- regAlloc_spin dump 0 trivColorable regsFree slotsFree [] code
return ( code_final
, reverse debug_codeGraphs )
-regAlloc_spin (spinCount :: Int) triv regsFree slotsFree debug_codeGraphs code
+regAlloc_spin dump (spinCount :: Int) triv regsFree slotsFree debug_codeGraphs code
= do
-- check that we're not running off down the garden path.
when (spinCount > maxSpinCount)
then do
-- patch the registers using the info in the graph
let code_patched = map (patchRegsFromGraph graph_colored) code
+
+ -- clean out unneeded SPILL/RELOADs
+ let code_spillclean = map cleanSpills code_patched
+
+ -- strip off liveness information
let code_nat = map stripLive code_patched
+
+ -- rewrite SPILL/REALOAD pseudos into real instructions
+ let spillNatTop = mapGenBlockTop spillNatBlock
+ let code_final = map spillNatTop code_nat
-- record what happened in this stage for debugging
let stat =
RegAllocStatsColored
{ raGraph = graph_colored
- , raPatchedCmm = code_patched }
-
- return ( code_nat
- , maybeToList stat1 ++ [stat] ++ debug_codeGraphs
+ , raPatched = code_patched
+ , raSpillClean = code_spillclean
+ , raFinal = code_final }
+
+ return ( code_final
+ , if dump
+ then [stat] ++ maybeToList stat1 ++ debug_codeGraphs
+ else []
, graph_colored)
else do
, raSpilled = code_spilled }
-- try again
- regAlloc_spin (spinCount + 1) triv regsFree slotsFree'
- (maybeToList stat1 ++ [stat] ++ debug_codeGraphs)
+ regAlloc_spin dump (spinCount + 1) triv regsFree slotsFree'
+ (if dump
+ then [stat] ++ maybeToList stat1 ++ debug_codeGraphs
+ else [])
code_relive