1036     for (RefSCC *C : make_range(G->PostOrderRefSCCs.begin() + SourceIdx + 1,  in insertIncomingRefEdge()
1037                                 G->PostOrderRefSCCs.begin() + TargetIdx + 1))  in insertIncomingRefEdge()
1072           SourceC, *this, G->PostOrderRefSCCs, G->RefSCCIndices,  in insertIncomingRefEdge()
1122       G->PostOrderRefSCCs.erase(MergeRange.begin(), MergeRange.end());  in insertIncomingRefEdge()
1123   for (RefSCC *RC : make_range(EraseEnd, G->PostOrderRefSCCs.end()))  in insertIncomingRefEdge()
1349   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()
1679     for (int I = OriginalRCIndex, Size = PostOrderRefSCCs.size(); I < Size; ++I)  in addSplitFunction()
1680       RefSCCIndices[PostOrderRefSCCs[I]] = I;  in addSplitFunction()
1735     PostOrderRefSCCs.insert(PostOrderRefSCCs.begin() + OriginalRCIndex, NewRC);  in addSplitRefRecursiveFunctions()
1736     for (int I = OriginalRCIndex, Size = PostOrderRefSCCs.size(); I < Size; ++I)  in addSplitRefRecursiveFunctions()
1737       RefSCCIndices[PostOrderRefSCCs[I]] = I;  in addSplitRefRecursiveFunctions()
1782   for (auto *RC : PostOrderRefSCCs)  in updateGraphPtrs()
1923   if (EntryEdges.empty() || !PostOrderRefSCCs.empty())  in buildRefSCCs()
1950             RefSCCIndices.try_emplace(NewRC, PostOrderRefSCCs.size()).second;  in buildRefSCCs()
1953         PostOrderRefSCCs.push_back(NewRC);  in buildRefSCCs()