Home
last modified time | relevance | path

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

123

/llvm-project/clang/lib/Analysis/
H A DCallGraph.cpp1 //===- CallGraph.cpp - AST-based Call graph -------------------------------===//
9 // This file defines the AST-based CallGraph.
13 #include "clang/Analysis/CallGraph.h"
37 #define DEBUG_TYPE "CallGraph"
47 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
156 CallGraph in includeInGraph()
[all...]
/llvm-project/llvm/include/llvm/Analysis/
H A DCallGraph.h1 //===- CallGraph.h - Build a Module's call graph ----------------*- C++ -*-===//
39 /// Because of these properties, the CallGraph captures a conservative superset
71 class CallGraph {
89 explicit CallGraph(Module &M);
90 CallGraph(CallGraph &&Arg);
91 ~CallGraph();
183 inline CallGraphNode(CallGraph *CG, Function *F) : CG(CG), F(F) {}
205 /// Returns the number of other CallGraphNodes in this CallGraph that
278 friend class CallGraph;
[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);
/llvm-project/bolt/include/bolt/Passes/
H A DHFSort.h32 Cluster(CallGraph::NodeId Id, const CallGraph::Node &F);
33 Cluster(const std::vector<CallGraph::NodeId> &Nodes, const CallGraph &Cg);
43 const std::vector<CallGraph::NodeId> &Targets_);
46 const std::vector<CallGraph::NodeId> &targets() const { return Targets; } in targets()
47 CallGraph::NodeId target(size_t N) const { return Targets[N]; } in target()
61 std::vector<CallGraph::NodeId> Targets;
81 std::vector<Cluster> clusterize(const CallGraph &Cg);
88 std::vector<Cluster> pettisAndHansen(const CallGraph &Cg);
91 std::vector<Cluster> randomClusters(const CallGraph &Cg);
/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h1 //===- CallGraph.h - AST-based Call graph -----------------------*- C++ -*-===//
9 // This file declares the AST-based CallGraph.
43 class CallGraph : public DynamicRecursiveASTVisitor {
56 CallGraph();
57 ~CallGraph();
260 template <> struct GraphTraits<clang::CallGraph*>
262 static NodeType *getEntryNode(clang::CallGraph *CGN) {
267 CGGetValue(clang::CallGraph::const_iterator::value_type &P) {
273 mapped_iterator<clang::CallGraph::iterator, decltype(&CGGetValue)>;
275 static nodes_iterator nodes_begin(clang::CallGraph *C
[all...]
/llvm-project/llvm/lib/Analysis/
H A DCallGraph.cpp32 CallGraph::CallGraph(Module &M) in CallGraph() function in CallGraph
41 CallGraph::CallGraph(CallGraph &&Arg) in CallGraph() function in CallGraph
54 CallGraph::~CallGraph() { in ~CallGraph()
67 bool CallGraph::invalidate(Module &, const PreservedAnalyses &PA, in invalidate()
75 void CallGraph::addToCallGraph(Function *F) { in addToCallGraph()
89 void CallGraph::populateCallGraphNode(CallGraphNode *Node) { in populateCallGraphNode()
115 void CallGraph::print(raw_ostream &OS) const { in print()
138 LLVM_DUMP_METHOD void CallGraph::dump() const { print(dbgs()); } in dump()
141 void CallGraph::ReplaceExternalCallEdge(CallGraphNode *Old, in ReplaceExternalCallEdge()
157 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule()
[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.cpp59 CallGraph *CG;
66 CallGraphDOTInfo(Module *M, CallGraph *CG, in CallGraphDOTInfo()
89 CallGraph *getCallGraph() const { return CG; } in getCallGraph()
131 typedef mapped_iterator<CallGraph::const_iterator, decltype(&CGGetValuePtr)>
234 CallGraph CG(M); in doCallGraphDOTPrinting()
246 CallGraph CG(M); in viewCallGraph()
/llvm-project/bolt/lib/Passes/
H A DHFSort.cpp30 using NodeId = CallGraph::NodeId;
31 using Arc = CallGraph::Arc;
32 using Node = CallGraph::Node;
59 Cluster::Cluster(const std::vector<NodeId> &Nodes, const CallGraph &Cg) { in Cluster()
87 void freezeClusters(const CallGraph &Cg, std::vector<Cluster> &Clusters) { in freezeClusters()
115 const std::vector<CallGraph::NodeId> &Targets_) { in merge()
131 std::vector<Cluster> clusterize(const CallGraph &Cg) { in clusterize()
154 const CallGraph::Node &Func1 = Cg.getNode(F1); in clusterize()
155 const CallGraph::Node &Func2 = Cg.getNode(F2); in clusterize()
168 NodeId BestPred = CallGraph::InvalidId; in clusterize()
[all …]
H A DPettisAndHansen.cpp25 using NodeId = CallGraph::NodeId;
26 using Arc = CallGraph::Arc;
27 using Node = CallGraph::Node;
54 void orderFuncs(const CallGraph &Cg, Cluster *C1, Cluster *C2) { in orderFuncs()
97 std::vector<Cluster> pettisAndHansen(const CallGraph &Cg) { in pettisAndHansen()
/llvm-project/mlir/lib/Analysis/
H A DCallGraph.cpp1 //===- CallGraph.cpp - CallGraph analysis for MLIR ------------------------===//
13 #include "mlir/Analysis/CallGraph.h"
69 // CallGraph
74 static void computeCallGraph(Operation *op, CallGraph &cg, in computeCallGraph()
99 CallGraph::CallGraph(Operation *op) in CallGraph() function in CallGraph
113 CallGraphNode *CallGraph::getOrAddNode(Region *region, in getOrAddNode()
139 CallGraphNode *CallGraph::lookupNode(Region *region) const { in lookupNode()
147 CallGraph
[all...]
H A DCMakeLists.txt3 CallGraph.cpp
25 CallGraph.cpp
/llvm-project/bolt/lib/Core/
H A DCallGraph.cpp63 int64_t CallGraph::Arc::Hash::operator()(const Arc &Arc) const { in operator ()()
72 CallGraph::NodeId CallGraph::addNode(uint32_t Size, uint64_t Samples) { in addNode()
78 const CallGraph::Arc &CallGraph::incArcWeight(NodeId Src, NodeId Dst, double W, in incArcWeight()
94 void CallGraph::normalizeArcWeights() { in normalizeArcWeights()
108 void CallGraph::adjustArcWeights() { in adjustArcWeights()
H A DBinaryFunctionCallGraph.cpp39 CallGraph::NodeId BinaryFunctionCallGraph::addNode(BinaryFunction *BF, in addNode()
42 NodeId Id = CallGraph::addNode(Size, Samples); in addNode()
112 const CallGraph::NodeId Id = Cg.maybeGetNodeId(Function); in buildCallGraph()
113 if (Id == CallGraph::InvalidId) { in buildCallGraph()
144 const CallGraph::NodeId SrcId = lookupNode(Function); in buildCallGraph()
171 const CallGraph::NodeId DstId = lookupNode(DstFunc); in buildCallGraph()
292 Cg.printDot(opts::DumpCGDot, [&](CallGraph::NodeId Id) { in buildCallGraph()
/llvm-project/mlir/include/mlir/Analysis/
H A DCallGraph.h147 friend class CallGraph; variable
154 class CallGraph {
176 CallGraph(Operation *op);
253 struct GraphTraits<const mlir::CallGraph *>
256 static NodeRef getEntryNode(const mlir::CallGraph *cg) {
261 using nodes_iterator = mlir::CallGraph::iterator;
262 static nodes_iterator nodes_begin(mlir::CallGraph *cg) { return cg->begin(); }
263 static nodes_iterator nodes_end(mlir::CallGraph *cg) { return cg->end(); }
/llvm-project/mlir/lib/Transforms/Utils/
H A DInliner.cpp11 // of the CallGraph. This enables a more incremental propagation of inlining
40 Operation *op, CallGraph &cg, SymbolTableCollection &symbolTable, in walkReferencedSymbolNodes()
87 CGUseList(Operation *op, CallGraph &cg, SymbolTableCollection &symbolTable);
91 void dropCallUses(CallGraphNode *userNode, Operation *callOp, CallGraph &cg);
104 void recomputeUses(CallGraphNode *node, CallGraph &cg);
127 CGUseList::CGUseList(Operation *op, CallGraph &cg, in CGUseList()
165 CallGraph &cg) { in dropCallUses()
214 void CGUseList::recomputeUses(CallGraphNode *node, CallGraph &cg) { in recomputeUses()
252 // CallGraph traversal
259 CallGraphSCC(llvm::scc_iterator<const CallGraph *>
[all...]
/llvm-project/llvm/lib/Target/AMDGPU/Utils/
H A DAMDGPUMemoryUtils.h
/llvm-project/llvm/unittests/Analysis/
H A DCallGraphTest.cpp48 CallGraph CG(M); in TEST()
56 CallGraph CG(M); in TEST()
58 canSpecializeGraphTraitsIterators(const_cast<const CallGraph *>(&CG)); in TEST()
/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
/llvm-project/bolt/include/bolt/Core/
H A DCallGraph.h29 class CallGraph {
68 friend class CallGraph;
92 friend class CallGraph;
164 void CallGraph::printDot(StringRef FileName, L GetLabel) const { in printDot()
/llvm-project/llvm/test/Transforms/Reassociate/
H A Derase_inst_made_change.ll7 ; made, so CallGraphSCCPass assumed that the old CallGraph,
12 ; count in the CallGraph).
/llvm-project/llvm/test/Transforms/InstCombine/
H A Dearly_dce_clobbers_callgraph.ll7 ; made, so CallGraphSCCPass assumed that the old CallGraph,
12 ; count in the CallGraph).
/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateKernelFeatures.cpp17 #include "llvm/Analysis/CallGraph.h"
38 bool doInitialization(CallGraph &CG) override; in AMDGPUAnnotateKernelFeatures()
126 bool AMDGPUAnnotateKernelFeatures::doInitialization(CallGraph &CG) { in runOnSCC()
/llvm-project/mlir/include/mlir/Transforms/
H A DInliner.h93 Inliner(Operation *op, CallGraph &cg, Pass &pass, AnalysisManager am, in Inliner()
109 CallGraph &cg;

123