85   Queue.push_back(SU);  in push()
123   std::vector<SUnit *>::iterator Best = Queue.begin();  in pop()
124   for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()),  in pop()
125        E = Queue.end(); I != E; ++I)  in pop()
129   if (Best != std::prev(Queue.end()))  in pop()
130     std::swap(*Best, Queue.back());  in pop()
131   Queue.pop_back();  in pop()
136   assert(!Queue.empty() && "Queue is empty!");  in remove()
137   std::vector<SUnit *>::iterator I = find(Queue, SU);  in remove()
138   assert(I != Queue.end() && "Queue doesn't contain the SU being removed!");  in remove()
139   if (I != std::prev(Queue.end()))  in remove()
140     std::swap(*I, Queue.back());  in remove()
141   Queue.pop_back();  in remove()
147   dbgs() << "  Number of Queue Entries: " << Queue.size() << "\n";  in dump()
148   for (const SUnit *SU : Queue) {  in dump()