135   std::vector<EdgeTy> Queue;  in clusterBasicBlocks()  local
154       Queue.emplace_back(EdgeTy(BB, I, BI->Count));  in clusterBasicBlocks()
159   initQueue(Queue, BF);  in clusterBasicBlocks()
162   while (!Queue.empty()) {  in clusterBasicBlocks()
163     EdgeTy E = Queue.back();  in clusterBasicBlocks()
164     Queue.pop_back();  in clusterBasicBlocks()
210       adjustQueue(Queue, BF);  in clusterBasicBlocks()
230 void PHGreedyClusterAlgorithm::initQueue(std::vector<EdgeTy> &Queue,  in initQueue()  argument
247   llvm::sort(Queue, Comp);  in initQueue()
250 void PHGreedyClusterAlgorithm::adjustQueue(std::vector<EdgeTy> &Queue,  in adjustQueue()  argument
309 void MinBranchGreedyClusterAlgorithm::initQueue(std::vector<EdgeTy> &Queue,  in initQueue()  argument
312   for (const EdgeTy &E : Queue)  in initQueue()
316   adjustQueue(Queue, BF);  in initQueue()
319 void MinBranchGreedyClusterAlgorithm::adjustQueue(std::vector<EdgeTy> &Queue,  in adjustQueue()  argument
338   for (const EdgeTy &E : Queue) {  in adjustQueue()
388   Queue.swap(NewQueue);  in adjustQueue()
389   llvm::sort(Queue, Comp);  in adjustQueue()