Lines Matching refs:Visited
512 Visited.resize(DAGSize); in InitDAGTopologicalSorting()
559 Visited.reset(); in AddPred()
563 Shift(Visited, LowerBound, UpperBound); in AddPred()
582 Visited.set(SU->NodeNum); in DFS()
593 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
616 Visited.reset(); in GetSubGraph()
635 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in GetSubGraph()
636 Visited.set(s); in GetSubGraph()
668 if (!VisitedBack.test(s) && Visited.test(s)) { in GetSubGraph()
681 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift() argument
690 if (Visited.test(w)) { in Shift()
692 Visited.reset(w); in Shift()
723 Visited.resize(Node2Index.size()); in AddSUnitWithoutPredecessors()
739 Visited.reset(); in IsReachable()