Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
56 SchedulingPriorityQueue *AvailableQueue; member in __anon15a3a8120111::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 __anon884f54d00111::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 __anon0612c6de0111::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()
111 LatencyPriorityQueue AvailableQueue; member in __anond49cb7ca0111::SchedulePostRATDList409 AvailableQueue.initNodes(SUnits); in schedule()411 AvailableQueue.releaseState(); in schedule()494 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()523 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()536 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()542 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()551 DEBUG(dbgs() << "\n*** Examining Available\n"; AvailableQueue.dump(this)); in ListScheduleTopDown()555 while (!AvailableQueue.empty()) { in ListScheduleTopDown()556 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()[all …]