Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
55 SchedulingPriorityQueue *AvailableQueue; member in __anon389165470111::ScheduleDAGVLIW72 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) { in ScheduleDAGVLIW()79 delete AvailableQueue; in ~ScheduleDAGVLIW()100 AvailableQueue->initNodes(SUnits); in Schedule()104 AvailableQueue->releaseState(); in Schedule()161 AvailableQueue->scheduledNode(SU); in scheduleNodeTopDown()176 AvailableQueue->push(&SUnits[i]); in listScheduleTopDown()185 while (!AvailableQueue->empty() || !PendingQueue.empty()) { in listScheduleTopDown()190 AvailableQueue->push(PendingQueue[i]); in listScheduleTopDown()203 if (AvailableQueue->empty()) { in listScheduleTopDown()[all …]
144 SchedulingPriorityQueue *AvailableQueue; member in __anon1da133450111::ScheduleDAGRRList193 NeedLatency(needlatency), AvailableQueue(availqueue), in ScheduleDAGRRList()204 delete AvailableQueue; in ~ScheduleDAGRRList()248 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() || in isReady()249 AvailableQueue->isReady(SU); in isReady()376 AvailableQueue->initNodes(SUnits); in Schedule()383 AvailableQueue->releaseState(); in Schedule()427 AvailableQueue->push(PredSU); in ReleasePred()606 if (AvailableQueue->empty()) in ReleasePending()619 AvailableQueue->push(PendingQueue[i]); in ReleasePending()[all …]
71 FastPriorityQueue AvailableQueue; member in __anon290084130111::ScheduleDAGFast156 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 __anoncd3a5d5f0111::SchedulePostRATDList419 AvailableQueue.initNodes(SUnits); in schedule()421 AvailableQueue.releaseState(); in schedule()510 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()539 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()552 while (!AvailableQueue.empty() || !PendingQueue.empty()) { 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()[all …]