Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
51 SchedulingPriorityQueue *AvailableQueue; member in __anonf67a95e60111::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 …]
203 delete AvailableQueue; in ~ScheduleDAGRRList()248 AvailableQueue->isReady(SU); in isReady()385 AvailableQueue->releaseState(); in Schedule()608 if (AvailableQueue->empty()) in ReleasePending()922 AvailableQueue->push(SU); in UnscheduleNodeBottomUp()1210 AvailableQueue->updateNode(SU); in CopyAndMoveSuccessors()1211 AvailableQueue->addNode(NewSU); in CopyAndMoveSuccessors()1261 AvailableQueue->updateNode(SU); in InsertCopiesAndMoveSuccs()1458 AvailableQueue->push(SU); in releaseInterferences()1472 SUnit *CurSU = AvailableQueue->empty() ? nullptr : AvailableQueue->pop(); in PickNodeToScheduleBottomUp()[all …]
67 FastPriorityQueue AvailableQueue; member in __anone6e9b4b20111::ScheduleDAGFast152 AvailableQueue.push(PredSU); in ReleasePred()545 AvailableQueue.push(RootSU); in ListScheduleBottomUp()553 while (!AvailableQueue.empty()) { in ListScheduleBottomUp()556 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()566 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()629 AvailableQueue.push(NotReady[i]); in ListScheduleBottomUp()
113 LatencyPriorityQueue AvailableQueue; member in __anon74cf271e0111::SchedulePostRATDList414 AvailableQueue.initNodes(SUnits); in schedule()416 AvailableQueue.releaseState(); in schedule()505 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()534 AvailableQueue.push(&SUnit); in ListScheduleTopDown()553 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()563 AvailableQueue.dump(this)); in ListScheduleTopDown()567 while (!AvailableQueue.empty()) { in ListScheduleTopDown()568 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()603 AvailableQueue.push(NotPreferredSUnit); in ListScheduleTopDown()[all …]