81     dbgs() << "SU(" << su->NodeNum << ")";  in dumpSUList()
820       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
938         PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI);  in buildSchedGraph()
1014             << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
1159       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1162       NodeNums.push_back(SU->NodeNum);  in reduceHugeMemNodeMaps()
1175     if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {  in reduceHugeMemNodeMaps()
1179             << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1183             << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1433     return R.DFSNodeData[SU->NodeNum].SubtreeID  in isVisited()
1440     R.DFSNodeData[SU->NodeNum].InstrCount =  in visitPreorder()
1450     R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum;  in visitPostorderNode()
1451     RootData RData(SU->NodeNum);  in visitPostorderNode()
1459     unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount;  in visitPostorderNode()
1464       unsigned PredNum = PI->getSUnit()->NodeNum;  in visitPostorderNode()
1473           RootSet[PredNum].ParentNodeID = SU->NodeNum;  in visitPostorderNode()
1484     RootSet[SU->NodeNum] = RData;  in visitPostorderNode()
1491     R.DFSNodeData[Succ->NodeNum].InstrCount  in visitPostorderEdge()
1492       += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount;  in visitPostorderEdge()
1530       unsigned PredTree = SubtreeClasses[I->first->NodeNum];  in finalize()
1531       unsigned SuccTree = SubtreeClasses[I->second->NodeNum];  in finalize()
1549     unsigned PredNum = PredSU->NodeNum;  in joinPredSubtree()
1565     R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum;  in joinPredSubtree()
1566     SubtreeClasses.join(Succ->NodeNum, PredNum);  in joinPredSubtree()