Searched refs:PendingQueue (Results 1 – 6 of 6) sorted by relevance
59 std::vector<SUnit*> PendingQueue; member in __anonfb32f5170111::ScheduleDAGList126 PendingQueue.push_back(SuccSU); in ReleaseSucc()177 while (!AvailableQueue->empty() || !PendingQueue.empty()) { in ListScheduleTopDown()180 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ListScheduleTopDown()181 if (PendingQueue[i]->getDepth() == CurCycle) { in ListScheduleTopDown()182 AvailableQueue->push(PendingQueue[i]); in ListScheduleTopDown()183 PendingQueue[i]->isAvailable = true; in ListScheduleTopDown()184 PendingQueue[i] = PendingQueue.back(); in ListScheduleTopDown()185 PendingQueue.pop_back(); in ListScheduleTopDown()188 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?"); in ListScheduleTopDown()
139 std::vector<SUnit*> PendingQueue; member in __anon8a11067b0311::ScheduleDAGRRList401 PendingQueue.push_back(PredSU); in ReleasePred()449 assert(PendingQueue.empty() && "pending instrs not allowed in this mode"); in ReleasePending()459 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ReleasePending()461 isBottomUp ? PendingQueue[i]->getHeight() : PendingQueue[i]->getDepth(); in ReleasePending()465 if (PendingQueue[i]->isAvailable) { in ReleasePending()466 if (!isReady(PendingQueue[i])) in ReleasePending()468 AvailableQueue->push(PendingQueue[i]); in ReleasePending()470 PendingQueue[i]->isPending = false; in ReleasePending()471 PendingQueue[i] = PendingQueue.back(); in ReleasePending()[all …]
62 std::vector<SUnit*> PendingQueue; member in __anone83f7cd10111::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 __anon7133554f0111::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 …]
123 std::vector<SUnit*> PendingQueue; member in __anondd0201a90111::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 …]
119 std::vector<SUnit*> PendingQueue; member in __anon74ed76550111::SchedulePostRATDList563 PendingQueue.push_back(SuccSU); in ReleaseSucc()623 while (!AvailableQueue.empty() || !PendingQueue.empty()) { in ListScheduleTopDown()627 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) { in ListScheduleTopDown()628 if (PendingQueue[i]->getDepth() <= CurCycle) { in ListScheduleTopDown()629 AvailableQueue.push(PendingQueue[i]); in ListScheduleTopDown()630 PendingQueue[i]->isAvailable = true; in ListScheduleTopDown()631 PendingQueue[i] = PendingQueue.back(); in ListScheduleTopDown()632 PendingQueue.pop_back(); in ListScheduleTopDown()634 } else if (PendingQueue[i]->getDepth() < MinDepth) in ListScheduleTopDown()[all …]