ghc-6.12.2: The GHC API Source code Contents Index

SimplMonad

Synopsis

data SimplM result initSmpl :: DynFlags -> RuleBase -> (FamInstEnv, FamInstEnv) -> UniqSupply -> SimplM a -> (a, SimplCount) getDOptsSmpl :: SimplM DynFlags getSimplRules :: SimplM RuleBase getFamEnvs :: SimplM (FamInstEnv, FamInstEnv) class Monad m => MonadUnique m where getUniqueSupplyM :: m UniqSupply getUniqueM :: m Unique getUniquesM :: m [Unique] newId :: FastString -> Type -> SimplM Id data SimplCount data Tick = PreInlineUnconditionally Id | PostInlineUnconditionally Id | UnfoldingDone Id | RuleFired FastString | LetFloatFromLet | EtaExpansion Id | EtaReduction Id | BetaReduction Id | CaseOfCase Id | KnownBranch Id | CaseMerge Id | AltMerge Id | CaseElim Id | CaseIdentity Id | FillInCaseDefault Id | BottomFound | SimplifierDone tick :: Tick -> SimplM () freeTick :: Tick -> SimplM () getSimplCount :: SimplM SimplCount zeroSimplCount :: DynFlags -> SimplCount pprSimplCount :: SimplCount -> SDoc plusSimplCount :: SimplCount -> SimplCount -> SimplCount isZeroSimplCount :: SimplCount -> Bool type SwitchChecker = SimplifierSwitch -> SwitchResult data SwitchResult = SwBool Bool | SwString FastString | SwInt Int getSimplIntSwitch :: SwitchChecker -> (Int -> SimplifierSwitch) -> Int isAmongSimpl :: [SimplifierSwitch] -> SimplifierSwitch -> SwitchResult intSwitchSet :: (switch -> SwitchResult) -> (Int -> switch) -> Maybe Int switchIsOn :: (switch -> SwitchResult) -> switch -> Bool

Documentation

data SimplM result Source

Instances Monad SimplM MonadUnique SimplM

initSmpl :: DynFlags -> RuleBase -> (FamInstEnv, FamInstEnv) -> UniqSupply -> SimplM a -> (a, SimplCount) Source

getDOptsSmpl :: SimplM DynFlags Source

getSimplRules :: SimplM RuleBase Source

getFamEnvs :: SimplM (FamInstEnv, FamInstEnv) Source

class Monad m => MonadUnique m where Source

A monad for generating unique identifiers Methods getUniqueSupplyM :: m UniqSupply Source Get a new UniqueSupply getUniqueM :: m Unique Source Get a new unique identifier getUniquesM :: m [Unique] Source Get an infinite list of new unique identifiers Instances MonadUnique UniqSM MonadUnique FuelMonad MonadUnique SimplM MonadUnique CoreM MonadUnique (IOEnv (Env gbl lcl)) MonadUnique (DFM' FuelMonad f)

newId :: FastString -> Type -> SimplM Id Source

data SimplCount Source

data Tick Source

Constructors PreInlineUnconditionally Id PostInlineUnconditionally Id UnfoldingDone Id RuleFired FastString LetFloatFromLet EtaExpansion Id EtaReduction Id BetaReduction Id CaseOfCase Id KnownBranch Id CaseMerge Id AltMerge Id CaseElim Id CaseIdentity Id FillInCaseDefault Id BottomFound SimplifierDone Instances Eq Tick Ord Tick Outputable Tick

tick :: Tick -> SimplM () Source

freeTick :: Tick -> SimplM () Source

getSimplCount :: SimplM SimplCount Source

zeroSimplCount :: DynFlags -> SimplCount Source

pprSimplCount :: SimplCount -> SDoc Source

plusSimplCount :: SimplCount -> SimplCount -> SimplCount Source

isZeroSimplCount :: SimplCount -> Bool Source

type SwitchChecker = SimplifierSwitch -> SwitchResult Source

data SwitchResult Source

Constructors SwBool Bool SwString FastString SwInt Int

getSimplIntSwitch :: SwitchChecker -> (Int -> SimplifierSwitch) -> Int Source

isAmongSimpl :: [SimplifierSwitch] -> SimplifierSwitch -> SwitchResult Source

intSwitchSet :: (switch -> SwitchResult) -> (Int -> switch) -> Maybe Int Source

switchIsOn :: (switch -> SwitchResult) -> switch -> Bool Source

Produced by Haddock version 2.6.1