Lines Matching refs:Num
66 unsigned findMax(unsigned Num, Calc C);
108 unsigned GCNMinRegScheduler::findMax(unsigned Num, Calc C) { in findMax() argument
109 assert(!RQ.empty() && Num <= RQ.size()); in findMax()
115 for (auto I = RQ.begin(); Num; --Num) { in findMax()
135 unsigned Num = RQ.size(); in pickCandidate() local
136 if (Num == 1) break; in pickCandidate()
138 LLVM_DEBUG(dbgs() << "\nSelecting max priority candidates among " << Num in pickCandidate()
140 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
141 if (Num == 1) break; in pickCandidate()
144 << Num << '\n'); in pickCandidate()
145 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
152 if (Num == 1) break; in pickCandidate()
154 LLVM_DEBUG(dbgs() << "\nSelecting most producing candidate among " << Num in pickCandidate()
156 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
163 if (Num == 1) break; in pickCandidate()
165 Num = Num ? Num : RQ.size(); in pickCandidate()
169 << Num << '\n'); in pickCandidate()
170 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
171 assert(Num == 1); in pickCandidate()