CLaSH.Normalize.Util

Utility functions used by the normalisation transformations

Documentation

alreadyInlined

Arguments

:: TmName

Function we want to inline

-> TmName

Function in which we want to perform the inlining

-> NormalizeMonad (Maybe Int)

Determine if a function is already inlined in the context of the NetlistMonad

addNewInline

Arguments

:: TmName

Function we want to inline

-> TmName

Function in which we want to perform the inlining

-> NormalizeMonad ()

specializeNorm :: NormRewrite

Specialize under the Normalization Monad

isClosed :: (Functor m, Fresh m) => HashMap TyConName TyCon -> Term -> m Bool

Determine if a term is closed

isConstant :: Term -> Bool

Determine if a term represents a constant

isRecursiveBndr :: TmName -> NormalizeSession Bool

callGraph

Arguments

:: [TmName]

List of functions that should not be inspected

-> HashMap TmName (Type, SrcSpan, Term)

Global binders

-> TmName

Root of the call graph

-> [(TmName, [TmName])]

Create a call graph for a set of global binders, given a root

mkRecursiveComponents

Arguments

:: [(TmName, [TmName])]

(calling function,[called function

)]

-> [[TmName]]

Determine the sets of recursive components given the edges of a callgraph

lambdaDropPrep :: HashMap TmName (Type, SrcSpan, Term) -> TmName -> HashMap TmName (Type, SrcSpan, Term)

lambdaDrop

Arguments

:: HashMap TmName (Type, SrcSpan, Term)

Original Binders

-> HashMap TmName [TmName]

Dependency Graph

-> [TmName]

Recursive block

-> (TmName, (Type, SrcSpan, Term))

Lambda-dropped Binders

dominator

Arguments

:: HashMap TmName [TmName]

Dependency Graph

-> [TmName]

Recursive block

-> Gr TmName TmName

Recursive block dominator

blockSink

Arguments

:: HashMap TmName (Type, SrcSpan, Term)

Original Binders

-> Gr TmName TmName

Recursive block dominator

-> LNode TmName

Recursive block dominator root

-> (TmName, (Type, SrcSpan, Term))

Block sank binder