1 //===- CallGraph.cpp - Build a Module's call graph ------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the CallGraph class and provides the BasicCallGraph
11 // default implementation.
13 //===----------------------------------------------------------------------===//
15 #include "llvm/Analysis/CallGraph.h"
16 #include "llvm/Module.h"
17 #include "llvm/Instructions.h"
18 #include "llvm/IntrinsicInst.h"
19 #include "llvm/Support/CallSite.h"
20 #include "llvm/Support/Debug.h"
21 #include "llvm/Support/raw_ostream.h"
26 //===----------------------------------------------------------------------===//
27 // BasicCallGraph class definition
29 class BasicCallGraph : public ModulePass, public CallGraph {
30 // Root is root of the call graph, or the external node if a 'main' function
35 // ExternalCallingNode - This node has edges to all external functions and
36 // those internal functions that have their address taken.
37 CallGraphNode *ExternalCallingNode;
39 // CallsExternalNode - This node has edges to it from all functions making
40 // indirect calls or calling an external function.
41 CallGraphNode *CallsExternalNode;
44 static char ID; // Class identification, replacement for typeinfo
45 BasicCallGraph() : ModulePass(ID), Root(0),
46 ExternalCallingNode(0), CallsExternalNode(0) {
47 initializeBasicCallGraphPass(*PassRegistry::getPassRegistry());
50 // runOnModule - Compute the call graph for the specified module.
51 virtual bool runOnModule(Module &M) {
52 CallGraph::initialize(M);
54 ExternalCallingNode = getOrInsertFunction(0);
55 CallsExternalNode = new CallGraphNode(0);
58 // Add every function to the call graph.
59 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
62 // If we didn't find a main function, use the external call graph node
63 if (Root == 0) Root = ExternalCallingNode;
68 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
72 virtual void print(raw_ostream &OS, const Module *) const {
73 OS << "CallGraph Root is: ";
74 if (Function *F = getRoot()->getFunction())
75 OS << F->getName() << "\n";
77 OS << "<<null function: 0x" << getRoot() << ">>\n";
80 CallGraph::print(OS, 0);
83 virtual void releaseMemory() {
87 /// getAdjustedAnalysisPointer - This method is used when a pass implements
88 /// an analysis interface through multiple inheritance. If needed, it should
89 /// override this to adjust the this pointer as needed for the specified pass
91 virtual void *getAdjustedAnalysisPointer(AnalysisID PI) {
92 if (PI == &CallGraph::ID)
93 return (CallGraph*)this;
97 CallGraphNode* getExternalCallingNode() const { return ExternalCallingNode; }
98 CallGraphNode* getCallsExternalNode() const { return CallsExternalNode; }
100 // getRoot - Return the root of the call graph, which is either main, or if
101 // main cannot be found, the external node.
103 CallGraphNode *getRoot() { return Root; }
104 const CallGraphNode *getRoot() const { return Root; }
107 //===---------------------------------------------------------------------
108 // Implementation of CallGraph construction
111 // addToCallGraph - Add a function to the call graph, and link the node to all
112 // of the functions that it calls.
114 void addToCallGraph(Function *F) {
115 CallGraphNode *Node = getOrInsertFunction(F);
117 // If this function has external linkage, anything could call it.
118 if (!F->hasLocalLinkage()) {
119 ExternalCallingNode->addCalledFunction(CallSite(), Node);
121 // Found the entry point?
122 if (F->getName() == "main") {
123 if (Root) // Found multiple external mains? Don't pick one.
124 Root = ExternalCallingNode;
126 Root = Node; // Found a main, keep track of it!
130 // Loop over all of the users of the function, looking for non-call uses.
131 for (Value::use_iterator I = F->use_begin(), E = F->use_end(); I != E; ++I){
133 if ((!isa<CallInst>(U) && !isa<InvokeInst>(U))
134 || !CallSite(cast<Instruction>(U)).isCallee(I)) {
135 // Not a call, or being used as a parameter rather than as the callee.
136 ExternalCallingNode->addCalledFunction(CallSite(), Node);
141 // If this function is not defined in this translation unit, it could call
143 if (F->isDeclaration() && !F->isIntrinsic())
144 Node->addCalledFunction(CallSite(), CallsExternalNode);
146 // Look for calls by this function.
147 for (Function::iterator BB = F->begin(), BBE = F->end(); BB != BBE; ++BB)
148 for (BasicBlock::iterator II = BB->begin(), IE = BB->end();
150 CallSite CS(cast<Value>(II));
151 if (CS && !isa<DbgInfoIntrinsic>(II)) {
152 const Function *Callee = CS.getCalledFunction();
154 Node->addCalledFunction(CS, getOrInsertFunction(Callee));
156 Node->addCalledFunction(CS, CallsExternalNode);
162 // destroy - Release memory for the call graph
163 virtual void destroy() {
164 /// CallsExternalNode is not in the function map, delete it explicitly.
165 if (CallsExternalNode) {
166 CallsExternalNode->allReferencesDropped();
167 delete CallsExternalNode;
168 CallsExternalNode = 0;
170 CallGraph::destroy();
174 } //End anonymous namespace
176 INITIALIZE_ANALYSIS_GROUP(CallGraph, "Call Graph", BasicCallGraph)
177 INITIALIZE_AG_PASS(BasicCallGraph, CallGraph, "basiccg",
178 "Basic CallGraph Construction", false, true, true)
180 char CallGraph::ID = 0;
181 char BasicCallGraph::ID = 0;
183 void CallGraph::initialize(Module &M) {
187 void CallGraph::destroy() {
188 if (FunctionMap.empty()) return;
190 // Reset all node's use counts to zero before deleting them to prevent an
191 // assertion from firing.
193 for (FunctionMapTy::iterator I = FunctionMap.begin(), E = FunctionMap.end();
195 I->second->allReferencesDropped();
198 for (FunctionMapTy::iterator I = FunctionMap.begin(), E = FunctionMap.end();
204 void CallGraph::print(raw_ostream &OS, Module*) const {
205 for (CallGraph::const_iterator I = begin(), E = end(); I != E; ++I)
206 I->second->print(OS);
208 void CallGraph::dump() const {
212 //===----------------------------------------------------------------------===//
213 // Implementations of public modification methods
216 // removeFunctionFromModule - Unlink the function from this module, returning
217 // it. Because this removes the function from the module, the call graph node
218 // is destroyed. This is only valid if the function does not call any other
219 // functions (ie, there are no edges in it's CGN). The easiest way to do this
220 // is to dropAllReferences before calling this.
222 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) {
223 assert(CGN->empty() && "Cannot remove function from call "
224 "graph if it references other functions!");
225 Function *F = CGN->getFunction(); // Get the function for the call graph node
226 delete CGN; // Delete the call graph node for this func
227 FunctionMap.erase(F); // Remove the call graph node from the map
229 Mod->getFunctionList().remove(F);
233 // getOrInsertFunction - This method is identical to calling operator[], but
234 // it will insert a new CallGraphNode for the specified function if one does
235 // not already exist.
236 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) {
237 CallGraphNode *&CGN = FunctionMap[F];
240 assert((!F || F->getParent() == Mod) && "Function not in current module!");
241 return CGN = new CallGraphNode(const_cast<Function*>(F));
244 void CallGraphNode::print(raw_ostream &OS) const {
245 if (Function *F = getFunction())
246 OS << "Call graph node for function: '" << F->getName() << "'";
248 OS << "Call graph node <<null function>>";
250 OS << "<<" << this << ">> #uses=" << getNumReferences() << '\n';
252 for (const_iterator I = begin(), E = end(); I != E; ++I) {
253 OS << " CS<" << I->first << "> calls ";
254 if (Function *FI = I->second->getFunction())
255 OS << "function '" << FI->getName() <<"'\n";
257 OS << "external node\n";
262 void CallGraphNode::dump() const { print(dbgs()); }
264 /// removeCallEdgeFor - This method removes the edge in the node for the
265 /// specified call site. Note that this method takes linear time, so it
266 /// should be used sparingly.
267 void CallGraphNode::removeCallEdgeFor(CallSite CS) {
268 for (CalledFunctionsVector::iterator I = CalledFunctions.begin(); ; ++I) {
269 assert(I != CalledFunctions.end() && "Cannot find callsite to remove!");
270 if (I->first == CS.getInstruction()) {
271 I->second->DropRef();
272 *I = CalledFunctions.back();
273 CalledFunctions.pop_back();
280 // removeAnyCallEdgeTo - This method removes any call edges from this node to
281 // the specified callee function. This takes more time to execute than
282 // removeCallEdgeTo, so it should not be used unless necessary.
283 void CallGraphNode::removeAnyCallEdgeTo(CallGraphNode *Callee) {
284 for (unsigned i = 0, e = CalledFunctions.size(); i != e; ++i)
285 if (CalledFunctions[i].second == Callee) {
287 CalledFunctions[i] = CalledFunctions.back();
288 CalledFunctions.pop_back();
293 /// removeOneAbstractEdgeTo - Remove one edge associated with a null callsite
294 /// from this node to the specified callee function.
295 void CallGraphNode::removeOneAbstractEdgeTo(CallGraphNode *Callee) {
296 for (CalledFunctionsVector::iterator I = CalledFunctions.begin(); ; ++I) {
297 assert(I != CalledFunctions.end() && "Cannot find callee to remove!");
299 if (CR.second == Callee && CR.first == 0) {
301 *I = CalledFunctions.back();
302 CalledFunctions.pop_back();
308 /// replaceCallEdge - This method replaces the edge in the node for the
309 /// specified call site with a new one. Note that this method takes linear
310 /// time, so it should be used sparingly.
311 void CallGraphNode::replaceCallEdge(CallSite CS,
312 CallSite NewCS, CallGraphNode *NewNode){
313 for (CalledFunctionsVector::iterator I = CalledFunctions.begin(); ; ++I) {
314 assert(I != CalledFunctions.end() && "Cannot find callsite to remove!");
315 if (I->first == CS.getInstruction()) {
316 I->second->DropRef();
317 I->first = NewCS.getInstruction();
325 // Enuse that users of CallGraph.h also link with this file
326 DEFINING_FILE_FOR(CallGraph)