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()
77 std::vector<LoopT *> SubLoops; variable162 return SubLoops; in getSubLoops()166 return SubLoops; in getSubLoopsVector()416 SubLoops.push_back(NewChild); in addChildLoop()423 assert(I != SubLoops.end() && "Cannot remove end iterator!"); in removeChildLoop()426 SubLoops.erase(SubLoops.begin() + (I - begin())); in removeChildLoop()523 for (auto *SubLoop : SubLoops) in ~LoopBase()529 SubLoops.clear(); in ~LoopBase()
293 typename std::vector<LoopT *>::iterator I = find(SubLoops, OldChild); in replaceChildLoopWith()294 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()
2003 auto &SubLoops = L.getSubLoopsVector(); in rebuildLoopAfterUnswitch() local2006 ? SubLoops.begin() in rebuildLoopAfterUnswitch()2008 SubLoops.begin(), SubLoops.end(), [&](Loop *SubL) { in rebuildLoopAfterUnswitch()2011 for (auto *HoistedL : make_range(SubLoopsSplitI, SubLoops.end())) { in rebuildLoopAfterUnswitch()2028 SubLoops.erase(SubLoopsSplitI, SubLoops.end()); in rebuildLoopAfterUnswitch()2032 assert(SubLoops.empty() && in rebuildLoopAfterUnswitch()