619     dbgs() << SU->NodeNum << " ";  in dump()
1138         LLVM_DEBUG(dbgs() << "  UpdateRegP: SU(" << SU.NodeNum << ") "  in updatePressureDiffs()
1173             LLVM_DEBUG(dbgs() << "  UpdateRegP: SU(" << SU->NodeNum << ") "  in updatePressureDiffs()
1384       LLVM_DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU("  in computeCyclicCriticalPath()
1385                         << SU->NodeNum << ") = " << CyclicLatency << "c\n");  in computeCyclicCriticalPath()
1531       return SU->NodeNum < RHS.SU->NodeNum;  in operator <()
1610       if (!SUnit2ClusterInfo.count(MemOpRecords[NextIdx].SU->NodeNum) &&  in clusterNeighboringMemOps()
1621     if (SUnit2ClusterInfo.count(MemOpa.SU->NodeNum)) {  in clusterNeighboringMemOps()
1622       ClusterLength = SUnit2ClusterInfo[MemOpa.SU->NodeNum].first + 1;  in clusterNeighboringMemOps()
1624           SUnit2ClusterInfo[MemOpa.SU->NodeNum].second + MemOpb.Width;  in clusterNeighboringMemOps()
1633     if (SUa->NodeNum > SUb->NodeNum)  in clusterNeighboringMemOps()
1640     LLVM_DEBUG(dbgs() << "Cluster ld/st SU(" << SUa->NodeNum << ") - SU("  in clusterNeighboringMemOps()
1641                       << SUb->NodeNum << ")\n");  in clusterNeighboringMemOps()
1652         LLVM_DEBUG(dbgs() << "  Copy Succ SU(" << Succ.getSUnit()->NodeNum  in clusterNeighboringMemOps()
1666         LLVM_DEBUG(dbgs() << "  Copy Pred SU(" << Pred.getSUnit()->NodeNum  in clusterNeighboringMemOps()
1672     SUnit2ClusterInfo[MemOpb.SU->NodeNum] = {ClusterLength,  in clusterNeighboringMemOps()
1726           ChainPredID = Pred.getSUnit()->NodeNum;  in groupMemOps()
1928   LLVM_DEBUG(dbgs() << "Constraining copy SU(" << CopySU->NodeNum << ")\n");  in constrainLocalCopy()
1931     LLVM_DEBUG(dbgs() << "  Local use SU(" << LU->NodeNum << ") -> SU("  in constrainLocalCopy()
1932                       << GlobalSU->NodeNum << ")\n");  in constrainLocalCopy()
1936     LLVM_DEBUG(dbgs() << "  Global use SU(" << GU->NodeNum << ") -> SU("  in constrainLocalCopy()
1937                       << FirstLocalSU->NodeNum << ")\n");  in constrainLocalCopy()
2173     LLVM_DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") uops="  in checkHazard()
2181     LLVM_DEBUG(dbgs() << "  hazard: SU(" << SU->NodeNum << ") must "  in checkHazard()
2199         LLVM_DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") "  in checkHazard()
2224                       << LateSU->NodeNum << ") " << RemLatency << "c\n");  in findMaxLatency()
2479                       << SU->NodeNum << ") " << TopLatency << "c\n");  in bumpNode()
2484                       << SU->NodeNum << ") " << BotLatency << "c\n");  in bumpNode()
2801   dbgs() << "  Cand SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason);  in traceCandidate()
3167              << "  Try  SU(" << Cand.SU->NodeNum << ") "  in initCandidate()
3279     if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum)  in tryCandidate()
3280         || (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) {  in tryCandidate()
3437   LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "  in pickNode()
3585   if (TryCand.SU->NodeNum < Cand.SU->NodeNum) {  in tryCandidate()
3634   LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "  in pickNode()
3725                       << "SU(" << SU->NodeNum << ") "  in pickNode()
3782       return A->NodeNum > B->NodeNum;  in operator ()()
3784       return A->NodeNum < B->NodeNum;  in operator ()()
3910     SS << "SU:" << SU->NodeNum;  in getNodeLabel()