Lines Matching refs:Num
73 unsigned findMax(unsigned Num, Calc C);
115 unsigned GCNMinRegScheduler::findMax(unsigned Num, Calc C) { in findMax() argument
116 assert(!RQ.empty() && Num <= RQ.size()); in findMax()
122 for (auto I = RQ.begin(); Num; --Num) { in findMax()
142 unsigned Num = RQ.size(); in pickCandidate() local
143 if (Num == 1) break; in pickCandidate()
145 LLVM_DEBUG(dbgs() << "\nSelecting max priority candidates among " << Num in pickCandidate()
147 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
148 if (Num == 1) break; in pickCandidate()
151 << Num << '\n'); in pickCandidate()
152 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
159 if (Num == 1) break; in pickCandidate()
161 LLVM_DEBUG(dbgs() << "\nSelecting most producing candidate among " << Num in pickCandidate()
163 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
170 if (Num == 1) break; in pickCandidate()
172 Num = Num ? Num : RQ.size(); in pickCandidate()
176 << Num << '\n'); in pickCandidate()
177 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
178 assert(Num == 1); in pickCandidate()