mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-23 02:29:18 +00:00
APInt. While some operators were already specifically overloaded for APSInt, others resulted in using the overloaded operator methods in APInt, which would result in the signedness bit being lost. Modified the APSInt(APInt&) constructor to be "explicit" and to take an extra (optional) flag to indicate the signedness. Making the ctor explicit will catch any implicit conversations between APSInt -> APInt -> APSInt that results in the signedness flag being lost. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@46316 91177308-0d34-0410-b5e6-96231b3b80d8
237 lines
7.1 KiB
C++
237 lines
7.1 KiB
C++
//===-- llvm/ADT/APSInt.h - Arbitrary Precision Signed Int -----*- C++ -*--===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements the APSInt class, which is a simple class that
|
|
// represents an arbitrary sized integer that knows its signedness.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_APSINT_H
|
|
#define LLVM_APSINT_H
|
|
|
|
#include "llvm/ADT/APInt.h"
|
|
|
|
namespace llvm {
|
|
|
|
|
|
class APSInt : public APInt {
|
|
bool IsUnsigned;
|
|
public:
|
|
/// APSInt ctor - Create an APSInt with the specified width, default to
|
|
/// unsigned.
|
|
explicit APSInt(uint32_t BitWidth) : APInt(BitWidth, 0), IsUnsigned(true) {}
|
|
|
|
explicit APSInt(const APInt &I, bool isUnsigned = true)
|
|
: APInt(I), IsUnsigned(isUnsigned) {}
|
|
|
|
APSInt &operator=(const APSInt &RHS) {
|
|
APInt::operator=(RHS);
|
|
IsUnsigned = RHS.IsUnsigned;
|
|
return *this;
|
|
}
|
|
|
|
APSInt &operator=(const APInt &RHS) {
|
|
// Retain our current sign.
|
|
APInt::operator=(RHS);
|
|
return *this;
|
|
}
|
|
|
|
APSInt &operator=(uint64_t RHS) {
|
|
// Retain our current sign.
|
|
APInt::operator=(RHS);
|
|
return *this;
|
|
}
|
|
|
|
// Query sign information.
|
|
bool isSigned() const { return !IsUnsigned; }
|
|
bool isUnsigned() const { return IsUnsigned; }
|
|
void setIsUnsigned(bool Val) { IsUnsigned = Val; }
|
|
void setIsSigned(bool Val) { IsUnsigned = !Val; }
|
|
|
|
/// This is used internally to convert an APInt to a string.
|
|
/// @brief Converts an APInt to a std::string
|
|
std::string toString(uint8_t Radix = 10) const {
|
|
return APInt::toString(Radix, isSigned());
|
|
}
|
|
|
|
APSInt& extend(uint32_t width) {
|
|
if (IsUnsigned)
|
|
zext(width);
|
|
else
|
|
sext(width);
|
|
return *this;
|
|
}
|
|
|
|
APSInt& extOrTrunc(uint32_t width) {
|
|
if (IsUnsigned)
|
|
zextOrTrunc(width);
|
|
else
|
|
sextOrTrunc(width);
|
|
return *this;
|
|
}
|
|
|
|
const APSInt &operator%=(const APSInt &RHS) {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
if (IsUnsigned)
|
|
*this = urem(RHS);
|
|
else
|
|
*this = srem(RHS);
|
|
return *this;
|
|
}
|
|
const APSInt &operator/=(const APSInt &RHS) {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
if (IsUnsigned)
|
|
*this = udiv(RHS);
|
|
else
|
|
*this = sdiv(RHS);
|
|
return *this;
|
|
}
|
|
APSInt operator%(const APSInt &RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return IsUnsigned ? APSInt(urem(RHS), true) : APSInt(srem(RHS), false);
|
|
}
|
|
APSInt operator/(const APSInt &RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return IsUnsigned ? APSInt(udiv(RHS), true) : APSInt(sdiv(RHS), false);
|
|
}
|
|
|
|
APSInt operator>>(unsigned Amt) const {
|
|
return IsUnsigned ? APSInt(lshr(Amt), true) : APSInt(ashr(Amt), false);
|
|
}
|
|
APSInt& operator>>=(unsigned Amt) {
|
|
*this = *this >> Amt;
|
|
return *this;
|
|
}
|
|
|
|
inline bool operator<(const APSInt& RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return IsUnsigned ? ult(RHS) : slt(RHS);
|
|
}
|
|
inline bool operator>(const APSInt& RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return IsUnsigned ? ugt(RHS) : sgt(RHS);
|
|
}
|
|
inline bool operator<=(const APSInt& RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return IsUnsigned ? ule(RHS) : sle(RHS);
|
|
}
|
|
inline bool operator>=(const APSInt& RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return IsUnsigned ? uge(RHS) : sge(RHS);
|
|
}
|
|
|
|
// The remaining operators just wrap the logic of APInt, but retain the
|
|
// signedness information.
|
|
|
|
APSInt operator<<(unsigned Bits) {
|
|
return APSInt(static_cast<APInt&>(*this) << Bits, IsUnsigned);
|
|
}
|
|
APSInt& operator<<=(unsigned Amt) {
|
|
*this = *this << Amt;
|
|
return *this;
|
|
}
|
|
|
|
APSInt& operator++() {
|
|
static_cast<APInt&>(*this)++;
|
|
return *this;
|
|
}
|
|
APSInt& operator--() {
|
|
static_cast<APInt&>(*this)++;
|
|
return *this;
|
|
}
|
|
APSInt operator++(int) {
|
|
return APSInt(++static_cast<APInt&>(*this), IsUnsigned);
|
|
}
|
|
APSInt operator--(int) {
|
|
return APSInt(--static_cast<APInt&>(*this), IsUnsigned);
|
|
}
|
|
APSInt operator-() const {
|
|
return APSInt(-static_cast<const APInt&>(*this), IsUnsigned);
|
|
}
|
|
APSInt& operator+=(const APSInt& RHS) {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
static_cast<APInt&>(*this) += RHS;
|
|
return *this;
|
|
}
|
|
APSInt& operator-=(const APSInt& RHS) {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
static_cast<APInt&>(*this) -= RHS;
|
|
return *this;
|
|
}
|
|
APSInt& operator*=(const APSInt& RHS) {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
static_cast<APInt&>(*this) *= RHS;
|
|
return *this;
|
|
}
|
|
APSInt& operator&=(const APSInt& RHS) {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
static_cast<APInt&>(*this) &= RHS;
|
|
return *this;
|
|
}
|
|
APSInt& operator|=(const APSInt& RHS) {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
static_cast<APInt&>(*this) |= RHS;
|
|
return *this;
|
|
}
|
|
APSInt& operator^=(const APSInt& RHS) {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
static_cast<APInt&>(*this) ^= RHS;
|
|
return *this;
|
|
}
|
|
|
|
APSInt operator&(const APSInt& RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return APSInt(static_cast<const APInt&>(*this) & RHS, IsUnsigned);
|
|
}
|
|
APSInt And(const APSInt& RHS) const {
|
|
return this->operator&(RHS);
|
|
}
|
|
|
|
APSInt operator|(const APSInt& RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return APSInt(static_cast<const APInt&>(*this) | RHS, IsUnsigned);
|
|
}
|
|
APSInt Or(const APSInt& RHS) const {
|
|
return this->operator|(RHS);
|
|
}
|
|
|
|
|
|
APSInt operator^(const APSInt& RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return APSInt(static_cast<const APInt&>(*this) ^ RHS, IsUnsigned);
|
|
}
|
|
APSInt Xor(const APSInt& RHS) const {
|
|
return this->operator^(RHS);
|
|
}
|
|
|
|
APSInt operator*(const APSInt& RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return APSInt(static_cast<const APInt&>(*this) * RHS, IsUnsigned);
|
|
}
|
|
APSInt operator+(const APSInt& RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return APSInt(static_cast<const APInt&>(*this) + RHS, IsUnsigned);
|
|
}
|
|
APSInt operator-(const APSInt& RHS) const {
|
|
assert(IsUnsigned == RHS.IsUnsigned && "Signedness mismatch!");
|
|
return APSInt(static_cast<const APInt&>(*this) - RHS, IsUnsigned);
|
|
}
|
|
APSInt operator~() {
|
|
return APSInt(~static_cast<const APInt&>(*this), IsUnsigned);
|
|
}
|
|
|
|
/// Profile - Used to insert APSInt objects, or objects that contain APSInt
|
|
/// objects, into FoldingSets.
|
|
void Profile(FoldingSetNodeID& ID) const;
|
|
};
|
|
|
|
} // end namespace llvm
|
|
|
|
#endif
|