Lines Matching defs:LI
119 LoopInfo *LI, MemorySSAUpdater *MSSAU,
141 LI, MSSAU, PreserveLCSSA);
216 DominatorTree *DT, LoopInfo *LI,
273 DT, LI, MSSAU, PreserveLCSSA);
280 Loop *NewOuter = LI->AllocateLoop();
286 LI->changeTopLevelLoop(L, NewOuter);
324 if ((*LI)[BB] == L) {
325 LI->changeLoopFor(BB, NewOuter);
334 formDedicatedExitBlocks(L, DT, LI, MSSAU, PreserveLCSSA);
343 formLCSSA(*L, *DT, LI, SE);
345 assert(NewOuter->isRecursivelyLCSSAForm(*DT, *LI) &&
359 DominatorTree *DT, LoopInfo *LI,
465 L->addBasicBlockToLoop(BEBlock, *LI);
479 DominatorTree *DT, LoopInfo *LI,
542 Preheader = InsertPreheaderForLoop(L, DT, LI, MSSAU, PreserveLCSSA);
551 if (formDedicatedExitBlocks(L, DT, LI, MSSAU, PreserveLCSSA))
565 if (Loop *OuterL = separateNestedLoop(L, Preheader, DT, LI, SE,
583 LoopLatch = insertUniqueBackedgeBlock(L, Preheader, DT, LI, MSSAU);
601 if (!PreserveLCSSA || LI->replacementPreservesLCSSAForm(PN, V)) {
672 LI->removeBlock(ExitingBlock);
700 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
710 assert(LI && "LI not available.");
711 assert(L->isRecursivelyLCSSAForm(*DT, *LI) &&
729 Changed |= simplifyOneLoop(Worklist.pop_back_val(), Worklist, DT, LI, SE,
796 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
813 for (auto *L : *LI)
814 Changed |= simplifyLoop(L, DT, LI, SE, AC, MSSAU.get(), PreserveLCSSA);
819 *LI, [&](Loop *L) { return L->isRecursivelyLCSSAForm(*DT, *LI); });
829 LoopInfo *LI = &AM.getResult<LoopAnalysis>(F);
843 for (auto *L : *LI)
845 simplifyLoop(L, DT, LI, SE, AC, MSSAU.get(), /*PreserveLCSSA*/ false);
917 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I)