Lines Matching refs:Queue
84 Queue.push_back(SU);
122 std::vector<SUnit *>::iterator Best = Queue.begin();
123 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()),
124 E = Queue.end(); I != E; ++I)
128 if (Best != std::prev(Queue.end()))
129 std::swap(*Best, Queue.back());
130 Queue.pop_back();
135 assert(!Queue.empty() && "Queue is empty!");
136 std::vector<SUnit *>::iterator I = find(Queue, SU);
137 assert(I != Queue.end() && "Queue doesn't contain the SU being removed!");
138 if (I != std::prev(Queue.end()))
139 std::swap(*I, Queue.back());
140 Queue.pop_back();
145 dbgs() << "Latency Priority Queue\n";
146 dbgs() << " Number of Queue Entries: " << Queue.size() << "\n";
147 for (const SUnit *SU : Queue) {