lib/CodeGen/ScheduleDAG.cpp

549   int UpperBound, LowerBound;
551   UpperBound = Node2Index[X->NodeNum];
554   if (LowerBound < UpperBound) {
557     DFS(Y, UpperBound, HasLoop);
560     Shift(Visited, LowerBound, UpperBound);
570 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
586       if (Node2Index[s] == UpperBound) {
591       if (!Visited.test(s) && Node2Index[s] < UpperBound) {
603   int UpperBound = Node2Index[TargetSU.NodeNum];
608   if (LowerBound > UpperBound) {
617   // to UpperBound.
628       if (Node2Index[s] == UpperBound) {
633       if (!Visited.test(s) && Node2Index[s] < UpperBound) {
680                                        int UpperBound) {
685   for (i = LowerBound; i <= UpperBound; ++i) {
721   int UpperBound, LowerBound;
723   UpperBound = Node2Index[SU->NodeNum];
726   if (LowerBound < UpperBound) {
729     DFS(TargetSU, UpperBound, HasLoop);