Searched refs:findNearestCommonDominator (Results 1 – 12 of 12) sorted by relevance
| /external/clang/include/clang/Analysis/Analyses/ |
| D | Dominators.h | 119 inline CFGBlock *findNearestCommonDominator(CFGBlock *A, CFGBlock *B) { in findNearestCommonDominator() function
120 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
123 inline const CFGBlock *findNearestCommonDominator(const CFGBlock *A, in findNearestCommonDominator() function
125 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachinePostDominators.h | 76 MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A, in findNearestCommonDominator() function
78 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
|
| D | MachineDominators.h | 113 inline MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A, in findNearestCommonDominator() function
115 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
|
| /external/llvm/include/llvm/Analysis/ |
| D | PostDominators.h | 73 inline BasicBlock *findNearestCommonDominator(BasicBlock *A, BasicBlock *B) { in findNearestCommonDominator() function
74 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
|
| D | Dominators.h | 285 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]); in Split()
423 NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) { in findNearestCommonDominator() function
467 const NodeT *findNearestCommonDominator(const NodeT *A, const NodeT *B) { in findNearestCommonDominator() function
470 return findNearestCommonDominator(const_cast<NodeT *>(A), in findNearestCommonDominator()
808 inline BasicBlock *findNearestCommonDominator(BasicBlock *A, BasicBlock *B) { in findNearestCommonDominator() function
809 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
812 inline const BasicBlock *findNearestCommonDominator(const BasicBlock *A, in findNearestCommonDominator() function
814 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
|
| /external/llvm/lib/CodeGen/ |
| D | StackProtector.cpp | 332 FailBBDom = FailBBDom ? DT->findNearestCommonDominator(FailBBDom, BB) :BB; in InsertStackProtectors()
|
| D | SplitKit.cpp | 782 MDT.findNearestCommonDominator(Dom.first, ValMBB); in hoistCopiesForSize()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopRotation.cpp | 479 NearestDom = DT->findNearestCommonDominator(NearestDom, *PI); in rotateLoop()
|
| D | IndVarSimplify.cpp | 206 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB); in getInsertPointForUses()
|
| D | CodeGenPrepare.cpp | 438 BasicBlock *NewIDom = DT->findNearestCommonDominator(BBIDom, DestBBIDom); in EliminateMostlyEmptyBlock()
|
| D | LoopStrengthReduce.cpp | 2070 DT.findNearestCommonDominator(IVIncInsertPos->getParent(), in OptimizeLoopTermCond()
4232 BB = DT.findNearestCommonDominator(BB, ExitingBlocks[i]); in AdjustInsertPositionForExpand()
|
| /external/llvm/lib/Target/R600/ |
| D | AMDGPUStructurizeCFG.cpp | 618 Dominator = DT->findNearestCommonDominator(Dominator, BB); in changeExit()
|