diff options
| author | Kavon Farvardin <kavon@farvard.in> | 2018-09-23 15:29:37 -0500 |
|---|---|---|
| committer | Kavon Farvardin <kavon@farvard.in> | 2018-09-23 15:29:37 -0500 |
| commit | 84c2ad99582391005b5e873198b15e9e9eb4f78d (patch) | |
| tree | caa8c2f2ec7e97fbb4977263c6817c9af5025cf4 /compiler/utils/GraphColor.hs | |
| parent | 8ddb47cfcf5776e9a3c55fd37947c8a95e00fa12 (diff) | |
| parent | e68b439fe5de61b9a2ca51af472185c62ccb8b46 (diff) | |
| download | haskell-wip/T13904.tar.gz | |
update to current master againwip/T13904
Diffstat (limited to 'compiler/utils/GraphColor.hs')
| -rw-r--r-- | compiler/utils/GraphColor.hs | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/compiler/utils/GraphColor.hs b/compiler/utils/GraphColor.hs index be7975b306..4c1388e91d 100644 --- a/compiler/utils/GraphColor.hs +++ b/compiler/utils/GraphColor.hs @@ -12,6 +12,8 @@ module GraphColor ( where +import GhcPrelude + import GraphBase import GraphOps import GraphPpr @@ -114,7 +116,7 @@ colorGraph iterative spinCount colors triv spill graph0 -- | Scan through the conflict graph separating out trivially colorable and -- potentially uncolorable (problem) nodes. -- --- Checking whether a node is trivially colorable or not is a resonably expensive operation, +-- Checking whether a node is trivially colorable or not is a reasonably expensive operation, -- so after a triv node is found and removed from the graph it's no good to return to the 'start' -- of the graph and recheck a bunch of nodes that will probably still be non-trivially colorable. -- @@ -191,7 +193,7 @@ colorScan_spin iterative triv spill graph -- we were able to coalesce something -- go back to Simplify and see if this frees up more nodes to be trivially colorable. - (graph2, kksCoalesceFound @(_:_)) + (graph2, kksCoalesceFound@(_:_)) -> colorScan_spin iterative triv spill graph2 ksTriv ksSpill (reverse kksCoalesceFound ++ kksCoalesce) |