Searched refs:scc_iterator (Results 1 – 12 of 12) sorted by relevance
47 class scc_iterator : public iterator_facade_base<48 scc_iterator<GraphT, GT>, std::forward_iterator_tag,53 using reference = typename scc_iterator::reference;97 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function103 scc_iterator() = default;106 static scc_iterator begin(const GraphT &G) { in begin()107 return scc_iterator(GT::getEntryNode(G)); in begin()109 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()118 bool operator==(const scc_iterator &x) const {122 scc_iterator &operator++() {[all …]
19 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in run()
506 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()599 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context; in ReplaceNode()
317 for (scc_iterator<CallGraph *> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in run()
480 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in CollectSCCMembership()498 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
222 for (scc_iterator<const Function *> It = scc_begin(&F); !It.isAtEnd(); in SccInfo()
368 for (scc_iterator<ModuleSummaryIndex *> I = in dumpSCCs()
479 for (scc_iterator<ModuleSummaryIndex *> I = scc_begin(&Index); !I.isAtEnd(); in thinLTOPropagateFunctionAttrs()949 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()
1925 scc_iterator<ProfiledCallGraph *> CGI = scc_begin(ProfiledCG.get()); in buildFunctionOrder()
3255 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) in mayContainUnboundedCycle()
394 scc_iterator<SubGraphTraits::NodeRef, SubGraphTraits>::begin( in INITIALIZE_PASS_DEPENDENCY()
850 for (scc_iterator<MachineFunction *> It = scc_begin(MF); !It.isAtEnd(); in orderBlocks()