Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
56 SchedulingPriorityQueue *AvailableQueue; member in __anon8855f2d50111::ScheduleDAGVLIW81 delete AvailableQueue; in ~ScheduleDAGVLIW()102 AvailableQueue->initNodes(SUnits); in Schedule()106 AvailableQueue->releaseState(); in Schedule()163 AvailableQueue->scheduledNode(SU); in scheduleNodeTopDown()178 AvailableQueue->push(&SUnits[i]); in listScheduleTopDown()192 AvailableQueue->push(PendingQueue[i]); in listScheduleTopDown()205 if (AvailableQueue->empty()) { in listScheduleTopDown()207 AvailableQueue->scheduledNode(nullptr); in listScheduleTopDown()215 while (!AvailableQueue->empty()) { in listScheduleTopDown()[all …]
205 delete AvailableQueue; in ~ScheduleDAGRRList()242 AvailableQueue->isReady(SU); in isReady()378 AvailableQueue->releaseState(); in Schedule()601 if (AvailableQueue->empty()) in ReleasePending()914 AvailableQueue->push(SU); in UnscheduleNodeBottomUp()1202 AvailableQueue->updateNode(SU); in CopyAndMoveSuccessors()1203 AvailableQueue->addNode(NewSU); in CopyAndMoveSuccessors()1253 AvailableQueue->updateNode(SU); in InsertCopiesAndMoveSuccs()1438 AvailableQueue->push(SU); in releaseInterferences()1452 SUnit *CurSU = AvailableQueue->empty() ? nullptr : AvailableQueue->pop(); in PickNodeToScheduleBottomUp()[all …]
72 FastPriorityQueue AvailableQueue; member in __anon78c511a10111::ScheduleDAGFast157 AvailableQueue.push(PredSU); in ReleasePred()535 AvailableQueue.push(RootSU); in ListScheduleBottomUp()543 while (!AvailableQueue.empty()) { in ListScheduleBottomUp()546 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()556 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()619 AvailableQueue.push(NotReady[i]); in ListScheduleBottomUp()
117 LatencyPriorityQueue AvailableQueue; member in __anon0a44832d0111::SchedulePostRATDList419 AvailableQueue.initNodes(SUnits); in schedule()421 AvailableQueue.releaseState(); in schedule()510 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()539 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()558 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()568 AvailableQueue.dump(this)); in ListScheduleTopDown()572 while (!AvailableQueue.empty()) { in ListScheduleTopDown()573 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()608 AvailableQueue.push(NotPreferredSUnit); in ListScheduleTopDown()[all …]