mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 19:12:56 +02:00
96 lines
2.9 KiB
C++
96 lines
2.9 KiB
C++
//===- CallGraph.cpp - Build a Module's call graph --------------------------=//
|
|
//
|
|
// This file implements call graph construction (from a module), and will
|
|
// eventually implement call graph serialization and deserialization for
|
|
// annotation support.
|
|
//
|
|
// This call graph represents a dynamic method invocation as a null method node.
|
|
// A call graph may only have up to one null method node that represents all of
|
|
// the dynamic method invocations.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Analysis/CallGraph.h"
|
|
#include "llvm/Analysis/Writer.h"
|
|
#include "llvm/Support/STLExtras.h"
|
|
#include "llvm/Module.h"
|
|
#include "llvm/Method.h"
|
|
#include "llvm/iOther.h"
|
|
#include "llvm/iTerminators.h"
|
|
#include <algorithm>
|
|
|
|
using namespace cfg;
|
|
|
|
// getNodeFor - Return the node for the specified method or create one if it
|
|
// does not already exist.
|
|
//
|
|
CallGraphNode *CallGraph::getNodeFor(Method *M) {
|
|
iterator I = MethodMap.find(M);
|
|
if (I != MethodMap.end()) return I->second;
|
|
|
|
assert(M->getParent() == Mod && "Method not in current module!");
|
|
CallGraphNode *New = new CallGraphNode(M);
|
|
|
|
MethodMap.insert(pair<const Method*, CallGraphNode*>(M, New));
|
|
return New;
|
|
}
|
|
|
|
// addToCallGraph - Add a method to the call graph, and link the node to all of
|
|
// the methods that it calls.
|
|
//
|
|
void CallGraph::addToCallGraph(Method *M) {
|
|
CallGraphNode *Node = getNodeFor(M);
|
|
|
|
for (Method::inst_iterator I = M->inst_begin(), E = M->inst_end();
|
|
I != E; ++I) {
|
|
// Dynamic calls will cause Null nodes to be created
|
|
if (CallInst *CI = dyn_cast<CallInst>(*I))
|
|
Node->addCalledMethod(getNodeFor(CI->getCalledMethod()));
|
|
else if (InvokeInst *II = dyn_cast<InvokeInst>(*I))
|
|
Node->addCalledMethod(getNodeFor(II->getCalledMethod()));
|
|
}
|
|
}
|
|
|
|
CallGraph::CallGraph(Module *TheModule) {
|
|
Mod = TheModule;
|
|
|
|
// Add every method to the call graph...
|
|
for_each(Mod->begin(), Mod->end(), bind_obj(this,&CallGraph::addToCallGraph));
|
|
}
|
|
|
|
|
|
void cfg::WriteToOutput(const CallGraphNode *CGN, ostream &o) {
|
|
o << "Call graph node for method: '" << CGN->getMethod()->getName() << "'\n";
|
|
for (unsigned i = 0; i < CGN->size(); ++i)
|
|
o << " Calls method '" << (*CGN)[i]->getMethod()->getName() << "'\n";
|
|
o << endl;
|
|
}
|
|
|
|
void cfg::WriteToOutput(const CallGraph &CG, ostream &o) {
|
|
for (CallGraph::const_iterator I = CG.begin(), E = CG.end(); I != E; ++I)
|
|
o << I->second;
|
|
}
|
|
|
|
|
|
|
|
//
|
|
// Checks if a method contains any call instructions.
|
|
// Note that this uses the call graph only if one is provided.
|
|
// It does not build the call graph.
|
|
//
|
|
bool IsLeafMethod(const Method* M, const cfg::CallGraph* CG) {
|
|
if (CG) {
|
|
const cfg::CallGraphNode *cgn = (*CG)[M];
|
|
return (cgn->begin() == cgn->end());
|
|
}
|
|
else {
|
|
for (Method::inst_const_iterator I = M->inst_begin(), E = M->inst_end();
|
|
I != E; ++I)
|
|
if ((*I)->getOpcode() == Instruction::Call)
|
|
return false;
|
|
return true;
|
|
}
|
|
}
|
|
|
|
|