OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:SubLoops
(Results
1 - 3
of
3
) sorted by null
/external/llvm/include/llvm/Analysis/
LoopInfo.h
65
//
SubLoops
- Loops contained entirely within this one.
66
std::vector<LoopT *>
SubLoops
;
78
for (size_t i = 0, e =
SubLoops
.size(); i != e; ++i)
79
delete
SubLoops
[i];
122
const std::vector<LoopT *> &getSubLoops() const { return
SubLoops
; }
123
std::vector<LoopT *> &getSubLoopsVector() { return
SubLoops
; }
127
iterator begin() const { return
SubLoops
.begin(); }
128
iterator end() const { return
SubLoops
.end(); }
129
reverse_iterator rbegin() const { return
SubLoops
.rbegin(); }
130
reverse_iterator rend() const { return
SubLoops
.rend();
[
all
...]
LoopInfoImpl.h
228
std::find(
SubLoops
.begin(),
SubLoops
.end(), OldChild);
229
assert(I !=
SubLoops
.end() && "OldChild not in loop!");
307
// Check the
subloops
.
332
// Verify the
subloops
.
362
/// this loop are mapped to this loop or a subloop. And all
subloops
within this
490
// For convenience, Blocks and
Subloops
are inserted in postorder. Reverse
505
/// (discoverAndMapSubloop). The backward traversal skips inner
subloops
, so
/external/llvm/lib/Transforms/Utils/
LoopSimplify.cpp
232
// Must be exactly this loop: no
subloops
, parent loops, or non-loop preds
622
const std::vector<Loop*> &
SubLoops
= L->getSubLoops();
623
for (size_t I = 0; I !=
SubLoops
.size(); )
624
if (BlocksInL.count(
SubLoops
[I]->getHeader()))
627
NewOuter->addChildLoop(L->removeChildLoop(
SubLoops
.begin() + I));
Completed in 314 milliseconds