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 83 if (!isReachableFromEntry(UseBB))
87 if (!isReachableFromEntry(DefBB))
119 if (!isReachableFromEntry(UseBB))
123 if (!isReachableFromEntry(DefBB))
230 if (!isReachableFromEntry(UseBB))
234 if (!isReachableFromEntry(DefBB))
267 bool DominatorTree::isReachableFromEntry(const Use &U) const {
276 return isReachableFromEntry(PN->getIncomingBlock(U));
279 return isReachableFromEntry(I->getParent());
  /external/clang/include/clang/Analysis/Analyses/
Dominators.h 142 bool isReachableFromEntry(const CFGBlock *A) {
143 return DT->isReachableFromEntry(A);
  /external/llvm/include/llvm/CodeGen/
MachineDominators.h 210 /// isReachableFromEntry - Return true if A is dominated by the entry
212 bool isReachableFromEntry(const MachineBasicBlock *A) {
214 return DT->isReachableFromEntry(A);
  /external/llvm/include/llvm/Support/
GenericDomTree.h 193 assert(isReachableFromEntry(B));
194 assert(isReachableFromEntry(A));
277 DT.isReachableFromEntry(ND)) {
288 if (DT.isReachableFromEntry(PredBlocks[i])) {
300 if (DT.isReachableFromEntry(PredBlocks[i]))
427 /// isReachableFromEntry - Return true if A is dominated by the entry
429 bool isReachableFromEntry(const NodeT *A) const {
432 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
435 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
447 if (!isReachableFromEntry(B)
    [all...]

Completed in 569 milliseconds