Lines Matching full:left

42   const SUnit *pickBest(const SUnit *left, const SUnit *right);
130 // Return -1 if left has higher priority, 1 if right has higher priority.
132 static int BUCompareLatency(const SUnit *left, const SUnit *right) {
135   int LHeight = (int)left->getHeight();
148   int LDepth = left->getDepth();
151     LLVM_DEBUG(dbgs() << "  Comparing latency of SU (" << left->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();
171       LLVM_DEBUG(dbgs() << "Depth of SU(" << left->NodeNum << "): "
172                         << left->getDepth() << " != SU(" << right->NodeNum
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;
186   unsigned LPriority = getNodePriority(left);
190     return LPriority > RPriority ? right : left;
209   unsigned LDist = closestSucc(left);
212     return LDist < RDist ? right : left;
215   unsigned LScratch = calcMaxScratches(left);
218     return LScratch > RScratch ? right : left;
222     int result = BUCompareLatency(left, right);
224       return result > 0 ? right : left;
225     return left;
227   if (left->getHeight() != right->getHeight())
228     return (left->getHeight() > right->getHeight()) ? right : left;
230   if (left->getDepth() != right->getDepth())
231     return (left->getDepth() < right->getDepth()) ? right : left;
233   assert(left->NodeQueueId && right->NodeQueueId &&
235   return (left->NodeQueueId > right->NodeQueueId) ? right : left;