Searched refs:SubLoops (Results 1 – 5 of 5) sorted by relevance
249 auto &SubLoops = L->getSubLoops(); in getPerfectLoops() local250 if (SubLoops.size() == 1 && arePerfectlyNested(*L, *SubLoops.front(), SE)) { in getPerfectLoops()251 PerfectNest.push_back(SubLoops.front()); in getPerfectLoops()266 const auto *SubLoops = &CurrentLoop->getSubLoops(); in getMaxPerfectDepth() local269 while (SubLoops->size() == 1) { in getMaxPerfectDepth()270 const Loop *InnerLoop = SubLoops->front(); in getMaxPerfectDepth()281 SubLoops = &CurrentLoop->getSubLoops(); in getMaxPerfectDepth()
62 std::vector<LoopT *> SubLoops; variable147 return SubLoops; in getSubLoops()151 return SubLoops; in getSubLoopsVector()395 SubLoops.push_back(NewChild); in addChildLoop()402 assert(I != SubLoops.end() && "Cannot remove end iterator!"); in removeChildLoop()405 SubLoops.erase(SubLoops.begin() + (I - begin())); in removeChildLoop()502 for (auto *SubLoop : SubLoops) in ~LoopBase()508 SubLoops.clear(); in ~LoopBase()
317 typename std::vector<LoopT *>::iterator I = find(SubLoops, OldChild); in replaceChildLoopWith()318 assert(I != SubLoops.end() && "OldChild not in loop!"); in replaceChildLoopWith()
305 const std::vector<Loop*> &SubLoops = L->getSubLoops(); in separateNestedLoop() local306 for (size_t I = 0; I != SubLoops.size(); ) in separateNestedLoop()307 if (BlocksInL.count(SubLoops[I]->getHeader())) in separateNestedLoop()310 NewOuter->addChildLoop(L->removeChildLoop(SubLoops.begin() + I)); in separateNestedLoop()
2071 auto &SubLoops = L.getSubLoopsVector(); in rebuildLoopAfterUnswitch() local2074 ? SubLoops.begin() in rebuildLoopAfterUnswitch()2076 SubLoops.begin(), SubLoops.end(), [&](Loop *SubL) { in rebuildLoopAfterUnswitch()2079 for (auto *HoistedL : make_range(SubLoopsSplitI, SubLoops.end())) { in rebuildLoopAfterUnswitch()2096 SubLoops.erase(SubLoopsSplitI, SubLoops.end()); in rebuildLoopAfterUnswitch()2100 assert(SubLoops.empty() && in rebuildLoopAfterUnswitch()