X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FVMCore%2FConstantFold.h;h=546b37e605fc1cd74550e7feb59cd6d700106f74;hb=ce8a14915d2971039b576e03a32e0ba7c421dba7;hp=bd59780ef20fd7ca2288f73f6333f757c7135d4c;hpb=e9bb2df410f7a22decad9a883f7139d5857c1520;p=oota-llvm.git diff --git a/lib/VMCore/ConstantFold.h b/lib/VMCore/ConstantFold.h index bd59780ef20..546b37e605f 100644 --- a/lib/VMCore/ConstantFold.h +++ b/lib/VMCore/ConstantFold.h @@ -30,16 +30,13 @@ // //===----------------------------------------------------------------------===// -#ifndef LLVM_OPT_CONSTANTHANDLING_H -#define LLVM_OPT_CONSTANTHANDLING_H +#ifndef LLVM_CONSTANTHANDLING_H +#define LLVM_CONSTANTHANDLING_H -#include "llvm/ConstantVals.h" -#include "llvm/Instruction.h" +#include "llvm/Constants.h" #include "llvm/Type.h" class PointerType; -namespace opt { - //===----------------------------------------------------------------------===// // Implement == and != directly... //===----------------------------------------------------------------------===// @@ -65,16 +62,17 @@ protected: public: static AnnotationID AID; // AnnotationID for this class - // Unary Operators... - virtual Constant *op_not(const Constant *V) const = 0; - // Binary Operators... - 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 *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; @@ -127,12 +125,7 @@ private : }; -inline Constant *operator!(const Constant &V) { - return ConstRules::get(V)->op_not(&V); -} - - - +// 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)->add(&V1, &V2); @@ -148,6 +141,43 @@ inline Constant *operator*(const Constant &V1, const Constant &V2) { return ConstRules::get(V1)->mul(&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)->div(&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)->rem(&V1, &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)->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)->op_or(&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)->op_xor(&V1, &V2); +} + +// Shift Instructions... +inline Constant *operator<<(const Constant &V1, const Constant &V2) { + assert(V1.getType()->isInteger() && V2.getType() == Type::UByteTy); + return ConstRules::get(V1)->shl(&V1, &V2); +} + +inline Constant *operator>>(const Constant &V1, const Constant &V2) { + assert(V1.getType()->isInteger() && V2.getType() == Type::UByteTy); + return ConstRules::get(V1)->shr(&V1, &V2); +} + inline ConstantBool *operator<(const Constant &V1, const Constant &V2) { assert(V1.getType() == V2.getType() && "Constant types must be identical!"); @@ -179,36 +209,16 @@ inline ConstantBool *operator<=(const Constant &V1, // Implement higher level instruction folding type instructions //===----------------------------------------------------------------------===// -inline Constant *ConstantFoldCastInstruction(const Constant *V, - const Type *DestTy) { - return ConstRules::get(*V)->castTo(V, DestTy); -} +// ConstantFoldInstruction - Attempt to constant fold the specified instruction. +// If successful, the constant result is returned, if not, null is returned. +// +Constant *ConstantFoldInstruction(Instruction *I); -inline Constant *ConstantFoldUnaryInstruction(unsigned Opcode, - const Constant *V) { - switch (Opcode) { - case Instruction::Not: return !*V; - // TODO: Handle get element ptr instruction here in the future? GEP null? - } - return 0; -} - -inline Constant *ConstantFoldBinaryInstruction(unsigned Opcode, - const Constant *V1, - const Constant *V2) { - switch (Opcode) { - case Instruction::Add: return *V1 + *V2; - case Instruction::Sub: return *V1 - *V2; - - 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; - } - return 0; -} +// 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); -} // end namespace opt #endif