From: Ben.Lippmeier@anu.edu.au <unknown>
Date: Thu, 13 Sep 2007 16:14:43 +0000 (+0000)
Subject: warning police
X-Git-Tag: 2007-09-25~93
X-Git-Url: http://git.megacz.com/?p=ghc-hetmet.git;a=commitdiff_plain;h=d5938fb228511bfdce45e148ea4906129692e67f

warning police
---

diff --git a/compiler/nativeGen/RegAllocColor.hs b/compiler/nativeGen/RegAllocColor.hs
index 48e64bf..fc62157 100644
--- a/compiler/nativeGen/RegAllocColor.hs
+++ b/compiler/nativeGen/RegAllocColor.hs
@@ -126,7 +126,6 @@ regAlloc_spin dflags (spinCount :: Int) triv regsFree slotsFree debug_codeGraphs
 			= {-# SCC "ColorGraph" #-}
 			   Color.colorGraph
 			    	(dopt Opt_RegsIterative dflags)
-				spinCount
 			    	regsFree triv spill graph
 
 	-- rewrite regs in the code that have been coalesced
diff --git a/compiler/utils/GraphColor.hs b/compiler/utils/GraphColor.hs
index 10852d4..46bf384 100644
--- a/compiler/utils/GraphColor.hs
+++ b/compiler/utils/GraphColor.hs
@@ -39,7 +39,6 @@ colorGraph
 	   , Eq color, Eq cls, Ord k
 	   , Outputable k, Outputable cls, Outputable color)
 	=> Bool				-- ^ whether to do iterative coalescing
-	-> Int				-- ^ how many times coloring has been called so far
 	-> UniqFM (UniqSet color)	-- ^ map of (node class -> set of colors available for this class).
 	-> Triv   k cls color 		-- ^ fn to decide whether a node is trivially colorable.
 	-> (Graph k cls color -> k)	-- ^ fn to choose a node to potentially leave uncolored if nothing is trivially colorable.
@@ -50,7 +49,7 @@ colorGraph
 	   , UniqFM  k )		-- map of regs (r1 -> r2) that were coaleced
 	   				--	 r1 should be replaced by r2 in the source
 
-colorGraph iterative spinCount colors triv spill graph0
+colorGraph iterative colors triv spill graph0
  = let
 	-- If we're not doing iterative coalescing then just do a conservative
 	--	coalescing stage at the front.