/external/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);
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachinePostDominators.h | 75 MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A, function in struct:llvm::MachinePostDominatorTree 77 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);
|
/external/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 125 inline CFGBlock *findNearestCommonDominator(CFGBlock *A, CFGBlock *B) { function in class:clang::DominatorTree 126 return DT->findNearestCommonDominator(A, B); 129 inline const CFGBlock *findNearestCommonDominator(const CFGBlock *A, function in class:clang::DominatorTree 131 return DT->findNearestCommonDominator(A, B);
|
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 279 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 496 const NodeT *findNearestCommonDominator(const NodeT *A, const NodeT *B) { function in class:llvm::DominatorTreeBase 499 return findNearestCommonDominator(const_cast<NodeT *>(A),
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64PromoteConstant.cpp | 399 BasicBlock *CommonDominator = DT.findNearestCommonDominator(NewBB, CurBB);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopRotation.cpp | 524 // findNearestCommonDominator on all CFG predecessors of each child of the 539 NearestDom = DT.findNearestCommonDominator(NearestDom, *PI);
|
H A D | ConstantHoisting.cpp | 252 BB = DT->findNearestCommonDominator(BB1, BB2);
|
H A D | StructurizeCFG.cpp | 612 Dominator = DT->findNearestCommonDominator(Dominator, BB);
|
H A D | IndVarSimplify.cpp | 210 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB);
|
H A D | LoopStrengthReduce.cpp | 2232 DT.findNearestCommonDominator(IVIncInsertPos->getParent(), 4491 BB = DT.findNearestCommonDominator(BB, ExitingBlocks[i]);
|
/external/llvm/lib/CodeGen/ |
H A D | SplitKit.cpp | 784 MDT.findNearestCommonDominator(Dom.first, ValMBB);
|
H A D | CodeGenPrepare.cpp | 468 BasicBlock *NewIDom = DT->findNearestCommonDominator(BBIDom, DestBBIDom);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
H A D | AMDILCFGStructurizer.cpp | 171 findNearestCommonDominator(MachineBasicBlock *A, MachineBasicBlock *B) { function in struct:llvm::MachinePostDominatorTree 172 return DT->findNearestCommonDominator(A, B); 2568 // This is work around solution for findNearestCommonDominator not avaiable to
|
/external/mesa3d/src/gallium/drivers/radeon/ |
H A D | AMDILCFGStructurizer.cpp | 171 findNearestCommonDominator(MachineBasicBlock *A, MachineBasicBlock *B) { function in struct:llvm::MachinePostDominatorTree 172 return DT->findNearestCommonDominator(A, B); 2568 // This is work around solution for findNearestCommonDominator not avaiable to
|