34   Queue RQ; // Ready queue  member in __anon235545e00111::GCNMinRegScheduler
109   assert(!RQ.empty() && Num <= RQ.size());  in findMax()
111   using T = decltype(C(*RQ.begin())) ;  in findMax()
115   for (auto I = RQ.begin(); Num; --Num) {  in findMax()
124       RQ.remove(Cand);  in findMax()
125       RQ.push_front(Cand);  in findMax()
135     unsigned Num = RQ.size();  in pickCandidate()
165     Num = Num ? Num : RQ.size();  in pickCandidate()
174   return &RQ.front();  in pickCandidate()
204   for (auto &C : RQ) {  in bumpPredsPriority()
220       RQ.push_front(*new (Alloc.Allocate()) Candidate(SuccSU, Priority));  in releaseSuccessors()
236     RQ.push_back(*new (Alloc.Allocate()) Candidate(SU, StepNo));  in schedule()
240   while (!RQ.empty()) {  in schedule()
245                     : RQ) dbgs()  in schedule()
251     RQ.remove(*C);  in schedule()