491   int UpperBound, LowerBound;  in AddPred()  local
493   UpperBound = Node2Index[X->NodeNum];  in AddPred()
496   if (LowerBound < UpperBound) {  in AddPred()
499     DFS(Y, UpperBound, HasLoop);  in AddPred()
502     Shift(Visited, LowerBound, UpperBound);  in AddPred()
516 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,  in DFS()  argument
528       if (Node2Index[s] == UpperBound) {  in DFS()
533       if (!Visited.test(s) && Node2Index[s] < UpperBound) {  in DFS()
543                                        int UpperBound) {  in Shift()  argument
548   for (i = LowerBound; i <= UpperBound; ++i) {  in Shift()
586   int UpperBound, LowerBound;  in IsReachable()  local
588   UpperBound = Node2Index[SU->NodeNum];  in IsReachable()
591   if (LowerBound < UpperBound) {  in IsReachable()
594     DFS(TargetSU, UpperBound, HasLoop);  in IsReachable()