133   unsigned LeftBucket = 2 * RootBucket;  in bisect()  local
137   split(Nodes, LeftBucket);  in bisect()
139   runIterations(Nodes, LeftBucket, RightBucket, RNG);  in bisect()
143       llvm::partition(Nodes, [&](auto &N) { return N.Bucket == LeftBucket; });  in bisect()
150     bisect(LeftNodes, RecDepth + 1, LeftBucket, Offset, TP);  in bisect()
166                                          unsigned LeftBucket,  in runIterations()  argument
192       if (N.Bucket == LeftBucket) {  in runIterations()
202         runIteration(Nodes, LeftBucket, RightBucket, Signatures, RNG);  in runIterations()
209                                             unsigned LeftBucket,  in runIteration()  argument
234     bool FromLeftToRight = (N.Bucket == LeftBucket);  in runIteration()
241       Gains, [&](const auto &GP) { return GP.second->Bucket == LeftBucket; });  in runIteration()
260     if (moveFunctionNode(*LeftNode, LeftBucket, RightBucket, Signatures, RNG))  in runIteration()
262     if (moveFunctionNode(*RightNode, LeftBucket, RightBucket, Signatures, RNG))  in runIteration()
269                                             unsigned LeftBucket,  in moveFunctionNode()  argument
278   bool FromLeftToRight = (N.Bucket == LeftBucket);  in moveFunctionNode()
280   N.Bucket = (FromLeftToRight ? RightBucket : LeftBucket);  in moveFunctionNode()