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; variable 147 return SubLoops; in getSubLoops() 151 return SubLoops; in getSubLoopsVector() 391 SubLoops.push_back(NewChild);398 assert(I != SubLoops.end() && "Cannot remove end iterator!"); in addChildLoop() 401 SubLoops.erase(SubLoops.begin() + (I - begin())); in addChildLoop() 498 for (auto *SubLoop : SubLoops)504 SubLoops.clear();
306 typename std::vector<LoopT *>::iterator I = find(SubLoops, OldChild); in replaceChildLoopWith()307 assert(I != SubLoops.end() && "OldChild not in loop!"); in replaceChildLoopWith()
308 const std::vector<Loop*> &SubLoops = L->getSubLoops(); in separateNestedLoop() local309 for (size_t I = 0; I != SubLoops.size(); ) in separateNestedLoop()310 if (BlocksInL.count(SubLoops[I]->getHeader())) in separateNestedLoop()313 NewOuter->addChildLoop(L->removeChildLoop(SubLoops.begin() + I)); in separateNestedLoop()
2066 auto &SubLoops = L.getSubLoopsVector(); in rebuildLoopAfterUnswitch() 2069 ? SubLoops.begin() in rebuildLoopAfterUnswitch() 2071 SubLoops.begin(), SubLoops.end(), [&](Loop *SubL) { in rebuildLoopAfterUnswitch() 2074 for (auto *HoistedL : make_range(SubLoopsSplitI, SubLoops.end())) { in rebuildLoopAfterUnswitch() 2091 SubLoops.erase(SubLoopsSplitI, SubLoops.end()); in rebuildLoopAfterUnswitch() 2095 assert(SubLoops.empty() && in rebuildLoopAfterUnswitch() 2065 auto &SubLoops = L.getSubLoopsVector(); rebuildLoopAfterUnswitch() local