Searched refs:scc_begin (Results 1 – 18 of 18) sorted by relevance
19 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in run()
86 for (auto I = scc_begin(CG); !I.isAtEnd(); ++I) in propagate()
272 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()
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()
113 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks()
504 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()
159 for (auto I = scc_begin(&CGraph); !I.isAtEnd(); ++I) { in MLInlineAdvisor()
787 for (auto I = scc_begin(G); !I.isAtEnd(); ++I) { in analyzeIrreducible()
218 for (scc_iterator<const Function *> It = scc_begin(&F); !It.isAtEnd(); in SccInfo()
233 template <class T> scc_iterator<T> scc_begin(const T &G) { in scc_begin() function
282 for (scc_iterator<CallGraph *> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in initialize()
380 scc_begin<ModuleSummaryIndex *>(this); in dumpSCCs()
496 for (scc_iterator<ModuleSummaryIndex *> I = scc_begin(&Index); !I.isAtEnd(); in thinLTOPropagateFunctionAttrs()1333 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()
1925 scc_iterator<ProfiledCallGraph *> CGI = scc_begin(ProfiledCG.get()); in buildFunctionOrder()
3297 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) in mayContainUnboundedCycle()
841 for (scc_iterator<MachineFunction *> It = scc_begin(MF); !It.isAtEnd(); in orderBlocks()
19335 …c_iterator<llvm::CallGraph*, llvm::GraphTraits<llvm::CallGraph*>> llvm::scc_begin<llvm::CallGraph*…