Home
last modified time | relevance | path

Searched refs:CGN (Results 1 – 6 of 6) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCallGraphSCCPass.cpp175 for (CallGraphNode *CGN : CurSCC) { in RunPassOnSCC()
176 if (Function *F = CGN->getFunction()) { in RunPassOnSCC()
211 for (CallGraphNode *CGN in RefreshCallGraph()
212 : CurSCC) CGN->dump();); in RefreshCallGraph()
221 CallGraphNode *CGN = *SCCIdx; in RefreshCallGraph() local
222 Function *F = CGN->getFunction(); in RefreshCallGraph()
232 CallGraphNode::iterator CGNEnd = CGN->end(); in RefreshCallGraph()
238 CGN->removeCallEdge(I); in RefreshCallGraph()
246 CGNEnd = CGN->end(); in RefreshCallGraph()
251 for (CallGraphNode::iterator I = CGN->begin(); I != CGNEnd;) { in RefreshCallGraph()
[all …]
H A DCallGraph.cpp157 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule() argument
158 assert(CGN->empty() && "Cannot remove function from call " in removeFunctionFromModule()
160 Function *F = CGN->getFunction(); // Get the function for the call graph node in removeFunctionFromModule()
171 auto &CGN = FunctionMap[F]; in getOrInsertFunction() local
172 if (CGN) in getOrInsertFunction()
173 return CGN.get(); in getOrInsertFunction()
176 CGN = std::make_unique<CallGraphNode>(this, const_cast<Function *>(F)); in getOrInsertFunction()
177 return CGN.get(); in getOrInsertFunction()
293 for (auto *CGN : OldCBs) in replaceCallEdge() local
294 removeOneAbstractEdgeTo(CGN); in replaceCallEdge()
[all …]
H A DGlobalsModRef.cpp484 for (auto *CGN : SCC) in CollectSCCMembership() local
485 if (Function *F = CGN->getFunction()) in CollectSCCMembership()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCallGraph.h146 /// functions (ie, there are no edges in it's CGN). The easiest way to do
148 Function *removeFunctionFromModule(CallGraphNode *CGN);
154 /// Populate \p CGN based on the calls inside the associated function.
155 void populateCallGraphNode(CallGraphNode *CGN);
401 /// functions (ie, there are no edges in it's CGN). The easiest way to do in removeFunctionFromModule()
403 Function *removeFunctionFromModule(CallGraphNode *CGN) {
404 return G->removeFunctionFromModule(CGN);
436 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
456 static NodeRef getEntryNode(const CallGraphNode *CGN) { retur
399 removeFunctionFromModule(CallGraphNode * CGN) removeFunctionFromModule() argument
[all...]
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h248 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
258 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
265 static NodeType *getEntryNode(clang::CallGraph *CGN) {
266 return CGN->getRoot(); // Start at the external node!
291 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
292 return CGN->getRoot();
/freebsd/contrib/llvm-project/llvm/lib/Transforms/HipStdPar/
H A DHipStdPar.cpp197 for (auto &&CGN : CGA) { in run()
198 if (!isAcceleratorExecutionRoot(CGN.first)) in run()
201 Reachable.insert(CGN.first); in run()
203 SmallVector<const Function *> Tmp({CGN.first}); in run()