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" |
Chris Lattner | 4012fdd | 2008-12-09 06:28:49 +0000 | [diff] [blame] | 24 | #include "llvm/Support/PredIteratorCache.h" |
Chris Lattner | 0e575f4 | 2008-11-28 21:45:17 +0000 | [diff] [blame] | 25 | #include "llvm/Support/Debug.h" |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 26 | #include "llvm/Target/TargetData.h" |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 27 | using namespace llvm; |
| 28 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 29 | STATISTIC(NumCacheNonLocal, "Number of fully cached non-local responses"); |
| 30 | STATISTIC(NumCacheDirtyNonLocal, "Number of dirty cached non-local responses"); |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 31 | STATISTIC(NumUncacheNonLocal, "Number of uncached non-local responses"); |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 32 | |
| 33 | STATISTIC(NumCacheNonLocalPtr, |
| 34 | "Number of fully cached non-local ptr responses"); |
| 35 | STATISTIC(NumCacheDirtyNonLocalPtr, |
| 36 | "Number of cached, but dirty, non-local ptr responses"); |
| 37 | STATISTIC(NumUncacheNonLocalPtr, |
| 38 | "Number of uncached non-local ptr responses"); |
Chris Lattner | 11dcd8d | 2008-12-08 07:31:50 +0000 | [diff] [blame] | 39 | STATISTIC(NumCacheCompleteNonLocalPtr, |
| 40 | "Number of block queries that were completely cached"); |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 41 | |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 42 | char MemoryDependenceAnalysis::ID = 0; |
| 43 | |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 44 | // Register this pass... |
Owen Anderson | 776ee1f | 2007-07-10 20:21:08 +0000 | [diff] [blame] | 45 | static RegisterPass<MemoryDependenceAnalysis> X("memdep", |
Chris Lattner | 0e575f4 | 2008-11-28 21:45:17 +0000 | [diff] [blame] | 46 | "Memory Dependence Analysis", false, true); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 47 | |
Chris Lattner | 4012fdd | 2008-12-09 06:28:49 +0000 | [diff] [blame] | 48 | MemoryDependenceAnalysis::MemoryDependenceAnalysis() |
| 49 | : FunctionPass(&ID), PredCache(0) { |
| 50 | } |
| 51 | MemoryDependenceAnalysis::~MemoryDependenceAnalysis() { |
| 52 | } |
| 53 | |
| 54 | /// Clean up memory in between runs |
| 55 | void MemoryDependenceAnalysis::releaseMemory() { |
| 56 | LocalDeps.clear(); |
| 57 | NonLocalDeps.clear(); |
| 58 | NonLocalPointerDeps.clear(); |
| 59 | ReverseLocalDeps.clear(); |
| 60 | ReverseNonLocalDeps.clear(); |
| 61 | ReverseNonLocalPtrDeps.clear(); |
| 62 | PredCache->clear(); |
| 63 | } |
| 64 | |
| 65 | |
| 66 | |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 67 | /// getAnalysisUsage - Does not modify anything. It uses Alias Analysis. |
| 68 | /// |
| 69 | void MemoryDependenceAnalysis::getAnalysisUsage(AnalysisUsage &AU) const { |
| 70 | AU.setPreservesAll(); |
| 71 | AU.addRequiredTransitive<AliasAnalysis>(); |
| 72 | AU.addRequiredTransitive<TargetData>(); |
| 73 | } |
| 74 | |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 75 | bool MemoryDependenceAnalysis::runOnFunction(Function &) { |
| 76 | AA = &getAnalysis<AliasAnalysis>(); |
| 77 | TD = &getAnalysis<TargetData>(); |
Chris Lattner | 4012fdd | 2008-12-09 06:28:49 +0000 | [diff] [blame] | 78 | if (PredCache == 0) |
| 79 | PredCache.reset(new PredIteratorCache()); |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 80 | return false; |
| 81 | } |
| 82 | |
Chris Lattner | d44745d | 2008-12-07 18:39:13 +0000 | [diff] [blame] | 83 | /// RemoveFromReverseMap - This is a helper function that removes Val from |
| 84 | /// 'Inst's set in ReverseMap. If the set becomes empty, remove Inst's entry. |
| 85 | template <typename KeyTy> |
| 86 | static void RemoveFromReverseMap(DenseMap<Instruction*, |
| 87 | SmallPtrSet<KeyTy*, 4> > &ReverseMap, |
| 88 | Instruction *Inst, KeyTy *Val) { |
| 89 | typename DenseMap<Instruction*, SmallPtrSet<KeyTy*, 4> >::iterator |
| 90 | InstIt = ReverseMap.find(Inst); |
| 91 | assert(InstIt != ReverseMap.end() && "Reverse map out of sync?"); |
| 92 | bool Found = InstIt->second.erase(Val); |
| 93 | assert(Found && "Invalid reverse map!"); Found=Found; |
| 94 | if (InstIt->second.empty()) |
| 95 | ReverseMap.erase(InstIt); |
| 96 | } |
| 97 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 98 | |
Chris Lattner | 8ef57c5 | 2008-12-07 00:35:51 +0000 | [diff] [blame] | 99 | /// getCallSiteDependencyFrom - Private helper for finding the local |
| 100 | /// dependencies of a call site. |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 101 | MemDepResult MemoryDependenceAnalysis:: |
Chris Lattner | 8ef57c5 | 2008-12-07 00:35:51 +0000 | [diff] [blame] | 102 | getCallSiteDependencyFrom(CallSite CS, BasicBlock::iterator ScanIt, |
| 103 | BasicBlock *BB) { |
Owen Anderson | 642a9e3 | 2007-08-08 22:26:03 +0000 | [diff] [blame] | 104 | // Walk backwards through the block, looking for dependencies |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 105 | while (ScanIt != BB->begin()) { |
| 106 | Instruction *Inst = --ScanIt; |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 107 | |
| 108 | // If this inst is a memory op, get the pointer it accessed |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 109 | Value *Pointer = 0; |
| 110 | uint64_t PointerSize = 0; |
| 111 | if (StoreInst *S = dyn_cast<StoreInst>(Inst)) { |
| 112 | Pointer = S->getPointerOperand(); |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 113 | PointerSize = TD->getTypeStoreSize(S->getOperand(0)->getType()); |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 114 | } else if (VAArgInst *V = dyn_cast<VAArgInst>(Inst)) { |
| 115 | Pointer = V->getOperand(0); |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 116 | PointerSize = TD->getTypeStoreSize(V->getType()); |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 117 | } else if (FreeInst *F = dyn_cast<FreeInst>(Inst)) { |
| 118 | Pointer = F->getPointerOperand(); |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 119 | |
| 120 | // FreeInsts erase the entire structure |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 121 | PointerSize = ~0ULL; |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 122 | } else if (isa<CallInst>(Inst) || isa<InvokeInst>(Inst)) { |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 123 | CallSite InstCS = CallSite::get(Inst); |
| 124 | // If these two calls do not interfere, look past it. |
| 125 | if (AA->getModRefInfo(CS, InstCS) == AliasAnalysis::NoModRef) |
Chris Lattner | 00314b3 | 2008-11-29 09:15:21 +0000 | [diff] [blame] | 126 | continue; |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 127 | |
| 128 | // FIXME: If this is a ref/ref result, we should ignore it! |
| 129 | // X = strlen(P); |
| 130 | // Y = strlen(Q); |
| 131 | // Z = strlen(P); // Z = X |
| 132 | |
| 133 | // If they interfere, we generally return clobber. However, if they are |
| 134 | // calls to the same read-only functions we return Def. |
| 135 | if (!AA->onlyReadsMemory(CS) || CS.getCalledFunction() == 0 || |
| 136 | CS.getCalledFunction() != InstCS.getCalledFunction()) |
| 137 | return MemDepResult::getClobber(Inst); |
| 138 | return MemDepResult::getDef(Inst); |
Chris Lattner | cfbb634 | 2008-11-30 01:44:00 +0000 | [diff] [blame] | 139 | } else { |
| 140 | // Non-memory instruction. |
Owen Anderson | 202da14 | 2007-07-10 20:39:07 +0000 | [diff] [blame] | 141 | continue; |
Chris Lattner | cfbb634 | 2008-11-30 01:44:00 +0000 | [diff] [blame] | 142 | } |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 143 | |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 144 | if (AA->getModRefInfo(CS, Pointer, PointerSize) != AliasAnalysis::NoModRef) |
| 145 | return MemDepResult::getClobber(Inst); |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 146 | } |
| 147 | |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 148 | // No dependence found. If this is the entry block of the function, it is a |
| 149 | // clobber, otherwise it is non-local. |
| 150 | if (BB != &BB->getParent()->getEntryBlock()) |
| 151 | return MemDepResult::getNonLocal(); |
| 152 | return MemDepResult::getClobber(ScanIt); |
Owen Anderson | 5f32320 | 2007-07-10 17:59:22 +0000 | [diff] [blame] | 153 | } |
| 154 | |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame] | 155 | /// getPointerDependencyFrom - Return the instruction on which a memory |
| 156 | /// location depends. If isLoad is true, this routine ignore may-aliases with |
| 157 | /// read-only operations. |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 158 | MemDepResult MemoryDependenceAnalysis:: |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame] | 159 | getPointerDependencyFrom(Value *MemPtr, uint64_t MemSize, bool isLoad, |
| 160 | BasicBlock::iterator ScanIt, BasicBlock *BB) { |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 161 | |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 162 | // Walk backwards through the basic block, looking for dependencies. |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 163 | while (ScanIt != BB->begin()) { |
| 164 | Instruction *Inst = --ScanIt; |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 165 | |
Chris Lattner | cfbb634 | 2008-11-30 01:44:00 +0000 | [diff] [blame] | 166 | // Values depend on loads if the pointers are must aliased. This means that |
| 167 | // a load depends on another must aliased load from the same value. |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 168 | if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) { |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 169 | Value *Pointer = LI->getPointerOperand(); |
| 170 | uint64_t PointerSize = TD->getTypeStoreSize(LI->getType()); |
| 171 | |
| 172 | // 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] | 173 | AliasAnalysis::AliasResult R = |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 174 | AA->alias(Pointer, PointerSize, MemPtr, MemSize); |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 175 | if (R == AliasAnalysis::NoAlias) |
| 176 | continue; |
| 177 | |
| 178 | // May-alias loads don't depend on each other without a dependence. |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame] | 179 | if (isLoad && R == AliasAnalysis::MayAlias) |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 180 | continue; |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 181 | // Stores depend on may and must aliased loads, loads depend on must-alias |
| 182 | // loads. |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 183 | return MemDepResult::getDef(Inst); |
| 184 | } |
| 185 | |
| 186 | if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) { |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 187 | Value *Pointer = SI->getPointerOperand(); |
| 188 | uint64_t PointerSize = TD->getTypeStoreSize(SI->getOperand(0)->getType()); |
| 189 | |
| 190 | // If we found a pointer, check if it could be the same as our pointer. |
| 191 | AliasAnalysis::AliasResult R = |
| 192 | AA->alias(Pointer, PointerSize, MemPtr, MemSize); |
| 193 | |
| 194 | if (R == AliasAnalysis::NoAlias) |
| 195 | continue; |
| 196 | if (R == AliasAnalysis::MayAlias) |
| 197 | return MemDepResult::getClobber(Inst); |
| 198 | return MemDepResult::getDef(Inst); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 199 | } |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 200 | |
| 201 | // 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] | 202 | // the allocation, return Def. This means that there is no dependence and |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 203 | // the access can be optimized based on that. For example, a load could |
| 204 | // turn into undef. |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 205 | if (AllocationInst *AI = dyn_cast<AllocationInst>(Inst)) { |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 206 | Value *AccessPtr = MemPtr->getUnderlyingObject(); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 207 | |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 208 | if (AccessPtr == AI || |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 209 | AA->alias(AI, 1, AccessPtr, 1) == AliasAnalysis::MustAlias) |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 210 | return MemDepResult::getDef(AI); |
Chris Lattner | 237a828 | 2008-11-30 01:39:32 +0000 | [diff] [blame] | 211 | continue; |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 212 | } |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 213 | |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 214 | // 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] | 215 | // FIXME: If this is a load, we should ignore readonly calls! |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 216 | if (AA->getModRefInfo(Inst, MemPtr, MemSize) == AliasAnalysis::NoModRef) |
Chris Lattner | 25a0814 | 2008-11-29 08:51:16 +0000 | [diff] [blame] | 217 | continue; |
Chris Lattner | a161ab0 | 2008-11-29 09:09:48 +0000 | [diff] [blame] | 218 | |
| 219 | // Otherwise, there is a dependence. |
Chris Lattner | b51deb9 | 2008-12-05 21:04:20 +0000 | [diff] [blame] | 220 | return MemDepResult::getClobber(Inst); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 221 | } |
| 222 | |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 223 | // No dependence found. If this is the entry block of the function, it is a |
| 224 | // clobber, otherwise it is non-local. |
| 225 | if (BB != &BB->getParent()->getEntryBlock()) |
| 226 | return MemDepResult::getNonLocal(); |
| 227 | return MemDepResult::getClobber(ScanIt); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 228 | } |
| 229 | |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 230 | /// getDependency - Return the instruction on which a memory operation |
| 231 | /// depends. |
| 232 | MemDepResult MemoryDependenceAnalysis::getDependency(Instruction *QueryInst) { |
| 233 | Instruction *ScanPos = QueryInst; |
| 234 | |
| 235 | // Check for a cached result |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 236 | MemDepResult &LocalCache = LocalDeps[QueryInst]; |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 237 | |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 238 | // 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] | 239 | // on MemDepResult's default constructing to 'dirty'. |
| 240 | if (!LocalCache.isDirty()) |
| 241 | return LocalCache; |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 242 | |
| 243 | // Otherwise, if we have a dirty entry, we know we can start the scan at that |
| 244 | // instruction, which may save us some work. |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 245 | if (Instruction *Inst = LocalCache.getInst()) { |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 246 | ScanPos = Inst; |
Chris Lattner | 4a69bad | 2008-11-30 02:52:26 +0000 | [diff] [blame] | 247 | |
Chris Lattner | d44745d | 2008-12-07 18:39:13 +0000 | [diff] [blame] | 248 | RemoveFromReverseMap(ReverseLocalDeps, Inst, QueryInst); |
Chris Lattner | 4a69bad | 2008-11-30 02:52:26 +0000 | [diff] [blame] | 249 | } |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 250 | |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame] | 251 | BasicBlock *QueryParent = QueryInst->getParent(); |
| 252 | |
| 253 | Value *MemPtr = 0; |
| 254 | uint64_t MemSize = 0; |
| 255 | |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 256 | // Do the scan. |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame] | 257 | if (BasicBlock::iterator(QueryInst) == QueryParent->begin()) { |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 258 | // No dependence found. If this is the entry block of the function, it is a |
| 259 | // clobber, otherwise it is non-local. |
| 260 | if (QueryParent != &QueryParent->getParent()->getEntryBlock()) |
| 261 | LocalCache = MemDepResult::getNonLocal(); |
| 262 | else |
| 263 | LocalCache = MemDepResult::getClobber(QueryInst); |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame] | 264 | } else if (StoreInst *SI = dyn_cast<StoreInst>(QueryInst)) { |
| 265 | // If this is a volatile store, don't mess around with it. Just return the |
| 266 | // previous instruction as a clobber. |
| 267 | if (SI->isVolatile()) |
| 268 | LocalCache = MemDepResult::getClobber(--BasicBlock::iterator(ScanPos)); |
| 269 | else { |
| 270 | MemPtr = SI->getPointerOperand(); |
| 271 | MemSize = TD->getTypeStoreSize(SI->getOperand(0)->getType()); |
| 272 | } |
| 273 | } else if (LoadInst *LI = dyn_cast<LoadInst>(QueryInst)) { |
| 274 | // If this is a volatile load, don't mess around with it. Just return the |
| 275 | // previous instruction as a clobber. |
| 276 | if (LI->isVolatile()) |
| 277 | LocalCache = MemDepResult::getClobber(--BasicBlock::iterator(ScanPos)); |
| 278 | else { |
| 279 | MemPtr = LI->getPointerOperand(); |
| 280 | MemSize = TD->getTypeStoreSize(LI->getType()); |
| 281 | } |
| 282 | } else if (isa<CallInst>(QueryInst) || isa<InvokeInst>(QueryInst)) { |
Chris Lattner | d8dd934 | 2008-12-07 01:21:14 +0000 | [diff] [blame] | 283 | LocalCache = getCallSiteDependencyFrom(CallSite::get(QueryInst), ScanPos, |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame] | 284 | QueryParent); |
| 285 | } else if (FreeInst *FI = dyn_cast<FreeInst>(QueryInst)) { |
| 286 | MemPtr = FI->getPointerOperand(); |
| 287 | // FreeInsts erase the entire structure, not just a field. |
| 288 | MemSize = ~0UL; |
| 289 | } else { |
| 290 | // Non-memory instruction. |
| 291 | LocalCache = MemDepResult::getClobber(--BasicBlock::iterator(ScanPos)); |
| 292 | } |
| 293 | |
| 294 | // If we need to do a pointer scan, make it happen. |
| 295 | if (MemPtr) |
| 296 | LocalCache = getPointerDependencyFrom(MemPtr, MemSize, |
| 297 | isa<LoadInst>(QueryInst), |
| 298 | ScanPos, QueryParent); |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 299 | |
| 300 | // Remember the result! |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 301 | if (Instruction *I = LocalCache.getInst()) |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 302 | ReverseLocalDeps[I].insert(QueryInst); |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 303 | |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 304 | return LocalCache; |
Chris Lattner | 5391a1d | 2008-11-29 03:47:00 +0000 | [diff] [blame] | 305 | } |
| 306 | |
Chris Lattner | 1559b36 | 2008-12-09 19:38:05 +0000 | [diff] [blame^] | 307 | /// getNonLocalCallDependency - Perform a full dependency query for the |
| 308 | /// specified call, returning the set of blocks that the value is |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 309 | /// potentially live across. The returned set of results will include a |
| 310 | /// "NonLocal" result for all blocks where the value is live across. |
| 311 | /// |
Chris Lattner | 1559b36 | 2008-12-09 19:38:05 +0000 | [diff] [blame^] | 312 | /// This method assumes the instruction returns a "NonLocal" dependency |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 313 | /// within its own block. |
| 314 | /// |
Chris Lattner | 1559b36 | 2008-12-09 19:38:05 +0000 | [diff] [blame^] | 315 | /// This returns a reference to an internal data structure that may be |
| 316 | /// invalidated on the next non-local query or when an instruction is |
| 317 | /// removed. Clients must copy this data if they want it around longer than |
| 318 | /// that. |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 319 | const MemoryDependenceAnalysis::NonLocalDepInfo & |
Chris Lattner | 1559b36 | 2008-12-09 19:38:05 +0000 | [diff] [blame^] | 320 | MemoryDependenceAnalysis::getNonLocalCallDependency(CallSite QueryCS) { |
| 321 | assert(getDependency(QueryCS.getInstruction()).isNonLocal() && |
| 322 | "getNonLocalCallDependency should only be used on calls with non-local deps!"); |
| 323 | PerInstNLInfo &CacheP = NonLocalDeps[QueryCS.getInstruction()]; |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 324 | NonLocalDepInfo &Cache = CacheP.first; |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 325 | |
| 326 | /// DirtyBlocks - This is the set of blocks that need to be recomputed. In |
| 327 | /// the cached case, this can happen due to instructions being deleted etc. In |
| 328 | /// the uncached case, this starts out as the set of predecessors we care |
| 329 | /// about. |
| 330 | SmallVector<BasicBlock*, 32> DirtyBlocks; |
| 331 | |
| 332 | if (!Cache.empty()) { |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 333 | // Okay, we have a cache entry. If we know it is not dirty, just return it |
| 334 | // with no computation. |
| 335 | if (!CacheP.second) { |
| 336 | NumCacheNonLocal++; |
| 337 | return Cache; |
| 338 | } |
| 339 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 340 | // 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] | 341 | // determine what is dirty, seeding our initial DirtyBlocks worklist. |
| 342 | for (NonLocalDepInfo::iterator I = Cache.begin(), E = Cache.end(); |
| 343 | I != E; ++I) |
| 344 | if (I->second.isDirty()) |
| 345 | DirtyBlocks.push_back(I->first); |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 346 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 347 | // Sort the cache so that we can do fast binary search lookups below. |
| 348 | std::sort(Cache.begin(), Cache.end()); |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 349 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 350 | ++NumCacheDirtyNonLocal; |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 351 | //cerr << "CACHED CASE: " << DirtyBlocks.size() << " dirty: " |
| 352 | // << Cache.size() << " cached: " << *QueryInst; |
| 353 | } else { |
| 354 | // Seed DirtyBlocks with each of the preds of QueryInst's block. |
Chris Lattner | 1559b36 | 2008-12-09 19:38:05 +0000 | [diff] [blame^] | 355 | BasicBlock *QueryBB = QueryCS.getInstruction()->getParent(); |
Chris Lattner | 511b36c | 2008-12-09 06:44:17 +0000 | [diff] [blame] | 356 | for (BasicBlock **PI = PredCache->GetPreds(QueryBB); *PI; ++PI) |
| 357 | DirtyBlocks.push_back(*PI); |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 358 | NumUncacheNonLocal++; |
| 359 | } |
| 360 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 361 | // Visited checked first, vector in sorted order. |
| 362 | SmallPtrSet<BasicBlock*, 64> Visited; |
| 363 | |
| 364 | unsigned NumSortedEntries = Cache.size(); |
| 365 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 366 | // Iterate while we still have blocks to update. |
| 367 | while (!DirtyBlocks.empty()) { |
| 368 | BasicBlock *DirtyBB = DirtyBlocks.back(); |
| 369 | DirtyBlocks.pop_back(); |
| 370 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 371 | // Already processed this block? |
| 372 | if (!Visited.insert(DirtyBB)) |
| 373 | continue; |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 374 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 375 | // Do a binary search to see if we already have an entry for this block in |
| 376 | // the cache set. If so, find it. |
| 377 | NonLocalDepInfo::iterator Entry = |
| 378 | std::upper_bound(Cache.begin(), Cache.begin()+NumSortedEntries, |
| 379 | std::make_pair(DirtyBB, MemDepResult())); |
| 380 | if (Entry != Cache.begin() && (&*Entry)[-1].first == DirtyBB) |
| 381 | --Entry; |
| 382 | |
| 383 | MemDepResult *ExistingResult = 0; |
| 384 | if (Entry != Cache.begin()+NumSortedEntries && |
| 385 | Entry->first == DirtyBB) { |
| 386 | // If we already have an entry, and if it isn't already dirty, the block |
| 387 | // is done. |
| 388 | if (!Entry->second.isDirty()) |
| 389 | continue; |
| 390 | |
| 391 | // Otherwise, remember this slot so we can update the value. |
| 392 | ExistingResult = &Entry->second; |
| 393 | } |
| 394 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 395 | // If the dirty entry has a pointer, start scanning from it so we don't have |
| 396 | // to rescan the entire block. |
| 397 | BasicBlock::iterator ScanPos = DirtyBB->end(); |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 398 | if (ExistingResult) { |
| 399 | if (Instruction *Inst = ExistingResult->getInst()) { |
| 400 | ScanPos = Inst; |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 401 | // We're removing QueryInst's use of Inst. |
Chris Lattner | 1559b36 | 2008-12-09 19:38:05 +0000 | [diff] [blame^] | 402 | RemoveFromReverseMap(ReverseNonLocalDeps, Inst, |
| 403 | QueryCS.getInstruction()); |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 404 | } |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 405 | } |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 406 | |
Chris Lattner | 73ec3cd | 2008-11-30 01:26:32 +0000 | [diff] [blame] | 407 | // Find out if this block has a local dependency for QueryInst. |
Chris Lattner | d8dd934 | 2008-12-07 01:21:14 +0000 | [diff] [blame] | 408 | MemDepResult Dep; |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame] | 409 | |
Chris Lattner | 1559b36 | 2008-12-09 19:38:05 +0000 | [diff] [blame^] | 410 | if (ScanPos != DirtyBB->begin()) { |
| 411 | Dep = getCallSiteDependencyFrom(QueryCS, ScanPos, DirtyBB); |
| 412 | } else if (DirtyBB != &DirtyBB->getParent()->getEntryBlock()) { |
| 413 | // No dependence found. If this is the entry block of the function, it is |
| 414 | // a clobber, otherwise it is non-local. |
| 415 | Dep = MemDepResult::getNonLocal(); |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame] | 416 | } else { |
Chris Lattner | 1559b36 | 2008-12-09 19:38:05 +0000 | [diff] [blame^] | 417 | Dep = MemDepResult::getClobber(ScanPos); |
Chris Lattner | e79be94 | 2008-12-07 01:50:16 +0000 | [diff] [blame] | 418 | } |
| 419 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 420 | // If we had a dirty entry for the block, update it. Otherwise, just add |
| 421 | // a new entry. |
| 422 | if (ExistingResult) |
| 423 | *ExistingResult = Dep; |
| 424 | else |
| 425 | Cache.push_back(std::make_pair(DirtyBB, Dep)); |
| 426 | |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 427 | // 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] | 428 | // the value), remember the association! |
| 429 | if (!Dep.isNonLocal()) { |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 430 | // Keep the ReverseNonLocalDeps map up to date so we can efficiently |
| 431 | // update this when we remove instructions. |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 432 | if (Instruction *Inst = Dep.getInst()) |
Chris Lattner | 1559b36 | 2008-12-09 19:38:05 +0000 | [diff] [blame^] | 433 | ReverseNonLocalDeps[Inst].insert(QueryCS.getInstruction()); |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 434 | } else { |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 435 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 436 | // If the block *is* completely transparent to the load, we need to check |
| 437 | // the predecessors of this block. Add them to our worklist. |
Chris Lattner | 511b36c | 2008-12-09 06:44:17 +0000 | [diff] [blame] | 438 | for (BasicBlock **PI = PredCache->GetPreds(DirtyBB); *PI; ++PI) |
| 439 | DirtyBlocks.push_back(*PI); |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 440 | } |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 441 | } |
| 442 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 443 | return Cache; |
Chris Lattner | 37d041c | 2008-11-30 01:18:27 +0000 | [diff] [blame] | 444 | } |
| 445 | |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 446 | /// getNonLocalPointerDependency - Perform a full dependency query for an |
| 447 | /// access to the specified (non-volatile) memory location, returning the |
| 448 | /// set of instructions that either define or clobber the value. |
| 449 | /// |
| 450 | /// This method assumes the pointer has a "NonLocal" dependency within its |
| 451 | /// own block. |
| 452 | /// |
| 453 | void MemoryDependenceAnalysis:: |
| 454 | getNonLocalPointerDependency(Value *Pointer, bool isLoad, BasicBlock *FromBB, |
| 455 | SmallVectorImpl<NonLocalDepEntry> &Result) { |
Chris Lattner | 3f7eb5b | 2008-12-07 18:45:15 +0000 | [diff] [blame] | 456 | assert(isa<PointerType>(Pointer->getType()) && |
| 457 | "Can't get pointer deps of a non-pointer!"); |
Chris Lattner | 9a193fd | 2008-12-07 02:56:57 +0000 | [diff] [blame] | 458 | Result.clear(); |
| 459 | |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 460 | // We know that the pointer value is live into FromBB find the def/clobbers |
| 461 | // from presecessors. |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 462 | const Type *EltTy = cast<PointerType>(Pointer->getType())->getElementType(); |
| 463 | uint64_t PointeeSize = TD->getTypeStoreSize(EltTy); |
| 464 | |
| 465 | // While we have blocks to analyze, get their values. |
| 466 | SmallPtrSet<BasicBlock*, 64> Visited; |
Chris Lattner | 6563371 | 2008-12-09 07:52:59 +0000 | [diff] [blame] | 467 | getNonLocalPointerDepFromBB(Pointer, PointeeSize, isLoad, FromBB, |
| 468 | Result, Visited); |
Chris Lattner | 9a193fd | 2008-12-07 02:56:57 +0000 | [diff] [blame] | 469 | } |
| 470 | |
Chris Lattner | 9863c3f | 2008-12-09 07:47:11 +0000 | [diff] [blame] | 471 | /// GetNonLocalInfoForBlock - Compute the memdep value for BB with |
| 472 | /// Pointer/PointeeSize using either cached information in Cache or by doing a |
| 473 | /// lookup (which may use dirty cache info if available). If we do a lookup, |
| 474 | /// add the result to the cache. |
| 475 | MemDepResult MemoryDependenceAnalysis:: |
| 476 | GetNonLocalInfoForBlock(Value *Pointer, uint64_t PointeeSize, |
| 477 | bool isLoad, BasicBlock *BB, |
| 478 | NonLocalDepInfo *Cache, unsigned NumSortedEntries) { |
| 479 | |
| 480 | // Do a binary search to see if we already have an entry for this block in |
| 481 | // the cache set. If so, find it. |
| 482 | NonLocalDepInfo::iterator Entry = |
| 483 | std::upper_bound(Cache->begin(), Cache->begin()+NumSortedEntries, |
| 484 | std::make_pair(BB, MemDepResult())); |
| 485 | if (Entry != Cache->begin() && (&*Entry)[-1].first == BB) |
| 486 | --Entry; |
| 487 | |
| 488 | MemDepResult *ExistingResult = 0; |
| 489 | if (Entry != Cache->begin()+NumSortedEntries && Entry->first == BB) |
| 490 | ExistingResult = &Entry->second; |
| 491 | |
| 492 | // If we have a cached entry, and it is non-dirty, use it as the value for |
| 493 | // this dependency. |
| 494 | if (ExistingResult && !ExistingResult->isDirty()) { |
| 495 | ++NumCacheNonLocalPtr; |
| 496 | return *ExistingResult; |
| 497 | } |
| 498 | |
| 499 | // Otherwise, we have to scan for the value. If we have a dirty cache |
| 500 | // entry, start scanning from its position, otherwise we scan from the end |
| 501 | // of the block. |
| 502 | BasicBlock::iterator ScanPos = BB->end(); |
| 503 | if (ExistingResult && ExistingResult->getInst()) { |
| 504 | assert(ExistingResult->getInst()->getParent() == BB && |
| 505 | "Instruction invalidated?"); |
| 506 | ++NumCacheDirtyNonLocalPtr; |
| 507 | ScanPos = ExistingResult->getInst(); |
| 508 | |
| 509 | // Eliminating the dirty entry from 'Cache', so update the reverse info. |
| 510 | ValueIsLoadPair CacheKey(Pointer, isLoad); |
| 511 | RemoveFromReverseMap(ReverseNonLocalPtrDeps, ScanPos, |
| 512 | CacheKey.getOpaqueValue()); |
| 513 | } else { |
| 514 | ++NumUncacheNonLocalPtr; |
| 515 | } |
| 516 | |
| 517 | // Scan the block for the dependency. |
| 518 | MemDepResult Dep = getPointerDependencyFrom(Pointer, PointeeSize, isLoad, |
| 519 | ScanPos, BB); |
| 520 | |
| 521 | // If we had a dirty entry for the block, update it. Otherwise, just add |
| 522 | // a new entry. |
| 523 | if (ExistingResult) |
| 524 | *ExistingResult = Dep; |
| 525 | else |
| 526 | Cache->push_back(std::make_pair(BB, Dep)); |
| 527 | |
| 528 | // If the block has a dependency (i.e. it isn't completely transparent to |
| 529 | // the value), remember the reverse association because we just added it |
| 530 | // to Cache! |
| 531 | if (Dep.isNonLocal()) |
| 532 | return Dep; |
| 533 | |
| 534 | // Keep the ReverseNonLocalPtrDeps map up to date so we can efficiently |
| 535 | // update MemDep when we remove instructions. |
| 536 | Instruction *Inst = Dep.getInst(); |
| 537 | assert(Inst && "Didn't depend on anything?"); |
| 538 | ValueIsLoadPair CacheKey(Pointer, isLoad); |
| 539 | ReverseNonLocalPtrDeps[Inst].insert(CacheKey.getOpaqueValue()); |
| 540 | return Dep; |
| 541 | } |
| 542 | |
| 543 | |
| 544 | /// getNonLocalPointerDepFromBB - |
Chris Lattner | 9a193fd | 2008-12-07 02:56:57 +0000 | [diff] [blame] | 545 | void MemoryDependenceAnalysis:: |
Chris Lattner | 9863c3f | 2008-12-09 07:47:11 +0000 | [diff] [blame] | 546 | getNonLocalPointerDepFromBB(Value *Pointer, uint64_t PointeeSize, |
| 547 | bool isLoad, BasicBlock *StartBB, |
| 548 | SmallVectorImpl<NonLocalDepEntry> &Result, |
| 549 | SmallPtrSet<BasicBlock*, 64> &Visited) { |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 550 | // Look up the cached info for Pointer. |
| 551 | ValueIsLoadPair CacheKey(Pointer, isLoad); |
Chris Lattner | 11dcd8d | 2008-12-08 07:31:50 +0000 | [diff] [blame] | 552 | |
| 553 | std::pair<BasicBlock*, NonLocalDepInfo> &CacheInfo = |
| 554 | NonLocalPointerDeps[CacheKey]; |
| 555 | NonLocalDepInfo *Cache = &CacheInfo.second; |
| 556 | |
| 557 | // If we have valid cached information for exactly the block we are |
| 558 | // investigating, just return it with no recomputation. |
| 559 | if (CacheInfo.first == StartBB) { |
| 560 | for (NonLocalDepInfo::iterator I = Cache->begin(), E = Cache->end(); |
| 561 | I != E; ++I) |
| 562 | if (!I->second.isNonLocal()) |
| 563 | Result.push_back(*I); |
| 564 | ++NumCacheCompleteNonLocalPtr; |
| 565 | return; |
| 566 | } |
| 567 | |
| 568 | // Otherwise, either this is a new block, a block with an invalid cache |
| 569 | // pointer or one that we're about to invalidate by putting more info into it |
| 570 | // than its valid cache info. If empty, the result will be valid cache info, |
| 571 | // otherwise it isn't. |
| 572 | CacheInfo.first = Cache->empty() ? StartBB : 0; |
| 573 | |
| 574 | SmallVector<BasicBlock*, 32> Worklist; |
| 575 | Worklist.push_back(StartBB); |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 576 | |
| 577 | // Keep track of the entries that we know are sorted. Previously cached |
| 578 | // entries will all be sorted. The entries we add we only sort on demand (we |
| 579 | // don't insert every element into its sorted position). We know that we |
| 580 | // won't get any reuse from currently inserted values, because we don't |
| 581 | // revisit blocks after we insert info for them. |
| 582 | unsigned NumSortedEntries = Cache->size(); |
| 583 | |
Chris Lattner | 6563371 | 2008-12-09 07:52:59 +0000 | [diff] [blame] | 584 | // SkipFirstBlock - If this is the very first block that we're processing, we |
Chris Lattner | 9f1e12a | 2008-12-09 08:38:36 +0000 | [diff] [blame] | 585 | // don't want to scan or think about its body, because the client was supposed |
Chris Lattner | 6563371 | 2008-12-09 07:52:59 +0000 | [diff] [blame] | 586 | // to do a local dependence query. Instead, just start processing it by |
| 587 | // adding its predecessors to the worklist and iterating. |
| 588 | bool SkipFirstBlock = Visited.empty(); |
| 589 | |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 590 | while (!Worklist.empty()) { |
Chris Lattner | 9a193fd | 2008-12-07 02:56:57 +0000 | [diff] [blame] | 591 | BasicBlock *BB = Worklist.pop_back_val(); |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 592 | |
Chris Lattner | 6563371 | 2008-12-09 07:52:59 +0000 | [diff] [blame] | 593 | // Skip the first block if we have it. |
| 594 | if (SkipFirstBlock) { |
| 595 | SkipFirstBlock = false; |
| 596 | } else { |
| 597 | // Analyze the dependency of *Pointer in FromBB. See if we already have |
| 598 | // been here. |
| 599 | if (!Visited.insert(BB)) |
| 600 | continue; |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 601 | |
Chris Lattner | 6563371 | 2008-12-09 07:52:59 +0000 | [diff] [blame] | 602 | // Get the dependency info for Pointer in BB. If we have cached |
| 603 | // information, we will use it, otherwise we compute it. |
| 604 | MemDepResult Dep = GetNonLocalInfoForBlock(Pointer, PointeeSize, isLoad, |
| 605 | BB, Cache, NumSortedEntries); |
| 606 | |
| 607 | // If we got a Def or Clobber, add this to the list of results. |
| 608 | if (!Dep.isNonLocal()) { |
| 609 | Result.push_back(NonLocalDepEntry(BB, Dep)); |
| 610 | continue; |
| 611 | } |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 612 | } |
| 613 | |
| 614 | // Otherwise, we have to process all the predecessors of this block to scan |
| 615 | // them as well. |
Chris Lattner | 4012fdd | 2008-12-09 06:28:49 +0000 | [diff] [blame] | 616 | for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI) { |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 617 | // TODO: PHI TRANSLATE. |
Chris Lattner | 9a193fd | 2008-12-07 02:56:57 +0000 | [diff] [blame] | 618 | Worklist.push_back(*PI); |
| 619 | } |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 620 | } |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 621 | |
Chris Lattner | 9863c3f | 2008-12-09 07:47:11 +0000 | [diff] [blame] | 622 | // Okay, we're done now. If we added new values to the cache, re-sort it. |
Chris Lattner | ba4dacc | 2008-12-09 07:05:45 +0000 | [diff] [blame] | 623 | switch (Cache->size()-NumSortedEntries) { |
| 624 | case 0: |
Chris Lattner | 1aeadac | 2008-12-09 06:58:04 +0000 | [diff] [blame] | 625 | // done, no new entries. |
Chris Lattner | ba4dacc | 2008-12-09 07:05:45 +0000 | [diff] [blame] | 626 | break; |
| 627 | case 2: { |
| 628 | // Two new entries, insert the last one into place. |
| 629 | NonLocalDepEntry Val = Cache->back(); |
| 630 | Cache->pop_back(); |
| 631 | NonLocalDepInfo::iterator Entry = |
| 632 | std::upper_bound(Cache->begin(), Cache->end()-1, Val); |
| 633 | Cache->insert(Entry, Val); |
| 634 | // FALL THROUGH. |
| 635 | } |
| 636 | case 1: { |
Chris Lattner | 1aeadac | 2008-12-09 06:58:04 +0000 | [diff] [blame] | 637 | // One new entry, Just insert the new value at the appropriate position. |
| 638 | NonLocalDepEntry Val = Cache->back(); |
| 639 | Cache->pop_back(); |
| 640 | NonLocalDepInfo::iterator Entry = |
| 641 | std::upper_bound(Cache->begin(), Cache->end(), Val); |
| 642 | Cache->insert(Entry, Val); |
Chris Lattner | ba4dacc | 2008-12-09 07:05:45 +0000 | [diff] [blame] | 643 | break; |
| 644 | } |
| 645 | default: |
Chris Lattner | 1aeadac | 2008-12-09 06:58:04 +0000 | [diff] [blame] | 646 | // Added many values, do a full scale sort. |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 647 | std::sort(Cache->begin(), Cache->end()); |
Chris Lattner | 1aeadac | 2008-12-09 06:58:04 +0000 | [diff] [blame] | 648 | } |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 649 | } |
| 650 | |
| 651 | /// RemoveCachedNonLocalPointerDependencies - If P exists in |
| 652 | /// CachedNonLocalPointerInfo, remove it. |
| 653 | void MemoryDependenceAnalysis:: |
| 654 | RemoveCachedNonLocalPointerDependencies(ValueIsLoadPair P) { |
| 655 | CachedNonLocalPointerInfo::iterator It = |
| 656 | NonLocalPointerDeps.find(P); |
| 657 | if (It == NonLocalPointerDeps.end()) return; |
| 658 | |
| 659 | // Remove all of the entries in the BB->val map. This involves removing |
| 660 | // instructions from the reverse map. |
Chris Lattner | 11dcd8d | 2008-12-08 07:31:50 +0000 | [diff] [blame] | 661 | NonLocalDepInfo &PInfo = It->second.second; |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 662 | |
| 663 | for (unsigned i = 0, e = PInfo.size(); i != e; ++i) { |
| 664 | Instruction *Target = PInfo[i].second.getInst(); |
| 665 | if (Target == 0) continue; // Ignore non-local dep results. |
| 666 | assert(Target->getParent() == PInfo[i].first && Target != P.getPointer()); |
| 667 | |
| 668 | // Eliminating the dirty entry from 'Cache', so update the reverse info. |
Chris Lattner | d44745d | 2008-12-07 18:39:13 +0000 | [diff] [blame] | 669 | RemoveFromReverseMap(ReverseNonLocalPtrDeps, Target, P.getOpaqueValue()); |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 670 | } |
| 671 | |
| 672 | // Remove P from NonLocalPointerDeps (which deletes NonLocalDepInfo). |
| 673 | NonLocalPointerDeps.erase(It); |
Chris Lattner | 7ebcf03 | 2008-12-07 02:15:47 +0000 | [diff] [blame] | 674 | } |
| 675 | |
| 676 | |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 677 | /// removeInstruction - Remove an instruction from the dependence analysis, |
| 678 | /// updating the dependence of instructions that previously depended on it. |
Owen Anderson | 642a9e3 | 2007-08-08 22:26:03 +0000 | [diff] [blame] | 679 | /// This method attempts to keep the cache coherent using the reverse map. |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 680 | void MemoryDependenceAnalysis::removeInstruction(Instruction *RemInst) { |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 681 | // Walk through the Non-local dependencies, removing this one as the value |
| 682 | // for any cached queries. |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 683 | NonLocalDepMapType::iterator NLDI = NonLocalDeps.find(RemInst); |
| 684 | if (NLDI != NonLocalDeps.end()) { |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 685 | NonLocalDepInfo &BlockMap = NLDI->second.first; |
Chris Lattner | 25f4b2b | 2008-11-30 02:30:50 +0000 | [diff] [blame] | 686 | for (NonLocalDepInfo::iterator DI = BlockMap.begin(), DE = BlockMap.end(); |
| 687 | DI != DE; ++DI) |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 688 | if (Instruction *Inst = DI->second.getInst()) |
Chris Lattner | d44745d | 2008-12-07 18:39:13 +0000 | [diff] [blame] | 689 | RemoveFromReverseMap(ReverseNonLocalDeps, Inst, RemInst); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 690 | NonLocalDeps.erase(NLDI); |
| 691 | } |
Owen Anderson | 5fc4aba | 2007-12-08 01:37:09 +0000 | [diff] [blame] | 692 | |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 693 | // 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] | 694 | // |
Chris Lattner | 39f372e | 2008-11-29 01:43:36 +0000 | [diff] [blame] | 695 | LocalDepMapType::iterator LocalDepEntry = LocalDeps.find(RemInst); |
| 696 | if (LocalDepEntry != LocalDeps.end()) { |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 697 | // Remove us from DepInst's reverse set now that the local dep info is gone. |
Chris Lattner | d44745d | 2008-12-07 18:39:13 +0000 | [diff] [blame] | 698 | if (Instruction *Inst = LocalDepEntry->second.getInst()) |
| 699 | RemoveFromReverseMap(ReverseLocalDeps, Inst, RemInst); |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 700 | |
Chris Lattner | baad888 | 2008-11-28 22:28:27 +0000 | [diff] [blame] | 701 | // Remove this local dependency info. |
Chris Lattner | 39f372e | 2008-11-29 01:43:36 +0000 | [diff] [blame] | 702 | LocalDeps.erase(LocalDepEntry); |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 703 | } |
| 704 | |
| 705 | // If we have any cached pointer dependencies on this instruction, remove |
| 706 | // them. If the instruction has non-pointer type, then it can't be a pointer |
| 707 | // base. |
| 708 | |
| 709 | // Remove it from both the load info and the store info. The instruction |
| 710 | // can't be in either of these maps if it is non-pointer. |
| 711 | if (isa<PointerType>(RemInst->getType())) { |
| 712 | RemoveCachedNonLocalPointerDependencies(ValueIsLoadPair(RemInst, false)); |
| 713 | RemoveCachedNonLocalPointerDependencies(ValueIsLoadPair(RemInst, true)); |
| 714 | } |
Chris Lattner | baad888 | 2008-11-28 22:28:27 +0000 | [diff] [blame] | 715 | |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 716 | // Loop over all of the things that depend on the instruction we're removing. |
| 717 | // |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 718 | SmallVector<std::pair<Instruction*, Instruction*>, 8> ReverseDepsToAdd; |
Chris Lattner | 0655f73 | 2008-12-07 18:42:51 +0000 | [diff] [blame] | 719 | |
| 720 | // If we find RemInst as a clobber or Def in any of the maps for other values, |
| 721 | // we need to replace its entry with a dirty version of the instruction after |
| 722 | // it. If RemInst is a terminator, we use a null dirty value. |
| 723 | // |
| 724 | // Using a dirty version of the instruction after RemInst saves having to scan |
| 725 | // the entire block to get to this point. |
| 726 | MemDepResult NewDirtyVal; |
| 727 | if (!RemInst->isTerminator()) |
| 728 | NewDirtyVal = MemDepResult::getDirty(++BasicBlock::iterator(RemInst)); |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 729 | |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 730 | ReverseDepMapType::iterator ReverseDepIt = ReverseLocalDeps.find(RemInst); |
| 731 | if (ReverseDepIt != ReverseLocalDeps.end()) { |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 732 | SmallPtrSet<Instruction*, 4> &ReverseDeps = ReverseDepIt->second; |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 733 | // RemInst can't be the terminator if it has local stuff depending on it. |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 734 | assert(!ReverseDeps.empty() && !isa<TerminatorInst>(RemInst) && |
| 735 | "Nothing can locally depend on a terminator"); |
| 736 | |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 737 | for (SmallPtrSet<Instruction*, 4>::iterator I = ReverseDeps.begin(), |
| 738 | E = ReverseDeps.end(); I != E; ++I) { |
| 739 | Instruction *InstDependingOnRemInst = *I; |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 740 | assert(InstDependingOnRemInst != RemInst && |
| 741 | "Already removed our local dep info"); |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 742 | |
Chris Lattner | 0655f73 | 2008-12-07 18:42:51 +0000 | [diff] [blame] | 743 | LocalDeps[InstDependingOnRemInst] = NewDirtyVal; |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 744 | |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 745 | // Make sure to remember that new things depend on NewDepInst. |
Chris Lattner | 0655f73 | 2008-12-07 18:42:51 +0000 | [diff] [blame] | 746 | assert(NewDirtyVal.getInst() && "There is no way something else can have " |
| 747 | "a local dep on this if it is a terminator!"); |
| 748 | ReverseDepsToAdd.push_back(std::make_pair(NewDirtyVal.getInst(), |
Chris Lattner | 125ce36 | 2008-11-30 01:09:30 +0000 | [diff] [blame] | 749 | InstDependingOnRemInst)); |
Chris Lattner | d3d12ec | 2008-11-28 22:51:08 +0000 | [diff] [blame] | 750 | } |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 751 | |
| 752 | ReverseLocalDeps.erase(ReverseDepIt); |
| 753 | |
| 754 | // Add new reverse deps after scanning the set, to avoid invalidating the |
| 755 | // 'ReverseDeps' reference. |
| 756 | while (!ReverseDepsToAdd.empty()) { |
| 757 | ReverseLocalDeps[ReverseDepsToAdd.back().first] |
| 758 | .insert(ReverseDepsToAdd.back().second); |
| 759 | ReverseDepsToAdd.pop_back(); |
| 760 | } |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 761 | } |
Owen Anderson | 4d13de4 | 2007-08-16 21:27:05 +0000 | [diff] [blame] | 762 | |
Chris Lattner | 8c46527 | 2008-11-29 09:20:15 +0000 | [diff] [blame] | 763 | ReverseDepIt = ReverseNonLocalDeps.find(RemInst); |
| 764 | if (ReverseDepIt != ReverseNonLocalDeps.end()) { |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 765 | SmallPtrSet<Instruction*, 4> &Set = ReverseDepIt->second; |
| 766 | for (SmallPtrSet<Instruction*, 4>::iterator I = Set.begin(), E = Set.end(); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 767 | I != E; ++I) { |
| 768 | assert(*I != RemInst && "Already removed NonLocalDep info for RemInst"); |
| 769 | |
Chris Lattner | 4a69bad | 2008-11-30 02:52:26 +0000 | [diff] [blame] | 770 | PerInstNLInfo &INLD = NonLocalDeps[*I]; |
Chris Lattner | 4a69bad | 2008-11-30 02:52:26 +0000 | [diff] [blame] | 771 | // The information is now dirty! |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 772 | INLD.second = true; |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 773 | |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 774 | for (NonLocalDepInfo::iterator DI = INLD.first.begin(), |
| 775 | DE = INLD.first.end(); DI != DE; ++DI) { |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 776 | if (DI->second.getInst() != RemInst) continue; |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 777 | |
| 778 | // Convert to a dirty entry for the subsequent instruction. |
Chris Lattner | 0655f73 | 2008-12-07 18:42:51 +0000 | [diff] [blame] | 779 | DI->second = NewDirtyVal; |
| 780 | |
| 781 | if (Instruction *NextI = NewDirtyVal.getInst()) |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 782 | ReverseDepsToAdd.push_back(std::make_pair(NextI, *I)); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 783 | } |
| 784 | } |
Chris Lattner | 4f8c18c | 2008-11-29 23:30:39 +0000 | [diff] [blame] | 785 | |
| 786 | ReverseNonLocalDeps.erase(ReverseDepIt); |
| 787 | |
Chris Lattner | 0ec48dd | 2008-11-29 22:02:15 +0000 | [diff] [blame] | 788 | // Add new reverse deps after scanning the set, to avoid invalidating 'Set' |
| 789 | while (!ReverseDepsToAdd.empty()) { |
| 790 | ReverseNonLocalDeps[ReverseDepsToAdd.back().first] |
| 791 | .insert(ReverseDepsToAdd.back().second); |
| 792 | ReverseDepsToAdd.pop_back(); |
| 793 | } |
Owen Anderson | 4d13de4 | 2007-08-16 21:27:05 +0000 | [diff] [blame] | 794 | } |
Owen Anderson | 5fc4aba | 2007-12-08 01:37:09 +0000 | [diff] [blame] | 795 | |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 796 | // If the instruction is in ReverseNonLocalPtrDeps then it appears as a |
| 797 | // value in the NonLocalPointerDeps info. |
| 798 | ReverseNonLocalPtrDepTy::iterator ReversePtrDepIt = |
| 799 | ReverseNonLocalPtrDeps.find(RemInst); |
| 800 | if (ReversePtrDepIt != ReverseNonLocalPtrDeps.end()) { |
| 801 | SmallPtrSet<void*, 4> &Set = ReversePtrDepIt->second; |
| 802 | SmallVector<std::pair<Instruction*, ValueIsLoadPair>,8> ReversePtrDepsToAdd; |
| 803 | |
| 804 | for (SmallPtrSet<void*, 4>::iterator I = Set.begin(), E = Set.end(); |
| 805 | I != E; ++I) { |
| 806 | ValueIsLoadPair P; |
| 807 | P.setFromOpaqueValue(*I); |
| 808 | assert(P.getPointer() != RemInst && |
| 809 | "Already removed NonLocalPointerDeps info for RemInst"); |
| 810 | |
Chris Lattner | 11dcd8d | 2008-12-08 07:31:50 +0000 | [diff] [blame] | 811 | NonLocalDepInfo &NLPDI = NonLocalPointerDeps[P].second; |
| 812 | |
| 813 | // The cache is not valid for any specific block anymore. |
| 814 | NonLocalPointerDeps[P].first = 0; |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 815 | |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 816 | // Update any entries for RemInst to use the instruction after it. |
| 817 | for (NonLocalDepInfo::iterator DI = NLPDI.begin(), DE = NLPDI.end(); |
| 818 | DI != DE; ++DI) { |
| 819 | if (DI->second.getInst() != RemInst) continue; |
| 820 | |
| 821 | // Convert to a dirty entry for the subsequent instruction. |
| 822 | DI->second = NewDirtyVal; |
| 823 | |
| 824 | if (Instruction *NewDirtyInst = NewDirtyVal.getInst()) |
| 825 | ReversePtrDepsToAdd.push_back(std::make_pair(NewDirtyInst, P)); |
| 826 | } |
| 827 | } |
| 828 | |
| 829 | ReverseNonLocalPtrDeps.erase(ReversePtrDepIt); |
| 830 | |
| 831 | while (!ReversePtrDepsToAdd.empty()) { |
| 832 | ReverseNonLocalPtrDeps[ReversePtrDepsToAdd.back().first] |
| 833 | .insert(ReversePtrDepsToAdd.back().second.getOpaqueValue()); |
| 834 | ReversePtrDepsToAdd.pop_back(); |
| 835 | } |
| 836 | } |
| 837 | |
| 838 | |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 839 | assert(!NonLocalDeps.count(RemInst) && "RemInst got reinserted?"); |
Chris Lattner | d777d40 | 2008-11-30 19:24:31 +0000 | [diff] [blame] | 840 | AA->deleteValue(RemInst); |
Chris Lattner | 5f589dc | 2008-11-28 22:04:47 +0000 | [diff] [blame] | 841 | DEBUG(verifyRemoved(RemInst)); |
Owen Anderson | 78e02f7 | 2007-07-06 23:14:35 +0000 | [diff] [blame] | 842 | } |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 843 | |
| 844 | /// verifyRemoved - Verify that the specified instruction does not occur |
| 845 | /// in our internal data structures. |
| 846 | void MemoryDependenceAnalysis::verifyRemoved(Instruction *D) const { |
| 847 | for (LocalDepMapType::const_iterator I = LocalDeps.begin(), |
| 848 | E = LocalDeps.end(); I != E; ++I) { |
| 849 | assert(I->first != D && "Inst occurs in data structures"); |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 850 | assert(I->second.getInst() != D && |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 851 | "Inst occurs in data structures"); |
| 852 | } |
| 853 | |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 854 | for (CachedNonLocalPointerInfo::const_iterator I =NonLocalPointerDeps.begin(), |
| 855 | E = NonLocalPointerDeps.end(); I != E; ++I) { |
| 856 | assert(I->first.getPointer() != D && "Inst occurs in NLPD map key"); |
Chris Lattner | 11dcd8d | 2008-12-08 07:31:50 +0000 | [diff] [blame] | 857 | const NonLocalDepInfo &Val = I->second.second; |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 858 | for (NonLocalDepInfo::const_iterator II = Val.begin(), E = Val.end(); |
| 859 | II != E; ++II) |
| 860 | assert(II->second.getInst() != D && "Inst occurs as NLPD value"); |
| 861 | } |
| 862 | |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 863 | for (NonLocalDepMapType::const_iterator I = NonLocalDeps.begin(), |
| 864 | E = NonLocalDeps.end(); I != E; ++I) { |
| 865 | assert(I->first != D && "Inst occurs in data structures"); |
Chris Lattner | 4a69bad | 2008-11-30 02:52:26 +0000 | [diff] [blame] | 866 | const PerInstNLInfo &INLD = I->second; |
Chris Lattner | bf145d6 | 2008-12-01 01:15:42 +0000 | [diff] [blame] | 867 | for (NonLocalDepInfo::const_iterator II = INLD.first.begin(), |
| 868 | EE = INLD.first.end(); II != EE; ++II) |
Chris Lattner | fd3dcbe | 2008-11-30 23:17:19 +0000 | [diff] [blame] | 869 | assert(II->second.getInst() != D && "Inst occurs in data structures"); |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 870 | } |
| 871 | |
| 872 | for (ReverseDepMapType::const_iterator I = ReverseLocalDeps.begin(), |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 873 | E = ReverseLocalDeps.end(); I != E; ++I) { |
| 874 | assert(I->first != D && "Inst occurs in data structures"); |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 875 | for (SmallPtrSet<Instruction*, 4>::const_iterator II = I->second.begin(), |
| 876 | EE = I->second.end(); II != EE; ++II) |
| 877 | assert(*II != D && "Inst occurs in data structures"); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 878 | } |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 879 | |
| 880 | for (ReverseDepMapType::const_iterator I = ReverseNonLocalDeps.begin(), |
| 881 | E = ReverseNonLocalDeps.end(); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 882 | I != E; ++I) { |
| 883 | assert(I->first != D && "Inst occurs in data structures"); |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 884 | for (SmallPtrSet<Instruction*, 4>::const_iterator II = I->second.begin(), |
| 885 | EE = I->second.end(); II != EE; ++II) |
| 886 | assert(*II != D && "Inst occurs in data structures"); |
Chris Lattner | f68f310 | 2008-11-30 02:28:25 +0000 | [diff] [blame] | 887 | } |
Chris Lattner | 6290f5c | 2008-12-07 08:50:20 +0000 | [diff] [blame] | 888 | |
| 889 | for (ReverseNonLocalPtrDepTy::const_iterator |
| 890 | I = ReverseNonLocalPtrDeps.begin(), |
| 891 | E = ReverseNonLocalPtrDeps.end(); I != E; ++I) { |
| 892 | assert(I->first != D && "Inst occurs in rev NLPD map"); |
| 893 | |
| 894 | for (SmallPtrSet<void*, 4>::const_iterator II = I->second.begin(), |
| 895 | E = I->second.end(); II != E; ++II) |
| 896 | assert(*II != ValueIsLoadPair(D, false).getOpaqueValue() && |
| 897 | *II != ValueIsLoadPair(D, true).getOpaqueValue() && |
| 898 | "Inst occurs in ReverseNonLocalPtrDeps map"); |
| 899 | } |
| 900 | |
Chris Lattner | 729b237 | 2008-11-29 21:25:10 +0000 | [diff] [blame] | 901 | } |