HomeSort by: relevance | last modified time | path
    Searched defs:findNearestCommonDominator (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachinePostDominators.cpp 51 MachineBasicBlock *MachinePostDominatorTree::findNearestCommonDominator(
57 NCD = PDT->findNearestCommonDominator(NCD, BB);
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachinePostDominators.h 77 MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A,
79 return PDT->findNearestCommonDominator(A, B);
85 findNearestCommonDominator(ArrayRef<MachineBasicBlock *> Blocks) const;
MachineDominators.h 147 /// findNearestCommonDominator - Find nearest common dominator basic block
149 MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A,
152 return DT->findNearestCommonDominator(A, B);
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/
Dominators.h 149 CFGBlock *findNearestCommonDominator(CFGBlock *A, CFGBlock *B) {
150 return DT.findNearestCommonDominator(A, B);
153 const CFGBlock *findNearestCommonDominator(const CFGBlock *A,
155 return DT.findNearestCommonDominator(A, B);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
GenericDomTree.h 468 NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) const {
497 const NodeT *findNearestCommonDominator(const NodeT *A,
501 return findNearestCommonDominator(const_cast<NodeT *>(A),
871 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i]);

Completed in 38 milliseconds