Searched defs:isReachableFromEntry (Results 1 - 4 of 4) sorted by relevance

/external/llvm/lib/IR/
H A DDominators.cpp86 if (!isReachableFromEntry(UseBB))
90 if (!isReachableFromEntry(DefBB))
122 if (!isReachableFromEntry(UseBB))
126 if (!isReachableFromEntry(DefBB))
231 if (!isReachableFromEntry(UseBB))
235 if (!isReachableFromEntry(DefBB))
268 bool DominatorTree::isReachableFromEntry(const Use &U) const { function in class:DominatorTree
277 return isReachableFromEntry(PN->getIncomingBlock(U));
280 return isReachableFromEntry(I->getParent());
/external/llvm/include/llvm/CodeGen/
H A DMachineDominators.h163 /// isReachableFromEntry - Return true if A is dominated by the entry
165 bool isReachableFromEntry(const MachineBasicBlock *A) { function in class:llvm::MachineDominatorTree
166 return DT->isReachableFromEntry(A);
/external/clang/include/clang/Analysis/Analyses/
H A DDominators.h144 bool isReachableFromEntry(const CFGBlock *A) { function in class:clang::DominatorTree
145 return DT->isReachableFromEntry(A);
/external/llvm/include/llvm/Support/
H A DGenericDomTree.h185 assert(isReachableFromEntry(B));
186 assert(isReachableFromEntry(A));
255 DT.isReachableFromEntry(ND)) {
266 if (DT.isReachableFromEntry(PredBlocks[i])) {
278 if (DT.isReachableFromEntry(PredBlocks[i]))
377 /// isReachableFromEntry - Return true if A is dominated by the entry
379 bool isReachableFromEntry(const NodeT* A) const { function in class:llvm::DominatorTreeBase
382 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
385 inline bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { function in class:llvm::DominatorTreeBase
399 if (!isReachableFromEntry(
[all...]

Completed in 64 milliseconds