247     if (NewNode->NodeNum >= NumSUnits)  in CreateNewSUnit()
258     if (NewNode->NodeNum >= NumSUnits)  in CreateClone()
979     DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n");  in CopyAndMoveSuccessors()
1001       LoadNode->setNodeId(LoadSU->NodeNum);  in CopyAndMoveSuccessors()
1009     N->setNodeId(NewSU->NodeNum);  in CopyAndMoveSuccessors()
1107   DEBUG(dbgs() << "    Duplicating SU #" << SU->NodeNum << "\n");  in CopyAndMoveSuccessors()
1358       DEBUG(dbgs() << "    Repushing SU #" << SU->NodeNum << '\n');  in releaseInterferences()
1381            << " SU #" << CurSU->NodeNum << '\n');  in PickNodeToScheduleBottomUp()
1427       DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum << ") to SU("  in PickNodeToScheduleBottomUp()
1428             << TrySU->NodeNum << ")\n");  in PickNodeToScheduleBottomUp()
1478       DEBUG(dbgs() << "    Adding an edge from SU #" << TrySU->NodeNum  in PickNodeToScheduleBottomUp()
1479             << " to SU #" << Copies.front()->NodeNum << "\n");  in PickNodeToScheduleBottomUp()
1484     DEBUG(dbgs() << "    Adding an edge from SU #" << NewDef->NodeNum  in PickNodeToScheduleBottomUp()
1485           << " to SU #" << TrySU->NodeNum << "\n");  in PickNodeToScheduleBottomUp()
1850   unsigned &SethiUllmanNumber = SUNumbers[SU->NodeNum];  in CalcNodeSethiUllmanNumber()
1892   SethiUllmanNumbers[SU->NodeNum] = 0;  in updateNode()
1899   assert(SU->NodeNum < SethiUllmanNumbers.size());  in getNodePriority()
1923   return SethiUllmanNumbers[SU->NodeNum];  in getNodePriority()
1925   unsigned Priority = SethiUllmanNumbers[SU->NodeNum];  in getNodePriority()
2103       DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") has too many regdefs\n");  in scheduledNode()
2290   DEBUG(dbgs() << "VRegCycle: SU(" << SU->NodeNum << ")\n");  in initVRegCycle()
2331       DEBUG(dbgs() << "  VReg cycle use: SU (" << SU->NodeNum << ")\n");  in hasVRegCycleUse()
2391       DEBUG(dbgs() << "  Comparing latency of SU (" << left->NodeNum  in BUCompareLatency()
2392             << ") depth " << LDepth << " vs SU (" << right->NodeNum  in BUCompareLatency()
2415       DEBUG(dbgs() << "  SU (" << left->NodeNum << ") "  in BURRSort()
2416             << PhysRegMsg[LHasPhysReg] << " SU(" << right->NodeNum << ") "  in BURRSort()
2561     DEBUG(dbgs() << "  pressure SU(" << left->NodeNum << ") > SU("  in operator ()()
2562           << right->NodeNum << ")\n");  in operator ()()
2566     DEBUG(dbgs() << "  pressure SU(" << right->NodeNum << ") > SU("  in operator ()()
2567           << left->NodeNum << ")\n");  in operator ()()
2629     DEBUG(dbgs() << "RegPressureDiff SU(" << left->NodeNum << "): " << LPDiff  in operator ()()
2630           << " != SU(" << right->NodeNum << "): " << RPDiff << "\n");  in operator ()()
2642     DEBUG(dbgs() << "Live uses SU(" << left->NodeNum << "): " << LLiveUses  in operator ()()
2643           << " != SU(" << right->NodeNum << "): " << RLiveUses << "\n");  in operator ()()
2657       DEBUG(dbgs() << "Depth of SU(" << left->NodeNum << "): "  in operator ()()
2658             << left->getDepth() << " != SU(" << right->NodeNum << "): "  in operator ()()
2887     DEBUG(dbgs() << "    Prescheduling SU #" << SU->NodeNum  in PrescheduleNodesWithMultipleUses()
2888                  << " next to PredSU #" << PredSU->NodeNum  in PrescheduleNodesWithMultipleUses()
2979                        << SU->NodeNum << " to SU #" << SuccSU->NodeNum << "\n");  in AddPseudoTwoAddrDeps()