| /llvm-project-15.0.7/llvm/tools/opt/ |
| H A D | PrintSCC.cpp | 76 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 D | SyntheticCountsUtils.cpp | 89 for (auto I = scc_begin(CG); !I.isAtEnd(); ++I) in propagate()
|
| H A D | DDG.cpp | 191 for (const auto &SCC : make_range(scc_begin(&F), scc_end(&F))) in DataDependenceGraph()
|
| H A D | GlobalsModRef.cpp | 460 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 D | DependenceGraphBuilder.cpp | 113 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks()
|
| H A D | MLInlineAdvisor.cpp | 105 for (auto I = scc_begin(&CGraph); !I.isAtEnd(); ++I) { in MLInlineAdvisor()
|
| H A D | CallGraphSCCPass.cpp | 513 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()
|
| H A D | BlockFrequencyInfoImpl.cpp | 810 for (auto I = scc_begin(G); !I.isAtEnd(); ++I) { in analyzeIrreducible()
|
| H A D | BranchProbabilityInfo.cpp | 221 for (scc_iterator<const Function *> It = scc_begin(&F); !It.isAtEnd(); in SccInfo()
|
| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | SCCIteratorTest.cpp | 51 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { in TEST()
|
| H A D | DirectedGraphTest.cpp | 273 for (auto &SCC : make_range(scc_begin(&DG), scc_end(&DG))) in TEST()
|
| /llvm-project-15.0.7/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 218 for (auto &scc : make_range(llvm::scc_begin(this), llvm::scc_end(this))) { in print()
|
| /llvm-project-15.0.7/clang-tools-extra/clang-tidy/misc/ |
| H A D | NoRecursionCheck.cpp | 264 for (llvm::scc_iterator<CallGraph *> SCCI = llvm::scc_begin(&CG), in check()
|
| /llvm-project-15.0.7/llvm/tools/llvm-profgen/ |
| H A D | CSPreInliner.cpp | 81 scc_iterator<ProfiledCallGraph *> I = scc_begin(&ProfiledCG); in buildTopDownOrder()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 272 for (auto Scc = scc_begin(G); !Scc.isAtEnd(); ++Scc) { in makeReducible()
|
| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 232 template <class T> scc_iterator<T> scc_begin(const T &G) { in scc_begin() function
|
| /llvm-project-15.0.7/llvm/lib/Transforms/IPO/ |
| H A D | FunctionAttrs.cpp | 534 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 D | SampleProfile.cpp | 1881 scc_iterator<ProfiledCallGraph *> CGI = scc_begin(ProfiledCG.get()); in buildFunctionOrder()
1897 scc_iterator<CallGraph *> CGI = scc_begin(CG); in buildFunctionOrder()
|
| H A D | AttributorAttributes.cpp | 2850 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) in mayContainUnboundedCycle()
|
| /llvm-project-15.0.7/llvm/lib/IR/ |
| H A D | ModuleSummaryIndex.cpp | 357 scc_begin<ModuleSummaryIndex *>(this); in dumpSCCs()
|
| /llvm-project-15.0.7/mlir/lib/Transforms/ |
| H A D | Inliner.cpp | 291 llvm::scc_iterator<const CallGraph *> cgi = llvm::scc_begin(&cg); in runTransformOnCGSCCs()
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | R600MachineCFGStructurizer.cpp | 850 for (scc_iterator<MachineFunction *> It = scc_begin(MF); !It.isAtEnd(); in orderBlocks()
|