OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:VisitStack
(Results
1 - 5
of
5
) sorted by null
/external/llvm/include/llvm/ADT/
SCCIterator.h
59
//
VisitStack
- Used to maintain the ordering. Top = current block
61
std::vector<std::pair<NodeType *, ChildItTy> >
VisitStack
;
65
// the corresponding node on the
VisitStack
.
74
VisitStack
.push_back(std::make_pair(N, GT::child_begin(N)));
81
assert(!
VisitStack
.empty());
82
while (
VisitStack
.back().second != GT::child_end(
VisitStack
.back().first)) {
84
NodeType *childN = *
VisitStack
.back().second++;
99
assert(
VisitStack
.size() == MinVisitNumStack.size());
101
while (!
VisitStack
.empty())
[
all
...]
DepthFirstIterator.h
75
//
VisitStack
- Used to maintain the ordering. Top = current block
78
std::vector<std::pair<PointerIntTy, ChildItTy> >
VisitStack
;
82
VisitStack
.push_back(std::make_pair(PointerIntTy(Node, 0),
91
VisitStack
.push_back(std::make_pair(PointerIntTy(Node, 0),
103
std::pair<PointerIntTy, ChildItTy> &Top =
VisitStack
.back();
118
VisitStack
.push_back(std::make_pair(PointerIntTy(Next, 0),
125
VisitStack
.pop_back();
126
} while (!
VisitStack
.empty());
146
return
VisitStack
== x.
VisitStack
;
[
all
...]
PostOrderIterator.h
60
//
VisitStack
- Used to maintain the ordering. Top = current block
62
std::vector<std::pair<NodeType *, ChildItTy> >
VisitStack
;
65
while (
VisitStack
.back().second != GT::child_end(
VisitStack
.back().first)) {
66
NodeType *BB = *
VisitStack
.back().second++;
68
VisitStack
.push_back(std::make_pair(BB, GT::child_begin(BB)));
75
VisitStack
.push_back(std::make_pair(BB, GT::child_begin(BB)));
83
VisitStack
.push_back(std::make_pair(BB, GT::child_begin(BB)));
105
return
VisitStack
== x.
VisitStack
;
[
all
...]
/external/llvm/lib/Transforms/Scalar/
LoopInstSimplify.cpp
81
SmallVector<WorklistItem, 16>
VisitStack
;
89
VisitStack
.clear();
92
VisitStack
.push_back(WorklistItem(L->getHeader(), false));
94
while (!
VisitStack
.empty()) {
95
WorklistItem Item =
VisitStack
.pop_back_val();
142
VisitStack
.push_back(WorklistItem(SuccBB, true));
150
VisitStack
.push_back(WorklistItem(ExitBB, false));
161
VisitStack
.push_back(WorklistItem(SuccBB, false));
/external/llvm/lib/Transforms/Utils/
BasicBlockUtils.cpp
613
SmallVector<std::pair<const BasicBlock*, succ_const_iterator>, 8>
VisitStack
;
617
VisitStack
.push_back(std::make_pair(BB, succ_begin(BB)));
620
std::pair<const BasicBlock*, succ_const_iterator> &Top =
VisitStack
.back();
631
// Successor is in
VisitStack
, it's a back edge.
639
VisitStack
.push_back(std::make_pair(BB, succ_begin(BB)));
642
InStack.erase(
VisitStack
.pop_back_val().first);
644
} while (!
VisitStack
.empty());
Completed in 246 milliseconds