Safe Haskell	Safe-Inferred
Language	Haskell2010

Futhark.Analysis.SymbolTable

Contents

Entries
Lookup
Insertion
Misc

Synopsis

data SymbolTable lore
empty :: SymbolTable lore
fromScope :: ASTLore lore => Scope lore -> SymbolTable lore
toScope :: SymbolTable lore -> Scope lore
data Entry lore
deepen :: SymbolTable lore -> SymbolTable lore
entryDepth :: Entry lore -> Int
entryLetBoundDec :: Entry lore -> Maybe (LetDec lore)
entryIsSize :: Entry lore -> Bool
entryStm :: Entry lore -> Maybe (Stm lore)
entryFParam :: Entry lore -> Maybe (FParamInfo lore)
elem :: VName -> SymbolTable lore -> Bool
lookup :: VName -> SymbolTable lore -> Maybe (Entry lore)
lookupStm :: VName -> SymbolTable lore -> Maybe (Stm lore)
lookupExp :: VName -> SymbolTable lore -> Maybe (Exp lore, Certificates)
lookupBasicOp :: VName -> SymbolTable lore -> Maybe (BasicOp, Certificates)
lookupType :: ASTLore lore => VName -> SymbolTable lore -> Maybe Type
lookupSubExp :: VName -> SymbolTable lore -> Maybe (SubExp, Certificates)
lookupAliases :: VName -> SymbolTable lore -> Names
lookupLoopVar :: VName -> SymbolTable lore -> Maybe SubExp
lookupLoopParam :: VName -> SymbolTable lore -> Maybe (SubExp, SubExp)
available :: VName -> SymbolTable lore -> Bool
consume :: VName -> SymbolTable lore -> SymbolTable lore
index :: ASTLore lore => VName -> [SubExp] -> SymbolTable lore -> Maybe Indexed
index' :: VName -> [TPrimExp Int64 VName] -> SymbolTable lore -> Maybe Indexed
data Indexed
- = Indexed Certificates (PrimExp VName)
- | IndexedArray Certificates VName [TPrimExp Int64 VName]
indexedAddCerts :: Certificates -> Indexed -> Indexed
class IndexOp op where
- indexOp :: (ASTLore lore, IndexOp (Op lore)) => SymbolTable lore -> Int -> op -> [TPrimExp Int64 VName] -> Maybe Indexed
insertStm :: (ASTLore lore, IndexOp (Op lore), Aliased lore) => Stm lore -> SymbolTable lore -> SymbolTable lore
insertStms :: (ASTLore lore, IndexOp (Op lore), Aliased lore) => Stms lore -> SymbolTable lore -> SymbolTable lore
insertFParams :: ASTLore lore => [FParam lore] -> SymbolTable lore -> SymbolTable lore
insertLParam :: ASTLore lore => LParam lore -> SymbolTable lore -> SymbolTable lore
insertLoopVar :: ASTLore lore => VName -> IntType -> SubExp -> SymbolTable lore -> SymbolTable lore
insertLoopMerge :: ASTLore lore => [(FParam lore, SubExp, SubExp)] -> SymbolTable lore -> SymbolTable lore
hideCertified :: Names -> SymbolTable lore -> SymbolTable lore

Documentation

data SymbolTable lore Source #

Instances

Instances details

Semigroup (SymbolTable lore) Source #
Instance details Defined in Futhark.Analysis.SymbolTable Methods (<>) :: SymbolTable lore -> SymbolTable lore -> SymbolTable lore # sconcat :: NonEmpty (SymbolTable lore) -> SymbolTable lore # stimes :: Integral b => b -> SymbolTable lore -> SymbolTable lore #
Monoid (SymbolTable lore) Source #
Instance details Defined in Futhark.Analysis.SymbolTable Methods mempty :: SymbolTable lore # mappend :: SymbolTable lore -> SymbolTable lore -> SymbolTable lore # mconcat :: [SymbolTable lore] -> SymbolTable lore #

empty :: SymbolTable lore Source #

fromScope :: ASTLore lore => Scope lore -> SymbolTable lore Source #

toScope :: SymbolTable lore -> Scope lore Source #

Entries

data Entry lore Source #

Instances

Instances details

ASTLore lore => Typed (Entry lore) Source #
Instance details Defined in Futhark.Analysis.SymbolTable Methods typeOf :: Entry lore -> Type Source #

deepen :: SymbolTable lore -> SymbolTable lore Source #

entryDepth :: Entry lore -> Int Source #

entryLetBoundDec :: Entry lore -> Maybe (LetDec lore) Source #

entryIsSize :: Entry lore -> Bool Source #

True if this name has been used as an array size, implying that it is non-negative.

entryStm :: Entry lore -> Maybe (Stm lore) Source #

entryFParam :: Entry lore -> Maybe (FParamInfo lore) Source #

Lookup

elem :: VName -> SymbolTable lore -> Bool Source #

lookup :: VName -> SymbolTable lore -> Maybe (Entry lore) Source #

lookupStm :: VName -> SymbolTable lore -> Maybe (Stm lore) Source #

lookupExp :: VName -> SymbolTable lore -> Maybe (Exp lore, Certificates) Source #

