Searched refs:scc_iterator (Results 1 – 17 of 17) 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()
505 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule() 596 // Update the active scc_iterator so that it doesn't contain dangling in ReplaceNode() 598 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()
221 for (scc_iterator<const Function *> It = scc_begin(&F); !It.isAtEnd(); in SccInfo()
51 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { in TEST()
259 CallGraphSCC(llvm::scc_iterator<const CallGraph *> &parentIterator) in CallGraphSCC() 279 llvm::scc_iterator<const CallGraph *> &parentIterator;288 llvm::scc_iterator<const CallGraph *> cgi = llvm::scc_begin(&cg); in runTransformOnCGSCCs()
262 for (llvm::scc_iterator<CallGraph *> SCCI = llvm::scc_begin(&CG), in check()
88 scc_iterator<ProfiledCallGraph *> I = scc_begin(&ProfiledCG); in buildTopDownOrder()
262 for (llvm::scc_iterator<CallGraph *> SCCI = llvm::scc_begin(&CG), in hasRecursionOverStaticLoopCondVariables()
379 for (scc_iterator<ModuleSummaryIndex *> I = in dumpSCCs()
482 for (scc_iterator<ModuleSummaryIndex *> I = scc_begin(&Index); !I.isAtEnd(); in thinLTOPropagateFunctionAttrs() 1274 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addNonNullAttrs()
1932 scc_iterator<ProfiledCallGraph *> CGI = scc_begin(ProfiledCG.get()); in buildFunctionOrder()
3294 // We use scc_iterator which uses Tarjan algorithm to find all the maximal in isImpliedByMustprogressAndReadonly() 3297 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) in updateImpl()
438 scc_iterator<SubGraphTraits::NodeRef, SubGraphTraits>::begin( in analyzeLoops()
850 for (scc_iterator<MachineFunction *> It = scc_begin(MF); !It.isAtEnd(); in orderBlocks()