552   int UpperBound, LowerBound;  in AddPred()  local
554   UpperBound = Node2Index[X->NodeNum];  in AddPred()
557   if (LowerBound < UpperBound) {  in AddPred()
560     DFS(Y, UpperBound, HasLoop);  in AddPred()
563     Shift(Visited, LowerBound, UpperBound);  in AddPred()
573 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,  in DFS()  argument
588       if (Node2Index[s] == UpperBound) {  in DFS()
593       if (!Visited.test(s) && Node2Index[s] < UpperBound) {  in DFS()
605   int UpperBound = Node2Index[TargetSU.NodeNum];  in GetSubGraph()  local
610   if (LowerBound > UpperBound) {  in GetSubGraph()
630       if (Node2Index[s] == UpperBound) {  in GetSubGraph()
635       if (!Visited.test(s) && Node2Index[s] < UpperBound) {  in GetSubGraph()
682                                        int UpperBound) {  in Shift()  argument
687   for (i = LowerBound; i <= UpperBound; ++i) {  in Shift()
733   int UpperBound, LowerBound;  in IsReachable()  local
735   UpperBound = Node2Index[SU->NodeNum];  in IsReachable()
738   if (LowerBound < UpperBound) {  in IsReachable()
741     DFS(TargetSU, UpperBound, HasLoop);  in IsReachable()