Lines Matching refs:UpperBound
514 int UpperBound, LowerBound; in AddPred() local
516 UpperBound = Node2Index[X->NodeNum]; in AddPred()
519 if (LowerBound < UpperBound) { in AddPred()
522 DFS(Y, UpperBound, HasLoop); in AddPred()
525 Shift(Visited, LowerBound, UpperBound); in AddPred()
533 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, in DFS() argument
549 if (Node2Index[s] == UpperBound) { in DFS()
554 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
566 int UpperBound = Node2Index[TargetSU.NodeNum]; in GetSubGraph() local
571 if (LowerBound > UpperBound) { in GetSubGraph()
591 if (Node2Index[s] == UpperBound) { in GetSubGraph()
596 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in GetSubGraph()
643 int UpperBound) { in Shift() argument
648 for (i = LowerBound; i <= UpperBound; ++i) { in Shift()
682 int UpperBound, LowerBound; in IsReachable() local
684 UpperBound = Node2Index[SU->NodeNum]; in IsReachable()
687 if (LowerBound < UpperBound) { in IsReachable()
690 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()