Home
last modified time | relevance | path

Searched refs:isReachableFromEntry (Results 1 – 16 of 16) sorted by relevance

/external/llvm/lib/VMCore/
DDominators.cpp92 if (!isReachableFromEntry(UseBB)) in dominates()
96 if (!isReachableFromEntry(DefBB)) in dominates()
128 if (!isReachableFromEntry(UseBB)) in dominates()
132 if (!isReachableFromEntry(DefBB)) in dominates()
179 if (!DT->isReachableFromEntry(BB)) in dominates()
208 if (!isReachableFromEntry(UseBB)) in dominates()
212 if (!isReachableFromEntry(DefBB)) in dominates()
253 bool DominatorTree::isReachableFromEntry(const Use &U) const { in isReachableFromEntry() function in DominatorTree
262 return isReachableFromEntry(PN->getIncomingBlock(U)); in isReachableFromEntry()
265 return isReachableFromEntry(I->getParent()); in isReachableFromEntry()
DVerifier.cpp1536 Assert2(InstsInThisBlock.count(Op) || !DT->isReachableFromEntry(BB) || in verifyDominatesUse()
1560 Assert2(BB == NormalDest || !DT->isReachableFromEntry(UseBlock), in verifyDominatesUse()
1565 !DT->isReachableFromEntry(UseBlock), in verifyDominatesUse()
1575 !DT->isReachableFromEntry(PredBB)), in verifyDominatesUse()
1588 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB), in visitInstruction()
/external/llvm/include/llvm/Analysis/
DDominators.h191 assert(isReachableFromEntry(B)); in dominatedBySlowTreeWalk()
192 assert(isReachableFromEntry(A)); in dominatedBySlowTreeWalk()
261 DT.isReachableFromEntry(ND)) { in Split()
272 if (DT.isReachableFromEntry(PredBlocks[i])) { in Split()
284 if (DT.isReachableFromEntry(PredBlocks[i])) in Split()
365 bool isReachableFromEntry(const NodeT* A) const { in isReachableFromEntry() function
368 return isReachableFromEntry(getNode(const_cast<NodeT *>(A))); in isReachableFromEntry()
371 inline bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { in isReachableFromEntry() function
385 if (!isReachableFromEntry(B)) in dominates()
389 if (!isReachableFromEntry(A)) in dominates()
[all …]
DLoopInfo.h769 if (DT.dominates(BB, N) && DT.isReachableFromEntry(N)) in ConsiderForLoop()
784 DT.isReachableFromEntry(X)) { in ConsiderForLoop()
/external/llvm/unittests/VMCore/
DDominatorTreeTest.cpp47 EXPECT_TRUE(DT->isReachableFromEntry(BB0)); in runOnFunction()
48 EXPECT_TRUE(DT->isReachableFromEntry(BB1)); in runOnFunction()
49 EXPECT_TRUE(DT->isReachableFromEntry(BB2)); in runOnFunction()
50 EXPECT_FALSE(DT->isReachableFromEntry(BB3)); in runOnFunction()
51 EXPECT_TRUE(DT->isReachableFromEntry(BB4)); in runOnFunction()
/external/llvm/include/llvm/CodeGen/
DMachineDominators.h163 bool isReachableFromEntry(MachineBasicBlock *A) { in isReachableFromEntry() function
164 return DT->isReachableFromEntry(A); in isReachableFromEntry()
/external/clang/include/clang/Analysis/Analyses/
DDominators.h139 bool isReachableFromEntry(const CFGBlock *A) { in isReachableFromEntry() function
140 return DT->isReachableFromEntry(A); in isReachableFromEntry()
/external/llvm/lib/Transforms/Scalar/
DSink.cpp125 if (!DT->isReachableFromEntry(&BB)) return false; in ProcessBlock()
DDeadStoreElimination.cpp63 if (DT->isReachableFromEntry(I)) in runOnFunction()
632 if (DT->isReachableFromEntry(Pred)) in FindUnconditionalPreds()
DObjCARC.cpp4150 if (DT->isReachableFromEntry(U) && in runOnFunction()
/external/llvm/lib/CodeGen/
DStackProtector.cpp215 if (DT && DT->isReachableFromEntry(BB)) { in InsertStackProtectors()
DMachineSink.cpp249 if (!DT->isReachableFromEntry(&MBB)) return false; in ProcessBlock()
/external/llvm/lib/Analysis/
DLoopInfo.cpp191 DT.isReachableFromEntry(UserBB)) in isLCSSAForm()
DMemoryDependenceAnalysis.cpp355 (!DT->isReachableFromEntry(BB) || DT->dominates(BeforeHere, I))) in shouldExplore()
364 (!DT->isReachableFromEntry(BB) || DT->dominates(BeforeHere, I))) in captured()
DInstructionSimplify.cpp107 if (!DT->isReachableFromEntry(P->getParent())) in ValueDominatesPHI()
109 if (!DT->isReachableFromEntry(I->getParent())) in ValueDominatesPHI()
DScalarEvolution.cpp3582 if (!DT->isReachableFromEntry(I->getParent())) in createSCEV()