reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
2421 GroupByComplexity(Ops, &LI, DT); 2744 assert(DT.dominates( 2922 GroupByComplexity(Ops, &LI, DT); 3442 DT.dominates(L->getHeader(), NestedLoop->getHeader()))) { 3564 GroupByComplexity(Ops, &LI, DT); 4966 auto BO = MatchBinaryOp(BEValueV, DT); 5079 if (auto BO = MatchBinaryOp(BEValueV, DT)) { 5270 [&](BasicBlock *BB) { return DT.isReachableFromEntry(BB); }; 5291 BasicBlock *IDom = DT[PN->getParent()]->getIDom()->getBlock(); 5298 BrPHIToSelect(DT, BI, PN, Cond, LHS, RHS) && 5299 IsAvailableOnEntry(L, DT, getSCEV(LHS), PN->getParent()) && 5300 IsAvailableOnEntry(L, DT, getSCEV(RHS), PN->getParent())) 5318 if (Value *V = SimplifyInstruction(PN, {getDataLayout(), &TLI, &DT, &AC})) 5505 KnownBits Known = computeKnownBits(U->getValue(), getDataLayout(), 0, &AC, nullptr, &DT); 5712 KnownBits Known = computeKnownBits(U->getValue(), DL, 0, &AC, nullptr, &DT); 5720 unsigned NS = ComputeNumSignBits(U->getValue(), DL, 0, &AC, nullptr, &DT); 6143 if (!DT.isReachableFromEntry(I->getParent())) 6155 if (auto BO = MatchBinaryOp(U, DT)) { 6196 auto NewBO = MatchBinaryOp(BO->LHS, DT); 6226 auto NewBO = MatchBinaryOp(BO->LHS, DT); 6265 0, &AC, nullptr, &DT); 6454 if (auto BO = MatchBinaryOp(U->getOperand(0), DT)) { 6910 assert(SE->DT.dominates(ENT.ExitingBlock, Latch) && 7103 DT.dominates(ExitBB, Latch)) { 7136 if (!Latch || !DT.dominates(ExitingBlock, Latch)) 7675 Predecessor->getTerminator(), &DT); 8187 if (IsAvailableOnEntry(LI, DT, OnBackedge, PN->getParent())) 9137 assert((DT.dominates(L1->getHeader(), L2->getHeader()) || 9138 DT.dominates(L2->getHeader(), L1->getHeader())) && 9145 return DT.properlyDominates(L1->getHeader(), L2->getHeader()); 9507 if (!DT.dominates(CI, Latch->getTerminator())) 9517 if (!DT.isReachableFromEntry(L->getHeader())) 9523 for (DomTreeNode *DTN = DT[Latch], *HeaderDTN = DT[L->getHeader()]; 9523 for (DomTreeNode *DTN = DT[Latch], *HeaderDTN = DT[L->getHeader()]; 9550 assert(DT.dominates(DominatingEdge, Latch) && "should be!"); 9662 if (!DT.dominates(CI, L->getHeader())) 11422 : F(Arg.F), HasGuards(Arg.HasGuards), TLI(Arg.TLI), AC(Arg.AC), DT(Arg.DT), 11683 if (DT.dominates(L->getHeader(), AR->getLoop()->getHeader())) 11784 if (!DT.dominates(AR->getLoop()->getHeader(), BB)) 11824 if (DT.properlyDominates(I->getParent(), BB)) 11920 ScalarEvolution SE2(F, TLI, AC, DT, LI);lib/Analysis/ScalarEvolutionExpander.cpp
80 assert(SE.DT.dominates(Ret, &*BIP)); 512 SE.DT.dominates(cast<Instruction>(V), &*Builder.GetInsertPoint())); 638 L = PickMostRelevantLoop(L, getRelevantLoop(Op), SE.DT); 647 getRelevantLoop(D->getLHS()), getRelevantLoop(D->getRHS()), SE.DT); 702 llvm::stable_sort(OpsAndLoops, LoopCompare(SE.DT)); 771 llvm::stable_sort(OpsAndLoops, LoopCompare(SE.DT)); 908 if (!SE.DT.dominates(OInst, IVIncInsertPos)) 947 if (!OInst || SE.DT.dominates(OInst, InsertPos)) 958 if (!SE.DT.dominates(OInst, InsertPos)) 1002 if (SE.DT.dominates(IncV, InsertPos)) 1008 !SE.DT.dominates(InsertPos->getParent(), IncV->getParent())) 1023 if (SE.DT.dominates(IncV, InsertPos)) 1179 SE.DT.properlyDominates(LatchBlock, IVIncInsertLoop->getHeader()); 1238 hoistBeforePos(&SE.DT, IncV, IVIncInsertPos, AddRecPhiMatch); 1271 SE.DT.properlyDominates(cast<Instruction>(StartV)->getParent(), 1411 !SE.DT.dominates(cast<Instruction>(Result), 1797 SE.DT.dominates(EntInst, InsertPt) && 1972 if (Value *V = SimplifyInstruction(PN, {DL, &SE.TLI, &SE.DT, &SE.AC})) 2111 if (SE.getSCEV(LHS) == S && SE.DT.dominates(LHS, At)) 2114 if (SE.getSCEV(RHS) == S && SE.DT.dominates(RHS, At))