blob: 7836555c293006ea4dbb4d075dbea8e8af54602b [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 Lattner4dabb2c2004-07-07 06:32:21 +000015#include "llvm/Analysis/DataStructure/DataStructure.h"
16#include "llvm/Analysis/DataStructure/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.
Reid Spencere8404342004-07-18 00:18:30 +0000223 DSNode* N;
224 if (GlobalValue* GV = dyn_cast<GlobalValue>(V)) {
225 // Create a new global node for this global variable...
226 N = createNode(GV->getType()->getElementType());
227 N->addGlobal(GV);
228 } else if (Constant *C = dyn_cast<Constant>(V)) {
229 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
Chris Lattner51340062002-11-08 05:00:44 +0000230 if (CE->getOpcode() == Instruction::Cast)
Chris Lattner1e56c542003-02-09 23:04:12 +0000231 NH = getValueDest(*CE->getOperand(0));
232 else if (CE->getOpcode() == Instruction::GetElementPtr) {
Chris Lattner51340062002-11-08 05:00:44 +0000233 visitGetElementPtrInst(*CE);
Chris Lattner62482e52004-01-28 09:15:42 +0000234 DSScalarMap::iterator I = ScalarMap.find(CE);
Chris Lattner2cfbaaf2002-11-09 20:14:03 +0000235 assert(I != ScalarMap.end() && "GEP didn't get processed right?");
Chris Lattner1e56c542003-02-09 23:04:12 +0000236 NH = I->second;
237 } else {
238 // This returns a conservative unknown node for any unhandled ConstExpr
Chris Lattnerbd92b732003-06-19 21:15:11 +0000239 return NH = createNode()->setUnknownNodeMarker();
Chris Lattner51340062002-11-08 05:00:44 +0000240 }
Chris Lattner1e56c542003-02-09 23:04:12 +0000241 if (NH.getNode() == 0) { // (getelementptr null, X) returns null
242 ScalarMap.erase(V);
243 return 0;
244 }
245 return NH;
Chris Lattner51340062002-11-08 05:00:44 +0000246
Chris Lattner51340062002-11-08 05:00:44 +0000247 } else if (ConstantIntegral *CI = dyn_cast<ConstantIntegral>(C)) {
248 // Random constants are unknown mem
Chris Lattnerbd92b732003-06-19 21:15:11 +0000249 return NH = createNode()->setUnknownNodeMarker();
Chris Lattner51340062002-11-08 05:00:44 +0000250 } else {
251 assert(0 && "Unknown constant type!");
252 }
Reid Spencere8404342004-07-18 00:18:30 +0000253 N = createNode(); // just create a shadow node
Chris Lattner92673292002-11-02 00:13:20 +0000254 } else {
255 // Otherwise just create a shadow node
Chris Lattnerbd92b732003-06-19 21:15:11 +0000256 N = createNode();
Chris Lattner92673292002-11-02 00:13:20 +0000257 }
258
Chris Lattnerefffdc92004-07-07 06:12:52 +0000259 NH.setTo(N, 0); // Remember that we are pointing to it...
Chris Lattner92673292002-11-02 00:13:20 +0000260 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();
Chris Lattnercb582402004-02-26 22:07:22 +0000491
Chris Lattner894263b2003-09-20 16:50:46 +0000492 // Special case handling of certain libc allocation functions here.
Chris Lattnercb582402004-02-26 22:07:22 +0000493 if (Function *F = dyn_cast<Function>(Callee))
Chris Lattner894263b2003-09-20 16:50:46 +0000494 if (F->isExternal())
Chris Lattnera07b72f2004-02-13 16:09:54 +0000495 switch (F->getIntrinsicID()) {
Chris Lattner317201d2004-03-13 00:24:00 +0000496 case Intrinsic::vastart:
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000497 getValueDest(*CS.getInstruction()).getNode()->setAllocaNodeMarker();
498 return;
Chris Lattner317201d2004-03-13 00:24:00 +0000499 case Intrinsic::vacopy:
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000500 getValueDest(*CS.getInstruction()).
501 mergeWith(getValueDest(**(CS.arg_begin())));
502 return;
Chris Lattner317201d2004-03-13 00:24:00 +0000503 case Intrinsic::vaend:
Chris Lattner6b3e3cc2004-03-04 20:33:47 +0000504 return; // noop
Chris Lattnera07b72f2004-02-13 16:09:54 +0000505 case Intrinsic::memmove:
506 case Intrinsic::memcpy: {
507 // Merge the first & second arguments, and mark the memory read and
Chris Lattnerfb8c6102003-11-08 21:55:50 +0000508 // modified.
Chris Lattnera07b72f2004-02-13 16:09:54 +0000509 DSNodeHandle RetNH = getValueDest(**CS.arg_begin());
Chris Lattner67ce57a2003-11-09 03:32:52 +0000510 RetNH.mergeWith(getValueDest(**(CS.arg_begin()+1)));
511 if (DSNode *N = RetNH.getNode())
512 N->setModifiedMarker()->setReadMarker();
513 return;
Chris Lattnera07b72f2004-02-13 16:09:54 +0000514 }
Chris Lattnereee33b22004-02-16 18:37:40 +0000515 case Intrinsic::memset:
516 // Mark the memory modified.
517 if (DSNode *N = getValueDest(**CS.arg_begin()).getNode())
518 N->setModifiedMarker();
519 return;
Chris Lattnera07b72f2004-02-13 16:09:54 +0000520 default:
Vikram S. Advee4e97ef2004-05-25 08:14:52 +0000521 if (F->getName() == "calloc" || F->getName() == "posix_memalign" ||
522 F->getName() == "memalign" || F->getName() == "valloc") {
Chris Lattnera07b72f2004-02-13 16:09:54 +0000523 setDestTo(*CS.getInstruction(),
524 createNode()->setHeapNodeMarker()->setModifiedMarker());
525 return;
526 } else if (F->getName() == "realloc") {
527 DSNodeHandle RetNH = getValueDest(*CS.getInstruction());
528 RetNH.mergeWith(getValueDest(**CS.arg_begin()));
529 if (DSNode *N = RetNH.getNode())
530 N->setHeapNodeMarker()->setModifiedMarker()->setReadMarker();
531 return;
Chris Lattner1fe98742004-02-26 03:43:08 +0000532 } else if (F->getName() == "memmove") {
533 // Merge the first & second arguments, and mark the memory read and
534 // modified.
535 DSNodeHandle RetNH = getValueDest(**CS.arg_begin());
536 RetNH.mergeWith(getValueDest(**(CS.arg_begin()+1)));
537 if (DSNode *N = RetNH.getNode())
538 N->setModifiedMarker()->setReadMarker();
539 return;
540
Chris Lattnerd5612092004-02-24 22:02:48 +0000541 } else if (F->getName() == "atoi" || F->getName() == "atof" ||
Chris Lattneradc1efe2004-02-25 17:43:20 +0000542 F->getName() == "atol" || F->getName() == "atoll" ||
Chris Lattner39bb2dc2004-02-24 22:17:00 +0000543 F->getName() == "remove" || F->getName() == "unlink" ||
Chris Lattneradc1efe2004-02-25 17:43:20 +0000544 F->getName() == "rename" || F->getName() == "memcmp" ||
545 F->getName() == "strcmp" || F->getName() == "strncmp" ||
546 F->getName() == "execl" || F->getName() == "execlp" ||
547 F->getName() == "execle" || F->getName() == "execv" ||
Chris Lattner52fc8d72004-02-25 23:06:40 +0000548 F->getName() == "execvp" || F->getName() == "chmod" ||
549 F->getName() == "puts" || F->getName() == "write" ||
550 F->getName() == "open" || F->getName() == "create" ||
551 F->getName() == "truncate" || F->getName() == "chdir" ||
552 F->getName() == "mkdir" || F->getName() == "rmdir") {
Chris Lattner39bb2dc2004-02-24 22:17:00 +0000553 // These functions read all of their pointer operands.
554 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
555 AI != E; ++AI) {
556 if (isPointerType((*AI)->getType()))
557 if (DSNode *N = getValueDest(**AI).getNode())
558 N->setReadMarker();
559 }
Chris Lattner304e1432004-02-16 22:57:19 +0000560 return;
Chris Lattner52fc8d72004-02-25 23:06:40 +0000561 } else if (F->getName() == "read" || F->getName() == "pipe" ||
Chris Lattner6b586df2004-02-27 20:04:48 +0000562 F->getName() == "wait" || F->getName() == "time") {
Chris Lattner52fc8d72004-02-25 23:06:40 +0000563 // These functions write all of their pointer operands.
564 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
565 AI != E; ++AI) {
566 if (isPointerType((*AI)->getType()))
567 if (DSNode *N = getValueDest(**AI).getNode())
568 N->setModifiedMarker();
569 }
570 return;
Chris Lattneradc1efe2004-02-25 17:43:20 +0000571 } else if (F->getName() == "stat" || F->getName() == "fstat" ||
572 F->getName() == "lstat") {
573 // These functions read their first operand if its a pointer.
574 CallSite::arg_iterator AI = CS.arg_begin();
575 if (isPointerType((*AI)->getType())) {
576 DSNodeHandle Path = getValueDest(**AI);
577 if (DSNode *N = Path.getNode()) N->setReadMarker();
578 }
Chris Lattner304e1432004-02-16 22:57:19 +0000579
Chris Lattneradc1efe2004-02-25 17:43:20 +0000580 // Then they write into the stat buffer.
581 DSNodeHandle StatBuf = getValueDest(**++AI);
582 if (DSNode *N = StatBuf.getNode()) {
583 N->setModifiedMarker();
584 const Type *StatTy = F->getFunctionType()->getParamType(1);
585 if (const PointerType *PTy = dyn_cast<PointerType>(StatTy))
586 N->mergeTypeInfo(PTy->getElementType(), StatBuf.getOffset());
587 }
Chris Lattneradc1efe2004-02-25 17:43:20 +0000588 return;
Chris Lattner3aeb40c2004-03-04 21:03:54 +0000589 } else if (F->getName() == "strtod" || F->getName() == "strtof" ||
590 F->getName() == "strtold") {
591 // These functions read the first pointer
592 if (DSNode *Str = getValueDest(**CS.arg_begin()).getNode()) {
593 Str->setReadMarker();
594 // If the second parameter is passed, it will point to the first
595 // argument node.
596 const DSNodeHandle &EndPtrNH = getValueDest(**(CS.arg_begin()+1));
597 if (DSNode *End = EndPtrNH.getNode()) {
598 End->mergeTypeInfo(PointerType::get(Type::SByteTy),
599 EndPtrNH.getOffset(), false);
600 End->setModifiedMarker();
601 DSNodeHandle &Link = getLink(EndPtrNH);
602 Link.mergeWith(getValueDest(**CS.arg_begin()));
603 }
604 }
605
606 return;
Chris Lattner6b586df2004-02-27 20:04:48 +0000607 } else if (F->getName() == "fopen" || F->getName() == "fdopen" ||
608 F->getName() == "freopen") {
609 // These functions read all of their pointer operands.
610 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
611 AI != E; ++AI)
612 if (isPointerType((*AI)->getType()))
613 if (DSNode *N = getValueDest(**AI).getNode())
614 N->setReadMarker();
Chris Lattner68300db2004-02-13 20:05:32 +0000615
616 // fopen allocates in an unknown way and writes to the file
617 // descriptor. Also, merge the allocated type into the node.
618 DSNodeHandle Result = getValueDest(*CS.getInstruction());
Chris Lattnerd5612092004-02-24 22:02:48 +0000619 if (DSNode *N = Result.getNode()) {
620 N->setModifiedMarker()->setUnknownNodeMarker();
621 const Type *RetTy = F->getFunctionType()->getReturnType();
622 if (const PointerType *PTy = dyn_cast<PointerType>(RetTy))
623 N->mergeTypeInfo(PTy->getElementType(), Result.getOffset());
624 }
Chris Lattner6b586df2004-02-27 20:04:48 +0000625
626 // If this is freopen, merge the file descriptor passed in with the
627 // result.
Chris Lattnera19ba522004-03-02 20:46:18 +0000628 if (F->getName() == "freopen")
629 Result.mergeWith(getValueDest(**--CS.arg_end()));
Chris Lattner6b586df2004-02-27 20:04:48 +0000630
Chris Lattnerd5612092004-02-24 22:02:48 +0000631 return;
Chris Lattner68300db2004-02-13 20:05:32 +0000632 } else if (F->getName() == "fclose" && CS.arg_end()-CS.arg_begin() ==1){
633 // fclose reads and deallocates the memory in an unknown way for the
634 // file descriptor. It merges the FILE type into the descriptor.
635 DSNodeHandle H = getValueDest(**CS.arg_begin());
Chris Lattnerd5612092004-02-24 22:02:48 +0000636 if (DSNode *N = H.getNode()) {
637 N->setReadMarker()->setUnknownNodeMarker();
638 const Type *ArgTy = F->getFunctionType()->getParamType(0);
639 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
640 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
641 }
Chris Lattner68300db2004-02-13 20:05:32 +0000642 return;
Chris Lattner304e1432004-02-16 22:57:19 +0000643 } else if (CS.arg_end()-CS.arg_begin() == 1 &&
644 (F->getName() == "fflush" || F->getName() == "feof" ||
645 F->getName() == "fileno" || F->getName() == "clearerr" ||
Chris Lattner52fc8d72004-02-25 23:06:40 +0000646 F->getName() == "rewind" || F->getName() == "ftell" ||
Chris Lattner6b586df2004-02-27 20:04:48 +0000647 F->getName() == "ferror" || F->getName() == "fgetc" ||
648 F->getName() == "fgetc" || F->getName() == "_IO_getc")) {
Chris Lattner304e1432004-02-16 22:57:19 +0000649 // fflush reads and writes the memory for the file descriptor. It
Chris Lattner339d8df2004-02-13 21:21:48 +0000650 // merges the FILE type into the descriptor.
651 DSNodeHandle H = getValueDest(**CS.arg_begin());
Chris Lattnerd5612092004-02-24 22:02:48 +0000652 if (DSNode *N = H.getNode()) {
653 N->setReadMarker()->setModifiedMarker();
Chris Lattner339d8df2004-02-13 21:21:48 +0000654
Chris Lattnerd5612092004-02-24 22:02:48 +0000655 const Type *ArgTy = F->getFunctionType()->getParamType(0);
656 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
657 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
658 }
659 return;
660 } else if (CS.arg_end()-CS.arg_begin() == 4 &&
661 (F->getName() == "fwrite" || F->getName() == "fread")) {
662 // fread writes the first operand, fwrite reads it. They both
663 // read/write the FILE descriptor, and merges the FILE type.
664 DSNodeHandle H = getValueDest(**--CS.arg_end());
665 if (DSNode *N = H.getNode()) {
666 N->setReadMarker()->setModifiedMarker();
667 const Type *ArgTy = F->getFunctionType()->getParamType(3);
668 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
669 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
670 }
671
672 H = getValueDest(**CS.arg_begin());
673 if (DSNode *N = H.getNode())
674 if (F->getName() == "fwrite")
675 N->setReadMarker();
676 else
677 N->setModifiedMarker();
Chris Lattner339d8df2004-02-13 21:21:48 +0000678 return;
679 } else if (F->getName() == "fgets" && CS.arg_end()-CS.arg_begin() == 3){
Chris Lattner304e1432004-02-16 22:57:19 +0000680 // fgets reads and writes the memory for the file descriptor. It
Chris Lattner339d8df2004-02-13 21:21:48 +0000681 // merges the FILE type into the descriptor, and writes to the
682 // argument. It returns the argument as well.
683 CallSite::arg_iterator AI = CS.arg_begin();
684 DSNodeHandle H = getValueDest(**AI);
685 if (DSNode *N = H.getNode())
686 N->setModifiedMarker(); // Writes buffer
687 H.mergeWith(getValueDest(*CS.getInstruction())); // Returns buffer
688 ++AI; ++AI;
689
690 // Reads and writes file descriptor, merge in FILE type.
Chris Lattneradc1efe2004-02-25 17:43:20 +0000691 H = getValueDest(**AI);
Chris Lattnerd5612092004-02-24 22:02:48 +0000692 if (DSNode *N = H.getNode()) {
Chris Lattner339d8df2004-02-13 21:21:48 +0000693 N->setReadMarker()->setModifiedMarker();
Chris Lattneradc1efe2004-02-25 17:43:20 +0000694 const Type *ArgTy = F->getFunctionType()->getParamType(2);
695 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
696 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
697 }
698 return;
Chris Lattner52fc8d72004-02-25 23:06:40 +0000699 } else if (F->getName() == "ungetc" || F->getName() == "fputc" ||
700 F->getName() == "fputs" || F->getName() == "putc" ||
Chris Lattner6b586df2004-02-27 20:04:48 +0000701 F->getName() == "ftell" || F->getName() == "rewind" ||
702 F->getName() == "_IO_putc") {
703 // These functions read and write the memory for the file descriptor,
704 // which is passes as the last argument.
Chris Lattneradc1efe2004-02-25 17:43:20 +0000705 DSNodeHandle H = getValueDest(**--CS.arg_end());
706 if (DSNode *N = H.getNode()) {
707 N->setReadMarker()->setModifiedMarker();
Chris Lattner52fc8d72004-02-25 23:06:40 +0000708 const Type *ArgTy = *--F->getFunctionType()->param_end();
Chris Lattnerd5612092004-02-24 22:02:48 +0000709 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
710 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
711 }
Chris Lattner52fc8d72004-02-25 23:06:40 +0000712
713 // Any pointer arguments are read.
714 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
715 AI != E; ++AI)
716 if (isPointerType((*AI)->getType()))
717 if (DSNode *N = getValueDest(**AI).getNode())
718 N->setReadMarker();
719 return;
720 } else if (F->getName() == "fseek" || F->getName() == "fgetpos" ||
721 F->getName() == "fsetpos") {
722 // These functions read and write the memory for the file descriptor,
723 // and read/write all other arguments.
724 DSNodeHandle H = getValueDest(**CS.arg_begin());
725 if (DSNode *N = H.getNode()) {
726 const Type *ArgTy = *--F->getFunctionType()->param_end();
727 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
728 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
729 }
730
731 // Any pointer arguments are read.
732 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
733 AI != E; ++AI)
734 if (isPointerType((*AI)->getType()))
735 if (DSNode *N = getValueDest(**AI).getNode())
736 N->setReadMarker()->setModifiedMarker();
Chris Lattner339d8df2004-02-13 21:21:48 +0000737 return;
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000738 } else if (F->getName() == "printf" || F->getName() == "fprintf" ||
739 F->getName() == "sprintf") {
Chris Lattner339d8df2004-02-13 21:21:48 +0000740 CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
741
742 if (F->getName() == "fprintf") {
743 // fprintf reads and writes the FILE argument, and applies the type
744 // to it.
745 DSNodeHandle H = getValueDest(**AI);
746 if (DSNode *N = H.getNode()) {
747 N->setModifiedMarker();
748 const Type *ArgTy = (*AI)->getType();
749 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
750 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
751 }
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000752 } else if (F->getName() == "sprintf") {
753 // sprintf writes the first string argument.
754 DSNodeHandle H = getValueDest(**AI++);
755 if (DSNode *N = H.getNode()) {
756 N->setModifiedMarker();
757 const Type *ArgTy = (*AI)->getType();
758 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
759 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
760 }
Chris Lattner339d8df2004-02-13 21:21:48 +0000761 }
762
763 for (; AI != E; ++AI) {
764 // printf reads all pointer arguments.
765 if (isPointerType((*AI)->getType()))
766 if (DSNode *N = getValueDest(**AI).getNode())
767 N->setReadMarker();
768 }
Chris Lattner4e46e322004-02-20 23:27:09 +0000769 return;
Chris Lattner3aeb40c2004-03-04 21:03:54 +0000770 } else if (F->getName() == "vprintf" || F->getName() == "vfprintf" ||
771 F->getName() == "vsprintf") {
772 CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
773
774 if (F->getName() == "vfprintf") {
775 // ffprintf reads and writes the FILE argument, and applies the type
776 // to it.
777 DSNodeHandle H = getValueDest(**AI);
778 if (DSNode *N = H.getNode()) {
779 N->setModifiedMarker()->setReadMarker();
780 const Type *ArgTy = (*AI)->getType();
781 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
782 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
783 }
784 ++AI;
785 } else if (F->getName() == "vsprintf") {
786 // vsprintf writes the first string argument.
787 DSNodeHandle H = getValueDest(**AI++);
788 if (DSNode *N = H.getNode()) {
789 N->setModifiedMarker();
790 const Type *ArgTy = (*AI)->getType();
791 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
792 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
793 }
794 }
795
796 // Read the format
797 if (AI != E) {
798 if (isPointerType((*AI)->getType()))
799 if (DSNode *N = getValueDest(**AI).getNode())
800 N->setReadMarker();
801 ++AI;
802 }
803
804 // Read the valist, and the pointed-to objects.
805 if (AI != E && isPointerType((*AI)->getType())) {
806 const DSNodeHandle &VAList = getValueDest(**AI);
807 if (DSNode *N = VAList.getNode()) {
808 N->setReadMarker();
809 N->mergeTypeInfo(PointerType::get(Type::SByteTy),
810 VAList.getOffset(), false);
811
812 DSNodeHandle &VAListObjs = getLink(VAList);
813 VAListObjs.getNode()->setReadMarker();
814 }
815 }
816
817 return;
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000818 } else if (F->getName() == "scanf" || F->getName() == "fscanf" ||
819 F->getName() == "sscanf") {
820 CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
Chris Lattner339d8df2004-02-13 21:21:48 +0000821
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000822 if (F->getName() == "fscanf") {
823 // fscanf reads and writes the FILE argument, and applies the type
824 // to it.
825 DSNodeHandle H = getValueDest(**AI);
826 if (DSNode *N = H.getNode()) {
827 N->setReadMarker();
828 const Type *ArgTy = (*AI)->getType();
829 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
830 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
831 }
832 } else if (F->getName() == "sscanf") {
833 // sscanf reads the first string argument.
834 DSNodeHandle H = getValueDest(**AI++);
835 if (DSNode *N = H.getNode()) {
836 N->setReadMarker();
837 const Type *ArgTy = (*AI)->getType();
838 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
839 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
840 }
841 }
842
843 for (; AI != E; ++AI) {
844 // scanf writes all pointer arguments.
845 if (isPointerType((*AI)->getType()))
846 if (DSNode *N = getValueDest(**AI).getNode())
847 N->setModifiedMarker();
848 }
Chris Lattner4e46e322004-02-20 23:27:09 +0000849 return;
Chris Lattner8ecc27e2004-02-20 20:27:11 +0000850 } else if (F->getName() == "strtok") {
851 // strtok reads and writes the first argument, returning it. It reads
852 // its second arg. FIXME: strtok also modifies some hidden static
853 // data. Someday this might matter.
854 CallSite::arg_iterator AI = CS.arg_begin();
855 DSNodeHandle H = getValueDest(**AI++);
856 if (DSNode *N = H.getNode()) {
857 N->setReadMarker()->setModifiedMarker(); // Reads/Writes buffer
858 const Type *ArgTy = F->getFunctionType()->getParamType(0);
859 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
860 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
861 }
862 H.mergeWith(getValueDest(*CS.getInstruction())); // Returns buffer
863
864 H = getValueDest(**AI); // Reads delimiter
865 if (DSNode *N = H.getNode()) {
866 N->setReadMarker();
867 const Type *ArgTy = F->getFunctionType()->getParamType(1);
868 if (const PointerType *PTy = dyn_cast<PointerType>(ArgTy))
869 N->mergeTypeInfo(PTy->getElementType(), H.getOffset());
870 }
871 return;
Chris Lattner1fe98742004-02-26 03:43:08 +0000872 } else if (F->getName() == "strchr" || F->getName() == "strrchr" ||
873 F->getName() == "strstr") {
874 // These read their arguments, and return the first one
Chris Lattneradc1efe2004-02-25 17:43:20 +0000875 DSNodeHandle H = getValueDest(**CS.arg_begin());
Chris Lattner1fe98742004-02-26 03:43:08 +0000876 H.mergeWith(getValueDest(*CS.getInstruction())); // Returns buffer
877
878 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
879 AI != E; ++AI)
880 if (isPointerType((*AI)->getType()))
881 if (DSNode *N = getValueDest(**AI).getNode())
882 N->setReadMarker();
883
Chris Lattneradc1efe2004-02-25 17:43:20 +0000884 if (DSNode *N = H.getNode())
885 N->setReadMarker();
Chris Lattneradc1efe2004-02-25 17:43:20 +0000886 return;
Chris Lattner52fc8d72004-02-25 23:06:40 +0000887 } else if (F->getName() == "modf" && CS.arg_end()-CS.arg_begin() == 2) {
888 // This writes its second argument, and forces it to double.
889 DSNodeHandle H = getValueDest(**--CS.arg_end());
890 if (DSNode *N = H.getNode()) {
891 N->setModifiedMarker();
892 N->mergeTypeInfo(Type::DoubleTy, H.getOffset());
893 }
894 return;
Chris Lattner339d8df2004-02-13 21:21:48 +0000895 } else {
Chris Lattner304e1432004-02-16 22:57:19 +0000896 // Unknown function, warn if it returns a pointer type or takes a
897 // pointer argument.
898 bool Warn = isPointerType(CS.getInstruction()->getType());
899 if (!Warn)
900 for (CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
901 I != E; ++I)
902 if (isPointerType((*I)->getType())) {
903 Warn = true;
904 break;
905 }
906 if (Warn)
907 std::cerr << "WARNING: Call to unknown external function '"
908 << F->getName() << "' will cause pessimistic results!\n";
Chris Lattnera07b72f2004-02-13 16:09:54 +0000909 }
Chris Lattner894263b2003-09-20 16:50:46 +0000910 }
911
912
Chris Lattnerc314ac42002-07-11 20:32:02 +0000913 // Set up the return value...
Chris Lattner0969c502002-10-21 02:08:03 +0000914 DSNodeHandle RetVal;
Chris Lattner808a7ae2003-09-20 16:34:13 +0000915 Instruction *I = CS.getInstruction();
916 if (isPointerType(I->getType()))
917 RetVal = getValueDest(*I);
Chris Lattnerc314ac42002-07-11 20:32:02 +0000918
Chris Lattnercb582402004-02-26 22:07:22 +0000919 DSNode *CalleeNode = 0;
920 if (DisableDirectCallOpt || !isa<Function>(Callee)) {
921 CalleeNode = getValueDest(*Callee).getNode();
922 if (CalleeNode == 0) {
923 std::cerr << "WARNING: Program is calling through a null pointer?\n"<< *I;
Chris Lattnerfbc2d842003-09-24 23:42:58 +0000924 return; // Calling a null pointer?
925 }
926 }
Chris Lattner0d9bab82002-07-18 00:12:30 +0000927
Chris Lattner0969c502002-10-21 02:08:03 +0000928 std::vector<DSNodeHandle> Args;
Chris Lattner808a7ae2003-09-20 16:34:13 +0000929 Args.reserve(CS.arg_end()-CS.arg_begin());
Chris Lattner0969c502002-10-21 02:08:03 +0000930
931 // Calculate the arguments vector...
Chris Lattner808a7ae2003-09-20 16:34:13 +0000932 for (CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end(); I != E; ++I)
933 if (isPointerType((*I)->getType()))
934 Args.push_back(getValueDest(**I));
Chris Lattner0969c502002-10-21 02:08:03 +0000935
936 // Add a new function call entry...
Chris Lattnercb582402004-02-26 22:07:22 +0000937 if (CalleeNode)
938 FunctionCalls->push_back(DSCallSite(CS, RetVal, CalleeNode, Args));
Chris Lattner923fc052003-02-05 21:59:58 +0000939 else
Chris Lattnercb582402004-02-26 22:07:22 +0000940 FunctionCalls->push_back(DSCallSite(CS, RetVal, cast<Function>(Callee),
Chris Lattner26c4fc32003-09-20 21:48:16 +0000941 Args));
Chris Lattnerc68c31b2002-07-10 22:38:08 +0000942}
Chris Lattner055dc2c2002-07-18 15:54:42 +0000943
Vikram S. Advebac06222002-12-06 21:17:10 +0000944void GraphBuilder::visitFreeInst(FreeInst &FI) {
Vikram S. Advebac06222002-12-06 21:17:10 +0000945 // Mark that the node is written to...
Chris Lattnerd5612092004-02-24 22:02:48 +0000946 if (DSNode *N = getValueDest(*FI.getOperand(0)).getNode())
947 N->setModifiedMarker()->setHeapNodeMarker();
Vikram S. Advebac06222002-12-06 21:17:10 +0000948}
949
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000950/// Handle casts...
951void GraphBuilder::visitCastInst(CastInst &CI) {
Chris Lattner5af344d2002-11-02 00:36:03 +0000952 if (isPointerType(CI.getType()))
953 if (isPointerType(CI.getOperand(0)->getType())) {
954 // Cast one pointer to the other, just act like a copy instruction
Chris Lattner92673292002-11-02 00:13:20 +0000955 setDestTo(CI, getValueDest(*CI.getOperand(0)));
Chris Lattner5af344d2002-11-02 00:36:03 +0000956 } else {
957 // Cast something (floating point, small integer) to a pointer. We need
958 // to track the fact that the node points to SOMETHING, just something we
959 // don't know about. Make an "Unknown" node.
960 //
Chris Lattnerbd92b732003-06-19 21:15:11 +0000961 setDestTo(CI, createNode()->setUnknownNodeMarker());
Chris Lattner5af344d2002-11-02 00:36:03 +0000962 }
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000963}
Chris Lattner055dc2c2002-07-18 15:54:42 +0000964
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000965
Chris Lattner878e5212003-02-04 00:59:50 +0000966// visitInstruction - For all other instruction types, if we have any arguments
967// that are of pointer type, make them have unknown composition bits, and merge
968// the nodes together.
969void GraphBuilder::visitInstruction(Instruction &Inst) {
970 DSNodeHandle CurNode;
971 if (isPointerType(Inst.getType()))
972 CurNode = getValueDest(Inst);
973 for (User::op_iterator I = Inst.op_begin(), E = Inst.op_end(); I != E; ++I)
974 if (isPointerType((*I)->getType()))
975 CurNode.mergeWith(getValueDest(**I));
976
977 if (CurNode.getNode())
Chris Lattnerbd92b732003-06-19 21:15:11 +0000978 CurNode.getNode()->setUnknownNodeMarker();
Chris Lattner878e5212003-02-04 00:59:50 +0000979}
980
Chris Lattnerfccd06f2002-10-01 22:33:50 +0000981
982
983//===----------------------------------------------------------------------===//
984// LocalDataStructures Implementation
985//===----------------------------------------------------------------------===//
986
Chris Lattner26c4fc32003-09-20 21:48:16 +0000987// MergeConstantInitIntoNode - Merge the specified constant into the node
988// pointed to by NH.
989void GraphBuilder::MergeConstantInitIntoNode(DSNodeHandle &NH, Constant *C) {
990 // Ensure a type-record exists...
991 NH.getNode()->mergeTypeInfo(C->getType(), NH.getOffset());
992
993 if (C->getType()->isFirstClassType()) {
994 if (isPointerType(C->getType()))
995 // Avoid adding edges from null, or processing non-"pointer" stores
996 NH.addEdgeTo(getValueDest(*C));
997 return;
998 }
Chris Lattner15869aa2003-11-02 22:27:28 +0000999
1000 const TargetData &TD = NH.getNode()->getTargetData();
1001
Chris Lattner26c4fc32003-09-20 21:48:16 +00001002 if (ConstantArray *CA = dyn_cast<ConstantArray>(C)) {
1003 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
1004 // We don't currently do any indexing for arrays...
1005 MergeConstantInitIntoNode(NH, cast<Constant>(CA->getOperand(i)));
1006 } else if (ConstantStruct *CS = dyn_cast<ConstantStruct>(C)) {
1007 const StructLayout *SL = TD.getStructLayout(CS->getType());
1008 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i) {
1009 DSNodeHandle NewNH(NH.getNode(), NH.getOffset()+SL->MemberOffsets[i]);
1010 MergeConstantInitIntoNode(NewNH, cast<Constant>(CS->getOperand(i)));
1011 }
Chris Lattner896481e2004-02-15 05:53:42 +00001012 } else if (ConstantAggregateZero *CAZ = dyn_cast<ConstantAggregateZero>(C)) {
1013 // Noop
Chris Lattner26c4fc32003-09-20 21:48:16 +00001014 } else {
1015 assert(0 && "Unknown constant type!");
1016 }
1017}
1018
1019void GraphBuilder::mergeInGlobalInitializer(GlobalVariable *GV) {
1020 assert(!GV->isExternal() && "Cannot merge in external global!");
1021 // Get a node handle to the global node and merge the initializer into it.
1022 DSNodeHandle NH = getValueDest(*GV);
1023 MergeConstantInitIntoNode(NH, GV->getInitializer());
1024}
1025
1026
Chris Lattneraa0b4682002-11-09 21:12:07 +00001027bool LocalDataStructures::run(Module &M) {
Chris Lattner15869aa2003-11-02 22:27:28 +00001028 GlobalsGraph = new DSGraph(getAnalysis<TargetData>());
1029
1030 const TargetData &TD = getAnalysis<TargetData>();
Chris Lattneraa0b4682002-11-09 21:12:07 +00001031
Chris Lattnerc420ab62004-02-25 23:31:02 +00001032 {
1033 GraphBuilder GGB(*GlobalsGraph);
1034
1035 // Add initializers for all of the globals to the globals graph...
1036 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
1037 if (!I->isExternal())
1038 GGB.mergeInGlobalInitializer(I);
1039 }
1040
Chris Lattneraa0b4682002-11-09 21:12:07 +00001041 // Calculate all of the graphs...
1042 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
1043 if (!I->isExternal())
Chris Lattner15869aa2003-11-02 22:27:28 +00001044 DSInfo.insert(std::make_pair(I, new DSGraph(TD, *I, GlobalsGraph)));
Chris Lattner26c4fc32003-09-20 21:48:16 +00001045
Chris Lattnerc3f5f772004-02-08 01:51:48 +00001046 GlobalsGraph->removeTriviallyDeadNodes();
Chris Lattner26c4fc32003-09-20 21:48:16 +00001047 GlobalsGraph->markIncompleteNodes(DSGraph::MarkFormalArgs);
Chris Lattneraa0b4682002-11-09 21:12:07 +00001048 return false;
1049}
1050
Chris Lattnerfccd06f2002-10-01 22:33:50 +00001051// releaseMemory - If the pass pipeline is done with this pass, we can release
1052// our memory... here...
1053//
1054void LocalDataStructures::releaseMemory() {
Chris Lattner81d924d2003-06-30 04:53:27 +00001055 for (hash_map<Function*, DSGraph*>::iterator I = DSInfo.begin(),
1056 E = DSInfo.end(); I != E; ++I) {
1057 I->second->getReturnNodes().erase(I->first);
1058 if (I->second->getReturnNodes().empty())
1059 delete I->second;
1060 }
Chris Lattnerfccd06f2002-10-01 22:33:50 +00001061
1062 // Empty map so next time memory is released, data structures are not
1063 // re-deleted.
1064 DSInfo.clear();
Chris Lattner2e4f9bf2002-11-09 20:01:01 +00001065 delete GlobalsGraph;
1066 GlobalsGraph = 0;
Chris Lattnerfccd06f2002-10-01 22:33:50 +00001067}
Brian Gaeked0fde302003-11-11 22:41:34 +00001068