Lines Matching defs:AvailableQueue

117   /// AvailableQueue - The priority queue to use for the available SUnits.
118 SchedulingPriorityQueue *AvailableQueue;
123 /// added to the AvailableQueue.
165 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
177 delete AvailableQueue;
213 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() ||
214 AvailableQueue->isReady(SU);
342 AvailableQueue->initNodes(SUnits);
349 AvailableQueue->releaseState();
363 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
393 AvailableQueue->push(PredSU);
576 if (AvailableQueue->empty())
589 AvailableQueue->push(PendingQueue[i]);
604 AvailableQueue->setCurCycle(NextCycle);
726 AvailableQueue->scheduledNode(SU);
777 // Check AvailableQueue after ReleasePredecessors in case of zero latency.
789 /// them from AvailableQueue if necessary.
795 AvailableQueue->remove(PredSU);
869 if (!DisableSchedCycles && AvailableQueue->hasReadyFilter()) {
875 AvailableQueue->push(SU);
877 AvailableQueue->unscheduledNode(SU);
910 AvailableQueue->setCurCycle(CurCycle);
1064 if (AvailableQueue->tracksRegPressure() && SuccDep->isScheduled
1086 AvailableQueue->addNode(LoadSU);
1087 AvailableQueue->addNode(NewSU);
1126 AvailableQueue->updateNode(SU);
1127 AvailableQueue->addNode(NewSU);
1178 AvailableQueue->updateNode(SU);
1179 AvailableQueue->addNode(CopyFromSU);
1180 AvailableQueue->addNode(CopyToSU);
1341 // now already in the AvailableQueue.
1344 AvailableQueue->push(SU);
1358 SUnit *CurSU = AvailableQueue->empty() ? 0 : AvailableQueue->pop();
1370 CurSU->isPending = true; // This SU is not in AvailableQueue right now.
1378 CurSU = AvailableQueue->pop();
1410 AvailableQueue->remove(BtSU);
1419 CurSU = AvailableQueue->pop();
1421 AvailableQueue->remove(TrySU);
1490 AvailableQueue->push(RootSU);
1496 while (!AvailableQueue->empty() || !Interferences.empty()) {
1498 AvailableQueue->dump(this));
1508 while (AvailableQueue->empty() && !PendingQueue.empty()) {