BitPatternPool Struct Reference

#include <bitpattern.h>

Public Types
typedef std::vector< RTLIL::State >	bits_t

Public Member Functions
	BitPatternPool (RTLIL::SigSpec sig)
	BitPatternPool (int width)
bits_t	sig2bits (RTLIL::SigSpec sig)
bool	match (bits_t a, bits_t b)
bool	has_any (RTLIL::SigSpec sig)
bool	has_all (RTLIL::SigSpec sig)
bool	take (RTLIL::SigSpec sig)
bool	take_all ()
bool	empty ()

Data Fields
int	width
std::set< bits_t >	pool

Detailed Description

Definition at line 28 of file bitpattern.h.

Member Typedef Documentation

typedef std::vector<RTLIL::State> BitPatternPool::bits_t

Definition at line 31 of file bitpattern.h.

Constructor & Destructor Documentation

BitPatternPool::BitPatternPool ( RTLIL::SigSpec  sig )

inline

Definition at line 34 of file bitpattern.h.

    {
        width = sig.size();
        if (width > 0) {
            std::vector<RTLIL::State> pattern(width);
            for (int i = 0; i < width; i++) {
                if (sig[i].wire == NULL && sig[i].data <= RTLIL::State::S1)
                    pattern[i] = sig[i].data;
                else
                    pattern[i] = RTLIL::State::Sa;
            }
            pool.insert(pattern);
        }
    }

Here is the call graph for this function:

BitPatternPool::BitPatternPool ( int  width )

inline

Definition at line 49 of file bitpattern.h.

    {
        this->width = width;
        if (width > 0) {
            std::vector<RTLIL::State> pattern(width);
            for (int i = 0; i < width; i++)
                pattern[i] = RTLIL::State::Sa;
            pool.insert(pattern);
        }
    }

Member Function Documentation

bool BitPatternPool::empty ( )

inline

Definition at line 132 of file bitpattern.h.

    {
        return pool.empty();
    }

Here is the caller graph for this function:

bool BitPatternPool::has_all ( RTLIL::SigSpec  sig )

inline

Definition at line 88 of file bitpattern.h.

    {
        bits_t bits = sig2bits(sig);
        for (auto &it : pool)
            if (match(it, bits)) {
                for (int i = 0; i < width; i++)
                    if (bits[i] > RTLIL::State::S1 && it[i] <= RTLIL::State::S1)
                        goto next_pool_entry;
                return true;
    next_pool_entry:;
            }
        return false;
    }

Here is the call graph for this function:

bool BitPatternPool::has_any ( RTLIL::SigSpec  sig )

inline

Definition at line 79 of file bitpattern.h.

    {
        bits_t bits = sig2bits(sig);
        for (auto &it : pool)
            if (match(it, bits))
                return true;
        return false;
    }

Here is the call graph for this function:

bool BitPatternPool::match ( bits_t  a, bits_t  b  )

inline

Definition at line 69 of file bitpattern.h.

    {
        log_assert(int(a.size()) == width);
        log_assert(int(b.size()) == width);
        for (int i = 0; i < width; i++)
            if (a[i] <= RTLIL::State::S1 && b[i] <= RTLIL::State::S1 && a[i] != b[i])
                return false;
        return true;
    }

Here is the caller graph for this function:

bits_t BitPatternPool::sig2bits ( RTLIL::SigSpec  sig )

inline

Definition at line 60 of file bitpattern.h.

    {
        bits_t bits = sig.as_const().bits;
        for (auto &b : bits)
            if (b > RTLIL::State::S1)
                b = RTLIL::State::Sa;
        return bits;
    }

Here is the call graph for this function:

Here is the caller graph for this function:

bool BitPatternPool::take ( RTLIL::SigSpec  sig )

inline

Definition at line 102 of file bitpattern.h.

    {
        bool status = false;
        bits_t bits = sig2bits(sig);
        std::vector<bits_t> pattern_list;
        for (auto &it : pool)
            if (match(it, bits))
                pattern_list.push_back(it);
        for (auto pattern : pattern_list) {
            pool.erase(pattern);
            for (int i = 0; i < width; i++) {
                if (pattern[i] != RTLIL::State::Sa || bits[i] == RTLIL::State::Sa)
                    continue;
                bits_t new_pattern = pattern;
                new_pattern[i] = bits[i] == RTLIL::State::S1 ? RTLIL::State::S0 : RTLIL::State::S1;
                pool.insert(new_pattern);
            }
            status = true;
        }
        return status;
    }

Here is the call graph for this function:

Here is the caller graph for this function:

bool BitPatternPool::take_all ( )

inline

Definition at line 124 of file bitpattern.h.

    {
        if (pool.empty())
            return false;
        pool.clear();
        return true;
    }

Here is the caller graph for this function:

Field Documentation

std::set<bits_t> BitPatternPool::pool

Definition at line 32 of file bitpattern.h.

int BitPatternPool::width

Definition at line 30 of file bitpattern.h.

---

The documentation for this struct was generated from the following file:

• bitpattern.h