Lines Matching defs:Queue
430 /// queue comparisons.
495 std::vector<SUnit*> Queue;
504 // SU is in this queue if it's NodeQueueID is a superset of this ID.
507 bool empty() const { return Queue.empty(); }
509 void clear() { Queue.clear(); }
511 unsigned size() const { return Queue.size(); }
515 iterator begin() { return Queue.begin(); }
517 iterator end() { return Queue.end(); }
519 ArrayRef<SUnit*> elements() { return Queue; }
522 return std::find(Queue.begin(), Queue.end(), SU);
526 Queue.push_back(SU);
532 *I = Queue.back();
533 unsigned idx = I - Queue.begin();
534 Queue.pop_back();
535 return Queue.begin() + idx;
643 // times we should retry the pending queue because of a hazard.
747 /// Call this before applying any other heuristics to the Available queue.
762 /// Represent the type of SchedCandidate found within a single queue.
