Copyright	(C) 2015-2016 University of Twente 2016 Myrtle Software Ltd
License	BSD2 (see the file LICENSE)
Maintainer	Christiaan Baaij <christiaan.baaij@gmail.com>
Safe Haskell	None
Language	Haskell2010

Clash.Normalize.PrimitiveReductions

Description

Reductions of primitives

Currently, it contains reductions for:

Clash.Sized.Vector.map
Clash.Sized.Vector.zipWith
Clash.Sized.Vector.traverse#
Clash.Sized.Vector.foldr
Clash.Sized.Vector.fold
Clash.Sized.Vector.dfold
Clash.Sized.Vector.(++)
Clash.Sized.Vector.head
Clash.Sized.Vector.tail
Clash.Sized.Vector.unconcatBitVector#
Clash.Sized.Vector.replicate
Clash.Sized.Vector.imap
Clash.Sized.Vector.dtfold
Clash.Sized.RTree.tfold
Clash.Sized.Vector.reverse

Partially handles:

Clash.Sized.Vector.unconcat
Clash.Sized.Vector.transpose

Synopsis

reduceReverse :: InScopeSet -> Integer -> Type -> Term -> NormalizeSession Term
reduceZipWith :: TransformContext -> Integer -> Type -> Type -> Type -> Term -> Term -> Term -> NormalizeSession Term
reduceMap :: TransformContext -> Integer -> Type -> Type -> Term -> Term -> NormalizeSession Term
reduceImap :: TransformContext -> Integer -> Type -> Type -> Term -> Term -> NormalizeSession Term
reduceTraverse :: TransformContext -> Integer -> Type -> Type -> Type -> Term -> Term -> Term -> NormalizeSession Term
mkTravVec :: TyConName -> DataCon -> DataCon -> Term -> Term -> Term -> Type -> Integer -> [Term] -> Term
reduceFoldr :: TransformContext -> Integer -> Type -> Term -> Term -> Term -> NormalizeSession Term
reduceFold :: TransformContext -> Integer -> Type -> Term -> Term -> NormalizeSession Term
reduceDFold :: InScopeSet -> Integer -> Type -> Term -> Term -> Term -> NormalizeSession Term
reduceHead :: InScopeSet -> Integer -> Type -> Term -> NormalizeSession Term
reduceTail :: InScopeSet -> Integer -> Type -> Term -> NormalizeSession Term
reduceLast :: InScopeSet -> Integer -> Type -> Term -> NormalizeSession Term
reduceInit :: InScopeSet -> Integer -> Type -> Term -> NormalizeSession Term
reduceAppend :: InScopeSet -> Integer -> Integer -> Type -> Term -> Term -> NormalizeSession Term
reduceUnconcat :: Integer -> Integer -> Type -> Term -> NormalizeSession Term
reduceTranspose :: Integer -> Integer -> Type -> Term -> NormalizeSession Term
reduceReplicate :: Integer -> Type -> Type -> Term -> NormalizeSession Term
reduceReplace_int :: InScopeSet -> Integer -> Type -> Type -> Term -> Term -> Term -> NormalizeSession Term
reduceIndex_int :: InScopeSet -> Integer -> Type -> Term -> Term -> NormalizeSession Term
reduceDTFold :: InScopeSet -> Integer -> Type -> Term -> Term -> Term -> NormalizeSession Term
reduceTFold :: InScopeSet -> Integer -> Type -> Term -> Term -> Term -> NormalizeSession Term
reduceTReplicate :: Integer -> Type -> Type -> Term -> NormalizeSession Term
buildSNat :: DataCon -> Integer -> Term

Documentation

reduceReverse Source #

Arguments

:: InScopeSet
-> Integer	Length of the vector
-> Type	Element of type of the vector
-> Term	The vector to reverse
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.reverse primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.reverse

reduceZipWith Source #

Arguments

:: TransformContext
-> Integer	Length of the vector(s)
-> Type	Type of the lhs of the function
-> Type	Type of the rhs of the function
-> Type	Type of the result of the function
-> Term	The zipWith'd functions
-> Term	The 1st vector argument
-> Term	The 2nd vector argument
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.zipWith primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.zipWith

reduceMap Source #

Arguments

:: TransformContext
-> Integer	Length of the vector
-> Type	Argument type of the function
-> Type	Result type of the function
-> Term	The map'd function
-> Term	The map'd over vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.map primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.map

reduceImap Source #

Arguments

:: TransformContext
-> Integer	Length of the vector
-> Type	Argument type of the function
-> Type	Result type of the function
-> Term	The imap'd function
-> Term	The imap'd over vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.imap primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.imap

reduceTraverse Source #

Arguments

