Add iterative coalescing to graph coloring allocator

[ghc-hetmet.git] / compiler / nativeGen / GraphBase.hs

diff --git a/compiler/nativeGen/GraphBase.hs b/compiler/nativeGen/GraphBase.hs
index b980ba2..04eda96 100644 (file)
--- a/compiler/nativeGen/GraphBase.hs
+++ b/compiler/nativeGen/GraphBase.hs
@@ -16,6 +16,7 @@ where
 import UniqSet
 import UniqFM
 
+
 -- | A fn to check if a node is trivially colorable
 --     For graphs who's color classes are disjoint then a node is 'trivially colorable'
 --     when it has less neighbors and exclusions than available colors for that node.
@@ -45,6 +46,7 @@ data Graph k cls color
        -- | All active nodes in the graph.
          graphMap              :: UniqFM (Node k cls color)  }
 
+
 -- | An empty graph.   
 initGraph :: Graph k cls color
 initGraph
@@ -106,3 +108,4 @@ newNode k cls
 
 
 
+