| /freebsd-9.3-release/contrib/llvm/include/llvm/Analysis/ |
| H A D | PostDominators.h | 73 inline BasicBlock *findNearestCommonDominator(BasicBlock *A, BasicBlock *B) { function in struct:llvm::PostDominatorTree
74 return DT->findNearestCommonDominator(A, B);
77 inline const BasicBlock *findNearestCommonDominator(const BasicBlock *A, function in struct:llvm::PostDominatorTree
79 return DT->findNearestCommonDominator(A, B);
|
| H A D | Dominators.h | 285 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
435 /// findNearestCommonDominator - Find nearest common dominator basic block
437 NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) { function in class:llvm::DominatorTreeBase
481 const NodeT *findNearestCommonDominator(const NodeT *A, const NodeT *B) { function in class:llvm::DominatorTreeBase
484 return findNearestCommonDominator(const_cast<NodeT *>(A),
826 /// findNearestCommonDominator - Find nearest common dominator basic block
828 inline BasicBlock *findNearestCommonDominator(BasicBlock *A, BasicBlock *B) { function in class:llvm::DominatorTree
829 return DT->findNearestCommonDominator(A, B);
832 inline const BasicBlock *findNearestCommonDominator(const BasicBlock *A, function in class:llvm::DominatorTree
834 return DT->findNearestCommonDominator(
[all...] |
| /freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/ |
| H A D | MachinePostDominators.h | 76 MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A, function in struct:llvm::MachinePostDominatorTree
78 return DT->findNearestCommonDominator(A, B);
|
| H A D | MachineDominators.h | 111 /// findNearestCommonDominator - Find nearest common dominator basic block
113 inline MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A, function in class:llvm::MachineDominatorTree
115 return DT->findNearestCommonDominator(A, B);
|
| /freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
| H A D | Dominators.h | 119 inline CFGBlock *findNearestCommonDominator(CFGBlock *A, CFGBlock *B) { function in class:clang::DominatorTree
120 return DT->findNearestCommonDominator(A, B);
123 inline const CFGBlock *findNearestCommonDominator(const CFGBlock *A, function in class:clang::DominatorTree
125 return DT->findNearestCommonDominator(A, B);
|
| /freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | LoopRotation.cpp | 480 // findNearestCommonDominator on all CFG predecessors of each child of the
495 NearestDom = DT->findNearestCommonDominator(NearestDom, *PI);
|
| H A D | StructurizeCFG.cpp | 621 Dominator = DT->findNearestCommonDominator(Dominator, BB);
|
| H A D | CodeGenPrepare.cpp | 437 BasicBlock *NewIDom = DT->findNearestCommonDominator(BBIDom, DestBBIDom);
|
| H A D | IndVarSimplify.cpp | 206 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB);
|
| H A D | LoopStrengthReduce.cpp | 2164 DT.findNearestCommonDominator(IVIncInsertPos->getParent(),
4345 BB = DT.findNearestCommonDominator(BB, ExitingBlocks[i]);
|
| /freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
| H A D | SplitKit.cpp | 785 MDT.findNearestCommonDominator(Dom.first, ValMBB);
|