24     SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited,  in findCallees()  argument
27   while (!Worklist.empty()) {  in findCallees()
28     Constant *C = Worklist.pop_back_val();  in findCallees()
52         Worklist.push_back(cast<Constant>(Op));  in findCallees()
61   SmallVector<Constant *, 16> Worklist;  in Node()  local
70             Worklist.push_back(C);  in Node()
75   findCallees(Worklist, Visited, Callees, CalleeIndexMap);  in Node()
112   SmallVector<Constant *, 16> Worklist;  in LazyCallGraph()  local
117         Worklist.push_back(GV.getInitializer());  in LazyCallGraph()
121   findCallees(Worklist, Visited, EntryNodes, EntryIndexMap);  in LazyCallGraph()
470   SmallVector<Node *, 1> Worklist;  in removeIntraSCCEdge()  local
471   Worklist.swap(Nodes);  in removeIntraSCCEdge()
472   for (Node *N : Worklist) {  in removeIntraSCCEdge()
478   assert(Worklist.size() > 1 && "We have to have at least two nodes to have an "  in removeIntraSCCEdge()
493     Node *N = Worklist.pop_back_val();  in removeIntraSCCEdge()
499   } while (!Worklist.empty());  in removeIntraSCCEdge()
552     SmallVector<Node *, 16> Worklist;  in updateGraphPtrs()  local
555         Worklist.push_back(EntryN);  in updateGraphPtrs()
557     while (!Worklist.empty()) {  in updateGraphPtrs()
558       Node *N = Worklist.pop_back_val();  in updateGraphPtrs()
563             Worklist.push_back(CalleeN);  in updateGraphPtrs()
569     SmallVector<SCC *, 16> Worklist(LeafSCCs.begin(), LeafSCCs.end());  in updateGraphPtrs()  local
571     while (!Worklist.empty()) {  in updateGraphPtrs()
572       SCC *C = Worklist.pop_back_val();  in updateGraphPtrs()
574       Worklist.insert(Worklist.end(), C->ParentSCCs.begin(),  in updateGraphPtrs()