Searched refs:scc_iterator (Results 1 – 8 of 8) sorted by relevance
40 class scc_iterator42 scc_iterator<GraphT, GT>, std::forward_iterator_tag,47 typedef typename scc_iterator::reference reference;91 scc_iterator(NodeType *entryN) : visitNum(0) { in scc_iterator() function97 scc_iterator() {} in scc_iterator() function100 static scc_iterator begin(const GraphT &G) { in begin()101 return scc_iterator(GT::getEntryNode(G)); in begin()103 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()112 bool operator==(const scc_iterator &x) const {116 scc_iterator &operator++() {[all …]
77 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()
443 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()535 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context; in ReplaceNode()
362 for (scc_iterator<CallGraph*> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
277 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { in TEST()
625 for (scc_iterator<ArgumentGraph*> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in AddArgumentAttrs()
937 for (scc_iterator<MachineFunction *> It = scc_begin(MF); !It.isAtEnd(); in orderBlocks()
728 for (scc_iterator<FuncT *> sccIter = scc_begin(funcRep), in orderBlocks()