//===--- Integral.h - Wrapper for numeric types for the VM ------*- C++ -*-===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// // // Defines the VM types and helpers operating on types. // //===----------------------------------------------------------------------===// #ifndef LLVM_CLANG_AST_INTERP_INTEGRAL_H #define LLVM_CLANG_AST_INTERP_INTEGRAL_H #include "clang/AST/ComparisonCategories.h" #include "clang/AST/APValue.h" #include "llvm/ADT/APSInt.h" #include "llvm/Support/MathExtras.h" #include "llvm/Support/raw_ostream.h" #include #include namespace clang { namespace interp { using APInt = llvm::APInt; using APSInt = llvm::APSInt; /// Helper to compare two comparable types. template ComparisonCategoryResult Compare(const T &X, const T &Y) { if (X < Y) return ComparisonCategoryResult::Less; if (X > Y) return ComparisonCategoryResult::Greater; return ComparisonCategoryResult::Equal; } // Helper structure to select the representation. template struct Repr; template <> struct Repr<8, false> { using Type = uint8_t; }; template <> struct Repr<16, false> { using Type = uint16_t; }; template <> struct Repr<32, false> { using Type = uint32_t; }; template <> struct Repr<64, false> { using Type = uint64_t; }; template <> struct Repr<8, true> { using Type = int8_t; }; template <> struct Repr<16, true> { using Type = int16_t; }; template <> struct Repr<32, true> { using Type = int32_t; }; template <> struct Repr<64, true> { using Type = int64_t; }; /// Wrapper around numeric types. /// /// These wrappers are required to shared an interface between APSint and /// builtin primitive numeral types, while optimising for storage and /// allowing methods operating on primitive type to compile to fast code. template class Integral final { private: template friend class Integral; // The primitive representing the integral. using ReprT = typename Repr::Type; ReprT V; /// Primitive representing limits. static const auto Min = std::numeric_limits::min(); static const auto Max = std::numeric_limits::max(); /// Construct an integral from anything that is convertible to storage. template explicit Integral(T V) : V(V) {} public: /// Zero-initializes an integral. Integral() : V(0) {} /// Constructs an integral from another integral. template explicit Integral(Integral V) : V(V.V) {} /// Construct an integral from a value based on signedness. explicit Integral(const APSInt &V) : V(V.isSigned() ? V.getSExtValue() : V.getZExtValue()) {} bool operator<(Integral RHS) const { return V < RHS.V; } bool operator>(Integral RHS) const { return V > RHS.V; } bool operator<=(Integral RHS) const { return V <= RHS.V; } bool operator>=(Integral RHS) const { return V >= RHS.V; } bool operator==(Integral RHS) const { return V == RHS.V; } bool operator!=(Integral RHS) const { return V != RHS.V; } bool operator>(unsigned RHS) const { return V >= 0 && static_cast(V) > RHS; } Integral operator-() const { return Integral(-V); } Integral operator~() const { return Integral(~V); } template explicit operator Integral() const { return Integral(V); } explicit operator unsigned() const { return V; } explicit operator int64_t() const { return V; } explicit operator uint64_t() const { return V; } APSInt toAPSInt() const { return APSInt(APInt(Bits, static_cast(V), Signed), !Signed); } APSInt toAPSInt(unsigned NumBits) const { if constexpr (Signed) return APSInt(toAPSInt().sextOrTrunc(NumBits), !Signed); else return APSInt(toAPSInt().zextOrTrunc(NumBits), !Signed); } APValue toAPValue() const { return APValue(toAPSInt()); } Integral toUnsigned() const { return Integral(*this); } constexpr static unsigned bitWidth() { return Bits; } bool isZero() const { return !V; } bool isMin() const { return *this == min(bitWidth()); } bool isMinusOne() const { return Signed && V == ReprT(-1); } constexpr static bool isSigned() { return Signed; } bool isNegative() const { return V < ReprT(0); } bool isPositive() const { return !isNegative(); } ComparisonCategoryResult compare(const Integral &RHS) const { return Compare(V, RHS.V); } unsigned countLeadingZeros() const { return llvm::countLeadingZeros(V); } Integral truncate(unsigned TruncBits) const { if (TruncBits >= Bits) return *this; const ReprT BitMask = (ReprT(1) << ReprT(TruncBits)) - 1; const ReprT SignBit = ReprT(1) << (TruncBits - 1); const ReprT ExtMask = ~BitMask; return Integral((V & BitMask) | (Signed && (V & SignBit) ? ExtMask : 0)); } void print(llvm::raw_ostream &OS) const { OS << V; } static Integral min(unsigned NumBits) { return Integral(Min); } static Integral max(unsigned NumBits) { return Integral(Max); } template static Integral from(ValT Value) { if constexpr (std::is_integral::value) return Integral(Value); else return Integral::from(static_cast(Value)); } template static std::enable_if_t from(Integral Value) { return Integral(Value.V); } template static Integral from(Integral<0, SrcSign> Value) { if constexpr (SrcSign) return Integral(Value.V.getSExtValue()); else return Integral(Value.V.getZExtValue()); } static Integral zero() { return from(0); } template static Integral from(T Value, unsigned NumBits) { return Integral(Value); } static bool inRange(int64_t Value, unsigned NumBits) { return CheckRange(Value); } static bool increment(Integral A, Integral *R) { return add(A, Integral(ReprT(1)), A.bitWidth(), R); } static bool decrement(Integral A, Integral *R) { return sub(A, Integral(ReprT(1)), A.bitWidth(), R); } static bool add(Integral A, Integral B, unsigned OpBits, Integral *R) { return CheckAddUB(A.V, B.V, R->V); } static bool sub(Integral A, Integral B, unsigned OpBits, Integral *R) { return CheckSubUB(A.V, B.V, R->V); } static bool mul(Integral A, Integral B, unsigned OpBits, Integral *R) { return CheckMulUB(A.V, B.V, R->V); } static bool rem(Integral A, Integral B, unsigned OpBits, Integral *R) { *R = Integral(A.V % B.V); return false; } static bool div(Integral A, Integral B, unsigned OpBits, Integral *R) { *R = Integral(A.V / B.V); return false; } static bool bitAnd(Integral A, Integral B, unsigned OpBits, Integral *R) { *R = Integral(A.V & B.V); return false; } static bool bitOr(Integral A, Integral B, unsigned OpBits, Integral *R) { *R = Integral(A.V | B.V); return false; } static bool bitXor(Integral A, Integral B, unsigned OpBits, Integral *R) { *R = Integral(A.V ^ B.V); return false; } static bool neg(Integral A, Integral *R) { *R = -A; return false; } static bool comp(Integral A, Integral *R) { *R = Integral(~A.V); return false; } private: template static bool CheckAddUB(T A, T B, T &R) { if constexpr (std::is_signed_v) { return llvm::AddOverflow(A, B, R); } else { R = A + B; return false; } } template static bool CheckSubUB(T A, T B, T &R) { if constexpr (std::is_signed_v) { return llvm::SubOverflow(A, B, R); } else { R = A - B; return false; } } template static bool CheckMulUB(T A, T B, T &R) { if constexpr (std::is_signed_v) { return llvm::MulOverflow(A, B, R); } else { R = A * B; return false; } } template static bool CheckRange(int64_t V) { if constexpr (std::is_signed_v) { return Min <= V && V <= Max; } else { return V >= 0 && static_cast(V) <= Max; } } }; template llvm::raw_ostream &operator<<(llvm::raw_ostream &OS, Integral I) { I.print(OS); return OS; } } // namespace interp } // namespace clang #endif