1 //===-- Value.cpp - Implement the Value class -----------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the Value, ValueHandle, and User classes.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Constant.h"
15 #include "llvm/Constants.h"
16 #include "llvm/DerivedTypes.h"
17 #include "llvm/InstrTypes.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/Operator.h"
20 #include "llvm/Module.h"
21 #include "llvm/MDNode.h"
22 #include "llvm/ValueSymbolTable.h"
23 #include "llvm/ADT/SmallString.h"
24 #include "llvm/Support/Debug.h"
25 #include "llvm/Support/ErrorHandling.h"
26 #include "llvm/Support/LeakDetector.h"
27 #include "llvm/Support/ManagedStatic.h"
28 #include "llvm/Support/ValueHandle.h"
29 #include "llvm/Support/raw_ostream.h"
30 #include "llvm/System/RWMutex.h"
31 #include "llvm/System/Threading.h"
32 #include "llvm/ADT/DenseMap.h"
36 //===----------------------------------------------------------------------===//
38 //===----------------------------------------------------------------------===//
40 static inline const Type *checkType(const Type *Ty) {
41 assert(Ty && "Value defined with a null type: Error!");
45 Value::Value(const Type *ty, unsigned scid)
46 : SubclassID(scid), HasValueHandle(0), SubclassOptionalData(0),
47 SubclassData(0), VTy(checkType(ty)),
49 if (isa<CallInst>(this) || isa<InvokeInst>(this))
50 assert((VTy->isFirstClassType() || VTy == Type::VoidTy ||
51 isa<OpaqueType>(ty) || VTy->getTypeID() == Type::StructTyID) &&
52 "invalid CallInst type!");
53 else if (!isa<Constant>(this) && !isa<BasicBlock>(this))
54 assert((VTy->isFirstClassType() || VTy == Type::VoidTy ||
55 isa<OpaqueType>(ty)) &&
56 "Cannot create non-first-class values except for constants!");
60 // Notify all ValueHandles (if present) that this value is going away.
62 ValueHandleBase::ValueIsDeleted(this);
64 #ifndef NDEBUG // Only in -g mode...
65 // Check to make sure that there are no uses of this value that are still
66 // around when the value is destroyed. If there are, then we have a dangling
67 // reference and something is wrong. This code is here to print out what is
68 // still being referenced. The value in question should be printed as
72 errs() << "While deleting: " << *VTy << " %" << getNameStr() << "\n";
73 for (use_iterator I = use_begin(), E = use_end(); I != E; ++I)
74 errs() << "Use still stuck around after Def is destroyed:"
78 assert(use_empty() && "Uses remain when a value is destroyed!");
80 // If this value is named, destroy the name. This should not be in a symtab
85 // There should be no uses of this object anymore, remove it.
86 LeakDetector::removeGarbageObject(this);
89 /// hasNUses - Return true if this Value has exactly N users.
91 bool Value::hasNUses(unsigned N) const {
92 use_const_iterator UI = use_begin(), E = use_end();
95 if (UI == E) return false; // Too few.
99 /// hasNUsesOrMore - Return true if this value has N users or more. This is
100 /// logically equivalent to getNumUses() >= N.
102 bool Value::hasNUsesOrMore(unsigned N) const {
103 use_const_iterator UI = use_begin(), E = use_end();
106 if (UI == E) return false; // Too few.
111 /// isUsedInBasicBlock - Return true if this value is used in the specified
113 bool Value::isUsedInBasicBlock(const BasicBlock *BB) const {
114 for (use_const_iterator I = use_begin(), E = use_end(); I != E; ++I) {
115 const Instruction *User = dyn_cast<Instruction>(*I);
116 if (User && User->getParent() == BB)
123 /// getNumUses - This method computes the number of uses of this Value. This
124 /// is a linear time operation. Use hasOneUse or hasNUses to check for specific
126 unsigned Value::getNumUses() const {
127 return (unsigned)std::distance(use_begin(), use_end());
130 static bool getSymTab(Value *V, ValueSymbolTable *&ST) {
132 if (Instruction *I = dyn_cast<Instruction>(V)) {
133 if (BasicBlock *P = I->getParent())
134 if (Function *PP = P->getParent())
135 ST = &PP->getValueSymbolTable();
136 } else if (BasicBlock *BB = dyn_cast<BasicBlock>(V)) {
137 if (Function *P = BB->getParent())
138 ST = &P->getValueSymbolTable();
139 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
140 if (Module *P = GV->getParent())
141 ST = &P->getValueSymbolTable();
142 } else if (Argument *A = dyn_cast<Argument>(V)) {
143 if (Function *P = A->getParent())
144 ST = &P->getValueSymbolTable();
145 } else if (isa<MDString>(V))
148 assert(isa<Constant>(V) && "Unknown value type!");
149 return true; // no name is setable for this.
154 /// getNameStart - Return a pointer to a null terminated string for this name.
155 /// Note that names can have null characters within the string as well as at
156 /// their end. This always returns a non-null pointer.
157 const char *Value::getNameStart() const {
158 if (Name == 0) return "";
159 return Name->getKeyData();
162 /// getNameLen - Return the length of the string, correctly handling nul
163 /// characters embedded into them.
164 unsigned Value::getNameLen() const {
165 return Name ? Name->getKeyLength() : 0;
169 std::string Value::getNameStr() const {
170 if (Name == 0) return "";
171 return std::string(Name->getKeyData(),
172 Name->getKeyData()+Name->getKeyLength());
175 void Value::setName(const Twine &Name) {
176 SmallString<32> NameData;
177 Name.toVector(NameData);
178 setName(NameData.begin(), NameData.size());
181 void Value::setName(const char *Name) {
182 setName(Name, Name ? strlen(Name) : 0);
185 void Value::setName(const char *NameStr, unsigned NameLen) {
186 if (NameLen == 0 && !hasName()) return;
187 assert(getType() != Type::VoidTy && "Cannot assign a name to void values!");
189 // Get the symbol table to update for this object.
190 ValueSymbolTable *ST;
191 if (getSymTab(this, ST))
192 return; // Cannot set a name on this value (e.g. constant).
194 if (!ST) { // No symbol table to update? Just do the change.
196 // Free the name for this value.
203 // Name isn't changing?
204 if (NameLen == Name->getKeyLength() &&
205 !memcmp(Name->getKeyData(), NameStr, NameLen))
210 // NOTE: Could optimize for the case the name is shrinking to not deallocate
213 // Create the new name.
214 Name = ValueName::Create(NameStr, NameStr+NameLen);
215 Name->setValue(this);
219 // NOTE: Could optimize for the case the name is shrinking to not deallocate
222 // Name isn't changing?
223 if (NameLen == Name->getKeyLength() &&
224 !memcmp(Name->getKeyData(), NameStr, NameLen))
228 ST->removeValueName(Name);
236 // Name is changing to something new.
237 Name = ST->createValueName(StringRef(NameStr, NameLen), this);
241 /// takeName - transfer the name from V to this value, setting V's name to
242 /// empty. It is an error to call V->takeName(V).
243 void Value::takeName(Value *V) {
244 ValueSymbolTable *ST = 0;
245 // If this value has a name, drop it.
247 // Get the symtab this is in.
248 if (getSymTab(this, ST)) {
249 // We can't set a name on this value, but we need to clear V's name if
251 if (V->hasName()) V->setName(0, 0);
252 return; // Cannot set a name on this value (e.g. constant).
257 ST->removeValueName(Name);
262 // Now we know that this has no name.
264 // If V has no name either, we're done.
265 if (!V->hasName()) return;
267 // Get this's symtab if we didn't before.
269 if (getSymTab(this, ST)) {
272 return; // Cannot set a name on this value (e.g. constant).
276 // Get V's ST, this should always succed, because V has a name.
277 ValueSymbolTable *VST;
278 bool Failure = getSymTab(V, VST);
279 assert(!Failure && "V has a name, so it should have a ST!"); Failure=Failure;
281 // If these values are both in the same symtab, we can do this very fast.
282 // This works even if both values have no symtab yet.
287 Name->setValue(this);
291 // Otherwise, things are slightly more complex. Remove V's name from VST and
292 // then reinsert it into ST.
295 VST->removeValueName(V->Name);
298 Name->setValue(this);
301 ST->reinsertValue(this);
305 // uncheckedReplaceAllUsesWith - This is exactly the same as replaceAllUsesWith,
306 // except that it doesn't have all of the asserts. The asserts fail because we
307 // are half-way done resolving types, which causes some types to exist as two
308 // different Type*'s at the same time. This is a sledgehammer to work around
311 void Value::uncheckedReplaceAllUsesWith(Value *New) {
312 // Notify all ValueHandles (if present) that this value is going away.
314 ValueHandleBase::ValueIsRAUWd(this, New);
316 while (!use_empty()) {
318 // Must handle Constants specially, we cannot call replaceUsesOfWith on a
319 // constant because they are uniqued.
320 if (Constant *C = dyn_cast<Constant>(U.getUser())) {
321 if (!isa<GlobalValue>(C)) {
322 C->replaceUsesOfWithOnConstant(this, New, &U);
331 void Value::replaceAllUsesWith(Value *New) {
332 assert(New && "Value::replaceAllUsesWith(<null>) is invalid!");
333 assert(New != this && "this->replaceAllUsesWith(this) is NOT valid!");
334 assert(New->getType() == getType() &&
335 "replaceAllUses of value with new value of different type!");
337 uncheckedReplaceAllUsesWith(New);
340 Value *Value::stripPointerCasts() {
341 if (!isa<PointerType>(getType()))
345 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
346 if (!GEP->hasAllZeroIndices())
348 V = GEP->getPointerOperand();
349 } else if (Operator::getOpcode(V) == Instruction::BitCast) {
350 V = cast<Operator>(V)->getOperand(0);
354 assert(isa<PointerType>(V->getType()) && "Unexpected operand type!");
358 Value *Value::getUnderlyingObject() {
359 if (!isa<PointerType>(getType()))
362 unsigned MaxLookup = 6;
364 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
365 V = GEP->getPointerOperand();
366 } else if (Operator::getOpcode(V) == Instruction::BitCast) {
367 V = cast<Operator>(V)->getOperand(0);
371 assert(isa<PointerType>(V->getType()) && "Unexpected operand type!");
372 } while (--MaxLookup);
376 /// DoPHITranslation - If this value is a PHI node with CurBB as its parent,
377 /// return the value in the PHI node corresponding to PredBB. If not, return
378 /// ourself. This is useful if you want to know the value something has in a
379 /// predecessor block.
380 Value *Value::DoPHITranslation(const BasicBlock *CurBB,
381 const BasicBlock *PredBB) {
382 PHINode *PN = dyn_cast<PHINode>(this);
383 if (PN && PN->getParent() == CurBB)
384 return PN->getIncomingValueForBlock(PredBB);
388 LLVMContext &Value::getContext() const { return VTy->getContext(); }
390 //===----------------------------------------------------------------------===//
391 // ValueHandleBase Class
392 //===----------------------------------------------------------------------===//
394 /// ValueHandles - This map keeps track of all of the value handles that are
395 /// watching a Value*. The Value::HasValueHandle bit is used to know whether or
396 /// not a value has an entry in this map.
397 typedef DenseMap<Value*, ValueHandleBase*> ValueHandlesTy;
398 static ManagedStatic<ValueHandlesTy> ValueHandles;
399 static ManagedStatic<sys::SmartRWMutex<true> > ValueHandlesLock;
401 /// AddToExistingUseList - Add this ValueHandle to the use list for VP, where
402 /// List is known to point into the existing use list.
403 void ValueHandleBase::AddToExistingUseList(ValueHandleBase **List) {
404 assert(List && "Handle list is null?");
406 // Splice ourselves into the list.
411 Next->setPrevPtr(&Next);
412 assert(VP == Next->VP && "Added to wrong list?");
416 /// AddToUseList - Add this ValueHandle to the use list for VP.
417 void ValueHandleBase::AddToUseList() {
418 assert(VP && "Null pointer doesn't have a use list!");
419 if (VP->HasValueHandle) {
420 // If this value already has a ValueHandle, then it must be in the
421 // ValueHandles map already.
422 sys::SmartScopedReader<true> Reader(*ValueHandlesLock);
423 ValueHandleBase *&Entry = (*ValueHandles)[VP];
424 assert(Entry != 0 && "Value doesn't have any handles?");
425 AddToExistingUseList(&Entry);
429 // Ok, it doesn't have any handles yet, so we must insert it into the
430 // DenseMap. However, doing this insertion could cause the DenseMap to
431 // reallocate itself, which would invalidate all of the PrevP pointers that
432 // point into the old table. Handle this by checking for reallocation and
433 // updating the stale pointers only if needed.
434 sys::SmartScopedWriter<true> Writer(*ValueHandlesLock);
435 ValueHandlesTy &Handles = *ValueHandles;
436 const void *OldBucketPtr = Handles.getPointerIntoBucketsArray();
438 ValueHandleBase *&Entry = Handles[VP];
439 assert(Entry == 0 && "Value really did already have handles?");
440 AddToExistingUseList(&Entry);
441 VP->HasValueHandle = true;
443 // If reallocation didn't happen or if this was the first insertion, don't
445 if (Handles.isPointerIntoBucketsArray(OldBucketPtr) ||
446 Handles.size() == 1) {
450 // Okay, reallocation did happen. Fix the Prev Pointers.
451 for (ValueHandlesTy::iterator I = Handles.begin(), E = Handles.end();
453 assert(I->second && I->first == I->second->VP && "List invariant broken!");
454 I->second->setPrevPtr(&I->second);
458 /// RemoveFromUseList - Remove this ValueHandle from its current use list.
459 void ValueHandleBase::RemoveFromUseList() {
460 assert(VP && VP->HasValueHandle && "Pointer doesn't have a use list!");
462 // Unlink this from its use list.
463 ValueHandleBase **PrevPtr = getPrevPtr();
464 assert(*PrevPtr == this && "List invariant broken");
468 assert(Next->getPrevPtr() == &Next && "List invariant broken");
469 Next->setPrevPtr(PrevPtr);
473 // If the Next pointer was null, then it is possible that this was the last
474 // ValueHandle watching VP. If so, delete its entry from the ValueHandles
476 sys::SmartScopedWriter<true> Writer(*ValueHandlesLock);
477 ValueHandlesTy &Handles = *ValueHandles;
478 if (Handles.isPointerIntoBucketsArray(PrevPtr)) {
480 VP->HasValueHandle = false;
485 void ValueHandleBase::ValueIsDeleted(Value *V) {
486 assert(V->HasValueHandle && "Should only be called if ValueHandles present");
488 // Get the linked list base, which is guaranteed to exist since the
489 // HasValueHandle flag is set.
490 ValueHandlesLock->reader_acquire();
491 ValueHandleBase *Entry = (*ValueHandles)[V];
492 ValueHandlesLock->reader_release();
493 assert(Entry && "Value bit set but no entries exist");
496 // Advance pointer to avoid invalidation.
497 ValueHandleBase *ThisNode = Entry;
500 switch (ThisNode->getKind()) {
502 #ifndef NDEBUG // Only in -g mode...
503 errs() << "While deleting: " << *V->getType() << " %" << V->getNameStr()
506 llvm_unreachable("An asserting value handle still pointed to this"
509 // Weak just goes to null, which will unlink it from the list.
510 ThisNode->operator=(0);
513 // Forward to the subclass's implementation.
514 static_cast<CallbackVH*>(ThisNode)->deleted();
519 // All callbacks and weak references should be dropped by now.
520 assert(!V->HasValueHandle && "All references to V were not removed?");
524 void ValueHandleBase::ValueIsRAUWd(Value *Old, Value *New) {
525 assert(Old->HasValueHandle &&"Should only be called if ValueHandles present");
526 assert(Old != New && "Changing value into itself!");
528 // Get the linked list base, which is guaranteed to exist since the
529 // HasValueHandle flag is set.
530 ValueHandlesLock->reader_acquire();
531 ValueHandleBase *Entry = (*ValueHandles)[Old];
532 ValueHandlesLock->reader_release();
533 assert(Entry && "Value bit set but no entries exist");
536 // Advance pointer to avoid invalidation.
537 ValueHandleBase *ThisNode = Entry;
540 switch (ThisNode->getKind()) {
542 // Asserting handle does not follow RAUW implicitly.
545 // Weak goes to the new value, which will unlink it from Old's list.
546 ThisNode->operator=(New);
549 // Forward to the subclass's implementation.
550 static_cast<CallbackVH*>(ThisNode)->allUsesReplacedWith(New);
556 /// ~CallbackVH. Empty, but defined here to avoid emitting the vtable
558 CallbackVH::~CallbackVH() {}
561 //===----------------------------------------------------------------------===//
563 //===----------------------------------------------------------------------===//
565 // replaceUsesOfWith - Replaces all references to the "From" definition with
566 // references to the "To" definition.
568 void User::replaceUsesOfWith(Value *From, Value *To) {
569 if (From == To) return; // Duh what?
571 assert((!isa<Constant>(this) || isa<GlobalValue>(this)) &&
572 "Cannot call User::replaceUsesofWith on a constant!");
574 for (unsigned i = 0, E = getNumOperands(); i != E; ++i)
575 if (getOperand(i) == From) { // Is This operand is pointing to oldval?
576 // The side effects of this setOperand call include linking to
577 // "To", adding "this" to the uses list of To, and
578 // most importantly, removing "this" from the use list of "From".
579 setOperand(i, To); // Fix it now...