Home
last modified time | relevance | path

Searched refs:VisitStack (Results 1 – 25 of 92) sorted by relevance

1234

/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
H A DDepthFirstIterator.h98 std::vector<StackElement> VisitStack; variable
103 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
111 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
121 NodeRef Node = VisitStack.back().first; in toNext()
122 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
135 VisitStack.push_back(StackElement(Next, None)); in toNext()
142 VisitStack.pop_back(); in toNext()
143 } while (!VisitStack.empty()); in toNext()
162 return VisitStack == x.VisitStack;
184 VisitStack.pop_back(); in skipChildren()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
H A DDepthFirstIterator.h103 std::vector<StackElement> VisitStack; variable
107 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
115 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
125 NodeRef Node = VisitStack.back().first; in toNext()
126 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
139 VisitStack.push_back(StackElement(Next, None)); in toNext()
146 VisitStack.pop_back(); in toNext()
147 } while (!VisitStack.empty()); in toNext()
164 return VisitStack == x.VisitStack;
186 VisitStack.pop_back(); in skipChildren()
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
H A DDepthFirstIterator.h98 std::vector<StackElement> VisitStack; variable
103 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
111 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
121 NodeRef Node = VisitStack.back().first; in toNext()
122 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
135 VisitStack.push_back(StackElement(Next, None)); in toNext()
142 VisitStack.pop_back(); in toNext()
143 } while (!VisitStack.empty()); in toNext()
162 return VisitStack == x.VisitStack;
184 VisitStack.pop_back(); in skipChildren()
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
H A DDepthFirstIterator.h98 std::vector<StackElement> VisitStack; variable
103 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
111 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
121 NodeRef Node = VisitStack.back().first; in toNext()
122 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
135 VisitStack.push_back(StackElement(Next, None)); in toNext()
142 VisitStack.pop_back(); in toNext()
143 } while (!VisitStack.empty()); in toNext()
162 return VisitStack == x.VisitStack;
184 VisitStack.pop_back(); in skipChildren()
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
H A DDepthFirstIterator.h103 std::vector<StackElement> VisitStack; variable
107 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
115 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
125 NodeRef Node = VisitStack.back().first; in toNext()
126 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
139 VisitStack.push_back(StackElement(Next, None)); in toNext()
146 VisitStack.pop_back(); in toNext()
147 } while (!VisitStack.empty()); in toNext()
164 return VisitStack == x.VisitStack;
186 VisitStack.pop_back(); in skipChildren()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
H A DDepthFirstIterator.h98 std::vector<StackElement> VisitStack; variable
103 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
111 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
121 NodeRef Node = VisitStack.back().first; in toNext()
122 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
135 VisitStack.push_back(StackElement(Next, None)); in toNext()
142 VisitStack.pop_back(); in toNext()
143 } while (!VisitStack.empty()); in toNext()
162 return VisitStack == x.VisitStack;
184 VisitStack.pop_back(); in skipChildren()
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
183 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
186 VisitStack.pop_back(); in GetNextSCC()
189 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/ADT/
H A DSCCIterator.h81 std::vector<StackElement> VisitStack; variable
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
156 assert(!VisitStack.empty()); in DFSVisitChildren()
157 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
169 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
170 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
176 while (!VisitStack.empty()) { in GetNextSCC()
180 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
183 VisitStack.pop_back(); in GetNextSCC()
186 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/ADT/
H A DSCCIterator.h82 std::vector<StackElement> VisitStack; variable
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
157 assert(!VisitStack.empty()); in DFSVisitChildren()
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
170 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
171 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
177 while (!VisitStack.empty()) { in GetNextSCC()
181 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
184 VisitStack.pop_back(); in GetNextSCC()
187 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/ADT/
H A DSCCIterator.h82 std::vector<StackElement> VisitStack; variable
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
157 assert(!VisitStack.empty()); in DFSVisitChildren()
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
170 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
171 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
177 while (!VisitStack.empty()) { in GetNextSCC()
181 NodeRef visitingN = VisitStack.back().Node; in GetNextSCC()
184 VisitStack.pop_back(); in GetNextSCC()
187 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
[all …]
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/include/llvm/ADT/
H A DSCCIterator.h61 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack; variable
81 assert(!VisitStack.empty()); in DFSVisitChildren()
82 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in DFSVisitChildren()
84 NodeType *childN = *VisitStack.back().second++; in DFSVisitChildren()
99 assert(VisitStack.size() == MinVisitNumStack.size()); in GetNextSCC()
101 while (!VisitStack.empty()) { in GetNextSCC()
103 assert(VisitStack.back().second ==GT::child_end(VisitStack.back().first)); in GetNextSCC()
104 NodeType *visitingN = VisitStack.back().first; in GetNextSCC()
106 VisitStack.pop_back(); in GetNextSCC()
146 assert(!CurrentSCC.empty() || VisitStack.empty()); in isAtEnd()
[all …]
H A DDepthFirstIterator.h78 std::vector<std::pair<PointerIntTy, ChildItTy> > VisitStack; variable
82 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0), in df_iterator()
125 VisitStack.pop_back(); in toNext()
126 } while (!VisitStack.empty()); in toNext()
146 return VisitStack.size() == x.VisitStack.size() &&
147 VisitStack == x.VisitStack;
152 return VisitStack.back().first.getPointer();
169 VisitStack.pop_back(); in skipChildren()
170 if (!VisitStack.empty()) in skipChildren()
189 unsigned getPathLength() const { return VisitStack.size(); } in getPathLength()
[all …]

1234