Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1 | //===-- Value.cpp - Implement the Value class -----------------------------===// |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 2 | // |
John Criswell | 482202a | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | f3ebc3f | 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. |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 7 | // |
John Criswell | 482202a | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 9 | // |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 10 | // This file implements the Value, ValueHandle, and User classes. |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
Chandler Carruth | 9fb823b | 2013-01-02 11:36:10 +0000 | [diff] [blame] | 14 | #include "llvm/IR/Value.h" |
Owen Anderson | e8f2185 | 2009-08-18 18:28:58 +0000 | [diff] [blame] | 15 | #include "LLVMContextImpl.h" |
Chandler Carruth | ed0881b | 2012-12-03 16:50:05 +0000 | [diff] [blame] | 16 | #include "llvm/ADT/DenseMap.h" |
| 17 | #include "llvm/ADT/SmallString.h" |
Hal Finkel | b0407ba | 2014-07-18 15:51:28 +0000 | [diff] [blame] | 18 | #include "llvm/IR/CallSite.h" |
Chandler Carruth | 9fb823b | 2013-01-02 11:36:10 +0000 | [diff] [blame] | 19 | #include "llvm/IR/Constant.h" |
| 20 | #include "llvm/IR/Constants.h" |
Hal Finkel | 2e42c34 | 2014-07-10 05:27:53 +0000 | [diff] [blame] | 21 | #include "llvm/IR/DataLayout.h" |
Chandler Carruth | 9fb823b | 2013-01-02 11:36:10 +0000 | [diff] [blame] | 22 | #include "llvm/IR/DerivedTypes.h" |
Chandler Carruth | 03eb0de | 2014-03-04 10:40:04 +0000 | [diff] [blame] | 23 | #include "llvm/IR/GetElementPtrTypeIterator.h" |
Chandler Carruth | 9fb823b | 2013-01-02 11:36:10 +0000 | [diff] [blame] | 24 | #include "llvm/IR/InstrTypes.h" |
| 25 | #include "llvm/IR/Instructions.h" |
Chandler Carruth | 4b6845c | 2014-03-04 12:46:06 +0000 | [diff] [blame] | 26 | #include "llvm/IR/LeakDetector.h" |
Chandler Carruth | 9fb823b | 2013-01-02 11:36:10 +0000 | [diff] [blame] | 27 | #include "llvm/IR/Module.h" |
| 28 | #include "llvm/IR/Operator.h" |
Chandler Carruth | 4220e9c | 2014-03-04 11:17:44 +0000 | [diff] [blame] | 29 | #include "llvm/IR/ValueHandle.h" |
Chandler Carruth | 9fb823b | 2013-01-02 11:36:10 +0000 | [diff] [blame] | 30 | #include "llvm/IR/ValueSymbolTable.h" |
Bill Wendling | 6a462f1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 31 | #include "llvm/Support/Debug.h" |
Torok Edwin | 6dd2730 | 2009-07-08 18:01:40 +0000 | [diff] [blame] | 32 | #include "llvm/Support/ErrorHandling.h" |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 33 | #include "llvm/Support/ManagedStatic.h" |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 34 | #include <algorithm> |
Chris Lattner | 189d19f | 2003-11-21 20:23:48 +0000 | [diff] [blame] | 35 | using namespace llvm; |
Brian Gaeke | 960707c | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 36 | |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 37 | //===----------------------------------------------------------------------===// |
| 38 | // Value Class |
| 39 | //===----------------------------------------------------------------------===// |
| 40 | |
Chris Lattner | 229907c | 2011-07-18 04:54:35 +0000 | [diff] [blame] | 41 | static inline Type *checkType(Type *Ty) { |
Chris Lattner | 25450e3 | 2001-12-13 00:41:27 +0000 | [diff] [blame] | 42 | assert(Ty && "Value defined with a null type: Error!"); |
Reid Kleckner | 16bf89e | 2014-06-09 23:32:20 +0000 | [diff] [blame] | 43 | return Ty; |
Chris Lattner | 25450e3 | 2001-12-13 00:41:27 +0000 | [diff] [blame] | 44 | } |
| 45 | |
Chris Lattner | 229907c | 2011-07-18 04:54:35 +0000 | [diff] [blame] | 46 | Value::Value(Type *ty, unsigned scid) |
Reid Kleckner | 16bf89e | 2014-06-09 23:32:20 +0000 | [diff] [blame] | 47 | : VTy(checkType(ty)), UseList(nullptr), Name(nullptr), SubclassID(scid), |
| 48 | HasValueHandle(0), SubclassOptionalData(0), SubclassData(0) { |
Chris Lattner | b1ed91f | 2011-07-09 17:41:24 +0000 | [diff] [blame] | 49 | // FIXME: Why isn't this in the subclass gunk?? |
Richard Smith | 4a8e454 | 2012-12-20 04:11:02 +0000 | [diff] [blame] | 50 | // Note, we cannot call isa<CallInst> before the CallInst has been |
| 51 | // constructed. |
| 52 | if (SubclassID == Instruction::Call || SubclassID == Instruction::Invoke) |
Chris Lattner | b1ed91f | 2011-07-09 17:41:24 +0000 | [diff] [blame] | 53 | assert((VTy->isFirstClassType() || VTy->isVoidTy() || VTy->isStructTy()) && |
| 54 | "invalid CallInst type!"); |
Richard Smith | 4a8e454 | 2012-12-20 04:11:02 +0000 | [diff] [blame] | 55 | else if (SubclassID != BasicBlockVal && |
| 56 | (SubclassID < ConstantFirstVal || SubclassID > ConstantLastVal)) |
Chris Lattner | b1ed91f | 2011-07-09 17:41:24 +0000 | [diff] [blame] | 57 | assert((VTy->isFirstClassType() || VTy->isVoidTy()) && |
Chris Lattner | bea7247 | 2004-07-06 17:44:17 +0000 | [diff] [blame] | 58 | "Cannot create non-first-class values except for constants!"); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 59 | } |
| 60 | |
Gordon Henriksen | 14a5569 | 2007-12-10 02:14:30 +0000 | [diff] [blame] | 61 | Value::~Value() { |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 62 | // Notify all ValueHandles (if present) that this value is going away. |
| 63 | if (HasValueHandle) |
| 64 | ValueHandleBase::ValueIsDeleted(this); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 65 | |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 66 | #ifndef NDEBUG // Only in -g mode... |
Chris Lattner | 874ddad | 2001-06-11 15:04:40 +0000 | [diff] [blame] | 67 | // Check to make sure that there are no uses of this value that are still |
| 68 | // around when the value is destroyed. If there are, then we have a dangling |
| 69 | // reference and something is wrong. This code is here to print out what is |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 70 | // still being referenced. The value in question should be printed as |
Chris Lattner | 874ddad | 2001-06-11 15:04:40 +0000 | [diff] [blame] | 71 | // a <badref> |
| 72 | // |
Gordon Henriksen | 14a5569 | 2007-12-10 02:14:30 +0000 | [diff] [blame] | 73 | if (!use_empty()) { |
Benjamin Kramer | 1f97a5a | 2011-11-15 16:27:03 +0000 | [diff] [blame] | 74 | dbgs() << "While deleting: " << *VTy << " %" << getName() << "\n"; |
Gordon Henriksen | 14a5569 | 2007-12-10 02:14:30 +0000 | [diff] [blame] | 75 | for (use_iterator I = use_begin(), E = use_end(); I != E; ++I) |
David Greene | 3f907a9 | 2010-01-05 01:30:09 +0000 | [diff] [blame] | 76 | dbgs() << "Use still stuck around after Def is destroyed:" |
Bill Wendling | 6a462f1 | 2006-11-17 08:03:48 +0000 | [diff] [blame] | 77 | << **I << "\n"; |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 78 | } |
| 79 | #endif |
Gordon Henriksen | 14a5569 | 2007-12-10 02:14:30 +0000 | [diff] [blame] | 80 | assert(use_empty() && "Uses remain when a value is destroyed!"); |
Chris Lattner | 694285c | 2009-08-04 23:07:12 +0000 | [diff] [blame] | 81 | |
| 82 | // If this value is named, destroy the name. This should not be in a symtab |
| 83 | // at this point. |
Bill Wendling | c4c568b | 2012-04-10 20:12:16 +0000 | [diff] [blame] | 84 | if (Name && SubclassID != MDStringVal) |
Chris Lattner | 694285c | 2009-08-04 23:07:12 +0000 | [diff] [blame] | 85 | Name->Destroy(); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 86 | |
Chris Lattner | 694285c | 2009-08-04 23:07:12 +0000 | [diff] [blame] | 87 | // There should be no uses of this object anymore, remove it. |
| 88 | LeakDetector::removeGarbageObject(this); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 89 | } |
| 90 | |
Chris Lattner | 4947e67 | 2005-02-01 01:24:21 +0000 | [diff] [blame] | 91 | bool Value::hasNUses(unsigned N) const { |
Gabor Greif | c78d720 | 2010-03-25 23:06:16 +0000 | [diff] [blame] | 92 | const_use_iterator UI = use_begin(), E = use_end(); |
Chris Lattner | 4947e67 | 2005-02-01 01:24:21 +0000 | [diff] [blame] | 93 | |
| 94 | for (; N; --N, ++UI) |
| 95 | if (UI == E) return false; // Too few. |
| 96 | return UI == E; |
| 97 | } |
| 98 | |
Chris Lattner | d36552f | 2005-02-23 16:51:11 +0000 | [diff] [blame] | 99 | bool Value::hasNUsesOrMore(unsigned N) const { |
Gabor Greif | c78d720 | 2010-03-25 23:06:16 +0000 | [diff] [blame] | 100 | const_use_iterator UI = use_begin(), E = use_end(); |
Chris Lattner | d36552f | 2005-02-23 16:51:11 +0000 | [diff] [blame] | 101 | |
| 102 | for (; N; --N, ++UI) |
| 103 | if (UI == E) return false; // Too few. |
| 104 | |
| 105 | return true; |
| 106 | } |
| 107 | |
Bill Wendling | 0c37421 | 2008-09-25 22:42:01 +0000 | [diff] [blame] | 108 | bool Value::isUsedInBasicBlock(const BasicBlock *BB) const { |
Jakob Stoklund Olesen | 0925b24 | 2013-05-14 23:45:56 +0000 | [diff] [blame] | 109 | // This can be computed either by scanning the instructions in BB, or by |
| 110 | // scanning the use list of this Value. Both lists can be very long, but |
| 111 | // usually one is quite short. |
| 112 | // |
| 113 | // Scan both lists simultaneously until one is exhausted. This limits the |
| 114 | // search to the shorter list. |
| 115 | BasicBlock::const_iterator BI = BB->begin(), BE = BB->end(); |
Chandler Carruth | cdf4788 | 2014-03-09 03:16:01 +0000 | [diff] [blame] | 116 | const_user_iterator UI = user_begin(), UE = user_end(); |
Jakob Stoklund Olesen | 0925b24 | 2013-05-14 23:45:56 +0000 | [diff] [blame] | 117 | for (; BI != BE && UI != UE; ++BI, ++UI) { |
| 118 | // Scan basic block: Check if this Value is used by the instruction at BI. |
| 119 | if (std::find(BI->op_begin(), BI->op_end(), this) != BI->op_end()) |
Benjamin Kramer | 1323103 | 2011-12-05 17:23:27 +0000 | [diff] [blame] | 120 | return true; |
Jakob Stoklund Olesen | 0925b24 | 2013-05-14 23:45:56 +0000 | [diff] [blame] | 121 | // Scan use list: Check if the use at UI is in BB. |
| 122 | const Instruction *User = dyn_cast<Instruction>(*UI); |
Evan Cheng | 89553cc | 2008-06-12 21:15:59 +0000 | [diff] [blame] | 123 | if (User && User->getParent() == BB) |
| 124 | return true; |
| 125 | } |
| 126 | return false; |
| 127 | } |
| 128 | |
Chris Lattner | 4947e67 | 2005-02-01 01:24:21 +0000 | [diff] [blame] | 129 | unsigned Value::getNumUses() const { |
| 130 | return (unsigned)std::distance(use_begin(), use_end()); |
| 131 | } |
| 132 | |
Chris Lattner | b625082 | 2007-02-11 00:37:27 +0000 | [diff] [blame] | 133 | static bool getSymTab(Value *V, ValueSymbolTable *&ST) { |
Craig Topper | c620761 | 2014-04-09 06:08:46 +0000 | [diff] [blame] | 134 | ST = nullptr; |
Chris Lattner | b625082 | 2007-02-11 00:37:27 +0000 | [diff] [blame] | 135 | if (Instruction *I = dyn_cast<Instruction>(V)) { |
| 136 | if (BasicBlock *P = I->getParent()) |
| 137 | if (Function *PP = P->getParent()) |
| 138 | ST = &PP->getValueSymbolTable(); |
| 139 | } else if (BasicBlock *BB = dyn_cast<BasicBlock>(V)) { |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 140 | if (Function *P = BB->getParent()) |
Chris Lattner | b625082 | 2007-02-11 00:37:27 +0000 | [diff] [blame] | 141 | ST = &P->getValueSymbolTable(); |
| 142 | } else if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) { |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 143 | if (Module *P = GV->getParent()) |
Chris Lattner | b625082 | 2007-02-11 00:37:27 +0000 | [diff] [blame] | 144 | ST = &P->getValueSymbolTable(); |
| 145 | } else if (Argument *A = dyn_cast<Argument>(V)) { |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 146 | if (Function *P = A->getParent()) |
Chris Lattner | b625082 | 2007-02-11 00:37:27 +0000 | [diff] [blame] | 147 | ST = &P->getValueSymbolTable(); |
Devang Patel | 7428d8a | 2009-07-22 17:43:22 +0000 | [diff] [blame] | 148 | } else if (isa<MDString>(V)) |
| 149 | return true; |
| 150 | else { |
Chris Lattner | b625082 | 2007-02-11 00:37:27 +0000 | [diff] [blame] | 151 | assert(isa<Constant>(V) && "Unknown value type!"); |
| 152 | return true; // no name is setable for this. |
| 153 | } |
| 154 | return false; |
| 155 | } |
Chris Lattner | 2c6abea | 2002-10-09 23:12:59 +0000 | [diff] [blame] | 156 | |
Daniel Dunbar | 3228594 | 2009-07-26 00:51:56 +0000 | [diff] [blame] | 157 | StringRef Value::getName() const { |
Daniel Dunbar | 7cc8f7e | 2009-07-26 09:22:02 +0000 | [diff] [blame] | 158 | // Make sure the empty string is still a C string. For historical reasons, |
| 159 | // some clients want to call .data() on the result and expect it to be null |
| 160 | // terminated. |
| 161 | if (!Name) return StringRef("", 0); |
Daniel Dunbar | 3228594 | 2009-07-26 00:51:56 +0000 | [diff] [blame] | 162 | return Name->getKey(); |
Chris Lattner | 5109a88 | 2007-08-10 15:34:35 +0000 | [diff] [blame] | 163 | } |
| 164 | |
Daniel Dunbar | d786b51 | 2009-07-26 00:34:27 +0000 | [diff] [blame] | 165 | void Value::setName(const Twine &NewName) { |
Bill Wendling | c4c568b | 2012-04-10 20:12:16 +0000 | [diff] [blame] | 166 | assert(SubclassID != MDStringVal && |
| 167 | "Cannot set the name of MDString with this method!"); |
| 168 | |
Daniel Dunbar | cb13b48 | 2009-08-19 23:37:23 +0000 | [diff] [blame] | 169 | // Fast path for common IRBuilder case of setName("") when there is no name. |
| 170 | if (NewName.isTriviallyEmpty() && !hasName()) |
| 171 | return; |
| 172 | |
Daniel Dunbar | acf0b25 | 2009-08-19 05:08:06 +0000 | [diff] [blame] | 173 | SmallString<256> NameData; |
Benjamin Kramer | 2e06b93 | 2010-01-13 12:45:23 +0000 | [diff] [blame] | 174 | StringRef NameRef = NewName.toStringRef(NameData); |
Rafael Espindola | 09d689f | 2013-11-19 21:12:39 +0000 | [diff] [blame] | 175 | assert(NameRef.find_first_of(0) == StringRef::npos && |
| 176 | "Null bytes are not allowed in names"); |
Daniel Dunbar | d786b51 | 2009-07-26 00:34:27 +0000 | [diff] [blame] | 177 | |
Daniel Dunbar | a32c999 | 2009-07-26 00:42:33 +0000 | [diff] [blame] | 178 | // Name isn't changing? |
Benjamin Kramer | 2e06b93 | 2010-01-13 12:45:23 +0000 | [diff] [blame] | 179 | if (getName() == NameRef) |
Daniel Dunbar | a32c999 | 2009-07-26 00:42:33 +0000 | [diff] [blame] | 180 | return; |
| 181 | |
Benjamin Kramer | ccce8ba | 2010-01-05 13:12:22 +0000 | [diff] [blame] | 182 | assert(!getType()->isVoidTy() && "Cannot assign a name to void values!"); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 183 | |
Chris Lattner | ffb3778 | 2005-03-06 02:14:28 +0000 | [diff] [blame] | 184 | // Get the symbol table to update for this object. |
Chris Lattner | b625082 | 2007-02-11 00:37:27 +0000 | [diff] [blame] | 185 | ValueSymbolTable *ST; |
| 186 | if (getSymTab(this, ST)) |
| 187 | return; // Cannot set a name on this value (e.g. constant). |
Chris Lattner | cdb9bfc | 2005-03-05 19:51:50 +0000 | [diff] [blame] | 188 | |
Michael Ilseman | 516d703 | 2013-03-01 18:48:54 +0000 | [diff] [blame] | 189 | if (Function *F = dyn_cast<Function>(this)) |
| 190 | getContext().pImpl->IntrinsicIDCache.erase(F); |
| 191 | |
Chris Lattner | 32ab643 | 2007-02-12 05:18:08 +0000 | [diff] [blame] | 192 | if (!ST) { // No symbol table to update? Just do the change. |
Benjamin Kramer | 2e06b93 | 2010-01-13 12:45:23 +0000 | [diff] [blame] | 193 | if (NameRef.empty()) { |
Chris Lattner | 32ab643 | 2007-02-12 05:18:08 +0000 | [diff] [blame] | 194 | // Free the name for this value. |
| 195 | Name->Destroy(); |
Craig Topper | c620761 | 2014-04-09 06:08:46 +0000 | [diff] [blame] | 196 | Name = nullptr; |
Chris Lattner | 1a5de58 | 2007-02-12 18:52:59 +0000 | [diff] [blame] | 197 | return; |
Chris Lattner | ffb3778 | 2005-03-06 02:14:28 +0000 | [diff] [blame] | 198 | } |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 199 | |
Daniel Dunbar | a32c999 | 2009-07-26 00:42:33 +0000 | [diff] [blame] | 200 | if (Name) |
Chris Lattner | 1a5de58 | 2007-02-12 18:52:59 +0000 | [diff] [blame] | 201 | Name->Destroy(); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 202 | |
Chris Lattner | 1a5de58 | 2007-02-12 18:52:59 +0000 | [diff] [blame] | 203 | // NOTE: Could optimize for the case the name is shrinking to not deallocate |
| 204 | // then reallocated. |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 205 | |
Chris Lattner | 1a5de58 | 2007-02-12 18:52:59 +0000 | [diff] [blame] | 206 | // Create the new name. |
Craig Topper | 213d2f7 | 2014-06-11 05:35:56 +0000 | [diff] [blame] | 207 | Name = ValueName::Create(NameRef); |
Chris Lattner | 1a5de58 | 2007-02-12 18:52:59 +0000 | [diff] [blame] | 208 | Name->setValue(this); |
Chris Lattner | 32ab643 | 2007-02-12 05:18:08 +0000 | [diff] [blame] | 209 | return; |
Chris Lattner | ffb3778 | 2005-03-06 02:14:28 +0000 | [diff] [blame] | 210 | } |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 211 | |
Chris Lattner | 32ab643 | 2007-02-12 05:18:08 +0000 | [diff] [blame] | 212 | // NOTE: Could optimize for the case the name is shrinking to not deallocate |
| 213 | // then reallocated. |
| 214 | if (hasName()) { |
Chris Lattner | 32ab643 | 2007-02-12 05:18:08 +0000 | [diff] [blame] | 215 | // Remove old name. |
| 216 | ST->removeValueName(Name); |
| 217 | Name->Destroy(); |
Craig Topper | c620761 | 2014-04-09 06:08:46 +0000 | [diff] [blame] | 218 | Name = nullptr; |
Chris Lattner | 32ab643 | 2007-02-12 05:18:08 +0000 | [diff] [blame] | 219 | |
Benjamin Kramer | 2e06b93 | 2010-01-13 12:45:23 +0000 | [diff] [blame] | 220 | if (NameRef.empty()) |
Chris Lattner | 1a5de58 | 2007-02-12 18:52:59 +0000 | [diff] [blame] | 221 | return; |
Chris Lattner | 32ab643 | 2007-02-12 05:18:08 +0000 | [diff] [blame] | 222 | } |
| 223 | |
| 224 | // Name is changing to something new. |
Benjamin Kramer | 2e06b93 | 2010-01-13 12:45:23 +0000 | [diff] [blame] | 225 | Name = ST->createValueName(NameRef, this); |
Chris Lattner | cdb9bfc | 2005-03-05 19:51:50 +0000 | [diff] [blame] | 226 | } |
| 227 | |
Chris Lattner | b625082 | 2007-02-11 00:37:27 +0000 | [diff] [blame] | 228 | void Value::takeName(Value *V) { |
Bill Wendling | c4c568b | 2012-04-10 20:12:16 +0000 | [diff] [blame] | 229 | assert(SubclassID != MDStringVal && "Cannot take the name of an MDString!"); |
| 230 | |
Craig Topper | c620761 | 2014-04-09 06:08:46 +0000 | [diff] [blame] | 231 | ValueSymbolTable *ST = nullptr; |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 232 | // If this value has a name, drop it. |
| 233 | if (hasName()) { |
| 234 | // Get the symtab this is in. |
| 235 | if (getSymTab(this, ST)) { |
| 236 | // We can't set a name on this value, but we need to clear V's name if |
| 237 | // it has one. |
Daniel Dunbar | d786b51 | 2009-07-26 00:34:27 +0000 | [diff] [blame] | 238 | if (V->hasName()) V->setName(""); |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 239 | return; // Cannot set a name on this value (e.g. constant). |
| 240 | } |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 241 | |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 242 | // Remove old name. |
| 243 | if (ST) |
| 244 | ST->removeValueName(Name); |
| 245 | Name->Destroy(); |
Craig Topper | c620761 | 2014-04-09 06:08:46 +0000 | [diff] [blame] | 246 | Name = nullptr; |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 247 | } |
| 248 | |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 249 | // Now we know that this has no name. |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 250 | |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 251 | // If V has no name either, we're done. |
| 252 | if (!V->hasName()) return; |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 253 | |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 254 | // Get this's symtab if we didn't before. |
| 255 | if (!ST) { |
| 256 | if (getSymTab(this, ST)) { |
| 257 | // Clear V's name. |
Daniel Dunbar | d786b51 | 2009-07-26 00:34:27 +0000 | [diff] [blame] | 258 | V->setName(""); |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 259 | return; // Cannot set a name on this value (e.g. constant). |
| 260 | } |
| 261 | } |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 262 | |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 263 | // Get V's ST, this should always succed, because V has a name. |
| 264 | ValueSymbolTable *VST; |
| 265 | bool Failure = getSymTab(V, VST); |
Jeffrey Yasskin | 9b43f33 | 2010-12-23 00:58:24 +0000 | [diff] [blame] | 266 | assert(!Failure && "V has a name, so it should have a ST!"); (void)Failure; |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 267 | |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 268 | // If these values are both in the same symtab, we can do this very fast. |
| 269 | // This works even if both values have no symtab yet. |
| 270 | if (ST == VST) { |
| 271 | // Take the name! |
| 272 | Name = V->Name; |
Craig Topper | c620761 | 2014-04-09 06:08:46 +0000 | [diff] [blame] | 273 | V->Name = nullptr; |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 274 | Name->setValue(this); |
Chris Lattner | cba18e3 | 2007-02-11 01:04:09 +0000 | [diff] [blame] | 275 | return; |
| 276 | } |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 277 | |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 278 | // Otherwise, things are slightly more complex. Remove V's name from VST and |
| 279 | // then reinsert it into ST. |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 280 | |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 281 | if (VST) |
| 282 | VST->removeValueName(V->Name); |
| 283 | Name = V->Name; |
Craig Topper | c620761 | 2014-04-09 06:08:46 +0000 | [diff] [blame] | 284 | V->Name = nullptr; |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 285 | Name->setValue(this); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 286 | |
Chris Lattner | cf835ff | 2007-02-15 20:01:43 +0000 | [diff] [blame] | 287 | if (ST) |
| 288 | ST->reinsertValue(this); |
Chris Lattner | b625082 | 2007-02-11 00:37:27 +0000 | [diff] [blame] | 289 | } |
| 290 | |
Rafael Espindola | 7e2b756 | 2014-05-13 01:23:21 +0000 | [diff] [blame] | 291 | #ifndef NDEBUG |
Craig Topper | 71b7b68 | 2014-08-21 05:55:13 +0000 | [diff] [blame] | 292 | static bool contains(SmallPtrSetImpl<ConstantExpr *> &Cache, ConstantExpr *Expr, |
Rafael Espindola | 7e2b756 | 2014-05-13 01:23:21 +0000 | [diff] [blame] | 293 | Constant *C) { |
| 294 | if (!Cache.insert(Expr)) |
| 295 | return false; |
| 296 | |
| 297 | for (auto &O : Expr->operands()) { |
| 298 | if (O == C) |
| 299 | return true; |
| 300 | auto *CE = dyn_cast<ConstantExpr>(O); |
| 301 | if (!CE) |
| 302 | continue; |
| 303 | if (contains(Cache, CE, C)) |
| 304 | return true; |
| 305 | } |
| 306 | return false; |
| 307 | } |
| 308 | |
| 309 | static bool contains(Value *Expr, Value *V) { |
| 310 | if (Expr == V) |
| 311 | return true; |
| 312 | |
| 313 | auto *C = dyn_cast<Constant>(V); |
| 314 | if (!C) |
| 315 | return false; |
| 316 | |
| 317 | auto *CE = dyn_cast<ConstantExpr>(Expr); |
| 318 | if (!CE) |
| 319 | return false; |
| 320 | |
| 321 | SmallPtrSet<ConstantExpr *, 4> Cache; |
| 322 | return contains(Cache, CE, C); |
| 323 | } |
| 324 | #endif |
Chris Lattner | b625082 | 2007-02-11 00:37:27 +0000 | [diff] [blame] | 325 | |
Chris Lattner | af1783f | 2011-07-15 06:18:52 +0000 | [diff] [blame] | 326 | void Value::replaceAllUsesWith(Value *New) { |
| 327 | assert(New && "Value::replaceAllUsesWith(<null>) is invalid!"); |
Rafael Espindola | 7e2b756 | 2014-05-13 01:23:21 +0000 | [diff] [blame] | 328 | assert(!contains(New, this) && |
| 329 | "this->replaceAllUsesWith(expr(this)) is NOT valid!"); |
Chris Lattner | af1783f | 2011-07-15 06:18:52 +0000 | [diff] [blame] | 330 | assert(New->getType() == getType() && |
| 331 | "replaceAllUses of value with new value of different type!"); |
| 332 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 333 | // Notify all ValueHandles (if present) that this value is going away. |
| 334 | if (HasValueHandle) |
| 335 | ValueHandleBase::ValueIsRAUWd(this, New); |
Michael Ilseman | 516d703 | 2013-03-01 18:48:54 +0000 | [diff] [blame] | 336 | |
Chris Lattner | 4947e67 | 2005-02-01 01:24:21 +0000 | [diff] [blame] | 337 | while (!use_empty()) { |
Gabor Greif | 715b9d2 | 2008-09-19 15:13:20 +0000 | [diff] [blame] | 338 | Use &U = *UseList; |
Chris Lattner | 9f15812 | 2003-08-29 05:09:37 +0000 | [diff] [blame] | 339 | // Must handle Constants specially, we cannot call replaceUsesOfWith on a |
Chris Lattner | 8e5b2c2 | 2007-08-21 00:21:07 +0000 | [diff] [blame] | 340 | // constant because they are uniqued. |
Rafael Espindola | 6b23863 | 2014-05-16 19:35:39 +0000 | [diff] [blame] | 341 | if (auto *C = dyn_cast<Constant>(U.getUser())) { |
Chris Lattner | 8e5b2c2 | 2007-08-21 00:21:07 +0000 | [diff] [blame] | 342 | if (!isa<GlobalValue>(C)) { |
Chris Lattner | 7a1450d | 2005-10-04 18:13:04 +0000 | [diff] [blame] | 343 | C->replaceUsesOfWithOnConstant(this, New, &U); |
Chris Lattner | 8e5b2c2 | 2007-08-21 00:21:07 +0000 | [diff] [blame] | 344 | continue; |
| 345 | } |
Chris Lattner | 9f15812 | 2003-08-29 05:09:37 +0000 | [diff] [blame] | 346 | } |
Michael Ilseman | 516d703 | 2013-03-01 18:48:54 +0000 | [diff] [blame] | 347 | |
Chris Lattner | 8e5b2c2 | 2007-08-21 00:21:07 +0000 | [diff] [blame] | 348 | U.set(New); |
Chris Lattner | 9f15812 | 2003-08-29 05:09:37 +0000 | [diff] [blame] | 349 | } |
Michael Ilseman | 516d703 | 2013-03-01 18:48:54 +0000 | [diff] [blame] | 350 | |
Jay Foad | 61ea0e4 | 2011-06-23 09:09:15 +0000 | [diff] [blame] | 351 | if (BasicBlock *BB = dyn_cast<BasicBlock>(this)) |
| 352 | BB->replaceSuccessorsPhiUsesWith(cast<BasicBlock>(New)); |
Chris Lattner | 9f15812 | 2003-08-29 05:09:37 +0000 | [diff] [blame] | 353 | } |
| 354 | |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 355 | namespace { |
| 356 | // Various metrics for how much to strip off of pointers. |
| 357 | enum PointerStripKind { |
| 358 | PSK_ZeroIndices, |
Rafael Espindola | c229a4f | 2013-05-06 01:48:55 +0000 | [diff] [blame] | 359 | PSK_ZeroIndicesAndAliases, |
Chandler Carruth | 4d1d34f | 2012-03-14 23:19:53 +0000 | [diff] [blame] | 360 | PSK_InBoundsConstantIndices, |
| 361 | PSK_InBounds |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 362 | }; |
| 363 | |
| 364 | template <PointerStripKind StripKind> |
| 365 | static Value *stripPointerCastsAndOffsets(Value *V) { |
| 366 | if (!V->getType()->isPointerTy()) |
| 367 | return V; |
Dan Gohman | 7c34ece | 2010-06-28 21:16:52 +0000 | [diff] [blame] | 368 | |
| 369 | // Even though we don't look through PHI nodes, we could be called on an |
| 370 | // instruction in an unreachable block, which may be on a cycle. |
| 371 | SmallPtrSet<Value *, 4> Visited; |
| 372 | |
Dan Gohman | 7c34ece | 2010-06-28 21:16:52 +0000 | [diff] [blame] | 373 | Visited.insert(V); |
Duncan Sands | e59fa78 | 2008-12-29 21:06:19 +0000 | [diff] [blame] | 374 | do { |
Dan Gohman | e1019db | 2009-07-17 23:55:56 +0000 | [diff] [blame] | 375 | if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) { |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 376 | switch (StripKind) { |
Rafael Espindola | c229a4f | 2013-05-06 01:48:55 +0000 | [diff] [blame] | 377 | case PSK_ZeroIndicesAndAliases: |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 378 | case PSK_ZeroIndices: |
| 379 | if (!GEP->hasAllZeroIndices()) |
| 380 | return V; |
| 381 | break; |
Chandler Carruth | 4d1d34f | 2012-03-14 23:19:53 +0000 | [diff] [blame] | 382 | case PSK_InBoundsConstantIndices: |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 383 | if (!GEP->hasAllConstantIndices()) |
| 384 | return V; |
Chandler Carruth | 4d1d34f | 2012-03-14 23:19:53 +0000 | [diff] [blame] | 385 | // fallthrough |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 386 | case PSK_InBounds: |
| 387 | if (!GEP->isInBounds()) |
| 388 | return V; |
| 389 | break; |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 390 | } |
Dan Gohman | e1019db | 2009-07-17 23:55:56 +0000 | [diff] [blame] | 391 | V = GEP->getPointerOperand(); |
Matt Arsenault | b03bd4d | 2013-11-15 01:34:59 +0000 | [diff] [blame] | 392 | } else if (Operator::getOpcode(V) == Instruction::BitCast || |
| 393 | Operator::getOpcode(V) == Instruction::AddrSpaceCast) { |
Dan Gohman | e1019db | 2009-07-17 23:55:56 +0000 | [diff] [blame] | 394 | V = cast<Operator>(V)->getOperand(0); |
Dan Gohman | 4ce5ade | 2009-08-27 17:55:13 +0000 | [diff] [blame] | 395 | } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) { |
Rafael Espindola | c229a4f | 2013-05-06 01:48:55 +0000 | [diff] [blame] | 396 | if (StripKind == PSK_ZeroIndices || GA->mayBeOverridden()) |
Dan Gohman | 4ce5ade | 2009-08-27 17:55:13 +0000 | [diff] [blame] | 397 | return V; |
| 398 | V = GA->getAliasee(); |
Duncan Sands | e59fa78 | 2008-12-29 21:06:19 +0000 | [diff] [blame] | 399 | } else { |
| 400 | return V; |
Anton Korobeynikov | fc2edad | 2008-05-07 22:54:15 +0000 | [diff] [blame] | 401 | } |
Duncan Sands | 19d0b47 | 2010-02-16 11:11:14 +0000 | [diff] [blame] | 402 | assert(V->getType()->isPointerTy() && "Unexpected operand type!"); |
Dan Gohman | 7c34ece | 2010-06-28 21:16:52 +0000 | [diff] [blame] | 403 | } while (Visited.insert(V)); |
| 404 | |
| 405 | return V; |
Anton Korobeynikov | fc2edad | 2008-05-07 22:54:15 +0000 | [diff] [blame] | 406 | } |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 407 | } // namespace |
| 408 | |
| 409 | Value *Value::stripPointerCasts() { |
Rafael Espindola | c229a4f | 2013-05-06 01:48:55 +0000 | [diff] [blame] | 410 | return stripPointerCastsAndOffsets<PSK_ZeroIndicesAndAliases>(this); |
| 411 | } |
| 412 | |
| 413 | Value *Value::stripPointerCastsNoFollowAliases() { |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 414 | return stripPointerCastsAndOffsets<PSK_ZeroIndices>(this); |
| 415 | } |
| 416 | |
Chandler Carruth | 4d1d34f | 2012-03-14 23:19:53 +0000 | [diff] [blame] | 417 | Value *Value::stripInBoundsConstantOffsets() { |
| 418 | return stripPointerCastsAndOffsets<PSK_InBoundsConstantIndices>(this); |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 419 | } |
| 420 | |
Chandler Carruth | 989e630 | 2013-08-22 11:25:11 +0000 | [diff] [blame] | 421 | Value *Value::stripAndAccumulateInBoundsConstantOffsets(const DataLayout &DL, |
| 422 | APInt &Offset) { |
| 423 | if (!getType()->isPointerTy()) |
| 424 | return this; |
| 425 | |
| 426 | assert(Offset.getBitWidth() == DL.getPointerSizeInBits(cast<PointerType>( |
| 427 | getType())->getAddressSpace()) && |
| 428 | "The offset must have exactly as many bits as our pointer."); |
| 429 | |
| 430 | // Even though we don't look through PHI nodes, we could be called on an |
| 431 | // instruction in an unreachable block, which may be on a cycle. |
| 432 | SmallPtrSet<Value *, 4> Visited; |
| 433 | Visited.insert(this); |
| 434 | Value *V = this; |
| 435 | do { |
| 436 | if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) { |
| 437 | if (!GEP->isInBounds()) |
| 438 | return V; |
Chandler Carruth | ba689b3 | 2013-08-25 10:46:39 +0000 | [diff] [blame] | 439 | APInt GEPOffset(Offset); |
| 440 | if (!GEP->accumulateConstantOffset(DL, GEPOffset)) |
Chandler Carruth | 989e630 | 2013-08-22 11:25:11 +0000 | [diff] [blame] | 441 | return V; |
Chandler Carruth | ba689b3 | 2013-08-25 10:46:39 +0000 | [diff] [blame] | 442 | Offset = GEPOffset; |
Chandler Carruth | 989e630 | 2013-08-22 11:25:11 +0000 | [diff] [blame] | 443 | V = GEP->getPointerOperand(); |
Hal Finkel | b8e7c73 | 2014-07-19 03:32:02 +0000 | [diff] [blame] | 444 | } else if (Operator::getOpcode(V) == Instruction::BitCast || |
| 445 | Operator::getOpcode(V) == Instruction::AddrSpaceCast) { |
Chandler Carruth | 989e630 | 2013-08-22 11:25:11 +0000 | [diff] [blame] | 446 | V = cast<Operator>(V)->getOperand(0); |
| 447 | } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) { |
| 448 | V = GA->getAliasee(); |
| 449 | } else { |
| 450 | return V; |
| 451 | } |
| 452 | assert(V->getType()->isPointerTy() && "Unexpected operand type!"); |
| 453 | } while (Visited.insert(V)); |
| 454 | |
| 455 | return V; |
| 456 | } |
| 457 | |
Chandler Carruth | 97f6f03 | 2012-03-10 08:39:09 +0000 | [diff] [blame] | 458 | Value *Value::stripInBoundsOffsets() { |
| 459 | return stripPointerCastsAndOffsets<PSK_InBounds>(this); |
| 460 | } |
Anton Korobeynikov | fc2edad | 2008-05-07 22:54:15 +0000 | [diff] [blame] | 461 | |
Duncan P. N. Exon Smith | fcece4d | 2014-10-15 20:28:31 +0000 | [diff] [blame^] | 462 | /// \brief Check if Value is always a dereferenceable pointer. |
| 463 | /// |
| 464 | /// Test if V is always a pointer to allocated and suitably aligned memory for |
| 465 | /// a simple load or store. |
Hal Finkel | 2e42c34 | 2014-07-10 05:27:53 +0000 | [diff] [blame] | 466 | static bool isDereferenceablePointer(const Value *V, const DataLayout *DL, |
Craig Topper | 71b7b68 | 2014-08-21 05:55:13 +0000 | [diff] [blame] | 467 | SmallPtrSetImpl<const Value *> &Visited) { |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 468 | // Note that it is not safe to speculate into a malloc'd region because |
| 469 | // malloc may return null. |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 470 | |
| 471 | // These are obviously ok. |
Nick Lewycky | c31ceda | 2012-01-23 00:05:17 +0000 | [diff] [blame] | 472 | if (isa<AllocaInst>(V)) return true; |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 473 | |
Hal Finkel | 2e42c34 | 2014-07-10 05:27:53 +0000 | [diff] [blame] | 474 | // It's not always safe to follow a bitcast, for example: |
| 475 | // bitcast i8* (alloca i8) to i32* |
| 476 | // would result in a 4-byte load from a 1-byte alloca. However, |
| 477 | // if we're casting from a pointer from a type of larger size |
| 478 | // to a type of smaller size (or the same size), and the alignment |
| 479 | // is at least as large as for the resulting pointer type, then |
| 480 | // we can look through the bitcast. |
| 481 | if (DL) |
| 482 | if (const BitCastInst* BC = dyn_cast<BitCastInst>(V)) { |
| 483 | Type *STy = BC->getSrcTy()->getPointerElementType(), |
| 484 | *DTy = BC->getDestTy()->getPointerElementType(); |
Hal Finkel | 66e23f1 | 2014-07-10 06:06:11 +0000 | [diff] [blame] | 485 | if (STy->isSized() && DTy->isSized() && |
| 486 | (DL->getTypeStoreSize(STy) >= |
Hal Finkel | 2e42c34 | 2014-07-10 05:27:53 +0000 | [diff] [blame] | 487 | DL->getTypeStoreSize(DTy)) && |
| 488 | (DL->getABITypeAlignment(STy) >= |
| 489 | DL->getABITypeAlignment(DTy))) |
| 490 | return isDereferenceablePointer(BC->getOperand(0), DL, Visited); |
| 491 | } |
| 492 | |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 493 | // Global variables which can't collapse to null are ok. |
Nick Lewycky | c31ceda | 2012-01-23 00:05:17 +0000 | [diff] [blame] | 494 | if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 495 | return !GV->hasExternalWeakLinkage(); |
| 496 | |
Hal Finkel | b0407ba | 2014-07-18 15:51:28 +0000 | [diff] [blame] | 497 | // byval arguments are okay. Arguments specifically marked as |
| 498 | // dereferenceable are okay too. |
| 499 | if (const Argument *A = dyn_cast<Argument>(V)) { |
| 500 | if (A->hasByValAttr()) |
| 501 | return true; |
| 502 | else if (uint64_t Bytes = A->getDereferenceableBytes()) { |
| 503 | Type *Ty = V->getType()->getPointerElementType(); |
| 504 | if (Ty->isSized() && DL && DL->getTypeStoreSize(Ty) <= Bytes) |
| 505 | return true; |
| 506 | } |
| 507 | |
| 508 | return false; |
| 509 | } |
| 510 | |
| 511 | // Return values from call sites specifically marked as dereferenceable are |
| 512 | // also okay. |
| 513 | if (ImmutableCallSite CS = V) { |
| 514 | if (uint64_t Bytes = CS.getDereferenceableBytes(0)) { |
| 515 | Type *Ty = V->getType()->getPointerElementType(); |
| 516 | if (Ty->isSized() && DL && DL->getTypeStoreSize(Ty) <= Bytes) |
| 517 | return true; |
| 518 | } |
| 519 | } |
Nick Lewycky | c31ceda | 2012-01-23 00:05:17 +0000 | [diff] [blame] | 520 | |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 521 | // For GEPs, determine if the indexing lands within the allocated object. |
Nick Lewycky | c31ceda | 2012-01-23 00:05:17 +0000 | [diff] [blame] | 522 | if (const GEPOperator *GEP = dyn_cast<GEPOperator>(V)) { |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 523 | // Conservatively require that the base pointer be fully dereferenceable. |
Nick Lewycky | c31ceda | 2012-01-23 00:05:17 +0000 | [diff] [blame] | 524 | if (!Visited.insert(GEP->getOperand(0))) |
| 525 | return false; |
Hal Finkel | 2e42c34 | 2014-07-10 05:27:53 +0000 | [diff] [blame] | 526 | if (!isDereferenceablePointer(GEP->getOperand(0), DL, Visited)) |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 527 | return false; |
| 528 | // Check the indices. |
| 529 | gep_type_iterator GTI = gep_type_begin(GEP); |
| 530 | for (User::const_op_iterator I = GEP->op_begin()+1, |
| 531 | E = GEP->op_end(); I != E; ++I) { |
| 532 | Value *Index = *I; |
Chris Lattner | 229907c | 2011-07-18 04:54:35 +0000 | [diff] [blame] | 533 | Type *Ty = *GTI++; |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 534 | // Struct indices can't be out of bounds. |
| 535 | if (isa<StructType>(Ty)) |
| 536 | continue; |
| 537 | ConstantInt *CI = dyn_cast<ConstantInt>(Index); |
| 538 | if (!CI) |
| 539 | return false; |
| 540 | // Zero is always ok. |
| 541 | if (CI->isZero()) |
| 542 | continue; |
| 543 | // Check to see that it's within the bounds of an array. |
Chris Lattner | 229907c | 2011-07-18 04:54:35 +0000 | [diff] [blame] | 544 | ArrayType *ATy = dyn_cast<ArrayType>(Ty); |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 545 | if (!ATy) |
| 546 | return false; |
| 547 | if (CI->getValue().getActiveBits() > 64) |
| 548 | return false; |
| 549 | if (CI->getZExtValue() >= ATy->getNumElements()) |
| 550 | return false; |
| 551 | } |
| 552 | // Indices check out; this is dereferenceable. |
| 553 | return true; |
| 554 | } |
| 555 | |
Matt Arsenault | 199b39e | 2014-07-14 18:54:12 +0000 | [diff] [blame] | 556 | if (const AddrSpaceCastInst *ASC = dyn_cast<AddrSpaceCastInst>(V)) |
| 557 | return isDereferenceablePointer(ASC->getOperand(0), DL, Visited); |
| 558 | |
Dan Gohman | a826a88 | 2010-11-11 21:23:25 +0000 | [diff] [blame] | 559 | // If we don't know, assume the worst. |
| 560 | return false; |
| 561 | } |
| 562 | |
Hal Finkel | 2e42c34 | 2014-07-10 05:27:53 +0000 | [diff] [blame] | 563 | bool Value::isDereferenceablePointer(const DataLayout *DL) const { |
Hal Finkel | 9e440c0 | 2014-07-19 03:25:16 +0000 | [diff] [blame] | 564 | // When dereferenceability information is provided by a dereferenceable |
| 565 | // attribute, we know exactly how many bytes are dereferenceable. If we can |
| 566 | // determine the exact offset to the attributed variable, we can use that |
| 567 | // information here. |
| 568 | Type *Ty = getType()->getPointerElementType(); |
| 569 | if (Ty->isSized() && DL) { |
| 570 | APInt Offset(DL->getTypeStoreSizeInBits(getType()), 0); |
| 571 | const Value *BV = stripAndAccumulateInBoundsConstantOffsets(*DL, Offset); |
| 572 | |
| 573 | APInt DerefBytes(Offset.getBitWidth(), 0); |
| 574 | if (const Argument *A = dyn_cast<Argument>(BV)) |
| 575 | DerefBytes = A->getDereferenceableBytes(); |
| 576 | else if (ImmutableCallSite CS = BV) |
| 577 | DerefBytes = CS.getDereferenceableBytes(0); |
| 578 | |
| 579 | if (DerefBytes.getBoolValue() && Offset.isNonNegative()) { |
| 580 | if (DerefBytes.uge(Offset + DL->getTypeStoreSize(Ty))) |
| 581 | return true; |
| 582 | } |
| 583 | } |
| 584 | |
Nick Lewycky | c31ceda | 2012-01-23 00:05:17 +0000 | [diff] [blame] | 585 | SmallPtrSet<const Value *, 32> Visited; |
Hal Finkel | 2e42c34 | 2014-07-10 05:27:53 +0000 | [diff] [blame] | 586 | return ::isDereferenceablePointer(this, DL, Visited); |
Nick Lewycky | c31ceda | 2012-01-23 00:05:17 +0000 | [diff] [blame] | 587 | } |
| 588 | |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 589 | Value *Value::DoPHITranslation(const BasicBlock *CurBB, |
Chris Lattner | 9c1b502 | 2008-12-02 07:16:45 +0000 | [diff] [blame] | 590 | const BasicBlock *PredBB) { |
| 591 | PHINode *PN = dyn_cast<PHINode>(this); |
| 592 | if (PN && PN->getParent() == CurBB) |
| 593 | return PN->getIncomingValueForBlock(PredBB); |
| 594 | return this; |
| 595 | } |
| 596 | |
Owen Anderson | 47db941 | 2009-07-22 00:24:57 +0000 | [diff] [blame] | 597 | LLVMContext &Value::getContext() const { return VTy->getContext(); } |
| 598 | |
Duncan P. N. Exon Smith | 3441ffe | 2014-08-01 23:28:49 +0000 | [diff] [blame] | 599 | void Value::reverseUseList() { |
| 600 | if (!UseList || !UseList->Next) |
| 601 | // No need to reverse 0 or 1 uses. |
| 602 | return; |
| 603 | |
| 604 | Use *Head = UseList; |
| 605 | Use *Current = UseList->Next; |
| 606 | Head->Next = nullptr; |
| 607 | while (Current) { |
| 608 | Use *Next = Current->Next; |
| 609 | Current->Next = Head; |
| 610 | Head->setPrev(&Current->Next); |
| 611 | Head = Current; |
| 612 | Current = Next; |
| 613 | } |
| 614 | UseList = Head; |
| 615 | Head->setPrev(&UseList); |
| 616 | } |
| 617 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 618 | //===----------------------------------------------------------------------===// |
| 619 | // ValueHandleBase Class |
| 620 | //===----------------------------------------------------------------------===// |
| 621 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 622 | void ValueHandleBase::AddToExistingUseList(ValueHandleBase **List) { |
| 623 | assert(List && "Handle list is null?"); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 624 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 625 | // Splice ourselves into the list. |
| 626 | Next = *List; |
| 627 | *List = this; |
| 628 | setPrevPtr(List); |
| 629 | if (Next) { |
| 630 | Next->setPrevPtr(&Next); |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 631 | assert(VP.getPointer() == Next->VP.getPointer() && "Added to wrong list?"); |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 632 | } |
| 633 | } |
| 634 | |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 635 | void ValueHandleBase::AddToExistingUseListAfter(ValueHandleBase *List) { |
| 636 | assert(List && "Must insert after existing node"); |
| 637 | |
| 638 | Next = List->Next; |
| 639 | setPrevPtr(&List->Next); |
| 640 | List->Next = this; |
| 641 | if (Next) |
| 642 | Next->setPrevPtr(&Next); |
| 643 | } |
| 644 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 645 | void ValueHandleBase::AddToUseList() { |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 646 | assert(VP.getPointer() && "Null pointer doesn't have a use list!"); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 647 | |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 648 | LLVMContextImpl *pImpl = VP.getPointer()->getContext().pImpl; |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 649 | |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 650 | if (VP.getPointer()->HasValueHandle) { |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 651 | // If this value already has a ValueHandle, then it must be in the |
| 652 | // ValueHandles map already. |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 653 | ValueHandleBase *&Entry = pImpl->ValueHandles[VP.getPointer()]; |
Craig Topper | 2617dcc | 2014-04-15 06:32:26 +0000 | [diff] [blame] | 654 | assert(Entry && "Value doesn't have any handles?"); |
Owen Anderson | 4b660a8 | 2009-06-17 17:36:57 +0000 | [diff] [blame] | 655 | AddToExistingUseList(&Entry); |
Owen Anderson | 4b660a8 | 2009-06-17 17:36:57 +0000 | [diff] [blame] | 656 | return; |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 657 | } |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 658 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 659 | // Ok, it doesn't have any handles yet, so we must insert it into the |
| 660 | // DenseMap. However, doing this insertion could cause the DenseMap to |
| 661 | // reallocate itself, which would invalidate all of the PrevP pointers that |
| 662 | // point into the old table. Handle this by checking for reallocation and |
| 663 | // updating the stale pointers only if needed. |
Owen Anderson | e8f2185 | 2009-08-18 18:28:58 +0000 | [diff] [blame] | 664 | DenseMap<Value*, ValueHandleBase*> &Handles = pImpl->ValueHandles; |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 665 | const void *OldBucketPtr = Handles.getPointerIntoBucketsArray(); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 666 | |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 667 | ValueHandleBase *&Entry = Handles[VP.getPointer()]; |
Craig Topper | 2617dcc | 2014-04-15 06:32:26 +0000 | [diff] [blame] | 668 | assert(!Entry && "Value really did already have handles?"); |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 669 | AddToExistingUseList(&Entry); |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 670 | VP.getPointer()->HasValueHandle = true; |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 671 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 672 | // If reallocation didn't happen or if this was the first insertion, don't |
| 673 | // walk the table. |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 674 | if (Handles.isPointerIntoBucketsArray(OldBucketPtr) || |
Owen Anderson | 4b660a8 | 2009-06-17 17:36:57 +0000 | [diff] [blame] | 675 | Handles.size() == 1) { |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 676 | return; |
Owen Anderson | 4b660a8 | 2009-06-17 17:36:57 +0000 | [diff] [blame] | 677 | } |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 678 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 679 | // Okay, reallocation did happen. Fix the Prev Pointers. |
Owen Anderson | e8f2185 | 2009-08-18 18:28:58 +0000 | [diff] [blame] | 680 | for (DenseMap<Value*, ValueHandleBase*>::iterator I = Handles.begin(), |
| 681 | E = Handles.end(); I != E; ++I) { |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 682 | assert(I->second && I->first == I->second->VP.getPointer() && |
| 683 | "List invariant broken!"); |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 684 | I->second->setPrevPtr(&I->second); |
| 685 | } |
| 686 | } |
| 687 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 688 | void ValueHandleBase::RemoveFromUseList() { |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 689 | assert(VP.getPointer() && VP.getPointer()->HasValueHandle && |
| 690 | "Pointer doesn't have a use list!"); |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 691 | |
| 692 | // Unlink this from its use list. |
| 693 | ValueHandleBase **PrevPtr = getPrevPtr(); |
| 694 | assert(*PrevPtr == this && "List invariant broken"); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 695 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 696 | *PrevPtr = Next; |
| 697 | if (Next) { |
| 698 | assert(Next->getPrevPtr() == &Next && "List invariant broken"); |
| 699 | Next->setPrevPtr(PrevPtr); |
| 700 | return; |
| 701 | } |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 702 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 703 | // If the Next pointer was null, then it is possible that this was the last |
| 704 | // ValueHandle watching VP. If so, delete its entry from the ValueHandles |
| 705 | // map. |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 706 | LLVMContextImpl *pImpl = VP.getPointer()->getContext().pImpl; |
Owen Anderson | e8f2185 | 2009-08-18 18:28:58 +0000 | [diff] [blame] | 707 | DenseMap<Value*, ValueHandleBase*> &Handles = pImpl->ValueHandles; |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 708 | if (Handles.isPointerIntoBucketsArray(PrevPtr)) { |
Bill Wendling | 9b2503a | 2012-04-08 10:16:43 +0000 | [diff] [blame] | 709 | Handles.erase(VP.getPointer()); |
| 710 | VP.getPointer()->HasValueHandle = false; |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 711 | } |
| 712 | } |
| 713 | |
| 714 | |
| 715 | void ValueHandleBase::ValueIsDeleted(Value *V) { |
| 716 | assert(V->HasValueHandle && "Should only be called if ValueHandles present"); |
| 717 | |
| 718 | // Get the linked list base, which is guaranteed to exist since the |
| 719 | // HasValueHandle flag is set. |
Owen Anderson | e8f2185 | 2009-08-18 18:28:58 +0000 | [diff] [blame] | 720 | LLVMContextImpl *pImpl = V->getContext().pImpl; |
| 721 | ValueHandleBase *Entry = pImpl->ValueHandles[V]; |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 722 | assert(Entry && "Value bit set but no entries exist"); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 723 | |
Duncan Sands | 3bc93c2 | 2010-07-24 12:09:22 +0000 | [diff] [blame] | 724 | // We use a local ValueHandleBase as an iterator so that ValueHandles can add |
| 725 | // and remove themselves from the list without breaking our iteration. This |
| 726 | // is not really an AssertingVH; we just have to give ValueHandleBase a kind. |
| 727 | // Note that we deliberately do not the support the case when dropping a value |
| 728 | // handle results in a new value handle being permanently added to the list |
| 729 | // (as might occur in theory for CallbackVH's): the new value handle will not |
Duncan Sands | fd5c832 | 2010-07-27 06:53:14 +0000 | [diff] [blame] | 730 | // be processed and the checking code will mete out righteous punishment if |
Duncan Sands | 3bc93c2 | 2010-07-24 12:09:22 +0000 | [diff] [blame] | 731 | // the handle is still present once we have finished processing all the other |
| 732 | // value handles (it is fine to momentarily add then remove a value handle). |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 733 | for (ValueHandleBase Iterator(Assert, *Entry); Entry; Entry = Iterator.Next) { |
| 734 | Iterator.RemoveFromUseList(); |
| 735 | Iterator.AddToExistingUseListAfter(Entry); |
| 736 | assert(Entry->Next == &Iterator && "Loop invariant broken."); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 737 | |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 738 | switch (Entry->getKind()) { |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 739 | case Assert: |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 740 | break; |
Daniel Dunbar | 70d4fb0 | 2009-09-22 02:02:33 +0000 | [diff] [blame] | 741 | case Tracking: |
| 742 | // Mark that this value has been deleted by setting it to an invalid Value |
| 743 | // pointer. |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 744 | Entry->operator=(DenseMapInfo<Value *>::getTombstoneKey()); |
Daniel Dunbar | 70d4fb0 | 2009-09-22 02:02:33 +0000 | [diff] [blame] | 745 | break; |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 746 | case Weak: |
| 747 | // Weak just goes to null, which will unlink it from the list. |
Craig Topper | c620761 | 2014-04-09 06:08:46 +0000 | [diff] [blame] | 748 | Entry->operator=(nullptr); |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 749 | break; |
| 750 | case Callback: |
Dan Gohman | 745ad44 | 2009-05-02 21:10:48 +0000 | [diff] [blame] | 751 | // Forward to the subclass's implementation. |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 752 | static_cast<CallbackVH*>(Entry)->deleted(); |
Dan Gohman | 745ad44 | 2009-05-02 21:10:48 +0000 | [diff] [blame] | 753 | break; |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 754 | } |
| 755 | } |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 756 | |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 757 | // All callbacks, weak references, and assertingVHs should be dropped by now. |
| 758 | if (V->HasValueHandle) { |
| 759 | #ifndef NDEBUG // Only in +Asserts mode... |
Benjamin Kramer | 1f97a5a | 2011-11-15 16:27:03 +0000 | [diff] [blame] | 760 | dbgs() << "While deleting: " << *V->getType() << " %" << V->getName() |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 761 | << "\n"; |
| 762 | if (pImpl->ValueHandles[V]->getKind() == Assert) |
| 763 | llvm_unreachable("An asserting value handle still pointed to this" |
| 764 | " value!"); |
| 765 | |
| 766 | #endif |
| 767 | llvm_unreachable("All references to V were not removed?"); |
| 768 | } |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 769 | } |
| 770 | |
| 771 | |
| 772 | void ValueHandleBase::ValueIsRAUWd(Value *Old, Value *New) { |
| 773 | assert(Old->HasValueHandle &&"Should only be called if ValueHandles present"); |
| 774 | assert(Old != New && "Changing value into itself!"); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 775 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 776 | // Get the linked list base, which is guaranteed to exist since the |
| 777 | // HasValueHandle flag is set. |
Owen Anderson | e8f2185 | 2009-08-18 18:28:58 +0000 | [diff] [blame] | 778 | LLVMContextImpl *pImpl = Old->getContext().pImpl; |
| 779 | ValueHandleBase *Entry = pImpl->ValueHandles[Old]; |
| 780 | |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 781 | assert(Entry && "Value bit set but no entries exist"); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 782 | |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 783 | // We use a local ValueHandleBase as an iterator so that |
| 784 | // ValueHandles can add and remove themselves from the list without |
| 785 | // breaking our iteration. This is not really an AssertingVH; we |
| 786 | // just have to give ValueHandleBase some kind. |
| 787 | for (ValueHandleBase Iterator(Assert, *Entry); Entry; Entry = Iterator.Next) { |
| 788 | Iterator.RemoveFromUseList(); |
| 789 | Iterator.AddToExistingUseListAfter(Entry); |
| 790 | assert(Entry->Next == &Iterator && "Loop invariant broken."); |
Daniel Dunbar | 6058b51 | 2009-09-20 04:03:34 +0000 | [diff] [blame] | 791 | |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 792 | switch (Entry->getKind()) { |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 793 | case Assert: |
| 794 | // Asserting handle does not follow RAUW implicitly. |
| 795 | break; |
Daniel Dunbar | 70d4fb0 | 2009-09-22 02:02:33 +0000 | [diff] [blame] | 796 | case Tracking: |
| 797 | // Tracking goes to new value like a WeakVH. Note that this may make it |
| 798 | // something incompatible with its templated type. We don't want to have a |
| 799 | // virtual (or inline) interface to handle this though, so instead we make |
Daniel Dunbar | 86707c9 | 2009-09-22 10:30:34 +0000 | [diff] [blame] | 800 | // the TrackingVH accessors guarantee that a client never sees this value. |
Daniel Dunbar | 70d4fb0 | 2009-09-22 02:02:33 +0000 | [diff] [blame] | 801 | |
| 802 | // FALLTHROUGH |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 803 | case Weak: |
| 804 | // Weak goes to the new value, which will unlink it from Old's list. |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 805 | Entry->operator=(New); |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 806 | break; |
| 807 | case Callback: |
Dan Gohman | 745ad44 | 2009-05-02 21:10:48 +0000 | [diff] [blame] | 808 | // Forward to the subclass's implementation. |
Jeffrey Yasskin | 406ac81 | 2009-10-12 17:43:32 +0000 | [diff] [blame] | 809 | static_cast<CallbackVH*>(Entry)->allUsesReplacedWith(New); |
Dan Gohman | 745ad44 | 2009-05-02 21:10:48 +0000 | [diff] [blame] | 810 | break; |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 811 | } |
| 812 | } |
Duncan Sands | fd5c832 | 2010-07-27 06:53:14 +0000 | [diff] [blame] | 813 | |
| 814 | #ifndef NDEBUG |
| 815 | // If any new tracking or weak value handles were added while processing the |
| 816 | // list, then complain about it now. |
| 817 | if (Old->HasValueHandle) |
| 818 | for (Entry = pImpl->ValueHandles[Old]; Entry; Entry = Entry->Next) |
| 819 | switch (Entry->getKind()) { |
| 820 | case Tracking: |
| 821 | case Weak: |
| 822 | dbgs() << "After RAUW from " << *Old->getType() << " %" |
Benjamin Kramer | 1f97a5a | 2011-11-15 16:27:03 +0000 | [diff] [blame] | 823 | << Old->getName() << " to " << *New->getType() << " %" |
| 824 | << New->getName() << "\n"; |
Duncan Sands | fd5c832 | 2010-07-27 06:53:14 +0000 | [diff] [blame] | 825 | llvm_unreachable("A tracking or weak value handle still pointed to the" |
| 826 | " old value!\n"); |
| 827 | default: |
| 828 | break; |
| 829 | } |
| 830 | #endif |
Chris Lattner | 90234f3 | 2009-03-31 22:11:05 +0000 | [diff] [blame] | 831 | } |
| 832 | |
Juergen Ributzka | d12ccbd | 2013-11-19 00:57:56 +0000 | [diff] [blame] | 833 | // Pin the vtable to this file. |
| 834 | void CallbackVH::anchor() {} |