105     dbgs() << "SU(" << SU->NodeNum << ")";  in dumpSUList()
703       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
825         PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI);  in buildSchedGraph()
897                         << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
1057       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1062       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1076     if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {  in reduceHugeMemNodeMaps()
1080                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1084                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1260     return R.DFSNodeData[SU->NodeNum].SubtreeID  in isVisited()
1267     R.DFSNodeData[SU->NodeNum].InstrCount =  in visitPreorder()
1277     R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum;  in visitPostorderNode()
1278     RootData RData(SU->NodeNum);  in visitPostorderNode()
1286     unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount;  in visitPostorderNode()
1290       unsigned PredNum = PredDep.getSUnit()->NodeNum;  in visitPostorderNode()
1299           RootSet[PredNum].ParentNodeID = SU->NodeNum;  in visitPostorderNode()
1310     RootSet[SU->NodeNum] = RData;  in visitPostorderNode()
1317     R.DFSNodeData[Succ->NodeNum].InstrCount  in visitPostorderEdge()
1318       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;  in visitPostorderEdge()
1353       unsigned PredTree = SubtreeClasses[Pred->NodeNum];  in finalize()
1354       unsigned SuccTree = SubtreeClasses[Succ->NodeNum];  in finalize()
1372     unsigned PredNum = PredSU->NodeNum;  in joinPredSubtree()
1387     R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum;  in joinPredSubtree()
1388     SubtreeClasses.join(Succ->NodeNum, PredNum);  in joinPredSubtree()