Lines Matching defs:Visited
102 SmallPtrSet<const Value *, 16> Visited;
113 if (!Visited.insert(V))
365 // Defs are pushed in the order they are visited and never reordered.
578 SmallPtrSet<const SUnit*, 16> &Visited) {
582 // Remember visited nodes.
583 if (!Visited.insert(SUb))
613 iterateChainSucc (AA, MFI, SUa, I->getSUnit(), ExitSU, Depth, Visited);
627 SmallPtrSet<const SUnit*, 16> Visited;
640 // Keep track of visited nodes.
645 ExitSU, &Depth, Visited);
1250 /// Return true if this node been visited by the DFS traversal.
1260 /// visited until visitPostorder because the DAG cannot have cycles.
1266 /// Called once for each node after all predecessors are visited. Revisit this
1476 // An already visited edge is a cross edge, assuming an acyclic DAG.
