Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
54 SchedulingPriorityQueue *AvailableQueue; member in __anona59b0e580111::ScheduleDAGVLIW72 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) { in ScheduleDAGVLIW()80 delete AvailableQueue; in ~ScheduleDAGVLIW()102 AvailableQueue->initNodes(SUnits); in Schedule()106 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 …]
117 SchedulingPriorityQueue *AvailableQueue; member in __anonf3b964960111::ScheduleDAGRRList158 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0), in ScheduleDAGRRList()170 delete AvailableQueue; in ~ScheduleDAGRRList()206 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() || in isReady()207 AvailableQueue->isReady(SU); in isReady()323 AvailableQueue->initNodes(SUnits); in Schedule()330 AvailableQueue->releaseState(); in Schedule()374 AvailableQueue->push(PredSU); in ReleasePred()557 if (AvailableQueue->empty()) in ReleasePending()570 AvailableQueue->push(PendingQueue[i]); in ReleasePending()[all …]
65 FastPriorityQueue AvailableQueue; member in __anon960a2d240111::ScheduleDAGFast151 AvailableQueue.push(PredSU); in ReleasePred()527 AvailableQueue.push(RootSU); in ListScheduleBottomUp()535 while (!AvailableQueue.empty()) { in ListScheduleBottomUp()538 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()548 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()615 AvailableQueue.push(NotReady[i]); in ListScheduleBottomUp()
106 LatencyPriorityQueue AvailableQueue; member in __anonae3b47500111::SchedulePostRATDList394 AvailableQueue.initNodes(SUnits); in schedule()396 AvailableQueue.releaseState(); in schedule()637 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()659 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()672 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()678 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()687 DEBUG(dbgs() << "\n*** Examining Available\n"; AvailableQueue.dump(this)); in ListScheduleTopDown()691 while (!AvailableQueue.empty()) { in ListScheduleTopDown()692 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()[all …]