Home
last modified time | relevance | path

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

123

/llvm-project-15.0.7/bolt/include/bolt/Passes/
H A DHFSort.h33 Cluster(CallGraph::NodeId Id, const CallGraph::Node &F);
34 Cluster(const std::vector<CallGraph::NodeId> &Nodes, const CallGraph &Cg);
44 const std::vector<CallGraph::NodeId> &Targets_);
47 const std::vector<CallGraph::NodeId> &targets() const { return Targets; } in targets()
48 CallGraph::NodeId target(size_t N) const { return Targets[N]; } in target()
62 std::vector<CallGraph::NodeId> Targets;
82 std::vector<Cluster> clusterize(const CallGraph &Cg);
87 std::vector<Cluster> hfsortPlus(CallGraph &Cg);
94 std::vector<Cluster> pettisAndHansen(const CallGraph &Cg);
97 std::vector<Cluster> randomClusters(const CallGraph &Cg);
H A DCallGraph.h29 class CallGraph {
68 friend class CallGraph;
92 friend class CallGraph;
163 template <class L> void CallGraph::printDot(char *FileName, L GetLabel) const { in printDot()
/llvm-project-15.0.7/clang/lib/Analysis/
H A DCallGraph.cpp47 CallGraph *G;
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()
203 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
218 void CallGraph::print(raw_ostream &OS) const { in print()
246 LLVM_DUMP_METHOD void CallGraph::dump() const { in dump()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DCallGraph.h72 class CallGraph {
90 explicit CallGraph(Module &M);
91 CallGraph(CallGraph &&Arg);
92 ~CallGraph();
281 friend class CallGraph;
283 CallGraph *CG;
311 using Result = CallGraph;
316 CallGraph run(Module &M, ModuleAnalysisManager &) { return CallGraph(M); } in run()
337 std::unique_ptr<CallGraph> G;
348 CallGraph &getCallGraph() { return *G; } in getCallGraph()
[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
93 CallGraph &CG);
115 void AnalyzeCallGraph(CallGraph &CG, Module &M);
121 void CollectSCCMembership(CallGraph &CG);
/llvm-project-15.0.7/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) {
278 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
282 static nodes_iterator nodes_end (clang::CallGraph *CG) {
289 template <> struct GraphTraits<const clang::CallGraph*> :
291 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
[all …]
/llvm-project-15.0.7/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()
118 void CallGraph::print(raw_ostream &OS) const { in print()
141 LLVM_DUMP_METHOD void CallGraph::dump() const { print(dbgs()); } in dump()
144 void CallGraph::ReplaceExternalCallEdge(CallGraphNode *Old, in ReplaceExternalCallEdge()
173 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction()
[all …]
H A DCallGraphSCCPass.cpp72 bool doInitialization(CallGraph &CG);
73 bool doFinalization(CallGraph &CG);
107 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
111 CallGraph &CG, bool &CallGraphUpToDate,
113 bool RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG,
122 CallGraph &CG, bool &CallGraphUpToDate, in RunPassOnSCC()
509 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnModule()
513 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()
557 bool CGPassManager::doInitialization(CallGraph &CG) { in doInitialization()
572 bool CGPassManager::doFinalization(CallGraph &CG) { in doFinalization()
[all …]
H A DCallPrinter.cpp58 CallGraph *CG;
65 CallGraphDOTInfo(Module *M, CallGraph *CG, in CallGraphDOTInfo()
88 CallGraph *getCallGraph() const { return CG; } in getCallGraph()
130 typedef mapped_iterator<CallGraph::const_iterator, decltype(&CGGetValuePtr)>
233 CallGraph CG(M); in doCallGraphDOTPrinting()
245 CallGraph CG(M); in viewCallGraph()
/llvm-project-15.0.7/bolt/lib/Passes/
H A DHFSort.cpp30 using NodeId = CallGraph::NodeId;
31 using Arc = CallGraph::Arc;
32 using Node = CallGraph::Node;
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()
173 if (BestPred == CallGraph::InvalidId || in clusterize()
186 assert(BestPred != CallGraph::InvalidId); in clusterize()
[all …]
H A DCallGraph.cpp67 int64_t CallGraph::Arc::Hash::operator()(const Arc &Arc) const { in operator ()()
76 CallGraph::NodeId CallGraph::addNode(uint32_t Size, uint64_t Samples) { in addNode()
82 const CallGraph::Arc &CallGraph::incArcWeight(NodeId Src, NodeId Dst, double W, in incArcWeight()
98 void CallGraph::normalizeArcWeights() { in normalizeArcWeights()
112 void CallGraph::adjustArcWeights() { in adjustArcWeights()
H A DBinaryFunctionCallGraph.cpp30 CallGraph::NodeId BinaryFunctionCallGraph::addNode(BinaryFunction *BF, in addNode()
33 NodeId Id = CallGraph::addNode(Size, Samples); in addNode()
101 const CallGraph::NodeId Id = Cg.maybeGetNodeId(Function); in buildCallGraph()
102 if (Id == CallGraph::InvalidId) { in buildCallGraph()
133 const CallGraph::NodeId SrcId = lookupNode(Function); in buildCallGraph()
150 const CallGraph::NodeId DstId = lookupNode(DstFunc); in buildCallGraph()
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-15.0.7/mlir/lib/Analysis/
H A DCallGraph.cpp70 static void computeCallGraph(Operation *op, CallGraph &cg, in computeCallGraph()
95 CallGraph::CallGraph(Operation *op) : externalNode(/*callableRegion=*/nullptr) { in CallGraph() function in CallGraph
107 CallGraphNode *CallGraph::getOrAddNode(Region *region, in getOrAddNode()
133 CallGraphNode *CallGraph::lookupNode(Region *region) const { in lookupNode()
141 CallGraph::resolveCallable(CallOpInterface call, in resolveCallable()
153 void CallGraph::eraseNode(CallGraphNode *node) { in eraseNode()
173 void CallGraph::dump() const { print(llvm::errs()); } in dump()
174 void CallGraph::print(raw_ostream &os) const { in print()
H A DCMakeLists.txt4 CallGraph.cpp
21 CallGraph.cpp
/llvm-project-15.0.7/mlir/include/mlir/Analysis/
H A DCallGraph.h147 friend class CallGraph; variable
154 class CallGraph {
176 CallGraph(Operation *op);
245 struct GraphTraits<const mlir::CallGraph *>
248 static NodeRef getEntryNode(const mlir::CallGraph *cg) {
253 using nodes_iterator = mlir::CallGraph::iterator;
254 static nodes_iterator nodes_begin(mlir::CallGraph *cg) { return cg->begin(); }
255 static nodes_iterator nodes_end(mlir::CallGraph *cg) { return cg->end(); }
/llvm-project-15.0.7/mlir/lib/Transforms/
H A DInliner.cpp43 Operation *op, CallGraph &cg, SymbolTableCollection &symbolTable, in walkReferencedSymbolNodes()
107 void recomputeUses(CallGraphNode *node, CallGraph &cg);
130 CGUseList::CGUseList(Operation *op, CallGraph &cg, in CGUseList()
168 CallGraph &cg) { in dropCallUses()
282 llvm::scc_iterator<const CallGraph *> &parentIterator;
289 const CallGraph &cg, in runTransformOnCGSCCs()
396 Inliner(MLIRContext *context, CallGraph &cg, in Inliner()
433 CallGraph &cg;
461 CallGraph &cg = inliner.cg; in inlineCallsInSCC()
605 LogicalResult optimizeSCC(CallGraph &cg, CGUseList &useList,
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DInliner.h23 class CallGraph; variable
40 bool doInitialization(CallGraph &CG) override;
50 bool doFinalization(CallGraph &CG) override;
63 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
H A DInternalize.h31 class CallGraph; variable
72 bool internalizeModule(Module &TheModule, CallGraph *CG = nullptr);
81 CallGraph *CG = nullptr) {
/llvm-project-15.0.7/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-15.0.7/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h23 class CallGraph; variable
43 CallGraph *CG = nullptr;
63 void initialize(CallGraph &CG, CallGraphSCC &SCC) { in initialize()
/llvm-project-15.0.7/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-15.0.7/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-15.0.7/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateKernelFeatures.cpp40 bool doInitialization(CallGraph &CG) override;
128 bool AMDGPUAnnotateKernelFeatures::doInitialization(CallGraph &CG) { in doInitialization()

123