| /external/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),
98 for (scc_iterator<CallGraphNode*> SCCI = scc_begin(rootNode),
|
| /external/llvm/lib/Analysis/IPA/ |
| CallGraphSCCPass.cpp | 431 scc_iterator<CallGraph*> CGI = scc_begin(&CG);
521 // Update the active scc_iterator so that it doesn't contain dangling
523 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context;
|
| GlobalsModRef.cpp | 366 for (scc_iterator<CallGraph*> I = scc_begin(&CG), E = scc_end(&CG); I != E;
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 279 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) {
|
| /external/llvm/lib/Target/R600/ |
| AMDGPUStructurizeCFG.cpp | 282 scc_iterator<Region *> I = scc_begin(ParentRegion),
|
| AMDILCFGStructurizer.cpp | 590 for (scc_iterator<FuncT *> sccIter = scc_begin(funcRep),
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 422 for (scc_iterator<ArgumentGraph*> I = scc_begin(&AG), E = scc_end(&AG);
|
