Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data SymbolTable rep
- empty :: SymbolTable rep
- fromScope :: ASTRep rep => Scope rep -> SymbolTable rep
- toScope :: SymbolTable rep -> Scope rep
- data Entry rep
- deepen :: SymbolTable rep -> SymbolTable rep
- entryAccInput :: Entry rep -> Maybe (WithAccInput rep)
- entryDepth :: Entry rep -> Int
- entryLetBoundDec :: Entry rep -> Maybe (LetDec rep)
- entryIsSize :: Entry rep -> Bool
- entryStm :: Entry rep -> Maybe (Stm rep)
- entryFParam :: Entry rep -> Maybe (FParamInfo rep)
- entryLParam :: Entry rep -> Maybe (LParamInfo rep)
- elem :: VName -> SymbolTable rep -> Bool
- lookup :: VName -> SymbolTable rep -> Maybe (Entry rep)
- lookupStm :: VName -> SymbolTable rep -> Maybe (Stm rep)
- lookupExp :: VName -> SymbolTable rep -> Maybe (Exp rep, Certs)
- lookupBasicOp :: VName -> SymbolTable rep -> Maybe (BasicOp, Certs)
- lookupType :: ASTRep rep => VName -> SymbolTable rep -> Maybe Type
- lookupSubExp :: VName -> SymbolTable rep -> Maybe (SubExp, Certs)
- lookupAliases :: VName -> SymbolTable rep -> Names
- lookupLoopVar :: VName -> SymbolTable rep -> Maybe SubExp
- lookupLoopParam :: VName -> SymbolTable rep -> Maybe (SubExp, SubExp)
- available :: VName -> SymbolTable rep -> Bool
- consume :: VName -> SymbolTable rep -> SymbolTable rep
- index :: ASTRep rep => VName -> [SubExp] -> SymbolTable rep -> Maybe Indexed
- index' :: VName -> [TPrimExp Int64 VName] -> SymbolTable rep -> Maybe Indexed
- data Indexed
- indexedAddCerts :: Certs -> Indexed -> Indexed
- class IndexOp op where
- insertStm :: (ASTRep rep, IndexOp (Op rep), Aliased rep) => Stm rep -> SymbolTable rep -> SymbolTable rep
- insertStms :: (ASTRep rep, IndexOp (Op rep), Aliased rep) => Stms rep -> SymbolTable rep -> SymbolTable rep
- insertFParams :: ASTRep rep => [FParam rep] -> SymbolTable rep -> SymbolTable rep
- insertLParam :: ASTRep rep => LParam rep -> SymbolTable rep -> SymbolTable rep
- insertLoopVar :: ASTRep rep => VName -> IntType -> SubExp -> SymbolTable rep -> SymbolTable rep
- insertLoopMerge :: ASTRep rep => [(FParam rep, SubExp, SubExpRes)] -> SymbolTable rep -> SymbolTable rep
- hideCertified :: Names -> SymbolTable rep -> SymbolTable rep
- noteAccTokens :: [(VName, WithAccInput rep)] -> SymbolTable rep -> SymbolTable rep
Documentation
data SymbolTable rep Source #
Instances
Semigroup (SymbolTable rep) Source # | |
Defined in Futhark.Analysis.SymbolTable (<>) :: SymbolTable rep -> SymbolTable rep -> SymbolTable rep # sconcat :: NonEmpty (SymbolTable rep) -> SymbolTable rep # stimes :: Integral b => b -> SymbolTable rep -> SymbolTable rep # | |
Monoid (SymbolTable rep) Source # | |
Defined in Futhark.Analysis.SymbolTable mempty :: SymbolTable rep # mappend :: SymbolTable rep -> SymbolTable rep -> SymbolTable rep # mconcat :: [SymbolTable rep] -> SymbolTable rep # |
empty :: SymbolTable rep Source #
toScope :: SymbolTable rep -> Scope rep Source #
Entries
deepen :: SymbolTable rep -> SymbolTable rep Source #
entryAccInput :: Entry rep -> Maybe (WithAccInput rep) Source #
For names that are tokens of an accumulator, this is the corresponding combining function and neutral element.
entryDepth :: Entry rep -> Int Source #
entryIsSize :: Entry rep -> Bool Source #
True if this name has been used as an array size, implying that it is non-negative.
entryFParam :: Entry rep -> Maybe (FParamInfo rep) Source #
entryLParam :: Entry rep -> Maybe (LParamInfo rep) Source #
Lookup
elem :: VName -> SymbolTable rep -> Bool Source #
You almost always want available
instead of this one.
lookupBasicOp :: VName -> SymbolTable rep -> Maybe (BasicOp, Certs) Source #
lookupType :: ASTRep rep => VName -> SymbolTable rep -> Maybe Type Source #
lookupSubExp :: VName -> SymbolTable rep -> Maybe (SubExp, Certs) Source #
lookupAliases :: VName -> SymbolTable rep -> Names Source #
lookupLoopVar :: VName -> SymbolTable rep -> 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 rep -> Maybe (SubExp, SubExp) Source #
consume :: VName -> SymbolTable rep -> SymbolTable rep Source #
The result of indexing a delayed array.
class IndexOp op where Source #
Nothing
indexOp :: (ASTRep rep, IndexOp (Op rep)) => SymbolTable rep -> Int -> op -> [TPrimExp Int64 VName] -> Maybe Indexed Source #
Insertion
insertStm :: (ASTRep rep, IndexOp (Op rep), Aliased rep) => Stm rep -> SymbolTable rep -> SymbolTable rep Source #
insertStms :: (ASTRep rep, IndexOp (Op rep), Aliased rep) => Stms rep -> SymbolTable rep -> SymbolTable rep Source #
insertFParams :: ASTRep rep => [FParam rep] -> SymbolTable rep -> SymbolTable rep Source #
insertLParam :: ASTRep rep => LParam rep -> SymbolTable rep -> SymbolTable rep Source #
insertLoopVar :: ASTRep rep => VName -> IntType -> SubExp -> SymbolTable rep -> SymbolTable rep Source #
insertLoopMerge :: ASTRep rep => [(FParam rep, SubExp, SubExpRes)] -> SymbolTable rep -> SymbolTable rep 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 rep -> SymbolTable rep Source #
Hide these definitions, if they are protected by certificates in the set of names.
noteAccTokens :: [(VName, WithAccInput rep)] -> SymbolTable rep -> SymbolTable rep Source #
Note that these names are tokens for the corresponding accumulators. The names must already be present in the symbol table.