Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
49 /// AvailableQueue - The priority queue to use for the available SUnits.51 SchedulingPriorityQueue *AvailableQueue; member in __anon261ff4300111::ScheduleDAGVLIW 56 /// added to the AvailableQueue.68 : 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() 167 // All leaves to AvailableQueue. in listScheduleTopDown() 171 AvailableQueue in listScheduleTopDown() [all...]
144 SchedulingPriorityQueue *AvailableQueue; member in __anona90f206e0111::ScheduleDAGRRList193 AvailableQueue(availqueue), Topo(SUnits, nullptr) { in ScheduleDAGRRList()203 delete AvailableQueue; in ~ScheduleDAGRRList()247 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() || in isReady()248 AvailableQueue->isReady(SU); in isReady()378 AvailableQueue->initNodes(SUnits); in Schedule()385 AvailableQueue->releaseState(); in Schedule()429 AvailableQueue->push(PredSU); in ReleasePred()608 if (AvailableQueue->empty()) in ReleasePending()621 AvailableQueue->push(PendingQueue[i]); in ReleasePending()[all …]
67 FastPriorityQueue AvailableQueue; member in __anon168f12fc0111::ScheduleDAGFast152 AvailableQueue.push(PredSU); in ReleasePred()545 AvailableQueue.push(RootSU); in ListScheduleBottomUp()553 while (!AvailableQueue.empty()) { in ListScheduleBottomUp()556 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()566 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()629 AvailableQueue.push(SU); in ListScheduleBottomUp()
113 LatencyPriorityQueue AvailableQueue; member in __anonf33d7a280111::SchedulePostRATDList414 AvailableQueue.initNodes(SUnits); in schedule()416 AvailableQueue.releaseState(); in schedule()505 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()534 AvailableQueue.push(&SUnit); in ListScheduleTopDown()547 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()553 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()563 AvailableQueue.dump(this)); in ListScheduleTopDown()567 while (!AvailableQueue.empty()) { in ListScheduleTopDown()568 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()[all …]