Home | History | Annotate | Download | only in SelectionDAG

Lines Matching refs:AvailableQueue

54   /// AvailableQueue - The priority queue to use for the available SUnits.
56   SchedulingPriorityQueue *AvailableQueue;
61   /// added to the AvailableQueue.
74     : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) {
81     delete AvailableQueue;
103   AvailableQueue->initNodes(SUnits);
107   AvailableQueue->releaseState();
164   AvailableQueue->scheduledNode(SU);
175   // All leaves to AvailableQueue.
179       AvailableQueue->push(&SUnits[i]);
184   // While AvailableQueue is not empty, grab the node with the highest
188   while (!AvailableQueue->empty() || !PendingQueue.empty()) {
193         AvailableQueue->push(PendingQueue[i]);
206     if (AvailableQueue->empty()) {
208       AvailableQueue->scheduledNode(nullptr);
216     while (!AvailableQueue->empty()) {
217       SUnit *CurSUnit = AvailableQueue->pop();
234       AvailableQueue->push_all(NotReady);