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