521   int UpperBound, LowerBound;  in AddPred()  local
523   UpperBound = Node2Index[X->NodeNum];  in AddPred()
526   if (LowerBound < UpperBound) {  in AddPred()
529     DFS(Y, UpperBound, HasLoop);  in AddPred()
532     Shift(Visited, LowerBound, UpperBound);  in AddPred()
546 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,  in DFS()  argument
561       if (Node2Index[s] == UpperBound) {  in DFS()
566       if (!Visited.test(s) && Node2Index[s] < UpperBound) {  in DFS()
576                                        int UpperBound) {  in Shift()  argument
581   for (i = LowerBound; i <= UpperBound; ++i) {  in Shift()
620   int UpperBound, LowerBound;  in IsReachable()  local
622   UpperBound = Node2Index[SU->NodeNum];  in IsReachable()
625   if (LowerBound < UpperBound) {  in IsReachable()
628     DFS(TargetSU, UpperBound, HasLoop);  in IsReachable()