104     dbgs() << "SU(" << su->NodeNum << ")";  in dumpSUList()
681       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
794         PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI);  in buildSchedGraph()
866                         << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
1007       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1010       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1023     if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {  in reduceHugeMemNodeMaps()
1027                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1031                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1188     return R.DFSNodeData[SU->NodeNum].SubtreeID  in isVisited()
1195     R.DFSNodeData[SU->NodeNum].InstrCount =  in visitPreorder()
1205     R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum;  in visitPostorderNode()
1206     RootData RData(SU->NodeNum);  in visitPostorderNode()
1214     unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount;  in visitPostorderNode()
1218       unsigned PredNum = PredDep.getSUnit()->NodeNum;  in visitPostorderNode()
1227           RootSet[PredNum].ParentNodeID = SU->NodeNum;  in visitPostorderNode()
1238     RootSet[SU->NodeNum] = RData;  in visitPostorderNode()
1245     R.DFSNodeData[Succ->NodeNum].InstrCount  in visitPostorderEdge()
1246       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;  in visitPostorderEdge()
1281       unsigned PredTree = SubtreeClasses[P.first->NodeNum];  in finalize()
1282       unsigned SuccTree = SubtreeClasses[P.second->NodeNum];  in finalize()
1300     unsigned PredNum = PredSU->NodeNum;  in joinPredSubtree()
1315     R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum;  in joinPredSubtree()
1316     SubtreeClasses.join(Succ->NodeNum, PredNum);  in joinPredSubtree()