105     dbgs() << "SU(" << SU->NodeNum << ")";  in dumpSUList()
716       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
838         PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI);  in buildSchedGraph()
910                         << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
1069       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1074       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1088     if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {  in reduceHugeMemNodeMaps()
1092                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1096                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1274     return R.DFSNodeData[SU->NodeNum].SubtreeID  in isVisited()
1281     R.DFSNodeData[SU->NodeNum].InstrCount =  in visitPreorder()
1291     R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum;  in visitPostorderNode()
1292     RootData RData(SU->NodeNum);  in visitPostorderNode()
1300     unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount;  in visitPostorderNode()
1304       unsigned PredNum = PredDep.getSUnit()->NodeNum;  in visitPostorderNode()
1313           RootSet[PredNum].ParentNodeID = SU->NodeNum;  in visitPostorderNode()
1324     RootSet[SU->NodeNum] = RData;  in visitPostorderNode()
1331     R.DFSNodeData[Succ->NodeNum].InstrCount  in visitPostorderEdge()
1332       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;  in visitPostorderEdge()
1367       unsigned PredTree = SubtreeClasses[Pred->NodeNum];  in finalize()
1368       unsigned SuccTree = SubtreeClasses[Succ->NodeNum];  in finalize()
1386     unsigned PredNum = PredSU->NodeNum;  in joinPredSubtree()
1401     R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum;  in joinPredSubtree()
1402     SubtreeClasses.join(Succ->NodeNum, PredNum);  in joinPredSubtree()