620     dbgs() << SU->NodeNum << " ";  in dump()
1137         LLVM_DEBUG(dbgs() << "  UpdateRegP: SU(" << SU.NodeNum << ") "  in updatePressureDiffs()
1172             LLVM_DEBUG(dbgs() << "  UpdateRegP: SU(" << SU->NodeNum << ") "  in updatePressureDiffs()
1383       LLVM_DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU("  in computeCyclicCriticalPath()
1384                         << SU->NodeNum << ") = " << CyclicLatency << "c\n");  in computeCyclicCriticalPath()
1530       return SU->NodeNum < RHS.SU->NodeNum;  in operator <()
1609       if (!SUnit2ClusterInfo.count(MemOpRecords[NextIdx].SU->NodeNum) &&  in clusterNeighboringMemOps()
1620     if (SUnit2ClusterInfo.count(MemOpa.SU->NodeNum)) {  in clusterNeighboringMemOps()
1621       ClusterLength = SUnit2ClusterInfo[MemOpa.SU->NodeNum].first + 1;  in clusterNeighboringMemOps()
1623           SUnit2ClusterInfo[MemOpa.SU->NodeNum].second + MemOpb.Width;  in clusterNeighboringMemOps()
1632     if (SUa->NodeNum > SUb->NodeNum)  in clusterNeighboringMemOps()
1639     LLVM_DEBUG(dbgs() << "Cluster ld/st SU(" << SUa->NodeNum << ") - SU("  in clusterNeighboringMemOps()
1640                       << SUb->NodeNum << ")\n");  in clusterNeighboringMemOps()
1651         LLVM_DEBUG(dbgs() << "  Copy Succ SU(" << Succ.getSUnit()->NodeNum  in clusterNeighboringMemOps()
1665         LLVM_DEBUG(dbgs() << "  Copy Pred SU(" << Pred.getSUnit()->NodeNum  in clusterNeighboringMemOps()
1671     SUnit2ClusterInfo[MemOpb.SU->NodeNum] = {ClusterLength,  in clusterNeighboringMemOps()
1725           ChainPredID = Pred.getSUnit()->NodeNum;  in groupMemOps()
1927   LLVM_DEBUG(dbgs() << "Constraining copy SU(" << CopySU->NodeNum << ")\n");  in constrainLocalCopy()
1930     LLVM_DEBUG(dbgs() << "  Local use SU(" << LU->NodeNum << ") -> SU("  in constrainLocalCopy()
1931                       << GlobalSU->NodeNum << ")\n");  in constrainLocalCopy()
1935     LLVM_DEBUG(dbgs() << "  Global use SU(" << GU->NodeNum << ") -> SU("  in constrainLocalCopy()
1936                       << FirstLocalSU->NodeNum << ")\n");  in constrainLocalCopy()
2172     LLVM_DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") uops="  in checkHazard()
2180     LLVM_DEBUG(dbgs() << "  hazard: SU(" << SU->NodeNum << ") must "  in checkHazard()
2198         LLVM_DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") "  in checkHazard()
2223                       << LateSU->NodeNum << ") " << RemLatency << "c\n");  in findMaxLatency()
2478                       << SU->NodeNum << ") " << TopLatency << "c\n");  in bumpNode()
2483                       << SU->NodeNum << ") " << BotLatency << "c\n");  in bumpNode()
2800   dbgs() << "  Cand SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason);  in traceCandidate()
3166              << "  Try  SU(" << Cand.SU->NodeNum << ") "  in initCandidate()
3278     if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum)  in tryCandidate()
3279         || (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) {  in tryCandidate()
3436   LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "  in pickNode()
3584   if (TryCand.SU->NodeNum < Cand.SU->NodeNum) {  in tryCandidate()
3633   LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "  in pickNode()
3724                       << "SU(" << SU->NodeNum << ") "  in pickNode()
3781       return A->NodeNum > B->NodeNum;  in operator ()()
3783       return A->NodeNum < B->NodeNum;  in operator ()()
3909     SS << "SU:" << SU->NodeNum;  in getNodeLabel()