1052     for (RefSCC *C : make_range(G->PostOrderRefSCCs.begin() + SourceIdx + 1,  in insertIncomingRefEdge()
1053                                 G->PostOrderRefSCCs.begin() + TargetIdx + 1))  in insertIncomingRefEdge()
1088           SourceC, *this, G->PostOrderRefSCCs, G->RefSCCIndices,  in insertIncomingRefEdge()
1138       G->PostOrderRefSCCs.erase(MergeRange.begin(), MergeRange.end());  in insertIncomingRefEdge()
1139   for (RefSCC *RC : make_range(EraseEnd, G->PostOrderRefSCCs.end()))  in insertIncomingRefEdge()
1367   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()
1670     for (int I = OriginalRCIndex, Size = PostOrderRefSCCs.size(); I < Size; ++I)  in addSplitFunction()
1671       RefSCCIndices[PostOrderRefSCCs[I]] = I;  in addSplitFunction()
1726     PostOrderRefSCCs.insert(PostOrderRefSCCs.begin() + OriginalRCIndex, NewRC);  in addSplitRefRecursiveFunctions()
1727     for (int I = OriginalRCIndex, Size = PostOrderRefSCCs.size(); I < Size; ++I)  in addSplitRefRecursiveFunctions()
1728       RefSCCIndices[PostOrderRefSCCs[I]] = I;  in addSplitRefRecursiveFunctions()
1773   for (auto *RC : PostOrderRefSCCs)  in updateGraphPtrs()
1916   if (EntryEdges.empty() || !PostOrderRefSCCs.empty())  in buildRefSCCs()
1943             RefSCCIndices.insert({NewRC, PostOrderRefSCCs.size()}).second;  in buildRefSCCs()
1946         PostOrderRefSCCs.push_back(NewRC);  in buildRefSCCs()