99     dbgs() << "SU(" << su->NodeNum << ")";  in dumpSUList()
697       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
819         PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI);  in buildSchedGraph()
891                         << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
1050       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1053       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1066     if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {  in reduceHugeMemNodeMaps()
1070                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1074                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1247     return R.DFSNodeData[SU->NodeNum].SubtreeID  in isVisited()
1254     R.DFSNodeData[SU->NodeNum].InstrCount =  in visitPreorder()
1264     R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum;  in visitPostorderNode()
1265     RootData RData(SU->NodeNum);  in visitPostorderNode()
1273     unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount;  in visitPostorderNode()
1277       unsigned PredNum = PredDep.getSUnit()->NodeNum;  in visitPostorderNode()
1286           RootSet[PredNum].ParentNodeID = SU->NodeNum;  in visitPostorderNode()
1297     RootSet[SU->NodeNum] = RData;  in visitPostorderNode()
1304     R.DFSNodeData[Succ->NodeNum].InstrCount  in visitPostorderEdge()
1305       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;  in visitPostorderEdge()
1340       unsigned PredTree = SubtreeClasses[P.first->NodeNum];  in finalize()
1341       unsigned SuccTree = SubtreeClasses[P.second->NodeNum];  in finalize()
1359     unsigned PredNum = PredSU->NodeNum;  in joinPredSubtree()
1374     R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum;  in joinPredSubtree()
1375     SubtreeClasses.join(Succ->NodeNum, PredNum);  in joinPredSubtree()