33     int Priority;  member
36       : SU(SU_), Priority(Priority_) {}  in Candidate()
77   void bumpPredsPriority(const SUnit *SchedSU, int Priority);
78   void releaseSuccessors(const SUnit* SU, int Priority);
147     Num = findMax(Num, [=](const Candidate &C) { return C.Priority; });  in pickCandidate()
184 void GCNMinRegScheduler::bumpPredsPriority(const SUnit *SchedSU, int Priority) {  in bumpPredsPriority()  argument
209                     << ")'s non-ready successors of " << Priority  in bumpPredsPriority()
214       C.Priority = Priority;  in bumpPredsPriority()
221 void GCNMinRegScheduler::releaseSuccessors(const SUnit* SU, int Priority) {  in releaseSuccessors()  argument
228       RQ.push_front(*new (Alloc.Allocate()) Candidate(SuccSU, Priority));  in releaseSuccessors()
254                << ' ' << C.SU->NodeNum << "(P" << C.Priority << ')';  in schedule()