Searched refs:AvailableQueue (Results 1 – 4 of 4) sorted by relevance
55 SchedulingPriorityQueue *AvailableQueue; member in __anonf4ff1fe40111::ScheduleDAGVLIW79 delete AvailableQueue; in ~ScheduleDAGVLIW()100 AvailableQueue->initNodes(SUnits); in Schedule()104 AvailableQueue->releaseState(); in Schedule()160 AvailableQueue->scheduledNode(SU); in scheduleNodeTopDown()175 AvailableQueue->push(&SUnits[i]); in listScheduleTopDown()189 AvailableQueue->push(PendingQueue[i]); in listScheduleTopDown()202 if (AvailableQueue->empty()) { in listScheduleTopDown()204 AvailableQueue->scheduledNode(nullptr); in listScheduleTopDown()212 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()1450 AvailableQueue->push(SU); in releaseInterferences()1464 SUnit *CurSU = AvailableQueue->empty() ? nullptr : AvailableQueue->pop(); in PickNodeToScheduleBottomUp()[all …]
71 FastPriorityQueue AvailableQueue; member in __anone56e3eb00111::ScheduleDAGFast156 AvailableQueue.push(PredSU); in ReleasePred()535 AvailableQueue.push(RootSU); in ListScheduleBottomUp()543 while (!AvailableQueue.empty()) { in ListScheduleBottomUp()546 SUnit *CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()556 CurSU = AvailableQueue.pop(); in ListScheduleBottomUp()619 AvailableQueue.push(NotReady[i]); in ListScheduleBottomUp()
115 LatencyPriorityQueue AvailableQueue; member in __anon95040b5c0111::SchedulePostRATDList417 AvailableQueue.initNodes(SUnits); in schedule()419 AvailableQueue.releaseState(); in schedule()508 AvailableQueue.scheduledNode(SU); in ScheduleNodeTopDown()537 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()556 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()566 AvailableQueue.dump(this)); in ListScheduleTopDown()570 while (!AvailableQueue.empty()) { in ListScheduleTopDown()571 SUnit *CurSUnit = AvailableQueue.pop(); in ListScheduleTopDown()606 AvailableQueue.push(NotPreferredSUnit); in ListScheduleTopDown()[all …]