Lines Matching refs:UpperBound
549 int UpperBound, LowerBound; in AddPred() local
551 UpperBound = Node2Index[X->NodeNum]; in AddPred()
554 if (LowerBound < UpperBound) { in AddPred()
557 DFS(Y, UpperBound, HasLoop); in AddPred()
560 Shift(Visited, LowerBound, UpperBound); in AddPred()
570 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, in DFS() argument
585 if (Node2Index[s] == UpperBound) { in DFS()
590 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
602 int UpperBound = Node2Index[TargetSU.NodeNum]; in GetSubGraph() local
607 if (LowerBound > UpperBound) { in GetSubGraph()
627 if (Node2Index[s] == UpperBound) { in GetSubGraph()
632 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in GetSubGraph()
679 int UpperBound) { in Shift() argument
684 for (i = LowerBound; i <= UpperBound; ++i) { in Shift()
728 int UpperBound, LowerBound; in IsReachable() local
730 UpperBound = Node2Index[SU->NodeNum]; in IsReachable()
733 if (LowerBound < UpperBound) { in IsReachable()
736 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()