Searched refs:PendingQueue (Results 1 – 4 of 4) sorted by relevance
57 std::vector<SUnit*> PendingQueue; member in __anona319e3600111::ScheduleDAGVLIW129 PendingQueue.push_back(SuccSU); in releaseSucc()180 while (!AvailableQueue->empty() || !PendingQueue.empty()) { in listScheduleTopDown()183 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in listScheduleTopDown()184 if (PendingQueue[i]->getDepth() == CurCycle) { in listScheduleTopDown()185 AvailableQueue->push(PendingQueue[i]); in listScheduleTopDown()186 PendingQueue[i]->isAvailable = true; in listScheduleTopDown()187 PendingQueue[i] = PendingQueue.back(); in listScheduleTopDown()188 PendingQueue.pop_back(); in listScheduleTopDown()192 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?"); in listScheduleTopDown()
150 std::vector<SUnit *> PendingQueue; member in __anon4c419b9e0111::ScheduleDAGRRList433 PendingQueue.push_back(PredSU); in ReleasePred()611 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ReleasePending()612 unsigned ReadyCycle = PendingQueue[i]->getHeight(); in ReleasePending()616 if (PendingQueue[i]->isAvailable) { in ReleasePending()617 if (!isReady(PendingQueue[i])) in ReleasePending()619 AvailableQueue->push(PendingQueue[i]); in ReleasePending()621 PendingQueue[i]->isPending = false; in ReleasePending()622 PendingQueue[i] = PendingQueue.back(); in ReleasePending()623 PendingQueue.pop_back(); in ReleasePending()[all …]
119 std::vector<SUnit*> PendingQueue; member in __anon3b4013580111::SchedulePostRATDList481 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()[all …]
31 Queue PendingQueue; member in __anoned9f76670111::GCNILPScheduler257 for(auto I = PendingQueue.begin(), E = PendingQueue.end(); I != E;) { in releasePending()260 PendingQueue.remove(C); in releasePending()285 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()315 if (AvailQueue.empty() && !PendingQueue.empty()) { in schedule()317 PendingQueue.begin(), PendingQueue.end(), in schedule()