519     dbgs() << Queue[i]->NodeNum << " ";  in dump()
1013           dbgs() << "  UpdateRegP: SU(" << SU.NodeNum << ") "  in updatePressureDiffs()
1051               dbgs() << "  UpdateRegP: SU(" << SU->NodeNum << ") "  in updatePressureDiffs()
1251       DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU("  in computeCyclicCriticalPath()
1252             << SU->NodeNum << ") = " << CyclicLatency << "c\n");  in computeCyclicCriticalPath()
1424       DEBUG(dbgs() << "Cluster ld/st SU(" << SUa->NodeNum << ") - SU("  in clusterNeighboringMemOps()
1425             << SUb->NodeNum << ")\n");  in clusterNeighboringMemOps()
1434         DEBUG(dbgs() << "  Copy Succ SU(" << SI->getSUnit()->NodeNum << ")\n");  in clusterNeighboringMemOps()
1462         ChainPredID = PI->getSUnit()->NodeNum;  in apply()
1546     DEBUG(dbgs() << "Macro Fuse SU(" << SU.NodeNum << ")\n");  in apply()
1705   DEBUG(dbgs() << "Constraining copy SU(" << CopySU->NodeNum << ")\n");  in constrainLocalCopy()
1709     DEBUG(dbgs() << "  Local use SU(" << (*I)->NodeNum << ") -> SU("  in constrainLocalCopy()
1710           << GlobalSU->NodeNum << ")\n");  in constrainLocalCopy()
1715     DEBUG(dbgs() << "  Global use SU(" << (*I)->NodeNum << ") -> SU("  in constrainLocalCopy()
1716           << FirstLocalSU->NodeNum << ")\n");  in constrainLocalCopy()
1869     DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") uops="  in checkHazard()
1883         DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") "  in checkHazard()
1908           << LateSU->NodeNum << ") " << RemLatency << "c\n");  in findMaxLatency()
2161           << " TopLatency SU(" << SU->NodeNum << ") " << TopLatency << "c\n");  in bumpNode()
2166           << " BotLatency SU(" << SU->NodeNum << ") " << BotLatency << "c\n");  in bumpNode()
2450   dbgs() << "  Cand SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason);  in traceCandidate()
2780           dbgs() << "  Try  SU(" << Cand.SU->NodeNum << ") "  in initCandidate()
2899     if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum)  in tryCandidate()
2900         || (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) {  in tryCandidate()
3056   DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") " << *SU->getInstr());  in pickNode()
3203   if (TryCand.SU->NodeNum < Cand.SU->NodeNum)  in tryCandidate()
3249   DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") " << *SU->getInstr());  in pickNode()
3337     DEBUG(dbgs() << "Pick node " << "SU(" << SU->NodeNum << ") "  in pickNode()
3389       return A->NodeNum > B->NodeNum;  in operator ()()
3391       return A->NodeNum < B->NodeNum;  in operator ()()
3513     SS << "SU:" << SU->NodeNum;  in getNodeLabel()