| /NextBSD/contrib/llvm/lib/IR/ |
| HD | Dominators.cpp | 83 if (!isReachableFromEntry(UseBB)) in dominates() 87 if (!isReachableFromEntry(DefBB)) in dominates() 119 if (!isReachableFromEntry(UseBB)) in dominates() 123 if (!isReachableFromEntry(DefBB)) in dominates() 228 if (!isReachableFromEntry(UseBB)) in dominates() 232 if (!isReachableFromEntry(DefBB)) in dominates() 265 bool DominatorTree::isReachableFromEntry(const Use &U) const { in isReachableFromEntry() function in DominatorTree 274 return isReachableFromEntry(PN->getIncomingBlock(U)); in isReachableFromEntry() 277 return isReachableFromEntry(I->getParent()); in isReachableFromEntry()
|
| HD | Verifier.cpp | 2846 Assert(U != (User *)&I || !DT.isReachableFromEntry(BB), in visitInstruction()
|
| /NextBSD/contrib/llvm/include/llvm/Support/ |
| HD | GenericDomTree.h | 193 assert(isReachableFromEntry(B)); in dominatedBySlowTreeWalk() 194 assert(isReachableFromEntry(A)); in dominatedBySlowTreeWalk() 277 DT.isReachableFromEntry(ND)) { in Split() 288 if (DT.isReachableFromEntry(PredBlocks[i])) { in Split() 300 if (DT.isReachableFromEntry(PredBlocks[i])) in Split() 427 bool isReachableFromEntry(const NodeT *A) const { in isReachableFromEntry() function 430 return isReachableFromEntry(getNode(const_cast<NodeT *>(A))); in isReachableFromEntry() 433 bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; } in isReachableFromEntry() function 445 if (!isReachableFromEntry(B)) in dominates() 449 if (!isReachableFromEntry(A)) in dominates()
|
| /NextBSD/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
| HD | Dominators.h | 142 bool isReachableFromEntry(const CFGBlock *A) { in isReachableFromEntry() function 143 return DT->isReachableFromEntry(A); in isReachableFromEntry()
|
| /NextBSD/contrib/llvm/include/llvm/IR/ |
| HD | Dominators.h | 109 using Base::isReachableFromEntry; 112 bool isReachableFromEntry(const Use &U) const;
|
| /NextBSD/contrib/llvm/include/llvm/CodeGen/ |
| HD | MachineDominators.h | 212 bool isReachableFromEntry(const MachineBasicBlock *A) { in isReachableFromEntry() function 214 return DT->isReachableFromEntry(A); in isReachableFromEntry()
|
| /NextBSD/contrib/llvm/lib/Analysis/ |
| HD | CFG.cpp | 134 if (DT && !DT->isReachableFromEntry(StopBB)) in isPotentiallyReachableFromMany()
|
| HD | CaptureTracking.cpp | 129 if (BeforeHere != I && !DT->isReachableFromEntry(BB)) in isSafeToPrune()
|
| HD | MemoryDependenceAnalysis.cpp | 1139 } else if (DT->isReachableFromEntry(I->getBB())) { in getNonLocalPointerDepFromBB() 1211 } else if (DT->isReachableFromEntry(BB)) { in getNonLocalPointerDepFromBB() 1396 assert((I->getResult().isNonLocal() || !DT->isReachableFromEntry(BB)) && in getNonLocalPointerDepFromBB()
|
| HD | PHITransAddr.cpp | 320 if (DT && DT->isReachableFromEntry(PredBB)) in PHITranslateValue()
|
| HD | LoopInfo.cpp | 188 DT.isReachableFromEntry(UserBB)) in isLCSSAForm()
|
| HD | InstructionSimplify.cpp | 118 if (!DT->isReachableFromEntry(P->getParent())) in ValueDominatesPHI() 120 if (!DT->isReachableFromEntry(I->getParent())) in ValueDominatesPHI()
|
| HD | ScalarEvolution.cpp | 4107 if (!DT->isReachableFromEntry(I->getParent())) in createSCEV() 6752 if (!DT->isReachableFromEntry(L->getHeader())) in isLoopBackedgeGuardedByCond()
|
| /NextBSD/contrib/llvm/include/llvm/Analysis/ |
| HD | LoopInfoImpl.h | 362 if (!DomTree.isReachableFromEntry(PredBB)) in discoverAndMapSubloop() 490 && DomTree.isReachableFromEntry(Backedge)) { in Analyze()
|
| /NextBSD/contrib/llvm/lib/Transforms/Scalar/ |
| HD | Sink.cpp | 127 if (!DT->isReachableFromEntry(&BB)) return false; in ProcessBlock()
|
| HD | DeadStoreElimination.cpp | 71 if (DT->isReachableFromEntry(I)) in runOnFunction() 638 if (DT->isReachableFromEntry(Pred)) in FindUnconditionalPreds()
|
| HD | LICM.cpp | 607 if (!DT->isReachableFromEntry(User->getParent())) { in sink() 619 if (!DT->isReachableFromEntry(BB)) { in sink()
|
| HD | RewriteStatepointsForGC.cpp | 2261 assert(DT.isReachableFromEntry(info.StatepointToken->getParent()) && in insertParsePoints() 2268 assert(DT.isReachableFromEntry(LiveInst->getParent()) && in insertParsePoints() 2401 if (DT.isReachableFromEntry(I.getParent())) in runOnFunction()
|
| HD | GVN.cpp | 2511 } else if (!DT->isReachableFromEntry(P)) { in performScalarPRE()
|
| /NextBSD/contrib/llvm/lib/CodeGen/ |
| HD | StackProtector.cpp | 439 if (DT && DT->isReachableFromEntry(BB)) { in InsertStackProtectors()
|
| HD | MachineSink.cpp | 317 if (!DT->isReachableFromEntry(&MBB)) return false; in ProcessBlock()
|
| /NextBSD/contrib/llvm/lib/Transforms/ObjCARC/ |
| HD | ObjCARCContract.cpp | 569 if (DT->isReachableFromEntry(U) && DT->dominates(Inst, U)) { in runOnFunction()
|
| /NextBSD/contrib/llvm/lib/Target/PowerPC/ |
| HD | PPCCTRLoops.cpp | 681 if (!MDT->isReachableFromEntry(MBB)) in runOnMachineFunction()
|
| /NextBSD/contrib/llvm/lib/Transforms/Vectorize/ |
| HD | SLPVectorizer.cpp | 1055 if (!DT->isReachableFromEntry(BB)) { in buildTree_rec() 2623 assert(DT->isReachableFromEntry(N)); in optimizeGatherSequence()
|
| HD | BBVectorize.cpp | 397 if (!DT->isReachableFromEntry(&BB)) { in vectorizeBB()
|