Searched refs:PostOrderRefSCCs (Results 1 – 2 of 2) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 1044 for (RefSCC *C : make_range(G->PostOrderRefSCCs.begin() + SourceIdx + 1, in insertIncomingRefEdge()
1045 G->PostOrderRefSCCs.begin() + TargetIdx + 1)) in insertIncomingRefEdge()
1080 SourceC, *this, G->PostOrderRefSCCs, G->RefSCCIndices, in insertIncomingRefEdge()
1130 G->PostOrderRefSCCs.erase(MergeRange.begin(), MergeRange.end()); in insertIncomingRefEdge()
1131 for (RefSCC *RC : make_range(EraseEnd, G->PostOrderRefSCCs.end())) in insertIncomingRefEdge()
1353 G->PostOrderRefSCCs.erase(G->PostOrderRefSCCs.begin() + Idx); in removeInternalRefEdges()
1354 G->PostOrderRefSCCs.insert(G->PostOrderRefSCCs.begin() + Idx, Result.begin(), in removeInternalRefEdges()
1356 for (int I : seq<int>(Idx, G->PostOrderRefSCCs.size())) in removeInternalRefEdges()
1357 G->RefSCCIndices[G->PostOrderRefSCCs[I]] = I; in removeInternalRefEdges()
1689 PostOrderRefSCCs.insert(PostOrderRefSCCs.begin() + OriginalRCIndex, NewRC); in addSplitFunction()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 902 if (Index == (int)G.PostOrderRefSCCs.size()) in getRC()
906 return G.PostOrderRefSCCs[Index]; in getRC()
961 assert(!PostOrderRefSCCs.empty() && in postorder_ref_scc_begin()
967 assert(!PostOrderRefSCCs.empty() && in postorder_ref_scc_end()
1146 SmallVector<RefSCC *, 16> PostOrderRefSCCs; variable
1210 assert(PostOrderRefSCCs[IndexIt->second] == &RC && in getRefSCCIndex()
|