Lines Matching refs:NodeNum
360 dbgs() << "SU(" << SU.NodeNum << ")"; in dumpNodeName()
481 int NodeNum = SU.NodeNum; in InitDAGTopologicalSorting() local
484 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
498 if (SU->NodeNum < DAGSize) in InitDAGTopologicalSorting()
499 Allocate(SU->NodeNum, --Id); in InitDAGTopologicalSorting()
502 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
516 assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
550 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
551 UpperBound = Node2Index[X->NodeNum]; in AddPred()
579 Visited.set(SU->NodeNum); in DFS()
582 unsigned s = SuccDep.getSUnit()->NodeNum; in DFS()
602 int LowerBound = Node2Index[StartSU.NodeNum]; in GetSubGraph()
603 int UpperBound = Node2Index[TargetSU.NodeNum]; in GetSubGraph()
624 unsigned s = Succ->NodeNum; in GetSubGraph()
658 unsigned s = Pred->NodeNum; in GetSubGraph()
717 assert(SU->NodeNum == Index2Node.size() && "Node cannot be added at the end"); in AddSUnitWithoutPredecessors()
720 Index2Node.push_back(SU->NodeNum); in AddSUnitWithoutPredecessors()
730 LowerBound = Node2Index[TargetSU->NodeNum]; in IsReachable()
731 UpperBound = Node2Index[SU->NodeNum]; in IsReachable()