| /openbsd/src/gnu/llvm/llvm/lib/IR/ |
| D | Dominators.cpp | 148 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()
364 if (!isReachableFromEntry(BB2)) in findNearestCommonDominator()
[all …]
|
| /openbsd/src/gnu/llvm/llvm/lib/Analysis/ |
| D | CFG.cpp | 139 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()
|
| D | FunctionPropertiesAnalysis.cpp | 93 if (DT.isReachableFromEntry(&BB)) in getFunctionPropertiesInfo()
214 if (DT.isReachableFromEntry(Succ)) in finish()
244 if (!DT.isReachableFromEntry(Succ)) in finish()
|
| D | DivergenceAnalysis.cpp | 294 if (!DT.isReachableFromEntry(Term.getParent())) in analyzeControlDivergence()
|
| D | LegacyDivergenceAnalysis.cpp | 160 if (!DT.isReachableFromEntry(ThisBB)) in exploreSyncDependency()
|
| D | CaptureTracking.cpp | 122 if (!DT->isReachableFromEntry(I->getParent())) in isSafeToPrune()
|
| D | MemorySSAUpdater.cpp | 46 if (!MSSA->DT->isReachableFromEntry(BB)) in getPreviousDefRecursive()
76 if (MSSA->DT->isReachableFromEntry(Pred)) { in getPreviousDefRecursive()
309 if (!MSSA->DT->isReachableFromEntry(MD->getBlock())) { in insertDef()
|
| D | MemoryDependenceAnalysis.cpp | 1156 if (DT.isReachableFromEntry(Entry.getBB())) { in getNonLocalPointerDepFromBB()
1230 if (DT.isReachableFromEntry(BB)) { in getNonLocalPointerDepFromBB()
1426 !DT.isReachableFromEntry(BB)) && in getNonLocalPointerDepFromBB()
|
| D | PHITransAddr.cpp | 319 if (DT && DT->isReachableFromEntry(PredBB)) in PHITranslateValue()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/Support/ |
| D | GenericDomTree.h | 421 bool isReachableFromEntry(const NodeT *A) const {
424 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
427 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
439 if (!isReachableFromEntry(B))
443 if (!isReachableFromEntry(A))
865 isReachableFromEntry(Pred)) {
876 if (isReachableFromEntry(PredBlocks[i])) {
887 if (isReachableFromEntry(PredBlocks[i]))
906 assert(isReachableFromEntry(B));
907 assert(isReachableFromEntry(A));
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| D | MachineDominators.h | 220 bool isReachableFromEntry(const MachineBasicBlock *A) { in isReachableFromEntry() function
222 return DT->isReachableFromEntry(A); in isReachableFromEntry()
|
| /openbsd/src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| D | Sink.cpp | 135 if (!DT.isReachableFromEntry(UseBlock)) in SinkInstruction()
180 if (!DT.isReachableFromEntry(&BB)) return false; in ProcessBlock()
|
| D | InstSimplifyPass.cpp | 38 if (!SQ.DT->isReachableFromEntry(&BB)) in runImpl()
|
| D | LoopInstSimplify.cpp | 109 if (!DT.isReachableFromEntry(UserI->getParent())) in simplifyLoopInst()
|
| D | TLSVariableHoist.cpp | 142 if (!DT->isReachableFromEntry(&BB)) in collectTLSCandidates()
|
| D | GuardWidening.cpp | 482 assert(DT.isReachableFromEntry(Inst->getParent()) && in isAvailableAt()
627 assert((!BaseInst || DT.isReachableFromEntry(BaseInst->getParent())) && in parseRangeChecks()
|
| D | ConstantHoisting.cpp | 224 if (!DT.isReachableFromEntry(BB)) in findBestInsertionSet()
523 if (!DT->isReachableFromEntry(&BB)) in collectConstantCandidates()
|
| /openbsd/src/gnu/llvm/clang/include/clang/Analysis/Analyses/ |
| D | Dominators.h | 165 bool isReachableFromEntry(const CFGBlock *A) { in isReachableFromEntry() function
166 return DT.isReachableFromEntry(A); in isReachableFromEntry()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/IR/ |
| D | Dominators.h | 217 using Base::isReachableFromEntry;
220 bool isReachableFromEntry(const Use &U) const;
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/PowerPC/ |
| D | PPCCTRLoopsVerify.cpp | 170 if (!MDT->isReachableFromEntry(&MBB)) in runOnMachineFunction()
|
| /openbsd/src/gnu/llvm/llvm/tools/llvm-reduce/deltas/ |
| D | ReduceInstructionsMIR.cpp | 111 if (MDT.isReachableFromEntry(BB)) { in extractInstrFromFunction()
|
| /openbsd/src/gnu/llvm/llvm/lib/Transforms/Utils/ |
| D | SSAUpdaterBulk.cpp | 73 if (DT->isReachableFromEntry(BB) && PredCache.get(BB).size()) { in computeValueAt()
|
| D | FixIrreducible.cpp | 294 if (!DT.isReachableFromEntry(P)) in makeReducible()
|
| D | LCSSA.cpp | 115 if (!DT.isReachableFromEntry(UserBB)) { in formLCSSAForInstructions()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/Analysis/ |
| D | LoopInfoImpl.h | 454 if (!DomTree.isReachableFromEntry(PredBB)) in discoverAndMapSubloop()
569 DomTree.isReachableFromEntry(Backedge)) { in analyze()
|