integer.hh

Go to the documentation of this file.

/*
 * Copyright (c) 2009 The University of Edinburgh
 * Copyright (c) 2021 IBM Corporation
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met: redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer;
 * redistributions in binary form must reproduce the above copyright
 * notice, this list of conditions and the following disclaimer in the
 * documentation and/or other materials provided with the distribution;
 * neither the name of the copyright holders nor the names of its
 * contributors may be used to endorse or promote products derived from
 * this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#ifndef __ARCH_POWER_INSTS_INTEGER_HH__
#define __ARCH_POWER_INSTS_INTEGER_HH__
 
#include "arch/power/insts/static_inst.hh"
#include "arch/power/regs/misc.hh"
#include "base/bitfield.hh"
#include "base/cprintf.hh"
 
namespace gem5
{
 
namespace PowerISA
{
 
class IntOp : public PowerStaticInst
{
  protected:
 
    bool rc;
    bool oe;
 
    // Needed for srawi only
    uint32_t sh;
 
    IntOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : PowerStaticInst(mnem, _machInst, __opClass),
        rc(machInst.rc),
        oe(machInst.oe)
    {
    }
 
    /* Compute the CR (condition register) field using signed comparison */
    inline uint32_t
    makeCRFieldSigned(int64_t a, int64_t b, bool so) const
    {
        Cr cr = 0;
 
        if (a < b)      { cr.cr0.lt = 1; }
        else if (a > b) { cr.cr0.gt = 1; }
        else            { cr.cr0.eq = 1; }
        if (so)         { cr.cr0.so = 1; }
 
        return cr.cr0;
    }
 
    /* Compute the CR (condition register) field using unsigned comparison */
    inline uint32_t
    makeCRFieldUnsigned(uint64_t a, uint64_t b, bool so) const
    {
        Cr cr = 0;
 
        if (a < b)      { cr.cr0.lt = 1; }
        else if (a > b) { cr.cr0.gt = 1; }
        else            { cr.cr0.eq = 1; }
        if (so)         { cr.cr0.so = 1; }
 
        return cr.cr0;
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntImmOp : public IntOp
{
  protected:
 
    int32_t si;
    uint32_t ui;
 
    IntImmOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntOp(mnem, _machInst, __opClass),
        si(sext<16>(machInst.si)),
        ui(machInst.si)
    {
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntArithOp : public IntOp
{
  protected:
 
    IntArithOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntOp(mnem, _machInst, __opClass)
    {
    }
 
    /* Compute 128-bit sum of 128-bit to 64-bit unsigned integer addition */
    inline std::tuple<uint64_t, uint64_t>
    add(uint64_t ralo, uint64_t rahi, uint64_t rb) const
    {
        uint64_t slo, shi;
    #if defined(__SIZEOF_INT128__)
        __uint128_t ra = ((__uint128_t)rahi << 64) | ralo;
        __uint128_t sum = ra + rb;
        slo = sum;
        shi = sum >> 64;
    #else
        shi = rahi + ((ralo + rb) < ralo);
        slo = ralo + rb;
    #endif
        return std::make_tuple(slo, shi);
    }
 
    /* Compute 128-bit sum of 128-bit to 64-bit signed integer addition */
    inline std::tuple<uint64_t, int64_t>
    add(uint64_t ralo, int64_t rahi, int64_t rb) const
    {
        uint64_t slo;
        int64_t shi;
    #if defined(__SIZEOF_INT128__)
        __int128_t ra = ((__int128_t)rahi << 64) | ralo;
        __int128_t sum = (__int128_t)ra + rb;
        slo = sum;
        shi = sum >> 64;
    #else
        if (rb < 0) {
            shi = rahi - 1;
            slo = ralo + rb;
            if (slo < rb) {
                shi++;
            }
        } else {
            shi = rahi;
            slo = ralo + rb;
            if (slo < rb) {
                shi++;
            }
        }
    #endif
        return std::make_tuple(slo, shi);
    }
 
    inline std::tuple<uint64_t, uint64_t>
    multiply(uint64_t ra, uint64_t rb) const
    {
        uint64_t plo, phi;
    #if defined(__SIZEOF_INT128__)
        __uint128_t prod = (__uint128_t)ra * rb;
        plo = prod;
        phi = prod >> 64;
    #else
        uint64_t ralo = (uint32_t)ra, rahi = ra >> 32;
        uint64_t rblo = (uint32_t)rb, rbhi = rb >> 32;
        uint64_t pp0 = ralo * rblo;
        uint64_t pp1 = rahi * rblo;
        uint64_t pp2 = ralo * rbhi;
        uint64_t pp3 = rahi * rbhi;
        uint64_t c = ((uint32_t)pp1) + ((uint32_t)pp2) + (pp0 >> 32);
        phi = pp3 + (pp2 >> 32) + (pp1 >> 32) + (c >> 32);
        plo = (c << 32) | ((uint32_t)pp0);
    #endif
        return std::make_tuple(plo, phi);
    }
 
    /* Compute 128-bit product of 64-bit signed integer multiplication */
    inline std::tuple<uint64_t, int64_t>
    multiply(int64_t ra, int64_t rb) const
    {
        uint64_t plo, phi;
    #if defined(__SIZEOF_INT128__)
        __int128_t prod = (__int128_t)ra * rb;
        plo = prod;
        phi = prod >> 64;
    #else
        std::tie(plo, phi) = multiply((uint64_t)ra, (uint64_t)rb);
        if (rb < 0) phi -= (uint64_t)ra;
        if (ra < 0) phi -= (uint64_t)rb;
    #endif
        return std::make_tuple(plo, (int64_t)phi);
    }
 
    inline std::tuple<uint64_t, uint64_t>
    multiplyAdd(uint64_t ra, uint64_t rb, uint64_t rc) const
    {
        uint64_t rlo, rhi;
    #if defined(__SIZEOF_INT128__)
        __uint128_t res = ((__uint128_t)ra * rb) + rc;
        rlo = res;
        rhi = res >> 64;
    #else
        uint64_t plo, phi;
        std::tie(plo, phi) = multiply(ra, rb);
        std::tie(rlo, rhi) = add(plo, phi, rc);
    #endif
        return std::make_tuple(rlo, rhi);
    }
 
    inline std::tuple<uint64_t, int64_t>
    multiplyAdd(int64_t ra, int64_t rb, int64_t rc) const
    {
        uint64_t rlo;
        int64_t rhi;
    #if defined(__SIZEOF_INT128__)
        __int128_t res = (__int128_t)ra * rb + rc;
        rlo = res;
        rhi = res >> 64;
    #else
        uint64_t plo;
        int64_t phi;
        std::tie(plo, phi) = multiply(ra, rb);
        std::tie(rlo, rhi) = add(plo, phi, rc);
    #endif
        return std::make_tuple(rlo, rhi);
    }
 
    inline std::tuple<bool, uint64_t, uint64_t>
    divide(uint64_t ralo, uint64_t rahi, uint64_t rb) const
    {
        bool ov;
        uint64_t q, r;
    #if defined(__SIZEOF_INT128__)
        if (rb == 0) {
            ov = true;
        } else {
            __uint128_t ra = ((__uint128_t)rahi << 64) | ralo;
            __uint128_t res = ra / rb;
            q = res;
            r = ra % rb;
            ov = res > UINT64_MAX;
        }
    #else
        uint64_t c = 0;
 
        if (rb == 0) {
            ov = true;
        } else if (rahi == 0) {
            q  = ralo / rb;
            r = ralo % rb;
            ov = false;
        } else if (rahi >= rb) {
            ov = true;
        } else {
            for (int i = 0; i < 64; ++i) {
                c = rahi >> 63;
                rahi = (rahi << 1) | (ralo >> 63);
                if (c || (rahi >= rb)) {
                    rahi -= rb;
                    c = 1;
                } else {
                    c = 0;
                }
                ralo = (ralo << 1) | c;
            }
            q = ralo;
            r = rahi;
            ov = false;
        }
    #endif
        return std::make_tuple(ov, q, r);
    }
 
    inline std::tuple<bool, int64_t, int64_t>
    divide(uint64_t ralo, int64_t rahi, int64_t rb) const
    {
        bool ov;
        int64_t q, r;
    #if defined(__SIZEOF_INT128__)
        if (rb == 0) {
            ov = true;
        } else {
            __int128_t ra = ((__int128_t)rahi << 64) | ralo;
            __int128_t res = ra / rb;
            q = res;
            r = ra % rb;
            ov = res != q;
        }
    #else
        bool raneg = rahi < 0;
        bool rbneg = rb < 0;
 
        if (raneg) {
            ralo = ~(ralo);
            rahi = ~(rahi);
            if (ralo == -1ULL) {
                ralo = 0;
                rahi++;
            } else {
                ralo++;
            }
        }
 
        if (rbneg) rb = -rb;
        std::tie(ov, q, r) = divide(ralo, (uint64_t)rahi, (uint64_t)rb);
        if (raneg ^ rbneg) q = -q;
        if (raneg) r = -r;
        if (!ov) ov = ((q < 0) ^ (raneg ^ rbneg));
    #endif
        return std::make_tuple(ov, q, r);
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntImmArithOp : public IntArithOp
{
  protected:
 
    int32_t si;
 
    IntImmArithOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntArithOp(mnem, _machInst, __opClass),
        si(sext<16>(machInst.si))
    {
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntDispArithOp : public IntArithOp
{
  protected:
 
    int64_t d;
 
    IntDispArithOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntArithOp(mnem, _machInst, __opClass),
        d(sext<16>((machInst.d0 << 6) | (machInst.d1 << 1) | machInst.d2))
    {
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntCompOp : public IntOp
{
  protected:
 
    bool l;
    uint8_t bf;
 
    IntCompOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntOp(mnem, _machInst, __opClass),
        l(machInst.l),
        bf(machInst.bf)
    {
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntImmCompOp : public IntCompOp
{
  protected:
 
    int32_t si;
 
    IntImmCompOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntCompOp(mnem, _machInst, __opClass),
        si(sext<16>(machInst.si))
    {
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntImmCompLogicOp : public IntCompOp
{
  protected:
 
    uint32_t ui;
 
    IntImmCompLogicOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntCompOp(mnem, _machInst, __opClass),
        ui(machInst.ui)
    {
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntLogicOp : public IntOp
{
  protected:
 
    IntLogicOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntOp(mnem, _machInst, __opClass)
    {
    }
 
    /* Compute the number of consecutive zero bits starting from the
       leftmost bit and moving right in a 32-bit integer */
    inline int
    findLeadingZeros(uint32_t rs) const
    {
        if (rs) {
    #if defined(__GNUC__) || (defined(__clang__) && \
                              __has_builtin(__builtin_clz))
            return __builtin_clz(rs);
    #else
            return 31 - findMsbSet(rs);
    #endif
        } else {
            return 32;
        }
    }
 
    /* Compute the number of consecutive zero bits starting from the
       leftmost bit and moving right in a 64-bit integer */
    inline int
    findLeadingZeros(uint64_t rs) const
    {
        if (rs) {
    #if defined(__GNUC__) || (defined(__clang__) && \
                              __has_builtin(__builtin_clzll))
            return __builtin_clzll(rs);
    #else
            return 63 - findMsbSet(rs);
    #endif
        } else {
            return 64;
        }
    }
 
    /* Compute the number of consecutive zero bits starting from the
       rightmost bit and moving left in a 32-bit integer */
    inline int
    findTrailingZeros(uint32_t rs) const
    {
        if (rs) {
    #if defined(__GNUC__) || (defined(__clang__) && \
                              __has_builtin(__builtin_ctz))
            return __builtin_ctz(rs);
    #else
            return findLsbSet(rs);
    #endif
        } else {
            return 32;
        }
    }
 
    /* Compute the number of consecutive zero bits starting from the
       rightmost bit and moving left in a 64-bit integer */
    inline int
    findTrailingZeros(uint64_t rs) const
    {
        if (rs) {
    #if defined(__GNUC__) || (defined(__clang__) && \
                              __has_builtin(__builtin_ctzll))
            return __builtin_ctzll(rs);
    #else
            return findLsbSet(rs);
    #endif
        } else {
            return 64;
        }
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntImmLogicOp : public IntLogicOp
{
  protected:
 
    uint32_t ui;
 
    IntImmLogicOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntLogicOp(mnem, _machInst, __opClass),
        ui(machInst.ui)
    {
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntShiftOp : public IntOp
{
  protected:
 
    uint8_t sh;
 
    IntShiftOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntOp(mnem, _machInst, __opClass),
        sh(machInst.sh)
    {
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntConcatShiftOp : public IntOp
{
  protected:
 
    uint8_t sh;
 
    IntConcatShiftOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntOp(mnem, _machInst, __opClass),
        sh((machInst.shn << 5) | machInst.sh)
    {
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntRotateOp : public IntShiftOp
{
  protected:
 
    uint8_t mb;
    uint8_t me;
 
    IntRotateOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntShiftOp(mnem, _machInst, __opClass),
        mb(machInst.mb),
        me(machInst.me)
    {
    }
 
    inline uint64_t
    rotate(uint32_t value, uint32_t shift) const
    {
        uint64_t res;
        shift = shift & 0x1f;
        res = value;
        res = (res << 32) | res;
        res = (res << shift) | (res >> (32 - shift));
        return res;
    }
 
    inline uint64_t
    bitmask(uint32_t begin, uint32_t end) const
    {
        begin = begin & 0x1f;
        end = end & 0x1f;
        if (begin <= end) {
            return mask(31 - begin, 31 - end);
        } else {
            return ~mask(31 - (end + 1), 31 - (begin - 1));
        }
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntConcatRotateOp : public IntConcatShiftOp
{
  protected:
 
    uint8_t mb;
    uint8_t me;
 
    IntConcatRotateOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntConcatShiftOp(mnem, _machInst, __opClass),
        mb((machInst.mbn << 5) | machInst.mb),
        me((machInst.men << 5) | machInst.mb)
    {
    }
 
    inline uint64_t
    rotate(uint64_t value, uint32_t shift) const
    {
        shift = shift & 0x3f;
        return (value << shift) | (value >> (64 - shift));
    }
 
    inline uint64_t
    bitmask(uint32_t begin, uint32_t end) const
    {
        begin = begin & 0x3f;
        end = end & 0x3f;
        if (begin <= end) {
            return mask(63 - begin, 63 - end);
        } else {
            return ~mask(63 - (end + 1), 63 - (begin - 1));
        }
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntTrapOp : public IntOp
{
  protected:
    uint8_t to;
 
    IntTrapOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntOp(mnem, _machInst, __opClass),
        to(machInst.to)
    {
    }
 
    inline bool
    checkTrap(int64_t a, int64_t b) const
    {
        if (((to & 0x10) && (a < b))  ||
            ((to & 0x08) && (a > b))  ||
            ((to & 0x04) && (a == b)) ||
            ((to & 0x02) && ((uint64_t)a < (uint64_t)b)) ||
            ((to & 0x01) && ((uint64_t)a > (uint64_t)b))) {
            return true;
        }
 
        return false;
    }
 
    inline std::string
    suffix() const
    {
        std::string str;
 
        switch (to) {
            case 1:  str = "lgt"; break;
            case 2:  str = "llt"; break;
            case 4:  str = "eq"; break;
            case 5:  str = "lge"; break;
            case 6:  str = "lle"; break;
            case 8:  str = "gt"; break;
            case 12: str = "ge"; break;
            case 16: str = "lt"; break;
            case 20: str = "le"; break;
            case 24: str = "ne"; break;
            case 31: str = "u"; break;
        }
 
        return str;
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
 
class IntImmTrapOp : public IntTrapOp
{
  protected:
    int32_t si;
 
   IntImmTrapOp(const char *mnem, MachInst _machInst, OpClass __opClass)
      : IntTrapOp(mnem, _machInst, __opClass),
        si(sext<16>(machInst.si))
    {
    }
 
    std::string generateDisassembly(
            Addr pc, const loader::SymbolTable *symtab) const override;
};
 
} // namespace PowerISA
} // namespace gem5
 
#endif //__ARCH_POWER_INSTS_INTEGER_HH__