105     dbgs() << "SU(" << SU->NodeNum << ")";  in dumpSUList()
714       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
836         PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI);  in buildSchedGraph()
908                         << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
1067       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1072       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1086     if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {  in reduceHugeMemNodeMaps()
1090                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1094                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1270     return R.DFSNodeData[SU->NodeNum].SubtreeID  in isVisited()
1277     R.DFSNodeData[SU->NodeNum].InstrCount =  in visitPreorder()
1287     R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum;  in visitPostorderNode()
1288     RootData RData(SU->NodeNum);  in visitPostorderNode()
1296     unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount;  in visitPostorderNode()
1300       unsigned PredNum = PredDep.getSUnit()->NodeNum;  in visitPostorderNode()
1309           RootSet[PredNum].ParentNodeID = SU->NodeNum;  in visitPostorderNode()
1320     RootSet[SU->NodeNum] = RData;  in visitPostorderNode()
1327     R.DFSNodeData[Succ->NodeNum].InstrCount  in visitPostorderEdge()
1328       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;  in visitPostorderEdge()
1363       unsigned PredTree = SubtreeClasses[Pred->NodeNum];  in finalize()
1364       unsigned SuccTree = SubtreeClasses[Succ->NodeNum];  in finalize()
1382     unsigned PredNum = PredSU->NodeNum;  in joinPredSubtree()
1397     R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum;  in joinPredSubtree()
1398     SubtreeClasses.join(Succ->NodeNum, PredNum);  in joinPredSubtree()