HomeSort by relevance Sort by last modified time
    Searched defs:isReachableFromEntry (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/IR/
Dominators.cpp 105 if (!isReachableFromEntry(UseBB))
109 if (!isReachableFromEntry(DefBB))
141 if (!isReachableFromEntry(UseBB))
145 if (!isReachableFromEntry(DefBB))
252 if (!isReachableFromEntry(UseBB))
256 if (!isReachableFromEntry(DefBB))
289 bool DominatorTree::isReachableFromEntry(const Use &U) const {
298 return isReachableFromEntry(PN->getIncomingBlock(U));
301 return isReachableFromEntry(I->getParent());
  /external/clang/include/clang/Analysis/Analyses/
Dominators.h 138 bool isReachableFromEntry(const CFGBlock *A) {
139 return DT->isReachableFromEntry(A);
  /external/llvm/include/llvm/CodeGen/
MachineDominators.h 163 /// isReachableFromEntry - Return true if A is dominated by the entry
165 bool isReachableFromEntry(const MachineBasicBlock *A) {
166 return DT->isReachableFromEntry(A);
  /external/llvm/include/llvm/Analysis/
Dominators.h 191 assert(isReachableFromEntry(B));
192 assert(isReachableFromEntry(A));
261 DT.isReachableFromEntry(ND)) {
272 if (DT.isReachableFromEntry(PredBlocks[i])) {
284 if (DT.isReachableFromEntry(PredBlocks[i]))
363 /// isReachableFromEntry - Return true if A is dominated by the entry
365 bool isReachableFromEntry(const NodeT* A) const {
368 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
371 inline bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const {
385 if (!isReachableFromEntry(B)
    [all...]

Completed in 370 milliseconds