//===-- Value.cpp - Implement the Value class -----------------------------===//
+//
+// The LLVM Compiler Infrastructure
//
-// This file implements the Value class.
+// 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/InstrTypes.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/DerivedTypes.h"
+#include "llvm/Constant.h"
+#include "llvm/GlobalValue.h"
+#include "llvm/Support/LeakDetector.h"
#include <algorithm>
+#include <iostream>
+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), Ty(checkType(ty)), Name(name) {
+ if (!isa<Constant>(this) && !isa<BasicBlock>(this))
+ assert((Ty->isFirstClassType() || Ty == Type::VoidTy ||
+ isa<OpaqueType>(ty)) &&
+ "Cannot create non-first-class values except for constants!");
+ if (ty == Type::VoidTy)
+ assert(name.empty() && "Cannot have named void values!");
}
Value::~Value() {
// a <badref>
//
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;
+ std::cerr << "While deleting: " << *Ty << "%" << Name << "\n";
+ for (use_const_iterator I = Uses.begin(), E = Uses.end(); I != E; ++I)
+ std::cerr << "Use still stuck around after Def is destroyed:"
+ << **I << "\n";
}
#endif
- assert(Uses.begin() == Uses.end());
-}
-
-void Value::replaceAllUsesWith(Value *D) {
- assert(D && "Value::replaceAllUsesWith(<null>) is invalid!");
- assert(D != this && "V->replaceAllUsesWith(V) is NOT valid!");
- while (!Uses.empty()) {
- User *Use = Uses.front();
-#ifndef NDEBUG
- unsigned NumUses = Uses.size();
-#endif
- Use->replaceUsesOfWith(this, D);
+ assert(Uses.begin() == Uses.end() &&"Uses remain when a value is destroyed!");
-#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!");
- }
+ // There should be no uses of this object anymore, remove it.
+ LeakDetector::removeGarbageObject(this);
}
-// 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. :)
+
+// 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::refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
- assert(Ty.get() == (const Type*)OldTy &&"Can't refine anything but my type!");
- Ty = NewTy;
+void Value::uncheckedReplaceAllUsesWith(Value *New) {
+ while (!Uses.empty()) {
+ Use &U = Uses.back();
+ // Must handle Constants specially, we cannot call replaceUsesOfWith on a
+ // constant!
+ if (Constant *C = dyn_cast<Constant>(U.getUser())) {
+ if (!isa<GlobalValue>(C))
+ C->replaceUsesOfWithOnConstant(this, New, true);
+ else
+ U.set(New);
+ } else {
+ U.set(New);
+ }
+ }
}
-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);
-}
+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!");
-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;
+ uncheckedReplaceAllUsesWith(New);
}
-
//===----------------------------------------------------------------------===//
// 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<Constant>(this) || isa<GlobalValue>(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
}
}
-
-//===----------------------------------------------------------------------===//
-// 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;
-}
projects / oota-llvm.git / blobdiff