HomeSort by relevance Sort by last modified time
    Searched refs:PendingQueue (Results 1 - 3 of 3) sorted by null

  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGVLIW.cpp 56 /// PendingQueue - This contains all of the instructions whose operands have
60 std::vector<SUnit*> PendingQueue;
114 /// the PendingQueue if the count reaches zero. Also update its cycle bound.
135 PendingQueue.push_back(SuccSU);
187 while (!AvailableQueue->empty() || !PendingQueue.empty()) {
190 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
191 if (PendingQueue[i]->getDepth() == CurCycle) {
192 AvailableQueue->push(PendingQueue[i]);
193 PendingQueue[i]->isAvailable = true;
194 PendingQueue[i] = PendingQueue.back()
    [all...]
ScheduleDAGRRList.cpp 120 /// PendingQueue - This contains all of the instructions whose operands have
124 std::vector<SUnit*> PendingQueue;
399 PendingQueue.push_back(PredSU);
571 assert(PendingQueue.empty() && "pending instrs not allowed in this mode");
581 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
582 unsigned ReadyCycle = PendingQueue[i]->getHeight();
586 if (PendingQueue[i]->isAvailable) {
587 if (!isReady(PendingQueue[i]))
589 AvailableQueue->push(PendingQueue[i]);
591 PendingQueue[i]->isPending = false
    [all...]
  /external/llvm/lib/CodeGen/
PostRASchedulerList.cpp 109 /// PendingQueue - This contains all of the instructions whose operands have
113 std::vector<SUnit*> PendingQueue;
562 /// the PendingQueue if the count reaches zero.
594 PendingQueue.push_back(SuccSU);
653 while (!AvailableQueue.empty() || !PendingQueue.empty()) {
657 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
658 if (PendingQueue[i]->getDepth() <= CurCycle) {
659 AvailableQueue.push(PendingQueue[i]);
660 PendingQueue[i]->isAvailable = true;
661 PendingQueue[i] = PendingQueue.back()
    [all...]

Completed in 27 milliseconds