| /external/llvm/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
40 class scc_iterator class in namespace:llvm
42 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
47 typedef typename scc_iterator::reference reference;
91 scc_iterator(NodeType *entryN) : visitNum(0) { function in class:llvm::scc_iterator
97 scc_iterator() {} function in class:llvm::scc_iterator
100 static scc_iterator begin(const GraphT &G) {
101 return scc_iterator(GT::getEntryNode(G));
103 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 typedef typename scc_iterator::reference reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 typedef typename scc_iterator::reference reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
43 class scc_iterator : public iterator_facade_base< class in namespace:llvm
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 using reference = typename scc_iterator::reference;
93 scc_iterator(NodeRef entryN) : visitNum(0) { function in class:llvm::scc_iterator
99 scc_iterator() = default;
102 static scc_iterator begin(const GraphT &G) {
103 return scc_iterator(GT::getEntryNode(G));
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| SCCIterator.h | 16 // To visit S1 *before* S2, use the scc_iterator on the Inverse graph.
32 /// scc_iterator - Enumerate the SCCs of a directed graph, in
36 class scc_iterator class in namespace:llvm
131 inline scc_iterator(NodeType *entryN) : visitNum(0) { function in class:llvm::scc_iterator
135 inline scc_iterator() { /* End is when DFS stack is empty */ } function in class:llvm::scc_iterator
138 typedef scc_iterator<GraphT, GT> _Self;
187 /// ReplaceNode - This informs the scc_iterator that the specified Old node
190 assert(nodeVisitNumbers.count(Old) && "Old not in scc_iterator?");
199 scc_iterator<T> scc_begin(const T &G) {
200 return scc_iterator<T>::begin(G)
[all...] |
| /external/llvm/tools/opt/ |
| PrintSCC.cpp | 12 // scc_iterator directly to enumerate SCCs and process them in some way. These
15 // (1) As a reference for how to use the scc_iterator.
24 // (3) To test the scc_iterator.
77 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) {
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd();
|
| /external/swiftshader/third_party/LLVM/tools/opt/ |
| PrintSCC.cpp | 12 // scc_iterator directly to enumerate SCCs and process them in some way. These
15 // (1) As a reference for how to use the scc_iterator.
24 // (3) To test the scc_iterator.
77 for (scc_iterator<Function*> SCCI = scc_begin(&F),
98 for (scc_iterator<CallGraphNode*> SCCI = scc_begin(rootNode),
|
| /external/llvm/lib/Analysis/ |
| CallGraphSCCPass.cpp | 446 scc_iterator<CallGraph*> CGI = scc_begin(&CG);
536 // Update the active scc_iterator so that it doesn't contain dangling
538 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context;
|
| GlobalsModRef.cpp | 452 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) {
470 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) {
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/IPA/ |
| CallGraphSCCPass.cpp | 426 scc_iterator<CallGraph*> CGI = scc_begin(&CG);
516 // Update the active scc_iterator so that it doesn't contain dangling
518 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context;
|
| GlobalsModRef.cpp | 372 for (scc_iterator<CallGraph*> I = scc_begin(&CG), E = scc_end(&CG); I != E;
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 277 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) {
|
| /external/swiftshader/third_party/LLVM/unittests/ADT/ |
| SCCIteratorTest.cpp | 279 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) {
|
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 574 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) {
[all...] |
