Home
last modified time | relevance | path

Searched refs:scc_end (Results 1 – 8 of 8) sorted by relevance

/llvm-project/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp51 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { in TEST()
H A DDirectedGraphTest.cpp273 for (auto &SCC : make_range(scc_begin(&DG), scc_end(&DG))) in TEST()
/llvm-project/mlir/lib/Analysis/
H A DCallGraph.cpp227 for (auto &scc : make_range(llvm::scc_begin(this), llvm::scc_end(this))) { in print()
/llvm-project/clang-tools-extra/clang-tidy/misc/
H A DNoRecursionCheck.cpp263 SCCE = llvm::scc_end(&CG); in check()
/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h238 template <class T> scc_iterator<T> scc_end(const T &G) { in scc_end() function
/llvm-project/clang-tools-extra/clang-tidy/bugprone/
H A DInfiniteLoopCheck.cpp263 SCCE = llvm::scc_end(&CG); in hasRecursionOverStaticLoopCondVariables()
/llvm-project/llvm/lib/Analysis/
H A DDDG.cpp191 for (const auto &SCC : make_range(scc_begin(&F), scc_end(&F))) in DataDependenceGraph()
H A DDependenceGraphBuilder.cpp113 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks()