Searched refs:scc_begin (Results 1 – 17 of 17) sorted by relevance
19 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in run()
89 for (auto I = scc_begin(CG); !I.isAtEnd(); ++I) in propagate()
317 for (scc_iterator<CallGraph *> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in run()
191 for (const auto &SCC : make_range(scc_begin(&F), scc_end(&F))) in DataDependenceGraph()
472 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in CollectSCCMembership()490 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
113 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks()
506 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()
142 for (auto I = scc_begin(&CGraph); !I.isAtEnd(); ++I) { in MLInlineAdvisor()
802 for (auto I = scc_begin(G); !I.isAtEnd(); ++I) { in analyzeIrreducible()
222 for (scc_iterator<const Function *> It = scc_begin(&F); !It.isAtEnd(); in SccInfo()
269 for (auto Scc = scc_begin(G); !Scc.isAtEnd(); ++Scc) { in makeReducible()
233 template <class T> scc_iterator<T> scc_begin(const T &G) { in scc_begin() function
369 scc_begin<ModuleSummaryIndex *>(this); 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()
1962 scc_iterator<ProfiledCallGraph *> CGI = scc_begin(ProfiledCG.get()); in buildFunctionOrder()
3252 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) in mayContainUnboundedCycle()
850 for (scc_iterator<MachineFunction *> It = scc_begin(MF); !It.isAtEnd(); in orderBlocks()