554 void ScheduleDAGMI::releaseSucc(SUnit *SU, SDep *SuccEdge) {  in releaseSucc()
582 void ScheduleDAGMI::releaseSuccessors(SUnit *SU) {  in releaseSuccessors()
593 void ScheduleDAGMI::releasePred(SUnit *SU, SDep *PredEdge) {  in releasePred()
621 void ScheduleDAGMI::releasePredecessors(SUnit *SU) {  in releasePredecessors()
705     SUnit *SU = SchedImpl->pickNode(IsTopNode);  in schedule()  local
764     SUnit *SU = &(*I);  in findRootsAndBiasEdges()  local
812 void ScheduleDAGMI::updateQueues(SUnit *SU, bool IsTopNode) {  in updateQueues()
848     if (SUnit *SU = getSUnit(&(*MI)))  in dumpSchedule()  local
961 updateScheduledPressure(const SUnit *SU,  in updateScheduledPressure()
1006         SUnit &SU = *V2SU.SU;  in updatePressureDiffs()  local
1041         SUnit *SU = V2SU.SU;  in updatePressureDiffs()  local
1107     SUnit *SU = SchedImpl->pickNode(IsTopNode);  in schedule()  local
1228       SUnit *SU = V2SU.SU;  in computeCyclicCriticalPath()  local
1273 void ScheduleDAGMILive::scheduleMI(SUnit *SU, bool IsTopNode) {  in scheduleMI()
1358     SUnit *SU;  member
1402     SUnit *SU = MemOps[Idx];  in clusterNeighboringMemOps()  local
1453     SUnit *SU = &DAG->SUnits[Idx];  in apply()  local
1735     SUnit *SU = &DAG->SUnits[Idx];  in apply()  local
1825 unsigned SchedBoundary::getLatencyStallCycles(SUnit *SU) {  in getLatencyStallCycles()
1862 bool SchedBoundary::checkHazard(SUnit *SU) {  in checkHazard()
1942 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle) {  in releaseNode()
1969 void SchedBoundary::releaseTopNode(SUnit *SU) {  in releaseTopNode()
1976 void SchedBoundary::releaseBottomNode(SUnit *SU) {  in releaseBottomNode()
2065 void SchedBoundary::bumpNode(SUnit *SU) {  in bumpNode()
2203     SUnit *SU = *(Pending.begin()+i);  in releasePending()  local
2226 void SchedBoundary::removeReady(SUnit *SU) {  in removeReady()
2716 static unsigned getWeakLeft(const SUnit *SU, bool isTop) {  in getWeakLeft()
2727 static int biasPhysRegCopy(const SUnit *SU, bool isTop) {  in biasPhysRegCopy()
2748 void GenericScheduler::initCandidate(SchedCandidate &Cand, SUnit *SU,  in initCandidate()
2940   if (SUnit *SU = Bot.pickOnlyChoice()) {  in pickNodeBidirectional()  local
2945   if (SUnit *SU = Top.pickOnlyChoice()) {  in pickNodeBidirectional()  local
3022   SUnit *SU;  in pickNode()  local
3060 void GenericScheduler::reschedulePhysRegCopies(SUnit *SU, bool isTop) {  in reschedulePhysRegCopies()
3092 void GenericScheduler::schedNode(SUnit *SU, bool IsTopNode) {  in schedNode()
3228   SUnit *SU;  in pickNode()  local
3255 void PostGenericScheduler::schedNode(SUnit *SU, bool IsTopNode) {  in schedNode()
3334     SUnit *SU = ReadyQ.back();  in pickNode()  local
3353   void schedNode(SUnit *SU, bool IsTopNode) override {  in schedNode()
3359   void releaseBottomNode(SUnit *SU) override {  in releaseBottomNode()
3421     SUnit *SU;  in pickNode()  local
3442   void schedNode(SUnit *SU, bool IsTopNode) override {}  in schedNode()
3444   void releaseTopNode(SUnit *SU) override {  in releaseTopNode()
3447   void releaseBottomNode(SUnit *SU) override {  in releaseBottomNode()