HomeSort by: relevance | last modified time | path
    Searched refs:PendingQueue (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGVLIW.cpp 57 /// PendingQueue - This contains all of the instructions whose operands have
61 std::vector<SUnit*> PendingQueue;
112 /// the PendingQueue if the count reaches zero. Also update its cycle bound.
133 PendingQueue.push_back(SuccSU);
184 while (!AvailableQueue->empty() || !PendingQueue.empty()) {
187 for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
188 if (PendingQueue[i]->getDepth() == CurCycle) {
189 AvailableQueue->push(PendingQueue[i]);
190 PendingQueue[i]->isAvailable = true;
191 PendingQueue[i] = PendingQueue.back()
    [all...]
ScheduleDAGRRList.cpp 146 /// PendingQueue - This contains all of the instructions whose operands have
150 std::vector<SUnit *> PendingQueue;
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[i]->isPending = false
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
GCNILPSched.cpp 31 Queue PendingQueue;
257 for(auto I = PendingQueue.begin(), E = PendingQueue.end(); I != E;) {
260 PendingQueue.remove(C);
285 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU));
315 if (AvailQueue.empty() && !PendingQueue.empty()) {
317 PendingQueue.begin(), PendingQueue.end(),
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
PostRASchedulerList.cpp 117 /// PendingQueue - This contains all of the instructions whose operands have
121 std::vector<SUnit*> PendingQueue;
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[i] = PendingQueue.back()
    [all...]

Completed in 25 milliseconds