2001-06-06 20:29:01 +00:00
|
|
|
//===-- Value.cpp - Implement the Value class -----------------------------===//
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
2009-03-31 22:11:05 +00:00
|
|
|
// This file implements the Value, ValueHandle, and User classes.
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-03-05 19:51:50 +00:00
|
|
|
#include "llvm/Constant.h"
|
2008-05-06 22:52:30 +00:00
|
|
|
#include "llvm/Constants.h"
|
2005-03-05 19:51:50 +00:00
|
|
|
#include "llvm/DerivedTypes.h"
|
2001-06-06 20:29:01 +00:00
|
|
|
#include "llvm/InstrTypes.h"
|
2008-02-21 01:54:02 +00:00
|
|
|
#include "llvm/Instructions.h"
|
2005-03-05 19:51:50 +00:00
|
|
|
#include "llvm/Module.h"
|
2007-02-05 20:47:22 +00:00
|
|
|
#include "llvm/ValueSymbolTable.h"
|
2006-11-17 08:03:48 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/Support/LeakDetector.h"
|
2009-03-31 22:11:05 +00:00
|
|
|
#include "llvm/Support/ManagedStatic.h"
|
2009-06-17 17:36:57 +00:00
|
|
|
#include "llvm/Support/Threading.h"
|
2009-03-31 22:11:05 +00:00
|
|
|
#include "llvm/Support/ValueHandle.h"
|
2009-06-17 17:36:57 +00:00
|
|
|
#include "llvm/System/RWMutex.h"
|
2009-03-31 22:11:05 +00:00
|
|
|
#include "llvm/ADT/DenseMap.h"
|
2001-06-06 20:29:01 +00:00
|
|
|
#include <algorithm>
|
2003-11-21 20:23:48 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Value Class
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2001-12-13 00:41:27 +00:00
|
|
|
static inline const Type *checkType(const Type *Ty) {
|
|
|
|
assert(Ty && "Value defined with a null type: Error!");
|
|
|
|
return Ty;
|
|
|
|
}
|
|
|
|
|
2007-02-12 05:18:08 +00:00
|
|
|
Value::Value(const Type *ty, unsigned scid)
|
2009-03-31 22:11:05 +00:00
|
|
|
: SubclassID(scid), HasValueHandle(0), SubclassData(0), VTy(checkType(ty)),
|
2008-09-19 15:13:20 +00:00
|
|
|
UseList(0), Name(0) {
|
2008-02-21 02:14:01 +00:00
|
|
|
if (isa<CallInst>(this) || isa<InvokeInst>(this))
|
2008-07-24 00:08:56 +00:00
|
|
|
assert((VTy->isFirstClassType() || VTy == Type::VoidTy ||
|
|
|
|
isa<OpaqueType>(ty) || VTy->getTypeID() == Type::StructTyID) &&
|
2008-02-21 01:54:02 +00:00
|
|
|
"invalid CallInst type!");
|
|
|
|
else if (!isa<Constant>(this) && !isa<BasicBlock>(this))
|
2008-07-24 00:08:56 +00:00
|
|
|
assert((VTy->isFirstClassType() || VTy == Type::VoidTy ||
|
2004-07-07 18:07:46 +00:00
|
|
|
isa<OpaqueType>(ty)) &&
|
2004-07-06 17:44:17 +00:00
|
|
|
"Cannot create non-first-class values except for constants!");
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2007-12-10 02:14:30 +00:00
|
|
|
Value::~Value() {
|
2009-03-31 22:11:05 +00:00
|
|
|
// Notify all ValueHandles (if present) that this value is going away.
|
|
|
|
if (HasValueHandle)
|
|
|
|
ValueHandleBase::ValueIsDeleted(this);
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
#ifndef NDEBUG // Only in -g mode...
|
2001-06-11 15:04:40 +00:00
|
|
|
// Check to make sure that there are no uses of this value that are still
|
|
|
|
// around when the value is destroyed. If there are, then we have a dangling
|
|
|
|
// reference and something is wrong. This code is here to print out what is
|
2005-04-21 23:48:37 +00:00
|
|
|
// still being referenced. The value in question should be printed as
|
2001-06-11 15:04:40 +00:00
|
|
|
// a <badref>
|
|
|
|
//
|
2007-12-10 02:14:30 +00:00
|
|
|
if (!use_empty()) {
|
2008-12-13 18:37:58 +00:00
|
|
|
cerr << "While deleting: " << *VTy << " %" << getNameStr() << "\n";
|
2007-12-10 02:14:30 +00:00
|
|
|
for (use_iterator I = use_begin(), E = use_end(); I != E; ++I)
|
2008-12-13 18:37:58 +00:00
|
|
|
cerr << "Use still stuck around after Def is destroyed:"
|
2006-11-17 08:03:48 +00:00
|
|
|
<< **I << "\n";
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
#endif
|
2007-12-10 02:14:30 +00:00
|
|
|
assert(use_empty() && "Uses remain when a value is destroyed!");
|
2002-09-08 18:59:35 +00:00
|
|
|
|
2007-03-20 00:18:10 +00:00
|
|
|
// If this value is named, destroy the name. This should not be in a symtab
|
|
|
|
// at this point.
|
2007-12-10 02:14:30 +00:00
|
|
|
if (Name)
|
|
|
|
Name->Destroy();
|
2007-03-20 00:18:10 +00:00
|
|
|
|
2002-09-08 18:59:35 +00:00
|
|
|
// There should be no uses of this object anymore, remove it.
|
2007-12-10 02:14:30 +00:00
|
|
|
LeakDetector::removeGarbageObject(this);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2005-02-01 01:24:21 +00:00
|
|
|
/// hasNUses - Return true if this Value has exactly N users.
|
|
|
|
///
|
|
|
|
bool Value::hasNUses(unsigned N) const {
|
|
|
|
use_const_iterator UI = use_begin(), E = use_end();
|
|
|
|
|
|
|
|
for (; N; --N, ++UI)
|
|
|
|
if (UI == E) return false; // Too few.
|
|
|
|
return UI == E;
|
|
|
|
}
|
|
|
|
|
2005-02-23 16:51:11 +00:00
|
|
|
/// hasNUsesOrMore - Return true if this value has N users or more. This is
|
|
|
|
/// logically equivalent to getNumUses() >= N.
|
|
|
|
///
|
|
|
|
bool Value::hasNUsesOrMore(unsigned N) const {
|
|
|
|
use_const_iterator UI = use_begin(), E = use_end();
|
|
|
|
|
|
|
|
for (; N; --N, ++UI)
|
|
|
|
if (UI == E) return false; // Too few.
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-06-12 21:15:59 +00:00
|
|
|
/// isUsedInBasicBlock - Return true if this value is used in the specified
|
|
|
|
/// basic block.
|
2008-09-25 22:42:01 +00:00
|
|
|
bool Value::isUsedInBasicBlock(const BasicBlock *BB) const {
|
2008-06-12 21:15:59 +00:00
|
|
|
for (use_const_iterator I = use_begin(), E = use_end(); I != E; ++I) {
|
|
|
|
const Instruction *User = dyn_cast<Instruction>(*I);
|
|
|
|
if (User && User->getParent() == BB)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2005-02-23 16:51:11 +00:00
|
|
|
|
2005-02-01 01:24:21 +00:00
|
|
|
/// getNumUses - This method computes the number of uses of this Value. This
|
|
|
|
/// is a linear time operation. Use hasOneUse or hasNUses to check for specific
|
|
|
|
/// values.
|
|
|
|
unsigned Value::getNumUses() const {
|
|
|
|
return (unsigned)std::distance(use_begin(), use_end());
|
|
|
|
}
|
|
|
|
|
2007-02-11 00:37:27 +00:00
|
|
|
static bool getSymTab(Value *V, ValueSymbolTable *&ST) {
|
2007-02-11 19:12:18 +00:00
|
|
|
ST = 0;
|
2007-02-11 00:37:27 +00:00
|
|
|
if (Instruction *I = dyn_cast<Instruction>(V)) {
|
2005-03-05 19:51:50 +00:00
|
|
|
if (BasicBlock *P = I->getParent())
|
|
|
|
if (Function *PP = P->getParent())
|
2007-01-06 07:24:44 +00:00
|
|
|
ST = &PP->getValueSymbolTable();
|
2007-02-11 00:37:27 +00:00
|
|
|
} else if (BasicBlock *BB = dyn_cast<BasicBlock>(V)) {
|
2007-02-05 20:47:22 +00:00
|
|
|
if (Function *P = BB->getParent())
|
|
|
|
ST = &P->getValueSymbolTable();
|
2007-02-11 00:37:27 +00:00
|
|
|
} else if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
|
2007-02-05 20:47:22 +00:00
|
|
|
if (Module *P = GV->getParent())
|
|
|
|
ST = &P->getValueSymbolTable();
|
2007-02-11 00:37:27 +00:00
|
|
|
} else if (Argument *A = dyn_cast<Argument>(V)) {
|
2007-02-05 20:47:22 +00:00
|
|
|
if (Function *P = A->getParent())
|
|
|
|
ST = &P->getValueSymbolTable();
|
2005-03-05 19:51:50 +00:00
|
|
|
} else {
|
2007-02-11 00:37:27 +00:00
|
|
|
assert(isa<Constant>(V) && "Unknown value type!");
|
|
|
|
return true; // no name is setable for this.
|
2005-03-05 19:51:50 +00:00
|
|
|
}
|
2007-02-11 00:37:27 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2007-08-10 15:34:35 +00:00
|
|
|
/// getNameStart - Return a pointer to a null terminated string for this name.
|
|
|
|
/// Note that names can have null characters within the string as well as at
|
|
|
|
/// their end. This always returns a non-null pointer.
|
|
|
|
const char *Value::getNameStart() const {
|
|
|
|
if (Name == 0) return "";
|
|
|
|
return Name->getKeyData();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getNameLen - Return the length of the string, correctly handling nul
|
|
|
|
/// characters embedded into them.
|
|
|
|
unsigned Value::getNameLen() const {
|
2007-09-28 20:09:40 +00:00
|
|
|
return Name ? Name->getKeyLength() : 0;
|
2007-08-10 15:34:35 +00:00
|
|
|
}
|
|
|
|
|
2008-04-30 03:55:40 +00:00
|
|
|
/// isName - Return true if this value has the name specified by the provided
|
|
|
|
/// nul terminated string.
|
|
|
|
bool Value::isName(const char *N) const {
|
|
|
|
unsigned InLen = strlen(N);
|
2008-04-30 15:27:09 +00:00
|
|
|
return InLen == getNameLen() && memcmp(getNameStart(), N, InLen) == 0;
|
2008-04-30 03:55:40 +00:00
|
|
|
}
|
|
|
|
|
2007-08-10 15:34:35 +00:00
|
|
|
|
2007-02-15 18:53:54 +00:00
|
|
|
std::string Value::getNameStr() const {
|
2007-02-12 05:18:08 +00:00
|
|
|
if (Name == 0) return "";
|
|
|
|
return std::string(Name->getKeyData(),
|
|
|
|
Name->getKeyData()+Name->getKeyLength());
|
|
|
|
}
|
2007-02-11 00:37:27 +00:00
|
|
|
|
2007-02-12 05:18:08 +00:00
|
|
|
void Value::setName(const std::string &name) {
|
2007-02-12 18:52:59 +00:00
|
|
|
setName(&name[0], name.size());
|
|
|
|
}
|
|
|
|
|
2007-02-13 07:53:34 +00:00
|
|
|
void Value::setName(const char *Name) {
|
|
|
|
setName(Name, Name ? strlen(Name) : 0);
|
|
|
|
}
|
|
|
|
|
2007-02-12 18:52:59 +00:00
|
|
|
void Value::setName(const char *NameStr, unsigned NameLen) {
|
|
|
|
if (NameLen == 0 && !hasName()) return;
|
2007-03-05 00:00:42 +00:00
|
|
|
assert(getType() != Type::VoidTy && "Cannot assign a name to void values!");
|
2007-02-12 05:18:08 +00:00
|
|
|
|
2007-02-11 00:37:27 +00:00
|
|
|
// Get the symbol table to update for this object.
|
|
|
|
ValueSymbolTable *ST;
|
|
|
|
if (getSymTab(this, ST))
|
|
|
|
return; // Cannot set a name on this value (e.g. constant).
|
2005-03-05 19:51:50 +00:00
|
|
|
|
2007-02-12 05:18:08 +00:00
|
|
|
if (!ST) { // No symbol table to update? Just do the change.
|
2007-02-12 18:52:59 +00:00
|
|
|
if (NameLen == 0) {
|
2007-02-12 05:18:08 +00:00
|
|
|
// Free the name for this value.
|
|
|
|
Name->Destroy();
|
|
|
|
Name = 0;
|
2007-02-12 18:52:59 +00:00
|
|
|
return;
|
2005-03-06 02:14:28 +00:00
|
|
|
}
|
2007-02-12 18:52:59 +00:00
|
|
|
|
|
|
|
if (Name) {
|
|
|
|
// Name isn't changing?
|
|
|
|
if (NameLen == Name->getKeyLength() &&
|
|
|
|
!memcmp(Name->getKeyData(), NameStr, NameLen))
|
|
|
|
return;
|
|
|
|
Name->Destroy();
|
|
|
|
}
|
|
|
|
|
|
|
|
// NOTE: Could optimize for the case the name is shrinking to not deallocate
|
|
|
|
// then reallocated.
|
|
|
|
|
|
|
|
// Create the new name.
|
|
|
|
Name = ValueName::Create(NameStr, NameStr+NameLen);
|
|
|
|
Name->setValue(this);
|
2007-02-12 05:18:08 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// NOTE: Could optimize for the case the name is shrinking to not deallocate
|
|
|
|
// then reallocated.
|
|
|
|
if (hasName()) {
|
|
|
|
// Name isn't changing?
|
2007-02-12 18:52:59 +00:00
|
|
|
if (NameLen == Name->getKeyLength() &&
|
|
|
|
!memcmp(Name->getKeyData(), NameStr, NameLen))
|
2007-02-12 05:18:08 +00:00
|
|
|
return;
|
|
|
|
|
|
|
|
// Remove old name.
|
|
|
|
ST->removeValueName(Name);
|
|
|
|
Name->Destroy();
|
|
|
|
Name = 0;
|
|
|
|
|
2007-02-12 18:52:59 +00:00
|
|
|
if (NameLen == 0)
|
|
|
|
return;
|
2005-03-06 02:14:28 +00:00
|
|
|
}
|
2007-02-12 05:18:08 +00:00
|
|
|
|
|
|
|
// Name is changing to something new.
|
2007-02-12 18:52:59 +00:00
|
|
|
Name = ST->createValueName(NameStr, NameLen, this);
|
2005-03-05 19:51:50 +00:00
|
|
|
}
|
|
|
|
|
2007-02-12 18:52:59 +00:00
|
|
|
|
2007-02-11 00:37:27 +00:00
|
|
|
/// takeName - transfer the name from V to this value, setting V's name to
|
|
|
|
/// empty. It is an error to call V->takeName(V).
|
|
|
|
void Value::takeName(Value *V) {
|
2007-02-15 20:01:43 +00:00
|
|
|
ValueSymbolTable *ST = 0;
|
|
|
|
// If this value has a name, drop it.
|
|
|
|
if (hasName()) {
|
|
|
|
// Get the symtab this is in.
|
|
|
|
if (getSymTab(this, ST)) {
|
|
|
|
// We can't set a name on this value, but we need to clear V's name if
|
|
|
|
// it has one.
|
|
|
|
if (V->hasName()) V->setName(0, 0);
|
|
|
|
return; // Cannot set a name on this value (e.g. constant).
|
|
|
|
}
|
|
|
|
|
|
|
|
// Remove old name.
|
|
|
|
if (ST)
|
|
|
|
ST->removeValueName(Name);
|
|
|
|
Name->Destroy();
|
|
|
|
Name = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now we know that this has no name.
|
|
|
|
|
|
|
|
// If V has no name either, we're done.
|
|
|
|
if (!V->hasName()) return;
|
|
|
|
|
|
|
|
// Get this's symtab if we didn't before.
|
|
|
|
if (!ST) {
|
|
|
|
if (getSymTab(this, ST)) {
|
|
|
|
// Clear V's name.
|
|
|
|
V->setName(0, 0);
|
|
|
|
return; // Cannot set a name on this value (e.g. constant).
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get V's ST, this should always succed, because V has a name.
|
|
|
|
ValueSymbolTable *VST;
|
|
|
|
bool Failure = getSymTab(V, VST);
|
2008-06-21 19:47:03 +00:00
|
|
|
assert(!Failure && "V has a name, so it should have a ST!"); Failure=Failure;
|
2007-02-15 20:01:43 +00:00
|
|
|
|
|
|
|
// If these values are both in the same symtab, we can do this very fast.
|
|
|
|
// This works even if both values have no symtab yet.
|
|
|
|
if (ST == VST) {
|
|
|
|
// Take the name!
|
|
|
|
Name = V->Name;
|
|
|
|
V->Name = 0;
|
|
|
|
Name->setValue(this);
|
2007-02-11 01:04:09 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2007-02-15 20:01:43 +00:00
|
|
|
// Otherwise, things are slightly more complex. Remove V's name from VST and
|
|
|
|
// then reinsert it into ST.
|
|
|
|
|
|
|
|
if (VST)
|
|
|
|
VST->removeValueName(V->Name);
|
|
|
|
Name = V->Name;
|
|
|
|
V->Name = 0;
|
|
|
|
Name->setValue(this);
|
|
|
|
|
|
|
|
if (ST)
|
|
|
|
ST->reinsertValue(this);
|
2007-02-11 00:37:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-08-29 05:09:37 +00:00
|
|
|
// uncheckedReplaceAllUsesWith - This is exactly the same as replaceAllUsesWith,
|
|
|
|
// except that it doesn't have all of the asserts. The asserts fail because we
|
|
|
|
// are half-way done resolving types, which causes some types to exist as two
|
|
|
|
// different Type*'s at the same time. This is a sledgehammer to work around
|
|
|
|
// this problem.
|
|
|
|
//
|
|
|
|
void Value::uncheckedReplaceAllUsesWith(Value *New) {
|
2009-03-31 22:11:05 +00:00
|
|
|
// Notify all ValueHandles (if present) that this value is going away.
|
|
|
|
if (HasValueHandle)
|
|
|
|
ValueHandleBase::ValueIsRAUWd(this, New);
|
|
|
|
|
2005-02-01 01:24:21 +00:00
|
|
|
while (!use_empty()) {
|
2008-09-19 15:13:20 +00:00
|
|
|
Use &U = *UseList;
|
2003-08-29 05:09:37 +00:00
|
|
|
// Must handle Constants specially, we cannot call replaceUsesOfWith on a
|
2007-08-21 00:21:07 +00:00
|
|
|
// constant because they are uniqued.
|
2003-10-16 16:53:07 +00:00
|
|
|
if (Constant *C = dyn_cast<Constant>(U.getUser())) {
|
2007-08-21 00:21:07 +00:00
|
|
|
if (!isa<GlobalValue>(C)) {
|
2005-10-04 18:13:04 +00:00
|
|
|
C->replaceUsesOfWithOnConstant(this, New, &U);
|
2007-08-21 00:21:07 +00:00
|
|
|
continue;
|
|
|
|
}
|
2003-08-29 05:09:37 +00:00
|
|
|
}
|
2007-08-21 00:21:07 +00:00
|
|
|
|
|
|
|
U.set(New);
|
2003-08-29 05:09:37 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2003-10-16 16:53:07 +00:00
|
|
|
void Value::replaceAllUsesWith(Value *New) {
|
|
|
|
assert(New && "Value::replaceAllUsesWith(<null>) is invalid!");
|
|
|
|
assert(New != this && "this->replaceAllUsesWith(this) is NOT valid!");
|
|
|
|
assert(New->getType() == getType() &&
|
|
|
|
"replaceAllUses of value with new value of different type!");
|
2003-08-29 05:09:37 +00:00
|
|
|
|
2003-10-16 16:53:07 +00:00
|
|
|
uncheckedReplaceAllUsesWith(New);
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2008-05-07 22:54:15 +00:00
|
|
|
Value *Value::stripPointerCasts() {
|
2008-10-01 15:25:41 +00:00
|
|
|
if (!isa<PointerType>(getType()))
|
|
|
|
return this;
|
2008-12-29 21:06:19 +00:00
|
|
|
Value *V = this;
|
|
|
|
do {
|
|
|
|
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
|
|
|
|
if (CE->getOpcode() == Instruction::GetElementPtr) {
|
|
|
|
for (unsigned i = 1, e = CE->getNumOperands(); i != e; ++i)
|
|
|
|
if (!CE->getOperand(i)->isNullValue())
|
|
|
|
return V;
|
|
|
|
V = CE->getOperand(0);
|
|
|
|
} else if (CE->getOpcode() == Instruction::BitCast) {
|
|
|
|
V = CE->getOperand(0);
|
|
|
|
} else {
|
|
|
|
return V;
|
|
|
|
}
|
|
|
|
} else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(V)) {
|
|
|
|
if (!GEP->hasAllZeroIndices())
|
|
|
|
return V;
|
|
|
|
V = GEP->getOperand(0);
|
|
|
|
} else if (BitCastInst *CI = dyn_cast<BitCastInst>(V)) {
|
|
|
|
V = CI->getOperand(0);
|
|
|
|
} else {
|
|
|
|
return V;
|
2008-05-07 22:54:15 +00:00
|
|
|
}
|
2008-12-29 21:06:19 +00:00
|
|
|
assert(isa<PointerType>(V->getType()) && "Unexpected operand type!");
|
|
|
|
} while (1);
|
2008-05-07 22:54:15 +00:00
|
|
|
}
|
|
|
|
|
2008-10-01 15:25:41 +00:00
|
|
|
Value *Value::getUnderlyingObject() {
|
|
|
|
if (!isa<PointerType>(getType()))
|
|
|
|
return this;
|
2008-12-29 21:06:19 +00:00
|
|
|
Value *V = this;
|
2009-04-15 06:23:41 +00:00
|
|
|
unsigned MaxLookup = 6;
|
2008-12-29 21:06:19 +00:00
|
|
|
do {
|
|
|
|
if (Instruction *I = dyn_cast<Instruction>(V)) {
|
|
|
|
if (!isa<BitCastInst>(I) && !isa<GetElementPtrInst>(I))
|
|
|
|
return V;
|
|
|
|
V = I->getOperand(0);
|
|
|
|
} else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
|
|
|
|
if (CE->getOpcode() != Instruction::BitCast &&
|
|
|
|
CE->getOpcode() != Instruction::GetElementPtr)
|
|
|
|
return V;
|
|
|
|
V = CE->getOperand(0);
|
|
|
|
} else {
|
|
|
|
return V;
|
|
|
|
}
|
|
|
|
assert(isa<PointerType>(V->getType()) && "Unexpected operand type!");
|
2009-04-15 06:23:41 +00:00
|
|
|
} while (--MaxLookup);
|
|
|
|
return V;
|
2008-10-01 15:25:41 +00:00
|
|
|
}
|
|
|
|
|
2008-12-02 18:33:11 +00:00
|
|
|
/// DoPHITranslation - If this value is a PHI node with CurBB as its parent,
|
2008-12-02 07:16:45 +00:00
|
|
|
/// return the value in the PHI node corresponding to PredBB. If not, return
|
|
|
|
/// ourself. This is useful if you want to know the value something has in a
|
|
|
|
/// predecessor block.
|
|
|
|
Value *Value::DoPHITranslation(const BasicBlock *CurBB,
|
|
|
|
const BasicBlock *PredBB) {
|
|
|
|
PHINode *PN = dyn_cast<PHINode>(this);
|
|
|
|
if (PN && PN->getParent() == CurBB)
|
|
|
|
return PN->getIncomingValueForBlock(PredBB);
|
|
|
|
return this;
|
|
|
|
}
|
|
|
|
|
2009-03-31 22:11:05 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// ValueHandleBase Class
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
/// ValueHandles - This map keeps track of all of the value handles that are
|
|
|
|
/// watching a Value*. The Value::HasValueHandle bit is used to know whether or
|
|
|
|
/// not a value has an entry in this map.
|
|
|
|
typedef DenseMap<Value*, ValueHandleBase*> ValueHandlesTy;
|
|
|
|
static ManagedStatic<ValueHandlesTy> ValueHandles;
|
2009-06-17 17:36:57 +00:00
|
|
|
static ManagedStatic<sys::RWMutex> ValueHandlesLock;
|
2009-03-31 22:11:05 +00:00
|
|
|
|
2009-05-04 18:40:41 +00:00
|
|
|
/// AddToExistingUseList - Add this ValueHandle to the use list for VP, where
|
|
|
|
/// List is known to point into the existing use list.
|
2009-03-31 22:11:05 +00:00
|
|
|
void ValueHandleBase::AddToExistingUseList(ValueHandleBase **List) {
|
|
|
|
assert(List && "Handle list is null?");
|
|
|
|
|
|
|
|
// Splice ourselves into the list.
|
|
|
|
Next = *List;
|
|
|
|
*List = this;
|
|
|
|
setPrevPtr(List);
|
|
|
|
if (Next) {
|
|
|
|
Next->setPrevPtr(&Next);
|
|
|
|
assert(VP == Next->VP && "Added to wrong list?");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// AddToUseList - Add this ValueHandle to the use list for VP.
|
|
|
|
void ValueHandleBase::AddToUseList() {
|
|
|
|
assert(VP && "Null pointer doesn't have a use list!");
|
|
|
|
if (VP->HasValueHandle) {
|
|
|
|
// If this value already has a ValueHandle, then it must be in the
|
|
|
|
// ValueHandles map already.
|
2009-06-17 17:36:57 +00:00
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->reader_acquire();
|
2009-03-31 22:11:05 +00:00
|
|
|
ValueHandleBase *&Entry = (*ValueHandles)[VP];
|
|
|
|
assert(Entry != 0 && "Value doesn't have any handles?");
|
2009-06-17 17:36:57 +00:00
|
|
|
AddToExistingUseList(&Entry);
|
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->reader_release();
|
|
|
|
return;
|
2009-03-31 22:11:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Ok, it doesn't have any handles yet, so we must insert it into the
|
|
|
|
// DenseMap. However, doing this insertion could cause the DenseMap to
|
|
|
|
// reallocate itself, which would invalidate all of the PrevP pointers that
|
|
|
|
// point into the old table. Handle this by checking for reallocation and
|
|
|
|
// updating the stale pointers only if needed.
|
2009-06-17 17:36:57 +00:00
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->writer_acquire();
|
2009-03-31 22:11:05 +00:00
|
|
|
ValueHandlesTy &Handles = *ValueHandles;
|
|
|
|
const void *OldBucketPtr = Handles.getPointerIntoBucketsArray();
|
|
|
|
|
|
|
|
ValueHandleBase *&Entry = Handles[VP];
|
|
|
|
assert(Entry == 0 && "Value really did already have handles?");
|
|
|
|
AddToExistingUseList(&Entry);
|
2009-05-04 18:40:41 +00:00
|
|
|
VP->HasValueHandle = true;
|
2009-03-31 22:11:05 +00:00
|
|
|
|
|
|
|
// If reallocation didn't happen or if this was the first insertion, don't
|
|
|
|
// walk the table.
|
|
|
|
if (Handles.isPointerIntoBucketsArray(OldBucketPtr) ||
|
2009-06-17 17:36:57 +00:00
|
|
|
Handles.size() == 1) {
|
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->writer_release();
|
2009-03-31 22:11:05 +00:00
|
|
|
return;
|
2009-06-17 17:36:57 +00:00
|
|
|
}
|
2009-03-31 22:11:05 +00:00
|
|
|
|
|
|
|
// Okay, reallocation did happen. Fix the Prev Pointers.
|
|
|
|
for (ValueHandlesTy::iterator I = Handles.begin(), E = Handles.end();
|
|
|
|
I != E; ++I) {
|
|
|
|
assert(I->second && I->first == I->second->VP && "List invariant broken!");
|
|
|
|
I->second->setPrevPtr(&I->second);
|
|
|
|
}
|
2009-06-17 17:36:57 +00:00
|
|
|
|
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->writer_release();
|
2009-03-31 22:11:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// RemoveFromUseList - Remove this ValueHandle from its current use list.
|
|
|
|
void ValueHandleBase::RemoveFromUseList() {
|
|
|
|
assert(VP && VP->HasValueHandle && "Pointer doesn't have a use list!");
|
|
|
|
|
|
|
|
// Unlink this from its use list.
|
|
|
|
ValueHandleBase **PrevPtr = getPrevPtr();
|
|
|
|
assert(*PrevPtr == this && "List invariant broken");
|
|
|
|
|
|
|
|
*PrevPtr = Next;
|
|
|
|
if (Next) {
|
|
|
|
assert(Next->getPrevPtr() == &Next && "List invariant broken");
|
|
|
|
Next->setPrevPtr(PrevPtr);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If the Next pointer was null, then it is possible that this was the last
|
|
|
|
// ValueHandle watching VP. If so, delete its entry from the ValueHandles
|
|
|
|
// map.
|
2009-06-17 17:36:57 +00:00
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->writer_acquire();
|
2009-03-31 22:11:05 +00:00
|
|
|
ValueHandlesTy &Handles = *ValueHandles;
|
|
|
|
if (Handles.isPointerIntoBucketsArray(PrevPtr)) {
|
|
|
|
Handles.erase(VP);
|
|
|
|
VP->HasValueHandle = false;
|
|
|
|
}
|
2009-06-17 17:36:57 +00:00
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->writer_release();
|
2009-03-31 22:11:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void ValueHandleBase::ValueIsDeleted(Value *V) {
|
|
|
|
assert(V->HasValueHandle && "Should only be called if ValueHandles present");
|
|
|
|
|
|
|
|
// Get the linked list base, which is guaranteed to exist since the
|
|
|
|
// HasValueHandle flag is set.
|
2009-06-17 17:36:57 +00:00
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->reader_acquire();
|
2009-03-31 22:11:05 +00:00
|
|
|
ValueHandleBase *Entry = (*ValueHandles)[V];
|
2009-06-17 17:36:57 +00:00
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->reader_release();
|
2009-03-31 22:11:05 +00:00
|
|
|
assert(Entry && "Value bit set but no entries exist");
|
|
|
|
|
|
|
|
while (Entry) {
|
|
|
|
// Advance pointer to avoid invalidation.
|
|
|
|
ValueHandleBase *ThisNode = Entry;
|
|
|
|
Entry = Entry->Next;
|
|
|
|
|
|
|
|
switch (ThisNode->getKind()) {
|
|
|
|
case Assert:
|
|
|
|
#ifndef NDEBUG // Only in -g mode...
|
|
|
|
cerr << "While deleting: " << *V->getType() << " %" << V->getNameStr()
|
|
|
|
<< "\n";
|
|
|
|
#endif
|
|
|
|
cerr << "An asserting value handle still pointed to this value!\n";
|
|
|
|
abort();
|
|
|
|
case Weak:
|
|
|
|
// Weak just goes to null, which will unlink it from the list.
|
|
|
|
ThisNode->operator=(0);
|
|
|
|
break;
|
|
|
|
case Callback:
|
2009-05-02 21:10:48 +00:00
|
|
|
// Forward to the subclass's implementation.
|
|
|
|
static_cast<CallbackVH*>(ThisNode)->deleted();
|
|
|
|
break;
|
2009-03-31 22:11:05 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// All callbacks and weak references should be dropped by now.
|
|
|
|
assert(!V->HasValueHandle && "All references to V were not removed?");
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void ValueHandleBase::ValueIsRAUWd(Value *Old, Value *New) {
|
|
|
|
assert(Old->HasValueHandle &&"Should only be called if ValueHandles present");
|
|
|
|
assert(Old != New && "Changing value into itself!");
|
|
|
|
|
|
|
|
// Get the linked list base, which is guaranteed to exist since the
|
|
|
|
// HasValueHandle flag is set.
|
2009-06-17 17:36:57 +00:00
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->reader_acquire();
|
2009-03-31 22:11:05 +00:00
|
|
|
ValueHandleBase *Entry = (*ValueHandles)[Old];
|
2009-06-17 17:36:57 +00:00
|
|
|
if (llvm_is_multithreaded()) ValueHandlesLock->reader_release();
|
2009-03-31 22:11:05 +00:00
|
|
|
assert(Entry && "Value bit set but no entries exist");
|
|
|
|
|
|
|
|
while (Entry) {
|
|
|
|
// Advance pointer to avoid invalidation.
|
|
|
|
ValueHandleBase *ThisNode = Entry;
|
|
|
|
Entry = Entry->Next;
|
|
|
|
|
|
|
|
switch (ThisNode->getKind()) {
|
|
|
|
case Assert:
|
|
|
|
// Asserting handle does not follow RAUW implicitly.
|
|
|
|
break;
|
|
|
|
case Weak:
|
|
|
|
// Weak goes to the new value, which will unlink it from Old's list.
|
|
|
|
ThisNode->operator=(New);
|
|
|
|
break;
|
|
|
|
case Callback:
|
2009-05-02 21:10:48 +00:00
|
|
|
// Forward to the subclass's implementation.
|
|
|
|
static_cast<CallbackVH*>(ThisNode)->allUsesReplacedWith(New);
|
|
|
|
break;
|
2009-03-31 22:11:05 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-02 21:10:48 +00:00
|
|
|
/// ~CallbackVH. Empty, but defined here to avoid emitting the vtable
|
|
|
|
/// more than once.
|
|
|
|
CallbackVH::~CallbackVH() {}
|
|
|
|
|
2008-12-02 07:16:45 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// User Class
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// replaceUsesOfWith - Replaces all references to the "From" definition with
|
|
|
|
// references to the "To" definition.
|
|
|
|
//
|
|
|
|
void User::replaceUsesOfWith(Value *From, Value *To) {
|
|
|
|
if (From == To) return; // Duh what?
|
|
|
|
|
2008-02-20 11:08:44 +00:00
|
|
|
assert((!isa<Constant>(this) || isa<GlobalValue>(this)) &&
|
2002-10-09 23:12:59 +00:00
|
|
|
"Cannot call User::replaceUsesofWith on a constant!");
|
|
|
|
|
2001-07-07 08:36:50 +00:00
|
|
|
for (unsigned i = 0, E = getNumOperands(); i != E; ++i)
|
|
|
|
if (getOperand(i) == From) { // Is This operand is pointing to oldval?
|
2001-06-06 20:29:01 +00:00
|
|
|
// The side effects of this setOperand call include linking to
|
|
|
|
// "To", adding "this" to the uses list of To, and
|
|
|
|
// most importantly, removing "this" from the use list of "From".
|
2001-07-07 08:36:50 +00:00
|
|
|
setOperand(i, To); // Fix it now...
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
}
|
2008-05-15 01:23:11 +00:00
|
|
|
|