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()
257     SmallVector<Node *, 4> Worklist;  in verify()  local
259     Worklist.push_back(N);  in verify()
260     while (!Worklist.empty()) {  in verify()
261       Node *VisitingNode = Worklist.pop_back_val();  in verify()
265         Worklist.push_back(&E.getNode());  in verify()
297   SmallVector<const SCC *, 16> Worklist = {this};  in isAncestorOf()  local
301     const SCC &C = *Worklist.pop_back_val();  in isAncestorOf()
315           Worklist.push_back(CalleeC);  in isAncestorOf()
317   } while (!Worklist.empty());  in isAncestorOf()
381     SmallVector<Node *, 4> Worklist;  in verify()  local
383     Worklist.push_back(N);  in verify()
384     while (!Worklist.empty()) {  in verify()
385       Node *VisitingNode = Worklist.pop_back_val();  in verify()
389         Worklist.push_back(&E.getNode());  in verify()
421   SmallVector<const RefSCC *, 4> Worklist;  in isAncestorOf()  local
423   Worklist.push_back(this);  in isAncestorOf()
426     const RefSCC &DescendantRC = *Worklist.pop_back_val();  in isAncestorOf()
435           Worklist.push_back(ChildRC);  in isAncestorOf()
437   } while (!Worklist.empty());  in isAncestorOf()
644     SmallVector<SCC *, 4> Worklist;  in switchInternalEdgeToCall()  local
645     Worklist.push_back(&TargetSCC);  in switchInternalEdgeToCall()
647       SCC &C = *Worklist.pop_back_val();  in switchInternalEdgeToCall()
661             Worklist.push_back(&EdgeC);  in switchInternalEdgeToCall()
663     } while (!Worklist.empty());  in switchInternalEdgeToCall()
779   SmallVector<Node *, 16> Worklist;  in switchInternalEdgeToRef()  local
780   Worklist.swap(OldSCC.Nodes);  in switchInternalEdgeToRef()
781   for (Node *N : Worklist) {  in switchInternalEdgeToRef()
799   for (Node *RootN : Worklist) {  in switchInternalEdgeToRef()
1048     SmallVector<RefSCC *, 4> Worklist;  in insertIncomingRefEdge()  local
1049     Worklist.push_back(this);  in insertIncomingRefEdge()
1051       RefSCC &RC = *Worklist.pop_back_val();  in insertIncomingRefEdge()
1061               Worklist.push_back(&EdgeRC);  in insertIncomingRefEdge()
1063     } while (!Worklist.empty());  in insertIncomingRefEdge()
1206   SmallVector<Node *, 8> Worklist;  in removeInternalRefEdge()  local
1211     Worklist.append(C->Nodes.begin(), C->Nodes.end());  in removeInternalRefEdge()
1217   const int NumRefSCCNodes = Worklist.size();  in removeInternalRefEdge()
1227     Node *RootN = Worklist.pop_back_val();  in removeInternalRefEdge()
1329   } while (!Worklist.empty());  in removeInternalRefEdge()
1576   SmallVector<Constant *, 16> Worklist;  in getEdgeKind()  local
1591           Worklist.push_back(C);  in getEdgeKind()
1599   LazyCallGraph::visitReferences(Worklist, Visited, [&](Function &F) {  in getEdgeKind()
1960 void LazyCallGraph::visitReferences(SmallVectorImpl<Constant *> &Worklist,  in visitReferences()  argument
1963   while (!Worklist.empty()) {  in visitReferences()
1964     Constant *C = Worklist.pop_back_val();  in visitReferences()
1979         Worklist.push_back(cast<Constant>(Op));  in visitReferences()