Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DLazyCallGraph.cpp1030 SourceC, *this, G->PostOrderRefSCCs, G->RefSCCIndices, in insertIncomingRefEdge()
1081 for (RefSCC *RC : make_range(EraseEnd, G->PostOrderRefSCCs.end())) in insertIncomingRefEdge()
1311 G->PostOrderRefSCCs.erase(G->PostOrderRefSCCs.begin() + Idx); in removeInternalRefEdge()
1312 G->PostOrderRefSCCs.insert(G->PostOrderRefSCCs.begin() + Idx, Result.begin(), in removeInternalRefEdge()
1314 for (int i : seq<int>(Idx, G->PostOrderRefSCCs.size())) in removeInternalRefEdge()
1315 G->RefSCCIndices[G->PostOrderRefSCCs[i]] = i; in removeInternalRefEdge()
1525 PostOrderRefSCCs.erase(PostOrderRefSCCs.begin() + RCIndex); in removeDeadFunction()
1528 RefSCCIndices[PostOrderRefSCCs[i]] = i; in removeDeadFunction()
1553 for (auto *RC : PostOrderRefSCCs) in updateGraphPtrs()
1688 if (EntryEdges.empty() || !PostOrderRefSCCs.empty()) in buildRefSCCs()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h907 if (Index == (int)G.PostOrderRefSCCs.size()) in getRC()
911 return G.PostOrderRefSCCs[Index]; in getRC()
946 assert(!PostOrderRefSCCs.empty() && in postorder_ref_scc_begin()
952 assert(!PostOrderRefSCCs.empty() && in postorder_ref_scc_end()
1131 SmallVector<RefSCC *, 16> PostOrderRefSCCs; variable
1190 assert(PostOrderRefSCCs[IndexIt->second] == &RC && in getRefSCCIndex()