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
69
//
SubLoops
- Loops contained entirely within this one.
70
std::vector<LoopT *>
SubLoops
;
84
for (size_t i = 0, e =
SubLoops
.size(); i != e; ++i)
85
delete
SubLoops
[i];
128
const std::vector<LoopT *> &getSubLoops() const { return
SubLoops
; }
129
std::vector<LoopT *> &getSubLoopsVector() { return
SubLoops
; }
133
iterator begin() const { return
SubLoops
.begin(); }
134
iterator end() const { return
SubLoops
.end(); }
135
reverse_iterator rbegin() const { return
SubLoops
.rbegin(); }
136
reverse_iterator rend() const { return
SubLoops
.rend();
[
all
...]
LoopInfoImpl.h
215
std::find(
SubLoops
.begin(),
SubLoops
.end(), OldChild);
216
assert(I !=
SubLoops
.end() && "OldChild not in loop!");
288
// Check the
subloops
.
313
// Verify the
subloops
.
343
/// this loop are mapped to this loop or a subloop. And all
subloops
within this
471
// For convenience, Blocks and
Subloops
are inserted in postorder. Reverse
485
/// (discoverAndMapSubloop). The backward traversal skips inner
subloops
, so
/external/llvm/lib/Transforms/Utils/
LoopSimplify.cpp
327
const std::vector<Loop*> &
SubLoops
= L->getSubLoops();
328
for (size_t I = 0; I !=
SubLoops
.size(); )
329
if (BlocksInL.count(
SubLoops
[I]->getHeader()))
332
NewOuter->addChildLoop(L->removeChildLoop(
SubLoops
.begin() + I));
566
// Must be exactly this loop: no
subloops
, parent loops, or non-loop preds
809
// Verify
subloops
.
[
all
...]
Completed in 860 milliseconds