2003-09-30 20:37:50 +02:00
|
|
|
//===-- llvm/Value.h - Definition of the Value class ------------*- C++ -*-===//
|
2005-04-21 22:19:05 +02:00
|
|
|
//
|
2003-10-20 22:19:47 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:59:42 +01:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 22:19:05 +02:00
|
|
|
//
|
2003-10-20 22:19:47 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-06 22:29:01 +02:00
|
|
|
//
|
2006-06-05 18:29:06 +02:00
|
|
|
// This file declares the Value class.
|
2001-10-01 15:58:13 +02:00
|
|
|
//
|
2001-06-06 22:29:01 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_VALUE_H
|
|
|
|
#define LLVM_VALUE_H
|
|
|
|
|
2001-09-07 18:25:23 +02:00
|
|
|
#include "llvm/AbstractTypeUser.h"
|
2003-10-16 18:53:04 +02:00
|
|
|
#include "llvm/Use.h"
|
2009-07-23 20:50:53 +02:00
|
|
|
#include "llvm/ADT/StringRef.h"
|
2004-09-02 00:55:40 +02:00
|
|
|
#include "llvm/Support/Casting.h"
|
2004-07-12 22:25:33 +02:00
|
|
|
#include <string>
|
2001-06-06 22:29:01 +02:00
|
|
|
|
2003-11-11 23:41:34 +01:00
|
|
|
namespace llvm {
|
|
|
|
|
2001-12-03 23:26:30 +01:00
|
|
|
class Constant;
|
2002-04-09 21:59:31 +02:00
|
|
|
class Argument;
|
2001-06-28 01:27:42 +02:00
|
|
|
class Instruction;
|
2004-10-27 18:14:51 +02:00
|
|
|
class BasicBlock;
|
2001-10-03 16:53:21 +02:00
|
|
|
class GlobalValue;
|
2002-03-23 23:51:58 +01:00
|
|
|
class Function;
|
2001-09-10 09:58:01 +02:00
|
|
|
class GlobalVariable;
|
2007-04-25 16:27:10 +02:00
|
|
|
class GlobalAlias;
|
2006-01-26 02:54:21 +01:00
|
|
|
class InlineAsm;
|
2007-02-05 21:47:22 +01:00
|
|
|
class ValueSymbolTable;
|
|
|
|
class TypeSymbolTable;
|
2007-02-12 06:18:08 +01:00
|
|
|
template<typename ValueTy> class StringMapEntry;
|
2009-04-03 02:10:31 +02:00
|
|
|
template <typename ValueTy = Value>
|
|
|
|
class AssertingVH;
|
2009-08-05 01:07:12 +02:00
|
|
|
typedef StringMapEntry<Value*> ValueName;
|
2008-08-24 00:23:09 +02:00
|
|
|
class raw_ostream;
|
2008-08-24 20:38:56 +02:00
|
|
|
class AssemblyAnnotationWriter;
|
2009-04-01 00:11:05 +02:00
|
|
|
class ValueHandleBase;
|
2009-08-11 19:45:13 +02:00
|
|
|
class LLVMContext;
|
2009-12-29 08:12:03 +01:00
|
|
|
class Twine;
|
2009-12-31 02:32:41 +01:00
|
|
|
class MDNode;
|
2001-06-06 22:29:01 +02:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Value Class
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-06-05 18:29:06 +02:00
|
|
|
/// This is a very important LLVM class. It is the base class of all values
|
|
|
|
/// computed by a program that may be used as operands to other values. Value is
|
|
|
|
/// the super class of other important classes such as Instruction and Function.
|
|
|
|
/// All Values have a Type. Type is not a subclass of Value. All types can have
|
|
|
|
/// a name and they should belong to some Module. Setting the name on the Value
|
2008-03-14 23:03:02 +01:00
|
|
|
/// automatically updates the module's symbol table.
|
2002-08-26 00:54:55 +02:00
|
|
|
///
|
2006-06-05 18:29:06 +02:00
|
|
|
/// Every value has a "use list" that keeps track of which other Values are
|
2009-04-01 00:11:05 +02:00
|
|
|
/// using this Value. A Value can also have an arbitrary number of ValueHandle
|
2009-12-29 03:14:09 +01:00
|
|
|
/// objects that watch it and listen to RAUW and Destroy events. See
|
2009-04-01 00:11:05 +02:00
|
|
|
/// llvm/Support/ValueHandle.h for details.
|
|
|
|
///
|
2006-06-05 18:29:06 +02:00
|
|
|
/// @brief LLVM Value Representation
|
2004-09-23 16:49:45 +02:00
|
|
|
class Value {
|
2009-03-31 09:25:22 +02:00
|
|
|
const unsigned char SubclassID; // Subclass identifier (for isa/dyn_cast)
|
2009-04-01 00:11:05 +02:00
|
|
|
unsigned char HasValueHandle : 1; // Has a ValueHandle pointing to this?
|
2005-02-05 02:37:44 +01:00
|
|
|
protected:
|
2009-07-17 19:16:59 +02:00
|
|
|
/// SubclassOptionalData - This member is similar to SubclassData, however it
|
|
|
|
/// is for holding information which may be used to aid optimization, but
|
|
|
|
/// which may be cleared to zero without affecting conservative
|
|
|
|
/// interpretation.
|
|
|
|
unsigned char SubclassOptionalData : 7;
|
|
|
|
|
2009-12-29 03:14:09 +01:00
|
|
|
private:
|
2005-02-05 02:37:44 +01:00
|
|
|
/// 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;
|
2009-12-29 03:14:09 +01:00
|
|
|
|
2008-07-24 02:08:56 +02:00
|
|
|
PATypeHolder VTy;
|
2005-02-01 02:22:06 +01:00
|
|
|
Use *UseList;
|
2005-03-06 03:10:40 +01:00
|
|
|
|
2006-01-10 10:45:57 +01:00
|
|
|
friend class ValueSymbolTable; // Allow ValueSymbolTable to directly mod Name.
|
2009-04-01 00:11:05 +02:00
|
|
|
friend class ValueHandleBase;
|
2009-09-15 17:58:07 +02:00
|
|
|
friend class AbstractTypeUser;
|
2007-02-12 06:18:08 +01:00
|
|
|
ValueName *Name;
|
2001-06-06 22:29:01 +02:00
|
|
|
|
2002-07-24 22:01:57 +02:00
|
|
|
void operator=(const Value &); // Do not implement
|
2001-06-06 22:29:01 +02:00
|
|
|
Value(const Value &); // Do not implement
|
2004-06-26 22:33:27 +02:00
|
|
|
|
2009-09-23 03:33:16 +02:00
|
|
|
protected:
|
|
|
|
/// printCustom - Value subclasses can override this to implement custom
|
|
|
|
/// printing behavior.
|
|
|
|
virtual void printCustom(raw_ostream &O) const;
|
|
|
|
|
2001-06-06 22:29:01 +02:00
|
|
|
public:
|
2007-02-12 06:18:08 +01:00
|
|
|
Value(const Type *Ty, unsigned scid);
|
2001-06-06 22:29:01 +02:00
|
|
|
virtual ~Value();
|
2005-04-21 22:19:05 +02:00
|
|
|
|
2002-08-26 00:54:55 +02:00
|
|
|
/// dump - Support for debugging, callable in GDB: V->dump()
|
|
|
|
//
|
2009-09-23 03:33:16 +02:00
|
|
|
void dump() const;
|
2002-04-08 23:51:32 +02:00
|
|
|
|
2008-08-24 00:23:09 +02:00
|
|
|
/// print - Implement operator<< on Value.
|
2002-08-26 00:54:55 +02:00
|
|
|
///
|
2008-08-24 00:23:09 +02:00
|
|
|
void print(raw_ostream &O, AssemblyAnnotationWriter *AAW = 0) const;
|
2005-04-21 22:19:05 +02:00
|
|
|
|
2002-08-26 00:54:55 +02:00
|
|
|
/// All values are typed, get the type of this value.
|
|
|
|
///
|
2008-07-24 02:08:56 +02:00
|
|
|
inline const Type *getType() const { return VTy; }
|
2005-04-21 22:19:05 +02:00
|
|
|
|
2009-07-22 02:24:57 +02:00
|
|
|
/// All values hold a context through their type.
|
|
|
|
LLVMContext &getContext() const;
|
|
|
|
|
2001-06-28 01:27:42 +02:00
|
|
|
// All values can potentially be named...
|
2007-02-12 06:18:08 +01:00
|
|
|
inline bool hasName() const { return Name != 0; }
|
2007-08-10 17:34:35 +02:00
|
|
|
ValueName *getValueName() const { return Name; }
|
|
|
|
|
2009-07-26 02:51:56 +02:00
|
|
|
/// getName() - Return a constant reference to the value's name. This is cheap
|
|
|
|
/// and guaranteed to return the same reference as long as the value is not
|
|
|
|
/// modified.
|
2009-07-28 00:39:14 +02:00
|
|
|
///
|
|
|
|
/// This is currently guaranteed to return a StringRef for which data() points
|
2009-07-29 00:30:52 +02:00
|
|
|
/// to a valid null terminated string. The use of StringRef.data() is
|
|
|
|
/// deprecated here, however, and clients should not rely on it. If such
|
|
|
|
/// behavior is needed, clients should use expensive getNameStr(), or switch
|
|
|
|
/// to an interface that does not depend on null termination.
|
2009-07-26 02:51:56 +02:00
|
|
|
StringRef getName() const;
|
|
|
|
|
|
|
|
/// getNameStr() - Return the name of the specified value, *constructing a
|
|
|
|
/// string* to hold it. This is guaranteed to construct a string and is very
|
|
|
|
/// expensive, clients should use getName() unless necessary.
|
2007-02-15 19:53:54 +01:00
|
|
|
std::string getNameStr() const;
|
2001-09-18 19:03:04 +02:00
|
|
|
|
2009-07-26 02:34:27 +02:00
|
|
|
/// setName() - Change the name of the value, choosing a new unique name if
|
|
|
|
/// the provided name is taken.
|
|
|
|
///
|
|
|
|
/// \arg Name - The new name; or "" if the value's name should be removed.
|
2009-07-25 06:41:11 +02:00
|
|
|
void setName(const Twine &Name);
|
2007-02-13 08:53:34 +01:00
|
|
|
|
2007-02-11 01:37:27 +01: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 takeName(Value *V);
|
2005-04-21 22:19:05 +02:00
|
|
|
|
2002-08-26 00:54:55 +02:00
|
|
|
/// replaceAllUsesWith - Go through the uses list for this definition and make
|
2005-04-21 22:19:05 +02:00
|
|
|
/// each use point to "V" instead of "this". After this completes, 'this's
|
2002-08-26 00:54:55 +02:00
|
|
|
/// use list is guaranteed to be empty.
|
|
|
|
///
|
|
|
|
void replaceAllUsesWith(Value *V);
|
2001-06-06 22:29:01 +02:00
|
|
|
|
2003-08-29 07:08:31 +02:00
|
|
|
// uncheckedReplaceAllUsesWith - Just like replaceAllUsesWith but dangerous.
|
|
|
|
// Only use when in type resolution situations!
|
|
|
|
void uncheckedReplaceAllUsesWith(Value *V);
|
|
|
|
|
2001-06-06 22:29:01 +02:00
|
|
|
//----------------------------------------------------------------------
|
2008-09-13 20:51:27 +02:00
|
|
|
// Methods for handling the chain of uses of this Value.
|
2001-06-06 22:29:01 +02:00
|
|
|
//
|
2005-02-01 02:22:06 +01:00
|
|
|
typedef value_use_iterator<User> use_iterator;
|
2010-03-26 00:06:16 +01:00
|
|
|
typedef value_use_iterator<const User> const_use_iterator;
|
2005-02-01 02:22:06 +01:00
|
|
|
|
2008-09-19 17:13:20 +02:00
|
|
|
bool use_empty() const { return UseList == 0; }
|
2005-02-01 02:22:06 +01:00
|
|
|
use_iterator use_begin() { return use_iterator(UseList); }
|
2010-03-26 00:06:16 +01:00
|
|
|
const_use_iterator use_begin() const { return const_use_iterator(UseList); }
|
2005-02-01 02:22:06 +01:00
|
|
|
use_iterator use_end() { return use_iterator(0); }
|
2010-03-26 00:06:16 +01:00
|
|
|
const_use_iterator use_end() const { return const_use_iterator(0); }
|
2005-02-01 02:22:06 +01:00
|
|
|
User *use_back() { return *use_begin(); }
|
2008-09-13 20:51:27 +02:00
|
|
|
const User *use_back() const { return *use_begin(); }
|
2003-10-15 18:39:04 +02:00
|
|
|
|
2003-10-16 18:53:04 +02:00
|
|
|
/// 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.
|
2003-10-15 18:39:04 +02:00
|
|
|
///
|
2003-10-16 18:53:04 +02:00
|
|
|
bool hasOneUse() const {
|
2010-03-26 00:06:16 +01:00
|
|
|
const_use_iterator I = use_begin(), E = use_end();
|
2003-10-16 18:53:04 +02:00
|
|
|
if (I == E) return false;
|
|
|
|
return ++I == E;
|
|
|
|
}
|
2001-06-06 22:29:01 +02:00
|
|
|
|
2005-02-01 02:22:06 +01:00
|
|
|
/// hasNUses - Return true if this Value has exactly N users.
|
|
|
|
///
|
|
|
|
bool hasNUses(unsigned N) const;
|
|
|
|
|
2005-02-23 17:50:59 +01:00
|
|
|
/// hasNUsesOrMore - Return true if this value has N users or more. This is
|
|
|
|
/// logically equivalent to getNumUses() >= N.
|
|
|
|
///
|
|
|
|
bool hasNUsesOrMore(unsigned N) const;
|
|
|
|
|
2008-09-26 00:42:01 +02:00
|
|
|
bool isUsedInBasicBlock(const BasicBlock *BB) const;
|
2008-06-12 23:15:59 +02:00
|
|
|
|
2005-02-01 02:22:06 +01:00
|
|
|
/// getNumUses - This method computes the number of uses of this Value. This
|
2005-02-23 17:50:59 +01:00
|
|
|
/// is a linear time operation. Use hasOneUse, hasNUses, or hasMoreThanNUses
|
|
|
|
/// to check for specific values.
|
2005-02-01 02:22:06 +01:00
|
|
|
unsigned getNumUses() const;
|
|
|
|
|
2008-03-07 23:24:41 +01:00
|
|
|
/// addUse - This method should only be used by the Use class.
|
2003-10-16 18:53:04 +02:00
|
|
|
///
|
2005-02-01 02:22:06 +01:00
|
|
|
void addUse(Use &U) { U.addToList(&UseList); }
|
2004-06-26 22:33:27 +02:00
|
|
|
|
2006-06-05 18:29:06 +02:00
|
|
|
/// An enumeration for keeping track of the concrete subclass of Value that
|
|
|
|
/// is actually instantiated. Values of this enumeration are kept in the
|
|
|
|
/// Value classes SubclassID field. They are used for concrete type
|
|
|
|
/// identification.
|
2004-06-26 22:33:27 +02:00
|
|
|
enum ValueTy {
|
2004-07-19 02:57:40 +02:00
|
|
|
ArgumentVal, // This is an instance of Argument
|
|
|
|
BasicBlockVal, // This is an instance of BasicBlock
|
|
|
|
FunctionVal, // This is an instance of Function
|
2007-04-25 16:27:10 +02:00
|
|
|
GlobalAliasVal, // This is an instance of GlobalAlias
|
2004-07-19 02:57:40 +02:00
|
|
|
GlobalVariableVal, // This is an instance of GlobalVariable
|
2004-10-16 20:06:07 +02:00
|
|
|
UndefValueVal, // This is an instance of UndefValue
|
2009-10-28 01:01:44 +01:00
|
|
|
BlockAddressVal, // This is an instance of BlockAddress
|
2004-07-19 02:57:40 +02:00
|
|
|
ConstantExprVal, // This is an instance of ConstantExpr
|
2010-05-29 08:11:16 +02:00
|
|
|
ConstantAggregateZeroVal, // This is an instance of ConstantAggregateZero
|
2006-10-20 09:07:24 +02:00
|
|
|
ConstantIntVal, // This is an instance of ConstantInt
|
2005-09-27 08:08:32 +02:00
|
|
|
ConstantFPVal, // This is an instance of ConstantFP
|
|
|
|
ConstantArrayVal, // This is an instance of ConstantArray
|
|
|
|
ConstantStructVal, // This is an instance of ConstantStruct
|
2010-02-12 21:49:41 +01:00
|
|
|
ConstantUnionVal, // This is an instance of ConstantUnion
|
2007-02-15 04:39:18 +01:00
|
|
|
ConstantVectorVal, // This is an instance of ConstantVector
|
2005-09-27 08:08:32 +02:00
|
|
|
ConstantPointerNullVal, // This is an instance of ConstantPointerNull
|
2009-04-04 09:22:01 +02:00
|
|
|
MDNodeVal, // This is an instance of MDNode
|
2009-07-22 19:43:22 +02:00
|
|
|
MDStringVal, // This is an instance of MDString
|
2009-07-29 02:33:07 +02:00
|
|
|
NamedMDNodeVal, // This is an instance of NamedMDNode
|
2006-01-24 05:13:11 +01:00
|
|
|
InlineAsmVal, // This is an instance of InlineAsm
|
2008-02-06 23:27:42 +01:00
|
|
|
PseudoSourceValueVal, // This is an instance of PseudoSourceValue
|
2009-11-12 22:04:19 +01:00
|
|
|
FixedStackPseudoSourceValueVal, // This is an instance of
|
|
|
|
// FixedStackPseudoSourceValue
|
2009-11-13 23:24:13 +01:00
|
|
|
InstructionVal, // This is an instance of Instruction
|
|
|
|
// Enum values starting at InstructionVal are used for Instructions;
|
|
|
|
// don't add new values here!
|
2009-11-12 22:04:19 +01:00
|
|
|
|
2005-09-27 08:08:32 +02:00
|
|
|
// Markers:
|
|
|
|
ConstantFirstVal = FunctionVal,
|
2009-07-23 03:07:34 +02:00
|
|
|
ConstantLastVal = ConstantPointerNullVal
|
2004-06-26 22:33:27 +02:00
|
|
|
};
|
2006-06-05 18:29:06 +02:00
|
|
|
|
2007-04-13 20:12:09 +02:00
|
|
|
/// getValueID - Return an ID for the concrete type of this object. This is
|
2006-06-05 18:29:06 +02:00
|
|
|
/// 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
|
2007-03-06 00:06:32 +01:00
|
|
|
/// for instructions, the Instruction's opcode is added to InstructionVal. So
|
|
|
|
/// this means three things:
|
|
|
|
/// # there is no value with code InstructionVal (no opcode==0).
|
|
|
|
/// # there are more possible values for the value type than in ValueTy enum.
|
|
|
|
/// # the InstructionVal enumerator must be the highest valued enumerator in
|
|
|
|
/// the ValueTy enum.
|
2007-04-13 20:12:09 +02:00
|
|
|
unsigned getValueID() const {
|
2004-06-26 22:33:27 +02:00
|
|
|
return SubclassID;
|
|
|
|
}
|
2004-06-27 20:38:24 +02:00
|
|
|
|
2009-09-08 01:54:19 +02:00
|
|
|
/// getRawSubclassOptionalData - Return the raw optional flags value
|
|
|
|
/// contained in this value. This should only be used when testing two
|
|
|
|
/// Values for equivalence.
|
|
|
|
unsigned getRawSubclassOptionalData() const {
|
|
|
|
return SubclassOptionalData;
|
|
|
|
}
|
|
|
|
|
2009-08-26 00:11:20 +02:00
|
|
|
/// hasSameSubclassOptionalData - Test whether the optional flags contained
|
|
|
|
/// in this value are equal to the optional flags in the given value.
|
|
|
|
bool hasSameSubclassOptionalData(const Value *V) const {
|
|
|
|
return SubclassOptionalData == V->SubclassOptionalData;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// intersectOptionalDataWith - Clear any optional flags in this value
|
|
|
|
/// that are not also set in the given value.
|
|
|
|
void intersectOptionalDataWith(const Value *V) {
|
|
|
|
SubclassOptionalData &= V->SubclassOptionalData;
|
|
|
|
}
|
|
|
|
|
2004-07-30 08:59:15 +02:00
|
|
|
// Methods for support type inquiry through isa, cast, and dyn_cast:
|
2006-01-24 05:13:11 +01:00
|
|
|
static inline bool classof(const Value *) {
|
2004-07-30 08:59:15 +02:00
|
|
|
return true; // Values are always values.
|
|
|
|
}
|
|
|
|
|
2004-08-04 06:45:42 +02:00
|
|
|
/// getRawType - This should only be used to implement the vmcore library.
|
|
|
|
///
|
2008-07-24 02:08:56 +02:00
|
|
|
const Type *getRawType() const { return VTy.getRawType(); }
|
2008-05-08 00:54:15 +02:00
|
|
|
|
|
|
|
/// stripPointerCasts - This method strips off any unneeded pointer
|
|
|
|
/// casts from the specified value, returning the original uncasted value.
|
2008-10-01 17:25:41 +02:00
|
|
|
/// Note that the returned value has pointer type if the specified value does.
|
2008-05-08 00:54:15 +02:00
|
|
|
Value *stripPointerCasts();
|
2008-06-16 08:43:06 +02:00
|
|
|
const Value *stripPointerCasts() const {
|
|
|
|
return const_cast<Value*>(this)->stripPointerCasts();
|
|
|
|
}
|
2008-10-01 17:25:41 +02:00
|
|
|
|
|
|
|
/// getUnderlyingObject - This method strips off any GEP address adjustments
|
|
|
|
/// and pointer casts from the specified value, returning the original object
|
|
|
|
/// being addressed. Note that the returned value has pointer type if the
|
2010-01-25 19:26:54 +01:00
|
|
|
/// specified value does. If the MaxLookup value is non-zero, it limits the
|
|
|
|
/// number of instructions to be stripped off.
|
|
|
|
Value *getUnderlyingObject(unsigned MaxLookup = 6);
|
|
|
|
const Value *getUnderlyingObject(unsigned MaxLookup = 6) const {
|
|
|
|
return const_cast<Value*>(this)->getUnderlyingObject(MaxLookup);
|
2008-10-01 17:25:41 +02:00
|
|
|
}
|
2008-12-02 08:16:45 +01:00
|
|
|
|
2008-12-02 19:33:11 +01:00
|
|
|
/// DoPHITranslation - If this value is a PHI node with CurBB as its parent,
|
2008-12-02 08:16:45 +01: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 *DoPHITranslation(const BasicBlock *CurBB, const BasicBlock *PredBB);
|
|
|
|
|
|
|
|
const Value *DoPHITranslation(const BasicBlock *CurBB,
|
|
|
|
const BasicBlock *PredBB) const{
|
|
|
|
return const_cast<Value*>(this)->DoPHITranslation(CurBB, PredBB);
|
|
|
|
}
|
2009-12-29 03:14:09 +01:00
|
|
|
|
|
|
|
protected:
|
|
|
|
unsigned short getSubclassDataFromValue() const { return SubclassData; }
|
|
|
|
void setValueSubclassData(unsigned short D) { SubclassData = D; }
|
2001-06-06 22:29:01 +02:00
|
|
|
};
|
|
|
|
|
2008-08-24 00:23:09 +02:00
|
|
|
inline raw_ostream &operator<<(raw_ostream &OS, const Value &V) {
|
|
|
|
V.print(OS);
|
|
|
|
return OS;
|
|
|
|
}
|
|
|
|
|
2005-04-21 22:19:05 +02:00
|
|
|
void Use::set(Value *V) {
|
2008-09-19 17:13:20 +02:00
|
|
|
if (Val) removeFromList();
|
|
|
|
Val = V;
|
2003-10-16 18:53:04 +02:00
|
|
|
if (V) V->addUse(*this);
|
|
|
|
}
|
2001-06-06 22:29:01 +02:00
|
|
|
|
2001-10-01 20:26:53 +02:00
|
|
|
|
2002-04-08 23:51:32 +02:00
|
|
|
// 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...
|
2001-10-01 20:26:53 +02:00
|
|
|
//
|
2010-03-30 20:05:52 +02:00
|
|
|
template <> struct isa_impl<Constant, Value> {
|
|
|
|
static inline bool doit(const Value &Val) {
|
|
|
|
return Val.getValueID() >= Value::ConstantFirstVal &&
|
|
|
|
Val.getValueID() <= Value::ConstantLastVal;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct isa_impl<Argument, Value> {
|
|
|
|
static inline bool doit (const Value &Val) {
|
|
|
|
return Val.getValueID() == Value::ArgumentVal;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct isa_impl<InlineAsm, Value> {
|
|
|
|
static inline bool doit(const Value &Val) {
|
|
|
|
return Val.getValueID() == Value::InlineAsmVal;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct isa_impl<Instruction, Value> {
|
|
|
|
static inline bool doit(const Value &Val) {
|
|
|
|
return Val.getValueID() >= Value::InstructionVal;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct isa_impl<BasicBlock, Value> {
|
|
|
|
static inline bool doit(const Value &Val) {
|
|
|
|
return Val.getValueID() == Value::BasicBlockVal;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct isa_impl<Function, Value> {
|
|
|
|
static inline bool doit(const Value &Val) {
|
|
|
|
return Val.getValueID() == Value::FunctionVal;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct isa_impl<GlobalVariable, Value> {
|
|
|
|
static inline bool doit(const Value &Val) {
|
|
|
|
return Val.getValueID() == Value::GlobalVariableVal;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct isa_impl<GlobalAlias, Value> {
|
|
|
|
static inline bool doit(const Value &Val) {
|
|
|
|
return Val.getValueID() == Value::GlobalAliasVal;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct isa_impl<GlobalValue, Value> {
|
|
|
|
static inline bool doit(const Value &Val) {
|
|
|
|
return isa<GlobalVariable>(Val) || isa<Function>(Val) ||
|
|
|
|
isa<GlobalAlias>(Val);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct isa_impl<MDNode, Value> {
|
|
|
|
static inline bool doit(const Value &Val) {
|
|
|
|
return Val.getValueID() == Value::MDNodeVal;
|
|
|
|
}
|
|
|
|
};
|
2009-03-29 07:45:43 +02:00
|
|
|
|
|
|
|
// Value* is only 4-byte aligned.
|
|
|
|
template<>
|
|
|
|
class PointerLikeTypeTraits<Value*> {
|
|
|
|
typedef Value* PT;
|
|
|
|
public:
|
|
|
|
static inline void *getAsVoidPointer(PT P) { return P; }
|
|
|
|
static inline PT getFromVoidPointer(void *P) {
|
|
|
|
return static_cast<PT>(P);
|
|
|
|
}
|
|
|
|
enum { NumLowBitsAvailable = 2 };
|
|
|
|
};
|
2001-10-01 20:26:53 +02:00
|
|
|
|
2003-11-11 23:41:34 +01:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2001-06-06 22:29:01 +02:00
|
|
|
#endif
|