Lines Matching full:upperbound

551   int UpperBound, LowerBound;
553   UpperBound = Node2Index[X->NodeNum];
556   if (LowerBound < UpperBound) {
559     DFS(Y, UpperBound, HasLoop);
562     Shift(Visited, LowerBound, UpperBound);
572 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
587       if (Node2Index[s] == UpperBound) {
592       if (!Visited.test(s) && Node2Index[s] < UpperBound) {
604   int UpperBound = Node2Index[TargetSU.NodeNum];
609   if (LowerBound > UpperBound) {
618   // to UpperBound.
629       if (Node2Index[s] == UpperBound) {
634       if (!Visited.test(s) && Node2Index[s] < UpperBound) {
681                                        int UpperBound) {
686   for (i = LowerBound; i <= UpperBound; ++i) {
732   int UpperBound, LowerBound;
734   UpperBound = Node2Index[SU->NodeNum];
737   if (LowerBound < UpperBound) {
740     DFS(TargetSU, UpperBound, HasLoop);