317   dbgs() << "SU(" << NodeNum << "): ";  in dump()
346       dbgs() << "SU(" << I->getSUnit()->NodeNum << ")";  in dumpAll()
366       dbgs() << "SU(" << I->getSUnit()->NodeNum << ")";  in dumpAll()
473     int NodeNum = SU->NodeNum;  in InitDAGTopologicalSorting()  local
476     Node2Index[NodeNum] = Degree;  in InitDAGTopologicalSorting()
490     if (SU->NodeNum < DAGSize)  in InitDAGTopologicalSorting()
491       Allocate(SU->NodeNum, --Id);  in InitDAGTopologicalSorting()
495       if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum])  in InitDAGTopologicalSorting()
510       assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum] &&  in InitDAGTopologicalSorting()
521   LowerBound = Node2Index[Y->NodeNum];  in AddPred()
522   UpperBound = Node2Index[X->NodeNum];  in AddPred()
554     Visited.set(SU->NodeNum);  in DFS()
556       unsigned s = SU->Succs[I].getSUnit()->NodeNum;  in DFS()
620   LowerBound = Node2Index[TargetSU->NodeNum];  in IsReachable()
621   UpperBound = Node2Index[SU->NodeNum];  in IsReachable()