GHC.StgToCmm.Closure

The tag on a pointer (from the dynamic-tagging paper)

Is a data type family small enough that each constructor can get its own pointer tag?

Assumes that there is at most one PrimRep of the type. This assumption holds after unarise. See Note [Post-unarisation invariants] in GHC.Stg.Unarise. See Note [VoidRep] in GHC.Types.RepType.

Assumes that Ids have one PrimRep, which holds after unarisation. See Note [Post-unarisation invariants] in GHC.Stg.Unarise.

Assumes that arguments have one PrimRep, which holds after unarisation. See Note [Post-unarisation invariants] in GHC.Stg.Unarise.

Used in places where some invariant ensures that all these Ids are non-void; e.g. constructor field binders in case expressions. See Note [Post-unarisation invariants] in GHC.Stg.Unarise.

Used in places where some invariant ensures that all these arguments are non-void; e.g. constructor arguments. See Note [Post-unarisation invariants] in GHC.Stg.Unarise.

Information about an identifier, from the code generator's point of view. Every identifier is bound to a LambdaFormInfo in the environment, which gives the code generator enough info to be able to tail call or return that identifier.

StandardFormInfo tells whether this thunk has one of a small number of standard forms

The LambdaFormInfo of an imported Id. See Note [The LFInfo of Imported Ids]

Return the tag in the low order bits of a variable bound to this LambdaForm

Convert from ClosureInfo to CmmInfoTable.

Get the info table label for a *thunk*.