:: TransformContext
-> Integer	Length of the vector
-> Type	Element type of the argument vector
-> Type	The type of the applicative
-> Type	Element type of the result vector
-> Term	The `Applicative` dictionary
-> Term	The function to traverse with
-> Term	The argument vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.traverse# primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.traverse#

mkTravVec Source #

Arguments

:: TyConName	Vec tcon
-> DataCon	Nil con
-> DataCon	Cons con
-> Term	`pure` term
-> Term	`<*>` term
-> Term	`fmap` term
-> Type	`b` ty
-> Integer	Length of the vector
-> [Term]	Elements of the vector
-> Term

Create the traversable vector

e.g. for a length '2' input vector, we get

(:>) <$> x0 <*> ((:>) <$> x1 <*> pure Nil)

reduceFoldr Source #

Arguments

:: TransformContext
-> Integer	Length of the vector
-> Type	Element type of the argument vector
-> Term	The function to fold with
-> Term	The starting value
-> Term	The argument vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.foldr primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.foldr

reduceFold Source #

Arguments

:: TransformContext
-> Integer	Length of the vector
-> Type	Element type of the argument vector
-> Term	The function to fold with
-> Term	The argument vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.fold primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.fold

reduceDFold Source #

Arguments

:: InScopeSet
-> Integer	Length of the vector
-> Type	Element type of the argument vector
-> Term	Function to fold with
-> Term	Starting value
-> Term	The vector to fold
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.dfold primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.dfold

reduceHead Source #

Arguments

:: InScopeSet
-> Integer	Length of the vector
-> Type	Element type of the vector
-> Term	The argument vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.head primitive on vectors of a known length n, by a projection of the first element of a vector.

reduceTail Source #

Arguments

:: InScopeSet
-> Integer	Length of the vector
-> Type	Element type of the vector
-> Term	The argument vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.tail primitive on vectors of a known length n, by a projection of the tail of a vector.

reduceLast Source #

Arguments

:: InScopeSet
-> Integer	Length of the vector
-> Type	Element type of the vector
-> Term	The argument vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.last primitive on vectors of a known length n, by a projection of the last element of a vector.

reduceInit Source #

Arguments

:: InScopeSet
-> Integer	Length of the vector
-> Type	Element type of the vector
-> Term	The argument vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.init primitive on vectors of a known length n, by a projection of the init of a vector.

reduceAppend Source #

Arguments

:: InScopeSet
-> Integer	Length of the LHS arg
-> Integer	Lenght of the RHS arg
-> Type	Element type of the vectors
-> Term	The LHS argument
-> Term	The RHS argument
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.(++) primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.(++)

reduceUnconcat Source #

Arguments

:: Integer	Length of the result vector
-> Integer	Length of the elements of the result vector
-> Type	Element type
-> Term	Argument vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.unconcat primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.unconcat

reduceTranspose Source #

Arguments

:: Integer	Length of the result vector
-> Integer	Length of the elements of the result vector
-> Type	Element type
-> Term	Argument vector
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.transpose primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.transpose

reduceReplicate :: Integer -> Type -> Type -> Term -> NormalizeSession Term Source #

reduceReplace_int Source #

Arguments

:: InScopeSet
-> Integer	Size of vector
-> Type	Type of vector element
-> Type	Type of vector
-> Term	Vector
-> Term	Index
-> Term	Element
-> NormalizeSession Term

reduceIndex_int Source #

Arguments

:: InScopeSet
-> Integer	Size of vector
-> Type	Type of vector element
-> Term	Vector
-> Term	Index
-> NormalizeSession Term

reduceDTFold Source #

Arguments

:: InScopeSet
-> Integer	Length of the vector
-> Type	Element type of the argument vector
-> Term	Function to convert elements with
-> Term	Function to combine branches with
-> Term	The vector to fold
-> NormalizeSession Term

Replace an application of the Clash.Sized.Vector.dtfold primitive on vectors of a known length n, by the fully unrolled recursive "definition" of Clash.Sized.Vector.dtfold

reduceTFold Source #

Arguments

:: InScopeSet
-> Integer	Depth of the tree
-> Type	Element type of the argument tree
-> Term	Function to convert elements with
-> Term	Function to combine branches with
-> Term	The tree to fold
-> NormalizeSession Term

Replace an application of the Clash.Sized.RTree.tdfold primitive on trees of a known depth n, by the fully unrolled recursive "definition" of Clash.Sized.RTree.tdfold

reduceTReplicate Source #

Arguments

:: Integer	Depth of the tree
-> Type	Element type
-> Type	Result type
-> Term	Element
-> NormalizeSession Term

buildSNat :: DataCon -> Integer -> Term Source #