31   struct Candidate : ilist_node<Candidate> {  struct in __anon091349650111::GCNMinRegScheduler
35     Candidate(const SUnit *SU_, int Priority_ = 0)  in Candidate()  function
39   SpecificBumpPtrAllocator<Candidate> Alloc;
40   using Queue = simple_ilist<Candidate>;
75   Candidate* pickCandidate();
140 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() {  in pickCandidate()
147     Num = findMax(Num, [=](const Candidate &C) { return C.Priority; });  in pickCandidate()
152     Num = findMax(Num, [=](const Candidate &C) {  in pickCandidate()
163     Num = findMax(Num, [=](const Candidate &C) {  in pickCandidate()
177     Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; });  in pickCandidate()
228       RQ.push_front(*new (Alloc.Allocate()) Candidate(SuccSU, Priority));  in releaseSuccessors()
244     RQ.push_back(*new (Alloc.Allocate()) Candidate(SU, StepNo));  in schedule()