Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
51 SchedulingPriorityQueue *AvailableQueue; member in __anon261ff4300111::ScheduleDAGVLIW63 ScheduleDAGVLIW(MachineFunction &MF, SchedulingPriorityQueue *AvailableQueue) in ScheduleDAGVLIW() argument64 : ScheduleDAGSDNodes(MF), AvailableQueue(AvailableQueue) { in ScheduleDAGVLIW()71 delete AvailableQueue; in ~ScheduleDAGVLIW()92 AvailableQueue->initNodes(SUnits); in Schedule()96 AvailableQueue->releaseState(); in Schedule()152 AvailableQueue->scheduledNode(SU); in scheduleNodeTopDown()167 AvailableQueue->push(&SU); in listScheduleTopDown()176 while (!AvailableQueue->empty() || !PendingQueue.empty()) { in listScheduleTopDown()181 AvailableQueue->push(PendingQueue[i]); 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::ScheduleDAGFast146 AvailableQueue.push(PredSU); in ReleasePred()538 AvailableQueue.push(RootSU); in ListScheduleBottomUp()546 while (!AvailableQueue.empty()) { in ListScheduleBottomUp()549 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()559 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()622 AvailableQueue.push(SU); in ListScheduleBottomUp()
119 LatencyPriorityQueue AvailableQueue; member in __anonf33d7a280111::SchedulePostRATDList436 AvailableQueue.initNodes(SUnits); in schedule()438 AvailableQueue.releaseState(); in schedule()527 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()556 AvailableQueue.push(&SUnit); in ListScheduleTopDown()569 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()575 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()585 AvailableQueue.dump(this)); in ListScheduleTopDown()589 while (!AvailableQueue.empty()) { in ListScheduleTopDown()590 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()[all …]