23     SUnit *SU;  member
26       : SU(SU_) {}  in Candidate()
40   unsigned getNodePriority(const SUnit *SU) const;
47   void releasePredecessors(const SUnit* SU);
58 CalcNodeSethiUllmanNumber(const SUnit *SU, std::vector<unsigned> &SUNumbers) {  in CalcNodeSethiUllmanNumber()  argument
59   unsigned &SethiUllmanNumber = SUNumbers[SU->NodeNum];  in CalcNodeSethiUllmanNumber()
64   for (const SDep &Pred : SU->Preds) {  in CalcNodeSethiUllmanNumber()
86 unsigned GCNILPScheduler::getNodePriority(const SUnit *SU) const {  in getNodePriority()
87   assert(SU->NodeNum < SUNumbers.size());  in getNodePriority()
88   if (SU->NumSuccs == 0 && SU->NumPreds != 0)  in getNodePriority()
96   if (SU->NumPreds == 0 && SU->NumSuccs != 0)  in getNodePriority()
101   return SUNumbers[SU->NodeNum];  in getNodePriority()
106 static unsigned closestSucc(const SUnit *SU) {  in closestSucc()  argument
108   for (const SDep &Succ : SU->Succs) {  in closestSucc()
121 static unsigned calcMaxScratches(const SUnit *SU) {  in calcMaxScratches()  argument
123   for (const SDep &Pred : SU->Preds) {  in calcMaxScratches()
245     auto NewBestSU = pickBest(Best->SU, I->SU);  in pickCandidate()
246     if (NewBestSU != Best->SU) {  in pickCandidate()
247       assert(NewBestSU == I->SU);  in pickCandidate()
259     if (C.SU->getHeight() <= CurCycle) {  in releasePending()
262       C.SU->NodeQueueId = CurQueueId++;  in releasePending()
275 void GCNILPScheduler::releasePredecessors(const SUnit* SU) {  in releasePredecessors()  argument
276   for (const auto &PredEdge : SU->Preds) {  in releasePredecessors()
282     PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge.getLatency());  in releasePredecessors()
299   for (const SUnit &SU : SUnits)  in schedule()  local
300     SUSavedCopy[SU.NodeNum] = SU;  in schedule()
303   for (const SUnit &SU : SUnits)  in schedule()  local
304     CalcNodeSethiUllmanNumber(&SU, SUNumbers);  in schedule()
306   for (const auto *SU : BotRoots) {  in schedule()  local
308       *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU)));  in schedule()
319         return C1.SU->getHeight() < C2.SU->getHeight();  in schedule()
320       })->SU;  in schedule()
330                << ' ' << C.SU->NodeNum;  in schedule()
336     auto SU = C->SU;  in schedule()  local
337     LLVM_DEBUG(dbgs() << "Selected "; DAG.dumpNode(*SU));  in schedule()
339     advanceToCycle(SU->getHeight());  in schedule()
341     releasePredecessors(SU);  in schedule()
342     Schedule.push_back(SU);  in schedule()
343     SU->isScheduled = true;  in schedule()
350   for (auto &SU : SUnits)  in schedule()  local
351     SU = SUSavedCopy[SU.NodeNum];  in schedule()