Lines Matching refs:PendingQueue
123 std::vector<SUnit*> PendingQueue; member in __anond49cb7ca0111::SchedulePostRATDList
490 PendingQueue.push_back(SuccSU); in ReleaseSucc()
557 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()
561 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ListScheduleTopDown()
562 if (PendingQueue[i]->getDepth() <= CurCycle) { in ListScheduleTopDown()
563 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()
564 PendingQueue[i]->isAvailable = true; in ListScheduleTopDown()
565 PendingQueue[i] = PendingQueue.back(); in ListScheduleTopDown()
566 PendingQueue.pop_back(); in ListScheduleTopDown()
568 } else if (PendingQueue[i]->getDepth() < MinDepth) in ListScheduleTopDown()
569 MinDepth = PendingQueue[i]->getDepth(); in ListScheduleTopDown()