29   for (auto &SU : *this) {  in dump()
30     HazardRec.dumpSU(SU, dbgs());  in dump()
31     if (SU != *rbegin())  in dump()
176   for (auto *SU : Available) {  in pickNode()  local
179     Candidate c(SU, *HazardRec);  in pickNode()
182     if (Best.SU == nullptr || c < Best) {  in pickNode()
187     LLVM_DEBUG(HazardRec->dumpSU(c.SU, dbgs()); c.dumpCosts();  in pickNode()
188                dbgs() << " Height:" << c.SU->getHeight(); dbgs() << "\n";);  in pickNode()
192     if (!SU->isScheduleHigh && Best.noCost())  in pickNode()
196   assert (Best.SU != nullptr);  in pickNode()
197   return Best.SU;  in pickNode()
202   SU = SU_;  in Candidate()
207   GroupingCost = HazardRec.groupingCost(SU);  in Candidate()
210   ResourcesCost = HazardRec.resourcesCost(SU);  in Candidate()
229   if (SU->getHeight() > other.SU->getHeight())  in operator <()
231   if (SU->getHeight() < other.SU->getHeight())  in operator <()
235   if (SU->NodeNum < other.SU->NodeNum)  in operator <()
241 void SystemZPostRASchedStrategy::schedNode(SUnit *SU, bool IsTopNode) {  in schedNode()  argument
242   LLVM_DEBUG(dbgs() << "** Scheduling SU(" << SU->NodeNum << ") ";  in schedNode()
244              Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";);  in schedNode()
247   Available.erase(SU);  in schedNode()
248   HazardRec->EmitInstruction(SU);  in schedNode()
251 void SystemZPostRASchedStrategy::releaseTopNode(SUnit *SU) {  in releaseTopNode()  argument
254   const MCSchedClassDesc *SC = HazardRec->getSchedClass(SU);  in releaseTopNode()
256   SU->isScheduleHigh = (AffectsGrouping || SU->isUnbuffered);  in releaseTopNode()
259   Available.insert(SU);  in releaseTopNode()