Lines Matching full:visited
93 SmallPtrSet<const Value*, 16> Visited;
104 if (!Visited.insert(V))
355 // Defs are pushed in the order they are visited and never reordered.
557 SmallPtrSet<const SUnit*, 16> &Visited) {
561 // Remember visited nodes.
562 if (!Visited.insert(SUb))
592 iterateChainSucc (AA, MFI, SUa, I->getSUnit(), ExitSU, Depth, Visited);
606 SmallPtrSet<const SUnit*, 16> Visited;
619 // Keep track of visited nodes.
624 ExitSU, &Depth, Visited);
1037 /// Return true if this node been visited by the DFS traversal.
1047 /// visited until visitPostorder because the DAG cannot have cycles.
1053 /// Called once for each node after all predecessors are visited. Revisit this
1263 // An already visited edge is a cross edge, assuming an acyclic DAG.
