Searched refs:PendingQueue (Results 1 – 4 of 4) sorted by relevance
62 std::vector<SUnit*> PendingQueue; member in __anon8855f2d50111::ScheduleDAGVLIW135 PendingQueue.push_back(SuccSU); in releaseSucc()187 while (!AvailableQueue->empty() || !PendingQueue.empty()) { in listScheduleTopDown()190 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in listScheduleTopDown()191 if (PendingQueue[i]->getDepth() == CurCycle) { in listScheduleTopDown()192 AvailableQueue->push(PendingQueue[i]); in listScheduleTopDown()193 PendingQueue[i]->isAvailable = true; in listScheduleTopDown()194 PendingQueue[i] = PendingQueue.back(); in listScheduleTopDown()195 PendingQueue.pop_back(); in listScheduleTopDown()199 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?"); in listScheduleTopDown()
151 std::vector<SUnit *> PendingQueue; member in __anon70bf5c530111::ScheduleDAGRRList428 PendingQueue.push_back(PredSU); in ReleasePred()606 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ReleasePending()607 unsigned ReadyCycle = PendingQueue[i]->getHeight(); in ReleasePending()611 if (PendingQueue[i]->isAvailable) { in ReleasePending()612 if (!isReady(PendingQueue[i])) in ReleasePending()614 AvailableQueue->push(PendingQueue[i]); in ReleasePending()616 PendingQueue[i]->isPending = false; in ReleasePending()617 PendingQueue[i] = PendingQueue.back(); in ReleasePending()618 PendingQueue.pop_back(); in ReleasePending()[all …]
123 std::vector<SUnit*> PendingQueue; member in __anon0a44832d0111::SchedulePostRATDList485 PendingQueue.push_back(SuccSU); in ReleaseSucc()552 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()556 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ListScheduleTopDown()557 if (PendingQueue[i]->getDepth() <= CurCycle) { in ListScheduleTopDown()558 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()559 PendingQueue[i]->isAvailable = true; in ListScheduleTopDown()560 PendingQueue[i] = PendingQueue.back(); in ListScheduleTopDown()561 PendingQueue.pop_back(); in ListScheduleTopDown()563 } else if (PendingQueue[i]->getDepth() < MinDepth) in ListScheduleTopDown()[all …]
32 Queue PendingQueue; member in __anon07abecfc0111::GCNILPScheduler258 for(auto I = PendingQueue.begin(), E = PendingQueue.end(); I != E;) { in releasePending()261 PendingQueue.remove(C); in releasePending()286 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()316 if (AvailQueue.empty() && !PendingQueue.empty()) { in schedule()318 PendingQueue.begin(), PendingQueue.end(), in schedule()