Target/AMDGPU/GCNILPSched.cpp

43   const SUnit *pickBest(const SUnit *left, const SUnit *right);
131 // Return -1 if left has higher priority, 1 if right has higher priority.
133 static int BUCompareLatency(const SUnit *left, const SUnit *right) {
136   int LHeight = (int)left->getHeight();
149   int LDepth = left->getDepth();
152     LLVM_DEBUG(dbgs() << "  Comparing latency of SU (" << left->NodeNum
157   if (left->Latency != right->Latency)
158     return left->Latency > right->Latency ? 1 : -1;
163 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right)
170     int spread = (int)left->getDepth() - (int)right->getDepth();
172       LLVM_DEBUG(dbgs() << "Depth of SU(" << left->NodeNum << "): "
173                         << left->getDepth() << " != SU(" << right->NodeNum
175       return left->getDepth() < right->getDepth() ? right : left;
180   if (!DisableSchedHeight && left->getHeight() != right->getHeight()) {
181     int spread = (int)left->getHeight() - (int)right->getHeight();
183       return left->getHeight() > right->getHeight() ? right : left;
187   unsigned LPriority = getNodePriority(left);
191     return LPriority > RPriority ? right : left;
210   unsigned LDist = closestSucc(left);
213     return LDist < RDist ? right : left;
216   unsigned LScratch = calcMaxScratches(left);
219     return LScratch > RScratch ? right : left;
223     int result = BUCompareLatency(left, right);
225       return result > 0 ? right : left;
226     return left;
229     if (left->getHeight() != right->getHeight())
230       return (left->getHeight() > right->getHeight()) ? right : left;
232     if (left->getDepth() != right->getDepth())
233       return (left->getDepth() < right->getDepth()) ? right : left;
236   assert(left->NodeQueueId && right->NodeQueueId &&
238   return (left->NodeQueueId > right->NodeQueueId) ? right : left;