X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=compiler%2FnativeGen%2FRegAllocColor.hs;h=d5ec7af8ebd84d90e780fa46f84fd91e7d9ece94;hb=b09ab92b65983635c68c8944631b1d53e9b71e42;hp=92efc4a1d324e08e7219c6b7f8eb6c4c7d6dc6a7;hpb=0168c633a9d209e978528f059193d19cdb5e6740;p=ghc-hetmet.git diff --git a/compiler/nativeGen/RegAllocColor.hs b/compiler/nativeGen/RegAllocColor.hs index 92efc4a..d5ec7af 100644 --- a/compiler/nativeGen/RegAllocColor.hs +++ b/compiler/nativeGen/RegAllocColor.hs @@ -23,6 +23,7 @@ where import qualified GraphColor as Color import RegLiveness import RegSpill +import RegSpillClean import RegAllocStats import MachRegs import MachInstrs @@ -50,22 +51,23 @@ maxSpinCount = 10 -- | 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) @@ -105,21 +107,31 @@ regAlloc_spin (spinCount :: Int) triv regsFree slotsFree debug_codeGraphs code if isEmptyUniqSet rsSpill then do -- patch the registers using the info in the graph - -- also rewrite SPILL/REALOAD pseudos into real instructions let code_patched = map (patchRegsFromGraph graph_colored) code - let spillNatTop = mapGenBlockTop spillNatBlock - let code_nat = map (spillNatTop . stripLive) code_patched + -- 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 - , [stat] ++ maybeToList stat1 ++ debug_codeGraphs + , raPatched = code_patched + , raSpillClean = code_spillclean + , raFinal = code_final + , raSRMs = foldl addSRM (0, 0, 0) $ map countSRMs code_spillclean } + + return ( code_final + , if dump + then [stat] ++ maybeToList stat1 ++ debug_codeGraphs + else [] , graph_colored) else do @@ -140,8 +152,10 @@ regAlloc_spin (spinCount :: Int) triv regsFree slotsFree debug_codeGraphs code , raSpilled = code_spilled } -- try again - regAlloc_spin (spinCount + 1) triv regsFree slotsFree' - ([stat] ++ maybeToList stat1 ++ debug_codeGraphs) + regAlloc_spin dump (spinCount + 1) triv regsFree slotsFree' + (if dump + then [stat] ++ maybeToList stat1 ++ debug_codeGraphs + else []) code_relive