Lines Matching refs:NodeNum
356 dbgs() << "SU(" << SU.NodeNum << ")"; in dumpNodeName()
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()
493 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
506 assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
515 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
516 UpperBound = Node2Index[X->NodeNum]; in AddPred()
542 Visited.set(SU->NodeNum); in DFS()
545 unsigned s = SuccDep.getSUnit()->NodeNum; in DFS()
565 int LowerBound = Node2Index[StartSU.NodeNum]; in GetSubGraph()
566 int UpperBound = Node2Index[TargetSU.NodeNum]; in GetSubGraph()
587 unsigned s = Succ->NodeNum; in GetSubGraph()
621 unsigned s = Pred->NodeNum; in GetSubGraph()
683 LowerBound = Node2Index[TargetSU->NodeNum]; in IsReachable()
684 UpperBound = Node2Index[SU->NodeNum]; in IsReachable()