Target/AMDGPU/GCNILPSched.cpp

42   const SUnit *pickBest(const SUnit *left, const SUnit *right);
92     // scheduled right before its predecessors that it doesn't lengthen
130 // Return -1 if left has higher priority, 1 if right has higher priority.
132 static int BUCompareLatency(const SUnit *left, const SUnit *right) {
136   int RHeight = (int)right->getHeight();
149   int RDepth = right->getDepth();
152                       << ") depth " << LDepth << " vs SU (" << right->NodeNum
156   if (left->Latency != right->Latency)
157     return left->Latency > right->Latency ? 1 : -1;
162 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right)
169     int spread = (int)left->getDepth() - (int)right->getDepth();
172                         << left->getDepth() << " != SU(" << right->NodeNum
173                         << "): " << right->getDepth() << "\n");
174       return left->getDepth() < right->getDepth() ? right : left;
179   if (!DisableSchedHeight && left->getHeight() != right->getHeight()) {
180     int spread = (int)left->getHeight() - (int)right->getHeight();
182       return left->getHeight() > right->getHeight() ? right : left;
187   unsigned RPriority = getNodePriority(right);
190     return LPriority > RPriority ? right : left;
210   unsigned RDist = closestSucc(right);
212     return LDist < RDist ? right : left;
216   unsigned RScratch = calcMaxScratches(right);
218     return LScratch > RScratch ? right : left;
222     int result = BUCompareLatency(left, right);
224       return result > 0 ? right : left;
228     if (left->getHeight() != right->getHeight())
229       return (left->getHeight() > right->getHeight()) ? right : left;
231     if (left->getDepth() != right->getDepth())
232       return (left->getDepth() < right->getDepth()) ? right : left;
235   assert(left->NodeQueueId && right->NodeQueueId &&
237   return (left->NodeQueueId > right->NodeQueueId) ? right : left;