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()
1690     for (int I = OriginalRCIndex, Size = PostOrderRefSCCs.size(); I < Size; ++I)  in addSplitFunction()
1691       RefSCCIndices[PostOrderRefSCCs[I]] = I;  in addSplitFunction()
1746     PostOrderRefSCCs.insert(PostOrderRefSCCs.begin() + OriginalRCIndex, NewRC);  in addSplitRefRecursiveFunctions()
1747     for (int I = OriginalRCIndex, Size = PostOrderRefSCCs.size(); I < Size; ++I)  in addSplitRefRecursiveFunctions()
1748       RefSCCIndices[PostOrderRefSCCs[I]] = I;  in addSplitRefRecursiveFunctions()
1793   for (auto *RC : PostOrderRefSCCs)  in updateGraphPtrs()
1934   if (EntryEdges.empty() || !PostOrderRefSCCs.empty())  in buildRefSCCs()
1961             RefSCCIndices.try_emplace(NewRC, PostOrderRefSCCs.size()).second;  in buildRefSCCs()
1964         PostOrderRefSCCs.push_back(NewRC);  in buildRefSCCs()