291   dbgs() << "SU(" << NodeNum << "): ";  in dump()
317       dbgs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";  in dumpAll()
338       dbgs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";  in dumpAll()
445     int NodeNum = SU->NodeNum;  in InitDAGTopologicalSorting()  local
448     Node2Index[NodeNum] = Degree;  in InitDAGTopologicalSorting()
462     Allocate(SU->NodeNum, --Id);  in InitDAGTopologicalSorting()
466       if (!--Node2Index[SU->NodeNum])  in InitDAGTopologicalSorting()
481       assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum] &&  in InitDAGTopologicalSorting()
492   LowerBound = Node2Index[Y->NodeNum];  in AddPred()
493   UpperBound = Node2Index[X->NodeNum];  in AddPred()
525     Visited.set(SU->NodeNum);  in DFS()
527       int s = SU->Succs[I].getSUnit()->NodeNum;  in DFS()
587   LowerBound = Node2Index[TargetSU->NodeNum];  in IsReachable()
588   UpperBound = Node2Index[SU->NodeNum];  in IsReachable()