43   const SUnit *pickBest(const SUnit *left, const SUnit *right);
133 static int BUCompareLatency(const SUnit *left, const SUnit *right) {  in BUCompareLatency()  argument
137   int RHeight = (int)right->getHeight();  in BUCompareLatency()
150   int RDepth = right->getDepth();  in BUCompareLatency()
153                       << ") depth " << LDepth << " vs SU (" << right->NodeNum  in BUCompareLatency()
157   if (left->Latency != right->Latency)  in BUCompareLatency()
158     return left->Latency > right->Latency ? 1 : -1;  in BUCompareLatency()
163 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right)  in pickBest()  argument
170     int spread = (int)left->getDepth() - (int)right->getDepth();  in pickBest()
173                         << left->getDepth() << " != SU(" << right->NodeNum  in pickBest()
174                         << "): " << right->getDepth() << "\n");  in pickBest()
175       return left->getDepth() < right->getDepth() ? right : left;  in pickBest()
180   if (!DisableSchedHeight && left->getHeight() != right->getHeight()) {  in pickBest()
181     int spread = (int)left->getHeight() - (int)right->getHeight();  in pickBest()
183       return left->getHeight() > right->getHeight() ? right : left;  in pickBest()
188   unsigned RPriority = getNodePriority(right);  in pickBest()
191     return LPriority > RPriority ? right : left;  in pickBest()
211   unsigned RDist = closestSucc(right);  in pickBest()
213     return LDist < RDist ? right : left;  in pickBest()
217   unsigned RScratch = calcMaxScratches(right);  in pickBest()
219     return LScratch > RScratch ? right : left;  in pickBest()
223     int result = BUCompareLatency(left, right);  in pickBest()
225       return result > 0 ? right : left;  in pickBest()
229     if (left->getHeight() != right->getHeight())  in pickBest()
230       return (left->getHeight() > right->getHeight()) ? right : left;  in pickBest()
232     if (left->getDepth() != right->getDepth())  in pickBest()
233       return (left->getDepth() < right->getDepth()) ? right : left;  in pickBest()
236   assert(left->NodeQueueId && right->NodeQueueId &&  in pickBest()
238   return (left->NodeQueueId > right->NodeQueueId) ? right : left;  in pickBest()