317   dbgs() << "SU(" << NodeNum << "): ";  in dump()
346       dbgs() << "SU(" << I->getSUnit()->NodeNum << ")";  in dumpAll()
366       dbgs() << "SU(" << I->getSUnit()->NodeNum << ")";  in dumpAll()
472     int NodeNum = SU->NodeNum;  in InitDAGTopologicalSorting()  local
475     Node2Index[NodeNum] = Degree;  in InitDAGTopologicalSorting()
489     if (SU->NodeNum < DAGSize)  in InitDAGTopologicalSorting()
490       Allocate(SU->NodeNum, --Id);  in InitDAGTopologicalSorting()
494       if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum])  in InitDAGTopologicalSorting()
509       assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum] &&  in InitDAGTopologicalSorting()
520   LowerBound = Node2Index[Y->NodeNum];  in AddPred()
521   UpperBound = Node2Index[X->NodeNum];  in AddPred()
553     Visited.set(SU->NodeNum);  in DFS()
555       unsigned s = SU->Succs[I].getSUnit()->NodeNum;  in DFS()
619   LowerBound = Node2Index[TargetSU->NodeNum];  in IsReachable()
620   UpperBound = Node2Index[SU->NodeNum];  in IsReachable()