import RegClass

import Reg

import GraphBase

import UniqFM

import FastTypes

32% of total compile time and 42% of total alloc when compiling SHA1.lhs from darcs.

Therefore the UniqFM is made non-abstract and we use custom fold.

MS 2010/04

When converting UniqFM to use Data.IntMap, the fold cannot use UniqFM internal

the folding if the count gets greater or equal to maxCount. We thus convert

UniqFM to a (lazy) list, do the fold and stops if necessary, which was

import CoreSyn

import CoreFVs

import CoreUtils        ( exprIsTrivial, isDefaultAlt, isExpandableApp )

import Id

import Name( localiseName )

import BasicTypes

import VarSet

import VarEnv

import Var

import Demand           ( argOneShots, argsOneShots )

import Maybes           ( orElse )

import Digraph          ( SCC(..), stronglyConnCompFromEdgedVerticesR )

import Unique

import UniqFM

import qualified GraphColor as Color

import RegAlloc.Liveness

import RegAlloc.Graph.Spill

import RegAlloc.Graph.SpillCost

import RegAlloc.Graph.TrivColorable

import Instruction

import RegClass

import Reg

import Outputable

import UniqFM

import UniqSet

import State

import Data.List

import TcRnMonad

import IfaceEnv

import HscTypes

import BasicTypes

import Demand

import Annotations

import CoreSyn

import IfaceSyn

import Module

import Name

import VarEnv

import DynFlags

import UniqFM

import UniqSupply

import RegAlloc.Liveness

import Instruction

import Reg

import BlockId

import Cmm

import UniqSet

import UniqFM

import Unique

import State

import Outputable

import Data.List

import Data.Maybe

import Data.Map			(Map)

where

import RegAlloc.Liveness

import Instruction

import Reg

import Cmm	hiding (RegSet)

import BlockId

import State

import Unique

import UniqFM

import UniqSet

import UniqSupply

import Outputable

import Data.List

import Data.Maybe

import qualified GraphColor as Color

import RegAlloc.Liveness

import RegAlloc.Graph.Spill

import RegAlloc.Graph.SpillCost

import RegAlloc.Graph.TrivColorable

import Instruction

import RegClass

import Reg

import Outputable

import UniqFM

import UniqSet

import State

import Data.List

import Haddock.Types

import Haddock.Utils hiding (out)

import Data.List

import Data.Word

import Data.Array

import GHC hiding (NoLink)

import Binary

import Name

import UniqSupply

import UniqFM

import IfaceEnv

import HscTypes

#if MIN_VERSION_ghc(7,1,0)

import RegAlloc.Liveness

import Instruction

import Reg

import BlockId

import OldCmm

import UniqSet

import UniqFM

import Unique

import State

import Outputable

import Platform

import Data.List

import Data.Maybe

import qualified GraphColor as Color

import RegAlloc.Liveness

import RegAlloc.Graph.TrivColorable

import Instruction

import RegClass

import Reg

import TargetReg

import OldCmm

import OldPprCmm()

import Outputable

import UniqFM

import UniqSet

import State

import RegAlloc.Linear.State

import RegAlloc.Linear.Base

import RegAlloc.Linear.FreeRegs

import RegAlloc.Linear.Stats

import RegAlloc.Linear.JoinToTargets

import qualified RegAlloc.Linear.PPC.FreeRegs   as PPC

import qualified RegAlloc.Linear.SPARC.FreeRegs as SPARC

import qualified RegAlloc.Linear.X86.FreeRegs   as X86

import TargetReg

import RegAlloc.Liveness

import Instruction

import Reg

import BlockId

import OldCmm hiding (RegSet)

import Util		( lengthExceeds )

import UniqFM

import FastString

#else

import TrieMap

import CoreSubst

import Var		( Var )

import Id		( Id, idType, idInlineActivation, zapIdOccInfo )

import CoreUtils	( mkAltExpr

                        , exprIsTrivial, exprIsCheap )

import DataCon		( isUnboxedTupleCon )

