Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 1 | //===- MemoryDependenceAnalysis.cpp - Mem Deps Implementation --*- C++ -*-===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | 4ee451d | 2007-12-29 20:36:04 +0000 | [diff] [blame] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 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 |
Owen Anderson | 80b1f09 | 2007-08-08 22:01:54 +0000 | [diff] [blame] | 12 | // alias analysis information, and tries to provide a lazy, caching interface to |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 13 | // a common kind of alias information query. |
| 14 | // |
| 15 | //===----------------------------------------------------------------------===// |
| 16 | |
Chris Lattner | 0e575f4 | 2008-11-28 21:45:17 +0000 | [diff] [blame] | 17 | #define DEBUG_TYPE "memdep" |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 18 | #include "llvm/Analysis/MemoryDependenceAnalysis.h" |
Owen Anderson | 7a616a1 | 2007-07-10 17:25:03 +0000 | [diff] [blame] | 19 | #include "llvm/Constants.h" |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 20 | #include "llvm/Instructions.h" |
| 21 | #include "llvm/Function.h" |
| 22 | #include "llvm/Analysis/AliasAnalysis.h" |
Chris Lattner | baad888 | 2008-11-28 22:28:27 +0000 | [diff] [blame] | 23 | #include "llvm/ADT/Statistic.h" |
| 24 | #include "llvm/ADT/STLExtras.h" |
Owen Anderson | 4beedbd | 2007-07-24 21:52:37 +0000 | [diff] [blame] | 25 | #include "llvm/Support/CFG.h" |
Tanya Lattner | 63aa160 | 2008-02-06 00:54:55 +0000 | [diff] [blame] | 26 | #include "llvm/Support/CommandLine.h" |
Chris Lattner | 0e575f4 | 2008-11-28 21:45:17 +0000 | [diff] [blame] | 27 | #include "llvm/Support/Debug.h" |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 28 | #include "llvm/Target/TargetData.h" |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 29 | using namespace llvm; |
| 30 | |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 31 | STATISTIC(NumCacheNonLocal, "Number of cached non-local responses"); |
| 32 | STATISTIC(NumUncacheNonLocal, "Number of uncached non-local responses"); |
Owen Anderson | 7fad7e3 | 2007-09-09 21:43:49 +0000 | [diff] [blame] | 33 | |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 34 | char MemoryDependenceAnalysis::ID = 0; |
| 35 | |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 36 | // Register this pass... |
Owen Anderson | 776ee1f | 2007-07-10 20:21:08 +0000 | [diff] [blame] | 37 | static RegisterPass<MemoryDependenceAnalysis> X("memdep", |
Chris Lattner | 0e575f4 | 2008-11-28 21:45:17 +0000 | [diff] [blame] | 38 | "Memory Dependence Analysis", false, true); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 39 | |
| 40 | /// getAnalysisUsage - Does not modify anything. It uses Alias Analysis. |
| 41 | /// |
| 42 | void MemoryDependenceAnalysis::getAnalysisUsage(AnalysisUsage &AU) const { |
| 43 | AU.setPreservesAll(); |
| 44 | AU.addRequiredTransitive<AliasAnalysis>(); |
| 45 | AU.addRequiredTransitive<TargetData>(); |
| 46 | } |
| 47 | |
Owen Anderson | 642a9e3 | 2007-08-08 22:26:03 +0000 | [diff] [blame] | 48 | /// getCallSiteDependency - Private helper for finding the local dependencies |
| 49 | /// of a call site. |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 50 | MemoryDependenceAnalysis::DepResultTy MemoryDependenceAnalysis:: |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 51 | getCallSiteDependency(CallSite C, BasicBlock::iterator ScanIt, |
| 52 | BasicBlock *BB) { |
Chris Lattner | 7f52422 | 2008-11-29 03:22:12 +0000 | [diff] [blame] | 53 | AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); |
| 54 | TargetData &TD = getAnalysis<TargetData>(); |
Owen Anderson | dbbe816 | 2007-08-07 00:33:45 +0000 | [diff] [blame] | 55 | |
Owen Anderson | 642a9e3 | 2007-08-08 22:26:03 +0000 | [diff] [blame] | 56 | // Walk backwards through the block, looking for dependencies |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 57 | while (ScanIt != BB->begin()) { |
| 58 | Instruction *Inst = --ScanIt; |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 59 | |
| 60 | // If this inst is a memory op, get the pointer it accessed |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 61 | Value *Pointer = 0; |
| 62 | uint64_t PointerSize = 0; |
| 63 | if (StoreInst *S = dyn_cast<StoreInst>(Inst)) { |
| 64 | Pointer = S->getPointerOperand(); |
| 65 | PointerSize = TD.getTypeStoreSize(S->getOperand(0)->getType()); |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 66 | } else if (VAArgInst *V = dyn_cast<VAArgInst>(Inst)) { |
| 67 | Pointer = V->getOperand(0); |
| 68 | PointerSize = TD.getTypeStoreSize(V->getType()); |
| 69 | } else if (FreeInst *F = dyn_cast<FreeInst>(Inst)) { |
| 70 | Pointer = F->getPointerOperand(); |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 71 | |
| 72 | // FreeInsts erase the entire structure |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 73 | PointerSize = ~0UL; |
| 74 | } else if (isa<CallInst>(Inst) || isa<InvokeInst>(Inst)) { |
| 75 | if (AA.getModRefBehavior(CallSite::get(Inst)) == |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 76 | AliasAnalysis::DoesNotAccessMemory) |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 77 | continue; |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 78 | return DepResultTy(Inst, Normal); |
Chris Lattner | cfbb634 | 2008-11-30 01:44:00 +0000 | [diff] [blame^] | 79 | } else { |
| 80 | // Non-memory instruction. |
Owen Anderson | 202da14 | 2007-07-10 20:39:07 +0000 | [diff] [blame] | 81 | continue; |
Chris Lattner | cfbb634 | 2008-11-30 01:44:00 +0000 | [diff] [blame^] | 82 | } |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 83 | |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 84 | if (AA.getModRefInfo(C, Pointer, PointerSize) != AliasAnalysis::NoModRef) |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 85 | return DepResultTy(Inst, Normal); |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 86 | } |
| 87 | |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 88 | // No dependence found. |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 89 | return DepResultTy(0, NonLocal); |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 90 | } |
| 91 | |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 92 | /// getDependency - Return the instruction on which a memory operation |
Dan Gohman | c04575f | 2008-04-10 23:02:38 +0000 | [diff] [blame] | 93 | /// depends. The local parameter indicates if the query should only |
Owen Anderson | 6b278fc | 2007-07-10 17:08:11 +0000 | [diff] [blame] | 94 | /// evaluate dependencies within the same basic block. |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 95 | MemoryDependenceAnalysis::DepResultTy MemoryDependenceAnalysis:: |
| 96 | getDependencyFromInternal(Instruction *QueryInst, BasicBlock::iterator ScanIt, |
| 97 | BasicBlock *BB) { |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 98 | AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); |
| 99 | TargetData &TD = getAnalysis<TargetData>(); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 100 | |
| 101 | // Get the pointer value for which dependence will be determined |
Chris Lattner | 25a0814 | 2008-11-29 08:51:16 +0000 | [diff] [blame] | 102 | Value *MemPtr = 0; |
| 103 | uint64_t MemSize = 0; |
| 104 | bool MemVolatile = false; |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 105 | |
| 106 | if (StoreInst* S = dyn_cast<StoreInst>(QueryInst)) { |
Chris Lattner | 25a0814 | 2008-11-29 08:51:16 +0000 | [diff] [blame] | 107 | MemPtr = S->getPointerOperand(); |
| 108 | MemSize = TD.getTypeStoreSize(S->getOperand(0)->getType()); |
| 109 | MemVolatile = S->isVolatile(); |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 110 | } else if (LoadInst* L = dyn_cast<LoadInst>(QueryInst)) { |
Chris Lattner | 25a0814 | 2008-11-29 08:51:16 +0000 | [diff] [blame] | 111 | MemPtr = L->getPointerOperand(); |
| 112 | MemSize = TD.getTypeStoreSize(L->getType()); |
| 113 | MemVolatile = L->isVolatile(); |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 114 | } else if (VAArgInst* V = dyn_cast<VAArgInst>(QueryInst)) { |
Chris Lattner | 25a0814 | 2008-11-29 08:51:16 +0000 | [diff] [blame] | 115 | MemPtr = V->getOperand(0); |
| 116 | MemSize = TD.getTypeStoreSize(V->getType()); |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 117 | } else if (FreeInst* F = dyn_cast<FreeInst>(QueryInst)) { |
Chris Lattner | 25a0814 | 2008-11-29 08:51:16 +0000 | [diff] [blame] | 118 | MemPtr = F->getPointerOperand(); |
| 119 | // FreeInsts erase the entire structure, not just a field. |
| 120 | MemSize = ~0UL; |
| 121 | } else if (isa<CallInst>(QueryInst) || isa<InvokeInst>(QueryInst)) |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 122 | return getCallSiteDependency(CallSite::get(QueryInst), ScanIt, BB); |
Chris Lattner | 25a0814 | 2008-11-29 08:51:16 +0000 | [diff] [blame] | 123 | else // Non-memory instructions depend on nothing. |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 124 | return DepResultTy(0, None); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 125 | |
Owen Anderson | 642a9e3 | 2007-08-08 22:26:03 +0000 | [diff] [blame] | 126 | // Walk backwards through the basic block, looking for dependencies |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 127 | while (ScanIt != BB->begin()) { |
| 128 | Instruction *Inst = --ScanIt; |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 129 | |
| 130 | // If the access is volatile and this is a volatile load/store, return a |
| 131 | // dependence. |
| 132 | if (MemVolatile && |
| 133 | ((isa<LoadInst>(Inst) && cast<LoadInst>(Inst)->isVolatile()) || |
| 134 | (isa<StoreInst>(Inst) && cast<StoreInst>(Inst)->isVolatile()))) |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 135 | return DepResultTy(Inst, Normal); |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 136 | |
Chris Lattner | cfbb634 | 2008-11-30 01:44:00 +0000 | [diff] [blame^] | 137 | // Values depend on loads if the pointers are must aliased. This means that |
| 138 | // a load depends on another must aliased load from the same value. |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 139 | if (LoadInst *L = dyn_cast<LoadInst>(Inst)) { |
| 140 | Value *Pointer = L->getPointerOperand(); |
| 141 | uint64_t PointerSize = TD.getTypeStoreSize(L->getType()); |
| 142 | |
| 143 | // If we found a pointer, check if it could be the same as our pointer |
| 144 | AliasAnalysis::AliasResult R = |
| 145 | AA.alias(Pointer, PointerSize, MemPtr, MemSize); |
| 146 | |
| 147 | if (R == AliasAnalysis::NoAlias) |
| 148 | continue; |
| 149 | |
| 150 | // May-alias loads don't depend on each other without a dependence. |
| 151 | if (isa<LoadInst>(QueryInst) && R == AliasAnalysis::MayAlias) |
| 152 | continue; |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 153 | return DepResultTy(Inst, Normal); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 154 | } |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 155 | |
| 156 | // If this is an allocation, and if we know that the accessed pointer is to |
| 157 | // the allocation, return None. This means that there is no dependence and |
| 158 | // the access can be optimized based on that. For example, a load could |
| 159 | // turn into undef. |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 160 | if (AllocationInst *AI = dyn_cast<AllocationInst>(Inst)) { |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 161 | Value *AccessPtr = MemPtr->getUnderlyingObject(); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 162 | |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 163 | if (AccessPtr == AI || |
| 164 | AA.alias(AI, 1, AccessPtr, 1) == AliasAnalysis::MustAlias) |
| 165 | return DepResultTy(0, None); |
| 166 | continue; |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 167 | } |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 168 | |
| 169 | // See if this instruction mod/ref's the pointer. |
| 170 | AliasAnalysis::ModRefResult MRR = AA.getModRefInfo(Inst, MemPtr, MemSize); |
| 171 | |
| 172 | if (MRR == AliasAnalysis::NoModRef) |
Chris Lattner | 25a0814 | 2008-11-29 08:51:16 +0000 | [diff] [blame] | 173 | continue; |
| 174 | |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 175 | // Loads don't depend on read-only instructions. |
| 176 | if (isa<LoadInst>(QueryInst) && MRR == AliasAnalysis::Ref) |
Chris Lattner | 25a0814 | 2008-11-29 08:51:16 +0000 | [diff] [blame] | 177 | continue; |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 178 | |
| 179 | // Otherwise, there is a dependence. |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 180 | return DepResultTy(Inst, Normal); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 181 | } |
| 182 | |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 183 | // If we found nothing, return the non-local flag. |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 184 | return DepResultTy(0, NonLocal); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 185 | } |
| 186 | |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 187 | /// getDependency - Return the instruction on which a memory operation |
| 188 | /// depends. |
| 189 | MemDepResult MemoryDependenceAnalysis::getDependency(Instruction *QueryInst) { |
| 190 | Instruction *ScanPos = QueryInst; |
| 191 | |
| 192 | // Check for a cached result |
| 193 | DepResultTy &LocalCache = LocalDeps[QueryInst]; |
| 194 | |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 195 | // If the cached entry is non-dirty, just return it. Note that this depends |
| 196 | // on DepResultTy's default constructing to 'dirty'. |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 197 | if (LocalCache.getInt() != Dirty) |
| 198 | return ConvToResult(LocalCache); |
| 199 | |
| 200 | // Otherwise, if we have a dirty entry, we know we can start the scan at that |
| 201 | // instruction, which may save us some work. |
| 202 | if (Instruction *Inst = LocalCache.getPointer()) |
| 203 | ScanPos = Inst; |
| 204 | |
| 205 | // Do the scan. |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 206 | LocalCache = getDependencyFromInternal(QueryInst, ScanPos, |
| 207 | QueryInst->getParent()); |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 208 | |
| 209 | // Remember the result! |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 210 | if (Instruction *I = LocalCache.getPointer()) |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 211 | ReverseLocalDeps[I].insert(QueryInst); |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 212 | |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 213 | return ConvToResult(LocalCache); |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 214 | } |
| 215 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 216 | /// getNonLocalDependency - Perform a full dependency query for the |
| 217 | /// specified instruction, returning the set of blocks that the value is |
| 218 | /// potentially live across. The returned set of results will include a |
| 219 | /// "NonLocal" result for all blocks where the value is live across. |
| 220 | /// |
| 221 | /// This method assumes the instruction returns a "nonlocal" dependency |
| 222 | /// within its own block. |
| 223 | /// |
| 224 | void MemoryDependenceAnalysis:: |
| 225 | getNonLocalDependency(Instruction *QueryInst, |
| 226 | SmallVectorImpl<std::pair<BasicBlock*, |
| 227 | MemDepResult> > &Result) { |
| 228 | assert(getDependency(QueryInst).isNonLocal() && |
| 229 | "getNonLocalDependency should only be used on insts with non-local deps!"); |
| 230 | DenseMap<BasicBlock*, DepResultTy> &Cache = NonLocalDeps[QueryInst]; |
| 231 | |
| 232 | /// DirtyBlocks - This is the set of blocks that need to be recomputed. In |
| 233 | /// the cached case, this can happen due to instructions being deleted etc. In |
| 234 | /// the uncached case, this starts out as the set of predecessors we care |
| 235 | /// about. |
| 236 | SmallVector<BasicBlock*, 32> DirtyBlocks; |
| 237 | |
| 238 | if (!Cache.empty()) { |
| 239 | // If we already have a partially computed set of results, scan them to |
| 240 | // determine what is dirty, seeding our initial DirtyBlocks worklist. |
| 241 | // FIXME: In the "don't need to be updated" case, this is expensive, why not |
| 242 | // have a per-"cache" flag saying it is undirty? |
| 243 | for (DenseMap<BasicBlock*, DepResultTy>::iterator I = Cache.begin(), |
| 244 | E = Cache.end(); I != E; ++I) |
| 245 | if (I->second.getInt() == Dirty) |
| 246 | DirtyBlocks.push_back(I->first); |
| 247 | |
| 248 | NumCacheNonLocal++; |
| 249 | |
| 250 | //cerr << "CACHED CASE: " << DirtyBlocks.size() << " dirty: " |
| 251 | // << Cache.size() << " cached: " << *QueryInst; |
| 252 | } else { |
| 253 | // Seed DirtyBlocks with each of the preds of QueryInst's block. |
| 254 | BasicBlock *QueryBB = QueryInst->getParent(); |
| 255 | DirtyBlocks.append(pred_begin(QueryBB), pred_end(QueryBB)); |
| 256 | NumUncacheNonLocal++; |
| 257 | } |
| 258 | |
| 259 | // Iterate while we still have blocks to update. |
| 260 | while (!DirtyBlocks.empty()) { |
| 261 | BasicBlock *DirtyBB = DirtyBlocks.back(); |
| 262 | DirtyBlocks.pop_back(); |
| 263 | |
| 264 | // Get the entry for this block. Note that this relies on DepResultTy |
| 265 | // default initializing to Dirty. |
| 266 | DepResultTy &DirtyBBEntry = Cache[DirtyBB]; |
| 267 | |
| 268 | // If DirtyBBEntry isn't dirty, it ended up on the worklist multiple times. |
| 269 | if (DirtyBBEntry.getInt() != Dirty) continue; |
| 270 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 271 | // If the dirty entry has a pointer, start scanning from it so we don't have |
| 272 | // to rescan the entire block. |
| 273 | BasicBlock::iterator ScanPos = DirtyBB->end(); |
| 274 | if (Instruction *Inst = DirtyBBEntry.getPointer()) |
| 275 | ScanPos = Inst; |
| 276 | |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 277 | // Find out if this block has a local dependency for QueryInst. |
| 278 | DirtyBBEntry = getDependencyFromInternal(QueryInst, ScanPos, DirtyBB); |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 279 | |
| 280 | // If the block has a dependency (i.e. it isn't completely transparent to |
| 281 | // the value), remember it! |
| 282 | if (DirtyBBEntry.getInt() != NonLocal) { |
| 283 | // Keep the ReverseNonLocalDeps map up to date so we can efficiently |
| 284 | // update this when we remove instructions. |
| 285 | if (Instruction *Inst = DirtyBBEntry.getPointer()) |
| 286 | ReverseNonLocalDeps[Inst].insert(QueryInst); |
| 287 | continue; |
| 288 | } |
| 289 | |
| 290 | // If the block *is* completely transparent to the load, we need to check |
| 291 | // the predecessors of this block. Add them to our worklist. |
| 292 | DirtyBlocks.append(pred_begin(DirtyBB), pred_end(DirtyBB)); |
| 293 | } |
| 294 | |
| 295 | |
| 296 | // Copy the result into the output set. |
| 297 | for (DenseMap<BasicBlock*, DepResultTy>::iterator I = Cache.begin(), |
| 298 | E = Cache.end(); I != E; ++I) |
| 299 | Result.push_back(std::make_pair(I->first, ConvToResult(I->second))); |
| 300 | } |
| 301 | |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 302 | /// removeInstruction - Remove an instruction from the dependence analysis, |
| 303 | /// updating the dependence of instructions that previously depended on it. |
Owen Anderson | 642a9e3 | 2007-08-08 22:26:03 +0000 | [diff] [blame] | 304 | /// This method attempts to keep the cache coherent using the reverse map. |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 305 | void MemoryDependenceAnalysis::removeInstruction(Instruction *RemInst) { |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 306 | // Walk through the Non-local dependencies, removing this one as the value |
| 307 | // for any cached queries. |
Chris Lattner | 39f372e | 2008-11-29 01:43:36 +0000 | [diff] [blame] | 308 | for (DenseMap<BasicBlock*, DepResultTy>::iterator DI = |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 309 | NonLocalDeps[RemInst].begin(), DE = NonLocalDeps[RemInst].end(); |
Owen Anderson | 5fc4aba | 2007-12-08 01:37:09 +0000 | [diff] [blame] | 310 | DI != DE; ++DI) |
Chris Lattner | 7f52422 | 2008-11-29 03:22:12 +0000 | [diff] [blame] | 311 | if (Instruction *Inst = DI->second.getPointer()) |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 312 | ReverseNonLocalDeps[Inst].erase(RemInst); |
Owen Anderson | 5fc4aba | 2007-12-08 01:37:09 +0000 | [diff] [blame] | 313 | |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 314 | // If we have a cached local dependence query for this instruction, remove it. |
Chris Lattner | baad888 | 2008-11-28 22:28:27 +0000 | [diff] [blame] | 315 | // |
Chris Lattner | 39f372e | 2008-11-29 01:43:36 +0000 | [diff] [blame] | 316 | LocalDepMapType::iterator LocalDepEntry = LocalDeps.find(RemInst); |
| 317 | if (LocalDepEntry != LocalDeps.end()) { |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 318 | // Remove us from DepInst's reverse set now that the local dep info is gone. |
| 319 | if (Instruction *Inst = LocalDepEntry->second.getPointer()) { |
| 320 | SmallPtrSet<Instruction*, 4> &RLD = ReverseLocalDeps[Inst]; |
| 321 | RLD.erase(RemInst); |
| 322 | if (RLD.empty()) |
| 323 | ReverseLocalDeps.erase(Inst); |
| 324 | } |
| 325 | |
Chris Lattner | baad888 | 2008-11-28 22:28:27 +0000 | [diff] [blame] | 326 | // Remove this local dependency info. |
Chris Lattner | 39f372e | 2008-11-29 01:43:36 +0000 | [diff] [blame] | 327 | LocalDeps.erase(LocalDepEntry); |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 328 | } |
Chris Lattner | baad888 | 2008-11-28 22:28:27 +0000 | [diff] [blame] | 329 | |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 330 | // Loop over all of the things that depend on the instruction we're removing. |
| 331 | // |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 332 | SmallVector<std::pair<Instruction*, Instruction*>, 8> ReverseDepsToAdd; |
| 333 | |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 334 | ReverseDepMapType::iterator ReverseDepIt = ReverseLocalDeps.find(RemInst); |
| 335 | if (ReverseDepIt != ReverseLocalDeps.end()) { |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 336 | SmallPtrSet<Instruction*, 4> &ReverseDeps = ReverseDepIt->second; |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 337 | // RemInst can't be the terminator if it has stuff depending on it. |
| 338 | assert(!ReverseDeps.empty() && !isa<TerminatorInst>(RemInst) && |
| 339 | "Nothing can locally depend on a terminator"); |
| 340 | |
| 341 | // Anything that was locally dependent on RemInst is now going to be |
| 342 | // dependent on the instruction after RemInst. It will have the dirty flag |
| 343 | // set so it will rescan. This saves having to scan the entire block to get |
| 344 | // to this point. |
| 345 | Instruction *NewDepInst = next(BasicBlock::iterator(RemInst)); |
| 346 | |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 347 | for (SmallPtrSet<Instruction*, 4>::iterator I = ReverseDeps.begin(), |
| 348 | E = ReverseDeps.end(); I != E; ++I) { |
| 349 | Instruction *InstDependingOnRemInst = *I; |
| 350 | |
| 351 | // If we thought the instruction depended on itself (possible for |
| 352 | // unconfirmed dependencies) ignore the update. |
| 353 | if (InstDependingOnRemInst == RemInst) continue; |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 354 | |
| 355 | LocalDeps[InstDependingOnRemInst] = DepResultTy(NewDepInst, Dirty); |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 356 | |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 357 | // Make sure to remember that new things depend on NewDepInst. |
| 358 | ReverseDepsToAdd.push_back(std::make_pair(NewDepInst, |
| 359 | InstDependingOnRemInst)); |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 360 | } |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 361 | |
| 362 | ReverseLocalDeps.erase(ReverseDepIt); |
| 363 | |
| 364 | // Add new reverse deps after scanning the set, to avoid invalidating the |
| 365 | // 'ReverseDeps' reference. |
| 366 | while (!ReverseDepsToAdd.empty()) { |
| 367 | ReverseLocalDeps[ReverseDepsToAdd.back().first] |
| 368 | .insert(ReverseDepsToAdd.back().second); |
| 369 | ReverseDepsToAdd.pop_back(); |
| 370 | } |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 371 | } |
Owen Anderson | 4d13de4 | 2007-08-16 21:27:05 +0000 | [diff] [blame] | 372 | |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 373 | ReverseDepIt = ReverseNonLocalDeps.find(RemInst); |
| 374 | if (ReverseDepIt != ReverseNonLocalDeps.end()) { |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 375 | SmallPtrSet<Instruction*, 4>& set = ReverseDepIt->second; |
Owen Anderson | 4d13de4 | 2007-08-16 21:27:05 +0000 | [diff] [blame] | 376 | for (SmallPtrSet<Instruction*, 4>::iterator I = set.begin(), E = set.end(); |
| 377 | I != E; ++I) |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 378 | for (DenseMap<BasicBlock*, DepResultTy>::iterator |
| 379 | DI = NonLocalDeps[*I].begin(), DE = NonLocalDeps[*I].end(); |
Owen Anderson | ce4d88a | 2007-09-21 03:53:52 +0000 | [diff] [blame] | 380 | DI != DE; ++DI) |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 381 | if (DI->second.getPointer() == RemInst) { |
| 382 | // Convert to a dirty entry for the subsequent instruction. |
| 383 | DI->second.setInt(Dirty); |
| 384 | if (RemInst->isTerminator()) |
| 385 | DI->second.setPointer(0); |
| 386 | else { |
| 387 | Instruction *NextI = next(BasicBlock::iterator(RemInst)); |
| 388 | DI->second.setPointer(NextI); |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 389 | assert(NextI != RemInst); |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 390 | ReverseDepsToAdd.push_back(std::make_pair(NextI, *I)); |
| 391 | } |
| 392 | } |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 393 | |
| 394 | ReverseNonLocalDeps.erase(ReverseDepIt); |
| 395 | |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 396 | // Add new reverse deps after scanning the set, to avoid invalidating 'Set' |
| 397 | while (!ReverseDepsToAdd.empty()) { |
| 398 | ReverseNonLocalDeps[ReverseDepsToAdd.back().first] |
| 399 | .insert(ReverseDepsToAdd.back().second); |
| 400 | ReverseDepsToAdd.pop_back(); |
| 401 | } |
Owen Anderson | 4d13de4 | 2007-08-16 21:27:05 +0000 | [diff] [blame] | 402 | } |
Owen Anderson | 5fc4aba | 2007-12-08 01:37:09 +0000 | [diff] [blame] | 403 | |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 404 | NonLocalDeps.erase(RemInst); |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 405 | getAnalysis<AliasAnalysis>().deleteValue(RemInst); |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 406 | DEBUG(verifyRemoved(RemInst)); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 407 | } |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 408 | |
| 409 | /// verifyRemoved - Verify that the specified instruction does not occur |
| 410 | /// in our internal data structures. |
| 411 | void MemoryDependenceAnalysis::verifyRemoved(Instruction *D) const { |
| 412 | for (LocalDepMapType::const_iterator I = LocalDeps.begin(), |
| 413 | E = LocalDeps.end(); I != E; ++I) { |
| 414 | assert(I->first != D && "Inst occurs in data structures"); |
| 415 | assert(I->second.getPointer() != D && |
| 416 | "Inst occurs in data structures"); |
| 417 | } |
| 418 | |
| 419 | for (NonLocalDepMapType::const_iterator I = NonLocalDeps.begin(), |
| 420 | E = NonLocalDeps.end(); I != E; ++I) { |
| 421 | assert(I->first != D && "Inst occurs in data structures"); |
| 422 | for (DenseMap<BasicBlock*, DepResultTy>::iterator II = I->second.begin(), |
| 423 | EE = I->second.end(); II != EE; ++II) |
| 424 | assert(II->second.getPointer() != D && "Inst occurs in data structures"); |
| 425 | } |
| 426 | |
| 427 | for (ReverseDepMapType::const_iterator I = ReverseLocalDeps.begin(), |
| 428 | E = ReverseLocalDeps.end(); I != E; ++I) |
| 429 | for (SmallPtrSet<Instruction*, 4>::const_iterator II = I->second.begin(), |
| 430 | EE = I->second.end(); II != EE; ++II) |
| 431 | assert(*II != D && "Inst occurs in data structures"); |
| 432 | |
| 433 | for (ReverseDepMapType::const_iterator I = ReverseNonLocalDeps.begin(), |
| 434 | E = ReverseNonLocalDeps.end(); |
| 435 | I != E; ++I) |
| 436 | for (SmallPtrSet<Instruction*, 4>::const_iterator II = I->second.begin(), |
| 437 | EE = I->second.end(); II != EE; ++II) |
| 438 | assert(*II != D && "Inst occurs in data structures"); |
| 439 | } |