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

  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGVLIW.cpp 58 /// PendingQueue - This contains all of the instructions whose operands have
62 std::vector<SUnit*> PendingQueue;
115 /// the PendingQueue if the count reaches zero. Also update its cycle bound.
136 PendingQueue.push_back(SuccSU);
188 while (!AvailableQueue->empty() || !PendingQueue.empty()) {
191 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
192 if (PendingQueue[i]->getDepth() == CurCycle) {
193 AvailableQueue->push(PendingQueue[i]);
194 PendingQueue[i]->isAvailable = true;
195 PendingQueue[i] = PendingQueue.back()
    [all...]
ScheduleDAGRRList.cpp 121 /// PendingQueue - This contains all of the instructions whose operands have
125 std::vector<SUnit*> PendingQueue;
400 PendingQueue.push_back(PredSU);
572 assert(PendingQueue.empty() && "pending instrs not allowed in this mode");
582 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
583 unsigned ReadyCycle = PendingQueue[i]->getHeight();
587 if (PendingQueue[i]->isAvailable) {
588 if (!isReady(PendingQueue[i]))
590 AvailableQueue->push(PendingQueue[i]);
592 PendingQueue[i]->isPending = false
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
ScheduleDAGList.cpp 55 /// PendingQueue - This contains all of the instructions whose operands have
59 std::vector<SUnit*> PendingQueue;
107 /// the PendingQueue if the count reaches zero. Also update its cycle bound.
126 PendingQueue.push_back(SuccSU);
177 while (!AvailableQueue->empty() || !PendingQueue.empty()) {
180 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
181 if (PendingQueue[i]->getDepth() == CurCycle) {
182 AvailableQueue->push(PendingQueue[i]);
183 PendingQueue[i]->isAvailable = true;
184 PendingQueue[i] = PendingQueue.back()
    [all...]
ScheduleDAGRRList.cpp 135 /// PendingQueue - This contains all of the instructions whose operands have
139 std::vector<SUnit*> PendingQueue;
401 PendingQueue.push_back(PredSU);
449 assert(PendingQueue.empty() && "pending instrs not allowed in this mode");
459 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
461 isBottomUp ? PendingQueue[i]->getHeight() : PendingQueue[i]->getDepth();
465 if (PendingQueue[i]->isAvailable) {
466 if (!isReady(PendingQueue[i]))
468 AvailableQueue->push(PendingQueue[i])
    [all...]
  /external/llvm/lib/CodeGen/
PostRASchedulerList.cpp 119 /// PendingQueue - This contains all of the instructions whose operands have
123 std::vector<SUnit*> PendingQueue;
458 /// the PendingQueue if the count reaches zero.
490 PendingQueue.push_back(SuccSU);
557 while (!AvailableQueue.empty() || !PendingQueue.empty()) {
561 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
562 if (PendingQueue[i]->getDepth() <= CurCycle) {
563 AvailableQueue.push(PendingQueue[i]);
564 PendingQueue[i]->isAvailable = true;
565 PendingQueue[i] = PendingQueue.back()
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
PostRASchedulerList.cpp 115 /// PendingQueue - This contains all of the instructions whose operands have
119 std::vector<SUnit*> PendingQueue;
535 /// the PendingQueue if the count reaches zero. Also update its cycle bound.
563 PendingQueue.push_back(SuccSU);
623 while (!AvailableQueue.empty() || !PendingQueue.empty()) {
627 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
628 if (PendingQueue[i]->getDepth() <= CurCycle) {
629 AvailableQueue.push(PendingQueue[i]);
630 PendingQueue[i]->isAvailable = true;
631 PendingQueue[i] = PendingQueue.back()
    [all...]

Completed in 162 milliseconds