Searched refs:PendingQueue (Results 1 – 4 of 4) sorted by relevance
53 /// PendingQueue - This contains all of the instructions whose operands have57 std::vector<SUnit*> PendingQueue; member in __anon261ff4300111::ScheduleDAGVLIW 108 /// the PendingQueue if the count reaches zero. Also update its cycle bound.129 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[ in listScheduleTopDown() [all...]
150 std::vector<SUnit *> PendingQueue; member in __anona90f206e0111::ScheduleDAGRRList435 PendingQueue.push_back(PredSU); in ReleasePred()603 assert(PendingQueue.empty() && "pending instrs not allowed in this mode"); in ReleasePending()613 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ReleasePending()614 unsigned ReadyCycle = PendingQueue[i]->getHeight(); in ReleasePending()618 if (PendingQueue[i]->isAvailable) { in ReleasePending()619 if (!isReady(PendingQueue[i])) in ReleasePending()621 AvailableQueue->push(PendingQueue[i]); in ReleasePending()623 PendingQueue[i]->isPending = false; in ReleasePending()624 PendingQueue[i] = PendingQueue.back(); in ReleasePending()[all …]
119 std::vector<SUnit*> PendingQueue; member in __anonf33d7a280111::SchedulePostRATDList480 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()[all …]
31 Queue PendingQueue; member in __anon1a74e9370111::GCNILPScheduler255 for(auto I = PendingQueue.begin(), E = PendingQueue.end(); I != E;) { in releasePending()258 PendingQueue.remove(C); in releasePending()283 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()313 if (AvailQueue.empty() && !PendingQueue.empty()) { in schedule()315 llvm::min_element(PendingQueue, [=](const Candidate &C1, in schedule()