504     dbgs() << Queue[i]->NodeNum << " ";  in dump()
981       DEBUG(dbgs() << "  UpdateRegP: SU(" << SU->NodeNum << ") "  in updatePressureDiffs()
1177       DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU("  in computeCyclicCriticalPath()
1178             << UI->SU->NodeNum << ") = " << CyclicLatency << "c\n");  in computeCyclicCriticalPath()
1291       DEBUG(dbgs() << "Cluster loads SU(" << SUa->NodeNum << ") - SU("  in clusterNeighboringLoads()
1292             << SUb->NodeNum << ")\n");  in clusterNeighboringLoads()
1301         DEBUG(dbgs() << "  Copy Succ SU(" << SI->getSUnit()->NodeNum << ")\n");  in clusterNeighboringLoads()
1325         ChainPredID = PI->getSUnit()->NodeNum;  in apply()
1382     DEBUG(dbgs() << "Macro Fuse SU(" << SU->NodeNum << ")\n");  in apply()
1539   DEBUG(dbgs() << "Constraining copy SU(" << CopySU->NodeNum << ")\n");  in constrainLocalCopy()
1543     DEBUG(dbgs() << "  Local use SU(" << (*I)->NodeNum << ") -> SU("  in constrainLocalCopy()
1544           << GlobalSU->NodeNum << ")\n");  in constrainLocalCopy()
1549     DEBUG(dbgs() << "  Global use SU(" << (*I)->NodeNum << ") -> SU("  in constrainLocalCopy()
1550           << FirstLocalSU->NodeNum << ")\n");  in constrainLocalCopy()
1702     DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") uops="  in checkHazard()
1716         DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") "  in checkHazard()
1741           << LateSU->NodeNum << ") " << RemLatency << "c\n");  in findMaxLatency()
1994           << " TopLatency SU(" << SU->NodeNum << ") " << TopLatency << "c\n");  in bumpNode()
1999           << " BotLatency SU(" << SU->NodeNum << ") " << BotLatency << "c\n");  in bumpNode()
2279   dbgs() << "  SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason);  in traceCandidate()
2599           dbgs() << "  SU(" << TryCand.SU->NodeNum << ") "  in tryCandidate()
2688   if ((Zone.isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum)  in tryCandidate()
2689       || (!Zone.isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) {  in tryCandidate()
2826   DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") " << *SU->getInstr());  in pickNode()
2970   if (TryCand.SU->NodeNum < Cand.SU->NodeNum)  in tryCandidate()
3016   DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") " << *SU->getInstr());  in pickNode()
3104     DEBUG(dbgs() << "Pick node " << "SU(" << SU->NodeNum << ") "  in pickNode()
3156       return A->NodeNum > B->NodeNum;  in operator ()()
3158       return A->NodeNum < B->NodeNum;  in operator ()()
3283     SS << "SU:" << SU->NodeNum;  in getNodeLabel()