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()
1100   DEBUG(dbgs() << "    Duplicating SU #" << SU->NodeNum << "\n");  in CopyAndMoveSuccessors()
1350       DEBUG(dbgs() << "    Repushing SU #" << SU->NodeNum << '\n');  in releaseInterferences()
1373            << " SU #" << CurSU->NodeNum << '\n');  in PickNodeToScheduleBottomUp()
1417       DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum << ") to SU("  in PickNodeToScheduleBottomUp()
1418             << TrySU->NodeNum << ")\n");  in PickNodeToScheduleBottomUp()
1468       DEBUG(dbgs() << "    Adding an edge from SU #" << TrySU->NodeNum  in PickNodeToScheduleBottomUp()
1469             << " to SU #" << Copies.front()->NodeNum << "\n");  in PickNodeToScheduleBottomUp()
1474     DEBUG(dbgs() << "    Adding an edge from SU #" << NewDef->NodeNum  in PickNodeToScheduleBottomUp()
1475           << " to SU #" << TrySU->NodeNum << "\n");  in PickNodeToScheduleBottomUp()
1840   unsigned &SethiUllmanNumber = SUNumbers[SU->NodeNum];  in CalcNodeSethiUllmanNumber()
1881   SethiUllmanNumbers[SU->NodeNum] = 0;  in updateNode()
1888   assert(SU->NodeNum < SethiUllmanNumbers.size());  in getNodePriority()
1912   return SethiUllmanNumbers[SU->NodeNum];  in getNodePriority()
1914   unsigned Priority = SethiUllmanNumbers[SU->NodeNum];  in getNodePriority()
2089       DEBUG(dbgs() << "  SU(" << SU->NodeNum << ") has too many regdefs\n");  in scheduledNode()
2271   DEBUG(dbgs() << "VRegCycle: SU(" << SU->NodeNum << ")\n");  in initVRegCycle()
2309       DEBUG(dbgs() << "  VReg cycle use: SU (" << SU->NodeNum << ")\n");  in hasVRegCycleUse()
2369       DEBUG(dbgs() << "  Comparing latency of SU (" << left->NodeNum  in BUCompareLatency()
2370             << ") depth " << LDepth << " vs SU (" << right->NodeNum  in BUCompareLatency()
2393       DEBUG(dbgs() << "  SU (" << left->NodeNum << ") "  in BURRSort()
2394             << PhysRegMsg[LHasPhysReg] << " SU(" << right->NodeNum << ") "  in BURRSort()
2539     DEBUG(dbgs() << "  pressure SU(" << left->NodeNum << ") > SU("  in operator ()()
2540           << right->NodeNum << ")\n");  in operator ()()
2544     DEBUG(dbgs() << "  pressure SU(" << right->NodeNum << ") > SU("  in operator ()()
2545           << left->NodeNum << ")\n");  in operator ()()
2607     DEBUG(dbgs() << "RegPressureDiff SU(" << left->NodeNum << "): " << LPDiff  in operator ()()
2608           << " != SU(" << right->NodeNum << "): " << RPDiff << "\n");  in operator ()()
2620     DEBUG(dbgs() << "Live uses SU(" << left->NodeNum << "): " << LLiveUses  in operator ()()
2621           << " != SU(" << right->NodeNum << "): " << RLiveUses << "\n");  in operator ()()
2635       DEBUG(dbgs() << "Depth of SU(" << left->NodeNum << "): "  in operator ()()
2636             << left->getDepth() << " != SU(" << right->NodeNum << "): "  in operator ()()
2859     DEBUG(dbgs() << "    Prescheduling SU #" << SU.NodeNum  in PrescheduleNodesWithMultipleUses()
2860                  << " next to PredSU #" << PredSU->NodeNum  in PrescheduleNodesWithMultipleUses()
2951                        << SU.NodeNum << " to SU #" << SuccSU->NodeNum << "\n");  in AddPseudoTwoAddrDeps()