Lines Matching refs:Visited
510 Visited.resize(DAGSize); in InitDAGTopologicalSorting()
557 Visited.reset(); in AddPred()
561 Shift(Visited, LowerBound, UpperBound); in AddPred()
580 Visited.set(SU->NodeNum); in DFS()
591 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
614 Visited.reset(); in GetSubGraph()
633 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in GetSubGraph()
634 Visited.set(s); in GetSubGraph()
666 if (!VisitedBack.test(s) && Visited.test(s)) { in GetSubGraph()
679 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift() argument
688 if (Visited.test(w)) { in Shift()
690 Visited.reset(w); in Shift()
721 Visited.resize(Node2Index.size()); in AddSUnitWithoutPredecessors()
737 Visited.reset(); in IsReachable()