Lines Matching defs:UpperBound

552   int UpperBound, LowerBound;
554   UpperBound = Node2Index[X->NodeNum];
557   if (LowerBound < UpperBound) {
560     DFS(Y, UpperBound, HasLoop);
563     Shift(Visited, LowerBound, UpperBound);
573 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
588       if (Node2Index[s] == UpperBound) {
593       if (!Visited.test(s) && Node2Index[s] < UpperBound) {
605   int UpperBound = Node2Index[TargetSU.NodeNum];
610   if (LowerBound > UpperBound) {
619   // to UpperBound.
630       if (Node2Index[s] == UpperBound) {
635       if (!Visited.test(s) && Node2Index[s] < UpperBound) {
682                                        int UpperBound) {
687   for (i = LowerBound; i <= UpperBound; ++i) {
733   int UpperBound, LowerBound;
735   UpperBound = Node2Index[SU->NodeNum];
738   if (LowerBound < UpperBound) {
741     DFS(TargetSU, UpperBound, HasLoop);