LLVM: llvm::DominanceFrontierBase< BlockT, IsPostDom > Class Template Reference (original) (raw)

DominanceFrontierBase - Common base class for computing forward and inverse dominance frontiers for a function. More...

#include "[llvm/Analysis/DominanceFrontier.h](DominanceFrontier%5F8h%5Fsource.html)"

Public Member Functions
DominanceFrontierBase ()=default
const SmallVectorImpl< BlockT * > & getRoots () const
getRoots - Return the root blocks of the current CFG.
BlockT * getRoot () const
bool isPostDominator () const
isPostDominator - Returns true if analysis based of postdoms
void releaseMemory ()
iterator begin ()
const_iterator begin () const
iterator end ()
const_iterator end () const
iterator find (BlockT *B)
const_iterator find (BlockT *B) const
void print (raw_ostream &OS) const
print - Convert to human readable form
void dump () const
dump - Dump the dominance frontier to dbgs().
Static Protected Attributes
static constexpr bool IsPostDominators = IsPostDom

template<class BlockT, bool IsPostDom>
class llvm::DominanceFrontierBase< BlockT, IsPostDom >

DominanceFrontierBase - Common base class for computing forward and inverse dominance frontiers for a function.

Definition at line 39 of file DominanceFrontier.h.

BlockTraits

template<class BlockT, bool IsPostDom>

const_iterator

template<class BlockT, bool IsPostDom>

DomSetMapType

template<class BlockT, bool IsPostDom>

DomSetType

template<class BlockT, bool IsPostDom>

iterator

template<class BlockT, bool IsPostDom>

template<class BlockT, bool IsPostDom>

begin() [1/2]

template<class BlockT, bool IsPostDom>

begin() [2/2]

template<class BlockT, bool IsPostDom>

dump()

end() [1/2]

template<class BlockT, bool IsPostDom>

end() [2/2]

template<class BlockT, bool IsPostDom>

find() [1/2]

template<class BlockT, bool IsPostDom>

find() [2/2]

template<class BlockT, bool IsPostDom>

getRoot()

template<class BlockT, bool IsPostDom>

getRoots()

template<class BlockT, bool IsPostDom>

getRoots - Return the root blocks of the current CFG.

This may include multiple blocks if we are computing post dominators. For forward dominators, this will always be a single block (the entry node).

Definition at line 60 of file DominanceFrontier.h.

isPostDominator()

template<class BlockT, bool IsPostDom>

isPostDominator - Returns true if analysis based of postdoms

Definition at line 68 of file DominanceFrontier.h.

print()

releaseMemory()

template<class BlockT, bool IsPostDom>

Frontiers

template<class BlockT, bool IsPostDom>

IsPostDominators

template<class BlockT, bool IsPostDom>

Roots

template<class BlockT, bool IsPostDom>


The documentation for this class was generated from the following files: