Searched refs:SubLoops (Results 1 - 5 of 5) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopNestAnalysis.cpp170 auto &SubLoops = L->getSubLoops(); local
171 if (SubLoops.size() == 1 && arePerfectlyNested(*L, *SubLoops.front(), SE)) {
172 PerfectNest.push_back(SubLoops.front());
187 const auto *SubLoops = &CurrentLoop->getSubLoops(); local
190 while (SubLoops->size() == 1) {
191 const Loop *InnerLoop = SubLoops->front();
202 SubLoops = &CurrentLoop->getSubLoops();
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopInfo.h76 std::vector<LoopT *> SubLoops; member in class:llvm::LoopBase
145 return SubLoops;
149 return SubLoops;
386 SubLoops.push_back(NewChild);
393 assert(I != SubLoops.end() && "Cannot remove end iterator!");
396 SubLoops.erase(SubLoops.begin() + (I - begin()));
492 for (auto *SubLoop : SubLoops)
498 SubLoops.clear();
H A DLoopInfoImpl.h269 typename std::vector<LoopT *>::iterator I = find(SubLoops, OldChild);
270 assert(I != SubLoops.end() && "OldChild not in loop!");
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp320 const std::vector<Loop*> &SubLoops = L->getSubLoops(); local
321 for (size_t I = 0; I != SubLoops.size(); )
322 if (BlocksInL.count(SubLoops[I]->getHeader()))
325 NewOuter->addChildLoop(L->removeChildLoop(SubLoops.begin() + I));
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimpleLoopUnswitch.cpp1871 auto &SubLoops = L.getSubLoopsVector(); local
1874 ? SubLoops.begin()
1876 SubLoops.begin(), SubLoops.end(), [&](Loop *SubL) {
1879 for (auto *HoistedL : make_range(SubLoopsSplitI, SubLoops.end())) {
1896 SubLoops.erase(SubLoopsSplitI, SubLoops.end());
1900 assert(SubLoops.empty() &&

Completed in 186 milliseconds