Home
last modified time | relevance | path

Searched refs:scc_iterator (Results 1 – 15 of 15) sorted by relevance

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSCCIterator.h46 class scc_iterator : public iterator_facade_base<
96 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() function
102 scc_iterator() = default;
105 static scc_iterator begin(const GraphT &G) { in begin()
106 return scc_iterator(GT::getEntryNode(G)); in begin()
108 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end()
117 bool operator==(const scc_iterator &x) const {
121 scc_iterator &operator++() {
219 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
233 return scc_iterator<T>::begin(G); in scc_begin()
[all …]
/llvm-project-15.0.7/llvm/tools/opt/
H A DPrintSCC.cpp76 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()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCallGraphSCCPass.cpp513 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()
606 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context; in ReplaceNode()
H A DGlobalsModRef.cpp460 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in CollectSCCMembership()
478 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
H A DBranchProbabilityInfo.cpp221 for (scc_iterator<const Function *> It = scc_begin(&F); !It.isAtEnd(); in SccInfo()
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp51 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { in TEST()
/llvm-project-15.0.7/mlir/lib/Transforms/
H A DInliner.cpp262 CallGraphSCC(llvm::scc_iterator<const CallGraph *> &parentIterator) in CallGraphSCC()
282 llvm::scc_iterator<const CallGraph *> &parentIterator;
291 llvm::scc_iterator<const CallGraph *> cgi = llvm::scc_begin(&cg); in runTransformOnCGSCCs()
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/misc/
H A DNoRecursionCheck.cpp264 for (llvm::scc_iterator<CallGraph *> SCCI = llvm::scc_begin(&CG), in check()
/llvm-project-15.0.7/llvm/tools/llvm-profgen/
H A DCSPreInliner.cpp81 scc_iterator<ProfiledCallGraph *> I = scc_begin(&ProfiledCG); in buildTopDownOrder()
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp534 for (scc_iterator<ModuleSummaryIndex *> I = scc_begin(&Index); !I.isAtEnd(); in thinLTOPropagateFunctionAttrs()
993 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()
2038 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in deduceFunctionAttributeInRPO()
H A DSampleProfile.cpp1881 scc_iterator<ProfiledCallGraph *> CGI = scc_begin(ProfiledCG.get()); in buildFunctionOrder()
1897 scc_iterator<CallGraph *> CGI = scc_begin(CG); in buildFunctionOrder()
H A DAttributorAttributes.cpp2850 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) in mayContainUnboundedCycle()
/llvm-project-15.0.7/llvm/lib/IR/
H A DModuleSummaryIndex.cpp356 for (scc_iterator<ModuleSummaryIndex *> I = in dumpSCCs()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp385 scc_iterator<SubGraphTraits::NodeRef, SubGraphTraits>::begin( in INITIALIZE_PASS_DEPENDENCY()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DR600MachineCFGStructurizer.cpp850 for (scc_iterator<MachineFunction *> It = scc_begin(MF); !It.isAtEnd(); in orderBlocks()