Lines Matching defs:AvailableQueue

143   /// AvailableQueue - The priority queue to use for the available SUnits.
144   SchedulingPriorityQueue *AvailableQueue;
149   /// added to the AvailableQueue.
193         AvailableQueue(availqueue), Topo(SUnits, nullptr) {
203     delete AvailableQueue;
247     return DisableSchedCycles || !AvailableQueue->hasReadyFilter() ||
248       AvailableQueue->isReady(SU);
378   AvailableQueue->initNodes(SUnits);
385   AvailableQueue->releaseState();
399 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
429       AvailableQueue->push(PredSU);
608   if (AvailableQueue->empty())
621       AvailableQueue->push(PendingQueue[i]);
636   AvailableQueue->setCurCycle(NextCycle);
759   AvailableQueue->scheduledNode(SU);
809   // Check AvailableQueue after ReleasePredecessors in case of zero latency.
821 /// them from AvailableQueue if necessary.
827       AvailableQueue->remove(PredSU);
916   if (!DisableSchedCycles && AvailableQueue->hasReadyFilter()) {
922     AvailableQueue->push(SU);
924   AvailableQueue->unscheduledNode(SU);
957     AvailableQueue->setCurCycle(CurCycle);
1096     if (AvailableQueue->tracksRegPressure() && SuccDep->isScheduled &&
1117     AvailableQueue->addNode(LoadSU);
1119     AvailableQueue->addNode(NewSU);
1210   AvailableQueue->updateNode(SU);
1211   AvailableQueue->addNode(NewSU);
1261   AvailableQueue->updateNode(SU);
1262   AvailableQueue->addNode(CopyFromSU);
1263   AvailableQueue->addNode(CopyToSU);
1455     // now already in the AvailableQueue.
1458       AvailableQueue->push(SU);
1472   SUnit *CurSU = AvailableQueue->empty() ? nullptr : AvailableQueue->pop();
1484         CurSU->isPending = true;  // This SU is not in AvailableQueue right now.
1492       CurSU = AvailableQueue->pop();
1529           AvailableQueue->remove(BtSU);
1539         CurSU = AvailableQueue->pop();
1542         // Available and in AvailableQueue
1543         AvailableQueue->remove(TrySU);
1613     AvailableQueue->push(RootSU);
1619   while (!AvailableQueue->empty() || !Interferences.empty()) {
1621                AvailableQueue->dump(this));
1631     while (AvailableQueue->empty() && !PendingQueue.empty()) {