-#ifndef LLVM_OPT_CONSTANTHANDLING_H
-#define LLVM_OPT_CONSTANTHANDLING_H
-
-#include "llvm/ConstPoolVals.h"
-#include "llvm/Instruction.h"
-#include "llvm/Type.h"
-
-namespace opt {
-
-//===----------------------------------------------------------------------===//
-// Implement == directly...
-//===----------------------------------------------------------------------===//
-
-inline ConstPoolBool *operator==(const ConstPoolVal &V1,
- const ConstPoolVal &V2) {
- assert(V1.getType() == V2.getType() && "Constant types must be identical!");
- return new ConstPoolBool(V1.equals(&V2));
-}
-
-//===----------------------------------------------------------------------===//
-// Implement all other operators indirectly through TypeRules system
-//===----------------------------------------------------------------------===//
-
-class ConstRules {
-protected:
- inline ConstRules() {} // Can only be subclassed...
-public:
- // Unary Operators...
- virtual ConstPoolVal *not(const ConstPoolVal *V) const = 0;
-
- // 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 ConstPoolBool *lessthan(const ConstPoolVal *V1,
- const ConstPoolVal *V2) const = 0;
-
- // ConstRules::get - A type will cache its own type rules if one is needed...
- // 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());
- }
-private :
- static const ConstRules *find(const Type *Ty);
-
- 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);
-}
-
-
-
-inline ConstPoolVal *operator+(const ConstPoolVal &V1, const ConstPoolVal &V2) {
- assert(V1.getType() == V2.getType() && "Constant types must be identical!");
- return ConstRules::get(V1)->add(&V1, &V2);
-}
-
-inline ConstPoolVal *operator-(const ConstPoolVal &V1, const ConstPoolVal &V2) {
- assert(V1.getType() == V2.getType() && "Constant types must be identical!");
- return ConstRules::get(V1)->sub(&V1, &V2);
-}
-
-inline ConstPoolBool *operator<(const ConstPoolVal &V1,
- const ConstPoolVal &V2) {
- assert(V1.getType() == V2.getType() && "Constant types must be identical!");
- return ConstRules::get(V1)->lessthan(&V1, &V2);
-}
-
-
-//===----------------------------------------------------------------------===//
-// Implement 'derived' operators based on what we already have...
-//===----------------------------------------------------------------------===//
-
-inline ConstPoolBool *operator>(const ConstPoolVal &V1,
- const ConstPoolVal &V2) {
- return V2 < V1;
-}
-
-inline ConstPoolBool *operator!=(const ConstPoolVal &V1,
- const ConstPoolVal &V2) {
- ConstPoolBool *Result = V1 == V2;
- Result->setValue(!Result->getValue()); // Invert value
- return Result; // !(V1 == V2)
-}
-
-inline ConstPoolBool *operator>=(const ConstPoolVal &V1,
- const ConstPoolVal &V2) {
- ConstPoolBool *Result = V1 < V2;
- Result->setValue(!Result->getValue()); // Invert value
- return Result; // !(V1 < V2)
-}
-
-inline ConstPoolBool *operator<=(const ConstPoolVal &V1,
- const ConstPoolVal &V2) {
- ConstPoolBool *Result = V1 > V2;
- Result->setValue(!Result->getValue()); // Invert value
- return Result; // !(V1 > V2)
-}
-
-
-//===----------------------------------------------------------------------===//
-// Implement higher level instruction folding type instructions
-//===----------------------------------------------------------------------===//