688     dbgs() << SU->NodeNum << " ";  in dump()
1036     NodeName += std::to_string(SU->NodeNum) + ")";  in dumpScheduleTraceTopDown()
1118     NodeName += std::to_string(SU->NodeNum) + ")";  in dumpScheduleTraceBottomUp()
1383         LLVM_DEBUG(dbgs() << "  UpdateRegP: SU(" << SU.NodeNum << ") "  in updatePressureDiffs()
1418             LLVM_DEBUG(dbgs() << "  UpdateRegP: SU(" << SU->NodeNum << ") "  in updatePressureDiffs()
1629       LLVM_DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU("  in computeCyclicCriticalPath()
1630                         << SU->NodeNum << ") = " << CyclicLatency << "c\n");  in computeCyclicCriticalPath()
1779       return SU->NodeNum < RHS.SU->NodeNum;  in operator <()
1867       if (!SUnit2ClusterInfo.count(MemOpRecords[NextIdx].SU->NodeNum) &&  in clusterNeighboringMemOps()
1879     if (SUnit2ClusterInfo.count(MemOpa.SU->NodeNum)) {  in clusterNeighboringMemOps()
1880       ClusterLength = SUnit2ClusterInfo[MemOpa.SU->NodeNum].first + 1;  in clusterNeighboringMemOps()
1881       CurrentClusterBytes = SUnit2ClusterInfo[MemOpa.SU->NodeNum].second +  in clusterNeighboringMemOps()
1893     if (!ReorderWhileClustering && SUa->NodeNum > SUb->NodeNum)  in clusterNeighboringMemOps()
1900     LLVM_DEBUG(dbgs() << "Cluster ld/st SU(" << SUa->NodeNum << ") - SU("  in clusterNeighboringMemOps()
1901                       << SUb->NodeNum << ")\n");  in clusterNeighboringMemOps()
1912         LLVM_DEBUG(dbgs() << "  Copy Succ SU(" << Succ.getSUnit()->NodeNum  in clusterNeighboringMemOps()
1926         LLVM_DEBUG(dbgs() << "  Copy Pred SU(" << Pred.getSUnit()->NodeNum  in clusterNeighboringMemOps()
1932     SUnit2ClusterInfo[MemOpb.SU->NodeNum] = {ClusterLength,  in clusterNeighboringMemOps()
1987           ChainPredID = Pred.getSUnit()->NodeNum;  in groupMemOps()
2189   LLVM_DEBUG(dbgs() << "Constraining copy SU(" << CopySU->NodeNum << ")\n");  in constrainLocalCopy()
2192     LLVM_DEBUG(dbgs() << "  Local use SU(" << LU->NodeNum << ") -> SU("  in constrainLocalCopy()
2193                       << GlobalSU->NodeNum << ")\n");  in constrainLocalCopy()
2197     LLVM_DEBUG(dbgs() << "  Global use SU(" << GU->NodeNum << ") -> SU("  in constrainLocalCopy()
2198                       << FirstLocalSU->NodeNum << ")\n");  in constrainLocalCopy()
2465     LLVM_DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") uops="  in checkHazard()
2473     LLVM_DEBUG(dbgs() << "  hazard: SU(" << SU->NodeNum << ") must "  in checkHazard()
2493         LLVM_DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") "  in checkHazard()
2518                       << LateSU->NodeNum << ") " << RemLatency << "c\n");  in findMaxLatency()
2799                       << SU->NodeNum << ") " << TopLatency << "c\n");  in bumpNode()
2804                       << SU->NodeNum << ") " << BotLatency << "c\n");  in bumpNode()
3151   dbgs() << "  Cand SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason);  in traceCandidate()
3515              << "  Try  SU(" << Cand.SU->NodeNum << ") "  in initCandidate()
3627     if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum)  in tryCandidate()
3628         || (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) {  in tryCandidate()
3800   LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "  in pickNode()
3970   if (TryCand.SU->NodeNum < Cand.SU->NodeNum) {  in tryCandidate()
4125   LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "  in pickNode()
4228                       << "SU(" << SU->NodeNum << ") "  in pickNode()
4285       return A->NodeNum > B->NodeNum;  in operator ()()
4287       return A->NodeNum < B->NodeNum;  in operator ()()
4413     SS << "SU:" << SU->NodeNum;  in getNodeLabel()