calc.cc File Reference

#include "kernel/yosys.h"
#include "libs/bigint/BigIntegerLibrary.hh"

Include dependency graph for calc.cc:

Go to the source code of this file.

Functions
static YOSYS_NAMESPACE_BEGIN void	extend_u0 (RTLIL::Const &arg, int width, bool is_signed)
static BigInteger	const2big (const RTLIL::Const &val, bool as_signed, int &undef_bit_pos)
static RTLIL::Const	big2const (const BigInteger &val, int result_len, int undef_bit_pos)
static RTLIL::State	logic_and (RTLIL::State a, RTLIL::State b)
static RTLIL::State	logic_or (RTLIL::State a, RTLIL::State b)
static RTLIL::State	logic_xor (RTLIL::State a, RTLIL::State b)
static RTLIL::State	logic_xnor (RTLIL::State a, RTLIL::State b)
static RTLIL::Const	logic_wrapper (RTLIL::State(*logic_func)(RTLIL::State, RTLIL::State), RTLIL::Const arg1, RTLIL::Const arg2, bool signed1, bool signed2, int result_len=-1)
static RTLIL::Const	logic_reduce_wrapper (RTLIL::State initial, RTLIL::State(*logic_func)(RTLIL::State, RTLIL::State), const RTLIL::Const &arg1, int result_len)
static RTLIL::Const	const_shift_worker (const RTLIL::Const &arg1, const RTLIL::Const &arg2, bool sign_ext, int direction, int result_len)
static RTLIL::Const	const_shift_shiftx (const RTLIL::Const &arg1, const RTLIL::Const &arg2, bool, bool signed2, int result_len, RTLIL::State other_bits)

Function Documentation

static RTLIL::Const big2const ( const BigInteger &  val, int  result_len, int  undef_bit_pos  )

static

Definition at line 61 of file calc.cc.