lookupBasicOp :: VName -> SymbolTable lore -> Maybe (BasicOp, Certificates) Source #

lookupType :: ASTLore lore => VName -> SymbolTable lore -> Maybe Type Source #

lookupSubExp :: VName -> SymbolTable lore -> Maybe (SubExp, Certificates) Source #

lookupAliases :: VName -> SymbolTable lore -> Names Source #

lookupLoopVar :: VName -> SymbolTable lore -> Maybe SubExp Source #

If the given variable name is the name of a ForLoop parameter, then return the bound of that loop.

lookupLoopParam :: VName -> SymbolTable lore -> Maybe (SubExp, SubExp) Source #

available :: VName -> SymbolTable lore -> Bool Source #

In symbol table and not consumed.

consume :: VName -> SymbolTable lore -> SymbolTable lore Source #

index :: ASTLore lore => VName -> [SubExp] -> SymbolTable lore -> Maybe Indexed Source #

index' :: VName -> [TPrimExp Int64 VName] -> SymbolTable lore -> Maybe Indexed Source #

data Indexed Source #

The result of indexing a delayed array.

Constructors

Indexed Certificates (PrimExp VName)	A PrimExp based on the indexes (that is, without accessing any actual array).
IndexedArray Certificates VName [TPrimExp Int64 VName]	The indexing corresponds to another (perhaps more advantageous) array.

Instances

Instances details

FreeIn Indexed Source #
Instance details Defined in Futhark.Analysis.SymbolTable Methods freeIn' :: Indexed -> FV Source #

indexedAddCerts :: Certificates -> Indexed -> Indexed Source #

class IndexOp op where Source #

Minimal complete definition

Nothing

Methods

indexOp :: (ASTLore lore, IndexOp (Op lore)) => SymbolTable lore -> Int -> op -> [TPrimExp Int64 VName] -> Maybe Indexed Source #

Instances

Instances details

IndexOp () Source #
Instance details Defined in Futhark.Analysis.SymbolTable Methods indexOp :: (ASTLore lore, IndexOp (Op lore)) => SymbolTable lore -> Int -> () -> [TPrimExp Int64 VName] -> Maybe Indexed Source #
Decorations lore => IndexOp (SOAC lore) Source #
Instance details Defined in Futhark.IR.SOACS.SOAC Methods indexOp :: (ASTLore lore0, IndexOp (Op lore0)) => SymbolTable lore0 -> Int -> SOAC lore -> [TPrimExp Int64 VName] -> Maybe Indexed Source #
IndexOp inner => IndexOp (MemOp inner) Source #
Instance details Defined in Futhark.IR.Mem Methods indexOp :: (ASTLore lore, IndexOp (Op lore)) => SymbolTable lore -> Int -> MemOp inner -> [TPrimExp Int64 VName] -> Maybe Indexed Source #
ASTLore lore => IndexOp (SegOp lvl lore) Source #
Instance details Defined in Futhark.IR.SegOp Methods indexOp :: (ASTLore lore0, IndexOp (Op lore0)) => SymbolTable lore0 -> Int -> SegOp lvl lore -> [TPrimExp Int64 VName] -> Maybe Indexed Source #
(ASTLore lore, IndexOp op) => IndexOp (MCOp lore op) Source #
Instance details Defined in Futhark.IR.MC.Op Methods indexOp :: (ASTLore lore0, IndexOp (Op lore0)) => SymbolTable lore0 -> Int -> MCOp lore op -> [TPrimExp Int64 VName] -> Maybe Indexed Source #
(ASTLore lore, IndexOp op) => IndexOp (HostOp lore op) Source #
Instance details Defined in Futhark.IR.Kernels.Kernel Methods indexOp :: (ASTLore lore0, IndexOp (Op lore0)) => SymbolTable lore0 -> Int -> HostOp lore op -> [TPrimExp Int64 VName] -> Maybe Indexed Source #

Insertion

insertStm :: (ASTLore lore, IndexOp (Op lore), Aliased lore) => Stm lore -> SymbolTable lore -> SymbolTable lore Source #

insertStms :: (ASTLore lore, IndexOp (Op lore), Aliased lore) => Stms lore -> SymbolTable lore -> SymbolTable lore Source #

insertFParams :: ASTLore lore => [FParam lore] -> SymbolTable lore -> SymbolTable lore Source #

insertLParam :: ASTLore lore => LParam lore -> SymbolTable lore -> SymbolTable lore Source #

insertLoopVar :: ASTLore lore => VName -> IntType -> SubExp -> SymbolTable lore -> SymbolTable lore Source #

insertLoopMerge :: ASTLore lore => [(FParam lore, SubExp, SubExp)] -> SymbolTable lore -> SymbolTable lore Source #

Insert entries corresponding to the parameters of a loop (not distinguishing contect and value part). Apart from the parameter itself, we also insert the initial value and the subexpression providing the final value. Note that the latter is likely not in scope in the symbol at this point. This is OK, and can still be used to help some loop optimisations detect invariant loop parameters.

Misc

hideCertified :: Names -> SymbolTable lore -> SymbolTable lore Source #

Hide these definitions, if they are protected by certificates in the set of names.