37   struct Candidate : ilist_node<Candidate> {  struct in __anoncf9415770111::GCNMinRegScheduler
41     Candidate(const SUnit *SU_, int Priority_ = 0)  in Candidate()  function
45   SpecificBumpPtrAllocator<Candidate> Alloc;
46   using Queue = simple_ilist<Candidate>;
81   Candidate* pickCandidate();
146 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() {  in pickCandidate()
153     Num = findMax(Num, [=](const Candidate &C) { return C.Priority; });  in pickCandidate()
158     Num = findMax(Num, [=](const Candidate &C) {  in pickCandidate()
169     Num = findMax(Num, [=](const Candidate &C) {  in pickCandidate()
183     Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; });  in pickCandidate()
233       RQ.push_front(*new (Alloc.Allocate()) Candidate(SuccSU, Priority));  in releaseSuccessors()
249     RQ.push_back(*new (Alloc.Allocate()) Candidate(SU, StepNo));  in schedule()