78   SmallVector<Constant *, 16> Worklist;  in populateSlow()  local
112             Worklist.push_back(C);  in populateSlow()
118   visitReferences(Worklist, Visited, [&](Function &F) {  in populateSlow()
191   SmallVector<Constant *, 16> Worklist;  in LazyCallGraph()  local
196         Worklist.push_back(GV.getInitializer());  in LazyCallGraph()
201   visitReferences(Worklist, Visited, [&](Function &F) {  in LazyCallGraph()
265     SmallVector<Node *, 4> Worklist;  in verify()  local
267     Worklist.push_back(N);  in verify()
268     while (!Worklist.empty()) {  in verify()
269       Node *VisitingNode = Worklist.pop_back_val();  in verify()
273         Worklist.push_back(&E.getNode());  in verify()
305   SmallVector<const SCC *, 16> Worklist = {this};  in isAncestorOf()  local
309     const SCC &C = *Worklist.pop_back_val();  in isAncestorOf()
323           Worklist.push_back(CalleeC);  in isAncestorOf()
325   } 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()
652     SmallVector<SCC *, 4> Worklist;  in switchInternalEdgeToCall()  local
653     Worklist.push_back(&TargetSCC);  in switchInternalEdgeToCall()
655       SCC &C = *Worklist.pop_back_val();  in switchInternalEdgeToCall()
669             Worklist.push_back(&EdgeC);  in switchInternalEdgeToCall()
671     } while (!Worklist.empty());  in switchInternalEdgeToCall()
787   SmallVector<Node *, 16> Worklist;  in switchInternalEdgeToRef()  local
788   Worklist.swap(OldSCC.Nodes);  in switchInternalEdgeToRef()
789   for (Node *N : Worklist) {  in switchInternalEdgeToRef()
807   for (Node *RootN : Worklist) {  in switchInternalEdgeToRef()
1056     SmallVector<RefSCC *, 4> Worklist;  in insertIncomingRefEdge()  local
1057     Worklist.push_back(this);  in insertIncomingRefEdge()
1059       RefSCC &RC = *Worklist.pop_back_val();  in insertIncomingRefEdge()
1069               Worklist.push_back(&EdgeRC);  in insertIncomingRefEdge()
1071     } while (!Worklist.empty());  in insertIncomingRefEdge()
1210   SmallVector<Node *, 8> Worklist;  in removeInternalRefEdges()  local
1215     Worklist.append(C->Nodes.begin(), C->Nodes.end());  in removeInternalRefEdges()
1221   const int NumRefSCCNodes = Worklist.size();  in removeInternalRefEdges()
1231     Node *RootN = Worklist.pop_back_val();  in removeInternalRefEdges()
1333   } while (!Worklist.empty());  in removeInternalRefEdges()
1587   SmallVector<Constant *, 16> Worklist;  in getEdgeKind()  local
1602           Worklist.push_back(C);  in getEdgeKind()
1610   LazyCallGraph::visitReferences(Worklist, Visited, [&](Function &F) {  in getEdgeKind()
1971 void LazyCallGraph::visitReferences(SmallVectorImpl<Constant *> &Worklist,  in visitReferences()  argument
1974   while (!Worklist.empty()) {  in visitReferences()
1975     Constant *C = Worklist.pop_back_val();  in visitReferences()
1990         Worklist.push_back(cast<Constant>(Op));  in visitReferences()