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 "LLVMContextImpl.h"
15 #include "llvm/Constant.h"
16 #include "llvm/Constants.h"
17 #include "llvm/DerivedTypes.h"
18 #include "llvm/InstrTypes.h"
19 #include "llvm/Instructions.h"
20 #include "llvm/Operator.h"
21 #include "llvm/Module.h"
22 #include "llvm/ValueSymbolTable.h"
23 #include "llvm/ADT/SmallString.h"
24 #include "llvm/Support/Debug.h"
25 #include "llvm/Support/GetElementPtrTypeIterator.h"
26 #include "llvm/Support/ErrorHandling.h"
27 #include "llvm/Support/LeakDetector.h"
28 #include "llvm/Support/ManagedStatic.h"
29 #include "llvm/Support/ValueHandle.h"
30 #include "llvm/ADT/DenseMap.h"
34 //===----------------------------------------------------------------------===//
36 //===----------------------------------------------------------------------===//
38 static inline Type *checkType(Type *Ty) {
39 assert(Ty && "Value defined with a null type: Error!");
40 return const_cast<Type*>(Ty);
43 Value::Value(Type *ty, unsigned scid)
44 : SubclassID(scid), HasValueHandle(0),
45 SubclassOptionalData(0), SubclassData(0), VTy((Type*)checkType(ty)),
47 // FIXME: Why isn't this in the subclass gunk??
48 if (isa<CallInst>(this) || isa<InvokeInst>(this))
49 assert((VTy->isFirstClassType() || VTy->isVoidTy() || VTy->isStructTy()) &&
50 "invalid CallInst type!");
51 else if (!isa<Constant>(this) && !isa<BasicBlock>(this))
52 assert((VTy->isFirstClassType() || VTy->isVoidTy()) &&
53 "Cannot create non-first-class values except for constants!");
57 // Notify all ValueHandles (if present) that this value is going away.
59 ValueHandleBase::ValueIsDeleted(this);
61 #ifndef NDEBUG // Only in -g mode...
62 // Check to make sure that there are no uses of this value that are still
63 // around when the value is destroyed. If there are, then we have a dangling
64 // reference and something is wrong. This code is here to print out what is
65 // still being referenced. The value in question should be printed as
69 dbgs() << "While deleting: " << *VTy << " %" << getName() << "\n";
70 for (use_iterator I = use_begin(), E = use_end(); I != E; ++I)
71 dbgs() << "Use still stuck around after Def is destroyed:"
75 assert(use_empty() && "Uses remain when a value is destroyed!");
77 // If this value is named, destroy the name. This should not be in a symtab
82 // There should be no uses of this object anymore, remove it.
83 LeakDetector::removeGarbageObject(this);
86 /// hasNUses - Return true if this Value has exactly N users.
88 bool Value::hasNUses(unsigned N) const {
89 const_use_iterator UI = use_begin(), E = use_end();
92 if (UI == E) return false; // Too few.
96 /// hasNUsesOrMore - Return true if this value has N users or more. This is
97 /// logically equivalent to getNumUses() >= N.
99 bool Value::hasNUsesOrMore(unsigned N) const {
100 const_use_iterator UI = use_begin(), E = use_end();
103 if (UI == E) return false; // Too few.
108 /// isUsedInBasicBlock - Return true if this value is used in the specified
110 bool Value::isUsedInBasicBlock(const BasicBlock *BB) const {
111 // Start by scanning over the instructions looking for a use before we start
112 // the expensive use iteration.
113 unsigned MaxBlockSize = 3;
114 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
115 if (std::find(I->op_begin(), I->op_end(), this) != I->op_end())
117 if (MaxBlockSize-- == 0) // If the block is larger fall back to use_iterator
121 if (MaxBlockSize != 0) // We scanned the entire block and found no use.
124 for (const_use_iterator I = use_begin(), E = use_end(); I != E; ++I) {
125 const Instruction *User = dyn_cast<Instruction>(*I);
126 if (User && User->getParent() == BB)
133 /// getNumUses - This method computes the number of uses of this Value. This
134 /// is a linear time operation. Use hasOneUse or hasNUses to check for specific
136 unsigned Value::getNumUses() const {
137 return (unsigned)std::distance(use_begin(), use_end());
140 static bool getSymTab(Value *V, ValueSymbolTable *&ST) {
142 if (Instruction *I = dyn_cast<Instruction>(V)) {
143 if (BasicBlock *P = I->getParent())
144 if (Function *PP = P->getParent())
145 ST = &PP->getValueSymbolTable();
146 } else if (BasicBlock *BB = dyn_cast<BasicBlock>(V)) {
147 if (Function *P = BB->getParent())
148 ST = &P->getValueSymbolTable();
149 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
150 if (Module *P = GV->getParent())
151 ST = &P->getValueSymbolTable();
152 } else if (Argument *A = dyn_cast<Argument>(V)) {
153 if (Function *P = A->getParent())
154 ST = &P->getValueSymbolTable();
155 } else if (isa<MDString>(V))
158 assert(isa<Constant>(V) && "Unknown value type!");
159 return true; // no name is setable for this.
164 StringRef Value::getName() const {
165 // Make sure the empty string is still a C string. For historical reasons,
166 // some clients want to call .data() on the result and expect it to be null
168 if (!Name) return StringRef("", 0);
169 return Name->getKey();
172 void Value::setName(const Twine &NewName) {
173 // Fast path for common IRBuilder case of setName("") when there is no name.
174 if (NewName.isTriviallyEmpty() && !hasName())
177 SmallString<256> NameData;
178 StringRef NameRef = NewName.toStringRef(NameData);
180 // Name isn't changing?
181 if (getName() == NameRef)
184 assert(!getType()->isVoidTy() && "Cannot assign a name to void values!");
186 // Get the symbol table to update for this object.
187 ValueSymbolTable *ST;
188 if (getSymTab(this, ST))
189 return; // Cannot set a name on this value (e.g. constant).
191 if (!ST) { // No symbol table to update? Just do the change.
192 if (NameRef.empty()) {
193 // Free the name for this value.
202 // NOTE: Could optimize for the case the name is shrinking to not deallocate
205 // Create the new name.
206 Name = ValueName::Create(NameRef.begin(), NameRef.end());
207 Name->setValue(this);
211 // NOTE: Could optimize for the case the name is shrinking to not deallocate
215 ST->removeValueName(Name);
223 // Name is changing to something new.
224 Name = ST->createValueName(NameRef, this);
228 /// takeName - transfer the name from V to this value, setting V's name to
229 /// empty. It is an error to call V->takeName(V).
230 void Value::takeName(Value *V) {
231 ValueSymbolTable *ST = 0;
232 // If this value has a name, drop it.
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
238 if (V->hasName()) V->setName("");
239 return; // Cannot set a name on this value (e.g. constant).
244 ST->removeValueName(Name);
249 // Now we know that this has no name.
251 // If V has no name either, we're done.
252 if (!V->hasName()) return;
254 // Get this's symtab if we didn't before.
256 if (getSymTab(this, ST)) {
259 return; // Cannot set a name on this value (e.g. constant).
263 // Get V's ST, this should always succed, because V has a name.
264 ValueSymbolTable *VST;
265 bool Failure = getSymTab(V, VST);
266 assert(!Failure && "V has a name, so it should have a ST!"); (void)Failure;
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.
274 Name->setValue(this);
278 // Otherwise, things are slightly more complex. Remove V's name from VST and
279 // then reinsert it into ST.
282 VST->removeValueName(V->Name);
285 Name->setValue(this);
288 ST->reinsertValue(this);
292 void Value::replaceAllUsesWith(Value *New) {
293 assert(New && "Value::replaceAllUsesWith(<null>) is invalid!");
294 assert(New != this && "this->replaceAllUsesWith(this) is NOT valid!");
295 assert(New->getType() == getType() &&
296 "replaceAllUses of value with new value of different type!");
298 // Notify all ValueHandles (if present) that this value is going away.
300 ValueHandleBase::ValueIsRAUWd(this, New);
302 while (!use_empty()) {
304 // Must handle Constants specially, we cannot call replaceUsesOfWith on a
305 // constant because they are uniqued.
306 if (Constant *C = dyn_cast<Constant>(U.getUser())) {
307 if (!isa<GlobalValue>(C)) {
308 C->replaceUsesOfWithOnConstant(this, New, &U);
316 if (BasicBlock *BB = dyn_cast<BasicBlock>(this))
317 BB->replaceSuccessorsPhiUsesWith(cast<BasicBlock>(New));
320 Value *Value::stripPointerCasts() {
321 if (!getType()->isPointerTy())
324 // Even though we don't look through PHI nodes, we could be called on an
325 // instruction in an unreachable block, which may be on a cycle.
326 SmallPtrSet<Value *, 4> Visited;
331 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
332 if (!GEP->hasAllZeroIndices())
334 V = GEP->getPointerOperand();
335 } else if (Operator::getOpcode(V) == Instruction::BitCast) {
336 V = cast<Operator>(V)->getOperand(0);
337 } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) {
338 if (GA->mayBeOverridden())
340 V = GA->getAliasee();
344 assert(V->getType()->isPointerTy() && "Unexpected operand type!");
345 } while (Visited.insert(V));
350 /// isDereferenceablePointer - Test if this value is always a pointer to
351 /// allocated and suitably aligned memory for a simple load or store.
352 static bool isDereferenceablePointer(const Value *V,
353 SmallPtrSet<const Value *, 32> &Visited) {
354 // Note that it is not safe to speculate into a malloc'd region because
355 // malloc may return null.
356 // It's also not always safe to follow a bitcast, for example:
357 // bitcast i8* (alloca i8) to i32*
358 // would result in a 4-byte load from a 1-byte alloca. Some cases could
359 // be handled using TargetData to check sizes and alignments though.
361 // These are obviously ok.
362 if (isa<AllocaInst>(V)) return true;
364 // Global variables which can't collapse to null are ok.
365 if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V))
366 return !GV->hasExternalWeakLinkage();
368 // byval arguments are ok.
369 if (const Argument *A = dyn_cast<Argument>(V))
370 return A->hasByValAttr();
372 // For GEPs, determine if the indexing lands within the allocated object.
373 if (const GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
374 // Conservatively require that the base pointer be fully dereferenceable.
375 if (!Visited.insert(GEP->getOperand(0)))
377 if (!isDereferenceablePointer(GEP->getOperand(0), Visited))
379 // Check the indices.
380 gep_type_iterator GTI = gep_type_begin(GEP);
381 for (User::const_op_iterator I = GEP->op_begin()+1,
382 E = GEP->op_end(); I != E; ++I) {
385 // Struct indices can't be out of bounds.
386 if (isa<StructType>(Ty))
388 ConstantInt *CI = dyn_cast<ConstantInt>(Index);
391 // Zero is always ok.
394 // Check to see that it's within the bounds of an array.
395 ArrayType *ATy = dyn_cast<ArrayType>(Ty);
398 if (CI->getValue().getActiveBits() > 64)
400 if (CI->getZExtValue() >= ATy->getNumElements())
403 // Indices check out; this is dereferenceable.
407 // If we don't know, assume the worst.
411 /// isDereferenceablePointer - Test if this value is always a pointer to
412 /// allocated and suitably aligned memory for a simple load or store.
413 bool Value::isDereferenceablePointer() const {
414 SmallPtrSet<const Value *, 32> Visited;
415 return ::isDereferenceablePointer(this, Visited);
418 /// DoPHITranslation - If this value is a PHI node with CurBB as its parent,
419 /// return the value in the PHI node corresponding to PredBB. If not, return
420 /// ourself. This is useful if you want to know the value something has in a
421 /// predecessor block.
422 Value *Value::DoPHITranslation(const BasicBlock *CurBB,
423 const BasicBlock *PredBB) {
424 PHINode *PN = dyn_cast<PHINode>(this);
425 if (PN && PN->getParent() == CurBB)
426 return PN->getIncomingValueForBlock(PredBB);
430 LLVMContext &Value::getContext() const { return VTy->getContext(); }
432 //===----------------------------------------------------------------------===//
433 // ValueHandleBase Class
434 //===----------------------------------------------------------------------===//
436 /// AddToExistingUseList - Add this ValueHandle to the use list for VP, where
437 /// List is known to point into the existing use list.
438 void ValueHandleBase::AddToExistingUseList(ValueHandleBase **List) {
439 assert(List && "Handle list is null?");
441 // Splice ourselves into the list.
446 Next->setPrevPtr(&Next);
447 assert(VP == Next->VP && "Added to wrong list?");
451 void ValueHandleBase::AddToExistingUseListAfter(ValueHandleBase *List) {
452 assert(List && "Must insert after existing node");
455 setPrevPtr(&List->Next);
458 Next->setPrevPtr(&Next);
461 /// AddToUseList - Add this ValueHandle to the use list for VP.
462 void ValueHandleBase::AddToUseList() {
463 assert(VP && "Null pointer doesn't have a use list!");
465 LLVMContextImpl *pImpl = VP->getContext().pImpl;
467 if (VP->HasValueHandle) {
468 // If this value already has a ValueHandle, then it must be in the
469 // ValueHandles map already.
470 ValueHandleBase *&Entry = pImpl->ValueHandles[VP];
471 assert(Entry != 0 && "Value doesn't have any handles?");
472 AddToExistingUseList(&Entry);
476 // Ok, it doesn't have any handles yet, so we must insert it into the
477 // DenseMap. However, doing this insertion could cause the DenseMap to
478 // reallocate itself, which would invalidate all of the PrevP pointers that
479 // point into the old table. Handle this by checking for reallocation and
480 // updating the stale pointers only if needed.
481 DenseMap<Value*, ValueHandleBase*> &Handles = pImpl->ValueHandles;
482 const void *OldBucketPtr = Handles.getPointerIntoBucketsArray();
484 ValueHandleBase *&Entry = Handles[VP];
485 assert(Entry == 0 && "Value really did already have handles?");
486 AddToExistingUseList(&Entry);
487 VP->HasValueHandle = true;
489 // If reallocation didn't happen or if this was the first insertion, don't
491 if (Handles.isPointerIntoBucketsArray(OldBucketPtr) ||
492 Handles.size() == 1) {
496 // Okay, reallocation did happen. Fix the Prev Pointers.
497 for (DenseMap<Value*, ValueHandleBase*>::iterator I = Handles.begin(),
498 E = Handles.end(); I != E; ++I) {
499 assert(I->second && I->first == I->second->VP && "List invariant broken!");
500 I->second->setPrevPtr(&I->second);
504 /// RemoveFromUseList - Remove this ValueHandle from its current use list.
505 void ValueHandleBase::RemoveFromUseList() {
506 assert(VP && VP->HasValueHandle && "Pointer doesn't have a use list!");
508 // Unlink this from its use list.
509 ValueHandleBase **PrevPtr = getPrevPtr();
510 assert(*PrevPtr == this && "List invariant broken");
514 assert(Next->getPrevPtr() == &Next && "List invariant broken");
515 Next->setPrevPtr(PrevPtr);
519 // If the Next pointer was null, then it is possible that this was the last
520 // ValueHandle watching VP. If so, delete its entry from the ValueHandles
522 LLVMContextImpl *pImpl = VP->getContext().pImpl;
523 DenseMap<Value*, ValueHandleBase*> &Handles = pImpl->ValueHandles;
524 if (Handles.isPointerIntoBucketsArray(PrevPtr)) {
526 VP->HasValueHandle = false;
531 void ValueHandleBase::ValueIsDeleted(Value *V) {
532 assert(V->HasValueHandle && "Should only be called if ValueHandles present");
534 // Get the linked list base, which is guaranteed to exist since the
535 // HasValueHandle flag is set.
536 LLVMContextImpl *pImpl = V->getContext().pImpl;
537 ValueHandleBase *Entry = pImpl->ValueHandles[V];
538 assert(Entry && "Value bit set but no entries exist");
540 // We use a local ValueHandleBase as an iterator so that ValueHandles can add
541 // and remove themselves from the list without breaking our iteration. This
542 // is not really an AssertingVH; we just have to give ValueHandleBase a kind.
543 // Note that we deliberately do not the support the case when dropping a value
544 // handle results in a new value handle being permanently added to the list
545 // (as might occur in theory for CallbackVH's): the new value handle will not
546 // be processed and the checking code will mete out righteous punishment if
547 // the handle is still present once we have finished processing all the other
548 // value handles (it is fine to momentarily add then remove a value handle).
549 for (ValueHandleBase Iterator(Assert, *Entry); Entry; Entry = Iterator.Next) {
550 Iterator.RemoveFromUseList();
551 Iterator.AddToExistingUseListAfter(Entry);
552 assert(Entry->Next == &Iterator && "Loop invariant broken.");
554 switch (Entry->getKind()) {
558 // Mark that this value has been deleted by setting it to an invalid Value
560 Entry->operator=(DenseMapInfo<Value *>::getTombstoneKey());
563 // Weak just goes to null, which will unlink it from the list.
567 // Forward to the subclass's implementation.
568 static_cast<CallbackVH*>(Entry)->deleted();
573 // All callbacks, weak references, and assertingVHs should be dropped by now.
574 if (V->HasValueHandle) {
575 #ifndef NDEBUG // Only in +Asserts mode...
576 dbgs() << "While deleting: " << *V->getType() << " %" << V->getName()
578 if (pImpl->ValueHandles[V]->getKind() == Assert)
579 llvm_unreachable("An asserting value handle still pointed to this"
583 llvm_unreachable("All references to V were not removed?");
588 void ValueHandleBase::ValueIsRAUWd(Value *Old, Value *New) {
589 assert(Old->HasValueHandle &&"Should only be called if ValueHandles present");
590 assert(Old != New && "Changing value into itself!");
592 // Get the linked list base, which is guaranteed to exist since the
593 // HasValueHandle flag is set.
594 LLVMContextImpl *pImpl = Old->getContext().pImpl;
595 ValueHandleBase *Entry = pImpl->ValueHandles[Old];
597 assert(Entry && "Value bit set but no entries exist");
599 // We use a local ValueHandleBase as an iterator so that
600 // ValueHandles can add and remove themselves from the list without
601 // breaking our iteration. This is not really an AssertingVH; we
602 // just have to give ValueHandleBase some kind.
603 for (ValueHandleBase Iterator(Assert, *Entry); Entry; Entry = Iterator.Next) {
604 Iterator.RemoveFromUseList();
605 Iterator.AddToExistingUseListAfter(Entry);
606 assert(Entry->Next == &Iterator && "Loop invariant broken.");
608 switch (Entry->getKind()) {
610 // Asserting handle does not follow RAUW implicitly.
613 // Tracking goes to new value like a WeakVH. Note that this may make it
614 // something incompatible with its templated type. We don't want to have a
615 // virtual (or inline) interface to handle this though, so instead we make
616 // the TrackingVH accessors guarantee that a client never sees this value.
620 // Weak goes to the new value, which will unlink it from Old's list.
621 Entry->operator=(New);
624 // Forward to the subclass's implementation.
625 static_cast<CallbackVH*>(Entry)->allUsesReplacedWith(New);
631 // If any new tracking or weak value handles were added while processing the
632 // list, then complain about it now.
633 if (Old->HasValueHandle)
634 for (Entry = pImpl->ValueHandles[Old]; Entry; Entry = Entry->Next)
635 switch (Entry->getKind()) {
638 dbgs() << "After RAUW from " << *Old->getType() << " %"
639 << Old->getName() << " to " << *New->getType() << " %"
640 << New->getName() << "\n";
641 llvm_unreachable("A tracking or weak value handle still pointed to the"
649 /// ~CallbackVH. Empty, but defined here to avoid emitting the vtable
651 CallbackVH::~CallbackVH() {}