Home
last modified time | relevance | path

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

123

/llvm-project-15.0.7/llvm/lib/IR/
H A DDominators.cpp148 if (!isReachableFromEntry(UseBB)) in dominates()
152 if (!isReachableFromEntry(DefBB)) in dominates()
179 if (!isReachableFromEntry(UseBB)) in dominates()
183 if (!isReachableFromEntry(DefBB)) in dominates()
296 if (!isReachableFromEntry(UseBB)) in dominates()
300 if (!isReachableFromEntry(DefBB)) in dominates()
335 bool DominatorTree::isReachableFromEntry(const Use &U) const { in isReachableFromEntry() function in DominatorTree
344 return isReachableFromEntry(PN->getIncomingBlock(U)); in isReachableFromEntry()
347 return isReachableFromEntry(I->getParent()); in isReachableFromEntry()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCFG.cpp139 if (DT && !DT->isReachableFromEntry(StopBB)) in isPotentiallyReachableFromMany()
215 if (DT->isReachableFromEntry(A) && !DT->isReachableFromEntry(B)) in isPotentiallyReachable()
218 if (A->isEntryBlock() && DT->isReachableFromEntry(B)) in isPotentiallyReachable()
220 if (B->isEntryBlock() && DT->isReachableFromEntry(A)) in isPotentiallyReachable()
H A DFunctionPropertiesAnalysis.cpp93 if (DT.isReachableFromEntry(&BB)) in getFunctionPropertiesInfo()
214 if (DT.isReachableFromEntry(Succ)) in finish()
244 if (!DT.isReachableFromEntry(Succ)) in finish()
H A DLegacyDivergenceAnalysis.cpp160 if (!DT.isReachableFromEntry(ThisBB)) in exploreSyncDependency()
H A DDivergenceAnalysis.cpp294 if (!DT.isReachableFromEntry(Term.getParent())) in analyzeControlDivergence()
H A DCaptureTracking.cpp122 if (!DT->isReachableFromEntry(I->getParent())) in isSafeToPrune()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DGenericDomTree.h405 bool isReachableFromEntry(const NodeT *A) const {
408 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
411 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
423 if (!isReachableFromEntry(B))
427 if (!isReachableFromEntry(A))
848 isReachableFromEntry(Pred)) {
859 if (isReachableFromEntry(PredBlocks[i])) {
870 if (isReachableFromEntry(PredBlocks[i]))
889 assert(isReachableFromEntry(B));
890 assert(isReachableFromEntry(A));
/llvm-project-15.0.7/llvm/test/Transforms/RewriteStatepointsForGC/
H A Dunreachable-regression.ll8 ; DominatorTree::isReachableFromEntry(), i.e. removeUnreachableBlocks
9 ; can remove some blocks for which isReachableFromEntry() returns true.
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineDominators.h220 bool isReachableFromEntry(const MachineBasicBlock *A) { in isReachableFromEntry() function
222 return DT->isReachableFromEntry(A); in isReachableFromEntry()
/llvm-project-15.0.7/mlir/lib/IR/
H A DDominance.cpp232 bool DominanceInfoBase<IsPostDom>::isReachableFromEntry(Block *a) const { in isReachableFromEntry() function in DominanceInfoBase
239 return getDomTree(region).isReachableFromEntry(a); in isReachableFromEntry()
H A DVerifier.cpp336 bool isReachable = domInfo.isReachableFromEntry(&block); in verifyDominanceOfContainedRegions()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DSink.cpp134 if (!DT.isReachableFromEntry(UseBlock)) in SinkInstruction()
182 if (!DT.isReachableFromEntry(&BB)) return false; in ProcessBlock()
H A DInstSimplifyPass.cpp38 if (!SQ.DT->isReachableFromEntry(&BB)) in runImpl()
H A DLoopInstSimplify.cpp108 if (!DT.isReachableFromEntry(UserI->getParent())) in simplifyLoopInst()
H A DTLSVariableHoist.cpp142 if (!DT->isReachableFromEntry(&BB)) in collectTLSCandidates()
H A DGuardWidening.cpp480 assert(DT.isReachableFromEntry(Inst->getParent()) && in isAvailableAt()
624 assert((!BaseInst || DT.isReachableFromEntry(BaseInst->getParent())) && in parseRangeChecks()
/llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/
H A DDominators.h165 bool isReachableFromEntry(const CFGBlock *A) { in isReachableFromEntry() function
166 return DT.isReachableFromEntry(A); in isReachableFromEntry()
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DDominators.h213 using Base::isReachableFromEntry;
216 bool isReachableFromEntry(const Use &U) const;
/llvm-project-15.0.7/llvm/lib/Target/PowerPC/
H A DPPCCTRLoopsVerify.cpp170 if (!MDT->isReachableFromEntry(&MBB)) in runOnMachineFunction()
/llvm-project-15.0.7/llvm/tools/llvm-reduce/deltas/
H A DReduceInstructionsMIR.cpp110 if (MDT.isReachableFromEntry(BB)) { in extractInstrFromFunction()
/llvm-project-15.0.7/llvm/unittests/IR/
H A DDominatorTreeTest.cpp135 EXPECT_TRUE(DT->isReachableFromEntry(BB0)); in TEST()
136 EXPECT_TRUE(DT->isReachableFromEntry(BB1)); in TEST()
137 EXPECT_TRUE(DT->isReachableFromEntry(BB2)); in TEST()
138 EXPECT_FALSE(DT->isReachableFromEntry(BB3)); in TEST()
139 EXPECT_TRUE(DT->isReachableFromEntry(BB4)); in TEST()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DSSAUpdaterBulk.cpp73 if (DT->isReachableFromEntry(BB) && PredCache.get(BB).size()) { in computeValueAt()
H A DFixIrreducible.cpp294 if (!DT.isReachableFromEntry(P)) in makeReducible()
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DDominance.h72 bool isReachableFromEntry(Block *a) const;
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h442 if (!DomTree.isReachableFromEntry(PredBB)) in discoverAndMapSubloop()
557 DomTree.isReachableFromEntry(Backedge)) { in analyze()

123