1 //===- Local.cpp - Compute a local data structure graph for a function ----===//
3 // Compute the local version of the data structure graph for a function. The
4 // external interface to this file is the DSGraph constructor.
6 //===----------------------------------------------------------------------===//
8 #include "llvm/Analysis/DataStructure.h"
9 #include "llvm/Analysis/DSGraph.h"
10 #include "llvm/iMemory.h"
11 #include "llvm/iTerminators.h"
12 #include "llvm/iPHINode.h"
13 #include "llvm/iOther.h"
14 #include "llvm/Constants.h"
15 #include "llvm/DerivedTypes.h"
16 #include "llvm/Function.h"
17 #include "llvm/GlobalVariable.h"
18 #include "llvm/Support/InstVisitor.h"
19 #include "llvm/Target/TargetData.h"
20 #include "Support/Statistic.h"
21 #include "Support/Timer.h"
22 #include "Support/CommandLine.h"
24 // FIXME: This should eventually be a FunctionPass that is automatically
25 // aggregated into a Pass.
27 #include "llvm/Module.h"
29 static RegisterAnalysis<LocalDataStructures>
30 X("datastructure", "Local Data Structure Analysis");
33 // FIXME: Do something smarter with target data!
34 TargetData TD("temp-td");
36 // isPointerType - Return true if this type is big enough to hold a pointer.
37 bool isPointerType(const Type *Ty) {
38 if (isa<PointerType>(Ty))
40 else if (Ty->isPrimitiveType() && Ty->isInteger())
41 return Ty->getPrimitiveSize() >= PointerSize;
50 DisableDirectCallOpt("disable-direct-call-dsopt", cl::Hidden,
51 cl::desc("Disable direct call optimization in "
52 "DSGraph construction"));
54 DisableFieldSensitivity("disable-ds-field-sensitivity", cl::Hidden,
55 cl::desc("Disable field sensitivity in DSGraphs"));
57 //===--------------------------------------------------------------------===//
59 //===--------------------------------------------------------------------===//
61 /// This class is the builder class that constructs the local data structure
62 /// graph by performing a single pass over the function in question.
64 class GraphBuilder : InstVisitor<GraphBuilder> {
66 std::vector<DSNode*> &Nodes;
67 DSNodeHandle &RetNode; // Node that gets returned...
68 hash_map<Value*, DSNodeHandle> &ScalarMap;
69 std::vector<DSCallSite> &FunctionCalls;
72 GraphBuilder(DSGraph &g, std::vector<DSNode*> &nodes, DSNodeHandle &retNode,
73 hash_map<Value*, DSNodeHandle> &SM,
74 std::vector<DSCallSite> &fc)
75 : G(g), Nodes(nodes), RetNode(retNode), ScalarMap(SM), FunctionCalls(fc) {
77 // Create scalar nodes for all pointer arguments...
78 for (Function::aiterator I = G.getFunction().abegin(),
79 E = G.getFunction().aend(); I != E; ++I)
80 if (isPointerType(I->getType()))
83 visit(G.getFunction()); // Single pass over the function
87 // Visitor functions, used to handle each instruction type we encounter...
88 friend class InstVisitor<GraphBuilder>;
89 void visitMallocInst(MallocInst &MI) { handleAlloc(MI, true); }
90 void visitAllocaInst(AllocaInst &AI) { handleAlloc(AI, false); }
91 void handleAlloc(AllocationInst &AI, bool isHeap);
93 void visitPHINode(PHINode &PN);
95 void visitGetElementPtrInst(User &GEP);
96 void visitReturnInst(ReturnInst &RI);
97 void visitLoadInst(LoadInst &LI);
98 void visitStoreInst(StoreInst &SI);
99 void visitCallInst(CallInst &CI);
100 void visitSetCondInst(SetCondInst &SCI) {} // SetEQ & friends are ignored
101 void visitFreeInst(FreeInst &FI);
102 void visitCastInst(CastInst &CI);
103 void visitInstruction(Instruction &I);
106 // Helper functions used to implement the visitation functions...
108 /// createNode - Create a new DSNode, ensuring that it is properly added to
111 DSNode *createNode(const Type *Ty = 0) {
112 DSNode *N = new DSNode(Ty, &G); // Create the node
113 if (DisableFieldSensitivity) {
114 N->foldNodeCompletely();
115 if (DSNode *FN = N->getForwardNode())
121 /// setDestTo - Set the ScalarMap entry for the specified value to point to
122 /// the specified destination. If the Value already points to a node, make
123 /// sure to merge the two destinations together.
125 void setDestTo(Value &V, const DSNodeHandle &NH);
127 /// getValueDest - Return the DSNode that the actual value points to.
129 DSNodeHandle getValueDest(Value &V);
131 /// getLink - This method is used to return the specified link in the
132 /// specified node if one exists. If a link does not already exist (it's
133 /// null), then we create a new node, link it, then return it.
135 DSNodeHandle &getLink(const DSNodeHandle &Node, unsigned Link = 0);
139 //===----------------------------------------------------------------------===//
140 // DSGraph constructor - Simply use the GraphBuilder to construct the local
142 DSGraph::DSGraph(Function &F, DSGraph *GG) : Func(&F), GlobalsGraph(GG) {
143 PrintAuxCalls = false;
144 // Use the graph builder to construct the local version of the graph
145 GraphBuilder B(*this, Nodes, RetNode, ScalarMap, FunctionCalls);
147 Timer::addPeakMemoryMeasurement();
150 // Remove all integral constants from the scalarmap!
151 for (hash_map<Value*, DSNodeHandle>::iterator I = ScalarMap.begin();
152 I != ScalarMap.end();)
153 if (isa<ConstantIntegral>(I->first)) {
154 hash_map<Value*, DSNodeHandle>::iterator J = I++;
159 markIncompleteNodes(DSGraph::MarkFormalArgs);
161 // Remove any nodes made dead due to merging...
162 removeDeadNodes(DSGraph::KeepUnreachableGlobals);
166 //===----------------------------------------------------------------------===//
167 // Helper method implementations...
170 /// getValueDest - Return the DSNode that the actual value points to.
172 DSNodeHandle GraphBuilder::getValueDest(Value &Val) {
174 if (V == Constant::getNullValue(V->getType()))
175 return 0; // Null doesn't point to anything, don't add to ScalarMap!
177 DSNodeHandle &NH = ScalarMap[V];
179 return NH; // Already have a node? Just return it...
181 // Otherwise we need to create a new node to point to.
182 // Check first for constant expressions that must be traversed to
183 // extract the actual value.
184 if (Constant *C = dyn_cast<Constant>(V))
185 if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(C)) {
186 return NH = getValueDest(*CPR->getValue());
187 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
188 if (CE->getOpcode() == Instruction::Cast)
189 NH = getValueDest(*CE->getOperand(0));
190 else if (CE->getOpcode() == Instruction::GetElementPtr) {
191 visitGetElementPtrInst(*CE);
192 hash_map<Value*, DSNodeHandle>::iterator I = ScalarMap.find(CE);
193 assert(I != ScalarMap.end() && "GEP didn't get processed right?");
196 // This returns a conservative unknown node for any unhandled ConstExpr
197 return NH = createNode()->setUnknownNodeMarker();
199 if (NH.getNode() == 0) { // (getelementptr null, X) returns null
205 } else if (ConstantIntegral *CI = dyn_cast<ConstantIntegral>(C)) {
206 // Random constants are unknown mem
207 return NH = createNode()->setUnknownNodeMarker();
209 assert(0 && "Unknown constant type!");
212 // Otherwise we need to create a new node to point to...
214 if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
215 // Create a new global node for this global variable...
216 N = createNode(GV->getType()->getElementType());
219 // Otherwise just create a shadow node
223 NH.setNode(N); // Remember that we are pointing to it...
229 /// getLink - This method is used to return the specified link in the
230 /// specified node if one exists. If a link does not already exist (it's
231 /// null), then we create a new node, link it, then return it. We must
232 /// specify the type of the Node field we are accessing so that we know what
233 /// type should be linked to if we need to create a new node.
235 DSNodeHandle &GraphBuilder::getLink(const DSNodeHandle &node, unsigned LinkNo) {
236 DSNodeHandle &Node = const_cast<DSNodeHandle&>(node);
237 DSNodeHandle &Link = Node.getLink(LinkNo);
238 if (!Link.getNode()) {
239 // If the link hasn't been created yet, make and return a new shadow node
246 /// setDestTo - Set the ScalarMap entry for the specified value to point to the
247 /// specified destination. If the Value already points to a node, make sure to
248 /// merge the two destinations together.
250 void GraphBuilder::setDestTo(Value &V, const DSNodeHandle &NH) {
251 DSNodeHandle &AINH = ScalarMap[&V];
252 if (AINH.getNode() == 0) // Not pointing to anything yet?
253 AINH = NH; // Just point directly to NH
259 //===----------------------------------------------------------------------===//
260 // Specific instruction type handler implementations...
263 /// Alloca & Malloc instruction implementation - Simply create a new memory
264 /// object, pointing the scalar to it.
266 void GraphBuilder::handleAlloc(AllocationInst &AI, bool isHeap) {
267 DSNode *N = createNode();
269 N->setHeapNodeMarker();
271 N->setAllocaNodeMarker();
275 // PHINode - Make the scalar for the PHI node point to all of the things the
276 // incoming values point to... which effectively causes them to be merged.
278 void GraphBuilder::visitPHINode(PHINode &PN) {
279 if (!isPointerType(PN.getType())) return; // Only pointer PHIs
281 DSNodeHandle &PNDest = ScalarMap[&PN];
282 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
283 PNDest.mergeWith(getValueDest(*PN.getIncomingValue(i)));
286 void GraphBuilder::visitGetElementPtrInst(User &GEP) {
287 DSNodeHandle Value = getValueDest(*GEP.getOperand(0));
288 if (Value.getNode() == 0) return;
291 const PointerType *PTy = cast<PointerType>(GEP.getOperand(0)->getType());
292 const Type *CurTy = PTy->getElementType();
294 if (Value.getNode()->mergeTypeInfo(CurTy, Value.getOffset())) {
295 // If the node had to be folded... exit quickly
296 setDestTo(GEP, Value); // GEP result points to folded node
301 // Handle the pointer index specially...
302 if (GEP.getNumOperands() > 1 &&
303 GEP.getOperand(1) != ConstantSInt::getNullValue(Type::LongTy)) {
305 // If we already know this is an array being accessed, don't do anything...
306 if (!TopTypeRec.isArray) {
307 TopTypeRec.isArray = true;
309 // If we are treating some inner field pointer as an array, fold the node
310 // up because we cannot handle it right. This can come because of
311 // something like this: &((&Pt->X)[1]) == &Pt->Y
313 if (Value.getOffset()) {
314 // Value is now the pointer we want to GEP to be...
315 Value.getNode()->foldNodeCompletely();
316 setDestTo(GEP, Value); // GEP result points to folded node
319 // This is a pointer to the first byte of the node. Make sure that we
320 // are pointing to the outter most type in the node.
321 // FIXME: We need to check one more case here...
327 // All of these subscripts are indexing INTO the elements we have...
328 for (unsigned i = 2, e = GEP.getNumOperands(); i < e; ++i)
329 if (GEP.getOperand(i)->getType() == Type::LongTy) {
330 // Get the type indexing into...
331 const SequentialType *STy = cast<SequentialType>(CurTy);
332 CurTy = STy->getElementType();
334 if (ConstantSInt *CS = dyn_cast<ConstantSInt>(GEP.getOperand(i))) {
335 Offset += CS->getValue()*TD.getTypeSize(CurTy);
337 // Variable index into a node. We must merge all of the elements of the
338 // sequential type here.
339 if (isa<PointerType>(STy))
340 std::cerr << "Pointer indexing not handled yet!\n";
342 const ArrayType *ATy = cast<ArrayType>(STy);
343 unsigned ElSize = TD.getTypeSize(CurTy);
344 DSNode *N = Value.getNode();
345 assert(N && "Value must have a node!");
346 unsigned RawOffset = Offset+Value.getOffset();
348 // Loop over all of the elements of the array, merging them into the
350 for (unsigned i = 1, e = ATy->getNumElements(); i != e; ++i)
351 // Merge all of the byte components of this array element
352 for (unsigned j = 0; j != ElSize; ++j)
353 N->mergeIndexes(RawOffset+j, RawOffset+i*ElSize+j);
357 } else if (GEP.getOperand(i)->getType() == Type::UByteTy) {
358 unsigned FieldNo = cast<ConstantUInt>(GEP.getOperand(i))->getValue();
359 const StructType *STy = cast<StructType>(CurTy);
360 Offset += TD.getStructLayout(STy)->MemberOffsets[FieldNo];
361 CurTy = STy->getContainedType(FieldNo);
364 // Add in the offset calculated...
365 Value.setOffset(Value.getOffset()+Offset);
367 // Value is now the pointer we want to GEP to be...
368 setDestTo(GEP, Value);
371 void GraphBuilder::visitLoadInst(LoadInst &LI) {
372 DSNodeHandle Ptr = getValueDest(*LI.getOperand(0));
373 if (Ptr.getNode() == 0) return;
375 // Make that the node is read from...
376 Ptr.getNode()->setReadMarker();
378 // Ensure a typerecord exists...
379 Ptr.getNode()->mergeTypeInfo(LI.getType(), Ptr.getOffset(), false);
381 if (isPointerType(LI.getType()))
382 setDestTo(LI, getLink(Ptr));
385 void GraphBuilder::visitStoreInst(StoreInst &SI) {
386 const Type *StoredTy = SI.getOperand(0)->getType();
387 DSNodeHandle Dest = getValueDest(*SI.getOperand(1));
388 if (Dest.getNode() == 0) return;
390 // Mark that the node is written to...
391 Dest.getNode()->setModifiedMarker();
393 // Ensure a typerecord exists...
394 Dest.getNode()->mergeTypeInfo(StoredTy, Dest.getOffset());
396 // Avoid adding edges from null, or processing non-"pointer" stores
397 if (isPointerType(StoredTy))
398 Dest.addEdgeTo(getValueDest(*SI.getOperand(0)));
401 void GraphBuilder::visitReturnInst(ReturnInst &RI) {
402 if (RI.getNumOperands() && isPointerType(RI.getOperand(0)->getType()))
403 RetNode.mergeWith(getValueDest(*RI.getOperand(0)));
406 void GraphBuilder::visitCallInst(CallInst &CI) {
407 // Set up the return value...
409 if (isPointerType(CI.getType()))
410 RetVal = getValueDest(CI);
413 if (DisableDirectCallOpt || !isa<Function>(CI.getOperand(0)))
414 Callee = getValueDest(*CI.getOperand(0)).getNode();
416 std::vector<DSNodeHandle> Args;
417 Args.reserve(CI.getNumOperands()-1);
419 // Calculate the arguments vector...
420 for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i)
421 if (isPointerType(CI.getOperand(i)->getType()))
422 Args.push_back(getValueDest(*CI.getOperand(i)));
424 // Add a new function call entry...
426 FunctionCalls.push_back(DSCallSite(CI, RetVal, Callee, Args));
428 FunctionCalls.push_back(DSCallSite(CI, RetVal,
429 cast<Function>(CI.getOperand(0)), Args));
432 void GraphBuilder::visitFreeInst(FreeInst &FI) {
433 // Mark that the node is written to...
434 DSNode *N = getValueDest(*FI.getOperand(0)).getNode();
435 N->setModifiedMarker();
436 N->setHeapNodeMarker();
440 void GraphBuilder::visitCastInst(CastInst &CI) {
441 if (isPointerType(CI.getType()))
442 if (isPointerType(CI.getOperand(0)->getType())) {
443 // Cast one pointer to the other, just act like a copy instruction
444 setDestTo(CI, getValueDest(*CI.getOperand(0)));
446 // Cast something (floating point, small integer) to a pointer. We need
447 // to track the fact that the node points to SOMETHING, just something we
448 // don't know about. Make an "Unknown" node.
450 setDestTo(CI, createNode()->setUnknownNodeMarker());
455 // visitInstruction - For all other instruction types, if we have any arguments
456 // that are of pointer type, make them have unknown composition bits, and merge
457 // the nodes together.
458 void GraphBuilder::visitInstruction(Instruction &Inst) {
459 DSNodeHandle CurNode;
460 if (isPointerType(Inst.getType()))
461 CurNode = getValueDest(Inst);
462 for (User::op_iterator I = Inst.op_begin(), E = Inst.op_end(); I != E; ++I)
463 if (isPointerType((*I)->getType()))
464 CurNode.mergeWith(getValueDest(**I));
466 if (CurNode.getNode())
467 CurNode.getNode()->setUnknownNodeMarker();
472 //===----------------------------------------------------------------------===//
473 // LocalDataStructures Implementation
474 //===----------------------------------------------------------------------===//
476 bool LocalDataStructures::run(Module &M) {
477 GlobalsGraph = new DSGraph();
479 // Calculate all of the graphs...
480 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
481 if (!I->isExternal())
482 DSInfo.insert(std::make_pair(I, new DSGraph(*I, GlobalsGraph)));
486 // releaseMemory - If the pass pipeline is done with this pass, we can release
487 // our memory... here...
489 void LocalDataStructures::releaseMemory() {
490 for (hash_map<const Function*, DSGraph*>::iterator I = DSInfo.begin(),
491 E = DSInfo.end(); I != E; ++I)
494 // Empty map so next time memory is released, data structures are not