Lines Matching defs:AvailableQueue
49 /// AvailableQueue - The priority queue to use for the available SUnits.
51 SchedulingPriorityQueue *AvailableQueue;
56 /// added to the AvailableQueue.
68 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) {
75 delete AvailableQueue;
96 AvailableQueue->initNodes(SUnits);
100 AvailableQueue->releaseState();
156 AvailableQueue->scheduledNode(SU);
167 // All leaves to AvailableQueue.
171 AvailableQueue->push(&SU);
176 // While AvailableQueue is not empty, grab the node with the highest
180 while (!AvailableQueue->empty() || !PendingQueue.empty()) {
185 AvailableQueue->push(PendingQueue[i]);
198 if (AvailableQueue->empty()) {
200 AvailableQueue->scheduledNode(nullptr);
208 while (!AvailableQueue->empty()) {
209 SUnit *CurSUnit = AvailableQueue->pop();
226 AvailableQueue->push_all(NotReady);