X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=compiler%2FnativeGen%2FRegAllocColor.hs;h=2e3d40e427653dd46ba5640d0f46288930c0cf73;hb=272f0ba89eca1d9fc700cf4c27b9f8c3e23d6fe8;hp=c49a94dc8fa0ec5f311a16df9020b27793d03933;hpb=589238c4c2712d29092086926cc48eeb5e9b8fa7;p=ghc-hetmet.git diff --git a/compiler/nativeGen/RegAllocColor.hs b/compiler/nativeGen/RegAllocColor.hs index c49a94d..2e3d40e 100644 --- a/compiler/nativeGen/RegAllocColor.hs +++ b/compiler/nativeGen/RegAllocColor.hs @@ -12,13 +12,7 @@ -- -- Colors in graphviz graphs could be nicer. -- - -{-# OPTIONS_GHC -w #-} --- The above warning supression flag is a temporary kludge. --- While working on this module you are encouraged to remove it and fix --- any warnings in the module. See --- http://hackage.haskell.org/trac/ghc/wiki/WorkingConventions#Warnings --- for details +{-# OPTIONS -fno-warn-missing-signatures #-} module RegAllocColor ( regAlloc, @@ -67,7 +61,7 @@ regAlloc regAlloc dump regsFree slotsFree code = do - (code_final, debug_codeGraphs, graph_final) + (code_final, debug_codeGraphs, _) <- regAlloc_spin dump 0 trivColorable regsFree slotsFree [] code return ( code_final @@ -89,7 +83,7 @@ regAlloc_spin dump (spinCount :: Int) triv regsFree slotsFree debug_codeGraphs c -- build a map of how many instructions each reg lives for. -- this is lazy, it won't be computed unless we need to spill - let fmLife = plusUFMs_C (\(r1, l1) (r2, l2) -> (r1, l1 + l2)) + let fmLife = plusUFMs_C (\(r1, l1) (_, l2) -> (r1, l1 + l2)) $ map lifetimeCount code -- record startup state @@ -106,14 +100,22 @@ regAlloc_spin dump (spinCount :: Int) triv regsFree slotsFree debug_codeGraphs c let spill = chooseSpill_maxLife fmLife -- try and color the graph - let (graph_colored, rsSpill) + let (graph_colored, rsSpill, rmCoalesce) = Color.colorGraph regsFree triv spill graph + -- rewrite regs in the code that have been coalesced + let patchF reg = case lookupUFM rmCoalesce reg of + Just reg' -> reg' + Nothing -> reg + let code_coalesced + = map (patchEraseLive patchF) code + + -- see if we've found a coloring if isEmptyUniqSet rsSpill then do -- patch the registers using the info in the graph - let code_patched = map (patchRegsFromGraph graph_colored) code + let code_patched = map (patchRegsFromGraph graph_colored) code_coalesced -- clean out unneeded SPILL/RELOADs let code_spillclean = map cleanSpills code_patched @@ -129,6 +131,7 @@ regAlloc_spin dump (spinCount :: Int) triv regsFree slotsFree debug_codeGraphs c let stat = RegAllocStatsColored { raGraph = graph_colored + , raCoalesced = rmCoalesce , raPatched = code_patched , raSpillClean = code_spillclean , raFinal = code_final @@ -143,7 +146,7 @@ regAlloc_spin dump (spinCount :: Int) triv regsFree slotsFree debug_codeGraphs c else do -- spill the uncolored regs (code_spilled, slotsFree', spillStats) - <- regSpill code slotsFree rsSpill + <- regSpill code_coalesced slotsFree rsSpill -- recalculate liveness let code_nat = map stripLive code_spilled @@ -153,6 +156,7 @@ regAlloc_spin dump (spinCount :: Int) triv regsFree slotsFree debug_codeGraphs c let stat = RegAllocStatsSpill { raGraph = graph_colored + , raCoalesced = rmCoalesce , raSpillStats = spillStats , raLifetimes = fmLife , raSpilled = code_spilled } @@ -260,10 +264,10 @@ graphAddCoalesce -> Color.Graph Reg RegClass Reg graphAddCoalesce (r1, r2) graph - | RealReg regno <- r1 + | RealReg _ <- r1 = Color.addPreference (regWithClass r2) r1 graph - | RealReg regno <- r2 + | RealReg _ <- r2 = Color.addPreference (regWithClass r1) r2 graph | otherwise @@ -296,7 +300,7 @@ patchRegsFromGraph graph code = pprPanic "patchRegsFromGraph: register mapping failed." ( text "There is no node in the graph for register " <> ppr reg $$ ppr code - $$ Color.dotGraph (\x -> text "white") trivColorable graph) + $$ Color.dotGraph (\_ -> text "white") trivColorable graph) in patchEraseLive patchF code