Lines Matching defs:LowerBound
552 int UpperBound, LowerBound;
553 LowerBound = Node2Index[Y->NodeNum];
557 if (LowerBound < UpperBound) {
563 Shift(Visited, LowerBound, UpperBound);
604 int LowerBound = Node2Index[StartSU.NodeNum];
610 if (LowerBound > UpperBound) {
652 // to LowerBound. SUs that are visited by the two
664 if (Node2Index[s] == LowerBound) {
681 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,
687 for (i = LowerBound; i <= UpperBound; ++i) {
733 int UpperBound, LowerBound;
734 LowerBound = Node2Index[TargetSU->NodeNum];
738 if (LowerBound < UpperBound) {