Lines Matching full:visited
97 SmallPtrSet<const Value *, 16> Visited;
108 if (!Visited.insert(V).second)
360 // Defs are pushed in the order they are visited and never reordered.
642 SmallPtrSetImpl<const SUnit *> &Visited) {
646 // Remember visited nodes.
647 if (!Visited.insert(SUb).second)
677 iterateChainSucc(AA, MFI, DL, SUa, I->getSUnit(), ExitSU, Depth, Visited);
692 SmallPtrSet<const SUnit*, 16> Visited;
706 // successors. Keep track of visited nodes.
711 Visited);
1403 /// Return true if this node been visited by the DFS traversal.
1413 /// visited until visitPostorder because the DAG cannot have cycles.
1419 /// Called once for each node after all predecessors are visited. Revisit this
1629 // An already visited edge is a cross edge, assuming an acyclic DAG.
