81   SmallVector<Constant *, 16> Worklist;  in populateSlow()  local
115             Worklist.push_back(C);  in populateSlow()
121   visitReferences(Worklist, Visited, [&](Function &F) {  in populateSlow()
194   SmallVector<Constant *, 16> Worklist;  in LazyCallGraph()  local
199         Worklist.push_back(GV.getInitializer());  in LazyCallGraph()
204   visitReferences(Worklist, Visited, [&](Function &F) {  in LazyCallGraph()
262     SmallVector<Node *, 4> Worklist;  in verify()  local
264     Worklist.push_back(N);  in verify()
265     while (!Worklist.empty()) {  in verify()
266       Node *VisitingNode = Worklist.pop_back_val();  in verify()
270         Worklist.push_back(&E.getNode());  in verify()
302   SmallVector<const SCC *, 16> Worklist = {this};  in isAncestorOf()  local
306     const SCC &C = *Worklist.pop_back_val();  in isAncestorOf()
320           Worklist.push_back(CalleeC);  in isAncestorOf()
322   } while (!Worklist.empty());  in isAncestorOf()
388     SmallVector<Node *, 4> Worklist;  in verify()  local
390     Worklist.push_back(N);  in verify()
391     while (!Worklist.empty()) {  in verify()
392       Node *VisitingNode = Worklist.pop_back_val();  in verify()
396         Worklist.push_back(&E.getNode());  in verify()
428   SmallVector<const RefSCC *, 4> Worklist;  in isAncestorOf()  local
430   Worklist.push_back(this);  in isAncestorOf()
433     const RefSCC &DescendantRC = *Worklist.pop_back_val();  in isAncestorOf()
442           Worklist.push_back(ChildRC);  in isAncestorOf()
444   } while (!Worklist.empty());  in isAncestorOf()
653     SmallVector<SCC *, 4> Worklist;  in switchInternalEdgeToCall()  local
654     Worklist.push_back(&TargetSCC);  in switchInternalEdgeToCall()
656       SCC &C = *Worklist.pop_back_val();  in switchInternalEdgeToCall()
670             Worklist.push_back(&EdgeC);  in switchInternalEdgeToCall()
672     } while (!Worklist.empty());  in switchInternalEdgeToCall()
792   SmallVector<Node *, 16> Worklist;  in switchInternalEdgeToRef()  local
793   Worklist.swap(OldSCC.Nodes);  in switchInternalEdgeToRef()
794   for (Node *N : Worklist) {  in switchInternalEdgeToRef()
812   for (Node *RootN : Worklist) {  in switchInternalEdgeToRef()
1063     SmallVector<RefSCC *, 4> Worklist;  in insertIncomingRefEdge()  local
1064     Worklist.push_back(this);  in insertIncomingRefEdge()
1066       RefSCC &RC = *Worklist.pop_back_val();  in insertIncomingRefEdge()
1076               Worklist.push_back(&EdgeRC);  in insertIncomingRefEdge()
1078     } while (!Worklist.empty());  in insertIncomingRefEdge()
1221   SmallVector<Node *, 8> Worklist;  in removeInternalRefEdge()  local
1226     Worklist.append(C->Nodes.begin(), C->Nodes.end());  in removeInternalRefEdge()
1232   const int NumRefSCCNodes = Worklist.size();  in removeInternalRefEdge()
1242     Node *RootN = Worklist.pop_back_val();  in removeInternalRefEdge()
1346   } while (!Worklist.empty());  in removeInternalRefEdge()
1579   SmallVector<Constant *, 16> Worklist;  in getEdgeKind()  local
1594           Worklist.push_back(C);  in getEdgeKind()
1602   LazyCallGraph::visitReferences(Worklist, Visited, [&](Function &F) {  in getEdgeKind()