X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=include%2Fllvm%2FConstantHandling.h;h=ef19cd257f8fdb360e188782bf0efbbed3e3f97e;hb=20a277e162f971ec1b9c6f2c90a214c177d54f99;hp=453c3e88b186809c9d5b7d0da89d4fce58cedfd8;hpb=539a4bf4b587e7aa334888bfb1145f1c7adf63f3;p=oota-llvm.git diff --git a/include/llvm/ConstantHandling.h b/include/llvm/ConstantHandling.h index 453c3e88b18..ef19cd257f8 100644 --- a/include/llvm/ConstantHandling.h +++ b/include/llvm/ConstantHandling.h @@ -1,14 +1,21 @@ -//===-- ConstantHandling.h - Stuff for manipulating constants ----*- C++ -*--=// +//===-- ConstantHandling.h - Stuff for manipulating constants ---*- 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 declarations of some cool operators that allow you // to do natural things with constant pool values. // // Unfortunately we can't overload operators on pointer types (like this:) // -// inline bool operator==(const ConstPoolVal *V1, const ConstPoolVal *V2) +// inline bool operator==(const Constant *V1, const Constant *V2) // // so we must make due with references, even though it leads to some butt ugly -// looking code downstream. *sigh* (ex: ConstPoolVal *Result = *V1 + *v2; ) +// looking code downstream. *sigh* (ex: Constant *Result = *V1 + *v2; ) // //===----------------------------------------------------------------------===// // @@ -30,66 +37,67 @@ // //===----------------------------------------------------------------------===// -#ifndef LLVM_OPT_CONSTANTHANDLING_H -#define LLVM_OPT_CONSTANTHANDLING_H +#ifndef LLVM_CONSTANTHANDLING_H +#define LLVM_CONSTANTHANDLING_H -#include "llvm/ConstPoolVals.h" -#include "llvm/Instruction.h" +#include "llvm/Constants.h" #include "llvm/Type.h" - -namespace opt { +class PointerType; //===----------------------------------------------------------------------===// // Implement == and != directly... //===----------------------------------------------------------------------===// -inline ConstPoolBool *operator==(const ConstPoolVal &V1, - const ConstPoolVal &V2) { +inline ConstantBool *operator==(const Constant &V1, const Constant &V2) { assert(V1.getType() == V2.getType() && "Constant types must be identical!"); - return ConstPoolBool::get(&V1 == &V2); + return ConstantBool::get(&V1 == &V2); } -inline ConstPoolBool *operator!=(const ConstPoolVal &V1, - const ConstPoolVal &V2) { - return ConstPoolBool::get(&V1 != &V2); +inline ConstantBool *operator!=(const Constant &V1, const Constant &V2) { + return ConstantBool::get(&V1 != &V2); } //===----------------------------------------------------------------------===// // Implement all other operators indirectly through TypeRules system //===----------------------------------------------------------------------===// -class ConstRules { +class ConstRules : public Annotation { protected: - inline ConstRules() {} // Can only be subclassed... + inline ConstRules() : Annotation(AID) {} // Can only be subclassed... public: - // Unary Operators... - virtual ConstPoolVal *not(const ConstPoolVal *V) const = 0; + static AnnotationID AID; // AnnotationID for this class // Binary Operators... - virtual ConstPoolVal *add(const ConstPoolVal *V1, - const ConstPoolVal *V2) const = 0; - virtual ConstPoolVal *sub(const ConstPoolVal *V1, - const ConstPoolVal *V2) const = 0; - virtual ConstPoolVal *mul(const ConstPoolVal *V1, - const ConstPoolVal *V2) const = 0; - - virtual ConstPoolBool *lessthan(const ConstPoolVal *V1, - const ConstPoolVal *V2) const = 0; + virtual Constant *add(const Constant *V1, const Constant *V2) const = 0; + virtual Constant *sub(const Constant *V1, const Constant *V2) const = 0; + virtual Constant *mul(const Constant *V1, const Constant *V2) const = 0; + virtual Constant *div(const Constant *V1, const Constant *V2) const = 0; + virtual Constant *rem(const Constant *V1, const Constant *V2) const = 0; + virtual Constant *op_and(const Constant *V1, const Constant *V2) const = 0; + virtual Constant *op_or (const Constant *V1, const Constant *V2) const = 0; + virtual Constant *op_xor(const Constant *V1, const Constant *V2) const = 0; + virtual Constant *shl(const Constant *V1, const Constant *V2) const = 0; + virtual Constant *shr(const Constant *V1, const Constant *V2) const = 0; + + virtual ConstantBool *lessthan(const Constant *V1, + const Constant *V2) const = 0; // Casting operators. ick - virtual ConstPoolBool *castToBool (const ConstPoolVal *V) const = 0; - virtual ConstPoolSInt *castToSByte (const ConstPoolVal *V) const = 0; - virtual ConstPoolUInt *castToUByte (const ConstPoolVal *V) const = 0; - virtual ConstPoolSInt *castToShort (const ConstPoolVal *V) const = 0; - virtual ConstPoolUInt *castToUShort(const ConstPoolVal *V) const = 0; - virtual ConstPoolSInt *castToInt (const ConstPoolVal *V) const = 0; - virtual ConstPoolUInt *castToUInt (const ConstPoolVal *V) const = 0; - virtual ConstPoolSInt *castToLong (const ConstPoolVal *V) const = 0; - virtual ConstPoolUInt *castToULong (const ConstPoolVal *V) const = 0; - virtual ConstPoolFP *castToFloat (const ConstPoolVal *V) const = 0; - virtual ConstPoolFP *castToDouble(const ConstPoolVal *V) const = 0; - - inline ConstPoolVal *castTo(const ConstPoolVal *V, const Type *Ty) const { + virtual ConstantBool *castToBool (const Constant *V) const = 0; + virtual ConstantSInt *castToSByte (const Constant *V) const = 0; + virtual ConstantUInt *castToUByte (const Constant *V) const = 0; + virtual ConstantSInt *castToShort (const Constant *V) const = 0; + virtual ConstantUInt *castToUShort(const Constant *V) const = 0; + virtual ConstantSInt *castToInt (const Constant *V) const = 0; + virtual ConstantUInt *castToUInt (const Constant *V) const = 0; + virtual ConstantSInt *castToLong (const Constant *V) const = 0; + virtual ConstantUInt *castToULong (const Constant *V) const = 0; + virtual ConstantFP *castToFloat (const Constant *V) const = 0; + virtual ConstantFP *castToDouble(const Constant *V) const = 0; + virtual Constant *castToPointer(const Constant *V, + const PointerType *Ty) const = 0; + + inline Constant *castTo(const Constant *V, const Type *Ty) const { switch (Ty->getPrimitiveID()) { case Type::BoolTyID: return castToBool(V); case Type::UByteTyID: return castToUByte(V); @@ -102,6 +110,7 @@ public: case Type::LongTyID: return castToLong(V); case Type::FloatTyID: return castToFloat(V); case Type::DoubleTyID: return castToDouble(V); + case Type::PointerTyID:return castToPointer(V, (PointerType*)Ty); default: return 0; } } @@ -110,94 +119,125 @@ public: // we just want to make sure to hit the cache instead of doing it indirectly, // if possible... // - static inline const ConstRules *get(const ConstPoolVal &V) { - const ConstRules *Result = V.getType()->getConstRules(); - return Result ? Result : find(V.getType()); + static inline ConstRules *get(const Constant &V1, const Constant &V2) { + if (isa(V1) || isa(V2)) + return getConstantExprRules(); + return (ConstRules*)V1.getType()->getOrCreateAnnotation(AID); } -private : - static const ConstRules *find(const Type *Ty); +private: + static ConstRules *getConstantExprRules(); + static Annotation *find(AnnotationID AID, const Annotable *Ty, void *); ConstRules(const ConstRules &); // Do not implement ConstRules &operator=(const ConstRules &); // Do not implement }; - -inline ConstPoolVal *operator!(const ConstPoolVal &V) { - return ConstRules::get(V)->not(&V); +// Unary operators... +inline Constant *operator~(const Constant &V) { + assert(V.getType()->isIntegral() && "Cannot invert non-intergral constant!"); + return ConstRules::get(V, V)->op_xor(&V, + ConstantInt::getAllOnesValue(V.getType())); } +// Standard binary operators... +inline Constant *operator+(const Constant &V1, const Constant &V2) { + assert(V1.getType() == V2.getType() && "Constant types must be identical!"); + return ConstRules::get(V1, V2)->add(&V1, &V2); +} +inline Constant *operator-(const Constant &V1, const Constant &V2) { + assert(V1.getType() == V2.getType() && "Constant types must be identical!"); + return ConstRules::get(V1, V2)->sub(&V1, &V2); +} -inline ConstPoolVal *operator+(const ConstPoolVal &V1, const ConstPoolVal &V2) { +inline Constant *operator*(const Constant &V1, const Constant &V2) { assert(V1.getType() == V2.getType() && "Constant types must be identical!"); - return ConstRules::get(V1)->add(&V1, &V2); + return ConstRules::get(V1, V2)->mul(&V1, &V2); } -inline ConstPoolVal *operator-(const ConstPoolVal &V1, const ConstPoolVal &V2) { +inline Constant *operator/(const Constant &V1, const Constant &V2) { assert(V1.getType() == V2.getType() && "Constant types must be identical!"); - return ConstRules::get(V1)->sub(&V1, &V2); + return ConstRules::get(V1, V2)->div(&V1, &V2); } -inline ConstPoolVal *operator*(const ConstPoolVal &V1, const ConstPoolVal &V2) { +inline Constant *operator%(const Constant &V1, const Constant &V2) { assert(V1.getType() == V2.getType() && "Constant types must be identical!"); - return ConstRules::get(V1)->mul(&V1, &V2); + return ConstRules::get(V1, V2)->rem(&V1, &V2); } -inline ConstPoolBool *operator<(const ConstPoolVal &V1, - const ConstPoolVal &V2) { +// Logical Operators... +inline Constant *operator&(const Constant &V1, const Constant &V2) { assert(V1.getType() == V2.getType() && "Constant types must be identical!"); - return ConstRules::get(V1)->lessthan(&V1, &V2); + return ConstRules::get(V1, V2)->op_and(&V1, &V2); } +inline Constant *operator|(const Constant &V1, const Constant &V2) { + assert(V1.getType() == V2.getType() && "Constant types must be identical!"); + return ConstRules::get(V1, V2)->op_or(&V1, &V2); +} -//===----------------------------------------------------------------------===// -// Implement 'derived' operators based on what we already have... -//===----------------------------------------------------------------------===// +inline Constant *operator^(const Constant &V1, const Constant &V2) { + assert(V1.getType() == V2.getType() && "Constant types must be identical!"); + return ConstRules::get(V1, V2)->op_xor(&V1, &V2); +} -inline ConstPoolBool *operator>(const ConstPoolVal &V1, - const ConstPoolVal &V2) { - return V2 < V1; +// Shift Instructions... +inline Constant *operator<<(const Constant &V1, const Constant &V2) { + assert(V1.getType()->isInteger() && V2.getType() == Type::UByteTy); + return ConstRules::get(V1, V2)->shl(&V1, &V2); } -inline ConstPoolBool *operator>=(const ConstPoolVal &V1, - const ConstPoolVal &V2) { - return (V1 < V2)->inverted(); // !(V1 < V2) +inline Constant *operator>>(const Constant &V1, const Constant &V2) { + assert(V1.getType()->isInteger() && V2.getType() == Type::UByteTy); + return ConstRules::get(V1, V2)->shr(&V1, &V2); } -inline ConstPoolBool *operator<=(const ConstPoolVal &V1, - const ConstPoolVal &V2) { - return (V1 > V2)->inverted(); // !(V1 > V2) +inline ConstantBool *operator<(const Constant &V1, + const Constant &V2) { + assert(V1.getType() == V2.getType() && "Constant types must be identical!"); + return ConstRules::get(V1, V2)->lessthan(&V1, &V2); } //===----------------------------------------------------------------------===// -// Implement higher level instruction folding type instructions +// Implement 'derived' operators based on what we already have... //===----------------------------------------------------------------------===// -inline ConstPoolVal *ConstantFoldUnaryInstruction(unsigned Opcode, - ConstPoolVal *V) { - switch (Opcode) { - case Instruction::Not: return !*V; - } - return 0; +inline ConstantBool *operator>(const Constant &V1, + const Constant &V2) { + return V2 < V1; } -inline ConstPoolVal *ConstantFoldBinaryInstruction(unsigned Opcode, - ConstPoolVal *V1, - ConstPoolVal *V2) { - switch (Opcode) { - case Instruction::Add: return *V1 + *V2; - case Instruction::Sub: return *V1 - *V2; +inline ConstantBool *operator>=(const Constant &V1, + const Constant &V2) { + if (ConstantBool *V = (V1 < V2)) + return V->inverted(); // !(V1 < V2) + return 0; +} - case Instruction::SetEQ: return *V1 == *V2; - case Instruction::SetNE: return *V1 != *V2; - case Instruction::SetLE: return *V1 <= *V2; - case Instruction::SetGE: return *V1 >= *V2; - case Instruction::SetLT: return *V1 < *V2; - case Instruction::SetGT: return *V1 > *V2; - } +inline ConstantBool *operator<=(const Constant &V1, + const Constant &V2) { + if (ConstantBool *V = (V1 > V2)) + return V->inverted(); // !(V1 > V2) return 0; } -} // end namespace opt + +//===----------------------------------------------------------------------===// +// Implement higher level instruction folding type instructions +//===----------------------------------------------------------------------===// + +// ConstantFoldInstruction - Attempt to constant fold the specified instruction. +// If successful, the constant result is returned, if not, null is returned. +// +Constant *ConstantFoldInstruction(Instruction *I); + +// Constant fold various types of instruction... +Constant *ConstantFoldCastInstruction(const Constant *V, const Type *DestTy); +Constant *ConstantFoldBinaryInstruction(unsigned Opcode, const Constant *V1, + const Constant *V2); +Constant *ConstantFoldShiftInstruction(unsigned Opcode, const Constant *V1, + const Constant *V2); +Constant *ConstantFoldGetElementPtr(const Constant *C, + const std::vector &IdxList); #endif