44     DenseMap<Attribute, CallGraphNode *> &resolvedRefs,  in walkReferencedSymbolNodes()
45     function_ref<void(CallGraphNode *, Operation *)> callback) {  in walkReferencedSymbolNodes()  argument
52     CallGraphNode *&node = refIt.first->second;  in walkReferencedSymbolNodes()
84     DenseSet<CallGraphNode *> topLevelUses;
87     DenseMap<CallGraphNode *, int> innerUses;
94   void dropCallUses(CallGraphNode *userNode, Operation *callOp, CallGraph &cg);
97   void eraseNode(CallGraphNode *node);
100   bool isDead(CallGraphNode *node) const;
104   bool hasOneUseAndDiscardable(CallGraphNode *node) const;
107   void recomputeUses(CallGraphNode *node, CallGraph &cg);
111   void mergeUsesAfterInlining(CallGraphNode *lhs, CallGraphNode *rhs);
119   DenseMap<CallGraphNode *, int> discardableSymNodeUses;
123   DenseMap<CallGraphNode *, CGUser> nodeUses;
134   DenseMap<Attribute, CallGraphNode *> alwaysLiveNodes;  in CGUseList()
152                                 [](CallGraphNode *, Operation *) {});  in CGUseList()  argument
163   for (CallGraphNode *node : cg)  in CGUseList()
167 void CGUseList::dropCallUses(CallGraphNode *userNode, Operation *callOp,  in dropCallUses()
170   auto walkFn = [&](CallGraphNode *node, Operation *user) {  in dropCallUses()
177   DenseMap<Attribute, CallGraphNode *> resolvedRefs;  in dropCallUses()
181 void CGUseList::eraseNode(CallGraphNode *node) {  in eraseNode()
195 bool CGUseList::isDead(CallGraphNode *node) const {  in isDead()
206 bool CGUseList::hasOneUseAndDiscardable(CallGraphNode *node) const {  in hasOneUseAndDiscardable()
217 void CGUseList::recomputeUses(CallGraphNode *node, CallGraph &cg) {  in recomputeUses()
224   DenseMap<Attribute, CallGraphNode *> resolvedRefs;  in recomputeUses()
225   auto walkFn = [&](CallGraphNode *refNode, Operation *user) {  in recomputeUses()
239 void CGUseList::mergeUsesAfterInlining(CallGraphNode *lhs, CallGraphNode *rhs) {  in mergeUsesAfterInlining()
248   for (CallGraphNode *node : uses.topLevelUses)  in decrementDiscardableUses()
265   std::vector<CallGraphNode *>::iterator begin() { return nodes.begin(); }  in begin()
266   std::vector<CallGraphNode *>::iterator end() { return nodes.end(); }  in end()
269   void reset(const std::vector<CallGraphNode *> &newNodes) { nodes = newNodes; }  in reset()
272   void remove(CallGraphNode *node) {  in remove()
281   std::vector<CallGraphNode *> nodes;
310   ResolvedCall(CallOpInterface call, CallGraphNode *sourceNode,  in ResolvedCall()
311                CallGraphNode *targetNode)  in ResolvedCall()
314   CallGraphNode *sourceNode, *targetNode;
322                            CallGraphNode *sourceNode, CallGraph &cg,  in collectCallOps()
326   SmallVector<std::pair<Block *, CallGraphNode *>, 8> worklist;  in collectCallOps()
327   auto addToWorklist = [&](CallGraphNode *node,  in collectCallOps()
347         CallGraphNode *targetNode = cg.resolveCallable(call, symbolTable);  in collectCallOps()
357         CallGraphNode *nestedNode = cg.lookupNode(&nestedRegion);  in collectCallOps()
380     CallGraphNode *node, Optional<size_t> inlineHistoryID,  in inlineHistoryIncludes()
381     MutableArrayRef<std::pair<CallGraphNode *, Optional<size_t>>>  in inlineHistoryIncludes()  argument
405     CallGraphNode *node;  in processInlinedBlocks()
417   void markForDeletion(CallGraphNode *node) { deadNodes.insert(node); }  in markForDeletion()
422     for (CallGraphNode *node : deadNodes)  in eraseDeadCallables()
427   SmallPtrSet<CallGraphNode *, 8> deadNodes;
465   llvm::SmallSetVector<CallGraphNode *, 1> deadNodes;  in inlineCallsInSCC()
470   for (CallGraphNode *node : currentSCC) {  in inlineCallsInSCC()
487   SmallVector<std::pair<CallGraphNode *, InlineHistoryT>, 8> inlineHistory;  in inlineCallsInSCC()
572   for (CallGraphNode *node : deadNodes) {  in inlineCallsInSCC()
610   LogicalResult optimizeSCCAsync(MutableArrayRef<CallGraphNode *> nodesToVisit,
616   LogicalResult optimizeCallable(CallGraphNode *node,
709   SmallVector<CallGraphNode *, 4> nodesToVisit;  in optimizeSCC()
735   for (CallGraphNode *node : nodesToVisit)  in optimizeSCC()
741 InlinerPass::optimizeSCCAsync(MutableArrayRef<CallGraphNode *> nodesToVisit,  in optimizeSCCAsync()
758   for (CallGraphNode *node : nodesToVisit)  in optimizeSCCAsync()
764   return failableParallelForEach(ctx, nodesToVisit, [&](CallGraphNode *node) {  in optimizeSCCAsync()
784 InlinerPass::optimizeCallable(CallGraphNode *node,  in optimizeCallable()