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 | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 31 | STATISTIC(NumCacheNonLocal, "Number of fully cached non-local responses"); |
| 32 | STATISTIC(NumCacheDirtyNonLocal, "Number of dirty cached non-local responses"); |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 33 | STATISTIC(NumUncacheNonLocal, "Number of uncached non-local responses"); |
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 | |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 48 | bool MemoryDependenceAnalysis::runOnFunction(Function &) { |
| 49 | AA = &getAnalysis<AliasAnalysis>(); |
| 50 | TD = &getAnalysis<TargetData>(); |
| 51 | return false; |
| 52 | } |
| 53 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 54 | |
Chris Lattner | 8ef57c5 | 2008-12-07 00:35:51 +0000 | [diff] [blame] | 55 | /// getCallSiteDependencyFrom - Private helper for finding the local |
| 56 | /// dependencies of a call site. |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 57 | MemDepResult MemoryDependenceAnalysis:: |
Chris Lattner | 8ef57c5 | 2008-12-07 00:35:51 +0000 | [diff] [blame] | 58 | getCallSiteDependencyFrom(CallSite CS, BasicBlock::iterator ScanIt, |
| 59 | BasicBlock *BB) { |
Owen Anderson | 642a9e3 | 2007-08-08 22:26:03 +0000 | [diff] [blame] | 60 | // Walk backwards through the block, looking for dependencies |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 61 | while (ScanIt != BB->begin()) { |
| 62 | Instruction *Inst = --ScanIt; |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 63 | |
| 64 | // If this inst is a memory op, get the pointer it accessed |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 65 | Value *Pointer = 0; |
| 66 | uint64_t PointerSize = 0; |
| 67 | if (StoreInst *S = dyn_cast<StoreInst>(Inst)) { |
| 68 | Pointer = S->getPointerOperand(); |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 69 | PointerSize = TD->getTypeStoreSize(S->getOperand(0)->getType()); |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 70 | } else if (VAArgInst *V = dyn_cast<VAArgInst>(Inst)) { |
| 71 | Pointer = V->getOperand(0); |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 72 | PointerSize = TD->getTypeStoreSize(V->getType()); |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 73 | } else if (FreeInst *F = dyn_cast<FreeInst>(Inst)) { |
| 74 | Pointer = F->getPointerOperand(); |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 75 | |
| 76 | // FreeInsts erase the entire structure |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 77 | PointerSize = ~0UL; |
| 78 | } else if (isa<CallInst>(Inst) || isa<InvokeInst>(Inst)) { |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 79 | CallSite InstCS = CallSite::get(Inst); |
| 80 | // If these two calls do not interfere, look past it. |
| 81 | if (AA->getModRefInfo(CS, InstCS) == AliasAnalysis::NoModRef) |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 82 | continue; |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 83 | |
| 84 | // FIXME: If this is a ref/ref result, we should ignore it! |
| 85 | // X = strlen(P); |
| 86 | // Y = strlen(Q); |
| 87 | // Z = strlen(P); // Z = X |
| 88 | |
| 89 | // If they interfere, we generally return clobber. However, if they are |
| 90 | // calls to the same read-only functions we return Def. |
| 91 | if (!AA->onlyReadsMemory(CS) || CS.getCalledFunction() == 0 || |
| 92 | CS.getCalledFunction() != InstCS.getCalledFunction()) |
| 93 | return MemDepResult::getClobber(Inst); |
| 94 | return MemDepResult::getDef(Inst); |
Chris Lattner | cfbb634 | 2008-11-30 01:44:00 +0000 | [diff] [blame] | 95 | } else { |
| 96 | // Non-memory instruction. |
Owen Anderson | 202da14 | 2007-07-10 20:39:07 +0000 | [diff] [blame] | 97 | continue; |
Chris Lattner | cfbb634 | 2008-11-30 01:44:00 +0000 | [diff] [blame] | 98 | } |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 99 | |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 100 | if (AA->getModRefInfo(CS, Pointer, PointerSize) != AliasAnalysis::NoModRef) |
| 101 | return MemDepResult::getClobber(Inst); |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 102 | } |
| 103 | |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 104 | // No dependence found. |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 105 | return MemDepResult::getNonLocal(); |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 106 | } |
| 107 | |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame^] | 108 | /// getPointerDependencyFrom - Return the instruction on which a memory |
| 109 | /// location depends. If isLoad is true, this routine ignore may-aliases with |
| 110 | /// read-only operations. |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 111 | MemDepResult MemoryDependenceAnalysis:: |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame^] | 112 | getPointerDependencyFrom(Value *MemPtr, uint64_t MemSize, bool isLoad, |
| 113 | BasicBlock::iterator ScanIt, BasicBlock *BB) { |
Chris Lattner | 84b9a56 | 2008-12-07 00:21:18 +0000 | [diff] [blame] | 114 | // The first instruction in a block is always non-local. |
| 115 | if (ScanIt == BB->begin()) |
| 116 | return MemDepResult::getNonLocal(); |
| 117 | |
Owen Anderson | 642a9e3 | 2007-08-08 22:26:03 +0000 | [diff] [blame] | 118 | // Walk backwards through the basic block, looking for dependencies |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 119 | while (ScanIt != BB->begin()) { |
| 120 | Instruction *Inst = --ScanIt; |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 121 | |
Chris Lattner | cfbb634 | 2008-11-30 01:44:00 +0000 | [diff] [blame] | 122 | // Values depend on loads if the pointers are must aliased. This means that |
| 123 | // a load depends on another must aliased load from the same value. |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 124 | if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) { |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 125 | Value *Pointer = LI->getPointerOperand(); |
| 126 | uint64_t PointerSize = TD->getTypeStoreSize(LI->getType()); |
| 127 | |
| 128 | // If we found a pointer, check if it could be the same as our pointer. |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 129 | AliasAnalysis::AliasResult R = |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 130 | AA->alias(Pointer, PointerSize, MemPtr, MemSize); |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 131 | if (R == AliasAnalysis::NoAlias) |
| 132 | continue; |
| 133 | |
| 134 | // May-alias loads don't depend on each other without a dependence. |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame^] | 135 | if (isLoad && R == AliasAnalysis::MayAlias) |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 136 | continue; |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 137 | return MemDepResult::getDef(Inst); |
| 138 | } |
| 139 | |
| 140 | if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) { |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 141 | Value *Pointer = SI->getPointerOperand(); |
| 142 | uint64_t PointerSize = TD->getTypeStoreSize(SI->getOperand(0)->getType()); |
| 143 | |
| 144 | // If we found a pointer, check if it could be the same as our pointer. |
| 145 | AliasAnalysis::AliasResult R = |
| 146 | AA->alias(Pointer, PointerSize, MemPtr, MemSize); |
| 147 | |
| 148 | if (R == AliasAnalysis::NoAlias) |
| 149 | continue; |
| 150 | if (R == AliasAnalysis::MayAlias) |
| 151 | return MemDepResult::getClobber(Inst); |
| 152 | return MemDepResult::getDef(Inst); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 153 | } |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 154 | |
| 155 | // If this is an allocation, and if we know that the accessed pointer is to |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 156 | // the allocation, return Def. This means that there is no dependence and |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 157 | // the access can be optimized based on that. For example, a load could |
| 158 | // turn into undef. |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 159 | if (AllocationInst *AI = dyn_cast<AllocationInst>(Inst)) { |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 160 | Value *AccessPtr = MemPtr->getUnderlyingObject(); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 161 | |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 162 | if (AccessPtr == AI || |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 163 | AA->alias(AI, 1, AccessPtr, 1) == AliasAnalysis::MustAlias) |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 164 | return MemDepResult::getDef(AI); |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 165 | continue; |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 166 | } |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 167 | |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 168 | // See if this instruction (e.g. a call or vaarg) mod/ref's the pointer. |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame^] | 169 | // FIXME: If this is a load, we should ignore readonly calls! |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 170 | if (AA->getModRefInfo(Inst, MemPtr, MemSize) == AliasAnalysis::NoModRef) |
Chris Lattner | 25a0814 | 2008-11-29 08:51:16 +0000 | [diff] [blame] | 171 | continue; |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 172 | |
| 173 | // Otherwise, there is a dependence. |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 174 | return MemDepResult::getClobber(Inst); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 175 | } |
| 176 | |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 177 | // If we found nothing, return the non-local flag. |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 178 | return MemDepResult::getNonLocal(); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 179 | } |
| 180 | |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 181 | /// getDependency - Return the instruction on which a memory operation |
| 182 | /// depends. |
| 183 | MemDepResult MemoryDependenceAnalysis::getDependency(Instruction *QueryInst) { |
| 184 | Instruction *ScanPos = QueryInst; |
| 185 | |
| 186 | // Check for a cached result |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 187 | MemDepResult &LocalCache = LocalDeps[QueryInst]; |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 188 | |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 189 | // If the cached entry is non-dirty, just return it. Note that this depends |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 190 | // on MemDepResult's default constructing to 'dirty'. |
| 191 | if (!LocalCache.isDirty()) |
| 192 | return LocalCache; |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 193 | |
| 194 | // Otherwise, if we have a dirty entry, we know we can start the scan at that |
| 195 | // instruction, which may save us some work. |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 196 | if (Instruction *Inst = LocalCache.getInst()) { |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 197 | ScanPos = Inst; |
Chris Lattner | 4a69bad | 2008-11-30 02:52:26 +0000 | [diff] [blame] | 198 | |
| 199 | SmallPtrSet<Instruction*, 4> &InstMap = ReverseLocalDeps[Inst]; |
| 200 | InstMap.erase(QueryInst); |
| 201 | if (InstMap.empty()) |
| 202 | ReverseLocalDeps.erase(Inst); |
| 203 | } |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 204 | |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame^] | 205 | BasicBlock *QueryParent = QueryInst->getParent(); |
| 206 | |
| 207 | Value *MemPtr = 0; |
| 208 | uint64_t MemSize = 0; |
| 209 | |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 210 | // Do the scan. |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame^] | 211 | if (BasicBlock::iterator(QueryInst) == QueryParent->begin()) { |
| 212 | // First instruction in the block -> non local. |
| 213 | LocalCache = MemDepResult::getNonLocal(); |
| 214 | } else if (StoreInst *SI = dyn_cast<StoreInst>(QueryInst)) { |
| 215 | // If this is a volatile store, don't mess around with it. Just return the |
| 216 | // previous instruction as a clobber. |
| 217 | if (SI->isVolatile()) |
| 218 | LocalCache = MemDepResult::getClobber(--BasicBlock::iterator(ScanPos)); |
| 219 | else { |
| 220 | MemPtr = SI->getPointerOperand(); |
| 221 | MemSize = TD->getTypeStoreSize(SI->getOperand(0)->getType()); |
| 222 | } |
| 223 | } else if (LoadInst *LI = dyn_cast<LoadInst>(QueryInst)) { |
| 224 | // If this is a volatile load, don't mess around with it. Just return the |
| 225 | // previous instruction as a clobber. |
| 226 | if (LI->isVolatile()) |
| 227 | LocalCache = MemDepResult::getClobber(--BasicBlock::iterator(ScanPos)); |
| 228 | else { |
| 229 | MemPtr = LI->getPointerOperand(); |
| 230 | MemSize = TD->getTypeStoreSize(LI->getType()); |
| 231 | } |
| 232 | } else if (isa<CallInst>(QueryInst) || isa<InvokeInst>(QueryInst)) { |
Chris Lattner | d8dd934 | 2008-12-07 01:21:14 +0000 | [diff] [blame] | 233 | LocalCache = getCallSiteDependencyFrom(CallSite::get(QueryInst), ScanPos, |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame^] | 234 | QueryParent); |
| 235 | } else if (FreeInst *FI = dyn_cast<FreeInst>(QueryInst)) { |
| 236 | MemPtr = FI->getPointerOperand(); |
| 237 | // FreeInsts erase the entire structure, not just a field. |
| 238 | MemSize = ~0UL; |
| 239 | } else { |
| 240 | // Non-memory instruction. |
| 241 | LocalCache = MemDepResult::getClobber(--BasicBlock::iterator(ScanPos)); |
| 242 | } |
| 243 | |
| 244 | // If we need to do a pointer scan, make it happen. |
| 245 | if (MemPtr) |
| 246 | LocalCache = getPointerDependencyFrom(MemPtr, MemSize, |
| 247 | isa<LoadInst>(QueryInst), |
| 248 | ScanPos, QueryParent); |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 249 | |
| 250 | // Remember the result! |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 251 | if (Instruction *I = LocalCache.getInst()) |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 252 | ReverseLocalDeps[I].insert(QueryInst); |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 253 | |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 254 | return LocalCache; |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 255 | } |
| 256 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 257 | /// getNonLocalDependency - Perform a full dependency query for the |
| 258 | /// specified instruction, returning the set of blocks that the value is |
| 259 | /// potentially live across. The returned set of results will include a |
| 260 | /// "NonLocal" result for all blocks where the value is live across. |
| 261 | /// |
| 262 | /// This method assumes the instruction returns a "nonlocal" dependency |
| 263 | /// within its own block. |
| 264 | /// |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 265 | const MemoryDependenceAnalysis::NonLocalDepInfo & |
| 266 | MemoryDependenceAnalysis::getNonLocalDependency(Instruction *QueryInst) { |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame^] | 267 | assert(isa<CallInst>(QueryInst) || isa<InvokeInst>(QueryInst) || |
| 268 | isa<LoadInst>(QueryInst) || isa<StoreInst>(QueryInst)); |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 269 | assert(getDependency(QueryInst).isNonLocal() && |
| 270 | "getNonLocalDependency should only be used on insts with non-local deps!"); |
Chris Lattner | 4a69bad | 2008-11-30 02:52:26 +0000 | [diff] [blame] | 271 | PerInstNLInfo &CacheP = NonLocalDeps[QueryInst]; |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 272 | NonLocalDepInfo &Cache = CacheP.first; |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 273 | |
| 274 | /// DirtyBlocks - This is the set of blocks that need to be recomputed. In |
| 275 | /// the cached case, this can happen due to instructions being deleted etc. In |
| 276 | /// the uncached case, this starts out as the set of predecessors we care |
| 277 | /// about. |
| 278 | SmallVector<BasicBlock*, 32> DirtyBlocks; |
| 279 | |
| 280 | if (!Cache.empty()) { |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 281 | // Okay, we have a cache entry. If we know it is not dirty, just return it |
| 282 | // with no computation. |
| 283 | if (!CacheP.second) { |
| 284 | NumCacheNonLocal++; |
| 285 | return Cache; |
| 286 | } |
| 287 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 288 | // If we already have a partially computed set of results, scan them to |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 289 | // determine what is dirty, seeding our initial DirtyBlocks worklist. |
| 290 | for (NonLocalDepInfo::iterator I = Cache.begin(), E = Cache.end(); |
| 291 | I != E; ++I) |
| 292 | if (I->second.isDirty()) |
| 293 | DirtyBlocks.push_back(I->first); |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 294 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 295 | // Sort the cache so that we can do fast binary search lookups below. |
| 296 | std::sort(Cache.begin(), Cache.end()); |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 297 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 298 | ++NumCacheDirtyNonLocal; |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 299 | //cerr << "CACHED CASE: " << DirtyBlocks.size() << " dirty: " |
| 300 | // << Cache.size() << " cached: " << *QueryInst; |
| 301 | } else { |
| 302 | // Seed DirtyBlocks with each of the preds of QueryInst's block. |
| 303 | BasicBlock *QueryBB = QueryInst->getParent(); |
| 304 | DirtyBlocks.append(pred_begin(QueryBB), pred_end(QueryBB)); |
| 305 | NumUncacheNonLocal++; |
| 306 | } |
| 307 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 308 | // Visited checked first, vector in sorted order. |
| 309 | SmallPtrSet<BasicBlock*, 64> Visited; |
| 310 | |
| 311 | unsigned NumSortedEntries = Cache.size(); |
| 312 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 313 | // Iterate while we still have blocks to update. |
| 314 | while (!DirtyBlocks.empty()) { |
| 315 | BasicBlock *DirtyBB = DirtyBlocks.back(); |
| 316 | DirtyBlocks.pop_back(); |
| 317 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 318 | // Already processed this block? |
| 319 | if (!Visited.insert(DirtyBB)) |
| 320 | continue; |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 321 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 322 | // Do a binary search to see if we already have an entry for this block in |
| 323 | // the cache set. If so, find it. |
| 324 | NonLocalDepInfo::iterator Entry = |
| 325 | std::upper_bound(Cache.begin(), Cache.begin()+NumSortedEntries, |
| 326 | std::make_pair(DirtyBB, MemDepResult())); |
| 327 | if (Entry != Cache.begin() && (&*Entry)[-1].first == DirtyBB) |
| 328 | --Entry; |
| 329 | |
| 330 | MemDepResult *ExistingResult = 0; |
| 331 | if (Entry != Cache.begin()+NumSortedEntries && |
| 332 | Entry->first == DirtyBB) { |
| 333 | // If we already have an entry, and if it isn't already dirty, the block |
| 334 | // is done. |
| 335 | if (!Entry->second.isDirty()) |
| 336 | continue; |
| 337 | |
| 338 | // Otherwise, remember this slot so we can update the value. |
| 339 | ExistingResult = &Entry->second; |
| 340 | } |
| 341 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 342 | // If the dirty entry has a pointer, start scanning from it so we don't have |
| 343 | // to rescan the entire block. |
| 344 | BasicBlock::iterator ScanPos = DirtyBB->end(); |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 345 | if (ExistingResult) { |
| 346 | if (Instruction *Inst = ExistingResult->getInst()) { |
| 347 | ScanPos = Inst; |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 348 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 349 | // We're removing QueryInst's use of Inst. |
| 350 | SmallPtrSet<Instruction*, 4> &InstMap = ReverseNonLocalDeps[Inst]; |
| 351 | InstMap.erase(QueryInst); |
| 352 | if (InstMap.empty()) ReverseNonLocalDeps.erase(Inst); |
| 353 | } |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 354 | } |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 355 | |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 356 | // Find out if this block has a local dependency for QueryInst. |
Chris Lattner | d8dd934 | 2008-12-07 01:21:14 +0000 | [diff] [blame] | 357 | MemDepResult Dep; |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame^] | 358 | |
| 359 | Value *MemPtr = 0; |
| 360 | uint64_t MemSize = 0; |
| 361 | |
| 362 | if (BasicBlock::iterator(QueryInst) == DirtyBB->begin()) { |
| 363 | // First instruction in the block -> non local. |
| 364 | Dep = MemDepResult::getNonLocal(); |
| 365 | } else if (StoreInst *SI = dyn_cast<StoreInst>(QueryInst)) { |
| 366 | // If this is a volatile store, don't mess around with it. Just return the |
| 367 | // previous instruction as a clobber. |
| 368 | if (SI->isVolatile()) |
| 369 | Dep = MemDepResult::getClobber(--BasicBlock::iterator(ScanPos)); |
| 370 | else { |
| 371 | MemPtr = SI->getPointerOperand(); |
| 372 | MemSize = TD->getTypeStoreSize(SI->getOperand(0)->getType()); |
| 373 | } |
| 374 | } else if (LoadInst *LI = dyn_cast<LoadInst>(QueryInst)) { |
| 375 | // If this is a volatile load, don't mess around with it. Just return the |
| 376 | // previous instruction as a clobber. |
| 377 | if (LI->isVolatile()) |
| 378 | Dep = MemDepResult::getClobber(--BasicBlock::iterator(ScanPos)); |
| 379 | else { |
| 380 | MemPtr = LI->getPointerOperand(); |
| 381 | MemSize = TD->getTypeStoreSize(LI->getType()); |
| 382 | } |
| 383 | } else { |
| 384 | assert(isa<CallInst>(QueryInst) || isa<InvokeInst>(QueryInst)); |
Chris Lattner | d8dd934 | 2008-12-07 01:21:14 +0000 | [diff] [blame] | 385 | Dep = getCallSiteDependencyFrom(CallSite::get(QueryInst), ScanPos, |
| 386 | DirtyBB); |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame^] | 387 | } |
| 388 | |
| 389 | if (MemPtr) |
| 390 | Dep = getPointerDependencyFrom(MemPtr, MemSize, isa<LoadInst>(QueryInst), |
| 391 | ScanPos, DirtyBB); |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 392 | |
| 393 | // If we had a dirty entry for the block, update it. Otherwise, just add |
| 394 | // a new entry. |
| 395 | if (ExistingResult) |
| 396 | *ExistingResult = Dep; |
| 397 | else |
| 398 | Cache.push_back(std::make_pair(DirtyBB, Dep)); |
| 399 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 400 | // If the block has a dependency (i.e. it isn't completely transparent to |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 401 | // the value), remember the association! |
| 402 | if (!Dep.isNonLocal()) { |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 403 | // Keep the ReverseNonLocalDeps map up to date so we can efficiently |
| 404 | // update this when we remove instructions. |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 405 | if (Instruction *Inst = Dep.getInst()) |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 406 | ReverseNonLocalDeps[Inst].insert(QueryInst); |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 407 | } else { |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 408 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 409 | // If the block *is* completely transparent to the load, we need to check |
| 410 | // the predecessors of this block. Add them to our worklist. |
| 411 | DirtyBlocks.append(pred_begin(DirtyBB), pred_end(DirtyBB)); |
| 412 | } |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 413 | } |
| 414 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 415 | return Cache; |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 416 | } |
| 417 | |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 418 | /// removeInstruction - Remove an instruction from the dependence analysis, |
| 419 | /// updating the dependence of instructions that previously depended on it. |
Owen Anderson | 642a9e3 | 2007-08-08 22:26:03 +0000 | [diff] [blame] | 420 | /// This method attempts to keep the cache coherent using the reverse map. |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 421 | void MemoryDependenceAnalysis::removeInstruction(Instruction *RemInst) { |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 422 | // Walk through the Non-local dependencies, removing this one as the value |
| 423 | // for any cached queries. |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 424 | NonLocalDepMapType::iterator NLDI = NonLocalDeps.find(RemInst); |
| 425 | if (NLDI != NonLocalDeps.end()) { |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 426 | NonLocalDepInfo &BlockMap = NLDI->second.first; |
Chris Lattner | 25f4b2b | 2008-11-30 02:30:50 +0000 | [diff] [blame] | 427 | for (NonLocalDepInfo::iterator DI = BlockMap.begin(), DE = BlockMap.end(); |
| 428 | DI != DE; ++DI) |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 429 | if (Instruction *Inst = DI->second.getInst()) |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 430 | ReverseNonLocalDeps[Inst].erase(RemInst); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 431 | NonLocalDeps.erase(NLDI); |
| 432 | } |
Owen Anderson | 5fc4aba | 2007-12-08 01:37:09 +0000 | [diff] [blame] | 433 | |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 434 | // 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] | 435 | // |
Chris Lattner | 39f372e | 2008-11-29 01:43:36 +0000 | [diff] [blame] | 436 | LocalDepMapType::iterator LocalDepEntry = LocalDeps.find(RemInst); |
| 437 | if (LocalDepEntry != LocalDeps.end()) { |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 438 | // Remove us from DepInst's reverse set now that the local dep info is gone. |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 439 | if (Instruction *Inst = LocalDepEntry->second.getInst()) { |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 440 | SmallPtrSet<Instruction*, 4> &RLD = ReverseLocalDeps[Inst]; |
| 441 | RLD.erase(RemInst); |
| 442 | if (RLD.empty()) |
| 443 | ReverseLocalDeps.erase(Inst); |
| 444 | } |
| 445 | |
Chris Lattner | baad888 | 2008-11-28 22:28:27 +0000 | [diff] [blame] | 446 | // Remove this local dependency info. |
Chris Lattner | 39f372e | 2008-11-29 01:43:36 +0000 | [diff] [blame] | 447 | LocalDeps.erase(LocalDepEntry); |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 448 | } |
Chris Lattner | baad888 | 2008-11-28 22:28:27 +0000 | [diff] [blame] | 449 | |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 450 | // Loop over all of the things that depend on the instruction we're removing. |
| 451 | // |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 452 | SmallVector<std::pair<Instruction*, Instruction*>, 8> ReverseDepsToAdd; |
| 453 | |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 454 | ReverseDepMapType::iterator ReverseDepIt = ReverseLocalDeps.find(RemInst); |
| 455 | if (ReverseDepIt != ReverseLocalDeps.end()) { |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 456 | SmallPtrSet<Instruction*, 4> &ReverseDeps = ReverseDepIt->second; |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 457 | // RemInst can't be the terminator if it has stuff depending on it. |
| 458 | assert(!ReverseDeps.empty() && !isa<TerminatorInst>(RemInst) && |
| 459 | "Nothing can locally depend on a terminator"); |
| 460 | |
| 461 | // Anything that was locally dependent on RemInst is now going to be |
| 462 | // dependent on the instruction after RemInst. It will have the dirty flag |
| 463 | // set so it will rescan. This saves having to scan the entire block to get |
| 464 | // to this point. |
| 465 | Instruction *NewDepInst = next(BasicBlock::iterator(RemInst)); |
| 466 | |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 467 | for (SmallPtrSet<Instruction*, 4>::iterator I = ReverseDeps.begin(), |
| 468 | E = ReverseDeps.end(); I != E; ++I) { |
| 469 | Instruction *InstDependingOnRemInst = *I; |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 470 | assert(InstDependingOnRemInst != RemInst && |
| 471 | "Already removed our local dep info"); |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 472 | |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 473 | LocalDeps[InstDependingOnRemInst] = MemDepResult::getDirty(NewDepInst); |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 474 | |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 475 | // Make sure to remember that new things depend on NewDepInst. |
| 476 | ReverseDepsToAdd.push_back(std::make_pair(NewDepInst, |
| 477 | InstDependingOnRemInst)); |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 478 | } |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 479 | |
| 480 | ReverseLocalDeps.erase(ReverseDepIt); |
| 481 | |
| 482 | // Add new reverse deps after scanning the set, to avoid invalidating the |
| 483 | // 'ReverseDeps' reference. |
| 484 | while (!ReverseDepsToAdd.empty()) { |
| 485 | ReverseLocalDeps[ReverseDepsToAdd.back().first] |
| 486 | .insert(ReverseDepsToAdd.back().second); |
| 487 | ReverseDepsToAdd.pop_back(); |
| 488 | } |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 489 | } |
Owen Anderson | 4d13de4 | 2007-08-16 21:27:05 +0000 | [diff] [blame] | 490 | |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 491 | ReverseDepIt = ReverseNonLocalDeps.find(RemInst); |
| 492 | if (ReverseDepIt != ReverseNonLocalDeps.end()) { |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 493 | SmallPtrSet<Instruction*, 4>& set = ReverseDepIt->second; |
Owen Anderson | 4d13de4 | 2007-08-16 21:27:05 +0000 | [diff] [blame] | 494 | for (SmallPtrSet<Instruction*, 4>::iterator I = set.begin(), E = set.end(); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 495 | I != E; ++I) { |
| 496 | assert(*I != RemInst && "Already removed NonLocalDep info for RemInst"); |
| 497 | |
Chris Lattner | 4a69bad | 2008-11-30 02:52:26 +0000 | [diff] [blame] | 498 | PerInstNLInfo &INLD = NonLocalDeps[*I]; |
Chris Lattner | 4a69bad | 2008-11-30 02:52:26 +0000 | [diff] [blame] | 499 | // The information is now dirty! |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 500 | INLD.second = true; |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 501 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 502 | for (NonLocalDepInfo::iterator DI = INLD.first.begin(), |
| 503 | DE = INLD.first.end(); DI != DE; ++DI) { |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 504 | if (DI->second.getInst() != RemInst) continue; |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 505 | |
| 506 | // Convert to a dirty entry for the subsequent instruction. |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 507 | Instruction *NextI = 0; |
| 508 | if (!RemInst->isTerminator()) { |
| 509 | NextI = next(BasicBlock::iterator(RemInst)); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 510 | ReverseDepsToAdd.push_back(std::make_pair(NextI, *I)); |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 511 | } |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 512 | DI->second = MemDepResult::getDirty(NextI); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 513 | } |
| 514 | } |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 515 | |
| 516 | ReverseNonLocalDeps.erase(ReverseDepIt); |
| 517 | |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 518 | // Add new reverse deps after scanning the set, to avoid invalidating 'Set' |
| 519 | while (!ReverseDepsToAdd.empty()) { |
| 520 | ReverseNonLocalDeps[ReverseDepsToAdd.back().first] |
| 521 | .insert(ReverseDepsToAdd.back().second); |
| 522 | ReverseDepsToAdd.pop_back(); |
| 523 | } |
Owen Anderson | 4d13de4 | 2007-08-16 21:27:05 +0000 | [diff] [blame] | 524 | } |
Owen Anderson | 5fc4aba | 2007-12-08 01:37:09 +0000 | [diff] [blame] | 525 | |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 526 | assert(!NonLocalDeps.count(RemInst) && "RemInst got reinserted?"); |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 527 | AA->deleteValue(RemInst); |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 528 | DEBUG(verifyRemoved(RemInst)); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 529 | } |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 530 | |
| 531 | /// verifyRemoved - Verify that the specified instruction does not occur |
| 532 | /// in our internal data structures. |
| 533 | void MemoryDependenceAnalysis::verifyRemoved(Instruction *D) const { |
| 534 | for (LocalDepMapType::const_iterator I = LocalDeps.begin(), |
| 535 | E = LocalDeps.end(); I != E; ++I) { |
| 536 | assert(I->first != D && "Inst occurs in data structures"); |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 537 | assert(I->second.getInst() != D && |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 538 | "Inst occurs in data structures"); |
| 539 | } |
| 540 | |
| 541 | for (NonLocalDepMapType::const_iterator I = NonLocalDeps.begin(), |
| 542 | E = NonLocalDeps.end(); I != E; ++I) { |
| 543 | assert(I->first != D && "Inst occurs in data structures"); |
Chris Lattner | 4a69bad | 2008-11-30 02:52:26 +0000 | [diff] [blame] | 544 | const PerInstNLInfo &INLD = I->second; |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 545 | for (NonLocalDepInfo::const_iterator II = INLD.first.begin(), |
| 546 | EE = INLD.first.end(); II != EE; ++II) |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 547 | assert(II->second.getInst() != D && "Inst occurs in data structures"); |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 548 | } |
| 549 | |
| 550 | for (ReverseDepMapType::const_iterator I = ReverseLocalDeps.begin(), |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 551 | E = ReverseLocalDeps.end(); I != E; ++I) { |
| 552 | assert(I->first != D && "Inst occurs in data structures"); |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 553 | for (SmallPtrSet<Instruction*, 4>::const_iterator II = I->second.begin(), |
| 554 | EE = I->second.end(); II != EE; ++II) |
| 555 | assert(*II != D && "Inst occurs in data structures"); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 556 | } |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 557 | |
| 558 | for (ReverseDepMapType::const_iterator I = ReverseNonLocalDeps.begin(), |
| 559 | E = ReverseNonLocalDeps.end(); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 560 | I != E; ++I) { |
| 561 | assert(I->first != D && "Inst occurs in data structures"); |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 562 | for (SmallPtrSet<Instruction*, 4>::const_iterator II = I->second.begin(), |
| 563 | EE = I->second.end(); II != EE; ++II) |
| 564 | assert(*II != D && "Inst occurs in data structures"); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 565 | } |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 566 | } |