Home
last modified time | relevance | path

Searched refs:CallGraphNode (Results 1 – 15 of 15) 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>>;
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()
144 LLVM_ABI Function *removeFunctionFromModule(CallGraphNode *CGN);
148 LLVM_ABI CallGraphNode *getOrInsertFunction(const Function *F);
[all …]
H A DCallGraphSCCPass.h31 class CallGraphNode; variable
86 std::vector<CallGraphNode *> Nodes;
91 void initialize(ArrayRef<CallGraphNode *> NewNodes) { in initialize()
100 LLVM_ABI void ReplaceNode(CallGraphNode *Old, CallGraphNode *New);
104 LLVM_ABI void DeleteNode(CallGraphNode *Old);
106 using iterator = std::vector<CallGraphNode *>::const_iterator;
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h33 class CallGraphNode; variable
44 friend class CallGraphNode; variable
47 llvm::DenseMap<const Decl *, std::unique_ptr<CallGraphNode>>;
53 CallGraphNode *Root;
76 CallGraphNode *getNode(const Decl *) const;
80 CallGraphNode *getOrInsertNode(Decl *);
97 CallGraphNode *getRoot() const { return Root; } in getRoot()
102 using nodes_iterator = llvm::SetVector<CallGraphNode *>::iterator;
103 using const_nodes_iterator = llvm::SetVector<CallGraphNode *>::const_iterator;
144 class CallGraphNode {
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCallGraph.cpp33 CallsExternalNode(std::make_unique<CallGraphNode>(this, nullptr)) { in CallGraph()
74 CallGraphNode *Node = getOrInsertFunction(F); in addToCallGraph()
87 void CallGraph::populateCallGraphNode(CallGraphNode *Node) { in populateCallGraphNode()
117 SmallVector<CallGraphNode *, 16> Nodes; in print()
123 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) { in print()
131 for (CallGraphNode *CN : Nodes) in print()
145 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule()
158 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction()
164 CGN = std::make_unique<CallGraphNode>(this, const_cast<Function *>(F)); in getOrInsertFunction()
172 void CallGraphNode::print(raw_ostream &OS) const { in print()
[all …]
H A DCallGraphSCCPass.cpp174 for (CallGraphNode *CGN : CurSCC) { in RunPassOnSCC()
206 DenseMap<Value *, CallGraphNode *> Calls; in RefreshCallGraph()
210 for (CallGraphNode *CGN in RefreshCallGraph()
220 CallGraphNode *CGN = *SCCIdx; in RefreshCallGraph()
231 CallGraphNode::iterator CGNEnd = CGN->end(); in RefreshCallGraph()
233 auto RemoveAndCheckForDone = [&](CallGraphNode::iterator I) { in RefreshCallGraph()
250 for (CallGraphNode::iterator I = CGN->begin(); I != CGNEnd;) { in RefreshCallGraph()
320 DenseMap<Value *, CallGraphNode *>::iterator ExistingIt = in RefreshCallGraph()
323 CallGraphNode *ExistingNode = ExistingIt->second; in RefreshCallGraph()
346 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.cpp160 const std::vector<CallGraphNode *> &CGNodes = *I; in MLInlineAdvisor()
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DCallGraph.cpp47 CallGraphNode *CallerNode;
50 CGBuilder(CallGraph *g, CallGraphNode *N) : G(g), CallerNode(N) {} in CGBuilder()
70 CallGraphNode *CalleeNode = G->getOrInsertNode(D); in addCalledDecl()
184 CallGraphNode *Node = getOrInsertNode(D); in addNodeForDecl()
199 CallGraphNode *CallGraph::getNode(const Decl *F) const { in getNode()
205 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
209 std::unique_ptr<CallGraphNode> &Node = FunctionMap[F]; in getOrInsertNode()
213 Node = std::make_unique<CallGraphNode>(F); in getOrInsertNode()
226 for (const CallGraphNode *N : RPOT) { in print()
234 for (CallGraphNode::const_iterator CI = N->begin(), in print()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUMemoryUtils.cpp158 for (const CallGraphNode::CallRecord &R : *CG[F]) { in getTransitiveUsesOfLDS()
195 for (const CallGraphNode::CallRecord &R : *CG[F]) { in getTransitiveUsesOfLDS()
222 for (const CallGraphNode::CallRecord &R : *CG[&Func]) { in getTransitiveUsesOfLDS()
238 for (const CallGraphNode::CallRecord &CallRecord : *CG[F]) { in getTransitiveUsesOfLDS()
H A DAMDGPUPerfHintAnalysis.cpp427 for (CallGraphNode *I : SCC) { in runOnSCC()
H A DAMDGPUSwLowerLDS.cpp266 const CallGraphNode *CGN = CG[Func]; in getNonKernelsWithLDSArguments()
270 CallGraphNode *CallerCGN = I.second; in getNonKernelsWithLDSArguments()
/freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/
H A DDXILShaderFlags.cpp284 const std::vector<CallGraphNode *> &CurSCC = *SCCI; in initialize()
291 for (CallGraphNode *CGN : CurSCC) { in initialize()
/freebsd/contrib/llvm-project/llvm/include/llvm/Testing/Demangle/
H A DDemangleTestCases.inc19089 …CallGraphNode*>, std::allocator<std::pair<llvm::WeakVH, llvm::CallGraphNode*>>>::_M_assign_aux<__g…
19090 …CallGraphNode*>* std::vector<std::pair<llvm::WeakVH, llvm::CallGraphNode*>, std::allocator<std::pa…
19266 {"_ZNK4llvm13CallGraphNode5printERNS_11raw_ostreamE", "llvm::CallGraphNode::print(llvm::raw_ostream…
19268 …omModuleEPNS_13CallGraphNodeE", "llvm::CallGraph::removeFunctionFromModule(llvm::CallGraphNode*)"},
19271 {"_ZNK4llvm13CallGraphNode4dumpEv", "llvm::CallGraphNode::dump() const"},
19272 {"_ZN4llvm13CallGraphNode17removeCallEdgeForENS_8CallSiteE", "llvm::CallGraphNode::removeCallEdgeFo…
19273 …CallGraphNode19removeAnyCallEdgeToEPS0_", "llvm::CallGraphNode::removeAnyCallEdgeTo(llvm::CallGrap…
19274 …aphNode23removeOneAbstractEdgeToEPS0_", "llvm::CallGraphNode::removeOneAbstractEdgeTo(llvm::CallGr…
19275 …EdgeENS_8CallSiteES1_PS0_", "llvm::CallGraphNode::replaceCallEdge(llvm::CallSite, llvm::CallSite, …
19296 {"_ZN4llvm13CallGraphNodeD1Ev", "llvm::CallGraphNode::~CallGraphNode()"},
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp2378 for (CallGraphNode *I : SCC) { in runImpl()