83   SmallVector<Constant *, 16> Worklist;  in populateSlow()  local
117             Worklist.push_back(C);  in populateSlow()
123   visitReferences(Worklist, Visited, [&](Function &F) {  in populateSlow()
196   SmallVector<Constant *, 16> Worklist;  in LazyCallGraph()  local
201         Worklist.push_back(GV.getInitializer());  in LazyCallGraph()
206   visitReferences(Worklist, Visited, [&](Function &F) {  in LazyCallGraph()
263     SmallVector<Node *, 4> Worklist;  in verify()  local
265     Worklist.push_back(N);  in verify()
266     while (!Worklist.empty()) {  in verify()
267       Node *VisitingNode = Worklist.pop_back_val();  in verify()
271         Worklist.push_back(&E.getNode());  in verify()
303   SmallVector<const SCC *, 16> Worklist = {this};  in isAncestorOf()  local
307     const SCC &C = *Worklist.pop_back_val();  in isAncestorOf()
321           Worklist.push_back(CalleeC);  in isAncestorOf()
323   } while (!Worklist.empty());  in isAncestorOf()
389     SmallVector<Node *, 4> Worklist;  in verify()  local
391     Worklist.push_back(N);  in verify()
392     while (!Worklist.empty()) {  in verify()
393       Node *VisitingNode = Worklist.pop_back_val();  in verify()
397         Worklist.push_back(&E.getNode());  in verify()
429   SmallVector<const RefSCC *, 4> Worklist;  in isAncestorOf()  local
431   Worklist.push_back(this);  in isAncestorOf()
434     const RefSCC &DescendantRC = *Worklist.pop_back_val();  in isAncestorOf()
443           Worklist.push_back(ChildRC);  in isAncestorOf()
445   } while (!Worklist.empty());  in isAncestorOf()
654     SmallVector<SCC *, 4> Worklist;  in switchInternalEdgeToCall()  local
655     Worklist.push_back(&TargetSCC);  in switchInternalEdgeToCall()
657       SCC &C = *Worklist.pop_back_val();  in switchInternalEdgeToCall()
671             Worklist.push_back(&EdgeC);  in switchInternalEdgeToCall()
673     } while (!Worklist.empty());  in switchInternalEdgeToCall()
793   SmallVector<Node *, 16> Worklist;  in switchInternalEdgeToRef()  local
794   Worklist.swap(OldSCC.Nodes);  in switchInternalEdgeToRef()
795   for (Node *N : Worklist) {  in switchInternalEdgeToRef()
813   for (Node *RootN : Worklist) {  in switchInternalEdgeToRef()
1064     SmallVector<RefSCC *, 4> Worklist;  in insertIncomingRefEdge()  local
1065     Worklist.push_back(this);  in insertIncomingRefEdge()
1067       RefSCC &RC = *Worklist.pop_back_val();  in insertIncomingRefEdge()
1077               Worklist.push_back(&EdgeRC);  in insertIncomingRefEdge()
1079     } while (!Worklist.empty());  in insertIncomingRefEdge()
1222   SmallVector<Node *, 8> Worklist;  in removeInternalRefEdge()  local
1227     Worklist.append(C->Nodes.begin(), C->Nodes.end());  in removeInternalRefEdge()
1233   const int NumRefSCCNodes = Worklist.size();  in removeInternalRefEdge()
1243     Node *RootN = Worklist.pop_back_val();  in removeInternalRefEdge()
1347   } while (!Worklist.empty());  in removeInternalRefEdge()
1567   SmallVector<Constant *, 16> Worklist;  in getEdgeKind()  local
1582           Worklist.push_back(C);  in getEdgeKind()
1590   LazyCallGraph::visitReferences(Worklist, Visited, [&](Function &F) {  in getEdgeKind()
1953 void LazyCallGraph::visitReferences(SmallVectorImpl<Constant *> &Worklist,  in visitReferences()  argument
1956   while (!Worklist.empty()) {  in visitReferences()
1957     Constant *C = Worklist.pop_back_val();  in visitReferences()
1972         Worklist.push_back(cast<Constant>(Op));  in visitReferences()