Lines Matching defs:Queue
44 /// FastPriorityQueue - A degenerate priority queue that considers
48 SmallVector<SUnit *, 16> Queue;
50 bool empty() const { return Queue.empty(); }
53 Queue.push_back(U);
58 SUnit *V = Queue.back();
59 Queue.pop_back();
69 /// AvailableQueue - The priority queue to use for the available SUnits.
181 /// the Available queue.
532 // Add root to Available queue.
540 // While Available queue is not empty, grab the node with the highest
