blob: c969cc6621b4afe4c2f5e3c5bec018d5397612d1 [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"
Chris Lattnerfccd06f2002-10-01 22:33:50 +000027
28// FIXME: This should eventually be a FunctionPass that is automatically
29// aggregated into a Pass.
30//
31#include "llvm/Module.h"
32
Chris Lattner9a927292003-11-12 23:11:14 +000033using namespace llvm;
Brian Gaeked0fde302003-11-11 22:41:34 +000034
Chris Lattner97f51a32002-07-27 01:12:15 +000035static RegisterAnalysis<LocalDataStructures>
36X("datastructure", "Local Data Structure Analysis");
Chris Lattner97f51a32002-07-27 01:12:15 +000037
Chris Lattnera1907662003-11-13 03:10:49 +000038static cl::opt<bool>
39TrackIntegersAsPointers("dsa-track-integers",
40 cl::desc("If this is set, track integers as potential pointers"));
Chris Lattnera1907662003-11-13 03:10:49 +000041
Chris Lattner9a927292003-11-12 23:11:14 +000042namespace llvm {
Chris Lattnerb1060432002-11-07 05:20:53 +000043namespace DS {
Chris Lattnerfccd06f2002-10-01 22:33:50 +000044 // isPointerType - Return true if this type is big enough to hold a pointer.
45 bool isPointerType(const Type *Ty) {
46 if (isa<PointerType>(Ty))
47 return true;
Chris Lattnera1907662003-11-13 03:10:49 +000048 else if (TrackIntegersAsPointers && Ty->isPrimitiveType() &&Ty->isInteger())
Chris Lattnerfccd06f2002-10-01 22:33:50 +000049 return Ty->getPrimitiveSize() >= PointerSize;
50 return false;
51 }
Chris Lattner9a927292003-11-12 23:11:14 +000052}}
Chris Lattnerfccd06f2002-10-01 22:33:50 +000053
Brian Gaeked0fde302003-11-11 22:41:34 +000054using namespace DS;
Chris Lattnerc68c31b2002-07-10 22:38:08 +000055
56namespace {
Chris Lattner923fc052003-02-05 21:59:58 +000057 cl::opt<bool>
58 DisableDirectCallOpt("disable-direct-call-dsopt", cl::Hidden,
59 cl::desc("Disable direct call optimization in "
60 "DSGraph construction"));
Chris Lattnerca3f7902003-02-08 20:18:39 +000061 cl::opt<bool>
62 DisableFieldSensitivity("disable-ds-field-sensitivity", cl::Hidden,
63 cl::desc("Disable field sensitivity in DSGraphs"));
Chris Lattner923fc052003-02-05 21:59:58 +000064
Chris Lattnerfccd06f2002-10-01 22:33:50 +000065 //===--------------------------------------------------------------------===//
66 // GraphBuilder Class
67 //===--------------------------------------------------------------------===//
68 //
69 /// This class is the builder class that constructs the local data structure
70 /// graph by performing a single pass over the function in question.
71 ///
Chris Lattnerc68c31b2002-07-10 22:38:08 +000072 class GraphBuilder : InstVisitor<GraphBuilder> {
73 DSGraph &G;
Chris Lattner26c4fc32003-09-20 21:48:16 +000074 DSNodeHandle *RetNode; // Node that gets returned...
Chris Lattner62482e52004-01-28 09:15:42 +000075 DSScalarMap &ScalarMap;
Chris Lattner26c4fc32003-09-20 21:48:16 +000076 std::vector<DSCallSite> *FunctionCalls;
Chris Lattnerc68c31b2002-07-10 22:38:08 +000077
78 public:
Chris Lattner44cfdf92003-07-02 06:06:34 +000079 GraphBuilder(Function &f, DSGraph &g, DSNodeHandle &retNode,
Chris Lattner26c4fc32003-09-20 21:48:16 +000080 std::vector<DSCallSite> &fc)
81 : G(g), RetNode(&retNode), ScalarMap(G.getScalarMap()),
82 FunctionCalls(&fc) {
Chris Lattner0d9bab82002-07-18 00:12:30 +000083
84 // Create scalar nodes for all pointer arguments...
Chris Lattner26c4fc32003-09-20 21:48:16 +000085 for (Function::aiterator I = f.abegin(), E = f.aend(); I != E; ++I)
Chris Lattnerfccd06f2002-10-01 22:33:50 +000086 if (isPointerType(I->getType()))
87 getValueDest(*I);
Chris Lattner0d9bab82002-07-18 00:12:30 +000088
Chris Lattner26c4fc32003-09-20 21:48:16 +000089 visit(f); // Single pass over the function
Chris Lattnerc68c31b2002-07-10 22:38:08 +000090 }
91
Chris Lattner26c4fc32003-09-20 21:48:16 +000092 // GraphBuilder ctor for working on the globals graph
93 GraphBuilder(DSGraph &g)
94 : G(g), RetNode(0), ScalarMap(G.getScalarMap()), FunctionCalls(0) {
95 }
96
97 void mergeInGlobalInitializer(GlobalVariable *GV);
98
Chris Lattnerc68c31b2002-07-10 22:38:08 +000099 private:
100 // Visitor functions, used to handle each instruction type we encounter...
101 friend class InstVisitor<GraphBuilder>;
Chris Lattnerbd92b732003-06-19 21:15:11 +0000102 void visitMallocInst(MallocInst &MI) { handleAlloc(MI, true); }
103 void visitAllocaInst(AllocaInst &AI) { handleAlloc(AI, false); }
104 void handleAlloc(AllocationInst &AI, bool isHeap);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000105
106 void visitPHINode(PHINode &PN);
107
Chris Lattner51340062002-11-08 05:00:44 +0000108 void visitGetElementPtrInst(User &GEP);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000109 void visitReturnInst(ReturnInst &RI);
110 void visitLoadInst(LoadInst &LI);
111 void visitStoreInst(StoreInst &SI);
112 void visitCallInst(CallInst &CI);
Chris Lattner808a7ae2003-09-20 16:34:13 +0000113 void visitInvokeInst(InvokeInst &II);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000114 void visitSetCondInst(SetCondInst &SCI) {} // SetEQ & friends are ignored
Vikram S. Advebac06222002-12-06 21:17:10 +0000115 void visitFreeInst(FreeInst &FI);
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000116 void visitCastInst(CastInst &CI);
Chris Lattner878e5212003-02-04 00:59:50 +0000117 void visitInstruction(Instruction &I);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000118
Chris Lattner808a7ae2003-09-20 16:34:13 +0000119 void visitCallSite(CallSite CS);
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000120 void visitVANextInst(VANextInst &I);
121 void visitVAArgInst(VAArgInst &I);
Chris Lattner26c4fc32003-09-20 21:48:16 +0000122
123 void MergeConstantInitIntoNode(DSNodeHandle &NH, Constant *C);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000124 private:
125 // Helper functions used to implement the visitation functions...
126
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000127 /// createNode - Create a new DSNode, ensuring that it is properly added to
128 /// the graph.
129 ///
Chris Lattnerbd92b732003-06-19 21:15:11 +0000130 DSNode *createNode(const Type *Ty = 0) {
131 DSNode *N = new DSNode(Ty, &G); // Create the node
Chris Lattnere158b192003-06-16 12:08:18 +0000132 if (DisableFieldSensitivity) {
Chris Lattnerca3f7902003-02-08 20:18:39 +0000133 N->foldNodeCompletely();
Chris Lattnere158b192003-06-16 12:08:18 +0000134 if (DSNode *FN = N->getForwardNode())
135 N = FN;
136 }
Chris Lattner92673292002-11-02 00:13:20 +0000137 return N;
138 }
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000139
Chris Lattnerc875f022002-11-03 21:27:48 +0000140 /// setDestTo - Set the ScalarMap entry for the specified value to point to
Chris Lattner92673292002-11-02 00:13:20 +0000141 /// the specified destination. If the Value already points to a node, make
142 /// sure to merge the two destinations together.
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000143 ///
Chris Lattner92673292002-11-02 00:13:20 +0000144 void setDestTo(Value &V, const DSNodeHandle &NH);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000145
Chris Lattner92673292002-11-02 00:13:20 +0000146 /// getValueDest - Return the DSNode that the actual value points to.
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000147 ///
Chris Lattner92673292002-11-02 00:13:20 +0000148 DSNodeHandle getValueDest(Value &V);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000149
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000150 /// getLink - This method is used to return the specified link in the
151 /// specified node if one exists. If a link does not already exist (it's
Chris Lattner7e51c872002-10-31 06:52:26 +0000152 /// null), then we create a new node, link it, then return it.
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000153 ///
Chris Lattner7e51c872002-10-31 06:52:26 +0000154 DSNodeHandle &getLink(const DSNodeHandle &Node, unsigned Link = 0);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000155 };
156}
157
Brian Gaeked0fde302003-11-11 22:41:34 +0000158using namespace DS;
159
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000160//===----------------------------------------------------------------------===//
161// DSGraph constructor - Simply use the GraphBuilder to construct the local
162// graph.
Chris Lattner15869aa2003-11-02 22:27:28 +0000163DSGraph::DSGraph(const TargetData &td, Function &F, DSGraph *GG)
164 : GlobalsGraph(GG), TD(td) {
Chris Lattner2a068862002-11-10 06:53:38 +0000165 PrintAuxCalls = false;
Chris Lattner30514192003-07-02 04:37:26 +0000166
167 DEBUG(std::cerr << " [Loc] Calculating graph for: " << F.getName() << "\n");
168
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000169 // Use the graph builder to construct the local version of the graph
Chris Lattner26c4fc32003-09-20 21:48:16 +0000170 GraphBuilder B(F, *this, ReturnNodes[&F], FunctionCalls);
Chris Lattner4fe34612002-11-18 21:44:19 +0000171#ifndef NDEBUG
172 Timer::addPeakMemoryMeasurement();
173#endif
Chris Lattner1a1a85d2003-02-14 04:55:58 +0000174
175 // Remove all integral constants from the scalarmap!
Chris Lattner62482e52004-01-28 09:15:42 +0000176 for (DSScalarMap::iterator I = ScalarMap.begin(); I != ScalarMap.end();)
Chris Lattner02da0322004-01-27 21:51:19 +0000177 if (isa<ConstantIntegral>(I->first))
178 ScalarMap.erase(I++);
179 else
Chris Lattner1a1a85d2003-02-14 04:55:58 +0000180 ++I;
181
Chris Lattnerc420ab62004-02-25 23:31:02 +0000182 // If there are any constant globals referenced in this function, merge their
183 // initializers into the local graph from the globals graph.
184 if (ScalarMap.global_begin() != ScalarMap.global_end()) {
185 ReachabilityCloner RC(*this, *GG, 0);
186
187 for (DSScalarMap::global_iterator I = ScalarMap.global_begin();
188 I != ScalarMap.global_end(); ++I)
189 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(*I))
Chris Lattner76a9eb32004-03-03 23:00:19 +0000190 if (!GV->isExternal() && GV->isConstant())
Chris Lattnerc420ab62004-02-25 23:31:02 +0000191 RC.merge(ScalarMap[GV], GG->ScalarMap[GV]);
192 }
193
Chris Lattner394471f2003-01-23 22:05:33 +0000194 markIncompleteNodes(DSGraph::MarkFormalArgs);
Chris Lattner96517252002-11-09 20:55:24 +0000195
196 // Remove any nodes made dead due to merging...
Chris Lattner394471f2003-01-23 22:05:33 +0000197 removeDeadNodes(DSGraph::KeepUnreachableGlobals);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000198}
199
200
201//===----------------------------------------------------------------------===//
202// Helper method implementations...
203//
204
Chris Lattner92673292002-11-02 00:13:20 +0000205/// getValueDest - Return the DSNode that the actual value points to.
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000206///
Chris Lattner51340062002-11-08 05:00:44 +0000207DSNodeHandle GraphBuilder::getValueDest(Value &Val) {
208 Value *V = &Val;
209 if (V == Constant::getNullValue(V->getType()))
210 return 0; // Null doesn't point to anything, don't add to ScalarMap!
Chris Lattner92673292002-11-02 00:13:20 +0000211
Vikram S. Advebac06222002-12-06 21:17:10 +0000212 DSNodeHandle &NH = ScalarMap[V];
213 if (NH.getNode())
214 return NH; // Already have a node? Just return it...
215
216 // Otherwise we need to create a new node to point to.
217 // Check first for constant expressions that must be traversed to
218 // extract the actual value.
Chris Lattner51340062002-11-08 05:00:44 +0000219 if (Constant *C = dyn_cast<Constant>(V))
220 if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(C)) {
Vikram S. Advebac06222002-12-06 21:17:10 +0000221 return NH = getValueDest(*CPR->getValue());
Chris Lattner51340062002-11-08 05:00:44 +0000222 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
223 if (CE->getOpcode() == Instruction::Cast)
Chris Lattner1e56c542003-02-09 23:04:12 +0000224 NH = getValueDest(*CE->getOperand(0));
225 else if (CE->getOpcode() == Instruction::GetElementPtr) {
Chris Lattner51340062002-11-08 05:00:44 +0000226 visitGetElementPtrInst(*CE);
Chris Lattner62482e52004-01-28 09:15:42 +0000227 DSScalarMap::iterator I = ScalarMap.find(CE);
Chris Lattner2cfbaaf2002-11-09 20:14:03 +0000228 assert(I != ScalarMap.end() && "GEP didn't get processed right?");
Chris Lattner1e56c542003-02-09 23:04:12 +0000229 NH = I->second;
230 } else {
231 // This returns a conservative unknown node for any unhandled ConstExpr
Chris Lattnerbd92b732003-06-19 21:15:11 +0000232 return NH = createNode()->setUnknownNodeMarker();
Chris Lattner51340062002-11-08 05:00:44 +0000233 }
Chris Lattner1e56c542003-02-09 23:04:12 +0000234 if (NH.getNode() == 0) { // (getelementptr null, X) returns null
235 ScalarMap.erase(V);
236 return 0;
237 }
238 return NH;
Chris Lattner51340062002-11-08 05:00:44 +0000239
Chris Lattner51340062002-11-08 05:00:44 +0000240 } else if (ConstantIntegral *CI = dyn_cast<ConstantIntegral>(C)) {
241 // Random constants are unknown mem
Chris Lattnerbd92b732003-06-19 21:15:11 +0000242 return NH = createNode()->setUnknownNodeMarker();
Chris Lattner51340062002-11-08 05:00:44 +0000243 } else {
244 assert(0 && "Unknown constant type!");
245 }
246
Chris Lattner92673292002-11-02 00:13:20 +0000247 // Otherwise we need to create a new node to point to...
248 DSNode *N;
Chris Lattner51340062002-11-08 05:00:44 +0000249 if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
Chris Lattner92673292002-11-02 00:13:20 +0000250 // Create a new global node for this global variable...
Chris Lattnerbd92b732003-06-19 21:15:11 +0000251 N = createNode(GV->getType()->getElementType());
Chris Lattner92673292002-11-02 00:13:20 +0000252 N->addGlobal(GV);
253 } else {
254 // Otherwise just create a shadow node
Chris Lattnerbd92b732003-06-19 21:15:11 +0000255 N = createNode();
Chris Lattner92673292002-11-02 00:13:20 +0000256 }
257
258 NH.setNode(N); // Remember that we are pointing to it...
259 NH.setOffset(0);
260 return NH;
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000261}
262
Chris Lattner0d9bab82002-07-18 00:12:30 +0000263
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000264/// getLink - This method is used to return the specified link in the
265/// specified node if one exists. If a link does not already exist (it's
266/// null), then we create a new node, link it, then return it. We must
267/// specify the type of the Node field we are accessing so that we know what
268/// type should be linked to if we need to create a new node.
269///
Chris Lattner7e51c872002-10-31 06:52:26 +0000270DSNodeHandle &GraphBuilder::getLink(const DSNodeHandle &node, unsigned LinkNo) {
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000271 DSNodeHandle &Node = const_cast<DSNodeHandle&>(node);
Chris Lattner08db7192002-11-06 06:20:27 +0000272 DSNodeHandle &Link = Node.getLink(LinkNo);
273 if (!Link.getNode()) {
274 // If the link hasn't been created yet, make and return a new shadow node
Chris Lattnerbd92b732003-06-19 21:15:11 +0000275 Link = createNode();
Chris Lattner08db7192002-11-06 06:20:27 +0000276 }
277 return Link;
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000278}
279
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000280
Chris Lattnerc875f022002-11-03 21:27:48 +0000281/// setDestTo - Set the ScalarMap entry for the specified value to point to the
Chris Lattner92673292002-11-02 00:13:20 +0000282/// specified destination. If the Value already points to a node, make sure to
283/// merge the two destinations together.
284///
285void GraphBuilder::setDestTo(Value &V, const DSNodeHandle &NH) {
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000286 ScalarMap[&V].mergeWith(NH);
Chris Lattner92673292002-11-02 00:13:20 +0000287}
288
289
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000290//===----------------------------------------------------------------------===//
291// Specific instruction type handler implementations...
292//
293
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000294/// Alloca & Malloc instruction implementation - Simply create a new memory
295/// object, pointing the scalar to it.
296///
Chris Lattnerbd92b732003-06-19 21:15:11 +0000297void GraphBuilder::handleAlloc(AllocationInst &AI, bool isHeap) {
298 DSNode *N = createNode();
299 if (isHeap)
300 N->setHeapNodeMarker();
301 else
302 N->setAllocaNodeMarker();
303 setDestTo(AI, N);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000304}
305
306// PHINode - Make the scalar for the PHI node point to all of the things the
307// incoming values point to... which effectively causes them to be merged.
308//
309void GraphBuilder::visitPHINode(PHINode &PN) {
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000310 if (!isPointerType(PN.getType())) return; // Only pointer PHIs
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000311
Chris Lattnerc875f022002-11-03 21:27:48 +0000312 DSNodeHandle &PNDest = ScalarMap[&PN];
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000313 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
Chris Lattner92673292002-11-02 00:13:20 +0000314 PNDest.mergeWith(getValueDest(*PN.getIncomingValue(i)));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000315}
316
Chris Lattner51340062002-11-08 05:00:44 +0000317void GraphBuilder::visitGetElementPtrInst(User &GEP) {
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000318 DSNodeHandle Value = getValueDest(*GEP.getOperand(0));
Chris Lattner92673292002-11-02 00:13:20 +0000319 if (Value.getNode() == 0) return;
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000320
Chris Lattner179bc7d2003-11-14 17:09:46 +0000321 // As a special case, if all of the index operands of GEP are constant zeros,
322 // handle this just like we handle casts (ie, don't do much).
323 bool AllZeros = true;
324 for (unsigned i = 1, e = GEP.getNumOperands(); i != e; ++i)
325 if (GEP.getOperand(i) !=
326 Constant::getNullValue(GEP.getOperand(i)->getType())) {
327 AllZeros = false;
328 break;
329 }
330
331 // If all of the indices are zero, the result points to the operand without
332 // applying the type.
333 if (AllZeros) {
334 setDestTo(GEP, Value);
335 return;
336 }
337
338
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000339 const PointerType *PTy = cast<PointerType>(GEP.getOperand(0)->getType());
340 const Type *CurTy = PTy->getElementType();
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000341
Chris Lattner08db7192002-11-06 06:20:27 +0000342 if (Value.getNode()->mergeTypeInfo(CurTy, Value.getOffset())) {
343 // If the node had to be folded... exit quickly
Chris Lattner92673292002-11-02 00:13:20 +0000344 setDestTo(GEP, Value); // GEP result points to folded node
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000345 return;
346 }
347
Chris Lattner15869aa2003-11-02 22:27:28 +0000348 const TargetData &TD = Value.getNode()->getTargetData();
349
Chris Lattner08db7192002-11-06 06:20:27 +0000350#if 0
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000351 // Handle the pointer index specially...
352 if (GEP.getNumOperands() > 1 &&
Chris Lattner28977af2004-04-05 01:30:19 +0000353 (!isa<Constant>(GEP.getOperand(1)) ||
354 !cast<Constant>(GEP.getOperand(1))->isNullValue())) {
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000355
356 // If we already know this is an array being accessed, don't do anything...
357 if (!TopTypeRec.isArray) {
358 TopTypeRec.isArray = true;
359
360 // If we are treating some inner field pointer as an array, fold the node
361 // up because we cannot handle it right. This can come because of
362 // something like this: &((&Pt->X)[1]) == &Pt->Y
363 //
364 if (Value.getOffset()) {
365 // Value is now the pointer we want to GEP to be...
366 Value.getNode()->foldNodeCompletely();
Chris Lattner92673292002-11-02 00:13:20 +0000367 setDestTo(GEP, Value); // GEP result points to folded node
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000368 return;
369 } else {
370 // This is a pointer to the first byte of the node. Make sure that we
371 // are pointing to the outter most type in the node.
372 // FIXME: We need to check one more case here...
373 }
374 }
375 }
Chris Lattner08db7192002-11-06 06:20:27 +0000376#endif
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000377
378 // All of these subscripts are indexing INTO the elements we have...
Chris Lattner26c4fc32003-09-20 21:48:16 +0000379 unsigned Offset = 0;
Chris Lattnerfa3711a2003-11-25 20:19:55 +0000380 for (gep_type_iterator I = gep_type_begin(GEP), E = gep_type_end(GEP);
381 I != E; ++I)
382 if (const StructType *STy = dyn_cast<StructType>(*I)) {
383 unsigned FieldNo = cast<ConstantUInt>(I.getOperand())->getValue();
384 Offset += TD.getStructLayout(STy)->MemberOffsets[FieldNo];
Chris Lattner82e9d722004-03-01 19:02:54 +0000385 } else if (const PointerType *PTy = dyn_cast<PointerType>(*I)) {
386 if (!isa<Constant>(I.getOperand()) ||
387 !cast<Constant>(I.getOperand())->isNullValue())
388 Value.getNode()->setArrayMarker();
Chris Lattnerfa3711a2003-11-25 20:19:55 +0000389 }
390
391
Chris Lattner08db7192002-11-06 06:20:27 +0000392#if 0
Chris Lattnerfa3711a2003-11-25 20:19:55 +0000393 if (const SequentialType *STy = cast<SequentialType>(*I)) {
394 CurTy = STy->getElementType();
Chris Lattnere03f32b2002-10-02 06:24:36 +0000395 if (ConstantSInt *CS = dyn_cast<ConstantSInt>(GEP.getOperand(i))) {
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000396 Offset += CS->getValue()*TD.getTypeSize(CurTy);
Chris Lattnere03f32b2002-10-02 06:24:36 +0000397 } else {
398 // Variable index into a node. We must merge all of the elements of the
399 // sequential type here.
400 if (isa<PointerType>(STy))
401 std::cerr << "Pointer indexing not handled yet!\n";
402 else {
403 const ArrayType *ATy = cast<ArrayType>(STy);
404 unsigned ElSize = TD.getTypeSize(CurTy);
405 DSNode *N = Value.getNode();
406 assert(N && "Value must have a node!");
407 unsigned RawOffset = Offset+Value.getOffset();
408
409 // Loop over all of the elements of the array, merging them into the
Misha Brukman2f2d0652003-09-11 18:14:24 +0000410 // zeroth element.
Chris Lattnere03f32b2002-10-02 06:24:36 +0000411 for (unsigned i = 1, e = ATy->getNumElements(); i != e; ++i)
412 // Merge all of the byte components of this array element
413 for (unsigned j = 0; j != ElSize; ++j)
414 N->mergeIndexes(RawOffset+j, RawOffset+i*ElSize+j);
415 }
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000416 }
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000417 }
Chris Lattnerfa3711a2003-11-25 20:19:55 +0000418#endif
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000419
420 // Add in the offset calculated...
421 Value.setOffset(Value.getOffset()+Offset);
422
423 // Value is now the pointer we want to GEP to be...
Chris Lattner92673292002-11-02 00:13:20 +0000424 setDestTo(GEP, Value);
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000425}
426
427void GraphBuilder::visitLoadInst(LoadInst &LI) {
Chris Lattner92673292002-11-02 00:13:20 +0000428 DSNodeHandle Ptr = getValueDest(*LI.getOperand(0));
429 if (Ptr.getNode() == 0) return;
430
431 // Make that the node is read from...
Chris Lattnerbd92b732003-06-19 21:15:11 +0000432 Ptr.getNode()->setReadMarker();
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000433
434 // Ensure a typerecord exists...
Chris Lattner088b6392003-03-03 17:13:31 +0000435 Ptr.getNode()->mergeTypeInfo(LI.getType(), Ptr.getOffset(), false);
Chris Lattner92673292002-11-02 00:13:20 +0000436
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000437 if (isPointerType(LI.getType()))
Chris Lattner92673292002-11-02 00:13:20 +0000438 setDestTo(LI, getLink(Ptr));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000439}
440
441void GraphBuilder::visitStoreInst(StoreInst &SI) {
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000442 const Type *StoredTy = SI.getOperand(0)->getType();
Chris Lattner92673292002-11-02 00:13:20 +0000443 DSNodeHandle Dest = getValueDest(*SI.getOperand(1));
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000444 if (Dest.isNull()) return;
Chris Lattner92673292002-11-02 00:13:20 +0000445
Vikram S. Advebac06222002-12-06 21:17:10 +0000446 // Mark that the node is written to...
Chris Lattnerbd92b732003-06-19 21:15:11 +0000447 Dest.getNode()->setModifiedMarker();
Chris Lattner8f0a16e2002-10-31 05:45:02 +0000448
Chris Lattner26c4fc32003-09-20 21:48:16 +0000449 // Ensure a type-record exists...
Chris Lattner08db7192002-11-06 06:20:27 +0000450 Dest.getNode()->mergeTypeInfo(StoredTy, Dest.getOffset());
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000451
452 // Avoid adding edges from null, or processing non-"pointer" stores
Chris Lattner92673292002-11-02 00:13:20 +0000453 if (isPointerType(StoredTy))
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000454 Dest.addEdgeTo(getValueDest(*SI.getOperand(0)));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000455}
456
457void GraphBuilder::visitReturnInst(ReturnInst &RI) {
Chris Lattner92673292002-11-02 00:13:20 +0000458 if (RI.getNumOperands() && isPointerType(RI.getOperand(0)->getType()))
Chris Lattner26c4fc32003-09-20 21:48:16 +0000459 RetNode->mergeWith(getValueDest(*RI.getOperand(0)));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000460}
461
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000462void GraphBuilder::visitVANextInst(VANextInst &I) {
463 getValueDest(*I.getOperand(0)).mergeWith(getValueDest(I));
464}
465
466void GraphBuilder::visitVAArgInst(VAArgInst &I) {
467 DSNodeHandle Ptr = getValueDest(*I.getOperand(0));
468 if (Ptr.isNull()) return;
469
470 // Make that the node is read from.
471 Ptr.getNode()->setReadMarker();
472
473 // Ensure a typerecord exists...
474 Ptr.getNode()->mergeTypeInfo(I.getType(), Ptr.getOffset(), false);
475
476 if (isPointerType(I.getType()))
477 setDestTo(I, getLink(Ptr));
478}
479
480
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000481void GraphBuilder::visitCallInst(CallInst &CI) {
Chris Lattner808a7ae2003-09-20 16:34:13 +0000482 visitCallSite(&CI);
483}
484
485void GraphBuilder::visitInvokeInst(InvokeInst &II) {
486 visitCallSite(&II);
487}
488
489void GraphBuilder::visitCallSite(CallSite CS) {
Chris Lattnercb582402004-02-26 22:07:22 +0000490 Value *Callee = CS.getCalledValue();
491 if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(Callee))
492 Callee = CPR->getValue();
493
Chris Lattner894263b2003-09-20 16:50:46 +0000494 // Special case handling of certain libc allocation functions here.
Chris Lattnercb582402004-02-26 22:07:22 +0000495 if (Function *F = dyn_cast<Function>(Callee))
Chris Lattner894263b2003-09-20 16:50:46 +0000496 if (F->isExternal())
Chris Lattnera07b72f2004-02-13 16:09:54 +0000497 switch (F->getIntrinsicID()) {
Chris Lattner317201d2004-03-13 00:24:00 +0000498 case Intrinsic::vastart:
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000499 getValueDest(*CS.getInstruction()).getNode()->setAllocaNodeMarker();
500 return;
Chris Lattner317201d2004-03-13 00:24:00 +0000501 case Intrinsic::vacopy:
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000502 getValueDest(*CS.getInstruction()).
503 mergeWith(getValueDest(**(CS.arg_begin())));
504 return;
Chris Lattner317201d2004-03-13 00:24:00 +0000505 case Intrinsic::vaend:
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000506 return; // noop
Chris Lattnera07b72f2004-02-13 16:09:54 +0000507 case Intrinsic::memmove:
508 case Intrinsic::memcpy: {
509 // Merge the first & second arguments, and mark the memory read and
Chris Lattnerfb8c6102003-11-08 21:55:50 +0000510 // modified.
Chris Lattnera07b72f2004-02-13 16:09:54 +0000511 DSNodeHandle RetNH = getValueDest(**CS.arg_begin());
Chris Lattner67ce57a2003-11-09 03:32:52 +0000512 RetNH.mergeWith(getValueDest(**(CS.arg_begin()+1)));
513 if (DSNode *N = RetNH.getNode())
514 N->setModifiedMarker()->setReadMarker();
515 return;
Chris Lattnera07b72f2004-02-13 16:09:54 +0000516 }
Chris Lattnereee33b22004-02-16 18:37:40 +0000517 case Intrinsic::memset:
518 // Mark the memory modified.
519 if (DSNode *N = getValueDest(**CS.arg_begin()).getNode())
520 N->setModifiedMarker();
521 return;
Chris Lattnera07b72f2004-02-13 16:09:54 +0000522 default:
523 if (F->getName() == "calloc") {
524 setDestTo(*CS.getInstruction(),
525 createNode()->setHeapNodeMarker()->setModifiedMarker());
526 return;
527 } else if (F->getName() == "realloc") {
528 DSNodeHandle RetNH = getValueDest(*CS.getInstruction());
529 RetNH.mergeWith(getValueDest(**CS.arg_begin()));
530 if (DSNode *N = RetNH.getNode())
531 N->setHeapNodeMarker()->setModifiedMarker()->setReadMarker();
532 return;
Chris Lattner1fe98742004-02-26 03:43:08 +0000533 } else if (F->getName() == "memmove") {
534 // Merge the first & second arguments, and mark the memory read and
535 // modified.
536 DSNodeHandle RetNH = getValueDest(**CS.arg_begin());
537 RetNH.mergeWith(getValueDest(**(CS.arg_begin()+1)));
538 if (DSNode *N = RetNH.getNode())
539 N->setModifiedMarker()->setReadMarker();
540 return;
541
Chris Lattnerd5612092004-02-24 22:02:48 +0000542 } else if (F->getName() == "atoi" || F->getName() == "atof" ||
Chris Lattneradc1efe2004-02-25 17:43:20 +0000543 F->getName() == "atol" || F->getName() == "atoll" ||
Chris Lattner39bb2dc2004-02-24 22:17:00 +0000544 F->getName() == "remove" || F->getName() == "unlink" ||
Chris Lattneradc1efe2004-02-25 17:43:20 +0000545 F->getName() == "rename" || F->getName() == "memcmp" ||
546 F->getName() == "strcmp" || F->getName() == "strncmp" ||
547 F->getName() == "execl" || F->getName() == "execlp" ||
548 F->getName() == "execle" || F->getName() == "execv" ||
Chris Lattner52fc8d72004-02-25 23:06:40 +0000549 F->getName() == "execvp" || F->getName() == "chmod" ||
550 F->getName() == "puts" || F->getName() == "write" ||
551 F->getName() == "open" || F->getName() == "create" ||
552 F->getName() == "truncate" || F->getName() == "chdir" ||
553 F->getName() == "mkdir" || F->getName() == "rmdir") {
Chris Lattner39bb2dc2004-02-24 22:17:00 +0000554 // These functions read all of their pointer operands.
555 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
556 AI != E; ++AI) {
557 if (isPointerType((*AI)->getType()))
558 if (DSNode *N = getValueDest(**AI).getNode())
559 N->setReadMarker();
560 }
Chris Lattner304e1432004-02-16 22:57:19 +0000561 return;
Chris Lattner52fc8d72004-02-25 23:06:40 +0000562 } else if (F->getName() == "read" || F->getName() == "pipe" ||
Chris Lattner6b586df2004-02-27 20:04:48 +0000563 F->getName() == "wait" || F->getName() == "time") {
Chris Lattner52fc8d72004-02-25 23:06:40 +0000564 // These functions write all of their pointer operands.
565 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
566 AI != E; ++AI) {
567 if (isPointerType((*AI)->getType()))
568 if (DSNode *N = getValueDest(**AI).getNode())
569 N->setModifiedMarker();
570 }
571 return;
Chris Lattneradc1efe2004-02-25 17:43:20 +0000572 } else if (F->getName() == "stat" || F->getName() == "fstat" ||
573 F->getName() == "lstat") {
574 // These functions read their first operand if its a pointer.
575 CallSite::arg_iterator AI = CS.arg_begin();
576 if (isPointerType((*AI)->getType())) {
577 DSNodeHandle Path = getValueDest(**AI);
578 if (DSNode *N = Path.getNode()) N->setReadMarker();
579 }
Chris Lattner304e1432004-02-16 22:57:19 +0000580
Chris Lattneradc1efe2004-02-25 17:43:20 +0000581 // Then they write into the stat buffer.
582 DSNodeHandle StatBuf = getValueDest(**++AI);
583 if (DSNode *N = StatBuf.getNode()) {
584 N->setModifiedMarker();
585 const Type *StatTy = F->getFunctionType()->getParamType(1);
586 if (const PointerType *PTy = dyn_cast<PointerType>(StatTy))
587 N->mergeTypeInfo(PTy->getElementType(), StatBuf.getOffset());
588 }
Chris Lattneradc1efe2004-02-25 17:43:20 +0000589 return;
Chris Lattner3aeb40c2004-03-04 21:03:54 +0000590 } else if (F->getName() == "strtod" || F->getName() == "strtof" ||
591 F->getName() == "strtold") {
592 // These functions read the first pointer
593 if (DSNode *Str = getValueDest(**CS.arg_begin()).getNode()) {
594 Str->setReadMarker();
595 // If the second parameter is passed, it will point to the first
596 // argument node.
597 const DSNodeHandle &EndPtrNH = getValueDest(**(CS.arg_begin()+1));
598 if (DSNode *End = EndPtrNH.getNode()) {
599 End->mergeTypeInfo(PointerType::get(Type::SByteTy),
600 EndPtrNH.getOffset(), false);
601 End->setModifiedMarker();
602 DSNodeHandle &Link = getLink(EndPtrNH);
603 Link.mergeWith(getValueDest(**CS.arg_begin()));
604 }
605 }
606
607 return;
Chris Lattner6b586df2004-02-27 20:04:48 +0000608 } else if (F->getName() == "fopen" || F->getName() == "fdopen" ||
609 F->getName() == "freopen") {
610 // These functions read all of their pointer operands.
611 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
612 AI != E; ++AI)
613 if (isPointerType((*AI)->getType()))
614 if (DSNode *N = getValueDest(**AI).getNode())
615 N->setReadMarker();
Chris Lattner68300db2004-02-13 20:05:32 +0000616
617 // fopen allocates in an unknown way and writes to the file
618 // descriptor. Also, merge the allocated type into the node.
619 DSNodeHandle Result = getValueDest(*CS.getInstruction());
Chris Lattnerd5612092004-02-24 22:02:48 +0000620 if (DSNode *N = Result.getNode()) {
621 N->setModifiedMarker()->setUnknownNodeMarker();
622 const Type *RetTy = F->getFunctionType()->getReturnType();
623 if (const PointerType *PTy = dyn_cast<PointerType>(RetTy))
624 N->mergeTypeInfo(PTy->getElementType(), Result.getOffset());
625 }
Chris Lattner6b586df2004-02-27 20:04:48 +0000626
627 // If this is freopen, merge the file descriptor passed in with the
628 // result.
Chris Lattnera19ba522004-03-02 20:46:18 +0000629 if (F->getName() == "freopen")
630 Result.mergeWith(getValueDest(**--CS.arg_end()));
Chris Lattner6b586df2004-02-27 20:04:48 +0000631
Chris Lattnerd5612092004-02-24 22:02:48 +0000632 return;
Chris Lattner68300db2004-02-13 20:05:32 +0000633 } else if (F->getName() == "fclose" && CS.arg_end()-CS.arg_begin() ==1){
634 // fclose reads and deallocates the memory in an unknown way for the
635 // file descriptor. It merges the FILE type into the descriptor.
636 DSNodeHandle H = getValueDest(**CS.arg_begin());
Chris Lattnerd5612092004-02-24 22:02:48 +0000637 if (DSNode *N = H.getNode()) {
638 N->setReadMarker()->setUnknownNodeMarker();
639 const Type *ArgTy = F->getFunctionType()->getParamType(0);
640 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
641 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
642 }
Chris Lattner68300db2004-02-13 20:05:32 +0000643 return;
Chris Lattner304e1432004-02-16 22:57:19 +0000644 } else if (CS.arg_end()-CS.arg_begin() == 1 &&
645 (F->getName() == "fflush" || F->getName() == "feof" ||
646 F->getName() == "fileno" || F->getName() == "clearerr" ||
Chris Lattner52fc8d72004-02-25 23:06:40 +0000647 F->getName() == "rewind" || F->getName() == "ftell" ||
Chris Lattner6b586df2004-02-27 20:04:48 +0000648 F->getName() == "ferror" || F->getName() == "fgetc" ||
649 F->getName() == "fgetc" || F->getName() == "_IO_getc")) {
Chris Lattner304e1432004-02-16 22:57:19 +0000650 // fflush reads and writes the memory for the file descriptor. It
Chris Lattner339d8df2004-02-13 21:21:48 +0000651 // merges the FILE type into the descriptor.
652 DSNodeHandle H = getValueDest(**CS.arg_begin());
Chris Lattnerd5612092004-02-24 22:02:48 +0000653 if (DSNode *N = H.getNode()) {
654 N->setReadMarker()->setModifiedMarker();
Chris Lattner339d8df2004-02-13 21:21:48 +0000655
Chris Lattnerd5612092004-02-24 22:02:48 +0000656 const Type *ArgTy = F->getFunctionType()->getParamType(0);
657 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
658 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
659 }
660 return;
661 } else if (CS.arg_end()-CS.arg_begin() == 4 &&
662 (F->getName() == "fwrite" || F->getName() == "fread")) {
663 // fread writes the first operand, fwrite reads it. They both
664 // read/write the FILE descriptor, and merges the FILE type.
665 DSNodeHandle H = getValueDest(**--CS.arg_end());
666 if (DSNode *N = H.getNode()) {
667 N->setReadMarker()->setModifiedMarker();
668 const Type *ArgTy = F->getFunctionType()->getParamType(3);
669 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
670 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
671 }
672
673 H = getValueDest(**CS.arg_begin());
674 if (DSNode *N = H.getNode())
675 if (F->getName() == "fwrite")
676 N->setReadMarker();
677 else
678 N->setModifiedMarker();
Chris Lattner339d8df2004-02-13 21:21:48 +0000679 return;
680 } else if (F->getName() == "fgets" && CS.arg_end()-CS.arg_begin() == 3){
Chris Lattner304e1432004-02-16 22:57:19 +0000681 // fgets reads and writes the memory for the file descriptor. It
Chris Lattner339d8df2004-02-13 21:21:48 +0000682 // merges the FILE type into the descriptor, and writes to the
683 // argument. It returns the argument as well.
684 CallSite::arg_iterator AI = CS.arg_begin();
685 DSNodeHandle H = getValueDest(**AI);
686 if (DSNode *N = H.getNode())
687 N->setModifiedMarker(); // Writes buffer
688 H.mergeWith(getValueDest(*CS.getInstruction())); // Returns buffer
689 ++AI; ++AI;
690
691 // Reads and writes file descriptor, merge in FILE type.
Chris Lattneradc1efe2004-02-25 17:43:20 +0000692 H = getValueDest(**AI);
Chris Lattnerd5612092004-02-24 22:02:48 +0000693 if (DSNode *N = H.getNode()) {
Chris Lattner339d8df2004-02-13 21:21:48 +0000694 N->setReadMarker()->setModifiedMarker();
Chris Lattneradc1efe2004-02-25 17:43:20 +0000695 const Type *ArgTy = F->getFunctionType()->getParamType(2);
696 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
697 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
698 }
699 return;
Chris Lattner52fc8d72004-02-25 23:06:40 +0000700 } else if (F->getName() == "ungetc" || F->getName() == "fputc" ||
701 F->getName() == "fputs" || F->getName() == "putc" ||
Chris Lattner6b586df2004-02-27 20:04:48 +0000702 F->getName() == "ftell" || F->getName() == "rewind" ||
703 F->getName() == "_IO_putc") {
704 // These functions read and write the memory for the file descriptor,
705 // which is passes as the last argument.
Chris Lattneradc1efe2004-02-25 17:43:20 +0000706 DSNodeHandle H = getValueDest(**--CS.arg_end());
707 if (DSNode *N = H.getNode()) {
708 N->setReadMarker()->setModifiedMarker();
Chris Lattner52fc8d72004-02-25 23:06:40 +0000709 const Type *ArgTy = *--F->getFunctionType()->param_end();
Chris Lattnerd5612092004-02-24 22:02:48 +0000710 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
711 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
712 }
Chris Lattner52fc8d72004-02-25 23:06:40 +0000713
714 // Any pointer arguments are read.
715 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
716 AI != E; ++AI)
717 if (isPointerType((*AI)->getType()))
718 if (DSNode *N = getValueDest(**AI).getNode())
719 N->setReadMarker();
720 return;
721 } else if (F->getName() == "fseek" || F->getName() == "fgetpos" ||
722 F->getName() == "fsetpos") {
723 // These functions read and write the memory for the file descriptor,
724 // and read/write all other arguments.
725 DSNodeHandle H = getValueDest(**CS.arg_begin());
726 if (DSNode *N = H.getNode()) {
727 const Type *ArgTy = *--F->getFunctionType()->param_end();
728 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
729 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
730 }
731
732 // Any pointer arguments are read.
733 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
734 AI != E; ++AI)
735 if (isPointerType((*AI)->getType()))
736 if (DSNode *N = getValueDest(**AI).getNode())
737 N->setReadMarker()->setModifiedMarker();
Chris Lattner339d8df2004-02-13 21:21:48 +0000738 return;
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000739 } else if (F->getName() == "printf" || F->getName() == "fprintf" ||
740 F->getName() == "sprintf") {
Chris Lattner339d8df2004-02-13 21:21:48 +0000741 CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
742
743 if (F->getName() == "fprintf") {
744 // fprintf reads and writes the FILE argument, and applies the type
745 // to it.
746 DSNodeHandle H = getValueDest(**AI);
747 if (DSNode *N = H.getNode()) {
748 N->setModifiedMarker();
749 const Type *ArgTy = (*AI)->getType();
750 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
751 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
752 }
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000753 } else if (F->getName() == "sprintf") {
754 // sprintf writes the first string argument.
755 DSNodeHandle H = getValueDest(**AI++);
756 if (DSNode *N = H.getNode()) {
757 N->setModifiedMarker();
758 const Type *ArgTy = (*AI)->getType();
759 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
760 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
761 }
Chris Lattner339d8df2004-02-13 21:21:48 +0000762 }
763
764 for (; AI != E; ++AI) {
765 // printf reads all pointer arguments.
766 if (isPointerType((*AI)->getType()))
767 if (DSNode *N = getValueDest(**AI).getNode())
768 N->setReadMarker();
769 }
Chris Lattner4e46e322004-02-20 23:27:09 +0000770 return;
Chris Lattner3aeb40c2004-03-04 21:03:54 +0000771 } else if (F->getName() == "vprintf" || F->getName() == "vfprintf" ||
772 F->getName() == "vsprintf") {
773 CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
774
775 if (F->getName() == "vfprintf") {
776 // ffprintf reads and writes the FILE argument, and applies the type
777 // to it.
778 DSNodeHandle H = getValueDest(**AI);
779 if (DSNode *N = H.getNode()) {
780 N->setModifiedMarker()->setReadMarker();
781 const Type *ArgTy = (*AI)->getType();
782 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
783 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
784 }
785 ++AI;
786 } else if (F->getName() == "vsprintf") {
787 // vsprintf writes the first string argument.
788 DSNodeHandle H = getValueDest(**AI++);
789 if (DSNode *N = H.getNode()) {
790 N->setModifiedMarker();
791 const Type *ArgTy = (*AI)->getType();
792 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
793 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
794 }
795 }
796
797 // Read the format
798 if (AI != E) {
799 if (isPointerType((*AI)->getType()))
800 if (DSNode *N = getValueDest(**AI).getNode())
801 N->setReadMarker();
802 ++AI;
803 }
804
805 // Read the valist, and the pointed-to objects.
806 if (AI != E && isPointerType((*AI)->getType())) {
807 const DSNodeHandle &VAList = getValueDest(**AI);
808 if (DSNode *N = VAList.getNode()) {
809 N->setReadMarker();
810 N->mergeTypeInfo(PointerType::get(Type::SByteTy),
811 VAList.getOffset(), false);
812
813 DSNodeHandle &VAListObjs = getLink(VAList);
814 VAListObjs.getNode()->setReadMarker();
815 }
816 }
817
818 return;
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000819 } else if (F->getName() == "scanf" || F->getName() == "fscanf" ||
820 F->getName() == "sscanf") {
821 CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
Chris Lattner339d8df2004-02-13 21:21:48 +0000822
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000823 if (F->getName() == "fscanf") {
824 // fscanf reads and writes the FILE argument, and applies the type
825 // to it.
826 DSNodeHandle H = getValueDest(**AI);
827 if (DSNode *N = H.getNode()) {
828 N->setReadMarker();
829 const Type *ArgTy = (*AI)->getType();
830 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
831 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
832 }
833 } else if (F->getName() == "sscanf") {
834 // sscanf reads the first string argument.
835 DSNodeHandle H = getValueDest(**AI++);
836 if (DSNode *N = H.getNode()) {
837 N->setReadMarker();
838 const Type *ArgTy = (*AI)->getType();
839 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
840 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
841 }
842 }
843
844 for (; AI != E; ++AI) {
845 // scanf writes all pointer arguments.
846 if (isPointerType((*AI)->getType()))
847 if (DSNode *N = getValueDest(**AI).getNode())
848 N->setModifiedMarker();
849 }
Chris Lattner4e46e322004-02-20 23:27:09 +0000850 return;
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000851 } else if (F->getName() == "strtok") {
852 // strtok reads and writes the first argument, returning it. It reads
853 // its second arg. FIXME: strtok also modifies some hidden static
854 // data. Someday this might matter.
855 CallSite::arg_iterator AI = CS.arg_begin();
856 DSNodeHandle H = getValueDest(**AI++);
857 if (DSNode *N = H.getNode()) {
858 N->setReadMarker()->setModifiedMarker(); // Reads/Writes buffer
859 const Type *ArgTy = F->getFunctionType()->getParamType(0);
860 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
861 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
862 }
863 H.mergeWith(getValueDest(*CS.getInstruction())); // Returns buffer
864
865 H = getValueDest(**AI); // Reads delimiter
866 if (DSNode *N = H.getNode()) {
867 N->setReadMarker();
868 const Type *ArgTy = F->getFunctionType()->getParamType(1);
869 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
870 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
871 }
872 return;
Chris Lattner1fe98742004-02-26 03:43:08 +0000873 } else if (F->getName() == "strchr" || F->getName() == "strrchr" ||
874 F->getName() == "strstr") {
875 // These read their arguments, and return the first one
Chris Lattneradc1efe2004-02-25 17:43:20 +0000876 DSNodeHandle H = getValueDest(**CS.arg_begin());
Chris Lattner1fe98742004-02-26 03:43:08 +0000877 H.mergeWith(getValueDest(*CS.getInstruction())); // Returns buffer
878
879 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
880 AI != E; ++AI)
881 if (isPointerType((*AI)->getType()))
882 if (DSNode *N = getValueDest(**AI).getNode())
883 N->setReadMarker();
884
Chris Lattneradc1efe2004-02-25 17:43:20 +0000885 if (DSNode *N = H.getNode())
886 N->setReadMarker();
Chris Lattneradc1efe2004-02-25 17:43:20 +0000887 return;
Chris Lattner52fc8d72004-02-25 23:06:40 +0000888 } else if (F->getName() == "modf" && CS.arg_end()-CS.arg_begin() == 2) {
889 // This writes its second argument, and forces it to double.
890 DSNodeHandle H = getValueDest(**--CS.arg_end());
891 if (DSNode *N = H.getNode()) {
892 N->setModifiedMarker();
893 N->mergeTypeInfo(Type::DoubleTy, H.getOffset());
894 }
895 return;
Chris Lattner339d8df2004-02-13 21:21:48 +0000896 } else {
Chris Lattner304e1432004-02-16 22:57:19 +0000897 // Unknown function, warn if it returns a pointer type or takes a
898 // pointer argument.
899 bool Warn = isPointerType(CS.getInstruction()->getType());
900 if (!Warn)
901 for (CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
902 I != E; ++I)
903 if (isPointerType((*I)->getType())) {
904 Warn = true;
905 break;
906 }
907 if (Warn)
908 std::cerr << "WARNING: Call to unknown external function '"
909 << F->getName() << "' will cause pessimistic results!\n";
Chris Lattnera07b72f2004-02-13 16:09:54 +0000910 }
Chris Lattner894263b2003-09-20 16:50:46 +0000911 }
912
913
Chris Lattnerc314ac42002-07-11 20:32:02 +0000914 // Set up the return value...
Chris Lattner0969c502002-10-21 02:08:03 +0000915 DSNodeHandle RetVal;
Chris Lattner808a7ae2003-09-20 16:34:13 +0000916 Instruction *I = CS.getInstruction();
917 if (isPointerType(I->getType()))
918 RetVal = getValueDest(*I);
Chris Lattnerc314ac42002-07-11 20:32:02 +0000919
Chris Lattnercb582402004-02-26 22:07:22 +0000920 DSNode *CalleeNode = 0;
921 if (DisableDirectCallOpt || !isa<Function>(Callee)) {
922 CalleeNode = getValueDest(*Callee).getNode();
923 if (CalleeNode == 0) {
924 std::cerr << "WARNING: Program is calling through a null pointer?\n"<< *I;
Chris Lattnerfbc2d842003-09-24 23:42:58 +0000925 return; // Calling a null pointer?
926 }
927 }
Chris Lattner0d9bab82002-07-18 00:12:30 +0000928
Chris Lattner0969c502002-10-21 02:08:03 +0000929 std::vector<DSNodeHandle> Args;
Chris Lattner808a7ae2003-09-20 16:34:13 +0000930 Args.reserve(CS.arg_end()-CS.arg_begin());
Chris Lattner0969c502002-10-21 02:08:03 +0000931
932 // Calculate the arguments vector...
Chris Lattner808a7ae2003-09-20 16:34:13 +0000933 for (CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end(); I != E; ++I)
934 if (isPointerType((*I)->getType()))
935 Args.push_back(getValueDest(**I));
Chris Lattner0969c502002-10-21 02:08:03 +0000936
937 // Add a new function call entry...
Chris Lattnercb582402004-02-26 22:07:22 +0000938 if (CalleeNode)
939 FunctionCalls->push_back(DSCallSite(CS, RetVal, CalleeNode, Args));
Chris Lattner923fc052003-02-05 21:59:58 +0000940 else
Chris Lattnercb582402004-02-26 22:07:22 +0000941 FunctionCalls->push_back(DSCallSite(CS, RetVal, cast<Function>(Callee),
Chris Lattner26c4fc32003-09-20 21:48:16 +0000942 Args));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000943}
Chris Lattner055dc2c2002-07-18 15:54:42 +0000944
Vikram S. Advebac06222002-12-06 21:17:10 +0000945void GraphBuilder::visitFreeInst(FreeInst &FI) {
Vikram S. Advebac06222002-12-06 21:17:10 +0000946 // Mark that the node is written to...
Chris Lattnerd5612092004-02-24 22:02:48 +0000947 if (DSNode *N = getValueDest(*FI.getOperand(0)).getNode())
948 N->setModifiedMarker()->setHeapNodeMarker();
Vikram S. Advebac06222002-12-06 21:17:10 +0000949}
950
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000951/// Handle casts...
952void GraphBuilder::visitCastInst(CastInst &CI) {
Chris Lattner5af344d2002-11-02 00:36:03 +0000953 if (isPointerType(CI.getType()))
954 if (isPointerType(CI.getOperand(0)->getType())) {
955 // Cast one pointer to the other, just act like a copy instruction
Chris Lattner92673292002-11-02 00:13:20 +0000956 setDestTo(CI, getValueDest(*CI.getOperand(0)));
Chris Lattner5af344d2002-11-02 00:36:03 +0000957 } else {
958 // Cast something (floating point, small integer) to a pointer. We need
959 // to track the fact that the node points to SOMETHING, just something we
960 // don't know about. Make an "Unknown" node.
961 //
Chris Lattnerbd92b732003-06-19 21:15:11 +0000962 setDestTo(CI, createNode()->setUnknownNodeMarker());
Chris Lattner5af344d2002-11-02 00:36:03 +0000963 }
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000964}
Chris Lattner055dc2c2002-07-18 15:54:42 +0000965
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000966
Chris Lattner878e5212003-02-04 00:59:50 +0000967// visitInstruction - For all other instruction types, if we have any arguments
968// that are of pointer type, make them have unknown composition bits, and merge
969// the nodes together.
970void GraphBuilder::visitInstruction(Instruction &Inst) {
971 DSNodeHandle CurNode;
972 if (isPointerType(Inst.getType()))
973 CurNode = getValueDest(Inst);
974 for (User::op_iterator I = Inst.op_begin(), E = Inst.op_end(); I != E; ++I)
975 if (isPointerType((*I)->getType()))
976 CurNode.mergeWith(getValueDest(**I));
977
978 if (CurNode.getNode())
Chris Lattnerbd92b732003-06-19 21:15:11 +0000979 CurNode.getNode()->setUnknownNodeMarker();
Chris Lattner878e5212003-02-04 00:59:50 +0000980}
981
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000982
983
984//===----------------------------------------------------------------------===//
985// LocalDataStructures Implementation
986//===----------------------------------------------------------------------===//
987
Chris Lattner26c4fc32003-09-20 21:48:16 +0000988// MergeConstantInitIntoNode - Merge the specified constant into the node
989// pointed to by NH.
990void GraphBuilder::MergeConstantInitIntoNode(DSNodeHandle &NH, Constant *C) {
991 // Ensure a type-record exists...
992 NH.getNode()->mergeTypeInfo(C->getType(), NH.getOffset());
993
994 if (C->getType()->isFirstClassType()) {
995 if (isPointerType(C->getType()))
996 // Avoid adding edges from null, or processing non-"pointer" stores
997 NH.addEdgeTo(getValueDest(*C));
998 return;
999 }
Chris Lattner15869aa2003-11-02 22:27:28 +00001000
1001 const TargetData &TD = NH.getNode()->getTargetData();
1002
Chris Lattner26c4fc32003-09-20 21:48:16 +00001003 if (ConstantArray *CA = dyn_cast<ConstantArray>(C)) {
1004 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
1005 // We don't currently do any indexing for arrays...
1006 MergeConstantInitIntoNode(NH, cast<Constant>(CA->getOperand(i)));
1007 } else if (ConstantStruct *CS = dyn_cast<ConstantStruct>(C)) {
1008 const StructLayout *SL = TD.getStructLayout(CS->getType());
1009 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i) {
1010 DSNodeHandle NewNH(NH.getNode(), NH.getOffset()+SL->MemberOffsets[i]);
1011 MergeConstantInitIntoNode(NewNH, cast<Constant>(CS->getOperand(i)));
1012 }
Chris Lattner896481e2004-02-15 05:53:42 +00001013 } else if (ConstantAggregateZero *CAZ = dyn_cast<ConstantAggregateZero>(C)) {
1014 // Noop
Chris Lattner26c4fc32003-09-20 21:48:16 +00001015 } else {
1016 assert(0 && "Unknown constant type!");
1017 }
1018}
1019
1020void GraphBuilder::mergeInGlobalInitializer(GlobalVariable *GV) {
1021 assert(!GV->isExternal() && "Cannot merge in external global!");
1022 // Get a node handle to the global node and merge the initializer into it.
1023 DSNodeHandle NH = getValueDest(*GV);
1024 MergeConstantInitIntoNode(NH, GV->getInitializer());
1025}
1026
1027
Chris Lattneraa0b4682002-11-09 21:12:07 +00001028bool LocalDataStructures::run(Module &M) {
Chris Lattner15869aa2003-11-02 22:27:28 +00001029 GlobalsGraph = new DSGraph(getAnalysis<TargetData>());
1030
1031 const TargetData &TD = getAnalysis<TargetData>();
Chris Lattneraa0b4682002-11-09 21:12:07 +00001032
Chris Lattnerc420ab62004-02-25 23:31:02 +00001033 {
1034 GraphBuilder GGB(*GlobalsGraph);
1035
1036 // Add initializers for all of the globals to the globals graph...
1037 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
1038 if (!I->isExternal())
1039 GGB.mergeInGlobalInitializer(I);
1040 }
1041
Chris Lattneraa0b4682002-11-09 21:12:07 +00001042 // Calculate all of the graphs...
1043 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
1044 if (!I->isExternal())
Chris Lattner15869aa2003-11-02 22:27:28 +00001045 DSInfo.insert(std::make_pair(I, new DSGraph(TD, *I, GlobalsGraph)));
Chris Lattner26c4fc32003-09-20 21:48:16 +00001046
Chris Lattnerc3f5f772004-02-08 01:51:48 +00001047 GlobalsGraph->removeTriviallyDeadNodes();
Chris Lattner26c4fc32003-09-20 21:48:16 +00001048 GlobalsGraph->markIncompleteNodes(DSGraph::MarkFormalArgs);
Chris Lattneraa0b4682002-11-09 21:12:07 +00001049 return false;
1050}
1051
Chris Lattnerfccd06f2002-10-01 22:33:50 +00001052// releaseMemory - If the pass pipeline is done with this pass, we can release
1053// our memory... here...
1054//
1055void LocalDataStructures::releaseMemory() {
Chris Lattner81d924d2003-06-30 04:53:27 +00001056 for (hash_map<Function*, DSGraph*>::iterator I = DSInfo.begin(),
1057 E = DSInfo.end(); I != E; ++I) {
1058 I->second->getReturnNodes().erase(I->first);
1059 if (I->second->getReturnNodes().empty())
1060 delete I->second;
1061 }
Chris Lattnerfccd06f2002-10-01 22:33:50 +00001062
1063 // Empty map so next time memory is released, data structures are not
1064 // re-deleted.
1065 DSInfo.clear();
Chris Lattner2e4f9bf2002-11-09 20:01:01 +00001066 delete GlobalsGraph;
1067 GlobalsGraph = 0;
Chris Lattnerfccd06f2002-10-01 22:33:50 +00001068}
Brian Gaeked0fde302003-11-11 22:41:34 +00001069