Lines Matching refs:AvailableQueue
52 /// AvailableQueue - The priority queue to use for the available SUnits.
54 SchedulingPriorityQueue *AvailableQueue;
59 /// added to the AvailableQueue.
72 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) {
80 delete AvailableQueue;
102 AvailableQueue->initNodes(SUnits);
106 AvailableQueue->releaseState();
163 AvailableQueue->scheduledNode(SU);
174 // All leaves to AvailableQueue.
178 AvailableQueue->push(&SUnits[i]);
183 // While AvailableQueue is not empty, grab the node with the highest
187 while (!AvailableQueue->empty() || !PendingQueue.empty()) {
192 AvailableQueue->push(PendingQueue[i]);
205 if (AvailableQueue->empty()) {
207 AvailableQueue->scheduledNode(0);
215 while (!AvailableQueue->empty()) {
216 SUnit *CurSUnit = AvailableQueue->pop();
233 AvailableQueue->push_all(NotReady);
