Searched refs:scc_iterator (Results 1 – 11 of 11) sorted by relevance
42 class scc_iterator : public iterator_facade_base<92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function98 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 …]
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()
514 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()607 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context; in ReplaceNode()
476 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in CollectSCCMembership()494 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
149 for (scc_iterator<const Function *> It = scc_begin(&F); !It.isAtEnd(); in SccInfo()
776 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()1778 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in deduceFunctionAttributeInRPO()
1728 scc_iterator<ProfiledCallGraph *> CGI = scc_begin(ProfiledCG.get()); in buildFunctionOrder()1738 scc_iterator<CallGraph *> CGI = scc_begin(CG); in buildFunctionOrder()
2760 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) in mayContainUnboundedCycle()
350 for (scc_iterator<ModuleSummaryIndex *> I = in dumpSCCs()
387 scc_iterator<SubGraphTraits::NodeRef, SubGraphTraits>::begin( in INITIALIZE_PASS_DEPENDENCY()
855 for (scc_iterator<MachineFunction *> It = scc_begin(MF); !It.isAtEnd(); in orderBlocks()