Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- data CostCentre
- type CcName = FastString
- data CCFlavour
- pprCostCentre :: IsLine doc => CostCentre -> doc
- data CostCentreStack
- pprCostCentreStack :: IsLine doc => CostCentreStack -> doc
- type CollectedCCs = ([CostCentre], [CostCentreStack])
- emptyCollectedCCs :: CollectedCCs
- collectCC :: CostCentre -> CostCentreStack -> CollectedCCs -> CollectedCCs
- currentCCS :: CostCentreStack
- dontCareCCS :: CostCentreStack
- isCurrentCCS :: CostCentreStack -> Bool
- maybeSingletonCCS :: CostCentreStack -> Maybe CostCentre
- mkUserCC :: FastString -> Module -> SrcSpan -> CCFlavour -> CostCentre
- mkAutoCC :: Id -> Module -> CostCentre
- mkAllCafsCC :: Module -> SrcSpan -> CostCentre
- mkSingletonCCS :: CostCentre -> CostCentreStack
- isCafCCS :: CostCentreStack -> Bool
- isCafCC :: CostCentre -> Bool
- isSccCountCC :: CostCentre -> Bool
- sccAbleCC :: CostCentre -> Bool
- ccFromThisModule :: CostCentre -> Module -> Bool
- pprCostCentreCore :: CostCentre -> SDoc
- costCentreUserName :: CostCentre -> String
- costCentreUserNameFS :: CostCentre -> FastString
- costCentreSrcSpan :: CostCentre -> SrcSpan
- cmpCostCentre :: CostCentre -> CostCentre -> Ordering
Documentation
data CostCentre Source #
A Cost Centre is a single {-# SCC #-}
annotation.
NormalCC | |
| |
AllCafsCC | |
Instances
type CcName = FastString Source #
The flavour of a cost centre.
Index fields represent 0-based indices giving source-code ordering of centres with the same module, name, and flavour.
CafCC | Auto-generated top-level thunk |
ExprCC !CostCentreIndex | Explicitly annotated expression |
DeclCC !CostCentreIndex | Explicitly annotated declaration |
HpcCC !CostCentreIndex | Generated by HPC for coverage |
LateCC !CostCentreIndex | Annotated by the one of the prof-last* passes. |
Instances
Data CCFlavour Source # | |
Defined in GHC.Types.CostCentre gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CCFlavour -> c CCFlavour Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CCFlavour Source # toConstr :: CCFlavour -> Constr Source # dataTypeOf :: CCFlavour -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CCFlavour) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CCFlavour) Source # gmapT :: (forall b. Data b => b -> b) -> CCFlavour -> CCFlavour Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CCFlavour -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CCFlavour -> r Source # gmapQ :: (forall d. Data d => d -> u) -> CCFlavour -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> CCFlavour -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> CCFlavour -> m CCFlavour Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CCFlavour -> m CCFlavour Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CCFlavour -> m CCFlavour Source # | |
Binary CCFlavour Source # | |
Eq CCFlavour Source # | |
Ord CCFlavour Source # | |
Defined in GHC.Types.CostCentre |
pprCostCentre :: IsLine doc => CostCentre -> doc Source #
data CostCentreStack Source #
A Cost Centre Stack is something that can be attached to a closure. This is either:
- the current cost centre stack (CCCS)
- a pre-defined cost centre stack (there are several pre-defined CCSs, see below).
Instances
Outputable CostCentreStack Source # | |
Defined in GHC.Types.CostCentre ppr :: CostCentreStack -> SDoc Source # | |
Eq CostCentreStack Source # | |
Defined in GHC.Types.CostCentre (==) :: CostCentreStack -> CostCentreStack -> Bool # (/=) :: CostCentreStack -> CostCentreStack -> Bool # | |
Ord CostCentreStack Source # | |
Defined in GHC.Types.CostCentre compare :: CostCentreStack -> CostCentreStack -> Ordering # (<) :: CostCentreStack -> CostCentreStack -> Bool # (<=) :: CostCentreStack -> CostCentreStack -> Bool # (>) :: CostCentreStack -> CostCentreStack -> Bool # (>=) :: CostCentreStack -> CostCentreStack -> Bool # max :: CostCentreStack -> CostCentreStack -> CostCentreStack # min :: CostCentreStack -> CostCentreStack -> CostCentreStack # |
pprCostCentreStack :: IsLine doc => CostCentreStack -> doc Source #
type CollectedCCs = ([CostCentre], [CostCentreStack]) Source #
collectCC :: CostCentre -> CostCentreStack -> CollectedCCs -> CollectedCCs Source #
isCurrentCCS :: CostCentreStack -> Bool Source #
mkUserCC :: FastString -> Module -> SrcSpan -> CCFlavour -> CostCentre Source #
mkAllCafsCC :: Module -> SrcSpan -> CostCentre Source #
isCafCCS :: CostCentreStack -> Bool Source #
isCafCC :: CostCentre -> Bool Source #
isSccCountCC :: CostCentre -> Bool Source #
Is this a cost-centre which records scc counts
sccAbleCC :: CostCentre -> Bool Source #
Is this a cost-centre which can be sccd ?
ccFromThisModule :: CostCentre -> Module -> Bool Source #
pprCostCentreCore :: CostCentre -> SDoc Source #
Print a flavour in Core
cmpCostCentre :: CostCentre -> CostCentre -> Ordering Source #