Home
last modified time | relevance | path

Searched refs:CallGraph (Results 1 – 24 of 24) sorted by relevance

/freebsd-src/contrib/llvm-project/clang/lib/Analysis/
H A DCallGraph.cpp47 CallGraph *G;
51 CGBuilder(CallGraph *g, CallGraphNode *N) : G(g), CallerNode(N) {} in CGBuilder()
140 void CallGraph::addNodesForBlocks(DeclContext *D) { in addNodesForBlocks()
149 CallGraph::CallGraph() { in CallGraph() function in CallGraph
153 CallGraph::~CallGraph() = default;
155 bool CallGraph::includeInGraph(const Decl *D) { in includeInGraph()
163 bool CallGraph::includeCalleeInGraph(const Decl *D) { in includeCalleeInGraph()
178 void CallGraph::addNodeForDecl(Decl* D, bool IsGlobal) { in addNodeForDecl()
197 CallGraphNode *CallGraph::getNode(const Decl *F) const { in getNode()
203 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCallGraph.h72 class CallGraph {
90 explicit CallGraph(Module &M);
91 CallGraph(CallGraph &&Arg);
92 ~CallGraph();
184 inline CallGraphNode(CallGraph *CG, Function *F) : CG(CG), F(F) {} in CallGraphNode()
279 friend class CallGraph;
281 CallGraph *CG;
309 using Result = CallGraph;
314 CallGraph run(Module &M, ModuleAnalysisManager &) { return CallGraph(M); } in run()
350 std::unique_ptr<CallGraph> G;
[all …]
H A DCallGraphSCCPass.h29 class CallGraph; variable
48 virtual bool doInitialization(CallGraph &CG) { in doInitialization()
63 virtual bool doFinalization(CallGraph &CG) { in doFinalization()
88 const CallGraph &CG; // The call graph for this SCC.
93 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {} in CallGraphSCC()
115 const CallGraph &getCallGraph() { return CG; } in getCallGraph()
H A DGlobalsModRef.h23 class CallGraph; variable
91 CallGraph &CG);
113 void AnalyzeCallGraph(CallGraph &CG, Module &M);
119 void CollectSCCMembership(CallGraph &CG);
/freebsd-src/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h42 class CallGraph : public RecursiveASTVisitor<CallGraph> {
55 CallGraph();
56 ~CallGraph();
263 template <> struct GraphTraits<clang::CallGraph*>
265 static NodeType *getEntryNode(clang::CallGraph *CGN) {
270 CGGetValue(clang::CallGraph::const_iterator::value_type &P) {
276 mapped_iterator<clang::CallGraph::iterator, decltype(&CGGetValue)>;
278 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
282 static nodes_iterator nodes_end (clang::CallGraph *CG) {
286 static unsigned size(clang::CallGraph *CG) { return CG->size(); }
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/
H A DCallGraph.cpp1 //===- CallGraph.cpp - Build a Module's call graph ------------------------===//
9 #include "llvm/Analysis/CallGraph.h"
29 // Implementations of the CallGraph class methods.
32 CallGraph::CallGraph(Module &M) in CallGraph() function in CallGraph
41 CallGraph::CallGraph(CallGraph &&Arg) in CallGraph() function in CallGraph
54 CallGraph::~CallGraph() { in ~CallGraph()
[all...]
H A DCallGraphSCCPass.cpp22 #include "llvm/Analysis/CallGraph.h"
73 bool doInitialization(CallGraph &CG);
74 bool doFinalization(CallGraph &CG);
78 // CGPassManager walks SCC and it needs CallGraph. in getAnalysisUsage()
83 StringRef getPassName() const override { return "CallGraph Pass Manager"; } in getPassName()
108 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
112 CallGraph &CG, bool &CallGraphUpToDate,
114 bool RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG,
123 CallGraph &CG, bool &CallGraphUpToDate, in RunPassOnSCC()
205 bool CGPassManager::RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph
[all...]
H A DCallPrinter.cpp20 #include "llvm/Analysis/CallGraph.h"
52 cl::desc("The prefix used for the CallGraph dot file names."));
59 CallGraph *CG;
66 CallGraphDOTInfo(Module *M, CallGraph *CG, in CallGraphDOTInfo()
89 CallGraph *getCallGraph() const { return CG; }
131 typedef mapped_iterator<CallGraph::const_iterator, decltype(&CGGetValuePtr)>
234 CallGraph CG(M); in doCallGraphDOTPrinting()
246 CallGraph CG(M); in viewCallGraph()
H A DGlobalsModRef.cpp20 #include "llvm/Analysis/CallGraph.h"
476 void GlobalsAAResult::CollectSCCMembership(CallGraph &CG) { in CollectSCCMembership()
480 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in CollectSCCMembership()
495 void GlobalsAAResult::AnalyzeCallGraph(CallGraph &CG, Module &M) { in AnalyzeCallGraph()
498 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
979 CallGraph &CG) { in analyzeModule()
H A DSyntheticCountsUtils.cpp99 template class llvm::SyntheticCountsUtils<const CallGraph *>;
H A DMLInlineAdvisor.cpp18 #include "llvm/Analysis/CallGraph.h"
157 CallGraph CGraph(M); in MLInlineAdvisor()
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h11 /// if it is a "old style" CallGraph or an "new style" LazyCallGraph.
23 class CallGraph; variable
26 /// Wrapper to unify "old style" CallGraph and "new style" LazyCallGraph. This
/freebsd-src/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateKernelFeatures.cpp40 bool doInitialization(CallGraph &CG) override;
128 bool AMDGPUAnnotateKernelFeatures::doInitialization(CallGraph &CG) { in doInitialization()
H A DAMDGPULowerModuleLDSPass.cpp188 #include "llvm/Analysis/CallGraph.h"
926 CallGraph CG = CallGraph(M); in lowerKernelScopeStructVariables()
H A DAMDGPUResourceUsageAnalysis.cpp31 #include "llvm/Analysis/CallGraph.h"
108 CallGraph CG = CallGraph(M); in runOnModule()
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroInternal.h20 class CallGraph;
261 Value *emitAlloc(IRBuilder<> &Builder, Value *Size, CallGraph *CG) const;
266 void emitDealloc(IRBuilder<> &Builder, Value *Ptr, CallGraph *CG) const;
19 class CallGraph; global() variable
H A DCoroutines.cpp17 #include "llvm/Analysis/CallGraph.h"
451 static void addCallToCallGraph(CallGraph *CG, CallInst *Call, Function *Callee){ in emitAlloc()
457 CallGraph *CG) const { in emitAlloc()
480 CallGraph *CG) const { in emitDealloc()
H A DCoroSplit.cpp31 #include "llvm/Analysis/CallGraph.h"
251 CallGraph *CG) { in replaceFallthroughCoroEnd()
307 bool InResume, CallGraph *CG) { in replaceFallthroughCoroEnd()
440 CallGraph *CG) { in createResumeEntryBlock()
477 Value *FramePtr, bool InResume, CallGraph *CG) { in createResumeEntryBlock()
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSyntheticCountsPropagation.cpp121 CallGraph CG(M); in run()
123 SyntheticCountsUtils<const CallGraph *>::propagate( in run()
/freebsd-src/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DDebugCheckers.cpp215 CallGraph CG; in checkASTDecl()
239 CallGraph CG; in checkASTDecl()
/freebsd-src/contrib/llvm-project/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp21 #include "clang/Analysis/CallGraph.h"
440 // Note: CallGraph can trigger deserialization of more items from a pch in HandleDeclsCallGraph()
443 CallGraph CG; in HandleDeclsCallGraph()
456 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG); in HandleDeclsCallGraph()
471 // The CallGraph might have declarations as callees. However, during CTU in HandleDeclsCallGraph()
491 // Decls from CallGraph are already canonical. But Decls coming from in HandleDeclsCallGraph()
/freebsd-src/contrib/llvm-project/clang/include/clang/AST/
H A DCommentCommands.td299 def CallGraph : PropertyCommand<"callgraph">;
/freebsd-src/lib/clang/libclang/
H A DMakefile167 SRCS_FUL+= Analysis/CallGraph.cpp
/freebsd-src/lib/clang/libllvm/
H A DMakefile65 SRCS_MIN+= Analysis/CallGraph.cpp