| /freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | CallGraph.h | 62 class CallGraphNode; variable
76 std::map<const Function *, std::unique_ptr<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) {
127 CallGraphNode *getExternalCallingNode() const { return ExternalCallingNode; } in getExternalCallingNode()
129 CallGraphNode *getCallsExternalNode() const { in getCallsExternalNode()
135 void ReplaceExternalCallEdge(CallGraphNode *Old, CallGraphNode *New);
148 Function *removeFunctionFromModule(CallGraphNode *CGN);
[all …]
|
| H A D | CallGraphSCCPass.h | 30 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-src/contrib/llvm-project/clang/include/clang/Analysis/ |
| H A D | CallGraph.h | 32 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-src/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CallGraph.cpp | 34 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 *CG
[all...] |
| H A D | CallGraphSCCPass.cpp | 175 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 *CalleeNod in RefreshCallGraph()
[all...] |
| H A D | CallPrinter.cpp | 98 CallGraphNode *Node = I.second.get(); in removeParallelEdges()
118 : public GraphTraits<const CallGraphNode *> { in getEntryNode()
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 *Nod in getEdgeAttributes()
[all...] |
| H A D | GlobalsModRef.cpp | 481 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 D | MLInlineAdvisor.cpp | 159 const std::vector<CallGraphNode *> &CGNodes = *I; in MLInlineAdvisor()
|
| /freebsd-src/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | CallGraph.cpp | 48 CallGraphNode *CallerNode;
51 CGBuilder(CallGraph *g, CallGraphNode *N) : G(g), CallerNode(N) {} in CGBuilder()
71 CallGraphNode *CalleeNode = G->getOrInsertNode(D); in addCalledDecl()
182 CallGraphNode *Node = getOrInsertNode(D); in addNodeForDecl()
197 CallGraphNode *CallGraph::getNode(const Decl *F) const { in getNode()
203 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
207 std::unique_ptr<CallGraphNode> &Node = FunctionMap[F]; in getOrInsertNode()
211 Node = std::make_unique<CallGraphNode>(F); in getOrInsertNode()
226 const CallGraphNode *N = *I; in print()
235 for (CallGraphNode::const_iterator CI = N->begin(), in print()
[all …]
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | CallGraphUpdater.cpp | |
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | SyntheticCountsPropagation.cpp | 102 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 D | FunctionAttrs.cpp | 1951 for (CallGraphNode *I : SCC) { in addNoRecurseAttrsTopDown()
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUAnnotateKernelFeatures.cpp | 115 for (CallGraphNode *I : SCC) { in runOnSCC()
|
| H A D | AMDGPULowerModuleLDSPass.cpp | |
| H A D | AMDGPUPerfHintAnalysis.cpp | 401 for (CallGraphNode *I : SCC) { in runOnSCC()
|