Lines Matching refs:AvailableQueue
118 /// AvailableQueue - The priority queue to use for the available SUnits.
119 SchedulingPriorityQueue *AvailableQueue;
124 /// added to the AvailableQueue.
166 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
178 delete AvailableQueue;
214 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() ||
215 AvailableQueue->isReady(SU);
343 AvailableQueue->initNodes(SUnits);
350 AvailableQueue->releaseState();
364 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
394 AvailableQueue->push(PredSU);
577 if (AvailableQueue->empty())
590 AvailableQueue->push(PendingQueue[i]);
605 AvailableQueue->setCurCycle(NextCycle);
727 AvailableQueue->scheduledNode(SU);
778 // Check AvailableQueue after ReleasePredecessors in case of zero latency.
790 /// them from AvailableQueue if necessary.
796 AvailableQueue->remove(PredSU);
879 if (!DisableSchedCycles && AvailableQueue->hasReadyFilter()) {
885 AvailableQueue->push(SU);
887 AvailableQueue->unscheduledNode(SU);
920 AvailableQueue->setCurCycle(CurCycle);
1067 if (AvailableQueue->tracksRegPressure() && SuccDep->isScheduled
1088 AvailableQueue->addNode(LoadSU);
1089 AvailableQueue->addNode(NewSU);
1126 AvailableQueue->updateNode(SU);
1127 AvailableQueue->addNode(NewSU);
1177 AvailableQueue->updateNode(SU);
1178 AvailableQueue->addNode(CopyFromSU);
1179 AvailableQueue->addNode(CopyToSU);
1348 // now already in the AvailableQueue.
1351 AvailableQueue->push(SU);
1365 SUnit *CurSU = AvailableQueue->empty() ? nullptr : AvailableQueue->pop();
1377 AvailableQueue right now.
1385 CurSU = AvailableQueue->pop();
1415 AvailableQueue->remove(BtSU);
1424 CurSU = AvailableQueue->pop();
1426 // Available and in AvailableQueue
1427 AvailableQueue->remove(TrySU);
1496 AvailableQueue->push(RootSU);
1502 while (!AvailableQueue->empty() || !Interferences.empty()) {
1504 AvailableQueue->dump(this));
1514 while (AvailableQueue->empty() && !PendingQueue.empty()) {
