Futhark.Analysis.SymbolTable

Documentation

data SymbolTable lore

Instances

Semigroup (SymbolTable lore)

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)

Defined in Futhark.Analysis.SymbolTable

Methods

mempty :: SymbolTable lore

mappend :: SymbolTable lore -> SymbolTable lore -> SymbolTable lore

mconcat :: [SymbolTable lore] -> SymbolTable lore

empty :: SymbolTable lore

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

toScope :: SymbolTable lore -> Scope lore

Entries

data Entry lore

Instances

ASTLore lore => Typed (Entry lore)

Defined in Futhark.Analysis.SymbolTable

Methods

typeOf :: Entry lore -> Type

deepen :: SymbolTable lore -> SymbolTable lore

entryDepth :: Entry lore -> Int

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

entryIsSize :: Entry lore -> Bool

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

Lookup

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

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)

available :: VName -> SymbolTable lore -> Bool

In symbol table and not consumed.

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

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

FreeIn Indexed

Defined in Futhark.Analysis.SymbolTable

Methods

freeIn' :: Indexed -> FV

indexedAddCerts :: Certificates -> Indexed -> Indexed

class IndexOp op where

Minimal complete definition

Nothing

Methods

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

Instances

IndexOp ()

Defined in Futhark.Analysis.SymbolTable

Methods

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

Decorations lore => IndexOp (SOAC lore)

Defined in Futhark.IR.SOACS.SOAC

Methods

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

IndexOp inner => IndexOp (MemOp inner)

Defined in Futhark.IR.Mem

Methods

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

ASTLore lore => IndexOp (SegOp lvl lore)

Defined in Futhark.IR.SegOp

Methods

indexOp :: (ASTLore lore0, IndexOp (Op lore0)) => SymbolTable lore0 -> Int -> SegOp lvl lore -> [TPrimExp Int64 VName] -> Maybe Indexed

(ASTLore lore, IndexOp op) => IndexOp (MCOp lore op)

Defined in Futhark.IR.MC.Op

Methods

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

(ASTLore lore, IndexOp op) => IndexOp (HostOp lore op)

Defined in Futhark.IR.Kernels.Kernel

Methods

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

Insertion

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

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

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