Searched refs:PendingQueue (Results 1 - 4 of 4) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGVLIW.cpp57 /// PendingQueue - This contains all of the instructions whose operands have
61 std::vector<SUnit*> PendingQueue; member in class:__anon3582::ScheduleDAGVLIW
112 /// the PendingQueue if the count reaches zero. Also update its cycle bound.
133 PendingQueue.push_back(SuccSU);
185 while (!AvailableQueue->empty() || !PendingQueue.empty()) {
188 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
189 if (PendingQueue[i]->getDepth() == CurCycle) {
190 AvailableQueue->push(PendingQueue[i]);
191 PendingQueue[i]->isAvailable = true;
192 PendingQueue[
[all...]
H A DScheduleDAGRRList.cpp146 /// PendingQueue - This contains all of the instructions whose operands have
150 std::vector<SUnit *> PendingQueue; member in class:__anon3581::ScheduleDAGRRList
433 PendingQueue.push_back(PredSU);
601 assert(PendingQueue.empty() && "pending instrs not allowed in this mode");
611 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
612 unsigned ReadyCycle = PendingQueue[i]->getHeight();
616 if (PendingQueue[i]->isAvailable) {
617 if (!isReady(PendingQueue[i]))
619 AvailableQueue->push(PendingQueue[i]);
621 PendingQueue[
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNILPSched.cpp32 Queue PendingQueue; member in class:__anon3943::GCNILPScheduler
258 for(auto I = PendingQueue.begin(), E = PendingQueue.end(); I != E;) {
261 PendingQueue.remove(C);
286 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU));
316 if (AvailQueue.empty() && !PendingQueue.empty()) {
318 PendingQueue.begin(), PendingQueue.end(),
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DPostRASchedulerList.cpp117 /// PendingQueue - This contains all of the instructions whose operands have
121 std::vector<SUnit*> PendingQueue; member in class:__anon3543::SchedulePostRATDList
451 /// the PendingQueue if the count reaches zero.
483 PendingQueue.push_back(SuccSU);
550 while (!AvailableQueue.empty() || !PendingQueue.empty()) {
554 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
555 if (PendingQueue[i]->getDepth() <= CurCycle) {
556 AvailableQueue.push(PendingQueue[i]);
557 PendingQueue[i]->isAvailable = true;
558 PendingQueue[
[all...]

Completed in 169 milliseconds