const2ast.cc File Reference

#include "verilog_frontend.h"
#include "kernel/log.h"
#include <string.h>
#include <math.h>

Include dependency graph for const2ast.cc:

Go to the source code of this file.

Functions
static int	my_decimal_div_by_two (std::vector< uint8_t > &digits)
static int	my_ilog2 (int x)
static void	my_strtobin (std::vector< RTLIL::State > &data, const char *str, int len_in_bits, int base, char case_type)

Function Documentation

static int my_decimal_div_by_two ( std::vector< uint8_t > &  digits )

static

Definition at line 47 of file const2ast.cc.

{
    int carry = 0;
    for (size_t i = 0; i < digits.size(); i++) {
        log_assert(digits[i] < 10);
        digits[i] += carry * 10;
        carry = digits[i] % 2;
        digits[i] /= 2;
    }
    while (!digits.empty() && !digits.front())
        digits.erase(digits.begin());
    return carry;
}

Here is the caller graph for this function:

static int my_ilog2 ( int  x )

static

Definition at line 62 of file const2ast.cc.

{
    int ret = 0;
    while (x != 0 && x != -1) {
        x = x >> 1;
        ret++;
    }
    return ret;
}

Here is the caller graph for this function:

static void my_strtobin ( std::vector< RTLIL::State > &  data, const char *  str, int  len_in_bits, int  base, char  case_type  )

static

Definition at line 73 of file const2ast.cc.

{
    // all digits in string (MSB at index 0)
    std::vector<uint8_t> digits;

    while (*str) {
        if ('0' <= *str && *str <= '9')
            digits.push_back(*str - '0');
        else if ('a' <= *str && *str <= 'f')
            digits.push_back(10 + *str - 'a');
        else if ('A' <= *str && *str <= 'F')
            digits.push_back(10 + *str - 'A');
        else if (*str == 'x' || *str == 'X')
            digits.push_back(0xf0);
        else if (*str == 'z' || *str == 'Z')
            digits.push_back(0xf1);
        else if (*str == '?')
            digits.push_back(0xf2);
        str++;
    }

    if (base == 10) {
        data.clear();
        if (len_in_bits < 0) {
            while (!digits.empty())
                data.push_back(my_decimal_div_by_two(digits) ? RTLIL::S1 : RTLIL::S0);
            while (data.size() < 32)
                data.push_back(RTLIL::S0);
        } else {
            for (int i = 0; i < len_in_bits; i++)
                data.push_back(my_decimal_div_by_two(digits) ? RTLIL::S1 : RTLIL::S0);
        }
        return;
    }

    int bits_per_digit = my_ilog2(base-1);
    if (len_in_bits < 0)
        len_in_bits = std::max<int>(digits.size() * bits_per_digit, 32);

    data.clear();
    data.resize(len_in_bits);

    for (int i = 0; i < len_in_bits; i++) {
        int bitmask = 1 << (i % bits_per_digit);
        int digitidx = digits.size() - (i / bits_per_digit) - 1;
        if (digitidx < 0) {
            if (i > 0 && (data[i-1] == RTLIL::Sz || data[i-1] == RTLIL::Sx || data[i-1] == RTLIL::Sa))
                data[i] = data[i-1];
            else
                data[i] = RTLIL::S0;
        } else if (digits[digitidx] == 0xf0)
            data[i] = case_type == 'x' ? RTLIL::Sa : RTLIL::Sx;
        else if (digits[digitidx] == 0xf1)
            data[i] = case_type == 'x' || case_type == 'z' ? RTLIL::Sa : RTLIL::Sz;
        else if (digits[digitidx] == 0xf2)
            data[i] = RTLIL::Sa;
        else
            data[i] = (digits[digitidx] & bitmask) ? RTLIL::S1 : RTLIL::S0;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function: