Home
last modified time | relevance | path

Searched refs:SubLoops (Results 1 – 3 of 3) sorted by relevance

/external/llvm/include/llvm/Analysis/
DLoopInfo.h75 std::vector<LoopT *> SubLoops; variable
89 for (size_t i = 0, e = SubLoops.size(); i != e; ++i) in ~LoopBase()
90 delete SubLoops[i]; in ~LoopBase() local
133 const std::vector<LoopT *> &getSubLoops() const { return SubLoops; } in getSubLoops()
134 std::vector<LoopT *> &getSubLoopsVector() { return SubLoops; } in getSubLoopsVector()
138 iterator begin() const { return SubLoops.begin(); } in begin()
139 iterator end() const { return SubLoops.end(); } in end()
140 reverse_iterator rbegin() const { return SubLoops.rbegin(); } in rbegin()
141 reverse_iterator rend() const { return SubLoops.rend(); } in rend()
142 bool empty() const { return SubLoops.empty(); } in empty()
[all …]
DLoopInfoImpl.h215 std::find(SubLoops.begin(), SubLoops.end(), OldChild); in replaceChildLoopWith()
216 assert(I != SubLoops.end() && "OldChild not in loop!"); in replaceChildLoopWith()
/external/llvm/lib/Transforms/Utils/
DLoopSimplify.cpp332 const std::vector<Loop*> &SubLoops = L->getSubLoops(); in separateNestedLoop() local
333 for (size_t I = 0; I != SubLoops.size(); ) in separateNestedLoop()
334 if (BlocksInL.count(SubLoops[I]->getHeader())) in separateNestedLoop()
337 NewOuter->addChildLoop(L->removeChildLoop(SubLoops.begin() + I)); in separateNestedLoop()