Lines Matching refs:Visited
509 Visited.resize(DAGSize); in InitDAGTopologicalSorting()
556 Visited.reset(); in AddPred()
560 Shift(Visited, LowerBound, UpperBound); in AddPred()
579 Visited.set(SU->NodeNum); in DFS()
590 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
613 Visited.reset(); in GetSubGraph()
632 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in GetSubGraph()
633 Visited.set(s); in GetSubGraph()
665 if (!VisitedBack.test(s) && Visited.test(s)) { in GetSubGraph()
678 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift() argument
687 if (Visited.test(w)) { in Shift()
689 Visited.reset(w); in Shift()
720 Visited.resize(Node2Index.size()); in AddSUnitWithoutPredecessors()
734 Visited.reset(); in IsReachable()