Lines Matching refs:DT
123 BasicBlock *llvm::InsertPreheaderForLoop(Loop *L, DominatorTree *DT,
147 PreheaderBB = SplitBlockPredecessors(Header, OutsideBlocks, ".preheader", DT,
183 static PHINode *findPHIToPartitionLoops(Loop *L, DominatorTree *DT,
189 if (Value *V = SimplifyInstruction(PN, {DL, nullptr, DT, AC})) {
226 DominatorTree *DT, LoopInfo *LI,
237 PHINode *PN = findPHIToPartitionLoops(L, DT, AC);
262 DT, LI, MSSAU, PreserveLCSSA);
293 if (DT->dominates(Header, P))
325 formDedicatedExitBlocks(L, DT, LI, MSSAU, PreserveLCSSA);
334 formLCSSA(*L, *DT, LI, SE);
336 assert(NewOuter->isRecursivelyLCSSAForm(*DT, *LI) &&
350 DominatorTree *DT, LoopInfo *LI,
462 DT->splitBlock(BEBlock);
473 DominatorTree *DT, LoopInfo *LI,
539 Preheader = InsertPreheaderForLoop(L, DT, LI, MSSAU, PreserveLCSSA);
548 if (formDedicatedExitBlocks(L, DT, LI, MSSAU, PreserveLCSSA))
562 if (Loop *OuterL = separateNestedLoop(L, Preheader, DT, LI, SE,
580 LoopLatch = insertUniqueBackedgeBlock(L, Preheader, DT, LI, MSSAU);
596 if (Value *V = SimplifyInstruction(PN, {DL, nullptr, DT, AC})) {
676 DomTreeNode *Node = DT->getNode(ExitingBlock);
681 DT->changeImmediateDominator(Child, Node->getIDom());
683 DT->eraseNode(ExitingBlock);
710 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
719 assert(DT && "DT not available.");
721 assert(L->isRecursivelyLCSSAForm(*DT, *LI) &&
739 Changed |= simplifyOneLoop(Worklist.pop_back_val(), Worklist, DT, LI, SE,
801 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
820 Changed |= simplifyLoop(*I, DT, LI, SE, AC, MSSAU.get(), PreserveLCSSA);
825 *LI, [&](Loop *L) { return L->isRecursivelyLCSSAForm(*DT, *LI); });
836 DominatorTree *DT = &AM.getResult<DominatorTreeAnalysis>(F);
851 simplifyLoop(*I, DT, LI, SE, AC, MSSAU.get(), /*PreserveLCSSA*/ false);