Searched refs:AvailableQueue (Results 1 – 8 of 8) sorted by relevance
56 SchedulingPriorityQueue *AvailableQueue; member in __anone83f7cd10111::ScheduleDAGVLIW74 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) { in ScheduleDAGVLIW()81 delete AvailableQueue; in ~ScheduleDAGVLIW()103 AvailableQueue->initNodes(SUnits); in Schedule()107 AvailableQueue->releaseState(); in Schedule()164 AvailableQueue->scheduledNode(SU); in scheduleNodeTopDown()179 AvailableQueue->push(&SUnits[i]); in listScheduleTopDown()188 while (!AvailableQueue->empty() || !PendingQueue.empty()) { in listScheduleTopDown()193 AvailableQueue->push(PendingQueue[i]); in listScheduleTopDown()206 if (AvailableQueue->empty()) { in listScheduleTopDown()[all …]
119 SchedulingPriorityQueue *AvailableQueue; member in __anon7133554f0111::ScheduleDAGRRList166 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0), in ScheduleDAGRRList()178 delete AvailableQueue; in ~ScheduleDAGRRList()214 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() || in isReady()215 AvailableQueue->isReady(SU); in isReady()343 AvailableQueue->initNodes(SUnits); in Schedule()350 AvailableQueue->releaseState(); in Schedule()394 AvailableQueue->push(PredSU); in ReleasePred()577 if (AvailableQueue->empty()) in ReleasePending()590 AvailableQueue->push(PendingQueue[i]); in ReleasePending()[all …]
71 FastPriorityQueue AvailableQueue; member in __anond8ae9b9d0111::ScheduleDAGFast157 AvailableQueue.push(PredSU); in ReleasePred()543 AvailableQueue.push(RootSU); in ListScheduleBottomUp()551 while (!AvailableQueue.empty()) { in ListScheduleBottomUp()554 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()564 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()627 AvailableQueue.push(NotReady[i]); in ListScheduleBottomUp()
53 SchedulingPriorityQueue *AvailableQueue; member in __anonfb32f5170111::ScheduleDAGList67 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue) { in ScheduleDAGList()75 delete AvailableQueue; in ~ScheduleDAGList()95 AvailableQueue->initNodes(SUnits); in Schedule()99 AvailableQueue->releaseState(); in Schedule()153 AvailableQueue->ScheduledNode(SU); in ScheduleNodeTopDown()168 AvailableQueue->push(&SUnits[i]); in ListScheduleTopDown()177 while (!AvailableQueue->empty() || !PendingQueue.empty()) { in ListScheduleTopDown()182 AvailableQueue->push(PendingQueue[i]); in ListScheduleTopDown()194 if (AvailableQueue->empty()) { in ListScheduleTopDown()[all …]
133 SchedulingPriorityQueue *AvailableQueue; member in __anon8a11067b0311::ScheduleDAGRRList170 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0), in ScheduleDAGRRList()182 delete AvailableQueue; in ~ScheduleDAGRRList()218 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() || in isReady()219 AvailableQueue->isReady(SU); in isReady()342 AvailableQueue->initNodes(SUnits); in Schedule()357 AvailableQueue->releaseState(); in Schedule()395 AvailableQueue->push(PredSU); in ReleasePred()454 if (AvailableQueue->empty()) in ReleasePending()468 AvailableQueue->push(PendingQueue[i]); in ReleasePending()[all …]
65 FastPriorityQueue AvailableQueue; member in __anon09d611c90111::ScheduleDAGFast151 AvailableQueue.push(PredSU); in ReleasePred()532 AvailableQueue.push(RootSU); in ListScheduleBottomUp()540 while (!AvailableQueue.empty()) { in ListScheduleBottomUp()543 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()553 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()620 AvailableQueue.push(NotReady[i]); in ListScheduleBottomUp()
117 LatencyPriorityQueue AvailableQueue; member in __anondd0201a90111::SchedulePostRATDList424 AvailableQueue.initNodes(SUnits); in schedule()426 AvailableQueue.releaseState(); in schedule()515 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()544 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()557 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()563 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()572 DEBUG(dbgs() << "\n*** Examining Available\n"; AvailableQueue.dump(this)); in ListScheduleTopDown()576 while (!AvailableQueue.empty()) { in ListScheduleTopDown()577 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()[all …]
113 LatencyPriorityQueue AvailableQueue; member in __anon74ed76550111::SchedulePostRATDList336 AvailableQueue.initNodes(SUnits); in Schedule()338 AvailableQueue.releaseState(); in Schedule()588 AvailableQueue.ScheduledNode(SU); in ScheduleNodeTopDown()610 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()623 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()629 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()638 DEBUG(dbgs() << "\n*** Examining Available\n"; AvailableQueue.dump(this)); in ListScheduleTopDown()642 while (!AvailableQueue.empty()) { in ListScheduleTopDown()643 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()[all …]