38     DenseMap<Attribute, CallGraphNode *> &resolvedRefs,  in walkReferencedSymbolNodes()
39     function_ref<void(CallGraphNode *, Operation *)> callback) {  in walkReferencedSymbolNodes()  argument
46     CallGraphNode *&node = refIt.first->second;  in walkReferencedSymbolNodes()
78     DenseSet<CallGraphNode *> topLevelUses;
81     DenseMap<CallGraphNode *, int> innerUses;
88   void dropCallUses(CallGraphNode *userNode, Operation *callOp, CallGraph &cg);
91   void eraseNode(CallGraphNode *node);
94   bool isDead(CallGraphNode *node) const;
98   bool hasOneUseAndDiscardable(CallGraphNode *node) const;
101   void recomputeUses(CallGraphNode *node, CallGraph &cg);
105   void mergeUsesAfterInlining(CallGraphNode *lhs, CallGraphNode *rhs);
113   DenseMap<CallGraphNode *, int> discardableSymNodeUses;
117   DenseMap<CallGraphNode *, CGUser> nodeUses;
128   DenseMap<Attribute, CallGraphNode *> alwaysLiveNodes;  in CGUseList()
146                                 [](CallGraphNode *, Operation *) {});  in CGUseList()  argument
157   for (CallGraphNode *node : cg)  in CGUseList()
161 void CGUseList::dropCallUses(CallGraphNode *userNode, Operation *callOp,  in dropCallUses()
164   auto walkFn = [&](CallGraphNode *node, Operation *user) {  in dropCallUses()
171   DenseMap<Attribute, CallGraphNode *> resolvedRefs;  in dropCallUses()
175 void CGUseList::eraseNode(CallGraphNode *node) {  in eraseNode()
189 bool CGUseList::isDead(CallGraphNode *node) const {  in isDead()
200 bool CGUseList::hasOneUseAndDiscardable(CallGraphNode *node) const {  in hasOneUseAndDiscardable()
211 void CGUseList::recomputeUses(CallGraphNode *node, CallGraph &cg) {  in recomputeUses()
218   DenseMap<Attribute, CallGraphNode *> resolvedRefs;  in recomputeUses()
219   auto walkFn = [&](CallGraphNode *refNode, Operation *user) {  in recomputeUses()
233 void CGUseList::mergeUsesAfterInlining(CallGraphNode *lhs, CallGraphNode *rhs) {  in mergeUsesAfterInlining()
242   for (CallGraphNode *node : uses.topLevelUses)  in decrementDiscardableUses()
259   std::vector<CallGraphNode *>::iterator begin() { return nodes.begin(); }  in begin()
260   std::vector<CallGraphNode *>::iterator end() { return nodes.end(); }  in end()
263   void reset(const std::vector<CallGraphNode *> &newNodes) { nodes = newNodes; }  in reset()
266   void remove(CallGraphNode *node) {  in remove()
275   std::vector<CallGraphNode *> nodes;
302   ResolvedCall(CallOpInterface call, CallGraphNode *sourceNode,  in ResolvedCall()
303                CallGraphNode *targetNode)  in ResolvedCall()
306   CallGraphNode *sourceNode, *targetNode;
314                            CallGraphNode *sourceNode, CallGraph &cg,  in collectCallOps()
318   SmallVector<std::pair<Block *, CallGraphNode *>, 8> worklist;  in collectCallOps()
319   auto addToWorklist = [&](CallGraphNode *node,  in collectCallOps()
339         CallGraphNode *targetNode = cg.resolveCallable(call, symbolTable);  in collectCallOps()
349         CallGraphNode *nestedNode = cg.lookupNode(&nestedRegion);  in collectCallOps()
372     CallGraphNode *node;  in processInlinedBlocks()
384   void markForDeletion(CallGraphNode *node) { deadNodes.insert(node); }  in markForDeletion()
389     for (CallGraphNode *node : deadNodes)  in eraseDeadCallables()
394   SmallPtrSet<CallGraphNode *, 8> deadNodes;
432   SmallVector<CallGraphNode *, 1> deadNodes;  in inlineCallsInSCC()
437   for (CallGraphNode *node : currentSCC) {  in inlineCallsInSCC()
494   for (CallGraphNode *node : deadNodes) {  in inlineCallsInSCC()
508   SmallVector<CallGraphNode *, 4> nodesToCanonicalize;  in canonicalizeSCC()
555     for (CallGraphNode *node : nodesToCanonicalize)  in canonicalizeSCC()
560   for (CallGraphNode *node : nodesToCanonicalize)  in canonicalizeSCC()