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