Lines Matching defs:AvailableQueue

49   /// AvailableQueue - The priority queue to use for the available SUnits.
51   SchedulingPriorityQueue *AvailableQueue;
56   /// added to the AvailableQueue.
63   ScheduleDAGVLIW(MachineFunction &MF, SchedulingPriorityQueue *AvailableQueue)
64       : ScheduleDAGSDNodes(MF), AvailableQueue(AvailableQueue) {
71     delete AvailableQueue;
92   AvailableQueue->initNodes(SUnits);
96   AvailableQueue->releaseState();
152   AvailableQueue->scheduledNode(SU);
163   // All leaves to AvailableQueue.
167       AvailableQueue->push(&SU);
172   // While AvailableQueue is not empty, grab the node with the highest
176   while (!AvailableQueue->empty() || !PendingQueue.empty()) {
181         AvailableQueue->push(PendingQueue[i]);
194     if (AvailableQueue->empty()) {
196       AvailableQueue->scheduledNode(nullptr);
204     while (!AvailableQueue->empty()) {
205       SUnit *CurSUnit = AvailableQueue->pop();
222       AvailableQueue->push_all(NotReady);