1 //===- CallGraph.cpp - Build a Module's call graph ------------------------===//
3 // This interface is used to build and manipulate a call graph, which is a very
4 // useful tool for interprocedural optimization.
6 // Every function in a module is represented as a node in the call graph. The
7 // callgraph node keeps track of which functions the are called by the function
8 // corresponding to the node.
10 // A call graph will contain nodes where the function that they correspond to is
11 // null. This 'external' node is used to represent control flow that is not
12 // represented (or analyzable) in the module. As such, the external node will
13 // have edges to functions with the following properties:
14 // 1. All functions in the module without internal linkage, since they could
15 // be called by functions outside of the our analysis capability.
16 // 2. All functions whose address is used for something more than a direct
17 // call, for example being stored into a memory location. Since they may
18 // be called by an unknown caller later, they must be tracked as such.
20 // Similarly, functions have a call edge to the external node iff:
21 // 1. The function is external, reflecting the fact that they could call
22 // anything without internal linkage or that has its address taken.
23 // 2. The function contains an indirect function call.
25 // As an extension in the future, there may be multiple nodes with a null
26 // function. These will be used when we can prove (through pointer analysis)
27 // that an indirect call site can call only a specific set of functions.
29 // Because of these properties, the CallGraph captures a conservative superset
30 // of all of the caller-callee relationships, which is useful for
33 // The CallGraph class also attempts to figure out what the root of the
34 // CallGraph is, which is currently does by looking for a function named 'main'.
35 // If no function named 'main' is found, the external node is used as the entry
36 // node, reflecting the fact that any function without internal linkage could
37 // be called into (which is common for libraries).
39 //===----------------------------------------------------------------------===//
41 #include "llvm/Analysis/CallGraph.h"
42 #include "llvm/Module.h"
43 #include "llvm/Function.h"
44 #include "llvm/BasicBlock.h"
45 #include "llvm/iOther.h"
46 #include "llvm/iTerminators.h"
47 #include "Support/STLExtras.h"
51 AnalysisID CallGraph::ID(AnalysisID::create<CallGraph>());
53 // getNodeFor - Return the node for the specified function or create one if it
54 // does not already exist.
56 CallGraphNode *CallGraph::getNodeFor(Function *F) {
57 CallGraphNode *&CGN = FunctionMap[F];
60 assert((!F || F->getParent() == Mod) && "Function not in current module!");
61 return CGN = new CallGraphNode(F);
64 // addToCallGraph - Add a function to the call graph, and link the node to all
65 // of the functions that it calls.
67 void CallGraph::addToCallGraph(Function *M) {
68 CallGraphNode *Node = getNodeFor(M);
70 // If this function has external linkage,
71 if (!M->hasInternalLinkage()) {
72 ExternalNode->addCalledFunction(Node);
74 // Found the entry point?
75 if (M->getName() == "main") {
77 Root = ExternalNode; // Found multiple external mains? Don't pick one.
79 Root = Node; // Found a main, keep track of it!
81 } else if (M->isExternal()) { // Not defined in this xlation unit?
82 Node->addCalledFunction(ExternalNode); // It could call anything...
85 // Loop over all of the users of the function... looking for callers...
87 for (Value::use_iterator I = M->use_begin(), E = M->use_end(); I != E; ++I) {
89 if (CallInst *CI = dyn_cast<CallInst>(U))
90 getNodeFor(CI->getParent()->getParent())->addCalledFunction(Node);
91 else if (InvokeInst *II = dyn_cast<InvokeInst>(U))
92 getNodeFor(II->getParent()->getParent())->addCalledFunction(Node);
93 else // Can't classify the user!
94 ExternalNode->addCalledFunction(Node);
97 // Look for an indirect function call...
98 for (Function::iterator BB = M->begin(), BBE = M->end(); BB != BBE; ++BB)
99 for (BasicBlock::iterator II = BB->begin(), IE = BB->end(); II != IE; ++II){
100 Instruction &I = *II;
102 if (CallInst *CI = dyn_cast<CallInst>(&I)) {
103 if (CI->getCalledFunction() == 0)
104 Node->addCalledFunction(ExternalNode);
105 } else if (InvokeInst *II = dyn_cast<InvokeInst>(&I)) {
106 if (II->getCalledFunction() == 0)
107 Node->addCalledFunction(ExternalNode);
112 bool CallGraph::run(Module &M) {
116 ExternalNode = getNodeFor(0);
119 // Add every function to the call graph...
120 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
123 // If we didn't find a main function, use the external call graph node
124 if (Root == 0) Root = ExternalNode;
129 void CallGraph::destroy() {
130 for (FunctionMapTy::iterator I = FunctionMap.begin(), E = FunctionMap.end();
137 void WriteToOutput(const CallGraphNode *CGN, std::ostream &o) {
138 if (CGN->getFunction())
139 o << "Call graph node for function: '"
140 << CGN->getFunction()->getName() <<"'\n";
142 o << "Call graph node null function:\n";
144 for (unsigned i = 0; i < CGN->size(); ++i)
145 if ((*CGN)[i]->getFunction())
146 o << " Calls function '" << (*CGN)[i]->getFunction()->getName() << "'\n";
148 o << " Calls external node\n";
152 void WriteToOutput(const CallGraph &CG, std::ostream &o) {
153 o << "CallGraph Root is:\n" << CG.getRoot();
155 for (CallGraph::const_iterator I = CG.begin(), E = CG.end(); I != E; ++I)
160 //===----------------------------------------------------------------------===//
161 // Implementations of public modification methods
164 // Functions to keep a call graph up to date with a function that has been
167 void CallGraph::addFunctionToModule(Function *Meth) {
168 assert(0 && "not implemented");
172 // removeFunctionFromModule - Unlink the function from this module, returning
173 // it. Because this removes the function from the module, the call graph node
174 // is destroyed. This is only valid if the function does not call any other
175 // functions (ie, there are no edges in it's CGN). The easiest way to do this
176 // is to dropAllReferences before calling this.
178 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) {
179 assert(CGN->CalledFunctions.empty() && "Cannot remove function from call "
180 "graph if it references other functions!");
181 Function *M = CGN->getFunction(); // Get the function for the call graph node
182 delete CGN; // Delete the call graph node for this func
183 FunctionMap.erase(M); // Remove the call graph node from the map
185 Mod->getFunctionList().remove(M);