103     dbgs() << "SU(" << su->NodeNum << ")";  in dumpSUList()
707       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
829         PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI);  in buildSchedGraph()
901                         << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
1060       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1063       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()
1257     return R.DFSNodeData[SU->NodeNum].SubtreeID  in isVisited()
1264     R.DFSNodeData[SU->NodeNum].InstrCount =  in visitPreorder()
1274     R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum;  in visitPostorderNode()
1275     RootData RData(SU->NodeNum);  in visitPostorderNode()
1283     unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount;  in visitPostorderNode()
1287       unsigned PredNum = PredDep.getSUnit()->NodeNum;  in visitPostorderNode()
1296           RootSet[PredNum].ParentNodeID = SU->NodeNum;  in visitPostorderNode()
1307     RootSet[SU->NodeNum] = RData;  in visitPostorderNode()
1314     R.DFSNodeData[Succ->NodeNum].InstrCount  in visitPostorderEdge()
1315       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;  in visitPostorderEdge()
1350       unsigned PredTree = SubtreeClasses[P.first->NodeNum];  in finalize()
1351       unsigned SuccTree = SubtreeClasses[P.second->NodeNum];  in finalize()
1369     unsigned PredNum = PredSU->NodeNum;  in joinPredSubtree()
1384     R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum;  in joinPredSubtree()
1385     SubtreeClasses.join(Succ->NodeNum, PredNum);  in joinPredSubtree()