Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
51 SchedulingPriorityQueue *AvailableQueue; member in __anona319e3600111::ScheduleDAGVLIW75 delete AvailableQueue; in ~ScheduleDAGVLIW()96 AvailableQueue->initNodes(SUnits); in Schedule()100 AvailableQueue->releaseState(); in Schedule()156 AvailableQueue->scheduledNode(SU); in scheduleNodeTopDown()171 AvailableQueue->push(&SU); in listScheduleTopDown()185 AvailableQueue->push(PendingQueue[i]); in listScheduleTopDown()198 if (AvailableQueue->empty()) { in listScheduleTopDown()200 AvailableQueue->scheduledNode(nullptr); in listScheduleTopDown()208 while (!AvailableQueue->empty()) { in listScheduleTopDown()[all …]
204 delete AvailableQueue; in ~ScheduleDAGRRList()249 AvailableQueue->isReady(SU); in isReady()383 AvailableQueue->releaseState(); in Schedule()606 if (AvailableQueue->empty()) in ReleasePending()920 AvailableQueue->push(SU); in UnscheduleNodeBottomUp()1213 AvailableQueue->updateNode(SU); in CopyAndMoveSuccessors()1214 AvailableQueue->addNode(NewSU); in CopyAndMoveSuccessors()1264 AvailableQueue->updateNode(SU); in InsertCopiesAndMoveSuccs()1463 AvailableQueue->push(SU); in releaseInterferences()1477 SUnit *CurSU = AvailableQueue->empty() ? nullptr : AvailableQueue->pop(); in PickNodeToScheduleBottomUp()[all …]
67 FastPriorityQueue AvailableQueue; member in __anon9389022c0111::ScheduleDAGFast152 AvailableQueue.push(PredSU); in ReleasePred()552 AvailableQueue.push(RootSU); in ListScheduleBottomUp()560 while (!AvailableQueue.empty()) { in ListScheduleBottomUp()563 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()573 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()636 AvailableQueue.push(NotReady[i]); in ListScheduleBottomUp()
113 LatencyPriorityQueue AvailableQueue; member in __anon3b4013580111::SchedulePostRATDList415 AvailableQueue.initNodes(SUnits); in schedule()417 AvailableQueue.releaseState(); in schedule()506 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()535 AvailableQueue.push(&SUnit); in ListScheduleTopDown()554 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()564 AvailableQueue.dump(this)); in ListScheduleTopDown()568 while (!AvailableQueue.empty()) { in ListScheduleTopDown()569 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()604 AvailableQueue.push(NotPreferredSUnit); in ListScheduleTopDown()[all …]