Lines Matching refs:PostOrderRefSCCs
1051 for (RefSCC *C : make_range(G->PostOrderRefSCCs.begin() + SourceIdx + 1, in insertIncomingRefEdge()
1052 G->PostOrderRefSCCs.begin() + TargetIdx + 1)) in insertIncomingRefEdge()
1087 SourceC, *this, G->PostOrderRefSCCs, G->RefSCCIndices, in insertIncomingRefEdge()
1137 G->PostOrderRefSCCs.erase(MergeRange.begin(), MergeRange.end()); in insertIncomingRefEdge()
1138 for (RefSCC *RC : make_range(EraseEnd, G->PostOrderRefSCCs.end())) in insertIncomingRefEdge()
1366 G->PostOrderRefSCCs.erase(G->PostOrderRefSCCs.begin() + Idx); in removeInternalRefEdge()
1367 G->PostOrderRefSCCs.insert(G->PostOrderRefSCCs.begin() + Idx, Result.begin(), in removeInternalRefEdge()
1369 for (int i : seq<int>(Idx, G->PostOrderRefSCCs.size())) in removeInternalRefEdge()
1370 G->RefSCCIndices[G->PostOrderRefSCCs[i]] = i; in removeInternalRefEdge()
1550 PostOrderRefSCCs.erase(PostOrderRefSCCs.begin() + RCIndex); in removeDeadFunction()
1552 for (int i = RCIndex, Size = PostOrderRefSCCs.size(); i < Size; ++i) in removeDeadFunction()
1553 RefSCCIndices[PostOrderRefSCCs[i]] = i; in removeDeadFunction()
1681 PostOrderRefSCCs.insert(PostOrderRefSCCs.begin() + OriginalRCIndex, NewRC); in addSplitFunction()
1682 for (int I = OriginalRCIndex, Size = PostOrderRefSCCs.size(); I < Size; ++I) in addSplitFunction()
1683 RefSCCIndices[PostOrderRefSCCs[I]] = I; in addSplitFunction()
1738 PostOrderRefSCCs.insert(PostOrderRefSCCs.begin() + OriginalRCIndex, NewRC); in addSplitRefRecursiveFunctions()
1739 for (int I = OriginalRCIndex, Size = PostOrderRefSCCs.size(); I < Size; ++I) in addSplitRefRecursiveFunctions()
1740 RefSCCIndices[PostOrderRefSCCs[I]] = I; in addSplitRefRecursiveFunctions()
1785 for (auto *RC : PostOrderRefSCCs) in updateGraphPtrs()
1928 if (EntryEdges.empty() || !PostOrderRefSCCs.empty()) in buildRefSCCs()
1955 RefSCCIndices.insert({NewRC, PostOrderRefSCCs.size()}).second; in buildRefSCCs()
1958 PostOrderRefSCCs.push_back(NewRC); in buildRefSCCs()