Home
last modified time | relevance | path

Searched refs:isPotentiallyReachable (Results 1 – 8 of 8) sorted by relevance

/external/llvm/unittests/Analysis/
DCFGTest.cpp94 EXPECT_EQ(isPotentiallyReachable(A, B, nullptr, nullptr), in ExpectPath()
96 EXPECT_EQ(isPotentiallyReachable(A, B, DT, nullptr), ExpectedResult); in ExpectPath()
97 EXPECT_EQ(isPotentiallyReachable(A, B, nullptr, LI), ExpectedResult); in ExpectPath()
98 EXPECT_EQ(isPotentiallyReachable(A, B, DT, LI), ExpectedResult); in ExpectPath()
/external/llvm/include/llvm/Analysis/
DCFG.h67 bool isPotentiallyReachable(const Instruction *From, const Instruction *To,
77 bool isPotentiallyReachable(const BasicBlock *From, const BasicBlock *To,
/external/llvm/lib/Analysis/
DCFG.cpp174 bool llvm::isPotentiallyReachable(const BasicBlock *A, const BasicBlock *B, in isPotentiallyReachable() function in llvm
186 bool llvm::isPotentiallyReachable(const Instruction *A, const Instruction *B, in isPotentiallyReachable() function in llvm
DCaptureTracking.cpp112 !isPotentiallyReachable(I, BeforeHere, DT)) in isSafeToPrune()
DBasicAliasAnalysis.cpp1566 if (isPotentiallyReachable(&P->front(), Inst, DT, LI)) in isValueEqualInPotentialCycles()
/external/llvm/lib/CodeGen/
DDwarfEHPrepare.cpp146 if (isPotentiallyReachable(LP, RI, DT)) { in pruneUnreachableResumes()
/external/llvm/lib/Transforms/Scalar/
DPlaceSafepoints.cpp659 assert(isPotentiallyReachable(&*Start, &*After) && in INITIALIZE_PASS_DEPENDENCY()
/external/llvm/lib/Transforms/InstCombine/
DInstructionCombining.cpp831 if (isPotentiallyReachable(I.getParent(), NonConstBB, DT, LI)) in FoldOpIntoPhi()