| /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...] |
| /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...] |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[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...] |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[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...] |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[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...] |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[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...] |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[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...] |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[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...] |
| 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/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...] |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[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/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...] |
