X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FVMCore%2FValue.cpp;h=f59e8ef957e5a5e97a5f6e6de83544f81bd442a9;hb=9530ddcc605cb65d0a19bbfbfb8b73b09c4e4cfa;hp=bef0d4466ff96be26a97583b697f59a17e864929;hpb=c04bf0724af43f0a8f9142632634dd3160a7a52f;p=oota-llvm.git diff --git a/lib/VMCore/Value.cpp b/lib/VMCore/Value.cpp index bef0d4466ff..f59e8ef957e 100644 --- a/lib/VMCore/Value.cpp +++ b/lib/VMCore/Value.cpp @@ -1,27 +1,44 @@ //===-- Value.cpp - Implement the Value class -----------------------------===// // -// This file implements the Value, User, and SymTabValue classes. +// The LLVM Compiler Infrastructure +// +// This file was developed by the LLVM research group and is distributed under +// the University of Illinois Open Source License. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// +// +// This file implements the Value and User classes. // //===----------------------------------------------------------------------===// -#include "llvm/ValueHolderImpl.h" +#include "llvm/Constant.h" +#include "llvm/DerivedTypes.h" #include "llvm/InstrTypes.h" +#include "llvm/Module.h" #include "llvm/SymbolTable.h" -#include "llvm/SymTabValue.h" -#include "llvm/ConstPoolVals.h" -#include "llvm/Type.h" -#ifndef NDEBUG // Only in -g mode... -#include "llvm/Assembly/Writer.h" -#endif +#include "llvm/Support/LeakDetector.h" #include +#include +using namespace llvm; //===----------------------------------------------------------------------===// // Value Class //===----------------------------------------------------------------------===// -Value::Value(const Type *ty, ValueTy vty, const string &name = "") - : Name(name), Ty(ty, this) { - VTy = vty; +static inline const Type *checkType(const Type *Ty) { + assert(Ty && "Value defined with a null type: Error!"); + return Ty; +} + +Value::Value(const Type *ty, unsigned scid, const std::string &name) + : SubclassID(scid), SubclassData(0), Ty(checkType(ty)), + UseList(0), Name(name) { + if (!isa(this) && !isa(this)) + assert((Ty->isFirstClassType() || Ty == Type::VoidTy || + isa(ty)) && + "Cannot create non-first-class values except for constants!"); + if (ty == Type::VoidTy) + assert(name.empty() && "Cannot have named void values!"); } Value::~Value() { @@ -29,80 +46,132 @@ Value::~Value() { // 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 - // still being referenced. The value in question should be printed as + // still being referenced. The value in question should be printed as // a // - if (Uses.begin() != Uses.end()) { - for (use_const_iterator I = Uses.begin(); I != Uses.end(); ++I) - cerr << "Use still stuck around after Def is destroyed:" << *I << endl; + if (use_begin() != use_end()) { + std::cerr << "While deleting: " << *Ty << " %" << Name << "\n"; + for (use_iterator I = use_begin(), E = use_end(); I != E; ++I) + std::cerr << "Use still stuck around after Def is destroyed:" + << **I << "\n"; } #endif - assert(Uses.begin() == Uses.end()); + assert(use_begin() == use_end() && "Uses remain when a value is destroyed!"); + + // There should be no uses of this object anymore, remove it. + LeakDetector::removeGarbageObject(this); } -void Value::replaceAllUsesWith(Value *D) { - assert(D && "Value::replaceAllUsesWith() is invalid!"); - assert(D != this && "V->replaceAllUsesWith(V) is NOT valid!"); - while (!Uses.empty()) { - User *Use = Uses.back(); -#ifndef NDEBUG - unsigned NumUses = Uses.size(); -#endif - Use->replaceUsesOfWith(this, D); +/// 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(); -#ifndef NDEBUG // only in -g mode... - if (Uses.size() == NumUses) - cerr << "Use: " << Use << "replace with: " << D; -#endif - assert(Uses.size() != NumUses && "Didn't remove definition!"); - } + for (; N; --N, ++UI) + if (UI == E) return false; // Too few. + return UI == E; } -// refineAbstractType - This function is implemented because we use -// potentially abstract types, and these types may be resolved to more -// concrete types after we are constructed. For the value class, we simply -// change Ty to point to the right type. :) -// -void Value::refineAbstractType(const DerivedType *OldTy, const Type *NewTy) { - assert(Ty.get() == (const Type*)OldTy &&"Can't refine anything but my type!"); - Ty = NewTy; +/// 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; } -void Value::killUse(User *i) { - if (i == 0) return; - use_iterator I = find(Uses.begin(), Uses.end(), i); - assert(I != Uses.end() && "Use not in uses list!!"); - Uses.erase(I); +/// 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()); } -User *Value::use_remove(use_iterator &I) { - assert(I != Uses.end() && "Trying to remove the end of the use list!!!"); - User *i = *I; - I = Uses.erase(I); - return i; + +void Value::setName(const std::string &name) { + if (Name == name) return; // Name is already set. + + // Get the symbol table to update for this object. + SymbolTable *ST = 0; + if (Instruction *I = dyn_cast(this)) { + if (BasicBlock *P = I->getParent()) + if (Function *PP = P->getParent()) + ST = &PP->getSymbolTable(); + } else if (BasicBlock *BB = dyn_cast(this)) { + if (Function *P = BB->getParent()) ST = &P->getSymbolTable(); + } else if (GlobalValue *GV = dyn_cast(this)) { + if (Module *P = GV->getParent()) ST = &P->getSymbolTable(); + } else if (Argument *A = dyn_cast(this)) { + if (Function *P = A->getParent()) ST = &P->getSymbolTable(); + } else { + assert(isa(this) && "Unknown value type!"); + return; // no name is setable for this. + } + + if (!ST) // No symbol table to update? Just do the change. + Name = name; + else if (hasName()) { + if (!name.empty()) { // Replacing name. + ST->changeName(this, name); + } else { // Transitioning from hasName -> noname. + ST->remove(this); + Name.clear(); + } + } else { // Transitioning from noname -> hasName. + Name = name; + ST->insert(this); + } } -#ifndef NDEBUG // Only in -g mode... -void Value::dump() const { - cerr << this; +// 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) { + while (!use_empty()) { + Use &U = *UseList; + // Must handle Constants specially, we cannot call replaceUsesOfWith on a + // constant! + if (Constant *C = dyn_cast(U.getUser())) { + if (!isa(C)) + C->replaceUsesOfWithOnConstant(this, New, true); + else + U.set(New); + } else { + U.set(New); + } + } +} + +void Value::replaceAllUsesWith(Value *New) { + assert(New && "Value::replaceAllUsesWith() is invalid!"); + assert(New != this && "this->replaceAllUsesWith(this) is NOT valid!"); + assert(New->getType() == getType() && + "replaceAllUses of value with new value of different type!"); + + uncheckedReplaceAllUsesWith(New); } -#endif //===----------------------------------------------------------------------===// // User Class //===----------------------------------------------------------------------===// -User::User(const Type *Ty, ValueTy vty, const string &name) - : Value(Ty, vty, name) { -} - // 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? + assert(!isa(this) || isa(this) && + "Cannot call User::replaceUsesofWith on a constant!"); + for (unsigned i = 0, E = getNumOperands(); i != E; ++i) if (getOperand(i) == From) { // Is This operand is pointing to oldval? // The side effects of this setOperand call include linking to @@ -112,43 +181,3 @@ void User::replaceUsesOfWith(Value *From, Value *To) { } } - -//===----------------------------------------------------------------------===// -// SymTabValue Class -//===----------------------------------------------------------------------===// - -SymTabValue::SymTabValue(Value *p) : ValueParent(p) { - assert(ValueParent && "SymTavValue without parent!?!"); - ParentSymTab = SymTab = 0; -} - - -SymTabValue::~SymTabValue() { - delete SymTab; -} - -void SymTabValue::setParentSymTab(SymbolTable *ST) { - ParentSymTab = ST; - if (SymTab) - SymTab->setParentSymTab(ST); -} - -SymbolTable *SymTabValue::getSymbolTableSure() { - if (!SymTab) SymTab = new SymbolTable(ParentSymTab); - return SymTab; -} - -// hasSymbolTable() - Returns true if there is a symbol table allocated to -// this object AND if there is at least one name in it! -// -bool SymTabValue::hasSymbolTable() const { - if (!SymTab) return false; - - for (SymbolTable::const_iterator I = SymTab->begin(); - I != SymTab->end(); ++I) { - if (I->second.begin() != I->second.end()) - return true; // Found nonempty type plane! - } - - return false; -}