Lines Matching defs:LowerBound
551 int UpperBound, LowerBound;
552 LowerBound = Node2Index[Y->NodeNum];
556 if (LowerBound < UpperBound) {
562 Shift(Visited, LowerBound, UpperBound);
603 int LowerBound = Node2Index[StartSU.NodeNum];
609 if (LowerBound > UpperBound) {
651 // to LowerBound. SUs that are visited by the two
663 if (Node2Index[s] == LowerBound) {
680 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,
686 for (i = LowerBound; i <= UpperBound; ++i) {
732 int UpperBound, LowerBound;
733 LowerBound = Node2Index[TargetSU->NodeNum];
737 if (LowerBound < UpperBound) {