Searched refs:getLoopsInPreorder (Results 1 – 12 of 12) sorted by relevance
88 for (auto *L : LI->getLoopsInPreorder()) in warnAboutLeftoverTransformations()
340 SmallVector<Loop *, 4> PreorderLoops = LI.getLoopsInPreorder(); in run()
108 for (Loop *L : Root.getLoopsInPreorder()) { in partitionOuterLoopBlocks()764 for (Loop *L : Root.getLoopsInPreorder()) in checkDependencies()768 for (Loop *L : Root.getLoopsInPreorder()) in checkDependencies()945 if (any_of(L->getLoopsInPreorder(), [&SE](Loop *SubLoop) { in isSafeToUnrollAndJam()
215 auto Loops = LI.getLoopsInPreorder(); in runImpl()
937 for (Loop *CurLoop : OrigLoop->getLoopsInPreorder()) { in cloneLoopWithPreheader()
377 SmallVector<const LoopT *, 4> getLoopsInPreorder() const { in getLoopsInPreorder() function384 SmallVector<LoopT *, 4> getLoopsInPreorder() { in getLoopsInPreorder() function975 SmallVector<LoopT *, 4> getLoopsInPreorder() const;
575 LoopInfoBase<BlockT, LoopT>::getLoopsInPreorder() const { in getLoopsInPreorder() function583 auto PreOrderLoopsInRootL = RootL->getLoopsInPreorder(); in getLoopsInPreorder()
1069 for (MachineLoop *ML : MLI->getBase().getLoopsInPreorder()) { in runOnMachineFunction()
485 SmallVector<Loop *, 4> Loops = LI.getLoopsInPreorder(); in promoteCounterLoadStores()
211 auto Preorder = LI.getLoopsInPreorder(); in TEST()
130 for (auto &L : LI->getLoopsInPreorder()) { in runOnMachineFunction()
2861 for (auto *L : LI->getLoopsInPreorder()) { in mayContainUnboundedCycle()