-//===-- llvm/Instruction.h - Instruction class definition --------*- C++ -*--=//
+//===-- llvm/Instruction.h - Instruction class definition -------*- 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 contains the declaration of the Instruction class, which is the
-// base class for all of the VM instructions.
+// base class for all of the LLVM instructions.
//
//===----------------------------------------------------------------------===//
#include "llvm/User.h"
-class Type;
-class BasicBlock;
-class Method;
+template<typename SC> struct ilist_traits;
+template<typename ValueSubClass, typename ItemParentClass, typename SymTabClass,
+ typename SubClass> class SymbolTableListTraits;
class Instruction : public User {
BasicBlock *Parent;
- unsigned iType; // InstructionType
+ Instruction *Prev, *Next; // Next and Prev links for our intrusive linked list
+
+ void setNext(Instruction *N) { Next = N; }
+ void setPrev(Instruction *N) { Prev = N; }
- friend class ValueHolder<Instruction,BasicBlock>;
- inline void setParent(BasicBlock *P) { Parent = P; }
+ friend class SymbolTableListTraits<Instruction, BasicBlock, Function,
+ ilist_traits<Instruction> >;
+ void setParent(BasicBlock *P);
+protected:
+ unsigned iType; // InstructionType: The opcode of the instruction
+ Instruction(const Type *Ty, unsigned iType, const std::string &Name = "",
+ Instruction *InsertBefore = 0);
public:
- Instruction(const Type *Ty, unsigned iType, const string &Name = "");
- virtual ~Instruction(); // Virtual dtor == good.
// Specialize setName to handle symbol table majik...
- virtual void setName(const string &name);
-
- // clone() - Create a copy of 'this' instruction that is identical in all ways
- // except the following:
- // * The instruction has no parent
- // * The instruction has no name
- //
+ virtual void setName(const std::string &name, SymbolTable *ST = 0);
+
+ /// clone() - Create a copy of 'this' instruction that is identical in all
+ /// ways except the following:
+ /// * The instruction has no parent
+ /// * The instruction has no name
+ ///
virtual Instruction *clone() const = 0;
-
+
// Accessor methods...
//
inline const BasicBlock *getParent() const { return Parent; }
inline BasicBlock *getParent() { return Parent; }
- bool hasSideEffects() const { return false; } // Memory & Call insts = true
- // ---------------------------------------------------------------------------
- // Implement the User interface
- // if i > the number of operands, then getOperand() returns 0, and setOperand
- // returns false. setOperand() may also return false if the operand is of
- // the wrong type.
- //
- inline Value *getOperand(unsigned i) {
- return (Value*)((const Instruction *)this)->getOperand(i);
- }
- virtual const Value *getOperand(unsigned i) const = 0;
- virtual bool setOperand(unsigned i, Value *Val) = 0;
- virtual unsigned getNumOperands() const = 0;
-
- // ---------------------------------------------------------------------------
- // Operand Iterator interface...
- //
- template <class _Inst, class _Val> class OperandIterator;
- typedef OperandIterator<Instruction *, Value *> op_iterator;
- typedef OperandIterator<const Instruction *, const Value *> op_const_iterator;
-
- inline op_iterator op_begin() ;
- inline op_const_iterator op_begin() const;
- inline op_iterator op_end() ;
- inline op_const_iterator op_end() const;
+ // getNext/Prev - Return the next or previous instruction in the list. The
+ // last node in the list is a terminator instruction.
+ Instruction *getNext() { return Next; }
+ const Instruction *getNext() const { return Next; }
+ Instruction *getPrev() { return Prev; }
+ const Instruction *getPrev() const { return Prev; }
+ /// mayWriteToMemory - Return true if this instruction may modify memory.
+ ///
+ virtual bool mayWriteToMemory() const { return false; }
// ---------------------------------------------------------------------------
- // Subclass classification... getInstType() returns a member of
- // one of the enums that is coming soon (down below)...
- //
- virtual string getOpcode() const = 0;
+ /// Subclass classification... getOpcode() returns a member of
+ /// one of the enums that is coming soon (down below)...
+ ///
+ unsigned getOpcode() const { return iType; }
+ virtual const char *getOpcodeName() const {
+ return getOpcodeName(getOpcode());
+ }
+ static const char* getOpcodeName(unsigned OpCode);
- unsigned getInstType() const { return iType; }
inline bool isTerminator() const { // Instance of TerminatorInst?
- return iType >= FirstTermOp && iType < NumTermOps;
- }
- inline bool isDefinition() const { return !isTerminator(); }
- inline bool isUnaryOp() const {
- return iType >= FirstUnaryOp && iType < NumUnaryOps;
+ return iType >= TermOpsBegin && iType < TermOpsEnd;
}
inline bool isBinaryOp() const {
- return iType >= FirstBinaryOp && iType < NumBinaryOps;
+ return iType >= BinaryOpsBegin && iType < BinaryOpsEnd;
}
-
+ /// isAssociative - Return true if the instruction is associative:
+ ///
+ /// Associative operators satisfy: x op (y op z) === (x op y) op z
+ ///
+ /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative, when
+ /// not applied to floating point types.
+ ///
+ bool isAssociative() const { return isAssociative(getOpcode(), getType()); }
+ static bool isAssociative(unsigned op, const Type *Ty);
+
+ /// isCommutative - Return true if the instruction is commutative:
+ ///
+ /// Commutative operators satisfy: (x op y) === (y op x)
+ ///
+ /// In LLVM, these are the associative operators, plus SetEQ and SetNE, when
+ /// applied to any type.
+ ///
+ bool isCommutative() const { return isCommutative(getOpcode()); }
+ static bool isCommutative(unsigned op);
+
+ /// isTrappingInstruction - Return true if the instruction may trap.
+ ///
+ bool isTrapping() const {
+ return isTrapping(getOpcode());
+ }
+ static bool isTrapping(unsigned op);
+
+ virtual void print(std::ostream &OS) const;
+
+ /// Methods for support type inquiry through isa, cast, and dyn_cast:
+ static inline bool classof(const Instruction *I) { return true; }
+ static inline bool classof(const Value *V) {
+ return V->getValueType() == Value::InstructionVal;
+ }
+
//----------------------------------------------------------------------
// Exported enumerations...
//
enum TermOps { // These terminate basic blocks
- FirstTermOp = 1,
- Ret = 1, Br, Switch,
- NumTermOps // Must remain at end of enum
- };
-
- enum UnaryOps {
- FirstUnaryOp = NumTermOps,
- Neg = NumTermOps, Not,
-
- // Type conversions...
- ToBoolTy ,
- ToUByteTy , ToSByteTy, ToUShortTy, ToShortTy,
- ToUInt , ToInt, ToULongTy , ToLongTy,
-
- ToFloatTy , ToDoubleTy, ToArrayTy , ToPointerTy,
-
- NumUnaryOps // Must remain at end of enum
+#define FIRST_TERM_INST(N) TermOpsBegin = N,
+#define HANDLE_TERM_INST(N, OPC, CLASS) OPC = N,
+#define LAST_TERM_INST(N) TermOpsEnd = N+1,
+#include "llvm/Instruction.def"
};
enum BinaryOps {
- // Standard binary operators...
- FirstBinaryOp = NumUnaryOps,
- Add = NumUnaryOps, Sub, Mul, Div, Rem,
-
- // Logical operators...
- And, Or, Xor,
-
- // Binary comparison operators...
- SetEQ, SetNE, SetLE, SetGE, SetLT, SetGT,
-
- NumBinaryOps
+#define FIRST_BINARY_INST(N) BinaryOpsBegin = N,
+#define HANDLE_BINARY_INST(N, OPC, CLASS) OPC = N,
+#define LAST_BINARY_INST(N) BinaryOpsEnd = N+1,
+#include "llvm/Instruction.def"
};
enum MemoryOps {
- FirstMemoryOp = NumBinaryOps,
- Malloc = NumBinaryOps, Free, // Heap management instructions
- Alloca, // Stack management instruction
-
- Load, Store, // Memory manipulation instructions.
-
- GetField, PutField, // Structure manipulation instructions
-
- NumMemoryOps
+#define FIRST_MEMORY_INST(N) MemoryOpsBegin = N,
+#define HANDLE_MEMORY_INST(N, OPC, CLASS) OPC = N,
+#define LAST_MEMORY_INST(N) MemoryOpsEnd = N+1,
+#include "llvm/Instruction.def"
};
enum OtherOps {
- FirstOtherOp = NumMemoryOps,
- PHINode = NumMemoryOps, // PHI node instruction
- Call, // Call a function
-
- Shl, Shr, // Shift operations...
-
- NumOps, // Must be the last 'op' defined.
- UserOp1, UserOp2 // May be used internally to a pass...
+#define FIRST_OTHER_INST(N) OtherOpsBegin = N,
+#define HANDLE_OTHER_INST(N, OPC, CLASS) OPC = N,
+#define LAST_OTHER_INST(N) OtherOpsEnd = N+1,
+#include "llvm/Instruction.def"
};
-
-public:
- template <class _Inst, class _Val> // Operand Iterator Implementation
- class OperandIterator {
- const _Inst Inst;
- unsigned idx;
- public:
- typedef OperandIterator<_Inst, _Val> _Self;
- typedef bidirectional_iterator_tag iterator_category;
- typedef _Val pointer;
-
- inline OperandIterator(_Inst T) : Inst(T), idx(0) {} // begin iterator
- inline OperandIterator(_Inst T, bool)
- : Inst(T), idx(Inst->getNumOperands()) {} // end iterator
-
- inline bool operator==(const _Self& x) const { return idx == x.idx; }
- inline bool operator!=(const _Self& x) const { return !operator==(x); }
-
- inline pointer operator*() const { return Inst->getOperand(idx); }
- inline pointer *operator->() const { return &(operator*()); }
-
- inline _Self& operator++() { ++idx; return *this; } // Preincrement
- inline _Self operator++(int) { // Postincrement
- _Self tmp = *this; ++*this; return tmp;
- }
-
- inline _Self& operator--() { --idx; return *this; } // Predecrement
- inline _Self operator--(int) { // Postdecrement
- _Self tmp = *this; --*this; return tmp;
- }
- };
-
};
-inline Instruction::op_iterator Instruction::op_begin() {
- return op_iterator(this);
-}
-inline Instruction::op_const_iterator Instruction::op_begin() const {
- return op_const_iterator(this);
-}
-inline Instruction::op_iterator Instruction::op_end() {
- return op_iterator(this,true);
-}
-inline Instruction::op_const_iterator Instruction::op_end() const {
- return op_const_iterator(this,true);
-}
-
-
#endif
projects / oota-llvm.git / blobdiff