Safe Haskell	None
Language	Haskell2010

IdInfo

Contents

The IdDetails type
The IdInfo type

Synopsis

The IdDetails type

data IdDetails Source

The IdDetails of an Id give stable, and necessary, information about the Id.

Constructors

VanillaId
RecSelId	The `Id` for a record selector
Fields sel_tycon :: TyCon For a data type family, this is the instance `TyCon` not the family `TyCon` sel_naughty :: Bool
DataConWorkId DataCon	The `Id` is for a data constructor worker
DataConWrapId DataCon	The `Id` is for a data constructor wrapper
ClassOpId Class	The `Id` is a superclass selector or class operation of a class
PrimOpId PrimOp	The `Id` is for a primitive operator
FCallId ForeignCall	The `Id` is for a foreign call
TickBoxOpId TickBoxOp	The `Id` is for a HPC tick box (both traditional and binary)
DFunId Int Bool	A dictionary function. Int = the number of "silent" arguments to the dfun e.g. class D a => C a where ... instance C a => C [a] has is_silent = 1, because the dfun has type dfun :: (D a, C a) => C [a] See Note [Silent superclass arguments] in TcInstDcls Bool = True = the class has only one method, so may be implemented with a newtype, so it might be bad to be strict on this dictionary

Instances

Outputable IdDetails

pprIdDetails :: IdDetails -> SDoc Source

coVarDetails :: IdDetails Source

The IdInfo type

data IdInfo Source

An IdInfo gives optional information about an Id. If present it never lies, but it may not be present, in which case there is always a conservative assumption which can be made.

Two Ids may have different info even though they have the same Unique (and are hence the same Id); for example, one might lack the properties attached to the other.

The IdInfo gives information about the value, or definition, of the Id. It does not contain information about the Id's usage, except for demandInfo and oneShotInfo.

vanillaIdInfo :: IdInfo Source

Basic IdInfo that carries no useful information whatsoever

noCafIdInfo :: IdInfo Source

More informative IdInfo we can use when we know the Id has no CAF references

seqIdInfo :: IdInfo -> () Source

Just evaluate the IdInfo to WHNF

megaSeqIdInfo :: IdInfo -> () Source

Evaluate all the fields of the IdInfo that are generally demanded by the compiler

The OneShotInfo type

data OneShotInfo Source

If the Id is a lambda-bound variable then it may have lambda-bound variable info. Sometimes we know whether the lambda binding this variable is a "one-shot" lambda; that is, whether it is applied at most once.

This information may be useful in optimisation, as computations may safely be floated inside such a lambda without risk of duplicating work.

Constructors

NoOneShotInfo	No information
ProbOneShot	The lambda is probably applied at most once See Note [Computing one-shot info, and ProbOneShot] in OccurAnl
OneShotLam	The lambda is applied at most once.

Instances

Eq OneShotInfo
Outputable OneShotInfo

oneShotInfo :: IdInfo -> OneShotInfo Source

Info about a lambda-bound variable, if the Id is one

noOneShotInfo :: OneShotInfo Source

It is always safe to assume that an Id has no lambda-bound variable information

hasNoOneShotInfo :: OneShotInfo -> Bool Source

setOneShotInfo :: IdInfo -> OneShotInfo -> IdInfo infixl 1 Source

Zapping various forms of Info

zapLamInfo :: IdInfo -> Maybe IdInfo Source

This is used to remove information on lambda binders that we have setup as part of a lambda group, assuming they will be applied all at once, but turn out to be part of an unsaturated lambda as in e.g:

(\x1. \x2. e) arg1

zapFragileInfo :: IdInfo -> Maybe IdInfo Source

Zap info that depends on free variables

zapDemandInfo :: IdInfo -> Maybe IdInfo Source

Remove demand info on the IdInfo if it is present, otherwise return Nothing

The ArityInfo type

type ArityInfo = Arity Source

An ArityInfo of n tells us that partial application of this Id to up to n-1 value arguments does essentially no work.

That is not necessarily the same as saying that it has n leading lambdas, because coerces may get in the way.

The arity might increase later in the compilation process, if an extra lambda floats up to the binding site.

unknownArity :: Arity Source

It is always safe to assume that an Id has an arity of 0

arityInfo :: IdInfo -> ArityInfo Source

Id arity

setArityInfo :: IdInfo -> ArityInfo -> IdInfo infixl 1 Source

ppArityInfo :: Int -> SDoc Source

callArityInfo :: IdInfo -> ArityInfo Source

How this is called. n = all calls have at least n arguments

setCallArityInfo :: IdInfo -> ArityInfo -> IdInfo Source

Demand and strictness Info

strictnessInfo :: IdInfo -> StrictSig Source

setStrictnessInfo :: IdInfo -> StrictSig -> IdInfo infixl 1 Source

demandInfo :: IdInfo -> Demand Source

ID demand information

setDemandInfo :: IdInfo -> Demand -> IdInfo infixl 1 Source

pprStrictness :: StrictSig -> SDoc Source

Unfolding Info

unfoldingInfo :: IdInfo -> Unfolding Source

The Ids unfolding

setUnfoldingInfo :: IdInfo -> Unfolding -> IdInfo infixl 1 Source

setUnfoldingInfoLazily :: IdInfo -> Unfolding -> IdInfo Source

The InlinePragInfo type

type InlinePragInfo = InlinePragma Source

Tells when the inlining is active. When it is active the thing may be inlined, depending on how big it is.

If there was an INLINE pragma, then as a separate matter, the RHS will have been made to look small with a Core inline Note

The default InlinePragInfo is AlwaysActive, so the info serves entirely as a way to inhibit inlining until we want it

inlinePragInfo :: IdInfo -> InlinePragma Source

Any inline pragma atached to the Id

setInlinePragInfo :: IdInfo -> InlinePragma -> IdInfo infixl 1 Source

The OccInfo type

data OccInfo Source

Identifier occurrence information

Constructors

NoOccInfo	There are many occurrences, or unknown occurrences
IAmDead	Marks unused variables. Sometimes useful for lambda and case-bound variables.
OneOcc !InsideLam !OneBranch !InterestingCxt	Occurs exactly once, not inside a rule
IAmALoopBreaker !RulesOnly	This identifier breaks a loop of mutually recursive functions. The field marks whether it is only a loop breaker due to a reference in a rule