552   int UpperBound, LowerBound;  in AddPred()  local
553   LowerBound = Node2Index[Y->NodeNum];  in AddPred()
557   if (LowerBound < UpperBound) {  in AddPred()
563     Shift(Visited, LowerBound, UpperBound);  in AddPred()
604   int LowerBound = Node2Index[StartSU.NodeNum];  in GetSubGraph()  local
610   if (LowerBound > UpperBound) {  in GetSubGraph()
664       if (Node2Index[s] == LowerBound) {  in GetSubGraph()
681 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,  in Shift()  argument
687   for (i = LowerBound; i <= UpperBound; ++i) {  in Shift()
733   int UpperBound, LowerBound;  in IsReachable()  local
734   LowerBound = Node2Index[TargetSU->NodeNum];  in IsReachable()
738   if (LowerBound < UpperBound) {  in IsReachable()