Home
last modified time | relevance | path

Searched refs:PostOrderRefSCCs (Results 1 – 2 of 2) sorted by relevance

/llvm-project-15.0.7/llvm/lib/Analysis/
H A DLazyCallGraph.cpp1367 G->PostOrderRefSCCs.erase(G->PostOrderRefSCCs.begin() + Idx); in removeInternalRefEdge()
1368 G->PostOrderRefSCCs.insert(G->PostOrderRefSCCs.begin() + Idx, Result.begin(), in removeInternalRefEdge()
1370 for (int i : seq<int>(Idx, G->PostOrderRefSCCs.size())) in removeInternalRefEdge()
1371 G->RefSCCIndices[G->PostOrderRefSCCs[i]] = i; in removeInternalRefEdge()
1669 PostOrderRefSCCs.insert(PostOrderRefSCCs.begin() + OriginalRCIndex, NewRC); in addSplitFunction()
1671 RefSCCIndices[PostOrderRefSCCs[I]] = I; in addSplitFunction()
1726 PostOrderRefSCCs.insert(PostOrderRefSCCs.begin() + OriginalRCIndex, NewRC); in addSplitRefRecursiveFunctions()
1728 RefSCCIndices[PostOrderRefSCCs[I]] = I; in addSplitRefRecursiveFunctions()
1773 for (auto *RC : PostOrderRefSCCs) in updateGraphPtrs()
1916 if (EntryEdges.empty() || !PostOrderRefSCCs.empty()) in buildRefSCCs()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h894 if (Index == (int)G.PostOrderRefSCCs.size()) in getRC()
898 return G.PostOrderRefSCCs[Index]; in getRC()
948 assert(!PostOrderRefSCCs.empty() && in postorder_ref_scc_begin()
954 assert(!PostOrderRefSCCs.empty() && in postorder_ref_scc_end()
1133 SmallVector<RefSCC *, 16> PostOrderRefSCCs; variable
1197 assert(PostOrderRefSCCs[IndexIt->second] == &RC && in getRefSCCIndex()