Lines Matching refs:PendingQueue
119 std::vector<SUnit*> PendingQueue; member in __anonf33d7a280111::SchedulePostRATDList
480 PendingQueue.push_back(SuccSU); in ReleaseSucc()
547 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()
551 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ListScheduleTopDown()
552 if (PendingQueue[i]->getDepth() <= CurCycle) { in ListScheduleTopDown()
553 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()
554 PendingQueue[i]->isAvailable = true; in ListScheduleTopDown()
555 PendingQueue[i] = PendingQueue.back(); in ListScheduleTopDown()
556 PendingQueue.pop_back(); in ListScheduleTopDown()
558 } else if (PendingQueue[i]->getDepth() < MinDepth) in ListScheduleTopDown()
559 MinDepth = PendingQueue[i]->getDepth(); in ListScheduleTopDown()