Home
last modified time | relevance | path

Searched refs:PendingQueue (Results 1 – 10 of 10) sorted by relevance

/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
DScheduleDAGList.cpp59 std::vector<SUnit*> PendingQueue; member in __anon5cb533580111::ScheduleDAGList
126 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()
DScheduleDAGRRList.cpp139 std::vector<SUnit*> PendingQueue; member in __anon551bd8fc0311::ScheduleDAGRRList
401 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 …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGVLIW.cpp62 std::vector<SUnit*> PendingQueue; member in __anonf8c6ba4a0111::ScheduleDAGVLIW
135 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()
DScheduleDAGRRList.cpp151 std::vector<SUnit *> PendingQueue; member in __anonc07fd5080111::ScheduleDAGRRList
428 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 …]
/external/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGVLIW.cpp62 std::vector<SUnit*> PendingQueue; member in __anon15a3a8120111::ScheduleDAGVLIW
136 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()
DScheduleDAGRRList.cpp125 std::vector<SUnit*> PendingQueue; member in __anon884f54d00111::ScheduleDAGRRList
400 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 …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DPostRASchedulerList.cpp123 std::vector<SUnit*> PendingQueue; member in __anon0e8eab020111::SchedulePostRATDList
489 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 …]
/external/llvm/lib/CodeGen/
DPostRASchedulerList.cpp123 std::vector<SUnit*> PendingQueue; member in __anond49cb7ca0111::SchedulePostRATDList
490 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 …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/
DGCNILPSched.cpp32 Queue PendingQueue; member in __anon5a301b910111::GCNILPScheduler
258 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()
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DPostRASchedulerList.cpp119 std::vector<SUnit*> PendingQueue; member in __anond4acdf760111::SchedulePostRATDList
563 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 …]