24   struct Candidate : ilist_node<Candidate> {  struct in __anon235545e00111::GCNMinRegScheduler
28     Candidate(const SUnit *SU_, int Priority_ = 0)  in Candidate()  function
32   SpecificBumpPtrAllocator<Candidate> Alloc;
33   using Queue = simple_ilist<Candidate>;
68   Candidate* pickCandidate();
133 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() {  in pickCandidate()
140     Num = findMax(Num, [=](const Candidate &C) { return C.Priority; });  in pickCandidate()
145     Num = findMax(Num, [=](const Candidate &C) {  in pickCandidate()
156     Num = findMax(Num, [=](const Candidate &C) {  in pickCandidate()
170     Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; });  in pickCandidate()
220       RQ.push_front(*new (Alloc.Allocate()) Candidate(SuccSU, Priority));  in releaseSuccessors()
236     RQ.push_back(*new (Alloc.Allocate()) Candidate(SU, StepNo));  in schedule()