, including all inherited members.
| addNewBlock(NodeT *BB, NodeT *DomBB) | llvm::DominatorTreeBase< NodeT > | [inline] |
| addRoot(NodeT *BB) | llvm::DominatorTreeBase< NodeT > | [inline, protected] |
| addRoot(MachineBasicBlock *MBB) | llvm::DominatorTreeBase< NodeT > | [inline] |
| Calculate(DominatorTreeBase< typename GraphTraits< N >::NodeType > &DT, FuncT &F) | llvm::DominatorTreeBase< NodeT > | [friend] |
| changeImmediateDominator(DomTreeNodeBase< NodeT > *N, DomTreeNodeBase< NodeT > *NewIDom) | llvm::DominatorTreeBase< NodeT > | [inline] |
| changeImmediateDominator(NodeT *BB, NodeT *NewBB) | llvm::DominatorTreeBase< NodeT > | [inline] |
| compare(DominatorTreeBase &Other) const | llvm::DominatorTreeBase< NodeT > | [inline] |
| Compress(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *VIn) | llvm::DominatorTreeBase< NodeT > | [friend] |
| DFSInfoValid | llvm::DominatorTreeBase< NodeT > | [protected] |
| DFSPass(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *V, unsigned N) | llvm::DominatorTreeBase< NodeT > | [friend] |
| dominatedBySlowTreeWalk(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) const | llvm::DominatorTreeBase< NodeT > | [inline] |
| dominates(const DomTreeNodeBase< NodeT > *A, DomTreeNodeBase< NodeT > *B) | llvm::DominatorTreeBase< NodeT > | [inline] |
| dominates(NodeT *A, NodeT *B) | llvm::DominatorTreeBase< NodeT > | [inline] |
| DominatorBase(bool isPostDom) | llvm::DominatorBase< NodeT > | [inline, explicit, protected] |
| DominatorTreeBase(bool isPostDom) | llvm::DominatorTreeBase< NodeT > | [inline, explicit] |
| DomTreeNodeMapType typedef | llvm::DominatorTreeBase< NodeT > | [protected] |
| DomTreeNodes | llvm::DominatorTreeBase< NodeT > | [protected] |
| dump() | llvm::DominatorTreeBase< NodeT > | [inline, virtual] |
| eraseNode(NodeT *BB) | llvm::DominatorTreeBase< NodeT > | [inline] |
| Eval(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *V) | llvm::DominatorTreeBase< NodeT > | [friend] |
| findNearestCommonDominator(NodeT *A, NodeT *B) | llvm::DominatorTreeBase< NodeT > | [inline] |
| getIDom(NodeT *BB) const | llvm::DominatorTreeBase< NodeT > | [inline, protected] |
| getNode(NodeT *BB) const | llvm::DominatorTreeBase< NodeT > | [inline] |
| getNodeForBlock(NodeT *BB) | llvm::DominatorTreeBase< NodeT > | [inline, protected] |
| getRoot() const | llvm::DominatorTreeBase< NodeT > | [inline] |
| getRootNode() | llvm::DominatorTreeBase< NodeT > | [inline] |
| getRootNode() const | llvm::DominatorTreeBase< NodeT > | [inline] |
| getRoots() const | llvm::DominatorBase< NodeT > | [inline] |
| IDoms | llvm::DominatorTreeBase< NodeT > | [protected] |
| Info | llvm::DominatorTreeBase< NodeT > | [protected] |
| isPostDominator() const | llvm::DominatorBase< NodeT > | [inline] |
| IsPostDominators | llvm::DominatorBase< NodeT > | [protected] |
| isReachableFromEntry(NodeT *A) | llvm::DominatorTreeBase< NodeT > | [inline] |
| Link(DominatorTreeBase< typename GraphT::NodeType > &DT, unsigned DFSNumV, typename GraphT::NodeType *W, typename DominatorTreeBase< typename GraphT::NodeType >::InfoRec &WInfo) | llvm::DominatorTreeBase< NodeT > | [friend] |
| print(std::ostream &o, const Module *) const | llvm::DominatorTreeBase< NodeT > | [inline, virtual] |
| print(std::ostream *OS, const Module *M=0) const | llvm::DominatorTreeBase< NodeT > | [inline] |
| properlyDominates(const DomTreeNodeBase< NodeT > *A, DomTreeNodeBase< NodeT > *B) const | llvm::DominatorTreeBase< NodeT > | [inline] |
| properlyDominates(NodeT *A, NodeT *B) | llvm::DominatorTreeBase< NodeT > | [inline] |
| recalculate(FT &F) | llvm::DominatorTreeBase< NodeT > | [inline] |
| releaseMemory() | llvm::DominatorTreeBase< NodeT > | [inline, virtual] |
| removeNode(NodeT *BB) | llvm::DominatorTreeBase< NodeT > | [inline] |
| reset() | llvm::DominatorTreeBase< NodeT > | [inline, protected] |
| RootNode | llvm::DominatorTreeBase< NodeT > | [protected] |
| Roots | llvm::DominatorBase< NodeT > | [protected] |
| runOnFunction(Function &F) | llvm::DominatorTreeBase< NodeT > | [inline, virtual] |
| SlowQueries | llvm::DominatorTreeBase< NodeT > | [protected] |
| Split(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *NewBB) | llvm::DominatorTreeBase< NodeT > | [inline, protected] |
| splitBlock(NodeT *NewBB) | llvm::DominatorTreeBase< NodeT > | [inline] |
| updateDFSNumbers() | llvm::DominatorTreeBase< NodeT > | [inline, protected] |
| Vertex | llvm::DominatorTreeBase< NodeT > | [protected] |
| ~DominatorTreeBase() | llvm::DominatorTreeBase< NodeT > | [inline, virtual] |