Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp1349 G->PostOrderRefSCCs.erase(G->PostOrderRefSCCs.begin() + Idx); in removeInternalRefEdge()
1350 G->PostOrderRefSCCs.insert(G->PostOrderRefSCCs.begin() + Idx, Result.begin(), in removeInternalRefEdge()
1352 for (int I : seq<int>(Idx, G->PostOrderRefSCCs.size())) in removeInternalRefEdge()
1353 G->RefSCCIndices[G->PostOrderRefSCCs[I]] = I; in removeInternalRefEdge()
1678 PostOrderRefSCCs.insert(PostOrderRefSCCs.begin() + OriginalRCIndex, NewRC); in addSplitFunction()
1680 RefSCCIndices[PostOrderRefSCCs[I]] = I; in addSplitFunction()
1735 PostOrderRefSCCs.insert(PostOrderRefSCCs.begin() + OriginalRCIndex, NewRC); in addSplitRefRecursiveFunctions()
1737 RefSCCIndices[PostOrderRefSCCs[I]] = I; in addSplitRefRecursiveFunctions()
1782 for (auto *RC : PostOrderRefSCCs) in updateGraphPtrs()
1923 if (EntryEdges.empty() || !PostOrderRefSCCs.empty()) in buildRefSCCs()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h902 if (Index == (int)G.PostOrderRefSCCs.size()) in getRC()
906 return G.PostOrderRefSCCs[Index]; in getRC()
956 assert(!PostOrderRefSCCs.empty() && in postorder_ref_scc_begin()
962 assert(!PostOrderRefSCCs.empty() && in postorder_ref_scc_end()
1141 SmallVector<RefSCC *, 16> PostOrderRefSCCs; variable
1205 assert(PostOrderRefSCCs[IndexIt->second] == &RC && in getRefSCCIndex()