103     dbgs() << "SU(" << su->NodeNum << ")";  in dumpSUList()
707       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
831         PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI);  in buildSchedGraph()
903                         << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
1062       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1065       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1078     if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {  in reduceHugeMemNodeMaps()
1082                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1086                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1259     return R.DFSNodeData[SU->NodeNum].SubtreeID  in isVisited()
1266     R.DFSNodeData[SU->NodeNum].InstrCount =  in visitPreorder()
1276     R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum;  in visitPostorderNode()
1277     RootData RData(SU->NodeNum);  in visitPostorderNode()
1285     unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount;  in visitPostorderNode()
1289       unsigned PredNum = PredDep.getSUnit()->NodeNum;  in visitPostorderNode()
1298           RootSet[PredNum].ParentNodeID = SU->NodeNum;  in visitPostorderNode()
1309     RootSet[SU->NodeNum] = RData;  in visitPostorderNode()
1316     R.DFSNodeData[Succ->NodeNum].InstrCount  in visitPostorderEdge()
1317       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;  in visitPostorderEdge()
1352       unsigned PredTree = SubtreeClasses[P.first->NodeNum];  in finalize()
1353       unsigned SuccTree = SubtreeClasses[P.second->NodeNum];  in finalize()
1371     unsigned PredNum = PredSU->NodeNum;  in joinPredSubtree()
1386     R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum;  in joinPredSubtree()
1387     SubtreeClasses.join(Succ->NodeNum, PredNum);  in joinPredSubtree()