Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
51 SchedulingPriorityQueue *AvailableQueue; member in __anond3acb4c70111::ScheduleDAGVLIW68 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) { in ScheduleDAGVLIW()75 delete AvailableQueue; in ~ScheduleDAGVLIW()96 AvailableQueue->initNodes(SUnits); in Schedule()100 AvailableQueue->releaseState(); in Schedule()156 AvailableQueue->scheduledNode(SU); in scheduleNodeTopDown()171 AvailableQueue->push(&SU); in listScheduleTopDown()180 while (!AvailableQueue->empty() || !PendingQueue.empty()) { in listScheduleTopDown()185 AvailableQueue->push(PendingQueue[i]); in listScheduleTopDown()198 if (AvailableQueue->empty()) { in listScheduleTopDown()[all …]
144 SchedulingPriorityQueue *AvailableQueue; member in __anonecce62c50111::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()379 AvailableQueue->initNodes(SUnits); in Schedule()386 AvailableQueue->releaseState(); in Schedule()430 AvailableQueue->push(PredSU); in ReleasePred()609 if (AvailableQueue->empty()) in ReleasePending()622 AvailableQueue->push(PendingQueue[i]); in ReleasePending()[all …]
67 FastPriorityQueue AvailableQueue; member in __anonc41bd3930111::ScheduleDAGFast152 AvailableQueue.push(PredSU); in ReleasePred()550 AvailableQueue.push(RootSU); in ListScheduleBottomUp()558 while (!AvailableQueue.empty()) { in ListScheduleBottomUp()561 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()571 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()634 AvailableQueue.push(NotReady[i]); in ListScheduleBottomUp()
113 LatencyPriorityQueue AvailableQueue; member in __anon86c23cdf0111::SchedulePostRATDList415 AvailableQueue.initNodes(SUnits); in schedule()417 AvailableQueue.releaseState(); in schedule()506 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()535 AvailableQueue.push(&SUnit); in ListScheduleTopDown()548 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()554 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()564 AvailableQueue.dump(this)); in ListScheduleTopDown()568 while (!AvailableQueue.empty()) { in ListScheduleTopDown()569 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()[all …]