import Type		( tyConAppArgs )

import CoreSyn

import Outputable

import InstEnv

import Unify

import Type

import TypeRep

import TyCon

import Coercion

import VarSet

import Name

import UniqFM

import Outputable

import Maybes

import Util

import FastString

\end{code}

        Instance(..), pprInstance, pprInstanceHdr, pprInstances, 

        instanceHead, mkLocalInstance, mkImportedInstance,

import Class

import Var

import VarSet

import Name

import Outputable

import ErrUtils

import BasicTypes

import UniqFM

import Id

import FastString

import Data.Data        ( Data, Typeable )

import LoadIface	( loadInterfaceForName, loadSrcInterface )

import IfaceEnv

import HsSyn

import RdrHsSyn		( extractHsTyRdrTyVars )

import RdrName

import HscTypes

import TcEnv		( tcLookupDataCon, tcLookupField, isBrackStage )

import TcRnMonad

import Id		( isRecordSelector )

import Name

import NameSet

import Module           ( ModuleName, moduleName )

import UniqFM

import DataCon		( dataConFieldLabels )

-- plugin for GHC. So authors of plugins can probably get away simply

-- with saying "import GhcPlugins".

        module VarSet, module VarEnv, module NameSet, module NameEnv, 

        module UniqSet, module UniqFM, module FiniteMap,

-- Plugin stuff itself

import CoreMonad

-- Variable naming

import RdrName

import OccName  hiding  ( varName {- conflicts with Var.varName -} )

import Name     hiding  ( varName {- reexport from OccName, conflicts with Var.varName -} )

import Var

import Id       hiding  ( lazySetIdInfo, setIdExported, setIdNotExported {- all three conflict with Var -} )

import IdInfo

-- Core

import CoreSyn

import Literal

import {-# SOURCE #-} Name (Name)

import FastString

import Panic

import UniqFM

import FastMutInt

import Fingerprint

import BasicTypes

import Foreign

import Data.Array

import Data.IORef

import Data.Char                ( ord, chr )

import Data.Typeable

#if __GLASGOW_HASKELL__ >= 701

import GraphBase

import GraphOps

import GraphPpr

import Unique

import UniqFM

import UniqSet

import Outputable

        -> Int                          -- ^ how many times we've tried to color this graph so far.

        -> UniqFM (UniqSet color)       -- ^ map of (node class -> set of colors available for this class).

           , UniqSet k                  -- the set of nodes that we couldn't find a color for.

           , UniqFM  k )                -- map of regs (r1 -> r2) that were coaleced

           , Outputable cls)

        => UniqFM (UniqSet color)       -- ^ map of (node class -> set of colors available for this class).

import GraphBase

import GraphOps

import GraphPpr

import Unique

import UniqFM

import UniqSet

	-> Int				-- ^ how many times we've tried to color this graph so far.

	-> UniqFM (UniqSet color)	-- ^ map of (node class -> set of colors available for this class).

	   , UniqSet k			-- the set of nodes that we couldn't find a color for.

	   , UniqFM  k )		-- map of regs (r1 -> r2) that were coaleced

	   , Eq color, Outputable cls)

	=> UniqFM (UniqSet color)	-- ^ map of (node class -> set of colors available for this class).

	   , Eq color, Outputable cls)

	=> UniqFM (UniqSet color)	-- ^ map of (node class -> set of colors available for this class).

import GraphBase

import GraphOps

import GraphPpr

import Unique

import UniqFM

import UniqSet

import Data.Maybe

import Data.List

	-> Int				-- ^ how many times we've tried to color this graph so far.

	-> UniqFM (UniqSet color)	-- ^ map of (node class -> set of colors available for this class).

	   , Eq color, Outputable cls)

	=> UniqFM (UniqSet color)	-- ^ map of (node class -> set of colors available for this class).

	   , Eq color, Outputable cls)

	=> UniqFM (UniqSet color)	-- ^ map of (node class -> set of colors available for this class).