blob: 4a61e8bb1068b71d759607a502c5d2a9f84f55a6 [file] [log] [blame]
Chris Lattnerfccd06f2002-10-01 22:33:50 +00001//===- Local.cpp - Compute a local data structure graph for a function ----===//
John Criswellb576c942003-10-20 19:43:21 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
Chris Lattnerc68c31b2002-07-10 22:38:08 +00009//
10// Compute the local version of the data structure graph for a function. The
11// external interface to this file is the DSGraph constructor.
12//
13//===----------------------------------------------------------------------===//
14
Chris Lattner055dc2c2002-07-18 15:54:42 +000015#include "llvm/Analysis/DataStructure.h"
Chris Lattner0779ba62002-11-09 19:25:10 +000016#include "llvm/Analysis/DSGraph.h"
Chris Lattnerc68c31b2002-07-10 22:38:08 +000017#include "llvm/Constants.h"
18#include "llvm/DerivedTypes.h"
Chris Lattner808a7ae2003-09-20 16:34:13 +000019#include "llvm/Instructions.h"
Chris Lattnera07b72f2004-02-13 16:09:54 +000020#include "llvm/Intrinsics.h"
Chris Lattnerfa3711a2003-11-25 20:19:55 +000021#include "llvm/Support/GetElementPtrTypeIterator.h"
Chris Lattnerc68c31b2002-07-10 22:38:08 +000022#include "llvm/Support/InstVisitor.h"
Chris Lattnerfccd06f2002-10-01 22:33:50 +000023#include "llvm/Target/TargetData.h"
Chris Lattner923fc052003-02-05 21:59:58 +000024#include "Support/CommandLine.h"
Chris Lattner6806f562003-08-01 22:15:03 +000025#include "Support/Debug.h"
26#include "Support/Timer.h"
Reid Spencer954da372004-07-04 12:19:56 +000027#include <iostream>
Chris Lattnerfccd06f2002-10-01 22:33:50 +000028
29// FIXME: This should eventually be a FunctionPass that is automatically
30// aggregated into a Pass.
31//
32#include "llvm/Module.h"
33
Chris Lattner9a927292003-11-12 23:11:14 +000034using namespace llvm;
Brian Gaeked0fde302003-11-11 22:41:34 +000035
Chris Lattner97f51a32002-07-27 01:12:15 +000036static RegisterAnalysis<LocalDataStructures>
37X("datastructure", "Local Data Structure Analysis");
Chris Lattner97f51a32002-07-27 01:12:15 +000038
Chris Lattnera1907662003-11-13 03:10:49 +000039static cl::opt<bool>
40TrackIntegersAsPointers("dsa-track-integers",
41 cl::desc("If this is set, track integers as potential pointers"));
Chris Lattnera1907662003-11-13 03:10:49 +000042
Chris Lattner9a927292003-11-12 23:11:14 +000043namespace llvm {
Chris Lattnerb1060432002-11-07 05:20:53 +000044namespace DS {
Chris Lattnerfccd06f2002-10-01 22:33:50 +000045 // isPointerType - Return true if this type is big enough to hold a pointer.
46 bool isPointerType(const Type *Ty) {
47 if (isa<PointerType>(Ty))
48 return true;
Chris Lattnera1907662003-11-13 03:10:49 +000049 else if (TrackIntegersAsPointers && Ty->isPrimitiveType() &&Ty->isInteger())
Chris Lattnerfccd06f2002-10-01 22:33:50 +000050 return Ty->getPrimitiveSize() >= PointerSize;
51 return false;
52 }
Chris Lattner9a927292003-11-12 23:11:14 +000053}}
Chris Lattnerfccd06f2002-10-01 22:33:50 +000054
Brian Gaeked0fde302003-11-11 22:41:34 +000055using namespace DS;
Chris Lattnerc68c31b2002-07-10 22:38:08 +000056
57namespace {
Chris Lattner923fc052003-02-05 21:59:58 +000058 cl::opt<bool>
59 DisableDirectCallOpt("disable-direct-call-dsopt", cl::Hidden,
60 cl::desc("Disable direct call optimization in "
61 "DSGraph construction"));
Chris Lattnerca3f7902003-02-08 20:18:39 +000062 cl::opt<bool>
63 DisableFieldSensitivity("disable-ds-field-sensitivity", cl::Hidden,
64 cl::desc("Disable field sensitivity in DSGraphs"));
Chris Lattner923fc052003-02-05 21:59:58 +000065
Chris Lattnerfccd06f2002-10-01 22:33:50 +000066 //===--------------------------------------------------------------------===//
67 // GraphBuilder Class
68 //===--------------------------------------------------------------------===//
69 //
70 /// This class is the builder class that constructs the local data structure
71 /// graph by performing a single pass over the function in question.
72 ///
Chris Lattnerc68c31b2002-07-10 22:38:08 +000073 class GraphBuilder : InstVisitor<GraphBuilder> {
74 DSGraph &G;
Chris Lattner26c4fc32003-09-20 21:48:16 +000075 DSNodeHandle *RetNode; // Node that gets returned...
Chris Lattner62482e52004-01-28 09:15:42 +000076 DSScalarMap &ScalarMap;
Chris Lattner26c4fc32003-09-20 21:48:16 +000077 std::vector<DSCallSite> *FunctionCalls;
Chris Lattnerc68c31b2002-07-10 22:38:08 +000078
79 public:
Chris Lattner44cfdf92003-07-02 06:06:34 +000080 GraphBuilder(Function &f, DSGraph &g, DSNodeHandle &retNode,
Chris Lattner26c4fc32003-09-20 21:48:16 +000081 std::vector<DSCallSite> &fc)
82 : G(g), RetNode(&retNode), ScalarMap(G.getScalarMap()),
83 FunctionCalls(&fc) {
Chris Lattner0d9bab82002-07-18 00:12:30 +000084
85 // Create scalar nodes for all pointer arguments...
Chris Lattner26c4fc32003-09-20 21:48:16 +000086 for (Function::aiterator I = f.abegin(), E = f.aend(); I != E; ++I)
Chris Lattnerfccd06f2002-10-01 22:33:50 +000087 if (isPointerType(I->getType()))
88 getValueDest(*I);
Chris Lattner0d9bab82002-07-18 00:12:30 +000089
Chris Lattner26c4fc32003-09-20 21:48:16 +000090 visit(f); // Single pass over the function
Chris Lattnerc68c31b2002-07-10 22:38:08 +000091 }
92
Chris Lattner26c4fc32003-09-20 21:48:16 +000093 // GraphBuilder ctor for working on the globals graph
94 GraphBuilder(DSGraph &g)
95 : G(g), RetNode(0), ScalarMap(G.getScalarMap()), FunctionCalls(0) {
96 }
97
98 void mergeInGlobalInitializer(GlobalVariable *GV);
99
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000100 private:
101 // Visitor functions, used to handle each instruction type we encounter...
102 friend class InstVisitor<GraphBuilder>;
Chris Lattnerbd92b732003-06-19 21:15:11 +0000103 void visitMallocInst(MallocInst &MI) { handleAlloc(MI, true); }
104 void visitAllocaInst(AllocaInst &AI) { handleAlloc(AI, false); }
105 void handleAlloc(AllocationInst &AI, bool isHeap);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000106
107 void visitPHINode(PHINode &PN);
108
Chris Lattner51340062002-11-08 05:00:44 +0000109 void visitGetElementPtrInst(User &GEP);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000110 void visitReturnInst(ReturnInst &RI);
111 void visitLoadInst(LoadInst &LI);
112 void visitStoreInst(StoreInst &SI);
113 void visitCallInst(CallInst &CI);
Chris Lattner808a7ae2003-09-20 16:34:13 +0000114 void visitInvokeInst(InvokeInst &II);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000115 void visitSetCondInst(SetCondInst &SCI) {} // SetEQ & friends are ignored
Vikram S. Advebac06222002-12-06 21:17:10 +0000116 void visitFreeInst(FreeInst &FI);
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000117 void visitCastInst(CastInst &CI);
Chris Lattner878e5212003-02-04 00:59:50 +0000118 void visitInstruction(Instruction &I);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000119
Chris Lattner808a7ae2003-09-20 16:34:13 +0000120 void visitCallSite(CallSite CS);
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000121 void visitVANextInst(VANextInst &I);
122 void visitVAArgInst(VAArgInst &I);
Chris Lattner26c4fc32003-09-20 21:48:16 +0000123
124 void MergeConstantInitIntoNode(DSNodeHandle &NH, Constant *C);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000125 private:
126 // Helper functions used to implement the visitation functions...
127
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000128 /// createNode - Create a new DSNode, ensuring that it is properly added to
129 /// the graph.
130 ///
Chris Lattnerbd92b732003-06-19 21:15:11 +0000131 DSNode *createNode(const Type *Ty = 0) {
132 DSNode *N = new DSNode(Ty, &G); // Create the node
Chris Lattnere158b192003-06-16 12:08:18 +0000133 if (DisableFieldSensitivity) {
Chris Lattner2412a052004-05-23 21:14:09 +0000134 // Create node handle referring to the old node so that it is
135 // immediately removed from the graph when the node handle is destroyed.
136 DSNodeHandle OldNNH = N;
Chris Lattnerca3f7902003-02-08 20:18:39 +0000137 N->foldNodeCompletely();
Chris Lattnere158b192003-06-16 12:08:18 +0000138 if (DSNode *FN = N->getForwardNode())
139 N = FN;
140 }
Chris Lattner92673292002-11-02 00:13:20 +0000141 return N;
142 }
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000143
Chris Lattnerc875f022002-11-03 21:27:48 +0000144 /// setDestTo - Set the ScalarMap entry for the specified value to point to
Chris Lattner92673292002-11-02 00:13:20 +0000145 /// the specified destination. If the Value already points to a node, make
146 /// sure to merge the two destinations together.
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000147 ///
Chris Lattner92673292002-11-02 00:13:20 +0000148 void setDestTo(Value &V, const DSNodeHandle &NH);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000149
Chris Lattner92673292002-11-02 00:13:20 +0000150 /// getValueDest - Return the DSNode that the actual value points to.
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000151 ///
Chris Lattner92673292002-11-02 00:13:20 +0000152 DSNodeHandle getValueDest(Value &V);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000153
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000154 /// getLink - This method is used to return the specified link in the
155 /// specified node if one exists. If a link does not already exist (it's
Chris Lattner7e51c872002-10-31 06:52:26 +0000156 /// null), then we create a new node, link it, then return it.
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000157 ///
Chris Lattner7e51c872002-10-31 06:52:26 +0000158 DSNodeHandle &getLink(const DSNodeHandle &Node, unsigned Link = 0);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000159 };
160}
161
Brian Gaeked0fde302003-11-11 22:41:34 +0000162using namespace DS;
163
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000164//===----------------------------------------------------------------------===//
165// DSGraph constructor - Simply use the GraphBuilder to construct the local
166// graph.
Chris Lattner15869aa2003-11-02 22:27:28 +0000167DSGraph::DSGraph(const TargetData &td, Function &F, DSGraph *GG)
168 : GlobalsGraph(GG), TD(td) {
Chris Lattner2a068862002-11-10 06:53:38 +0000169 PrintAuxCalls = false;
Chris Lattner30514192003-07-02 04:37:26 +0000170
171 DEBUG(std::cerr << " [Loc] Calculating graph for: " << F.getName() << "\n");
172
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000173 // Use the graph builder to construct the local version of the graph
Chris Lattner26c4fc32003-09-20 21:48:16 +0000174 GraphBuilder B(F, *this, ReturnNodes[&F], FunctionCalls);
Chris Lattner4fe34612002-11-18 21:44:19 +0000175#ifndef NDEBUG
176 Timer::addPeakMemoryMeasurement();
177#endif
Chris Lattner1a1a85d2003-02-14 04:55:58 +0000178
179 // Remove all integral constants from the scalarmap!
Chris Lattner62482e52004-01-28 09:15:42 +0000180 for (DSScalarMap::iterator I = ScalarMap.begin(); I != ScalarMap.end();)
Chris Lattner02da0322004-01-27 21:51:19 +0000181 if (isa<ConstantIntegral>(I->first))
182 ScalarMap.erase(I++);
183 else
Chris Lattner1a1a85d2003-02-14 04:55:58 +0000184 ++I;
185
Chris Lattnerc420ab62004-02-25 23:31:02 +0000186 // If there are any constant globals referenced in this function, merge their
187 // initializers into the local graph from the globals graph.
188 if (ScalarMap.global_begin() != ScalarMap.global_end()) {
189 ReachabilityCloner RC(*this, *GG, 0);
190
191 for (DSScalarMap::global_iterator I = ScalarMap.global_begin();
192 I != ScalarMap.global_end(); ++I)
193 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(*I))
Chris Lattner76a9eb32004-03-03 23:00:19 +0000194 if (!GV->isExternal() && GV->isConstant())
Chris Lattnerc420ab62004-02-25 23:31:02 +0000195 RC.merge(ScalarMap[GV], GG->ScalarMap[GV]);
196 }
197
Chris Lattner394471f2003-01-23 22:05:33 +0000198 markIncompleteNodes(DSGraph::MarkFormalArgs);
Chris Lattner96517252002-11-09 20:55:24 +0000199
200 // Remove any nodes made dead due to merging...
Chris Lattner394471f2003-01-23 22:05:33 +0000201 removeDeadNodes(DSGraph::KeepUnreachableGlobals);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000202}
203
204
205//===----------------------------------------------------------------------===//
206// Helper method implementations...
207//
208
Chris Lattner92673292002-11-02 00:13:20 +0000209/// getValueDest - Return the DSNode that the actual value points to.
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000210///
Chris Lattner51340062002-11-08 05:00:44 +0000211DSNodeHandle GraphBuilder::getValueDest(Value &Val) {
212 Value *V = &Val;
213 if (V == Constant::getNullValue(V->getType()))
214 return 0; // Null doesn't point to anything, don't add to ScalarMap!
Chris Lattner92673292002-11-02 00:13:20 +0000215
Vikram S. Advebac06222002-12-06 21:17:10 +0000216 DSNodeHandle &NH = ScalarMap[V];
217 if (NH.getNode())
218 return NH; // Already have a node? Just return it...
219
220 // Otherwise we need to create a new node to point to.
221 // Check first for constant expressions that must be traversed to
222 // extract the actual value.
Chris Lattner51340062002-11-08 05:00:44 +0000223 if (Constant *C = dyn_cast<Constant>(V))
224 if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(C)) {
Vikram S. Advebac06222002-12-06 21:17:10 +0000225 return NH = getValueDest(*CPR->getValue());
Chris Lattner51340062002-11-08 05:00:44 +0000226 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
227 if (CE->getOpcode() == Instruction::Cast)
Chris Lattner1e56c542003-02-09 23:04:12 +0000228 NH = getValueDest(*CE->getOperand(0));
229 else if (CE->getOpcode() == Instruction::GetElementPtr) {
Chris Lattner51340062002-11-08 05:00:44 +0000230 visitGetElementPtrInst(*CE);
Chris Lattner62482e52004-01-28 09:15:42 +0000231 DSScalarMap::iterator I = ScalarMap.find(CE);
Chris Lattner2cfbaaf2002-11-09 20:14:03 +0000232 assert(I != ScalarMap.end() && "GEP didn't get processed right?");
Chris Lattner1e56c542003-02-09 23:04:12 +0000233 NH = I->second;
234 } else {
235 // This returns a conservative unknown node for any unhandled ConstExpr
Chris Lattnerbd92b732003-06-19 21:15:11 +0000236 return NH = createNode()->setUnknownNodeMarker();
Chris Lattner51340062002-11-08 05:00:44 +0000237 }
Chris Lattner1e56c542003-02-09 23:04:12 +0000238 if (NH.getNode() == 0) { // (getelementptr null, X) returns null
239 ScalarMap.erase(V);
240 return 0;
241 }
242 return NH;
Chris Lattner51340062002-11-08 05:00:44 +0000243
Chris Lattner51340062002-11-08 05:00:44 +0000244 } else if (ConstantIntegral *CI = dyn_cast<ConstantIntegral>(C)) {
245 // Random constants are unknown mem
Chris Lattnerbd92b732003-06-19 21:15:11 +0000246 return NH = createNode()->setUnknownNodeMarker();
Chris Lattner51340062002-11-08 05:00:44 +0000247 } else {
248 assert(0 && "Unknown constant type!");
249 }
250
Chris Lattner92673292002-11-02 00:13:20 +0000251 // Otherwise we need to create a new node to point to...
252 DSNode *N;
Chris Lattner51340062002-11-08 05:00:44 +0000253 if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
Chris Lattner92673292002-11-02 00:13:20 +0000254 // Create a new global node for this global variable...
Chris Lattnerbd92b732003-06-19 21:15:11 +0000255 N = createNode(GV->getType()->getElementType());
Chris Lattner92673292002-11-02 00:13:20 +0000256 N->addGlobal(GV);
257 } else {
258 // Otherwise just create a shadow node
Chris Lattnerbd92b732003-06-19 21:15:11 +0000259 N = createNode();
Chris Lattner92673292002-11-02 00:13:20 +0000260 }
261
262 NH.setNode(N); // Remember that we are pointing to it...
263 NH.setOffset(0);
264 return NH;
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000265}
266
Chris Lattner0d9bab82002-07-18 00:12:30 +0000267
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000268/// getLink - This method is used to return the specified link in the
269/// specified node if one exists. If a link does not already exist (it's
270/// null), then we create a new node, link it, then return it. We must
271/// specify the type of the Node field we are accessing so that we know what
272/// type should be linked to if we need to create a new node.
273///
Chris Lattner7e51c872002-10-31 06:52:26 +0000274DSNodeHandle &GraphBuilder::getLink(const DSNodeHandle &node, unsigned LinkNo) {
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000275 DSNodeHandle &Node = const_cast<DSNodeHandle&>(node);
Chris Lattner08db7192002-11-06 06:20:27 +0000276 DSNodeHandle &Link = Node.getLink(LinkNo);
277 if (!Link.getNode()) {
278 // If the link hasn't been created yet, make and return a new shadow node
Chris Lattnerbd92b732003-06-19 21:15:11 +0000279 Link = createNode();
Chris Lattner08db7192002-11-06 06:20:27 +0000280 }
281 return Link;
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000282}
283
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000284
Chris Lattnerc875f022002-11-03 21:27:48 +0000285/// setDestTo - Set the ScalarMap entry for the specified value to point to the
Chris Lattner92673292002-11-02 00:13:20 +0000286/// specified destination. If the Value already points to a node, make sure to
287/// merge the two destinations together.
288///
289void GraphBuilder::setDestTo(Value &V, const DSNodeHandle &NH) {
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000290 ScalarMap[&V].mergeWith(NH);
Chris Lattner92673292002-11-02 00:13:20 +0000291}
292
293
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000294//===----------------------------------------------------------------------===//
295// Specific instruction type handler implementations...
296//
297
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000298/// Alloca & Malloc instruction implementation - Simply create a new memory
299/// object, pointing the scalar to it.
300///
Chris Lattnerbd92b732003-06-19 21:15:11 +0000301void GraphBuilder::handleAlloc(AllocationInst &AI, bool isHeap) {
302 DSNode *N = createNode();
303 if (isHeap)
304 N->setHeapNodeMarker();
305 else
306 N->setAllocaNodeMarker();
307 setDestTo(AI, N);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000308}
309
310// PHINode - Make the scalar for the PHI node point to all of the things the
311// incoming values point to... which effectively causes them to be merged.
312//
313void GraphBuilder::visitPHINode(PHINode &PN) {
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000314 if (!isPointerType(PN.getType())) return; // Only pointer PHIs
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000315
Chris Lattnerc875f022002-11-03 21:27:48 +0000316 DSNodeHandle &PNDest = ScalarMap[&PN];
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000317 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
Chris Lattner92673292002-11-02 00:13:20 +0000318 PNDest.mergeWith(getValueDest(*PN.getIncomingValue(i)));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000319}
320
Chris Lattner51340062002-11-08 05:00:44 +0000321void GraphBuilder::visitGetElementPtrInst(User &GEP) {
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000322 DSNodeHandle Value = getValueDest(*GEP.getOperand(0));
Chris Lattner92673292002-11-02 00:13:20 +0000323 if (Value.getNode() == 0) return;
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000324
Chris Lattner179bc7d2003-11-14 17:09:46 +0000325 // As a special case, if all of the index operands of GEP are constant zeros,
326 // handle this just like we handle casts (ie, don't do much).
327 bool AllZeros = true;
328 for (unsigned i = 1, e = GEP.getNumOperands(); i != e; ++i)
329 if (GEP.getOperand(i) !=
330 Constant::getNullValue(GEP.getOperand(i)->getType())) {
331 AllZeros = false;
332 break;
333 }
334
335 // If all of the indices are zero, the result points to the operand without
336 // applying the type.
337 if (AllZeros) {
338 setDestTo(GEP, Value);
339 return;
340 }
341
342
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000343 const PointerType *PTy = cast<PointerType>(GEP.getOperand(0)->getType());
344 const Type *CurTy = PTy->getElementType();
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000345
Chris Lattner08db7192002-11-06 06:20:27 +0000346 if (Value.getNode()->mergeTypeInfo(CurTy, Value.getOffset())) {
347 // If the node had to be folded... exit quickly
Chris Lattner92673292002-11-02 00:13:20 +0000348 setDestTo(GEP, Value); // GEP result points to folded node
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000349 return;
350 }
351
Chris Lattner15869aa2003-11-02 22:27:28 +0000352 const TargetData &TD = Value.getNode()->getTargetData();
353
Chris Lattner08db7192002-11-06 06:20:27 +0000354#if 0
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000355 // Handle the pointer index specially...
356 if (GEP.getNumOperands() > 1 &&
Chris Lattner28977af2004-04-05 01:30:19 +0000357 (!isa<Constant>(GEP.getOperand(1)) ||
358 !cast<Constant>(GEP.getOperand(1))->isNullValue())) {
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000359
360 // If we already know this is an array being accessed, don't do anything...
361 if (!TopTypeRec.isArray) {
362 TopTypeRec.isArray = true;
363
364 // If we are treating some inner field pointer as an array, fold the node
365 // up because we cannot handle it right. This can come because of
366 // something like this: &((&Pt->X)[1]) == &Pt->Y
367 //
368 if (Value.getOffset()) {
369 // Value is now the pointer we want to GEP to be...
370 Value.getNode()->foldNodeCompletely();
Chris Lattner92673292002-11-02 00:13:20 +0000371 setDestTo(GEP, Value); // GEP result points to folded node
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000372 return;
373 } else {
374 // This is a pointer to the first byte of the node. Make sure that we
375 // are pointing to the outter most type in the node.
376 // FIXME: We need to check one more case here...
377 }
378 }
379 }
Chris Lattner08db7192002-11-06 06:20:27 +0000380#endif
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000381
382 // All of these subscripts are indexing INTO the elements we have...
Chris Lattner26c4fc32003-09-20 21:48:16 +0000383 unsigned Offset = 0;
Chris Lattnerfa3711a2003-11-25 20:19:55 +0000384 for (gep_type_iterator I = gep_type_begin(GEP), E = gep_type_end(GEP);
385 I != E; ++I)
386 if (const StructType *STy = dyn_cast<StructType>(*I)) {
387 unsigned FieldNo = cast<ConstantUInt>(I.getOperand())->getValue();
388 Offset += TD.getStructLayout(STy)->MemberOffsets[FieldNo];
Chris Lattner82e9d722004-03-01 19:02:54 +0000389 } else if (const PointerType *PTy = dyn_cast<PointerType>(*I)) {
390 if (!isa<Constant>(I.getOperand()) ||
391 !cast<Constant>(I.getOperand())->isNullValue())
392 Value.getNode()->setArrayMarker();
Chris Lattnerfa3711a2003-11-25 20:19:55 +0000393 }
394
395
Chris Lattner08db7192002-11-06 06:20:27 +0000396#if 0
Chris Lattnerfa3711a2003-11-25 20:19:55 +0000397 if (const SequentialType *STy = cast<SequentialType>(*I)) {
398 CurTy = STy->getElementType();
Chris Lattnere03f32b2002-10-02 06:24:36 +0000399 if (ConstantSInt *CS = dyn_cast<ConstantSInt>(GEP.getOperand(i))) {
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000400 Offset += CS->getValue()*TD.getTypeSize(CurTy);
Chris Lattnere03f32b2002-10-02 06:24:36 +0000401 } else {
402 // Variable index into a node. We must merge all of the elements of the
403 // sequential type here.
404 if (isa<PointerType>(STy))
405 std::cerr << "Pointer indexing not handled yet!\n";
406 else {
407 const ArrayType *ATy = cast<ArrayType>(STy);
408 unsigned ElSize = TD.getTypeSize(CurTy);
409 DSNode *N = Value.getNode();
410 assert(N && "Value must have a node!");
411 unsigned RawOffset = Offset+Value.getOffset();
412
413 // Loop over all of the elements of the array, merging them into the
Misha Brukman2f2d0652003-09-11 18:14:24 +0000414 // zeroth element.
Chris Lattnere03f32b2002-10-02 06:24:36 +0000415 for (unsigned i = 1, e = ATy->getNumElements(); i != e; ++i)
416 // Merge all of the byte components of this array element
417 for (unsigned j = 0; j != ElSize; ++j)
418 N->mergeIndexes(RawOffset+j, RawOffset+i*ElSize+j);
419 }
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000420 }
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000421 }
Chris Lattnerfa3711a2003-11-25 20:19:55 +0000422#endif
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000423
424 // Add in the offset calculated...
425 Value.setOffset(Value.getOffset()+Offset);
426
427 // Value is now the pointer we want to GEP to be...
Chris Lattner92673292002-11-02 00:13:20 +0000428 setDestTo(GEP, Value);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000429}
430
431void GraphBuilder::visitLoadInst(LoadInst &LI) {
Chris Lattner92673292002-11-02 00:13:20 +0000432 DSNodeHandle Ptr = getValueDest(*LI.getOperand(0));
433 if (Ptr.getNode() == 0) return;
434
435 // Make that the node is read from...
Chris Lattnerbd92b732003-06-19 21:15:11 +0000436 Ptr.getNode()->setReadMarker();
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000437
438 // Ensure a typerecord exists...
Chris Lattner088b6392003-03-03 17:13:31 +0000439 Ptr.getNode()->mergeTypeInfo(LI.getType(), Ptr.getOffset(), false);
Chris Lattner92673292002-11-02 00:13:20 +0000440
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000441 if (isPointerType(LI.getType()))
Chris Lattner92673292002-11-02 00:13:20 +0000442 setDestTo(LI, getLink(Ptr));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000443}
444
445void GraphBuilder::visitStoreInst(StoreInst &SI) {
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000446 const Type *StoredTy = SI.getOperand(0)->getType();
Chris Lattner92673292002-11-02 00:13:20 +0000447 DSNodeHandle Dest = getValueDest(*SI.getOperand(1));
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000448 if (Dest.isNull()) return;
Chris Lattner92673292002-11-02 00:13:20 +0000449
Vikram S. Advebac06222002-12-06 21:17:10 +0000450 // Mark that the node is written to...
Chris Lattnerbd92b732003-06-19 21:15:11 +0000451 Dest.getNode()->setModifiedMarker();
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000452
Chris Lattner26c4fc32003-09-20 21:48:16 +0000453 // Ensure a type-record exists...
Chris Lattner08db7192002-11-06 06:20:27 +0000454 Dest.getNode()->mergeTypeInfo(StoredTy, Dest.getOffset());
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000455
456 // Avoid adding edges from null, or processing non-"pointer" stores
Chris Lattner92673292002-11-02 00:13:20 +0000457 if (isPointerType(StoredTy))
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000458 Dest.addEdgeTo(getValueDest(*SI.getOperand(0)));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000459}
460
461void GraphBuilder::visitReturnInst(ReturnInst &RI) {
Chris Lattner92673292002-11-02 00:13:20 +0000462 if (RI.getNumOperands() && isPointerType(RI.getOperand(0)->getType()))
Chris Lattner26c4fc32003-09-20 21:48:16 +0000463 RetNode->mergeWith(getValueDest(*RI.getOperand(0)));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000464}
465
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000466void GraphBuilder::visitVANextInst(VANextInst &I) {
467 getValueDest(*I.getOperand(0)).mergeWith(getValueDest(I));
468}
469
470void GraphBuilder::visitVAArgInst(VAArgInst &I) {
471 DSNodeHandle Ptr = getValueDest(*I.getOperand(0));
472 if (Ptr.isNull()) return;
473
474 // Make that the node is read from.
475 Ptr.getNode()->setReadMarker();
476
477 // Ensure a typerecord exists...
478 Ptr.getNode()->mergeTypeInfo(I.getType(), Ptr.getOffset(), false);
479
480 if (isPointerType(I.getType()))
481 setDestTo(I, getLink(Ptr));
482}
483
484
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000485void GraphBuilder::visitCallInst(CallInst &CI) {
Chris Lattner808a7ae2003-09-20 16:34:13 +0000486 visitCallSite(&CI);
487}
488
489void GraphBuilder::visitInvokeInst(InvokeInst &II) {
490 visitCallSite(&II);
491}
492
493void GraphBuilder::visitCallSite(CallSite CS) {
Chris Lattnercb582402004-02-26 22:07:22 +0000494 Value *Callee = CS.getCalledValue();
495 if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(Callee))
496 Callee = CPR->getValue();
497
Chris Lattner894263b2003-09-20 16:50:46 +0000498 // Special case handling of certain libc allocation functions here.
Chris Lattnercb582402004-02-26 22:07:22 +0000499 if (Function *F = dyn_cast<Function>(Callee))
Chris Lattner894263b2003-09-20 16:50:46 +0000500 if (F->isExternal())
Chris Lattnera07b72f2004-02-13 16:09:54 +0000501 switch (F->getIntrinsicID()) {
Chris Lattner317201d2004-03-13 00:24:00 +0000502 case Intrinsic::vastart:
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000503 getValueDest(*CS.getInstruction()).getNode()->setAllocaNodeMarker();
504 return;
Chris Lattner317201d2004-03-13 00:24:00 +0000505 case Intrinsic::vacopy:
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000506 getValueDest(*CS.getInstruction()).
507 mergeWith(getValueDest(**(CS.arg_begin())));
508 return;
Chris Lattner317201d2004-03-13 00:24:00 +0000509 case Intrinsic::vaend:
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000510 return; // noop
Chris Lattnera07b72f2004-02-13 16:09:54 +0000511 case Intrinsic::memmove:
512 case Intrinsic::memcpy: {
513 // Merge the first & second arguments, and mark the memory read and
Chris Lattnerfb8c6102003-11-08 21:55:50 +0000514 // modified.
Chris Lattnera07b72f2004-02-13 16:09:54 +0000515 DSNodeHandle RetNH = getValueDest(**CS.arg_begin());
Chris Lattner67ce57a2003-11-09 03:32:52 +0000516 RetNH.mergeWith(getValueDest(**(CS.arg_begin()+1)));
517 if (DSNode *N = RetNH.getNode())
518 N->setModifiedMarker()->setReadMarker();
519 return;
Chris Lattnera07b72f2004-02-13 16:09:54 +0000520 }
Chris Lattnereee33b22004-02-16 18:37:40 +0000521 case Intrinsic::memset:
522 // Mark the memory modified.
523 if (DSNode *N = getValueDest(**CS.arg_begin()).getNode())
524 N->setModifiedMarker();
525 return;
Chris Lattnera07b72f2004-02-13 16:09:54 +0000526 default:
Vikram S. Advee4e97ef2004-05-25 08:14:52 +0000527 if (F->getName() == "calloc" || F->getName() == "posix_memalign" ||
528 F->getName() == "memalign" || F->getName() == "valloc") {
Chris Lattnera07b72f2004-02-13 16:09:54 +0000529 setDestTo(*CS.getInstruction(),
530 createNode()->setHeapNodeMarker()->setModifiedMarker());
531 return;
532 } else if (F->getName() == "realloc") {
533 DSNodeHandle RetNH = getValueDest(*CS.getInstruction());
534 RetNH.mergeWith(getValueDest(**CS.arg_begin()));
535 if (DSNode *N = RetNH.getNode())
536 N->setHeapNodeMarker()->setModifiedMarker()->setReadMarker();
537 return;
Chris Lattner1fe98742004-02-26 03:43:08 +0000538 } else if (F->getName() == "memmove") {
539 // Merge the first & second arguments, and mark the memory read and
540 // modified.
541 DSNodeHandle RetNH = getValueDest(**CS.arg_begin());
542 RetNH.mergeWith(getValueDest(**(CS.arg_begin()+1)));
543 if (DSNode *N = RetNH.getNode())
544 N->setModifiedMarker()->setReadMarker();
545 return;
546
Chris Lattnerd5612092004-02-24 22:02:48 +0000547 } else if (F->getName() == "atoi" || F->getName() == "atof" ||
Chris Lattneradc1efe2004-02-25 17:43:20 +0000548 F->getName() == "atol" || F->getName() == "atoll" ||
Chris Lattner39bb2dc2004-02-24 22:17:00 +0000549 F->getName() == "remove" || F->getName() == "unlink" ||
Chris Lattneradc1efe2004-02-25 17:43:20 +0000550 F->getName() == "rename" || F->getName() == "memcmp" ||
551 F->getName() == "strcmp" || F->getName() == "strncmp" ||
552 F->getName() == "execl" || F->getName() == "execlp" ||
553 F->getName() == "execle" || F->getName() == "execv" ||
Chris Lattner52fc8d72004-02-25 23:06:40 +0000554 F->getName() == "execvp" || F->getName() == "chmod" ||
555 F->getName() == "puts" || F->getName() == "write" ||
556 F->getName() == "open" || F->getName() == "create" ||
557 F->getName() == "truncate" || F->getName() == "chdir" ||
558 F->getName() == "mkdir" || F->getName() == "rmdir") {
Chris Lattner39bb2dc2004-02-24 22:17:00 +0000559 // These functions read all of their pointer operands.
560 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
561 AI != E; ++AI) {
562 if (isPointerType((*AI)->getType()))
563 if (DSNode *N = getValueDest(**AI).getNode())
564 N->setReadMarker();
565 }
Chris Lattner304e1432004-02-16 22:57:19 +0000566 return;
Chris Lattner52fc8d72004-02-25 23:06:40 +0000567 } else if (F->getName() == "read" || F->getName() == "pipe" ||
Chris Lattner6b586df2004-02-27 20:04:48 +0000568 F->getName() == "wait" || F->getName() == "time") {
Chris Lattner52fc8d72004-02-25 23:06:40 +0000569 // These functions write all of their pointer operands.
570 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
571 AI != E; ++AI) {
572 if (isPointerType((*AI)->getType()))
573 if (DSNode *N = getValueDest(**AI).getNode())
574 N->setModifiedMarker();
575 }
576 return;
Chris Lattneradc1efe2004-02-25 17:43:20 +0000577 } else if (F->getName() == "stat" || F->getName() == "fstat" ||
578 F->getName() == "lstat") {
579 // These functions read their first operand if its a pointer.
580 CallSite::arg_iterator AI = CS.arg_begin();
581 if (isPointerType((*AI)->getType())) {
582 DSNodeHandle Path = getValueDest(**AI);
583 if (DSNode *N = Path.getNode()) N->setReadMarker();
584 }
Chris Lattner304e1432004-02-16 22:57:19 +0000585
Chris Lattneradc1efe2004-02-25 17:43:20 +0000586 // Then they write into the stat buffer.
587 DSNodeHandle StatBuf = getValueDest(**++AI);
588 if (DSNode *N = StatBuf.getNode()) {
589 N->setModifiedMarker();
590 const Type *StatTy = F->getFunctionType()->getParamType(1);
591 if (const PointerType *PTy = dyn_cast<PointerType>(StatTy))
592 N->mergeTypeInfo(PTy->getElementType(), StatBuf.getOffset());
593 }
Chris Lattneradc1efe2004-02-25 17:43:20 +0000594 return;
Chris Lattner3aeb40c2004-03-04 21:03:54 +0000595 } else if (F->getName() == "strtod" || F->getName() == "strtof" ||
596 F->getName() == "strtold") {
597 // These functions read the first pointer
598 if (DSNode *Str = getValueDest(**CS.arg_begin()).getNode()) {
599 Str->setReadMarker();
600 // If the second parameter is passed, it will point to the first
601 // argument node.
602 const DSNodeHandle &EndPtrNH = getValueDest(**(CS.arg_begin()+1));
603 if (DSNode *End = EndPtrNH.getNode()) {
604 End->mergeTypeInfo(PointerType::get(Type::SByteTy),
605 EndPtrNH.getOffset(), false);
606 End->setModifiedMarker();
607 DSNodeHandle &Link = getLink(EndPtrNH);
608 Link.mergeWith(getValueDest(**CS.arg_begin()));
609 }
610 }
611
612 return;
Chris Lattner6b586df2004-02-27 20:04:48 +0000613 } else if (F->getName() == "fopen" || F->getName() == "fdopen" ||
614 F->getName() == "freopen") {
615 // These functions read all of their pointer operands.
616 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
617 AI != E; ++AI)
618 if (isPointerType((*AI)->getType()))
619 if (DSNode *N = getValueDest(**AI).getNode())
620 N->setReadMarker();
Chris Lattner68300db2004-02-13 20:05:32 +0000621
622 // fopen allocates in an unknown way and writes to the file
623 // descriptor. Also, merge the allocated type into the node.
624 DSNodeHandle Result = getValueDest(*CS.getInstruction());
Chris Lattnerd5612092004-02-24 22:02:48 +0000625 if (DSNode *N = Result.getNode()) {
626 N->setModifiedMarker()->setUnknownNodeMarker();
627 const Type *RetTy = F->getFunctionType()->getReturnType();
628 if (const PointerType *PTy = dyn_cast<PointerType>(RetTy))
629 N->mergeTypeInfo(PTy->getElementType(), Result.getOffset());
630 }
Chris Lattner6b586df2004-02-27 20:04:48 +0000631
632 // If this is freopen, merge the file descriptor passed in with the
633 // result.
Chris Lattnera19ba522004-03-02 20:46:18 +0000634 if (F->getName() == "freopen")
635 Result.mergeWith(getValueDest(**--CS.arg_end()));
Chris Lattner6b586df2004-02-27 20:04:48 +0000636
Chris Lattnerd5612092004-02-24 22:02:48 +0000637 return;
Chris Lattner68300db2004-02-13 20:05:32 +0000638 } else if (F->getName() == "fclose" && CS.arg_end()-CS.arg_begin() ==1){
639 // fclose reads and deallocates the memory in an unknown way for the
640 // file descriptor. It merges the FILE type into the descriptor.
641 DSNodeHandle H = getValueDest(**CS.arg_begin());
Chris Lattnerd5612092004-02-24 22:02:48 +0000642 if (DSNode *N = H.getNode()) {
643 N->setReadMarker()->setUnknownNodeMarker();
644 const Type *ArgTy = F->getFunctionType()->getParamType(0);
645 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
646 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
647 }
Chris Lattner68300db2004-02-13 20:05:32 +0000648 return;
Chris Lattner304e1432004-02-16 22:57:19 +0000649 } else if (CS.arg_end()-CS.arg_begin() == 1 &&
650 (F->getName() == "fflush" || F->getName() == "feof" ||
651 F->getName() == "fileno" || F->getName() == "clearerr" ||
Chris Lattner52fc8d72004-02-25 23:06:40 +0000652 F->getName() == "rewind" || F->getName() == "ftell" ||
Chris Lattner6b586df2004-02-27 20:04:48 +0000653 F->getName() == "ferror" || F->getName() == "fgetc" ||
654 F->getName() == "fgetc" || F->getName() == "_IO_getc")) {
Chris Lattner304e1432004-02-16 22:57:19 +0000655 // fflush reads and writes the memory for the file descriptor. It
Chris Lattner339d8df2004-02-13 21:21:48 +0000656 // merges the FILE type into the descriptor.
657 DSNodeHandle H = getValueDest(**CS.arg_begin());
Chris Lattnerd5612092004-02-24 22:02:48 +0000658 if (DSNode *N = H.getNode()) {
659 N->setReadMarker()->setModifiedMarker();
Chris Lattner339d8df2004-02-13 21:21:48 +0000660
Chris Lattnerd5612092004-02-24 22:02:48 +0000661 const Type *ArgTy = F->getFunctionType()->getParamType(0);
662 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
663 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
664 }
665 return;
666 } else if (CS.arg_end()-CS.arg_begin() == 4 &&
667 (F->getName() == "fwrite" || F->getName() == "fread")) {
668 // fread writes the first operand, fwrite reads it. They both
669 // read/write the FILE descriptor, and merges the FILE type.
670 DSNodeHandle H = getValueDest(**--CS.arg_end());
671 if (DSNode *N = H.getNode()) {
672 N->setReadMarker()->setModifiedMarker();
673 const Type *ArgTy = F->getFunctionType()->getParamType(3);
674 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
675 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
676 }
677
678 H = getValueDest(**CS.arg_begin());
679 if (DSNode *N = H.getNode())
680 if (F->getName() == "fwrite")
681 N->setReadMarker();
682 else
683 N->setModifiedMarker();
Chris Lattner339d8df2004-02-13 21:21:48 +0000684 return;
685 } else if (F->getName() == "fgets" && CS.arg_end()-CS.arg_begin() == 3){
Chris Lattner304e1432004-02-16 22:57:19 +0000686 // fgets reads and writes the memory for the file descriptor. It
Chris Lattner339d8df2004-02-13 21:21:48 +0000687 // merges the FILE type into the descriptor, and writes to the
688 // argument. It returns the argument as well.
689 CallSite::arg_iterator AI = CS.arg_begin();
690 DSNodeHandle H = getValueDest(**AI);
691 if (DSNode *N = H.getNode())
692 N->setModifiedMarker(); // Writes buffer
693 H.mergeWith(getValueDest(*CS.getInstruction())); // Returns buffer
694 ++AI; ++AI;
695
696 // Reads and writes file descriptor, merge in FILE type.
Chris Lattneradc1efe2004-02-25 17:43:20 +0000697 H = getValueDest(**AI);
Chris Lattnerd5612092004-02-24 22:02:48 +0000698 if (DSNode *N = H.getNode()) {
Chris Lattner339d8df2004-02-13 21:21:48 +0000699 N->setReadMarker()->setModifiedMarker();
Chris Lattneradc1efe2004-02-25 17:43:20 +0000700 const Type *ArgTy = F->getFunctionType()->getParamType(2);
701 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
702 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
703 }
704 return;
Chris Lattner52fc8d72004-02-25 23:06:40 +0000705 } else if (F->getName() == "ungetc" || F->getName() == "fputc" ||
706 F->getName() == "fputs" || F->getName() == "putc" ||
Chris Lattner6b586df2004-02-27 20:04:48 +0000707 F->getName() == "ftell" || F->getName() == "rewind" ||
708 F->getName() == "_IO_putc") {
709 // These functions read and write the memory for the file descriptor,
710 // which is passes as the last argument.
Chris Lattneradc1efe2004-02-25 17:43:20 +0000711 DSNodeHandle H = getValueDest(**--CS.arg_end());
712 if (DSNode *N = H.getNode()) {
713 N->setReadMarker()->setModifiedMarker();
Chris Lattner52fc8d72004-02-25 23:06:40 +0000714 const Type *ArgTy = *--F->getFunctionType()->param_end();
Chris Lattnerd5612092004-02-24 22:02:48 +0000715 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
716 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
717 }
Chris Lattner52fc8d72004-02-25 23:06:40 +0000718
719 // Any pointer arguments are read.
720 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
721 AI != E; ++AI)
722 if (isPointerType((*AI)->getType()))
723 if (DSNode *N = getValueDest(**AI).getNode())
724 N->setReadMarker();
725 return;
726 } else if (F->getName() == "fseek" || F->getName() == "fgetpos" ||
727 F->getName() == "fsetpos") {
728 // These functions read and write the memory for the file descriptor,
729 // and read/write all other arguments.
730 DSNodeHandle H = getValueDest(**CS.arg_begin());
731 if (DSNode *N = H.getNode()) {
732 const Type *ArgTy = *--F->getFunctionType()->param_end();
733 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
734 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
735 }
736
737 // Any pointer arguments are read.
738 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
739 AI != E; ++AI)
740 if (isPointerType((*AI)->getType()))
741 if (DSNode *N = getValueDest(**AI).getNode())
742 N->setReadMarker()->setModifiedMarker();
Chris Lattner339d8df2004-02-13 21:21:48 +0000743 return;
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000744 } else if (F->getName() == "printf" || F->getName() == "fprintf" ||
745 F->getName() == "sprintf") {
Chris Lattner339d8df2004-02-13 21:21:48 +0000746 CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
747
748 if (F->getName() == "fprintf") {
749 // fprintf reads and writes the FILE argument, and applies the type
750 // to it.
751 DSNodeHandle H = getValueDest(**AI);
752 if (DSNode *N = H.getNode()) {
753 N->setModifiedMarker();
754 const Type *ArgTy = (*AI)->getType();
755 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
756 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
757 }
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000758 } else if (F->getName() == "sprintf") {
759 // sprintf writes the first string argument.
760 DSNodeHandle H = getValueDest(**AI++);
761 if (DSNode *N = H.getNode()) {
762 N->setModifiedMarker();
763 const Type *ArgTy = (*AI)->getType();
764 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
765 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
766 }
Chris Lattner339d8df2004-02-13 21:21:48 +0000767 }
768
769 for (; AI != E; ++AI) {
770 // printf reads all pointer arguments.
771 if (isPointerType((*AI)->getType()))
772 if (DSNode *N = getValueDest(**AI).getNode())
773 N->setReadMarker();
774 }
Chris Lattner4e46e322004-02-20 23:27:09 +0000775 return;
Chris Lattner3aeb40c2004-03-04 21:03:54 +0000776 } else if (F->getName() == "vprintf" || F->getName() == "vfprintf" ||
777 F->getName() == "vsprintf") {
778 CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
779
780 if (F->getName() == "vfprintf") {
781 // ffprintf reads and writes the FILE argument, and applies the type
782 // to it.
783 DSNodeHandle H = getValueDest(**AI);
784 if (DSNode *N = H.getNode()) {
785 N->setModifiedMarker()->setReadMarker();
786 const Type *ArgTy = (*AI)->getType();
787 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
788 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
789 }
790 ++AI;
791 } else if (F->getName() == "vsprintf") {
792 // vsprintf writes the first string argument.
793 DSNodeHandle H = getValueDest(**AI++);
794 if (DSNode *N = H.getNode()) {
795 N->setModifiedMarker();
796 const Type *ArgTy = (*AI)->getType();
797 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
798 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
799 }
800 }
801
802 // Read the format
803 if (AI != E) {
804 if (isPointerType((*AI)->getType()))
805 if (DSNode *N = getValueDest(**AI).getNode())
806 N->setReadMarker();
807 ++AI;
808 }
809
810 // Read the valist, and the pointed-to objects.
811 if (AI != E && isPointerType((*AI)->getType())) {
812 const DSNodeHandle &VAList = getValueDest(**AI);
813 if (DSNode *N = VAList.getNode()) {
814 N->setReadMarker();
815 N->mergeTypeInfo(PointerType::get(Type::SByteTy),
816 VAList.getOffset(), false);
817
818 DSNodeHandle &VAListObjs = getLink(VAList);
819 VAListObjs.getNode()->setReadMarker();
820 }
821 }
822
823 return;
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000824 } else if (F->getName() == "scanf" || F->getName() == "fscanf" ||
825 F->getName() == "sscanf") {
826 CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
Chris Lattner339d8df2004-02-13 21:21:48 +0000827
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000828 if (F->getName() == "fscanf") {
829 // fscanf reads and writes the FILE argument, and applies the type
830 // to it.
831 DSNodeHandle H = getValueDest(**AI);
832 if (DSNode *N = H.getNode()) {
833 N->setReadMarker();
834 const Type *ArgTy = (*AI)->getType();
835 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
836 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
837 }
838 } else if (F->getName() == "sscanf") {
839 // sscanf reads the first string argument.
840 DSNodeHandle H = getValueDest(**AI++);
841 if (DSNode *N = H.getNode()) {
842 N->setReadMarker();
843 const Type *ArgTy = (*AI)->getType();
844 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
845 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
846 }
847 }
848
849 for (; AI != E; ++AI) {
850 // scanf writes all pointer arguments.
851 if (isPointerType((*AI)->getType()))
852 if (DSNode *N = getValueDest(**AI).getNode())
853 N->setModifiedMarker();
854 }
Chris Lattner4e46e322004-02-20 23:27:09 +0000855 return;
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000856 } else if (F->getName() == "strtok") {
857 // strtok reads and writes the first argument, returning it. It reads
858 // its second arg. FIXME: strtok also modifies some hidden static
859 // data. Someday this might matter.
860 CallSite::arg_iterator AI = CS.arg_begin();
861 DSNodeHandle H = getValueDest(**AI++);
862 if (DSNode *N = H.getNode()) {
863 N->setReadMarker()->setModifiedMarker(); // Reads/Writes buffer
864 const Type *ArgTy = F->getFunctionType()->getParamType(0);
865 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
866 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
867 }
868 H.mergeWith(getValueDest(*CS.getInstruction())); // Returns buffer
869
870 H = getValueDest(**AI); // Reads delimiter
871 if (DSNode *N = H.getNode()) {
872 N->setReadMarker();
873 const Type *ArgTy = F->getFunctionType()->getParamType(1);
874 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
875 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
876 }
877 return;
Chris Lattner1fe98742004-02-26 03:43:08 +0000878 } else if (F->getName() == "strchr" || F->getName() == "strrchr" ||
879 F->getName() == "strstr") {
880 // These read their arguments, and return the first one
Chris Lattneradc1efe2004-02-25 17:43:20 +0000881 DSNodeHandle H = getValueDest(**CS.arg_begin());
Chris Lattner1fe98742004-02-26 03:43:08 +0000882 H.mergeWith(getValueDest(*CS.getInstruction())); // Returns buffer
883
884 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
885 AI != E; ++AI)
886 if (isPointerType((*AI)->getType()))
887 if (DSNode *N = getValueDest(**AI).getNode())
888 N->setReadMarker();
889
Chris Lattneradc1efe2004-02-25 17:43:20 +0000890 if (DSNode *N = H.getNode())
891 N->setReadMarker();
Chris Lattneradc1efe2004-02-25 17:43:20 +0000892 return;
Chris Lattner52fc8d72004-02-25 23:06:40 +0000893 } else if (F->getName() == "modf" && CS.arg_end()-CS.arg_begin() == 2) {
894 // This writes its second argument, and forces it to double.
895 DSNodeHandle H = getValueDest(**--CS.arg_end());
896 if (DSNode *N = H.getNode()) {
897 N->setModifiedMarker();
898 N->mergeTypeInfo(Type::DoubleTy, H.getOffset());
899 }
900 return;
Chris Lattner339d8df2004-02-13 21:21:48 +0000901 } else {
Chris Lattner304e1432004-02-16 22:57:19 +0000902 // Unknown function, warn if it returns a pointer type or takes a
903 // pointer argument.
904 bool Warn = isPointerType(CS.getInstruction()->getType());
905 if (!Warn)
906 for (CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
907 I != E; ++I)
908 if (isPointerType((*I)->getType())) {
909 Warn = true;
910 break;
911 }
912 if (Warn)
913 std::cerr << "WARNING: Call to unknown external function '"
914 << F->getName() << "' will cause pessimistic results!\n";
Chris Lattnera07b72f2004-02-13 16:09:54 +0000915 }
Chris Lattner894263b2003-09-20 16:50:46 +0000916 }
917
918
Chris Lattnerc314ac42002-07-11 20:32:02 +0000919 // Set up the return value...
Chris Lattner0969c502002-10-21 02:08:03 +0000920 DSNodeHandle RetVal;
Chris Lattner808a7ae2003-09-20 16:34:13 +0000921 Instruction *I = CS.getInstruction();
922 if (isPointerType(I->getType()))
923 RetVal = getValueDest(*I);
Chris Lattnerc314ac42002-07-11 20:32:02 +0000924
Chris Lattnercb582402004-02-26 22:07:22 +0000925 DSNode *CalleeNode = 0;
926 if (DisableDirectCallOpt || !isa<Function>(Callee)) {
927 CalleeNode = getValueDest(*Callee).getNode();
928 if (CalleeNode == 0) {
929 std::cerr << "WARNING: Program is calling through a null pointer?\n"<< *I;
Chris Lattnerfbc2d842003-09-24 23:42:58 +0000930 return; // Calling a null pointer?
931 }
932 }
Chris Lattner0d9bab82002-07-18 00:12:30 +0000933
Chris Lattner0969c502002-10-21 02:08:03 +0000934 std::vector<DSNodeHandle> Args;
Chris Lattner808a7ae2003-09-20 16:34:13 +0000935 Args.reserve(CS.arg_end()-CS.arg_begin());
Chris Lattner0969c502002-10-21 02:08:03 +0000936
937 // Calculate the arguments vector...
Chris Lattner808a7ae2003-09-20 16:34:13 +0000938 for (CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end(); I != E; ++I)
939 if (isPointerType((*I)->getType()))
940 Args.push_back(getValueDest(**I));
Chris Lattner0969c502002-10-21 02:08:03 +0000941
942 // Add a new function call entry...
Chris Lattnercb582402004-02-26 22:07:22 +0000943 if (CalleeNode)
944 FunctionCalls->push_back(DSCallSite(CS, RetVal, CalleeNode, Args));
Chris Lattner923fc052003-02-05 21:59:58 +0000945 else
Chris Lattnercb582402004-02-26 22:07:22 +0000946 FunctionCalls->push_back(DSCallSite(CS, RetVal, cast<Function>(Callee),
Chris Lattner26c4fc32003-09-20 21:48:16 +0000947 Args));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000948}
Chris Lattner055dc2c2002-07-18 15:54:42 +0000949
Vikram S. Advebac06222002-12-06 21:17:10 +0000950void GraphBuilder::visitFreeInst(FreeInst &FI) {
Vikram S. Advebac06222002-12-06 21:17:10 +0000951 // Mark that the node is written to...
Chris Lattnerd5612092004-02-24 22:02:48 +0000952 if (DSNode *N = getValueDest(*FI.getOperand(0)).getNode())
953 N->setModifiedMarker()->setHeapNodeMarker();
Vikram S. Advebac06222002-12-06 21:17:10 +0000954}
955
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000956/// Handle casts...
957void GraphBuilder::visitCastInst(CastInst &CI) {
Chris Lattner5af344d2002-11-02 00:36:03 +0000958 if (isPointerType(CI.getType()))
959 if (isPointerType(CI.getOperand(0)->getType())) {
960 // Cast one pointer to the other, just act like a copy instruction
Chris Lattner92673292002-11-02 00:13:20 +0000961 setDestTo(CI, getValueDest(*CI.getOperand(0)));
Chris Lattner5af344d2002-11-02 00:36:03 +0000962 } else {
963 // Cast something (floating point, small integer) to a pointer. We need
964 // to track the fact that the node points to SOMETHING, just something we
965 // don't know about. Make an "Unknown" node.
966 //
Chris Lattnerbd92b732003-06-19 21:15:11 +0000967 setDestTo(CI, createNode()->setUnknownNodeMarker());
Chris Lattner5af344d2002-11-02 00:36:03 +0000968 }
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000969}
Chris Lattner055dc2c2002-07-18 15:54:42 +0000970
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000971
Chris Lattner878e5212003-02-04 00:59:50 +0000972// visitInstruction - For all other instruction types, if we have any arguments
973// that are of pointer type, make them have unknown composition bits, and merge
974// the nodes together.
975void GraphBuilder::visitInstruction(Instruction &Inst) {
976 DSNodeHandle CurNode;
977 if (isPointerType(Inst.getType()))
978 CurNode = getValueDest(Inst);
979 for (User::op_iterator I = Inst.op_begin(), E = Inst.op_end(); I != E; ++I)
980 if (isPointerType((*I)->getType()))
981 CurNode.mergeWith(getValueDest(**I));
982
983 if (CurNode.getNode())
Chris Lattnerbd92b732003-06-19 21:15:11 +0000984 CurNode.getNode()->setUnknownNodeMarker();
Chris Lattner878e5212003-02-04 00:59:50 +0000985}
986
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000987
988
989//===----------------------------------------------------------------------===//
990// LocalDataStructures Implementation
991//===----------------------------------------------------------------------===//
992
Chris Lattner26c4fc32003-09-20 21:48:16 +0000993// MergeConstantInitIntoNode - Merge the specified constant into the node
994// pointed to by NH.
995void GraphBuilder::MergeConstantInitIntoNode(DSNodeHandle &NH, Constant *C) {
996 // Ensure a type-record exists...
997 NH.getNode()->mergeTypeInfo(C->getType(), NH.getOffset());
998
999 if (C->getType()->isFirstClassType()) {
1000 if (isPointerType(C->getType()))
1001 // Avoid adding edges from null, or processing non-"pointer" stores
1002 NH.addEdgeTo(getValueDest(*C));
1003 return;
1004 }
Chris Lattner15869aa2003-11-02 22:27:28 +00001005
1006 const TargetData &TD = NH.getNode()->getTargetData();
1007
Chris Lattner26c4fc32003-09-20 21:48:16 +00001008 if (ConstantArray *CA = dyn_cast<ConstantArray>(C)) {
1009 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
1010 // We don't currently do any indexing for arrays...
1011 MergeConstantInitIntoNode(NH, cast<Constant>(CA->getOperand(i)));
1012 } else if (ConstantStruct *CS = dyn_cast<ConstantStruct>(C)) {
1013 const StructLayout *SL = TD.getStructLayout(CS->getType());
1014 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i) {
1015 DSNodeHandle NewNH(NH.getNode(), NH.getOffset()+SL->MemberOffsets[i]);
1016 MergeConstantInitIntoNode(NewNH, cast<Constant>(CS->getOperand(i)));
1017 }
Chris Lattner896481e2004-02-15 05:53:42 +00001018 } else if (ConstantAggregateZero *CAZ = dyn_cast<ConstantAggregateZero>(C)) {
1019 // Noop
Chris Lattner26c4fc32003-09-20 21:48:16 +00001020 } else {
1021 assert(0 && "Unknown constant type!");
1022 }
1023}
1024
1025void GraphBuilder::mergeInGlobalInitializer(GlobalVariable *GV) {
1026 assert(!GV->isExternal() && "Cannot merge in external global!");
1027 // Get a node handle to the global node and merge the initializer into it.
1028 DSNodeHandle NH = getValueDest(*GV);
1029 MergeConstantInitIntoNode(NH, GV->getInitializer());
1030}
1031
1032
Chris Lattneraa0b4682002-11-09 21:12:07 +00001033bool LocalDataStructures::run(Module &M) {
Chris Lattner15869aa2003-11-02 22:27:28 +00001034 GlobalsGraph = new DSGraph(getAnalysis<TargetData>());
1035
1036 const TargetData &TD = getAnalysis<TargetData>();
Chris Lattneraa0b4682002-11-09 21:12:07 +00001037
Chris Lattnerc420ab62004-02-25 23:31:02 +00001038 {
1039 GraphBuilder GGB(*GlobalsGraph);
1040
1041 // Add initializers for all of the globals to the globals graph...
1042 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
1043 if (!I->isExternal())
1044 GGB.mergeInGlobalInitializer(I);
1045 }
1046
Chris Lattneraa0b4682002-11-09 21:12:07 +00001047 // Calculate all of the graphs...
1048 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
1049 if (!I->isExternal())
Chris Lattner15869aa2003-11-02 22:27:28 +00001050 DSInfo.insert(std::make_pair(I, new DSGraph(TD, *I, GlobalsGraph)));
Chris Lattner26c4fc32003-09-20 21:48:16 +00001051
Chris Lattnerc3f5f772004-02-08 01:51:48 +00001052 GlobalsGraph->removeTriviallyDeadNodes();
Chris Lattner26c4fc32003-09-20 21:48:16 +00001053 GlobalsGraph->markIncompleteNodes(DSGraph::MarkFormalArgs);
Chris Lattneraa0b4682002-11-09 21:12:07 +00001054 return false;
1055}
1056
Chris Lattnerfccd06f2002-10-01 22:33:50 +00001057// releaseMemory - If the pass pipeline is done with this pass, we can release
1058// our memory... here...
1059//
1060void LocalDataStructures::releaseMemory() {
Chris Lattner81d924d2003-06-30 04:53:27 +00001061 for (hash_map<Function*, DSGraph*>::iterator I = DSInfo.begin(),
1062 E = DSInfo.end(); I != E; ++I) {
1063 I->second->getReturnNodes().erase(I->first);
1064 if (I->second->getReturnNodes().empty())
1065 delete I->second;
1066 }
Chris Lattnerfccd06f2002-10-01 22:33:50 +00001067
1068 // Empty map so next time memory is released, data structures are not
1069 // re-deleted.
1070 DSInfo.clear();
Chris Lattner2e4f9bf2002-11-09 20:01:01 +00001071 delete GlobalsGraph;
1072 GlobalsGraph = 0;
Chris Lattnerfccd06f2002-10-01 22:33:50 +00001073}
Brian Gaeked0fde302003-11-11 22:41:34 +00001074