HomeSort by: relevance | last modified time | path
    Searched refs:SubLoops (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LoopNestAnalysis.cpp 55 assert(!OuterLoop.isInnermost() && "Outer loop should have subloops");
169 auto &SubLoops = L->getSubLoops();
170 if (SubLoops.size() == 1 && arePerfectlyNested(*L, *SubLoops.front(), SE)) {
171 PerfectNest.push_back(SubLoops.front());
186 const auto *SubLoops = &CurrentLoop->getSubLoops();
189 while (SubLoops->size() == 1) {
190 const Loop *InnerLoop = SubLoops->front();
201 SubLoops = &CurrentLoop->getSubLoops();
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LoopInfo.h 76 std::vector<LoopT *> SubLoops;
145 return SubLoops;
149 return SubLoops;
399 SubLoops.push_back(NewChild);
406 assert(I != SubLoops.end() && "Cannot remove end iterator!");
409 SubLoops.erase(SubLoops.begin() + (I - begin()));
506 for (auto *SubLoop : SubLoops)
512 SubLoops.clear();
798 /// Return true if this Loop and all inner subloops are in LCSSA form
    [all...]
LoopInfoImpl.h 277 typename std::vector<LoopT *>::iterator I = find(SubLoops, OldChild);
278 assert(I != SubLoops.end() && "OldChild not in loop!");
353 // Check the subloops.
378 // Verify the subloops.
425 /// this loop are mapped to this loop or a subloop. And all subloops within this
521 // For convenience, Blocks and Subloops are inserted in postorder. Reverse
535 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LoopSimplify.cpp 314 const std::vector<Loop*> &SubLoops = L->getSubLoops();
315 for (size_t I = 0; I != SubLoops.size(); )
316 if (BlocksInL.count(SubLoops[I]->getHeader()))
319 NewOuter->addChildLoop(L->removeChildLoop(SubLoops.begin() + I));
885 // Verify subloops.
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
SimpleLoopUnswitch.cpp 1895 auto &SubLoops = L.getSubLoopsVector();
1898 ? SubLoops.begin()
1900 SubLoops.begin(), SubLoops.end(), [&](Loop *SubL) {
1903 for (auto *HoistedL : make_range(SubLoopsSplitI, SubLoops.end())) {
1920 SubLoops.erase(SubLoopsSplitI, SubLoops.end());
1924 assert(SubLoops.empty() &&
1925 "Failed to remove all subloops from the original loop!");

Completed in 30 milliseconds