| /external/llvm/lib/Analysis/ |
| CFG.cpp | 34 SmallVector<std::pair<const BasicBlock*, succ_const_iterator>, 8> VisitStack;
38 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
41 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back();
52 // Successor is in VisitStack, it's a back edge.
60 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
63 InStack.erase(VisitStack.pop_back_val().first);
65 } while (!VisitStack.empty());
|
| /external/llvm/include/llvm/ADT/ |
| SCCIterator.h | 49 /// Element of VisitStack during DFS.
80 std::vector<StackElement> VisitStack;
108 assert(!CurrentSCC.empty() || VisitStack.empty());
113 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 assert(!VisitStack.empty());
156 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
158 NodeType *childN = *VisitStack.back().NextChild++
[all...] |
| DepthFirstIterator.h | 75 // VisitStack - Used to maintain the ordering. Top = current block
78 std::vector<std::pair<PointerIntTy, ChildItTy>> VisitStack;
83 VisitStack.push_back(
92 VisitStack.push_back(
104 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back();
118 VisitStack.push_back(
125 VisitStack.pop_back();
126 } while (!VisitStack.empty());
145 return VisitStack == x.VisitStack;
[all...] |
| PostOrderIterator.h | 101 // VisitStack - Used to maintain the ordering. Top = current block
103 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack;
106 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
107 NodeType *BB = *VisitStack.back().second++;
108 if (this->insertEdge(VisitStack.back().first, BB)) {
110 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
117 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
125 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
148 return VisitStack == x.VisitStack
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 89 SmallVector<WorklistItem, 16> VisitStack;
97 VisitStack.clear();
100 VisitStack.push_back(WorklistItem(L->getHeader(), false));
102 while (!VisitStack.empty()) {
103 WorklistItem Item = VisitStack.pop_back_val();
156 VisitStack.push_back(WorklistItem(SuccBB, true));
164 VisitStack.push_back(WorklistItem(ExitBB, false));
175 VisitStack.push_back(WorklistItem(SuccBB, false));
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| 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...] |
| 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...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 77 SmallVector<WorklistItem, 16> VisitStack;
85 VisitStack.clear();
88 VisitStack.push_back(WorklistItem(L->getHeader(), false));
90 while (!VisitStack.empty()) {
91 WorklistItem Item = VisitStack.pop_back_val();
138 VisitStack.push_back(WorklistItem(SuccBB, true));
146 VisitStack.push_back(WorklistItem(ExitBB, false));
157 VisitStack.push_back(WorklistItem(SuccBB, false));
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
110 VisitStack.push_back(StackElement(Node, None));
119 NodeRef Node = VisitStack.back().first;
120 Optional<ChildItTy> &Opt = VisitStack.back().second;
126 // VisitStack.back().second actually gets updated as the iterator
133 VisitStack.push_back(StackElement(Next, None));
140 VisitStack.pop_back();
141 } while (!VisitStack.empty())
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| SCCIterator.h | 51 /// Element of VisitStack during DFS.
82 std::vector<StackElement> VisitStack;
110 assert(!CurrentSCC.empty() || VisitStack.empty());
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
157 assert(!VisitStack.empty());
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
160 NodeRef childN = *VisitStack.back().NextChild++
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 617 SmallVector<std::pair<const BasicBlock*, succ_const_iterator>, 8> VisitStack;
621 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
624 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back();
635 // Successor is in VisitStack, it's a back edge.
643 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
646 InStack.erase(VisitStack.pop_back_val().first);
648 } while (!VisitStack.empty());
|
