Home
last modified time | relevance | path

Searched refs:CallGraphNode (Results 1 – 13 of 13) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCallGraph.h62 class CallGraphNode; variable
76 std::map<const Function *, std::unique_ptr<CallGraphNode>>;
78 /// A map from \c Function* to \c CallGraphNode*.
83 CallGraphNode *ExternalCallingNode;
87 std::unique_ptr<CallGraphNode> CallsExternalNode;
112 inline const CallGraphNode *operator[](const Function *F) const {
119 inline CallGraphNode *operator[](const Function *F) {
125 /// Returns the \c CallGraphNode which is used to represent
127 CallGraphNode *getExternalCallingNode() const { return ExternalCallingNode; } in getExternalCallingNode()
129 CallGraphNode *getCallsExternalNod
184 inline CallGraphNode(CallGraph *CG, Function *F) : CG(CG), F(F) {} CallGraphNode() function
[all...]
H A DCallGraphSCCPass.h30 class CallGraphNode; variable
90 std::vector<CallGraphNode *> Nodes;
95 void initialize(ArrayRef<CallGraphNode *> NewNodes) { in initialize()
104 void ReplaceNode(CallGraphNode *Old, CallGraphNode *New);
108 void DeleteNode(CallGraphNode *Old);
110 using iterator = std::vector<CallGraphNode *>::const_iterator;
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h32 class CallGraphNode; variable
43 friend class CallGraphNode; variable
46 llvm::DenseMap<const Decl *, std::unique_ptr<CallGraphNode>>;
52 CallGraphNode *Root;
75 CallGraphNode *getNode(const Decl *) const;
79 CallGraphNode *getOrInsertNode(Decl *);
96 CallGraphNode *getRoot() const { return Root; } in getRoot()
101 using nodes_iterator = llvm::SetVector<CallGraphNode *>::iterator;
102 using const_nodes_iterator = llvm::SetVector<CallGraphNode *>::const_iterator;
147 class CallGraphNode {
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCallGraph.cpp34 CallsExternalNode(std::make_unique<CallGraphNode>(this, nullptr)) { in CallGraph()
76 CallGraphNode *Node = getOrInsertFunction(F); in addToCallGraph()
89 void CallGraph::populateCallGraphNode(CallGraphNode *Node) { in populateCallGraphNode()
119 SmallVector<CallGraphNode *, 16> Nodes; in print()
125 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) { in print()
133 for (CallGraphNode *CN : Nodes) in print()
141 void CallGraph::ReplaceExternalCallEdge(CallGraphNode *Old, in ReplaceExternalCallEdge()
142 CallGraphNode *New) { in ReplaceExternalCallEdge()
157 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule()
170 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction()
[all …]
H A DCallGraphSCCPass.cpp175 for (CallGraphNode *CGN : CurSCC) { in RunPassOnSCC()
207 DenseMap<Value *, CallGraphNode *> Calls; in RefreshCallGraph()
211 for (CallGraphNode *CGN in RefreshCallGraph()
221 CallGraphNode *CGN = *SCCIdx; in RefreshCallGraph()
232 CallGraphNode::iterator CGNEnd = CGN->end(); in RefreshCallGraph()
234 auto RemoveAndCheckForDone = [&](CallGraphNode::iterator I) { in RefreshCallGraph()
251 for (CallGraphNode::iterator I = CGN->begin(); I != CGNEnd;) { in RefreshCallGraph()
321 DenseMap<Value *, CallGraphNode *>::iterator ExistingIt = in RefreshCallGraph()
324 CallGraphNode *ExistingNode = ExistingIt->second; in RefreshCallGraph()
347 CallGraphNode *CalleeNode; in RefreshCallGraph()
[all …]
H A DCallPrinter.cpp98 CallGraphNode *Node = I.second.get(); in removeParallelEdges()
118 : public GraphTraits<const CallGraphNode *> {
124 typedef std::pair<const Function *const, std::unique_ptr<CallGraphNode>>
126 static const CallGraphNode *CGGetValuePtr(const PairTy &P) { in CGGetValuePtr()
152 static bool isNodeHidden(const CallGraphNode *Node, in isNodeHidden()
159 std::string getNodeLabel(const CallGraphNode *Node, in getNodeLabel()
170 static const CallGraphNode *CGGetValuePtr(CallGraphNode::CallRecord P) { in CGGetValuePtr()
175 typedef mapped_iterator<CallGraphNode::const_iterator,
179 std::string getEdgeAttributes(const CallGraphNode *Node, nodes_iterator I, in getEdgeAttributes()
200 std::string getNodeAttributes(const CallGraphNode *Node, in getNodeAttributes()
H A DGlobalsModRef.cpp481 const std::vector<CallGraphNode *> &SCC = *I; in CollectSCCMembership()
499 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph()
560 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
569 CallGraphNode *CalleeNode = CG[Callee]; in AnalyzeCallGraph()
H A DMLInlineAdvisor.cpp159 const std::vector<CallGraphNode *> &CGNodes = *I; in MLInlineAdvisor()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSyntheticCountsPropagation.cpp102 auto GetCallSiteProfCount = [&](const CallGraphNode *, in run()
103 const CallGraphNode::CallRecord &Edge) { in run()
124 &CG, GetCallSiteProfCount, [&](const CallGraphNode *N, Scaled64 New) { in run() argument
H A DFunctionAttrs.cpp1951 for (CallGraphNode *I : SCC) { in runImpl()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/Utils/
H A DAMDGPUMemoryUtils.cpp139 for (const CallGraphNode::CallRecord &R : *CG[F]) { in getTransitiveUsesOfLDS()
176 for (const CallGraphNode::CallRecord &R : *CG[F]) { in getTransitiveUsesOfLDS()
196 for (const CallGraphNode::CallRecord &R : *CG[&Func]) { in getTransitiveUsesOfLDS()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateKernelFeatures.cpp115 for (CallGraphNode *I : SCC) { in runOnSCC()
H A DAMDGPUPerfHintAnalysis.cpp401 for (CallGraphNode *I : SCC) { in runOnSCC()