550   int UpperBound, LowerBound;  in AddPred()  local
551   LowerBound = Node2Index[Y->NodeNum];  in AddPred()
555   if (LowerBound < UpperBound) {  in AddPred()
561     Shift(Visited, LowerBound, UpperBound);  in AddPred()
602   int LowerBound = Node2Index[StartSU.NodeNum];  in GetSubGraph()  local
608   if (LowerBound > UpperBound) {  in GetSubGraph()
662       if (Node2Index[s] == LowerBound) {  in GetSubGraph()
679 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,  in Shift()  argument
685   for (i = LowerBound; i <= UpperBound; ++i) {  in Shift()
731   int UpperBound, LowerBound;  in IsReachable()  local
732   LowerBound = Node2Index[TargetSU->NodeNum];  in IsReachable()
736   if (LowerBound < UpperBound) {  in IsReachable()