Lines Matching refs:Queue
1 //===---- LatencyPriorityQueue.cpp - A latency-oriented priority queue ----===//
83 Queue.push_back(SU);
111 // Since it is available, it must be in the priority queue. First remove it.
114 // Reinsert the node into the priority queue, which recomputes its
121 std::vector<SUnit *>::iterator Best = Queue.begin();
122 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()),
123 E = Queue.end(); I != E; ++I)
127 if (Best != prior(Queue.end()))
128 std::swap(*Best, Queue.back());
129 Queue.pop_back();
134 assert(!Queue.empty() && "Queue is empty!");
135 std::vector<SUnit *>::iterator I = std::find(Queue.begin(), Queue.end(), SU);
136 if (I != prior(Queue.end()))
137 std::swap(*I, Queue.back());
138 Queue.pop_back();
