Searched refs:SubLoops (Results 1 – 5 of 5) sorted by relevance
169 auto &SubLoops = L->getSubLoops(); in getPerfectLoops() local170 if (SubLoops.size() == 1 && arePerfectlyNested(*L, *SubLoops.front(), SE)) { in getPerfectLoops()171 PerfectNest.push_back(SubLoops.front()); in getPerfectLoops()186 const auto *SubLoops = &CurrentLoop->getSubLoops(); in getMaxPerfectDepth() local189 while (SubLoops->size() == 1) { in getMaxPerfectDepth()190 const Loop *InnerLoop = SubLoops->front(); in getMaxPerfectDepth()201 SubLoops = &CurrentLoop->getSubLoops(); in getMaxPerfectDepth()
76 std::vector<LoopT *> SubLoops; variable145 return SubLoops; in getSubLoops()149 return SubLoops; in getSubLoopsVector()399 SubLoops.push_back(NewChild); in addChildLoop()406 assert(I != SubLoops.end() && "Cannot remove end iterator!"); in removeChildLoop()409 SubLoops.erase(SubLoops.begin() + (I - begin())); in removeChildLoop()506 for (auto *SubLoop : SubLoops) in ~LoopBase()512 SubLoops.clear(); in ~LoopBase()
277 typename std::vector<LoopT *>::iterator I = find(SubLoops, OldChild); in replaceChildLoopWith()278 assert(I != SubLoops.end() && "OldChild not in loop!"); in replaceChildLoopWith()
314 const std::vector<Loop*> &SubLoops = L->getSubLoops(); in separateNestedLoop() local315 for (size_t I = 0; I != SubLoops.size(); ) in separateNestedLoop()316 if (BlocksInL.count(SubLoops[I]->getHeader())) in separateNestedLoop()319 NewOuter->addChildLoop(L->removeChildLoop(SubLoops.begin() + I)); in separateNestedLoop()
1895 auto &SubLoops = L.getSubLoopsVector(); in rebuildLoopAfterUnswitch() local1898 ? SubLoops.begin() in rebuildLoopAfterUnswitch()1900 SubLoops.begin(), SubLoops.end(), [&](Loop *SubL) { in rebuildLoopAfterUnswitch()1903 for (auto *HoistedL : make_range(SubLoopsSplitI, SubLoops.end())) { in rebuildLoopAfterUnswitch()1920 SubLoops.erase(SubLoopsSplitI, SubLoops.end()); in rebuildLoopAfterUnswitch()1924 assert(SubLoops.empty() && in rebuildLoopAfterUnswitch()