| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/llvm10/llvm-10.0.1.src/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasLoop() const { in hasLoop()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/llvm11/llvm-11.0.1.src/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasLoop() const { in hasLoop()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasLoop() const { in hasLoop()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
215 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
229 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/llvm90/llvm-9.0.1.src/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 class scc_iterator : public iterator_facade_base<
92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
98 scc_iterator() = default;
101 static scc_iterator begin(const GraphT &G) { in begin()
102 return scc_iterator(GT::getEntryNode(G)); in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
113 bool operator==(const scc_iterator &x) const {
117 scc_iterator &operator++() {
212 bool scc_iterator<GraphT, GT>::hasLoop() const { in hasLoop()
226 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/llvm80/llvm-8.0.1.src/include/llvm/ADT/ |
| H A D | SCCIterator.h | 43 class scc_iterator : public iterator_facade_base<
93 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) { in begin()
103 return scc_iterator(GT::getEntryNode(G)); in begin()
105 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
114 bool operator==(const scc_iterator &x) const {
118 scc_iterator &operator++() {
213 bool scc_iterator<GraphT, GT>::hasLoop() const { in hasLoop()
227 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/devel/llvm70/llvm-7.0.1.src/include/llvm/ADT/ |
| H A D | SCCIterator.h | 43 class scc_iterator : public iterator_facade_base<
93 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) { in begin()
103 return scc_iterator(GT::getEntryNode(G)); in begin()
105 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
114 bool operator==(const scc_iterator &x) const {
118 scc_iterator &operator++() {
213 bool scc_iterator<GraphT, GT>::hasLoop() const { in hasLoop()
227 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
|
| /dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 36 class scc_iterator
131 inline scc_iterator(NodeType *entryN) : visitNum(0) { in scc_iterator() function
138 typedef scc_iterator<GraphT, GT> _Self;
199 scc_iterator<T> scc_begin(const T &G) { in scc_begin()
200 return scc_iterator<T>::begin(G); in scc_begin()
204 scc_iterator<T> scc_end(const T &G) { in scc_end()
205 return scc_iterator<T>::end(G); in scc_end()
209 scc_iterator<Inverse<T> > scc_begin(const Inverse<T> &G) { in scc_begin()
210 return scc_iterator<Inverse<T> >::begin(G); in scc_begin()
214 scc_iterator<Inverse<T> > scc_end(const Inverse<T> &G) { in scc_end()
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/tools/opt/ |
| H A D | PrintSCC.cpp | 76 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in runOnFunction()
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule()
|
| /dports/devel/llvm11/llvm-11.0.1.src/tools/opt/ |
| H A D | PrintSCC.cpp | 76 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in runOnFunction()
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/tools/opt/ |
| H A D | PrintSCC.cpp | 76 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in runOnFunction()
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/llvm/tools/opt/ |
| H A D | PrintSCC.cpp | 76 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in runOnFunction()
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule()
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/tools/opt/ |
| H A D | PrintSCC.cpp | 76 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in runOnFunction()
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/tools/opt/ |
| H A D | PrintSCC.cpp | 76 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in runOnFunction()
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/tools/opt/ |
| H A D | PrintSCC.cpp | 76 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in runOnFunction()
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule()
|