94   auto NodesRange = llvm::make_range(Nodes.begin(), Nodes.end());  in run()
95   auto BisectTask = [=, &TP]() {  in run()
105   llvm::stable_sort(NodesRange, [](const auto &L, const auto &R) {  in run()
120     llvm::sort(Nodes, [](const auto &L, const auto &R) {  in bisect()
123     for (auto &N : Nodes)  in bisect()
142   auto NodesMid =  in bisect()
143       llvm::partition(Nodes, [&](auto &N) { return N.Bucket == LeftBucket; });  in bisect()
146   auto LeftNodes = llvm::make_range(Nodes.begin(), NodesMid);  in bisect()
147   auto RightNodes = llvm::make_range(NodesMid, Nodes.end());  in bisect()
149   auto LeftRecTask = [=, &TP]() {  in bisect()
152   auto RightRecTask = [=, &TP]() {  in bisect()
171   for (auto &N : Nodes)  in runIterations()
172     for (auto &UN : N.UtilityNodes)  in runIterations()
176   for (auto &N : Nodes)  in runIterations()
177     llvm::erase_if(N.UtilityNodes, [&](auto &UN) {  in runIterations()
183   for (auto &N : Nodes)  in runIterations()
184     for (auto &UN : N.UtilityNodes)  in runIterations()
189   for (auto &N : Nodes) {  in runIterations()
190     for (auto &UN : N.UtilityNodes) {  in runIterations()
214   for (auto &Signature : Signatures) {  in runIteration()
233   for (auto &N : Nodes) {  in runIteration()
240   auto LeftEnd = llvm::partition(  in runIteration()
241       Gains, [&](const auto &GP) { return GP.second->Bucket == LeftBucket; });  in runIteration()
242   auto LeftRange = llvm::make_range(Gains.begin(), LeftEnd);  in runIteration()
243   auto RightRange = llvm::make_range(LeftEnd, Gains.end());  in runIteration()
246   auto LargerGain = [](const auto &L, const auto &R) {  in runIteration()
253   for (auto [LeftPair, RightPair] : llvm::zip(LeftRange, RightRange)) {  in runIteration()
254     auto &[LeftGain, LeftNode] = LeftPair;  in runIteration()
255     auto &[RightGain, RightNode] = RightPair;  in runIteration()
284     for (auto &UN : N.UtilityNodes) {  in moveFunctionNode()
285       auto &Signature = Signatures[UN];  in moveFunctionNode()
291     for (auto &UN : N.UtilityNodes) {  in moveFunctionNode()
292       auto &Signature = Signatures[UN];  in moveFunctionNode()
304   auto NodesMid = Nodes.begin() + (NumNodes + 1) / 2;  in split()
306   std::nth_element(Nodes.begin(), NodesMid, Nodes.end(), [](auto &L, auto &R) {  in split()
310   for (auto &N : llvm::make_range(Nodes.begin(), NodesMid))  in split()
312   for (auto &N : llvm::make_range(NodesMid, Nodes.end()))  in split()
320   for (auto &UN : N.UtilityNodes)  in moveGain()