Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data CostCentre
- type CcName = FastString
- data IsCafCC
- data CostCentreStack
- type CollectedCCs = ([CostCentre], [CostCentre], [CostCentreStack])
- noCCS :: CostCentreStack
- currentCCS :: CostCentreStack
- dontCareCCS :: CostCentreStack
- noCCSAttached :: CostCentreStack -> Bool
- isCurrentCCS :: CostCentreStack -> Bool
- maybeSingletonCCS :: CostCentreStack -> Maybe CostCentre
- mkUserCC :: FastString -> Module -> SrcSpan -> Unique -> CostCentre
- mkAutoCC :: Id -> Module -> IsCafCC -> 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 #
NormalCC | |
| |
AllCafsCC | |
Instances
type CcName = FastString Source #
Instances
Eq IsCafCC # | |
Data IsCafCC # | |
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IsCafCC -> c IsCafCC Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IsCafCC Source # toConstr :: IsCafCC -> Constr Source # dataTypeOf :: IsCafCC -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IsCafCC) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IsCafCC) Source # gmapT :: (forall b. Data b => b -> b) -> IsCafCC -> IsCafCC Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IsCafCC -> r Source # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IsCafCC -> r Source # gmapQ :: (forall d. Data d => d -> u) -> IsCafCC -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> IsCafCC -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> IsCafCC -> m IsCafCC Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IsCafCC -> m IsCafCC Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IsCafCC -> m IsCafCC Source # | |
Ord IsCafCC # | |
Binary IsCafCC # | |
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
Eq CostCentreStack # | |
(==) :: CostCentreStack -> CostCentreStack -> Bool # (/=) :: CostCentreStack -> CostCentreStack -> Bool # | |
Ord CostCentreStack # | |
compare :: CostCentreStack -> CostCentreStack -> Ordering # (<) :: CostCentreStack -> CostCentreStack -> Bool # (<=) :: CostCentreStack -> CostCentreStack -> Bool # (>) :: CostCentreStack -> CostCentreStack -> Bool # (>=) :: CostCentreStack -> CostCentreStack -> Bool # max :: CostCentreStack -> CostCentreStack -> CostCentreStack # min :: CostCentreStack -> CostCentreStack -> CostCentreStack # | |
Outputable CostCentreStack # | |
type CollectedCCs = ([CostCentre], [CostCentre], [CostCentreStack]) Source #
noCCSAttached :: CostCentreStack -> Bool Source #
isCurrentCCS :: CostCentreStack -> Bool Source #
mkUserCC :: FastString -> Module -> SrcSpan -> Unique -> 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 #
cmpCostCentre :: CostCentre -> CostCentre -> Ordering Source #