Lines Matching refs:UpperBound
550 int UpperBound, LowerBound; in AddPred() local
552 UpperBound = Node2Index[X->NodeNum]; in AddPred()
555 if (LowerBound < UpperBound) { in AddPred()
558 DFS(Y, UpperBound, HasLoop); in AddPred()
561 Shift(Visited, LowerBound, UpperBound); in AddPred()
571 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, in DFS() argument
586 if (Node2Index[s] == UpperBound) { in DFS()
591 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
603 int UpperBound = Node2Index[TargetSU.NodeNum]; in GetSubGraph() local
608 if (LowerBound > UpperBound) { in GetSubGraph()
628 if (Node2Index[s] == UpperBound) { in GetSubGraph()
633 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in GetSubGraph()
680 int UpperBound) { in Shift() argument
685 for (i = LowerBound; i <= UpperBound; ++i) { in Shift()
731 int UpperBound, LowerBound; in IsReachable() local
733 UpperBound = Node2Index[SU->NodeNum]; in IsReachable()
736 if (LowerBound < UpperBound) { in IsReachable()
739 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()