Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in / Register
Toggle navigation
Menu
Open sidebar
Glasgow Haskell Compiler
GHC
Commits
d438785e
Commit
d438785e
authored
Sep 10, 2007
by
Ben.Lippmeier@anu.edu.au
Browse files
Make sure to coalesce all the nodes found during iterative scanning
parent
12d0b388
Changes
1
Hide whitespace changes
Inline
Side-by-side
compiler/nativeGen/GraphColor.hs
View file @
d438785e
...
...
@@ -67,8 +67,12 @@ colorGraph iterative colors triv spill graph0
-- If iterative coalescing is enabled, the scanner will coalesce the graph as does its business.
-- We need to apply all the coalescences found by the scanner to the original
-- graph before doing assignColors.
--
-- Because we've got the whole, non-pruned graph here we turn on aggressive coalecing
-- to force all the (conservative) coalescences found during scanning.
--
(
graph_scan_coalesced
,
_
)
=
mapAccumL
(
coalesceNodes
Fals
e
triv
)
graph_coalesced
kksCoalesce2
=
mapAccumL
(
coalesceNodes
Tru
e
triv
)
graph_coalesced
kksCoalesce2
-- color the trivially colorable nodes
-- during scanning, keys of triv nodes were added to the front of the list as they were found
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment