//===-- llvm/Value.h - Definition of the Value class ------------*- C++ -*-===//
//
+// 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 defines the very important Value class. This is subclassed by a
// bunch of other important classes, like Instruction, Function, Type, etc...
//
#define LLVM_VALUE_H
#include "llvm/AbstractTypeUser.h"
-#include "Support/Annotation.h"
-#include "Support/Casting.h"
-#include <iostream>
-#include <vector>
+#include "llvm/Use.h"
+#include "llvm/Support/Casting.h"
+#include <string>
+
+namespace llvm {
-class User;
-class Type;
class Constant;
class Argument;
class Instruction;
/// Value - The base class of all values computed by a program that may be used
/// as operands to other values.
///
-struct Value : public Annotable { // Values are annotable
- enum ValueTy {
- TypeVal, // This is an instance of Type
- ConstantVal, // This is an instance of Constant
- ArgumentVal, // This is an instance of Argument
- InstructionVal, // This is an instance of Instruction
- BasicBlockVal, // This is an instance of BasicBlock
- FunctionVal, // This is an instance of Function
- GlobalVariableVal, // This is an instance of GlobalVariable
- };
-
+class Value {
+ unsigned short SubclassID; // Subclass identifier (for isa/dyn_cast)
+protected:
+ /// SubclassData - This member is defined by this class, but is not used for
+ /// anything. Subclasses can use it to hold whatever state they find useful.
+ /// This field is initialized to zero by the ctor.
+ unsigned short SubclassData;
private:
- std::vector<User *> Uses;
- std::string Name;
PATypeHolder Ty;
- ValueTy VTy;
+ Use *UseList;
+
+ friend class SymbolTable; // Allow SymbolTable to directly poke Name.
+ std::string Name;
void operator=(const Value &); // Do not implement
Value(const Value &); // Do not implement
+
public:
- Value(const Type *Ty, ValueTy vty, const std::string &name = "");
+ Value(const Type *Ty, unsigned scid, const std::string &name = "");
virtual ~Value();
-
+
/// dump - Support for debugging, callable in GDB: V->dump()
//
virtual void dump() const;
/// print - Implement operator<< on Value...
///
virtual void print(std::ostream &O) const = 0;
-
+
/// All values are typed, get the type of this value.
///
inline const Type *getType() const { return Ty; }
-
+
// All values can potentially be named...
- inline bool hasName() const { return Name != ""; }
+ inline bool hasName() const { return !Name.empty(); }
inline const std::string &getName() const { return Name; }
- virtual void setName(const std::string &name, SymbolTable * = 0) {
- Name = name;
- }
-
- /// getValueType - Return the immediate subclass of this Value.
- ///
- inline ValueTy getValueType() const { return VTy; }
-
+ void setName(const std::string &name);
+
/// replaceAllUsesWith - Go through the uses list for this definition and make
- /// each use point to "V" instead of "this". After this completes, 'this's
+ /// each use point to "V" instead of "this". After this completes, 'this's
/// use list is guaranteed to be empty.
///
void replaceAllUsesWith(Value *V);
//----------------------------------------------------------------------
// Methods for handling the vector of uses of this Value.
//
- typedef std::vector<User*>::iterator use_iterator;
- typedef std::vector<User*>::const_iterator use_const_iterator;
-
- unsigned use_size() const { return Uses.size(); }
- bool use_empty() const { return Uses.empty(); }
- use_iterator use_begin() { return Uses.begin(); }
- use_const_iterator use_begin() const { return Uses.begin(); }
- use_iterator use_end() { return Uses.end(); }
- use_const_iterator use_end() const { return Uses.end(); }
- User *use_back() { return Uses.back(); }
- const User *use_back() const { return Uses.back(); }
-
- /// hasOneUse - Return true if there is exactly one user of this value.
+ typedef value_use_iterator<User> use_iterator;
+ typedef value_use_iterator<const User> use_const_iterator;
+
+ bool use_empty() const { return UseList == 0; }
+ use_iterator use_begin() { return use_iterator(UseList); }
+ use_const_iterator use_begin() const { return use_const_iterator(UseList); }
+ use_iterator use_end() { return use_iterator(0); }
+ use_const_iterator use_end() const { return use_const_iterator(0); }
+ User *use_back() { return *use_begin(); }
+ const User *use_back() const { return *use_begin(); }
+
+ /// hasOneUse - Return true if there is exactly one user of this value. This
+ /// is specialized because it is a common request and does not require
+ /// traversing the whole use list.
///
- bool hasOneUse() const { return use_size() == 1; }
-
- /// addUse/killUse - These two methods should only be used by the Use class
- /// below.
- void addUse(User *I) { Uses.push_back(I); }
- void killUse(User *I);
-};
-
-inline std::ostream &operator<<(std::ostream &OS, const Value *V) {
- if (V == 0)
- OS << "<null> value!\n";
- else
- V->print(OS);
- return OS;
-}
+ bool hasOneUse() const {
+ use_const_iterator I = use_begin(), E = use_end();
+ if (I == E) return false;
+ return ++I == E;
+ }
-inline std::ostream &operator<<(std::ostream &OS, const Value &V) {
- V.print(OS);
- return OS;
-}
+ /// hasNUses - Return true if this Value has exactly N users.
+ ///
+ bool hasNUses(unsigned N) const;
+ /// hasNUsesOrMore - Return true if this value has N users or more. This is
+ /// logically equivalent to getNumUses() >= N.
+ ///
+ bool hasNUsesOrMore(unsigned N) const;
-//===----------------------------------------------------------------------===//
-// Use Class
-//===----------------------------------------------------------------------===//
+ /// getNumUses - This method computes the number of uses of this Value. This
+ /// is a linear time operation. Use hasOneUse, hasNUses, or hasMoreThanNUses
+ /// to check for specific values.
+ unsigned getNumUses() const;
-// Use is here to make keeping the "use" list of a Value up-to-date really easy.
-//
-class Use {
- Value *Val;
- User *U;
-public:
- inline Use(Value *v, User *user) {
- Val = v; U = user;
- if (Val) Val->addUse(U);
+ /// addUse/killUse - These two methods should only be used by the Use class.
+ ///
+ void addUse(Use &U) { U.addToList(&UseList); }
+
+ /// getValueType - Return an ID for the concrete type of this object. This is
+ /// used to implement the classof checks. This should not be used for any
+ /// other purpose, as the values may change as LLVM evolves. Also, note that
+ /// starting with the InstructionVal value, the value stored is actually the
+ /// Instruction opcode, so there are more than just these values possible here
+ /// (and Instruction must be last).
+ ///
+ enum ValueTy {
+ ArgumentVal, // This is an instance of Argument
+ BasicBlockVal, // This is an instance of BasicBlock
+ FunctionVal, // This is an instance of Function
+ GlobalVariableVal, // This is an instance of GlobalVariable
+ UndefValueVal, // This is an instance of UndefValue
+ ConstantExprVal, // This is an instance of ConstantExpr
+ ConstantAggregateZeroVal, // This is an instance of ConstantAggregateNull
+ SimpleConstantVal, // This is some other type of Constant
+ InstructionVal, // This is an instance of Instruction
+ };
+ unsigned getValueType() const {
+ return SubclassID;
}
- inline Use(const Use &user) {
- Val = 0;
- U = user.U;
- operator=(user.Val);
+ // Methods for support type inquiry through isa, cast, and dyn_cast:
+ static inline bool classof(const Value *V) {
+ return true; // Values are always values.
}
- inline ~Use() { if (Val) Val->killUse(U); }
- inline operator Value*() const { return Val; }
-
- inline Value *operator=(Value *V) {
- if (Val) Val->killUse(U);
- Val = V;
- if (V) V->addUse(U);
- return V;
- }
-
- inline Value *operator->() { return Val; }
- inline const Value *operator->() const { return Val; }
- inline Value *get() { return Val; }
- inline const Value *get() const { return Val; }
+ /// getRawType - This should only be used to implement the vmcore library.
+ ///
+ const Type *getRawType() const { return Ty.getRawType(); }
- inline const Use &operator=(const Use &user) {
- if (Val) Val->killUse(U);
- Val = user.Val;
- Val->addUse(U);
- return *this;
- }
+private:
+ /// FIXME: this is a gross hack, needed by another gross hack. Eliminate!
+ void setValueType(unsigned VT) { SubclassID = VT; }
+ friend class Instruction;
};
-template<> struct simplify_type<Use> {
- typedef Value* SimpleType;
-
- static SimpleType getSimplifiedValue(const Use &Val) {
- return (SimpleType)Val.get();
- }
-};
-template<> struct simplify_type<const Use> {
- typedef Value* SimpleType;
-
- static SimpleType getSimplifiedValue(const Use &Val) {
- return (SimpleType)Val.get();
- }
-};
+inline std::ostream &operator<<(std::ostream &OS, const Value &V) {
+ V.print(OS);
+ return OS;
+}
+
+void Use::init(Value *v, User *user) {
+ Val = v;
+ U = user;
+ if (Val) Val->addUse(*this);
+}
+
+Use::~Use() {
+ if (Val) removeFromList();
+}
+
+void Use::set(Value *V) {
+ if (Val) removeFromList();
+ Val = V;
+ if (V) V->addUse(*this);
+}
+
// isa - Provide some specializations of isa so that we don't have to include
// the subtype header files to test to see if the value is a subclass...
//
-template <> inline bool isa_impl<Type, Value>(const Value &Val) {
- return Val.getValueType() == Value::TypeVal;
-}
-template <> inline bool isa_impl<Constant, Value>(const Value &Val) {
- return Val.getValueType() == Value::ConstantVal;
+template <> inline bool isa_impl<Constant, Value>(const Value &Val) {
+ return Val.getValueType() == Value::SimpleConstantVal ||
+ Val.getValueType() == Value::FunctionVal ||
+ Val.getValueType() == Value::GlobalVariableVal ||
+ Val.getValueType() == Value::ConstantExprVal ||
+ Val.getValueType() == Value::ConstantAggregateZeroVal ||
+ Val.getValueType() == Value::UndefValueVal;
}
-template <> inline bool isa_impl<Argument, Value>(const Value &Val) {
+template <> inline bool isa_impl<Argument, Value>(const Value &Val) {
return Val.getValueType() == Value::ArgumentVal;
}
-template <> inline bool isa_impl<Instruction, Value>(const Value &Val) {
- return Val.getValueType() == Value::InstructionVal;
+template <> inline bool isa_impl<Instruction, Value>(const Value &Val) {
+ return Val.getValueType() >= Value::InstructionVal;
}
-template <> inline bool isa_impl<BasicBlock, Value>(const Value &Val) {
+template <> inline bool isa_impl<BasicBlock, Value>(const Value &Val) {
return Val.getValueType() == Value::BasicBlockVal;
}
-template <> inline bool isa_impl<Function, Value>(const Value &Val) {
+template <> inline bool isa_impl<Function, Value>(const Value &Val) {
return Val.getValueType() == Value::FunctionVal;
}
-template <> inline bool isa_impl<GlobalVariable, Value>(const Value &Val) {
+template <> inline bool isa_impl<GlobalVariable, Value>(const Value &Val) {
return Val.getValueType() == Value::GlobalVariableVal;
}
-template <> inline bool isa_impl<GlobalValue, Value>(const Value &Val) {
+template <> inline bool isa_impl<GlobalValue, Value>(const Value &Val) {
return isa<GlobalVariable>(Val) || isa<Function>(Val);
}
+} // End llvm namespace
+
#endif