Searched refs:PendingQueue (Results 1 – 7 of 7) sorted by relevance
62 std::vector<SUnit*> PendingQueue; member in __anonc8155c5d0111::ScheduleDAGVLIW136 PendingQueue.push_back(SuccSU); in releaseSucc()188 while (!AvailableQueue->empty() || !PendingQueue.empty()) { in listScheduleTopDown()191 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in listScheduleTopDown()192 if (PendingQueue[i]->getDepth() == CurCycle) { in listScheduleTopDown()193 AvailableQueue->push(PendingQueue[i]); in listScheduleTopDown()194 PendingQueue[i]->isAvailable = true; in listScheduleTopDown()195 PendingQueue[i] = PendingQueue.back(); in listScheduleTopDown()196 PendingQueue.pop_back(); in listScheduleTopDown()200 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?"); in listScheduleTopDown()
125 std::vector<SUnit*> PendingQueue; member in __anon9dff47db0111::ScheduleDAGRRList400 PendingQueue.push_back(PredSU); in ReleasePred()572 assert(PendingQueue.empty() && "pending instrs not allowed in this mode"); in ReleasePending()582 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ReleasePending()583 unsigned ReadyCycle = PendingQueue[i]->getHeight(); in ReleasePending()587 if (PendingQueue[i]->isAvailable) { in ReleasePending()588 if (!isReady(PendingQueue[i])) in ReleasePending()590 AvailableQueue->push(PendingQueue[i]); in ReleasePending()592 PendingQueue[i]->isPending = false; in ReleasePending()593 PendingQueue[i] = PendingQueue.back(); in ReleasePending()[all …]
62 std::vector<SUnit*> PendingQueue; member in __anon6362e3f50111::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 __anon42cd15730111::ScheduleDAGRRList428 PendingQueue.push_back(PredSU); in ReleasePred()596 assert(PendingQueue.empty() && "pending instrs not allowed in this mode"); in ReleasePending()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()[all …]
123 std::vector<SUnit*> PendingQueue; member in __anone97cb04d0111::SchedulePostRATDList489 PendingQueue.push_back(SuccSU); in ReleaseSucc()556 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()560 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ListScheduleTopDown()561 if (PendingQueue[i]->getDepth() <= CurCycle) { in ListScheduleTopDown()562 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()563 PendingQueue[i]->isAvailable = true; in ListScheduleTopDown()564 PendingQueue[i] = PendingQueue.back(); in ListScheduleTopDown()565 PendingQueue.pop_back(); in ListScheduleTopDown()567 } else if (PendingQueue[i]->getDepth() < MinDepth) in ListScheduleTopDown()[all …]
123 std::vector<SUnit*> PendingQueue; member in __anon160cd3b50111::SchedulePostRATDList490 PendingQueue.push_back(SuccSU); in ReleaseSucc()557 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()561 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ListScheduleTopDown()562 if (PendingQueue[i]->getDepth() <= CurCycle) { in ListScheduleTopDown()563 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()564 PendingQueue[i]->isAvailable = true; in ListScheduleTopDown()565 PendingQueue[i] = PendingQueue.back(); in ListScheduleTopDown()566 PendingQueue.pop_back(); in ListScheduleTopDown()568 } else if (PendingQueue[i]->getDepth() < MinDepth) in ListScheduleTopDown()[all …]
32 Queue PendingQueue; member in __anonfab6521c0111::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()