blob: ae26c26dad0329b361178c883b1e67a4ac92f80a [file] [log] [blame]
Owen Anderson78e02f72007-07-06 23:14:35 +00001//===- MemoryDependenceAnalysis.cpp - Mem Deps Implementation --*- C++ -*-===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by the Owen Anderson and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file implements an analysis that determines, for a given memory
11// operation, what preceding memory operations it depends on. It builds on
12// alias analysis information, and tries to provide a lazy, caching interface to
13// a common kind of alias information query.
14//
15//===----------------------------------------------------------------------===//
16
17#include "llvm/Analysis/MemoryDependenceAnalysis.h"
Owen Anderson7a616a12007-07-10 17:25:03 +000018#include "llvm/Constants.h"
Owen Anderson78e02f72007-07-06 23:14:35 +000019#include "llvm/Instructions.h"
20#include "llvm/Function.h"
21#include "llvm/Analysis/AliasAnalysis.h"
Owen Anderson4beedbd2007-07-24 21:52:37 +000022#include "llvm/Support/CFG.h"
Owen Anderson78e02f72007-07-06 23:14:35 +000023#include "llvm/Target/TargetData.h"
24
25using namespace llvm;
26
27char MemoryDependenceAnalysis::ID = 0;
28
Owen Anderson0cd32032007-07-25 19:57:03 +000029Instruction* MemoryDependenceAnalysis::NonLocal = (Instruction*)-2;
30Instruction* MemoryDependenceAnalysis::None = (Instruction*)-3;
Owen Anderson78e02f72007-07-06 23:14:35 +000031
32// Register this pass...
Owen Anderson776ee1f2007-07-10 20:21:08 +000033static RegisterPass<MemoryDependenceAnalysis> X("memdep",
34 "Memory Dependence Analysis");
Owen Anderson78e02f72007-07-06 23:14:35 +000035
36/// getAnalysisUsage - Does not modify anything. It uses Alias Analysis.
37///
38void MemoryDependenceAnalysis::getAnalysisUsage(AnalysisUsage &AU) const {
39 AU.setPreservesAll();
40 AU.addRequiredTransitive<AliasAnalysis>();
41 AU.addRequiredTransitive<TargetData>();
42}
43
Owen Anderson5f323202007-07-10 17:59:22 +000044// Find the dependency of a CallSite
Owen Andersonfaac5182007-07-16 21:52:50 +000045Instruction* MemoryDependenceAnalysis::getCallSiteDependency(CallSite C, Instruction* start,
46 bool local) {
Owen Anderson5f323202007-07-10 17:59:22 +000047 assert(local && "Non-local memory dependence analysis not yet implemented");
48
49 AliasAnalysis& AA = getAnalysis<AliasAnalysis>();
50 TargetData& TD = getAnalysis<TargetData>();
51 BasicBlock::iterator blockBegin = C.getInstruction()->getParent()->begin();
52 BasicBlock::iterator QI = C.getInstruction();
53
54 while (QI != blockBegin) {
55 --QI;
56
57 // If this inst is a memory op, get the pointer it accessed
58 Value* pointer = 0;
59 uint64_t pointerSize = 0;
60 if (StoreInst* S = dyn_cast<StoreInst>(QI)) {
61 pointer = S->getPointerOperand();
62 pointerSize = TD.getTypeSize(S->getOperand(0)->getType());
63 } else if (LoadInst* L = dyn_cast<LoadInst>(QI)) {
64 pointer = L->getPointerOperand();
65 pointerSize = TD.getTypeSize(L->getType());
66 } else if (AllocationInst* AI = dyn_cast<AllocationInst>(QI)) {
67 pointer = AI;
68 if (ConstantInt* C = dyn_cast<ConstantInt>(AI->getArraySize()))
Owen Anderson8e850482007-07-10 20:48:38 +000069 pointerSize = C->getZExtValue() * TD.getTypeSize(AI->getAllocatedType());
Owen Anderson5f323202007-07-10 17:59:22 +000070 else
71 pointerSize = ~0UL;
Owen Anderson06b6e822007-07-10 18:43:15 +000072 } else if (VAArgInst* V = dyn_cast<VAArgInst>(QI)) {
73 pointer = V->getOperand(0);
74 pointerSize = TD.getTypeSize(V->getType());
Owen Anderson5f323202007-07-10 17:59:22 +000075 } else if (FreeInst* F = dyn_cast<FreeInst>(QI)) {
76 pointer = F->getPointerOperand();
77
78 // FreeInsts erase the entire structure
79 pointerSize = ~0UL;
80 } else if (CallSite::get(QI).getInstruction() != 0) {
81 if (AA.getModRefInfo(C, CallSite::get(QI)) != AliasAnalysis::NoModRef) {
82 depGraphLocal.insert(std::make_pair(C.getInstruction(), std::make_pair(QI, true)));
83 reverseDep.insert(std::make_pair(QI, C.getInstruction()));
84 return QI;
85 } else {
86 continue;
87 }
Owen Anderson202da142007-07-10 20:39:07 +000088 } else
89 continue;
Owen Anderson5f323202007-07-10 17:59:22 +000090
91 if (AA.getModRefInfo(C, pointer, pointerSize) != AliasAnalysis::NoModRef) {
92 depGraphLocal.insert(std::make_pair(C.getInstruction(), std::make_pair(QI, true)));
93 reverseDep.insert(std::make_pair(QI, C.getInstruction()));
94 return QI;
95 }
96 }
97
98 // No dependence found
99 depGraphLocal.insert(std::make_pair(C.getInstruction(), std::make_pair(NonLocal, true)));
100 reverseDep.insert(std::make_pair(NonLocal, C.getInstruction()));
101 return NonLocal;
102}
103
Owen Anderson0cd32032007-07-25 19:57:03 +0000104bool MemoryDependenceAnalysis::nonLocalHelper(Instruction* query,
105 BasicBlock* block,
106 DenseMap<BasicBlock*, Value*>& resp) {
107 if (resp.count(block))
108 return resp[block] != None;
Owen Anderson4beedbd2007-07-24 21:52:37 +0000109
Owen Anderson0cd32032007-07-25 19:57:03 +0000110 Instruction* localDep = getDependency(query, 0, block);
Owen Anderson4beedbd2007-07-24 21:52:37 +0000111 if (localDep != NonLocal) {
Owen Anderson0cd32032007-07-25 19:57:03 +0000112 resp.insert(std::make_pair(block, localDep));
113 return true;
Owen Anderson4beedbd2007-07-24 21:52:37 +0000114 }
115
Owen Anderson0cd32032007-07-25 19:57:03 +0000116 bool inserted = false;
Owen Anderson4beedbd2007-07-24 21:52:37 +0000117 for (pred_iterator PI = pred_begin(block), PE = pred_end(block);
Owen Anderson0cd32032007-07-25 19:57:03 +0000118 PI != PE; ++PI)
119 inserted |= nonLocalHelper(query, *PI, resp);
Owen Anderson4beedbd2007-07-24 21:52:37 +0000120
Owen Anderson0cd32032007-07-25 19:57:03 +0000121 if (!inserted)
122 resp.insert(std::make_pair(block, None));
Owen Anderson4beedbd2007-07-24 21:52:37 +0000123
Owen Anderson0cd32032007-07-25 19:57:03 +0000124 return inserted;
Owen Anderson4beedbd2007-07-24 21:52:37 +0000125}
126
Owen Anderson0cd32032007-07-25 19:57:03 +0000127bool MemoryDependenceAnalysis::getNonLocalDependency(Instruction* query,
128 DenseMap<BasicBlock*, Value*>& resp) {
Owen Anderson4beedbd2007-07-24 21:52:37 +0000129 Instruction* localDep = getDependency(query);
130 if (localDep != NonLocal) {
Owen Anderson0cd32032007-07-25 19:57:03 +0000131 resp.insert(std::make_pair(query->getParent(), localDep));
132 return true;
Owen Anderson4beedbd2007-07-24 21:52:37 +0000133 }
134
Owen Anderson0cd32032007-07-25 19:57:03 +0000135 bool inserted = false;
136
Owen Anderson4beedbd2007-07-24 21:52:37 +0000137 BasicBlock* parent = query->getParent();
138 for (pred_iterator PI = pred_begin(parent), PE = pred_end(parent);
139 PI != PE; ++PI) {
Owen Anderson0cd32032007-07-25 19:57:03 +0000140 inserted |= nonLocalHelper(query, *PI, resp);
Owen Anderson4beedbd2007-07-24 21:52:37 +0000141 }
142
Owen Anderson0cd32032007-07-25 19:57:03 +0000143 if (!inserted)
144 resp.insert(std::make_pair(query->getParent(), None));
Owen Anderson4beedbd2007-07-24 21:52:37 +0000145
Owen Anderson0cd32032007-07-25 19:57:03 +0000146 return inserted;
Owen Anderson4beedbd2007-07-24 21:52:37 +0000147}
148
Owen Anderson78e02f72007-07-06 23:14:35 +0000149/// getDependency - Return the instruction on which a memory operation
Owen Anderson6b278fc2007-07-10 17:08:11 +0000150/// depends. The local paramter indicates if the query should only
151/// evaluate dependencies within the same basic block.
Owen Anderson78e02f72007-07-06 23:14:35 +0000152Instruction* MemoryDependenceAnalysis::getDependency(Instruction* query,
Owen Andersonfaac5182007-07-16 21:52:50 +0000153 Instruction* start,
Owen Anderson4beedbd2007-07-24 21:52:37 +0000154 BasicBlock* block) {
Owen Anderson78e02f72007-07-06 23:14:35 +0000155 // Start looking for dependencies with the queried inst
156 BasicBlock::iterator QI = query;
157
158 // Check for a cached result
159 std::pair<Instruction*, bool> cachedResult = depGraphLocal[query];
160 // If we have a _confirmed_ cached entry, return it
161 if (cachedResult.second)
162 return cachedResult.first;
Owen Anderson0cd32032007-07-25 19:57:03 +0000163 else if (cachedResult.first && cachedResult.first != NonLocal)
Owen Anderson78e02f72007-07-06 23:14:35 +0000164 // If we have an unconfirmed cached entry, we can start our search from there
165 QI = cachedResult.first;
166
Owen Andersonfaac5182007-07-16 21:52:50 +0000167 if (start)
168 QI = start;
Owen Anderson0cd32032007-07-25 19:57:03 +0000169 else if (!start && block)
170 QI = block->end();
Owen Andersonfaac5182007-07-16 21:52:50 +0000171
Owen Anderson78e02f72007-07-06 23:14:35 +0000172 AliasAnalysis& AA = getAnalysis<AliasAnalysis>();
Owen Anderson6b278fc2007-07-10 17:08:11 +0000173 TargetData& TD = getAnalysis<TargetData>();
Owen Anderson78e02f72007-07-06 23:14:35 +0000174
175 // Get the pointer value for which dependence will be determined
176 Value* dependee = 0;
Owen Anderson6b278fc2007-07-10 17:08:11 +0000177 uint64_t dependeeSize = 0;
Owen Andersone314eb32007-07-10 18:11:42 +0000178 bool queryIsVolatile = false;
Owen Andersonfaac5182007-07-16 21:52:50 +0000179 if (StoreInst* S = dyn_cast<StoreInst>(query)) {
Owen Anderson78e02f72007-07-06 23:14:35 +0000180 dependee = S->getPointerOperand();
Owen Anderson7a616a12007-07-10 17:25:03 +0000181 dependeeSize = TD.getTypeSize(S->getOperand(0)->getType());
Owen Andersone314eb32007-07-10 18:11:42 +0000182 queryIsVolatile = S->isVolatile();
Owen Andersonfaac5182007-07-16 21:52:50 +0000183 } else if (LoadInst* L = dyn_cast<LoadInst>(query)) {
Owen Anderson78e02f72007-07-06 23:14:35 +0000184 dependee = L->getPointerOperand();
Owen Anderson7a616a12007-07-10 17:25:03 +0000185 dependeeSize = TD.getTypeSize(L->getType());
Owen Andersone314eb32007-07-10 18:11:42 +0000186 queryIsVolatile = L->isVolatile();
Owen Andersonfaac5182007-07-16 21:52:50 +0000187 } else if (VAArgInst* V = dyn_cast<VAArgInst>(query)) {
Owen Anderson06b6e822007-07-10 18:43:15 +0000188 dependee = V->getOperand(0);
189 dependeeSize = TD.getTypeSize(V->getType());
Owen Andersonfaac5182007-07-16 21:52:50 +0000190 } else if (FreeInst* F = dyn_cast<FreeInst>(query)) {
Owen Anderson78e02f72007-07-06 23:14:35 +0000191 dependee = F->getPointerOperand();
Owen Anderson6b278fc2007-07-10 17:08:11 +0000192
193 // FreeInsts erase the entire structure, not just a field
194 dependeeSize = ~0UL;
Owen Andersonfaac5182007-07-16 21:52:50 +0000195 } else if (CallSite::get(query).getInstruction() != 0)
196 return getCallSiteDependency(CallSite::get(query), start);
Owen Anderson5f323202007-07-10 17:59:22 +0000197 else if (isa<AllocationInst>(query))
Owen Anderson78e02f72007-07-06 23:14:35 +0000198 return None;
Owen Anderson7a616a12007-07-10 17:25:03 +0000199 else
Owen Anderson6b278fc2007-07-10 17:08:11 +0000200 return None;
Owen Anderson78e02f72007-07-06 23:14:35 +0000201
Owen Anderson4beedbd2007-07-24 21:52:37 +0000202 BasicBlock::iterator blockBegin = block ? block->begin()
203 : query->getParent()->begin();
Owen Anderson78e02f72007-07-06 23:14:35 +0000204
205 while (QI != blockBegin) {
Owen Anderson6b278fc2007-07-10 17:08:11 +0000206 --QI;
207
Owen Anderson78e02f72007-07-06 23:14:35 +0000208 // If this inst is a memory op, get the pointer it accessed
209 Value* pointer = 0;
Owen Anderson6b278fc2007-07-10 17:08:11 +0000210 uint64_t pointerSize = 0;
211 if (StoreInst* S = dyn_cast<StoreInst>(QI)) {
Owen Andersone314eb32007-07-10 18:11:42 +0000212 // All volatile loads/stores depend on each other
213 if (queryIsVolatile && S->isVolatile()) {
Owen Anderson0cd32032007-07-25 19:57:03 +0000214 if (!start || block) {
Owen Andersonfaac5182007-07-16 21:52:50 +0000215 depGraphLocal.insert(std::make_pair(query, std::make_pair(S, true)));
216 reverseDep.insert(std::make_pair(S, query));
217 }
218
Owen Andersone314eb32007-07-10 18:11:42 +0000219 return S;
220 }
221
Owen Anderson78e02f72007-07-06 23:14:35 +0000222 pointer = S->getPointerOperand();
Owen Anderson7a616a12007-07-10 17:25:03 +0000223 pointerSize = TD.getTypeSize(S->getOperand(0)->getType());
Owen Anderson6b278fc2007-07-10 17:08:11 +0000224 } else if (LoadInst* L = dyn_cast<LoadInst>(QI)) {
Owen Andersone314eb32007-07-10 18:11:42 +0000225 // All volatile loads/stores depend on each other
226 if (queryIsVolatile && L->isVolatile()) {
Owen Anderson0cd32032007-07-25 19:57:03 +0000227 if (!start || block) {
Owen Andersonfaac5182007-07-16 21:52:50 +0000228 depGraphLocal.insert(std::make_pair(query, std::make_pair(L, true)));
229 reverseDep.insert(std::make_pair(L, query));
230 }
231
Owen Andersone314eb32007-07-10 18:11:42 +0000232 return L;
233 }
234
Owen Anderson78e02f72007-07-06 23:14:35 +0000235 pointer = L->getPointerOperand();
Owen Anderson7a616a12007-07-10 17:25:03 +0000236 pointerSize = TD.getTypeSize(L->getType());
Owen Anderson6b278fc2007-07-10 17:08:11 +0000237 } else if (AllocationInst* AI = dyn_cast<AllocationInst>(QI)) {
238 pointer = AI;
Owen Anderson7a616a12007-07-10 17:25:03 +0000239 if (ConstantInt* C = dyn_cast<ConstantInt>(AI->getArraySize()))
Owen Anderson8e850482007-07-10 20:48:38 +0000240 pointerSize = C->getZExtValue() * TD.getTypeSize(AI->getAllocatedType());
Owen Anderson6b278fc2007-07-10 17:08:11 +0000241 else
242 pointerSize = ~0UL;
Owen Anderson06b6e822007-07-10 18:43:15 +0000243 } else if (VAArgInst* V = dyn_cast<VAArgInst>(QI)) {
244 pointer = V->getOperand(0);
245 pointerSize = TD.getTypeSize(V->getType());
Owen Anderson6b278fc2007-07-10 17:08:11 +0000246 } else if (FreeInst* F = dyn_cast<FreeInst>(QI)) {
Owen Anderson78e02f72007-07-06 23:14:35 +0000247 pointer = F->getPointerOperand();
Owen Anderson6b278fc2007-07-10 17:08:11 +0000248
249 // FreeInsts erase the entire structure
250 pointerSize = ~0UL;
Owen Anderson5f323202007-07-10 17:59:22 +0000251 } else if (CallSite::get(QI).getInstruction() != 0) {
Owen Anderson78e02f72007-07-06 23:14:35 +0000252 // Call insts need special handling. Check is they can modify our pointer
Owen Anderson5f323202007-07-10 17:59:22 +0000253 if (AA.getModRefInfo(CallSite::get(QI), dependee, dependeeSize) !=
254 AliasAnalysis::NoModRef) {
Owen Anderson0cd32032007-07-25 19:57:03 +0000255 if (!start || block) {
Owen Andersonfaac5182007-07-16 21:52:50 +0000256 depGraphLocal.insert(std::make_pair(query, std::make_pair(QI, true)));
257 reverseDep.insert(std::make_pair(QI, query));
258 }
259
Owen Anderson5f323202007-07-10 17:59:22 +0000260 return QI;
Owen Anderson7a616a12007-07-10 17:25:03 +0000261 } else {
262 continue;
263 }
Owen Anderson78e02f72007-07-06 23:14:35 +0000264 }
265
266 // If we found a pointer, check if it could be the same as our pointer
267 if (pointer) {
Owen Anderson6b278fc2007-07-10 17:08:11 +0000268 AliasAnalysis::AliasResult R = AA.alias(pointer, pointerSize,
269 dependee, dependeeSize);
Owen Anderson78e02f72007-07-06 23:14:35 +0000270
271 if (R != AliasAnalysis::NoAlias) {
Owen Anderson0cd32032007-07-25 19:57:03 +0000272 if (!start || block) {
Owen Andersonfaac5182007-07-16 21:52:50 +0000273 depGraphLocal.insert(std::make_pair(query, std::make_pair(QI, true)));
274 reverseDep.insert(std::make_pair(QI, query));
275 }
276
Owen Anderson78e02f72007-07-06 23:14:35 +0000277 return QI;
278 }
279 }
Owen Anderson78e02f72007-07-06 23:14:35 +0000280 }
281
282 // If we found nothing, return the non-local flag
Owen Anderson0cd32032007-07-25 19:57:03 +0000283 if (!start || block) {
Owen Andersonfaac5182007-07-16 21:52:50 +0000284 depGraphLocal.insert(std::make_pair(query,
285 std::make_pair(NonLocal, true)));
286 reverseDep.insert(std::make_pair(NonLocal, query));
287 }
Owen Anderson78e02f72007-07-06 23:14:35 +0000288
289 return NonLocal;
290}
291
292/// removeInstruction - Remove an instruction from the dependence analysis,
293/// updating the dependence of instructions that previously depended on it.
294void MemoryDependenceAnalysis::removeInstruction(Instruction* rem) {
295 // Figure out the new dep for things that currently depend on rem
296 Instruction* newDep = NonLocal;
Owen Anderson521a2022007-07-20 06:16:07 +0000297 if (depGraphLocal[rem].first != NonLocal &&
298 depGraphLocal[rem].second) {
Owen Anderson78e02f72007-07-06 23:14:35 +0000299 // If we have dep info for rem, set them to it
300 BasicBlock::iterator RI = depGraphLocal[rem].first;
301 RI++;
302 newDep = RI;
303 } else if (depGraphLocal[rem].first == NonLocal &&
304 depGraphLocal[rem].second ) {
305 // If we have a confirmed non-local flag, use it
306 newDep = NonLocal;
307 } else {
308 // Otherwise, use the immediate successor of rem
309 // NOTE: This is because, when getDependence is called, it will first check
310 // the immediate predecessor of what is in the cache.
311 BasicBlock::iterator RI = rem;
312 RI++;
313 newDep = RI;
314 }
315
316 std::multimap<Instruction*, Instruction*>::iterator I = reverseDep.find(rem);
317 while (I->first == rem) {
318 // Insert the new dependencies
319 // Mark it as unconfirmed as long as it is not the non-local flag
320 depGraphLocal[I->second] = std::make_pair(newDep, !newDep);
321 reverseDep.erase(I);
322 I = reverseDep.find(rem);
323 }
Owen Anderson1cb960a2007-07-12 00:06:21 +0000324
325 getAnalysis<AliasAnalysis>().deleteValue(rem);
Owen Anderson78e02f72007-07-06 23:14:35 +0000326}