aboutsummaryrefslogtreecommitdiffstats
path: root/include/llvm/Analysis/CallGraph.h
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2001-09-28 00:08:15 +0000
committerChris Lattner <sabre@nondot.org>2001-09-28 00:08:15 +0000
commit41fbf305ee3e2c3b8610459e8c09b60e61f4d34d (patch)
treeabc6a76e913f5c4b28c8a5bfd812154b77dfc6a6 /include/llvm/Analysis/CallGraph.h
parentc4199ecf6e960a2b482b436f412524946a25646f (diff)
downloadexternal_llvm-41fbf305ee3e2c3b8610459e8c09b60e61f4d34d.zip
external_llvm-41fbf305ee3e2c3b8610459e8c09b60e61f4d34d.tar.gz
external_llvm-41fbf305ee3e2c3b8610459e8c09b60e61f4d34d.tar.bz2
Initial support for construction of a call graph
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@660 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/Analysis/CallGraph.h')
-rw-r--r--include/llvm/Analysis/CallGraph.h88
1 files changed, 88 insertions, 0 deletions
diff --git a/include/llvm/Analysis/CallGraph.h b/include/llvm/Analysis/CallGraph.h
new file mode 100644
index 0000000..0683623
--- /dev/null
+++ b/include/llvm/Analysis/CallGraph.h
@@ -0,0 +1,88 @@
+//===- llvm/Analysis/CallGraph.h - Build a Module's call graph ---*- C++ -*--=//
+//
+// This interface is used to build and manipulate a call graph, which is a very
+// useful tool for interprocedural optimization.
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef LLVM_ANALYSIS_CALLGRAPH_H
+#define LLVM_ANALYSIS_CALLGRAPH_H
+
+#include <map>
+#include <vector>
+class Method;
+class Module;
+
+namespace cfg {
+
+class CallGraph;
+class CallGraphNode {
+ Method *Meth;
+ vector<CallGraphNode*> CalledMethods;
+
+ CallGraphNode(const CallGraphNode &); // Do not implement
+public:
+ typedef vector<CallGraphNode*>::iterator iterator;
+ typedef vector<CallGraphNode*>::const_iterator const_iterator;
+
+ // getMethod - Return the method that this call graph node represents...
+ Method *getMethod() const { return Meth; }
+
+ inline iterator begin() { return CalledMethods.begin(); }
+ inline iterator end() { return CalledMethods.end(); }
+ inline const_iterator begin() const { return CalledMethods.begin(); }
+ inline const_iterator end() const { return CalledMethods.end(); }
+ inline unsigned size() const { return CalledMethods.size(); }
+
+ inline CallGraphNode *operator[](unsigned i) const { return CalledMethods[i];}
+
+
+private: // Stuff to construct the node, used by CallGraph
+ friend class CallGraph;
+
+ // CallGraphNode ctor - Create a node for the specified method...
+ inline CallGraphNode(Method *M) : Meth(M) {}
+
+ // addCalledMethod add a method to the list of methods called by this one
+ void addCalledMethod(CallGraphNode *M) {
+ CalledMethods.push_back(M);
+ }
+};
+
+
+class CallGraph {
+ Module *Mod;
+ typedef map<const Method *, CallGraphNode *> MethodMapTy;
+ MethodMapTy MethodMap;
+public:
+ CallGraph(Module *TheModule);
+
+ typedef MethodMapTy::iterator iterator;
+ typedef MethodMapTy::const_iterator const_iterator;
+
+ inline const_iterator begin() const { return MethodMap.begin(); }
+ inline const_iterator end() const { return MethodMap.end(); }
+
+ inline const CallGraphNode *operator[](const Method *M) const {
+ const_iterator I = MethodMap.find(M);
+ assert(I != MethodMap.end() && "Method not in callgraph!");
+ return I->second;
+ }
+
+private: // Implementation of CallGraph construction
+
+ // getNodeFor - Return the node for the specified method or create one if it
+ // does not already exist.
+ //
+ CallGraphNode *getNodeFor(Method *M);
+
+ // addToCallGraph - Add a method to the call graph, and link the node to all
+ // of the methods that it calls.
+ //
+ void addToCallGraph(Method *M);
+};
+
+
+} // end namespace cfg
+
+#endif