519   int UpperBound, LowerBound;  in AddPred()  local
521   UpperBound = Node2Index[X->NodeNum];  in AddPred()
524   if (LowerBound < UpperBound) {  in AddPred()
527     DFS(Y, UpperBound, HasLoop);  in AddPred()
530     Shift(Visited, LowerBound, UpperBound);  in AddPred()
544 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,  in DFS()  argument
559       if (Node2Index[s] == UpperBound) {  in DFS()
564       if (!Visited.test(s) && Node2Index[s] < UpperBound) {  in DFS()
574                                        int UpperBound) {  in Shift()  argument
579   for (i = LowerBound; i <= UpperBound; ++i) {  in Shift()
618   int UpperBound, LowerBound;  in IsReachable()  local
620   UpperBound = Node2Index[SU->NodeNum];  in IsReachable()
623   if (LowerBound < UpperBound) {  in IsReachable()
626     DFS(TargetSU, UpperBound, HasLoop);  in IsReachable()