80   SmallPtrSet<Constant *, 16> Visited;  in populateSlow()  local
104               Visited.insert(Callee);  in populateSlow()
111           if (Visited.insert(C).second)  in populateSlow()
118   visitReferences(Worklist, Visited, [&](Function &F) {  in populateSlow()
126     if (!Visited.count(F))  in populateSlow()
192   SmallPtrSet<Constant *, 16> Visited;  in LazyCallGraph()  local
195       if (Visited.insert(GV.getInitializer()).second)  in LazyCallGraph()
201   visitReferences(Worklist, Visited, [&](Function &F) {  in LazyCallGraph()
266     SmallPtrSet<Node *, 4> Visited;  in verify()  local
270       if (!Visited.insert(VisitingNode).second)  in verify()
276       assert(Visited.contains(NodeToVisit) &&  in verify()
304   SmallPtrSet<const SCC *, 16> Visited = {this};  in isAncestorOf()  local
322         if (Visited.insert(CalleeC).second)  in isAncestorOf()
390     SmallPtrSet<Node *, 4> Visited;  in verify()  local
394       if (!Visited.insert(VisitingNode).second)  in verify()
400       assert(Visited.contains(NodeToVisit) &&  in verify()
430   SmallPtrSet<const RefSCC *, 4> Visited;  in isAncestorOf()  local
432   Visited.insert(this);  in isAncestorOf()
441           if (!ChildRC || !Visited.insert(ChildRC).second)  in isAncestorOf()
1588   SmallPtrSet<Constant *, 16> Visited;  in getEdgeKind()  local
1601         if (Visited.insert(C).second)  in getEdgeKind()
1610   LazyCallGraph::visitReferences(Worklist, Visited, [&](Function &F) {  in getEdgeKind()
1972                                     SmallPtrSetImpl<Constant *> &Visited,  in visitReferences()  argument
1989       if (Visited.insert(cast<Constant>(Op)).second)  in visitReferences()