Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
55 SchedulingPriorityQueue *AvailableQueue; member in __anon606c8ffb0111::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()160 AvailableQueue->scheduledNode(SU); in scheduleNodeTopDown()175 AvailableQueue->push(&SUnits[i]); in listScheduleTopDown()184 while (!AvailableQueue->empty() || !PendingQueue.empty()) { in listScheduleTopDown()189 AvailableQueue->push(PendingQueue[i]); in listScheduleTopDown()202 if (AvailableQueue->empty()) { in listScheduleTopDown()[all …]
144 SchedulingPriorityQueue *AvailableQueue; member in __anona8f1daf90111::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 __anon50dbaec70111::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()
115 LatencyPriorityQueue AvailableQueue; member in __anon3e4a0d930111::SchedulePostRATDList417 AvailableQueue.initNodes(SUnits); in schedule()419 AvailableQueue.releaseState(); in schedule()508 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()537 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()550 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()556 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()566 AvailableQueue.dump(this)); in ListScheduleTopDown()570 while (!AvailableQueue.empty()) { in ListScheduleTopDown()571 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()[all …]