{
    if (undef_bit_pos >= 0)
        return RTLIL::Const(RTLIL::State::Sx, result_len);

    BigUnsigned mag = val.getMagnitude();
    RTLIL::Const result(0, result_len);

    if (!mag.isZero())
    {
        if (val.getSign() < 0)
        {
            mag--;
            for (int i = 0; i < result_len; i++)
                result.bits[i] = mag.getBit(i) ? RTLIL::State::S0 : RTLIL::State::S1;
        }
        else
        {
            for (int i = 0; i < result_len; i++)
                result.bits[i] = mag.getBit(i) ? RTLIL::State::S1 : RTLIL::State::S0;
        }
    }

#if 0
    if (undef_bit_pos >= 0)
        for (int i = undef_bit_pos; i < result_len; i++)
            result.bits[i] = RTLIL::State::Sx;
#endif

    return result;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static BigInteger const2big ( const RTLIL::Const &  val, bool  as_signed, int &  undef_bit_pos  )

static

Definition at line 42 of file calc.cc.

{
    BigInteger result = 0, this_bit = 1;
    for (size_t i = 0; i < val.bits.size(); i++) {
        if (val.bits[i] == RTLIL::State::S1) {
            if (as_signed && i+1 == val.bits.size())
                result -= this_bit;
            else
                result += this_bit;
        }
        else if (val.bits[i] != RTLIL::State::S0) {
            if (undef_bit_pos < 0)
                undef_bit_pos = i;
        }
        this_bit *= 2;
    }
    return result;
}

Here is the caller graph for this function:

static RTLIL::Const const_shift_shiftx ( const RTLIL::Const &  arg1, const RTLIL::Const &  arg2, bool  , bool  signed2, int  result_len, RTLIL::State  other_bits  )

static

Definition at line 324 of file calc.cc.

{
    int undef_bit_pos = -1;
    BigInteger offset = const2big(arg2, signed2, undef_bit_pos);

    if (result_len < 0)
        result_len = arg1.bits.size();

    RTLIL::Const result(RTLIL::State::Sx, result_len);
    if (undef_bit_pos >= 0)
        return result;

    for (int i = 0; i < result_len; i++) {
        BigInteger pos = BigInteger(i) + offset;
        if (pos < 0 || pos >= arg1.bits.size())
            result.bits[i] = other_bits;
        else
            result.bits[i] = arg1.bits[pos.toInt()];
    }

    return result;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static RTLIL::Const const_shift_worker ( const RTLIL::Const &  arg1, const RTLIL::Const &  arg2, bool  sign_ext, int  direction, int  result_len  )

static

Definition at line 271 of file calc.cc.

{
    int undef_bit_pos = -1;
    BigInteger offset = const2big(arg2, false, undef_bit_pos) * direction;

    if (result_len < 0)
        result_len = arg1.bits.size();

    RTLIL::Const result(RTLIL::State::Sx, result_len);
    if (undef_bit_pos >= 0)
        return result;

    for (int i = 0; i < result_len; i++) {
        BigInteger pos = BigInteger(i) + offset;
        if (pos < 0)
            result.bits[i] = RTLIL::State::S0;
        else if (pos >= arg1.bits.size())
            result.bits[i] = sign_ext ? arg1.bits.back() : RTLIL::State::S0;
        else
            result.bits[i] = arg1.bits[pos.toInt()];
    }

    return result;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static YOSYS_NAMESPACE_BEGIN void extend_u0 ( RTLIL::Const &  arg, int  width, bool  is_signed  )

static

Definition at line 29 of file calc.cc.

{
    RTLIL::State padding = RTLIL::State::S0;

    if (arg.bits.size() > 0 && is_signed)
        padding = arg.bits.back();

    while (int(arg.bits.size()) < width)
        arg.bits.push_back(padding);

    arg.bits.resize(width);
}

Here is the caller graph for this function:

static RTLIL::State logic_and ( RTLIL::State  a, RTLIL::State  b  )

static

Definition at line 93 of file calc.cc.

{
    if (a == RTLIL::State::S0) return RTLIL::State::S0;
    if (b == RTLIL::State::S0) return RTLIL::State::S0;
    if (a != RTLIL::State::S1) return RTLIL::State::Sx;
    if (b != RTLIL::State::S1) return RTLIL::State::Sx;
    return RTLIL::State::S1;
}

Here is the caller graph for this function:

static RTLIL::State logic_or ( RTLIL::State  a, RTLIL::State  b  )

static

Definition at line 102 of file calc.cc.

{
    if (a == RTLIL::State::S1) return RTLIL::State::S1;
    if (b == RTLIL::State::S1) return RTLIL::State::S1;
    if (a != RTLIL::State::S0) return RTLIL::State::Sx;
    if (b != RTLIL::State::S0) return RTLIL::State::Sx;
    return RTLIL::State::S0;
}

Here is the caller graph for this function:

static RTLIL::Const logic_reduce_wrapper ( RTLIL::State  initial, RTLIL::State(*)(RTLIL::State, RTLIL::State)  logic_func, const RTLIL::Const &  arg1, int  result_len  )

static

Definition at line 185 of file calc.cc.

{
    RTLIL::State temp = initial;

    for (size_t i = 0; i < arg1.bits.size(); i++)
        temp = logic_func(temp, arg1.bits[i]);

    RTLIL::Const result(temp);
    while (int(result.bits.size()) < result_len)
        result.bits.push_back(RTLIL::State::S0);
    return result;
}

Here is the caller graph for this function:

static RTLIL::Const logic_wrapper ( RTLIL::State(*)(RTLIL::State, RTLIL::State)  logic_func, RTLIL::Const  arg1, RTLIL::Const  arg2, bool  signed1, bool  signed2, int  result_len = -1  )

static

Definition at line 146 of file calc.cc.

{
    if (result_len < 0)
        result_len = std::max(arg1.bits.size(), arg2.bits.size());

    extend_u0(arg1, result_len, signed1);
    extend_u0(arg2, result_len, signed2);

    RTLIL::Const result(RTLIL::State::Sx, result_len);
    for (size_t i = 0; i < size_t(result_len); i++) {
        RTLIL::State a = i < arg1.bits.size() ? arg1.bits[i] : RTLIL::State::S0;
        RTLIL::State b = i < arg2.bits.size() ? arg2.bits[i] : RTLIL::State::S0;
        result.bits[i] = logic_func(a, b);
    }

    return result;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static RTLIL::State logic_xnor ( RTLIL::State  a, RTLIL::State  b  )

static

Definition at line 118 of file calc.cc.

{
    if (a != RTLIL::State::S0 && a != RTLIL::State::S1) return RTLIL::State::Sx;
    if (b != RTLIL::State::S0 && b != RTLIL::State::S1) return RTLIL::State::Sx;
    return a == b ? RTLIL::State::S1 : RTLIL::State::S0;
}

Here is the caller graph for this function:

static RTLIL::State logic_xor ( RTLIL::State  a, RTLIL::State  b  )

static

Definition at line 111 of file calc.cc.

{
    if (a != RTLIL::State::S0 && a != RTLIL::State::S1) return RTLIL::State::Sx;
    if (b != RTLIL::State::S0 && b != RTLIL::State::S1) return RTLIL::State::Sx;
    return a != b ? RTLIL::State::S1 : RTLIL::State::S0;
}

Here is the caller graph for this function: