2002-10-01 22:33:50 +00:00
|
|
|
//===- Local.cpp - Compute a local data structure graph for a function ----===//
|
2003-10-20 19:43:21 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-07-10 22:38:08 +00:00
|
|
|
//
|
|
|
|
// Compute the local version of the data structure graph for a function. The
|
|
|
|
// external interface to this file is the DSGraph constructor.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-07-18 15:54:42 +00:00
|
|
|
#include "llvm/Analysis/DataStructure.h"
|
2002-11-09 19:25:10 +00:00
|
|
|
#include "llvm/Analysis/DSGraph.h"
|
2002-07-10 22:38:08 +00:00
|
|
|
#include "llvm/Constants.h"
|
|
|
|
#include "llvm/DerivedTypes.h"
|
2003-09-20 16:34:13 +00:00
|
|
|
#include "llvm/Instructions.h"
|
2004-02-13 16:09:54 +00:00
|
|
|
#include "llvm/Intrinsics.h"
|
2003-11-25 20:19:55 +00:00
|
|
|
#include "llvm/Support/GetElementPtrTypeIterator.h"
|
2002-07-10 22:38:08 +00:00
|
|
|
#include "llvm/Support/InstVisitor.h"
|
2002-10-01 22:33:50 +00:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2003-02-05 21:59:58 +00:00
|
|
|
#include "Support/CommandLine.h"
|
2003-08-01 22:15:03 +00:00
|
|
|
#include "Support/Debug.h"
|
|
|
|
#include "Support/Timer.h"
|
2002-10-01 22:33:50 +00:00
|
|
|
|
|
|
|
// FIXME: This should eventually be a FunctionPass that is automatically
|
|
|
|
// aggregated into a Pass.
|
|
|
|
//
|
|
|
|
#include "llvm/Module.h"
|
|
|
|
|
2003-11-12 23:11:14 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2002-07-27 01:12:15 +00:00
|
|
|
static RegisterAnalysis<LocalDataStructures>
|
|
|
|
X("datastructure", "Local Data Structure Analysis");
|
|
|
|
|
2003-11-13 03:10:49 +00:00
|
|
|
static cl::opt<bool>
|
|
|
|
TrackIntegersAsPointers("dsa-track-integers",
|
|
|
|
cl::desc("If this is set, track integers as potential pointers"));
|
|
|
|
|
|
|
|
|
2003-11-12 23:11:14 +00:00
|
|
|
namespace llvm {
|
2002-11-07 05:20:53 +00:00
|
|
|
namespace DS {
|
2002-10-01 22:33:50 +00:00
|
|
|
// isPointerType - Return true if this type is big enough to hold a pointer.
|
|
|
|
bool isPointerType(const Type *Ty) {
|
|
|
|
if (isa<PointerType>(Ty))
|
|
|
|
return true;
|
2003-11-13 03:10:49 +00:00
|
|
|
else if (TrackIntegersAsPointers && Ty->isPrimitiveType() &&Ty->isInteger())
|
2002-10-01 22:33:50 +00:00
|
|
|
return Ty->getPrimitiveSize() >= PointerSize;
|
|
|
|
return false;
|
|
|
|
}
|
2003-11-12 23:11:14 +00:00
|
|
|
}}
|
2002-10-01 22:33:50 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
using namespace DS;
|
2002-07-10 22:38:08 +00:00
|
|
|
|
|
|
|
namespace {
|
2003-02-05 21:59:58 +00:00
|
|
|
cl::opt<bool>
|
|
|
|
DisableDirectCallOpt("disable-direct-call-dsopt", cl::Hidden,
|
|
|
|
cl::desc("Disable direct call optimization in "
|
|
|
|
"DSGraph construction"));
|
2003-02-08 20:18:39 +00:00
|
|
|
cl::opt<bool>
|
|
|
|
DisableFieldSensitivity("disable-ds-field-sensitivity", cl::Hidden,
|
|
|
|
cl::desc("Disable field sensitivity in DSGraphs"));
|
2003-02-05 21:59:58 +00:00
|
|
|
|
2002-10-01 22:33:50 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// GraphBuilder Class
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
/// This class is the builder class that constructs the local data structure
|
|
|
|
/// graph by performing a single pass over the function in question.
|
|
|
|
///
|
2002-07-10 22:38:08 +00:00
|
|
|
class GraphBuilder : InstVisitor<GraphBuilder> {
|
|
|
|
DSGraph &G;
|
2003-09-20 21:48:16 +00:00
|
|
|
DSNodeHandle *RetNode; // Node that gets returned...
|
2004-01-28 09:15:42 +00:00
|
|
|
DSScalarMap &ScalarMap;
|
2003-09-20 21:48:16 +00:00
|
|
|
std::vector<DSCallSite> *FunctionCalls;
|
2002-07-10 22:38:08 +00:00
|
|
|
|
|
|
|
public:
|
2003-07-02 06:06:34 +00:00
|
|
|
GraphBuilder(Function &f, DSGraph &g, DSNodeHandle &retNode,
|
2003-09-20 21:48:16 +00:00
|
|
|
std::vector<DSCallSite> &fc)
|
|
|
|
: G(g), RetNode(&retNode), ScalarMap(G.getScalarMap()),
|
|
|
|
FunctionCalls(&fc) {
|
2002-07-18 00:12:30 +00:00
|
|
|
|
|
|
|
// Create scalar nodes for all pointer arguments...
|
2003-09-20 21:48:16 +00:00
|
|
|
for (Function::aiterator I = f.abegin(), E = f.aend(); I != E; ++I)
|
2002-10-01 22:33:50 +00:00
|
|
|
if (isPointerType(I->getType()))
|
|
|
|
getValueDest(*I);
|
2002-07-18 00:12:30 +00:00
|
|
|
|
2003-09-20 21:48:16 +00:00
|
|
|
visit(f); // Single pass over the function
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
|
|
|
|
2003-09-20 21:48:16 +00:00
|
|
|
// GraphBuilder ctor for working on the globals graph
|
|
|
|
GraphBuilder(DSGraph &g)
|
|
|
|
: G(g), RetNode(0), ScalarMap(G.getScalarMap()), FunctionCalls(0) {
|
|
|
|
}
|
|
|
|
|
|
|
|
void mergeInGlobalInitializer(GlobalVariable *GV);
|
|
|
|
|
2002-07-10 22:38:08 +00:00
|
|
|
private:
|
|
|
|
// Visitor functions, used to handle each instruction type we encounter...
|
|
|
|
friend class InstVisitor<GraphBuilder>;
|
2003-06-19 21:15:11 +00:00
|
|
|
void visitMallocInst(MallocInst &MI) { handleAlloc(MI, true); }
|
|
|
|
void visitAllocaInst(AllocaInst &AI) { handleAlloc(AI, false); }
|
|
|
|
void handleAlloc(AllocationInst &AI, bool isHeap);
|
2002-07-10 22:38:08 +00:00
|
|
|
|
|
|
|
void visitPHINode(PHINode &PN);
|
|
|
|
|
2002-11-08 05:00:44 +00:00
|
|
|
void visitGetElementPtrInst(User &GEP);
|
2002-07-10 22:38:08 +00:00
|
|
|
void visitReturnInst(ReturnInst &RI);
|
|
|
|
void visitLoadInst(LoadInst &LI);
|
|
|
|
void visitStoreInst(StoreInst &SI);
|
|
|
|
void visitCallInst(CallInst &CI);
|
2003-09-20 16:34:13 +00:00
|
|
|
void visitInvokeInst(InvokeInst &II);
|
2002-07-10 22:38:08 +00:00
|
|
|
void visitSetCondInst(SetCondInst &SCI) {} // SetEQ & friends are ignored
|
2002-12-06 21:17:10 +00:00
|
|
|
void visitFreeInst(FreeInst &FI);
|
2002-10-01 22:33:50 +00:00
|
|
|
void visitCastInst(CastInst &CI);
|
2003-02-04 00:59:50 +00:00
|
|
|
void visitInstruction(Instruction &I);
|
2002-07-10 22:38:08 +00:00
|
|
|
|
2003-09-20 16:34:13 +00:00
|
|
|
void visitCallSite(CallSite CS);
|
2003-09-20 21:48:16 +00:00
|
|
|
|
|
|
|
void MergeConstantInitIntoNode(DSNodeHandle &NH, Constant *C);
|
2002-07-10 22:38:08 +00:00
|
|
|
private:
|
|
|
|
// Helper functions used to implement the visitation functions...
|
|
|
|
|
2002-10-01 22:33:50 +00:00
|
|
|
/// createNode - Create a new DSNode, ensuring that it is properly added to
|
|
|
|
/// the graph.
|
|
|
|
///
|
2003-06-19 21:15:11 +00:00
|
|
|
DSNode *createNode(const Type *Ty = 0) {
|
|
|
|
DSNode *N = new DSNode(Ty, &G); // Create the node
|
2003-06-16 12:08:18 +00:00
|
|
|
if (DisableFieldSensitivity) {
|
2003-02-08 20:18:39 +00:00
|
|
|
N->foldNodeCompletely();
|
2003-06-16 12:08:18 +00:00
|
|
|
if (DSNode *FN = N->getForwardNode())
|
|
|
|
N = FN;
|
|
|
|
}
|
2002-11-02 00:13:20 +00:00
|
|
|
return N;
|
|
|
|
}
|
2002-10-01 22:33:50 +00:00
|
|
|
|
2002-11-03 21:27:48 +00:00
|
|
|
/// setDestTo - Set the ScalarMap entry for the specified value to point to
|
2002-11-02 00:13:20 +00:00
|
|
|
/// the specified destination. If the Value already points to a node, make
|
|
|
|
/// sure to merge the two destinations together.
|
2002-10-01 22:33:50 +00:00
|
|
|
///
|
2002-11-02 00:13:20 +00:00
|
|
|
void setDestTo(Value &V, const DSNodeHandle &NH);
|
2002-10-01 22:33:50 +00:00
|
|
|
|
2002-11-02 00:13:20 +00:00
|
|
|
/// getValueDest - Return the DSNode that the actual value points to.
|
2002-10-01 22:33:50 +00:00
|
|
|
///
|
2002-11-02 00:13:20 +00:00
|
|
|
DSNodeHandle getValueDest(Value &V);
|
2002-10-01 22:33:50 +00:00
|
|
|
|
|
|
|
/// getLink - This method is used to return the specified link in the
|
|
|
|
/// specified node if one exists. If a link does not already exist (it's
|
2002-10-31 06:52:26 +00:00
|
|
|
/// null), then we create a new node, link it, then return it.
|
2002-10-01 22:33:50 +00:00
|
|
|
///
|
2002-10-31 06:52:26 +00:00
|
|
|
DSNodeHandle &getLink(const DSNodeHandle &Node, unsigned Link = 0);
|
2002-07-10 22:38:08 +00:00
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
using namespace DS;
|
|
|
|
|
2002-07-10 22:38:08 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// DSGraph constructor - Simply use the GraphBuilder to construct the local
|
|
|
|
// graph.
|
2003-11-02 22:27:28 +00:00
|
|
|
DSGraph::DSGraph(const TargetData &td, Function &F, DSGraph *GG)
|
|
|
|
: GlobalsGraph(GG), TD(td) {
|
2002-11-10 06:53:38 +00:00
|
|
|
PrintAuxCalls = false;
|
2003-07-02 04:37:26 +00:00
|
|
|
|
|
|
|
DEBUG(std::cerr << " [Loc] Calculating graph for: " << F.getName() << "\n");
|
|
|
|
|
2002-10-01 22:33:50 +00:00
|
|
|
// Use the graph builder to construct the local version of the graph
|
2003-09-20 21:48:16 +00:00
|
|
|
GraphBuilder B(F, *this, ReturnNodes[&F], FunctionCalls);
|
2002-11-18 21:44:19 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
Timer::addPeakMemoryMeasurement();
|
|
|
|
#endif
|
2003-02-14 04:55:58 +00:00
|
|
|
|
|
|
|
// Remove all integral constants from the scalarmap!
|
2004-01-28 09:15:42 +00:00
|
|
|
for (DSScalarMap::iterator I = ScalarMap.begin(); I != ScalarMap.end();)
|
2004-01-27 21:51:19 +00:00
|
|
|
if (isa<ConstantIntegral>(I->first))
|
|
|
|
ScalarMap.erase(I++);
|
|
|
|
else
|
2003-02-14 04:55:58 +00:00
|
|
|
++I;
|
|
|
|
|
2003-01-23 22:05:33 +00:00
|
|
|
markIncompleteNodes(DSGraph::MarkFormalArgs);
|
2002-11-09 20:55:24 +00:00
|
|
|
|
|
|
|
// Remove any nodes made dead due to merging...
|
2003-01-23 22:05:33 +00:00
|
|
|
removeDeadNodes(DSGraph::KeepUnreachableGlobals);
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Helper method implementations...
|
|
|
|
//
|
|
|
|
|
2002-11-02 00:13:20 +00:00
|
|
|
/// getValueDest - Return the DSNode that the actual value points to.
|
|
|
|
///
|
2002-11-08 05:00:44 +00:00
|
|
|
DSNodeHandle GraphBuilder::getValueDest(Value &Val) {
|
|
|
|
Value *V = &Val;
|
|
|
|
if (V == Constant::getNullValue(V->getType()))
|
|
|
|
return 0; // Null doesn't point to anything, don't add to ScalarMap!
|
2002-07-10 22:38:08 +00:00
|
|
|
|
2002-12-06 21:17:10 +00:00
|
|
|
DSNodeHandle &NH = ScalarMap[V];
|
|
|
|
if (NH.getNode())
|
|
|
|
return NH; // Already have a node? Just return it...
|
|
|
|
|
|
|
|
// Otherwise we need to create a new node to point to.
|
|
|
|
// Check first for constant expressions that must be traversed to
|
|
|
|
// extract the actual value.
|
2002-11-08 05:00:44 +00:00
|
|
|
if (Constant *C = dyn_cast<Constant>(V))
|
|
|
|
if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(C)) {
|
2002-12-06 21:17:10 +00:00
|
|
|
return NH = getValueDest(*CPR->getValue());
|
2002-11-08 05:00:44 +00:00
|
|
|
} else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
|
|
|
|
if (CE->getOpcode() == Instruction::Cast)
|
2003-02-09 23:04:12 +00:00
|
|
|
NH = getValueDest(*CE->getOperand(0));
|
|
|
|
else if (CE->getOpcode() == Instruction::GetElementPtr) {
|
2002-11-08 05:00:44 +00:00
|
|
|
visitGetElementPtrInst(*CE);
|
2004-01-28 09:15:42 +00:00
|
|
|
DSScalarMap::iterator I = ScalarMap.find(CE);
|
2002-11-09 20:14:03 +00:00
|
|
|
assert(I != ScalarMap.end() && "GEP didn't get processed right?");
|
2003-02-09 23:04:12 +00:00
|
|
|
NH = I->second;
|
|
|
|
} else {
|
|
|
|
// This returns a conservative unknown node for any unhandled ConstExpr
|
2003-06-19 21:15:11 +00:00
|
|
|
return NH = createNode()->setUnknownNodeMarker();
|
2002-11-08 05:00:44 +00:00
|
|
|
}
|
2003-02-09 23:04:12 +00:00
|
|
|
if (NH.getNode() == 0) { // (getelementptr null, X) returns null
|
|
|
|
ScalarMap.erase(V);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return NH;
|
2002-11-08 05:00:44 +00:00
|
|
|
|
|
|
|
} else if (ConstantIntegral *CI = dyn_cast<ConstantIntegral>(C)) {
|
|
|
|
// Random constants are unknown mem
|
2003-06-19 21:15:11 +00:00
|
|
|
return NH = createNode()->setUnknownNodeMarker();
|
2002-11-08 05:00:44 +00:00
|
|
|
} else {
|
|
|
|
assert(0 && "Unknown constant type!");
|
|
|
|
}
|
|
|
|
|
2002-11-02 00:13:20 +00:00
|
|
|
// Otherwise we need to create a new node to point to...
|
|
|
|
DSNode *N;
|
2002-11-08 05:00:44 +00:00
|
|
|
if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
|
2002-11-02 00:13:20 +00:00
|
|
|
// Create a new global node for this global variable...
|
2003-06-19 21:15:11 +00:00
|
|
|
N = createNode(GV->getType()->getElementType());
|
2002-11-02 00:13:20 +00:00
|
|
|
N->addGlobal(GV);
|
2002-07-11 20:32:02 +00:00
|
|
|
} else {
|
2002-11-02 00:13:20 +00:00
|
|
|
// Otherwise just create a shadow node
|
2003-06-19 21:15:11 +00:00
|
|
|
N = createNode();
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
|
|
|
|
2002-11-02 00:13:20 +00:00
|
|
|
NH.setNode(N); // Remember that we are pointing to it...
|
|
|
|
NH.setOffset(0);
|
|
|
|
return NH;
|
2002-10-01 22:33:50 +00:00
|
|
|
}
|
2002-07-18 00:12:30 +00:00
|
|
|
|
2002-07-10 22:38:08 +00:00
|
|
|
|
2002-10-01 22:33:50 +00:00
|
|
|
/// getLink - This method is used to return the specified link in the
|
|
|
|
/// specified node if one exists. If a link does not already exist (it's
|
|
|
|
/// null), then we create a new node, link it, then return it. We must
|
|
|
|
/// specify the type of the Node field we are accessing so that we know what
|
|
|
|
/// type should be linked to if we need to create a new node.
|
|
|
|
///
|
2002-10-31 06:52:26 +00:00
|
|
|
DSNodeHandle &GraphBuilder::getLink(const DSNodeHandle &node, unsigned LinkNo) {
|
2002-10-01 22:33:50 +00:00
|
|
|
DSNodeHandle &Node = const_cast<DSNodeHandle&>(node);
|
2002-11-06 06:20:27 +00:00
|
|
|
DSNodeHandle &Link = Node.getLink(LinkNo);
|
|
|
|
if (!Link.getNode()) {
|
|
|
|
// If the link hasn't been created yet, make and return a new shadow node
|
2003-06-19 21:15:11 +00:00
|
|
|
Link = createNode();
|
2002-11-06 06:20:27 +00:00
|
|
|
}
|
|
|
|
return Link;
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
|
|
|
|
2002-10-01 22:33:50 +00:00
|
|
|
|
2002-11-03 21:27:48 +00:00
|
|
|
/// setDestTo - Set the ScalarMap entry for the specified value to point to the
|
2002-11-02 00:13:20 +00:00
|
|
|
/// specified destination. If the Value already points to a node, make sure to
|
|
|
|
/// merge the two destinations together.
|
|
|
|
///
|
|
|
|
void GraphBuilder::setDestTo(Value &V, const DSNodeHandle &NH) {
|
2002-11-03 21:27:48 +00:00
|
|
|
DSNodeHandle &AINH = ScalarMap[&V];
|
2002-11-02 00:13:20 +00:00
|
|
|
if (AINH.getNode() == 0) // Not pointing to anything yet?
|
|
|
|
AINH = NH; // Just point directly to NH
|
|
|
|
else
|
|
|
|
AINH.mergeWith(NH);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-07-10 22:38:08 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Specific instruction type handler implementations...
|
|
|
|
//
|
|
|
|
|
2002-10-01 22:33:50 +00:00
|
|
|
/// Alloca & Malloc instruction implementation - Simply create a new memory
|
|
|
|
/// object, pointing the scalar to it.
|
|
|
|
///
|
2003-06-19 21:15:11 +00:00
|
|
|
void GraphBuilder::handleAlloc(AllocationInst &AI, bool isHeap) {
|
|
|
|
DSNode *N = createNode();
|
|
|
|
if (isHeap)
|
|
|
|
N->setHeapNodeMarker();
|
|
|
|
else
|
|
|
|
N->setAllocaNodeMarker();
|
|
|
|
setDestTo(AI, N);
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// PHINode - Make the scalar for the PHI node point to all of the things the
|
|
|
|
// incoming values point to... which effectively causes them to be merged.
|
|
|
|
//
|
|
|
|
void GraphBuilder::visitPHINode(PHINode &PN) {
|
2002-10-01 22:33:50 +00:00
|
|
|
if (!isPointerType(PN.getType())) return; // Only pointer PHIs
|
2002-07-10 22:38:08 +00:00
|
|
|
|
2002-11-03 21:27:48 +00:00
|
|
|
DSNodeHandle &PNDest = ScalarMap[&PN];
|
2002-07-10 22:38:08 +00:00
|
|
|
for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
|
2002-11-02 00:13:20 +00:00
|
|
|
PNDest.mergeWith(getValueDest(*PN.getIncomingValue(i)));
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
|
|
|
|
2002-11-08 05:00:44 +00:00
|
|
|
void GraphBuilder::visitGetElementPtrInst(User &GEP) {
|
2002-10-01 22:33:50 +00:00
|
|
|
DSNodeHandle Value = getValueDest(*GEP.getOperand(0));
|
2002-11-02 00:13:20 +00:00
|
|
|
if (Value.getNode() == 0) return;
|
2002-10-01 22:33:50 +00:00
|
|
|
|
2003-11-14 17:09:46 +00:00
|
|
|
// As a special case, if all of the index operands of GEP are constant zeros,
|
|
|
|
// handle this just like we handle casts (ie, don't do much).
|
|
|
|
bool AllZeros = true;
|
|
|
|
for (unsigned i = 1, e = GEP.getNumOperands(); i != e; ++i)
|
|
|
|
if (GEP.getOperand(i) !=
|
|
|
|
Constant::getNullValue(GEP.getOperand(i)->getType())) {
|
|
|
|
AllZeros = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If all of the indices are zero, the result points to the operand without
|
|
|
|
// applying the type.
|
|
|
|
if (AllZeros) {
|
|
|
|
setDestTo(GEP, Value);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-10-31 05:45:02 +00:00
|
|
|
const PointerType *PTy = cast<PointerType>(GEP.getOperand(0)->getType());
|
|
|
|
const Type *CurTy = PTy->getElementType();
|
|
|
|
|
2002-11-06 06:20:27 +00:00
|
|
|
if (Value.getNode()->mergeTypeInfo(CurTy, Value.getOffset())) {
|
|
|
|
// If the node had to be folded... exit quickly
|
2002-11-02 00:13:20 +00:00
|
|
|
setDestTo(GEP, Value); // GEP result points to folded node
|
2002-10-31 05:45:02 +00:00
|
|
|
return;
|
|
|
|
}
|
2002-10-01 22:33:50 +00:00
|
|
|
|
2003-11-02 22:27:28 +00:00
|
|
|
const TargetData &TD = Value.getNode()->getTargetData();
|
|
|
|
|
2002-11-06 06:20:27 +00:00
|
|
|
#if 0
|
2002-10-31 05:45:02 +00:00
|
|
|
// Handle the pointer index specially...
|
|
|
|
if (GEP.getNumOperands() > 1 &&
|
|
|
|
GEP.getOperand(1) != ConstantSInt::getNullValue(Type::LongTy)) {
|
|
|
|
|
|
|
|
// If we already know this is an array being accessed, don't do anything...
|
|
|
|
if (!TopTypeRec.isArray) {
|
|
|
|
TopTypeRec.isArray = true;
|
|
|
|
|
|
|
|
// If we are treating some inner field pointer as an array, fold the node
|
|
|
|
// up because we cannot handle it right. This can come because of
|
|
|
|
// something like this: &((&Pt->X)[1]) == &Pt->Y
|
|
|
|
//
|
|
|
|
if (Value.getOffset()) {
|
|
|
|
// Value is now the pointer we want to GEP to be...
|
|
|
|
Value.getNode()->foldNodeCompletely();
|
2002-11-02 00:13:20 +00:00
|
|
|
setDestTo(GEP, Value); // GEP result points to folded node
|
2002-10-31 05:45:02 +00:00
|
|
|
return;
|
|
|
|
} else {
|
|
|
|
// This is a pointer to the first byte of the node. Make sure that we
|
|
|
|
// are pointing to the outter most type in the node.
|
|
|
|
// FIXME: We need to check one more case here...
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2002-11-06 06:20:27 +00:00
|
|
|
#endif
|
2002-10-31 05:45:02 +00:00
|
|
|
|
|
|
|
// All of these subscripts are indexing INTO the elements we have...
|
2003-09-20 21:48:16 +00:00
|
|
|
unsigned Offset = 0;
|
2003-11-25 20:19:55 +00:00
|
|
|
for (gep_type_iterator I = gep_type_begin(GEP), E = gep_type_end(GEP);
|
|
|
|
I != E; ++I)
|
|
|
|
if (const StructType *STy = dyn_cast<StructType>(*I)) {
|
|
|
|
unsigned FieldNo = cast<ConstantUInt>(I.getOperand())->getValue();
|
|
|
|
Offset += TD.getStructLayout(STy)->MemberOffsets[FieldNo];
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-06 06:20:27 +00:00
|
|
|
#if 0
|
2003-11-25 20:19:55 +00:00
|
|
|
if (const SequentialType *STy = cast<SequentialType>(*I)) {
|
|
|
|
CurTy = STy->getElementType();
|
2002-10-02 06:24:36 +00:00
|
|
|
if (ConstantSInt *CS = dyn_cast<ConstantSInt>(GEP.getOperand(i))) {
|
2002-10-31 05:45:02 +00:00
|
|
|
Offset += CS->getValue()*TD.getTypeSize(CurTy);
|
2002-10-02 06:24:36 +00:00
|
|
|
} else {
|
|
|
|
// Variable index into a node. We must merge all of the elements of the
|
|
|
|
// sequential type here.
|
|
|
|
if (isa<PointerType>(STy))
|
|
|
|
std::cerr << "Pointer indexing not handled yet!\n";
|
|
|
|
else {
|
|
|
|
const ArrayType *ATy = cast<ArrayType>(STy);
|
|
|
|
unsigned ElSize = TD.getTypeSize(CurTy);
|
|
|
|
DSNode *N = Value.getNode();
|
|
|
|
assert(N && "Value must have a node!");
|
|
|
|
unsigned RawOffset = Offset+Value.getOffset();
|
|
|
|
|
|
|
|
// Loop over all of the elements of the array, merging them into the
|
2003-09-11 18:14:24 +00:00
|
|
|
// zeroth element.
|
2002-10-02 06:24:36 +00:00
|
|
|
for (unsigned i = 1, e = ATy->getNumElements(); i != e; ++i)
|
|
|
|
// Merge all of the byte components of this array element
|
|
|
|
for (unsigned j = 0; j != ElSize; ++j)
|
|
|
|
N->mergeIndexes(RawOffset+j, RawOffset+i*ElSize+j);
|
|
|
|
}
|
2002-10-01 22:33:50 +00:00
|
|
|
}
|
|
|
|
}
|
2003-11-25 20:19:55 +00:00
|
|
|
#endif
|
2002-10-01 22:33:50 +00:00
|
|
|
|
|
|
|
// Add in the offset calculated...
|
|
|
|
Value.setOffset(Value.getOffset()+Offset);
|
|
|
|
|
|
|
|
// Value is now the pointer we want to GEP to be...
|
2002-11-02 00:13:20 +00:00
|
|
|
setDestTo(GEP, Value);
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void GraphBuilder::visitLoadInst(LoadInst &LI) {
|
2002-11-02 00:13:20 +00:00
|
|
|
DSNodeHandle Ptr = getValueDest(*LI.getOperand(0));
|
|
|
|
if (Ptr.getNode() == 0) return;
|
|
|
|
|
|
|
|
// Make that the node is read from...
|
2003-06-19 21:15:11 +00:00
|
|
|
Ptr.getNode()->setReadMarker();
|
2002-10-31 05:45:02 +00:00
|
|
|
|
|
|
|
// Ensure a typerecord exists...
|
2003-03-03 17:13:31 +00:00
|
|
|
Ptr.getNode()->mergeTypeInfo(LI.getType(), Ptr.getOffset(), false);
|
2002-11-02 00:13:20 +00:00
|
|
|
|
2002-10-01 22:33:50 +00:00
|
|
|
if (isPointerType(LI.getType()))
|
2002-11-02 00:13:20 +00:00
|
|
|
setDestTo(LI, getLink(Ptr));
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void GraphBuilder::visitStoreInst(StoreInst &SI) {
|
2002-10-31 05:45:02 +00:00
|
|
|
const Type *StoredTy = SI.getOperand(0)->getType();
|
2002-11-02 00:13:20 +00:00
|
|
|
DSNodeHandle Dest = getValueDest(*SI.getOperand(1));
|
|
|
|
if (Dest.getNode() == 0) return;
|
|
|
|
|
2002-12-06 21:17:10 +00:00
|
|
|
// Mark that the node is written to...
|
2003-06-19 21:15:11 +00:00
|
|
|
Dest.getNode()->setModifiedMarker();
|
2002-10-31 05:45:02 +00:00
|
|
|
|
2003-09-20 21:48:16 +00:00
|
|
|
// Ensure a type-record exists...
|
2002-11-06 06:20:27 +00:00
|
|
|
Dest.getNode()->mergeTypeInfo(StoredTy, Dest.getOffset());
|
2002-10-01 22:33:50 +00:00
|
|
|
|
|
|
|
// Avoid adding edges from null, or processing non-"pointer" stores
|
2002-11-02 00:13:20 +00:00
|
|
|
if (isPointerType(StoredTy))
|
2002-10-01 22:33:50 +00:00
|
|
|
Dest.addEdgeTo(getValueDest(*SI.getOperand(0)));
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void GraphBuilder::visitReturnInst(ReturnInst &RI) {
|
2002-11-02 00:13:20 +00:00
|
|
|
if (RI.getNumOperands() && isPointerType(RI.getOperand(0)->getType()))
|
2003-09-20 21:48:16 +00:00
|
|
|
RetNode->mergeWith(getValueDest(*RI.getOperand(0)));
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void GraphBuilder::visitCallInst(CallInst &CI) {
|
2003-09-20 16:34:13 +00:00
|
|
|
visitCallSite(&CI);
|
|
|
|
}
|
|
|
|
|
|
|
|
void GraphBuilder::visitInvokeInst(InvokeInst &II) {
|
|
|
|
visitCallSite(&II);
|
|
|
|
}
|
|
|
|
|
|
|
|
void GraphBuilder::visitCallSite(CallSite CS) {
|
2003-09-20 16:50:46 +00:00
|
|
|
// Special case handling of certain libc allocation functions here.
|
|
|
|
if (Function *F = CS.getCalledFunction())
|
|
|
|
if (F->isExternal())
|
2004-02-13 16:09:54 +00:00
|
|
|
switch (F->getIntrinsicID()) {
|
|
|
|
case Intrinsic::memmove:
|
|
|
|
case Intrinsic::memcpy: {
|
|
|
|
// Merge the first & second arguments, and mark the memory read and
|
2003-11-08 21:55:50 +00:00
|
|
|
// modified.
|
2004-02-13 16:09:54 +00:00
|
|
|
DSNodeHandle RetNH = getValueDest(**CS.arg_begin());
|
2003-11-09 03:32:52 +00:00
|
|
|
RetNH.mergeWith(getValueDest(**(CS.arg_begin()+1)));
|
|
|
|
if (DSNode *N = RetNH.getNode())
|
|
|
|
N->setModifiedMarker()->setReadMarker();
|
|
|
|
return;
|
2004-02-13 16:09:54 +00:00
|
|
|
}
|
|
|
|
default:
|
|
|
|
if (F->getName() == "calloc") {
|
|
|
|
setDestTo(*CS.getInstruction(),
|
|
|
|
createNode()->setHeapNodeMarker()->setModifiedMarker());
|
|
|
|
return;
|
|
|
|
} else if (F->getName() == "realloc") {
|
|
|
|
DSNodeHandle RetNH = getValueDest(*CS.getInstruction());
|
|
|
|
RetNH.mergeWith(getValueDest(**CS.arg_begin()));
|
|
|
|
if (DSNode *N = RetNH.getNode())
|
|
|
|
N->setHeapNodeMarker()->setModifiedMarker()->setReadMarker();
|
|
|
|
return;
|
|
|
|
} else if (F->getName() == "memset") {
|
|
|
|
// Merge the first argument with the return value, and mark the memory
|
|
|
|
// modified.
|
|
|
|
DSNodeHandle RetNH = getValueDest(*CS.getInstruction());
|
|
|
|
RetNH.mergeWith(getValueDest(**CS.arg_begin()));
|
|
|
|
if (DSNode *N = RetNH.getNode())
|
|
|
|
N->setModifiedMarker();
|
|
|
|
return;
|
|
|
|
} else if (F->getName() == "bzero") {
|
|
|
|
// Mark the memory modified.
|
|
|
|
DSNodeHandle H = getValueDest(**CS.arg_begin());
|
|
|
|
if (DSNode *N = H.getNode())
|
|
|
|
N->setModifiedMarker();
|
|
|
|
return;
|
2004-02-13 20:05:32 +00:00
|
|
|
} else if (F->getName() == "fopen" && CS.arg_end()-CS.arg_begin() == 2){
|
|
|
|
// fopen reads the mode argument strings.
|
|
|
|
CallSite::arg_iterator AI = CS.arg_begin();
|
|
|
|
DSNodeHandle Path = getValueDest(**AI);
|
|
|
|
DSNodeHandle Mode = getValueDest(**++AI);
|
|
|
|
if (DSNode *N = Path.getNode()) N->setReadMarker();
|
|
|
|
if (DSNode *N = Mode.getNode()) N->setReadMarker();
|
|
|
|
|
|
|
|
// fopen allocates in an unknown way and writes to the file
|
|
|
|
// descriptor. Also, merge the allocated type into the node.
|
|
|
|
DSNodeHandle Result = getValueDest(*CS.getInstruction());
|
|
|
|
Result.getNode()->setModifiedMarker()->setUnknownNodeMarker();
|
|
|
|
const Type *RetTy = F->getFunctionType()->getReturnType();
|
|
|
|
if (const PointerType *PTy = dyn_cast<PointerType>(RetTy))
|
|
|
|
Result.getNode()->mergeTypeInfo(PTy->getElementType(),
|
|
|
|
Result.getOffset());
|
|
|
|
return;
|
|
|
|
} else if (F->getName() == "fclose" && CS.arg_end()-CS.arg_begin() ==1){
|
|
|
|
// fclose reads and deallocates the memory in an unknown way for the
|
|
|
|
// file descriptor. It merges the FILE type into the descriptor.
|
|
|
|
DSNodeHandle H = getValueDest(**CS.arg_begin());
|
|
|
|
H.getNode()->setReadMarker()->setUnknownNodeMarker();
|
|
|
|
|
|
|
|
const Type *ArgTy = *F->getFunctionType()->param_begin();
|
|
|
|
if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
|
|
|
|
H.getNode()->mergeTypeInfo(PTy->getElementType(), H.getOffset());
|
|
|
|
return;
|
2004-02-13 21:21:48 +00:00
|
|
|
} else if (F->getName() == "fflush" && CS.arg_end()-CS.arg_begin() ==1){
|
|
|
|
// fclose reads and writes the memory for the file descriptor. It
|
|
|
|
// merges the FILE type into the descriptor.
|
|
|
|
DSNodeHandle H = getValueDest(**CS.arg_begin());
|
|
|
|
H.getNode()->setReadMarker()->setModifiedMarker();
|
|
|
|
|
|
|
|
const Type *ArgTy = *F->getFunctionType()->param_begin();
|
|
|
|
if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
|
|
|
|
H.getNode()->mergeTypeInfo(PTy->getElementType(), H.getOffset());
|
|
|
|
return;
|
|
|
|
} else if (F->getName() == "fgets" && CS.arg_end()-CS.arg_begin() == 3){
|
|
|
|
// fclose reads and writes the memory for the file descriptor. It
|
|
|
|
// merges the FILE type into the descriptor, and writes to the
|
|
|
|
// argument. It returns the argument as well.
|
|
|
|
CallSite::arg_iterator AI = CS.arg_begin();
|
|
|
|
DSNodeHandle H = getValueDest(**AI);
|
|
|
|
if (DSNode *N = H.getNode())
|
|
|
|
N->setModifiedMarker(); // Writes buffer
|
|
|
|
H.mergeWith(getValueDest(*CS.getInstruction())); // Returns buffer
|
|
|
|
++AI; ++AI;
|
|
|
|
|
|
|
|
// Reads and writes file descriptor, merge in FILE type.
|
|
|
|
H = getValueDest(**CS.arg_begin());
|
|
|
|
if (DSNode *N = H.getNode())
|
|
|
|
N->setReadMarker()->setModifiedMarker();
|
|
|
|
const Type *ArgTy = *(F->getFunctionType()->param_begin()+2);
|
|
|
|
if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
|
|
|
|
H.getNode()->mergeTypeInfo(PTy->getElementType(), H.getOffset());
|
|
|
|
return;
|
|
|
|
} else if (F->getName() == "printf" || F->getName() == "fprintf") {
|
|
|
|
CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
|
|
|
|
|
|
|
|
if (F->getName() == "fprintf") {
|
|
|
|
// fprintf reads and writes the FILE argument, and applies the type
|
|
|
|
// to it.
|
|
|
|
DSNodeHandle H = getValueDest(**AI);
|
|
|
|
if (DSNode *N = H.getNode()) {
|
|
|
|
N->setModifiedMarker();
|
|
|
|
const Type *ArgTy = (*AI)->getType();
|
|
|
|
if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
|
|
|
|
N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (; AI != E; ++AI) {
|
|
|
|
// printf reads all pointer arguments.
|
|
|
|
if (isPointerType((*AI)->getType()))
|
|
|
|
if (DSNode *N = getValueDest(**AI).getNode())
|
|
|
|
N->setReadMarker();
|
|
|
|
}
|
|
|
|
|
|
|
|
} else if (F->getName() == "exit") {
|
|
|
|
// Nothing to do!
|
|
|
|
} else {
|
|
|
|
std::cerr << "WARNING: Call to unknown external function '"
|
|
|
|
<< F->getName() << "' will cause pessimistic results!\n";
|
2004-02-13 16:09:54 +00:00
|
|
|
}
|
2003-09-20 16:50:46 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-07-11 20:32:02 +00:00
|
|
|
// Set up the return value...
|
2002-10-21 02:08:03 +00:00
|
|
|
DSNodeHandle RetVal;
|
2003-09-20 16:34:13 +00:00
|
|
|
Instruction *I = CS.getInstruction();
|
|
|
|
if (isPointerType(I->getType()))
|
|
|
|
RetVal = getValueDest(*I);
|
2002-07-11 20:32:02 +00:00
|
|
|
|
2003-02-05 21:59:58 +00:00
|
|
|
DSNode *Callee = 0;
|
2003-09-24 23:42:58 +00:00
|
|
|
if (DisableDirectCallOpt || !isa<Function>(CS.getCalledValue())) {
|
2003-09-20 16:34:13 +00:00
|
|
|
Callee = getValueDest(*CS.getCalledValue()).getNode();
|
2003-09-24 23:42:58 +00:00
|
|
|
if (Callee == 0) {
|
|
|
|
std::cerr << "WARNING: Program is calling through a null pointer?\n"
|
|
|
|
<< *I;
|
|
|
|
return; // Calling a null pointer?
|
|
|
|
}
|
|
|
|
}
|
2002-10-21 02:08:03 +00:00
|
|
|
|
|
|
|
std::vector<DSNodeHandle> Args;
|
2003-09-20 16:34:13 +00:00
|
|
|
Args.reserve(CS.arg_end()-CS.arg_begin());
|
2002-07-18 00:12:30 +00:00
|
|
|
|
2002-10-21 02:08:03 +00:00
|
|
|
// Calculate the arguments vector...
|
2003-09-20 16:34:13 +00:00
|
|
|
for (CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end(); I != E; ++I)
|
|
|
|
if (isPointerType((*I)->getType()))
|
|
|
|
Args.push_back(getValueDest(**I));
|
2002-10-21 02:08:03 +00:00
|
|
|
|
|
|
|
// Add a new function call entry...
|
2003-02-05 21:59:58 +00:00
|
|
|
if (Callee)
|
2003-09-20 21:48:16 +00:00
|
|
|
FunctionCalls->push_back(DSCallSite(CS, RetVal, Callee, Args));
|
2003-02-05 21:59:58 +00:00
|
|
|
else
|
2003-09-20 21:48:16 +00:00
|
|
|
FunctionCalls->push_back(DSCallSite(CS, RetVal, CS.getCalledFunction(),
|
|
|
|
Args));
|
2002-07-10 22:38:08 +00:00
|
|
|
}
|
2002-07-18 15:54:42 +00:00
|
|
|
|
2002-12-06 21:17:10 +00:00
|
|
|
void GraphBuilder::visitFreeInst(FreeInst &FI) {
|
|
|
|
// Mark that the node is written to...
|
2003-06-19 21:15:11 +00:00
|
|
|
DSNode *N = getValueDest(*FI.getOperand(0)).getNode();
|
|
|
|
N->setModifiedMarker();
|
|
|
|
N->setHeapNodeMarker();
|
2002-12-06 21:17:10 +00:00
|
|
|
}
|
|
|
|
|
2002-10-01 22:33:50 +00:00
|
|
|
/// Handle casts...
|
|
|
|
void GraphBuilder::visitCastInst(CastInst &CI) {
|
2002-11-02 00:36:03 +00:00
|
|
|
if (isPointerType(CI.getType()))
|
|
|
|
if (isPointerType(CI.getOperand(0)->getType())) {
|
|
|
|
// Cast one pointer to the other, just act like a copy instruction
|
2002-11-02 00:13:20 +00:00
|
|
|
setDestTo(CI, getValueDest(*CI.getOperand(0)));
|
2002-11-02 00:36:03 +00:00
|
|
|
} else {
|
|
|
|
// Cast something (floating point, small integer) to a pointer. We need
|
|
|
|
// to track the fact that the node points to SOMETHING, just something we
|
|
|
|
// don't know about. Make an "Unknown" node.
|
|
|
|
//
|
2003-06-19 21:15:11 +00:00
|
|
|
setDestTo(CI, createNode()->setUnknownNodeMarker());
|
2002-11-02 00:36:03 +00:00
|
|
|
}
|
2002-10-01 22:33:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-02-04 00:59:50 +00:00
|
|
|
// visitInstruction - For all other instruction types, if we have any arguments
|
|
|
|
// that are of pointer type, make them have unknown composition bits, and merge
|
|
|
|
// the nodes together.
|
|
|
|
void GraphBuilder::visitInstruction(Instruction &Inst) {
|
|
|
|
DSNodeHandle CurNode;
|
|
|
|
if (isPointerType(Inst.getType()))
|
|
|
|
CurNode = getValueDest(Inst);
|
|
|
|
for (User::op_iterator I = Inst.op_begin(), E = Inst.op_end(); I != E; ++I)
|
|
|
|
if (isPointerType((*I)->getType()))
|
|
|
|
CurNode.mergeWith(getValueDest(**I));
|
|
|
|
|
|
|
|
if (CurNode.getNode())
|
2003-06-19 21:15:11 +00:00
|
|
|
CurNode.getNode()->setUnknownNodeMarker();
|
2003-02-04 00:59:50 +00:00
|
|
|
}
|
|
|
|
|
2002-10-01 22:33:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// LocalDataStructures Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2003-09-20 21:48:16 +00:00
|
|
|
// MergeConstantInitIntoNode - Merge the specified constant into the node
|
|
|
|
// pointed to by NH.
|
|
|
|
void GraphBuilder::MergeConstantInitIntoNode(DSNodeHandle &NH, Constant *C) {
|
|
|
|
// Ensure a type-record exists...
|
|
|
|
NH.getNode()->mergeTypeInfo(C->getType(), NH.getOffset());
|
|
|
|
|
|
|
|
if (C->getType()->isFirstClassType()) {
|
|
|
|
if (isPointerType(C->getType()))
|
|
|
|
// Avoid adding edges from null, or processing non-"pointer" stores
|
|
|
|
NH.addEdgeTo(getValueDest(*C));
|
|
|
|
return;
|
|
|
|
}
|
2003-11-02 22:27:28 +00:00
|
|
|
|
|
|
|
const TargetData &TD = NH.getNode()->getTargetData();
|
|
|
|
|
2003-09-20 21:48:16 +00:00
|
|
|
if (ConstantArray *CA = dyn_cast<ConstantArray>(C)) {
|
|
|
|
for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
|
|
|
|
// We don't currently do any indexing for arrays...
|
|
|
|
MergeConstantInitIntoNode(NH, cast<Constant>(CA->getOperand(i)));
|
|
|
|
} else if (ConstantStruct *CS = dyn_cast<ConstantStruct>(C)) {
|
|
|
|
const StructLayout *SL = TD.getStructLayout(CS->getType());
|
|
|
|
for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i) {
|
|
|
|
DSNodeHandle NewNH(NH.getNode(), NH.getOffset()+SL->MemberOffsets[i]);
|
|
|
|
MergeConstantInitIntoNode(NewNH, cast<Constant>(CS->getOperand(i)));
|
|
|
|
}
|
2004-02-15 05:53:42 +00:00
|
|
|
} else if (ConstantAggregateZero *CAZ = dyn_cast<ConstantAggregateZero>(C)) {
|
|
|
|
// Noop
|
2003-09-20 21:48:16 +00:00
|
|
|
} else {
|
|
|
|
assert(0 && "Unknown constant type!");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void GraphBuilder::mergeInGlobalInitializer(GlobalVariable *GV) {
|
|
|
|
assert(!GV->isExternal() && "Cannot merge in external global!");
|
|
|
|
// Get a node handle to the global node and merge the initializer into it.
|
|
|
|
DSNodeHandle NH = getValueDest(*GV);
|
|
|
|
MergeConstantInitIntoNode(NH, GV->getInitializer());
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-09 21:12:07 +00:00
|
|
|
bool LocalDataStructures::run(Module &M) {
|
2003-11-02 22:27:28 +00:00
|
|
|
GlobalsGraph = new DSGraph(getAnalysis<TargetData>());
|
|
|
|
|
|
|
|
const TargetData &TD = getAnalysis<TargetData>();
|
2002-11-09 21:12:07 +00:00
|
|
|
|
|
|
|
// Calculate all of the graphs...
|
|
|
|
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
|
|
|
|
if (!I->isExternal())
|
2003-11-02 22:27:28 +00:00
|
|
|
DSInfo.insert(std::make_pair(I, new DSGraph(TD, *I, GlobalsGraph)));
|
2003-09-20 21:48:16 +00:00
|
|
|
|
|
|
|
GraphBuilder GGB(*GlobalsGraph);
|
|
|
|
|
|
|
|
// Add initializers for all of the globals to the globals graph...
|
|
|
|
for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
|
|
|
|
if (!I->isExternal())
|
|
|
|
GGB.mergeInGlobalInitializer(I);
|
|
|
|
|
2004-02-08 01:51:48 +00:00
|
|
|
GlobalsGraph->removeTriviallyDeadNodes();
|
2003-09-20 21:48:16 +00:00
|
|
|
GlobalsGraph->markIncompleteNodes(DSGraph::MarkFormalArgs);
|
2002-11-09 21:12:07 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2002-10-01 22:33:50 +00:00
|
|
|
// releaseMemory - If the pass pipeline is done with this pass, we can release
|
|
|
|
// our memory... here...
|
2002-07-18 15:54:42 +00:00
|
|
|
//
|
2002-10-01 22:33:50 +00:00
|
|
|
void LocalDataStructures::releaseMemory() {
|
2003-06-30 04:53:27 +00:00
|
|
|
for (hash_map<Function*, DSGraph*>::iterator I = DSInfo.begin(),
|
|
|
|
E = DSInfo.end(); I != E; ++I) {
|
|
|
|
I->second->getReturnNodes().erase(I->first);
|
|
|
|
if (I->second->getReturnNodes().empty())
|
|
|
|
delete I->second;
|
|
|
|
}
|
2002-10-01 22:33:50 +00:00
|
|
|
|
|
|
|
// Empty map so next time memory is released, data structures are not
|
|
|
|
// re-deleted.
|
|
|
|
DSInfo.clear();
|
2002-11-09 20:01:01 +00:00
|
|
|
delete GlobalsGraph;
|
|
|
|
GlobalsGraph = 0;
|
2002-10-01 22:33:50 +00:00
|
|
|
}
|
2003-11-11 22:41:34 +00:00
|
|
|
|