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