iverilog/vvp/vvp_darray.cc

/*
 * Copyright (c) 2012-2020 Stephen Williams (steve@icarus.com)
 *
 *    This source code is free software; you can redistribute it
 *    and/or modify it in source code form under the terms of the GNU
 *    General Public License as published by the Free Software
 *    Foundation; either version 2 of the License, or (at your option)
 *    any later version.
 *
 *    This program is distributed in the hope that it will be useful,
 *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *    GNU General Public License for more details.
 *
 *    You should have received a copy of the GNU General Public License
 *    along with this program; if not, write to the Free Software
 *    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 */

# include  "vvp_darray.h"
# include  <iostream>
# include  <typeinfo>

using namespace std;

vvp_darray::~vvp_darray()
{
}

void vvp_darray::set_word(unsigned, const vvp_vector4_t&)
{
      cerr << "XXXX set_word(vvp_vector4_t) not implemented for " << typeid(*this).name() << endl;
}

void vvp_darray::set_word(unsigned, double)
{
      cerr << "XXXX set_word(double) not implemented for " << typeid(*this).name() << endl;
}

void vvp_darray::set_word(unsigned, const string&)
{
      cerr << "XXXX set_word(string) not implemented for " << typeid(*this).name() << endl;
}

void vvp_darray::set_word(unsigned, const vvp_object_t&)
{
      cerr << "XXXX set_word(vvp_object_t) not implemented for " << typeid(*this).name() << endl;
}

void vvp_darray::get_word(unsigned, vvp_vector4_t&)
{
      cerr << "XXXX get_word(vvp_vector4_t) not implemented for " << typeid(*this).name() << endl;
}

void vvp_darray::get_word(unsigned, double&)
{
      cerr << "XXXX get_word(double) not implemented for " << typeid(*this).name() << endl;
}

void vvp_darray::get_word(unsigned, string&)
{
      cerr << "XXXX get_word(string) not implemented for " << typeid(*this).name() << endl;
}

void vvp_darray::get_word(unsigned, vvp_object_t&)
{
      cerr << "XXXX get_word(vvp_object_t) not implemented for " << typeid(*this).name() << endl;
}

void vvp_darray::shallow_copy(const vvp_object*)
{
      cerr << "XXXX shallow_copy(vvp_object_t) not implemented for " << typeid(*this).name() << endl;
}

vvp_vector4_t vvp_darray::get_bitstream(bool)
{
      cerr << "XXXX get_bitstream() not implemented for " << typeid(*this).name() << endl;
      return vvp_vector4_t();
}

template <class TYPE> vvp_darray_atom<TYPE>::~vvp_darray_atom()
{
}

template <class TYPE> size_t vvp_darray_atom<TYPE>::get_size() const
{
      return array_.size();
}

template <class TYPE> void vvp_darray_atom<TYPE>::set_word(unsigned adr, const vvp_vector4_t&value)
{
      if (adr >= array_.size())
	    return;
      TYPE tmp;
      vector4_to_value(value, tmp, true, false);
      array_[adr] = tmp;
}

template <class TYPE> void vvp_darray_atom<TYPE>::get_word(unsigned adr, vvp_vector4_t&value)
{
      if (adr >= array_.size()) {
	    value = vvp_vector4_t(8*sizeof(TYPE), BIT4_X);
	    return;
      }

      TYPE word = array_[adr];
      vvp_vector4_t tmp (8*sizeof(TYPE), BIT4_0);
      for (unsigned idx = 0 ; idx < tmp.size() ; idx += 1) {
	    if (word&1) tmp.set_bit(idx, BIT4_1);
	    word >>= 1;
      }
      value = tmp;
}

template <class TYPE> void vvp_darray_atom<TYPE>::shallow_copy(const vvp_object*obj)
{
      const vvp_darray_atom<TYPE>*that = dynamic_cast<const vvp_darray_atom<TYPE>*>(obj);
      assert(that);

      unsigned num_items = min(array_.size(), that->array_.size());
      for (unsigned idx = 0 ; idx < num_items ; idx += 1)
	    array_[idx] = that->array_[idx];
}

template <class TYPE> vvp_vector4_t vvp_darray_atom<TYPE>::get_bitstream(bool)
{
      const unsigned word_wid = sizeof(TYPE) * 8;

      vvp_vector4_t vec(array_.size() * word_wid, BIT4_0);

      unsigned adx = 0;
      unsigned vdx = vec.size();
      while (vdx > 0) {
            TYPE word = array_[adx++];
            vdx -= word_wid;
            for (unsigned bdx = 0; bdx < word_wid; bdx += 1) {
                  if (word & 1)
                        vec.set_bit(vdx+bdx, BIT4_1);
                  word >>= 1;
            }
      }

      return vec;
}

template class vvp_darray_atom<uint8_t>;
template class vvp_darray_atom<uint16_t>;
template class vvp_darray_atom<uint32_t>;
template class vvp_darray_atom<uint64_t>;
template class vvp_darray_atom<int8_t>;
template class vvp_darray_atom<int16_t>;
template class vvp_darray_atom<int32_t>;
template class vvp_darray_atom<int64_t>;

vvp_darray_vec4::~vvp_darray_vec4()
{
}

size_t vvp_darray_vec4::get_size(void) const
{
      return array_.size();
}

void vvp_darray_vec4::set_word(unsigned adr, const vvp_vector4_t&value)
{
      if (adr >= array_.size()) return;
      assert(value.size() == word_wid_);
      array_[adr] = value;
}

void vvp_darray_vec4::get_word(unsigned adr, vvp_vector4_t&value)
{
	/*
	 * Return an undefined value for an out of range address or if the
	 * value has not been written yet (has a size of zero).
	 */
      if ((adr >= array_.size()) || (array_[adr].size() == 0)) {
	    value = vvp_vector4_t(word_wid_, BIT4_X);
	    return;
      }
      value = array_[adr];
      assert(value.size() == word_wid_);
}

void vvp_darray_vec4::shallow_copy(const vvp_object*obj)
{
      const vvp_darray_vec4*that = dynamic_cast<const vvp_darray_vec4*>(obj);
      assert(that);

      unsigned num_items = min(array_.size(), that->array_.size());
      for (unsigned idx = 0 ; idx < num_items ; idx += 1)
	    array_[idx] = that->array_[idx];
}

vvp_vector4_t vvp_darray_vec4::get_bitstream(bool as_vec4)
{
      vvp_vector4_t vec(array_.size() * word_wid_, BIT4_0);

      unsigned adx = 0;
      unsigned vdx = vec.size();
      while (vdx > 0) {
            vdx -= word_wid_;
            for (unsigned bdx = 0; bdx < word_wid_; bdx += 1) {
                  vvp_bit4_t bit = array_[adx].value(bdx);
                  if (as_vec4 || (bit == BIT4_1))
                        vec.set_bit(vdx+bdx, bit);
            }
            adx++;
      }

      return vec;
}

vvp_darray_vec2::~vvp_darray_vec2()
{
}

size_t vvp_darray_vec2::get_size(void) const
{
      return array_.size();
}

void vvp_darray_vec2::set_word(unsigned adr, const vvp_vector4_t&value)
{
      if (adr >= array_.size()) return;
      assert(value.size() == word_wid_);
      array_[adr] = value;
}

void vvp_darray_vec2::get_word(unsigned adr, vvp_vector4_t&value)
{
	/*
	 * Return a zero value for an out of range address or if the
	 * value has not been written yet (has a size of zero).
	 */
      if ((adr >= array_.size()) || (array_[adr].size() == 0)) {
	    value = vvp_vector4_t(word_wid_, BIT4_0);
	    return;
      }
      assert(array_[adr].size() == word_wid_);
      value.resize(word_wid_);
      for (unsigned idx = 0; idx < word_wid_; idx += 1) {
	    value.set_bit(idx, array_[adr].value4(idx));
      }
}

void vvp_darray_vec2::shallow_copy(const vvp_object*obj)
{
      const vvp_darray_vec2*that = dynamic_cast<const vvp_darray_vec2*>(obj);
      assert(that);

      unsigned num_items = min(array_.size(), that->array_.size());
      for (unsigned idx = 0 ; idx < num_items ; idx += 1)
	    array_[idx] = that->array_[idx];
}

vvp_vector4_t vvp_darray_vec2::get_bitstream(bool)
{
      vvp_vector4_t vec(array_.size() * word_wid_, BIT4_0);

      unsigned adx = 0;
      unsigned vdx = vec.size();
      while (vdx > 0) {
            vdx -= word_wid_;
            for (unsigned bdx = 0; bdx < word_wid_; bdx += 1) {
                  if (array_[adx].value(bdx))
                        vec.set_bit(vdx+bdx, BIT4_1);
            }
            adx++;
      }

      return vec;
}

vvp_darray_object::~vvp_darray_object()
{
}

size_t vvp_darray_object::get_size() const
{
      return array_.size();
}

void vvp_darray_object::set_word(unsigned adr, const vvp_object_t&value)
{
      if (adr >= array_.size())
	    return;
      array_[adr] = value;
}

void vvp_darray_object::get_word(unsigned adr, vvp_object_t&value)
{
      if (adr >= array_.size()) {
	    value = vvp_object_t();
	    return;
      }

      value = array_[adr];
}

void vvp_darray_object::shallow_copy(const vvp_object*obj)
{
      const vvp_darray_object*that = dynamic_cast<const vvp_darray_object*>(obj);
      assert(that);

      unsigned num_items = min(array_.size(), that->array_.size());
      for (unsigned idx = 0 ; idx < num_items ; idx += 1)
	    array_[idx] = that->array_[idx];
}

vvp_darray_real::~vvp_darray_real()
{
}

size_t vvp_darray_real::get_size() const
{
      return array_.size();
}

void vvp_darray_real::set_word(unsigned adr, double value)
{
      if (adr >= array_.size())
	    return;
      array_[adr] = value;
}

void vvp_darray_real::get_word(unsigned adr, double&value)
{
      if (adr >= array_.size()) {
	    value = 0.0;
	    return;
      }

      value = array_[adr];
}

void vvp_darray_real::shallow_copy(const vvp_object*obj)
{
      const vvp_darray_real*that = dynamic_cast<const vvp_darray_real*>(obj);
      assert(that);

      unsigned num_items = min(array_.size(), that->array_.size());
      for (unsigned idx = 0 ; idx < num_items ; idx += 1)
	    array_[idx] = that->array_[idx];
}

vvp_vector4_t vvp_darray_real::get_bitstream(bool)
{
      const unsigned word_wid = sizeof(double) * 8;
      assert(word_wid == 64);

      vvp_vector4_t vec(array_.size() * word_wid, BIT4_0);

      unsigned adx = 0;
      unsigned vdx = vec.size();
      while (vdx > 0) {
            union {
                double   value;
                uint64_t bits;
            } word;
            word.value = array_[adx++];
            vdx -= word_wid;
            for (unsigned bdx = 0; bdx < word_wid; bdx += 1) {
                  if (word.bits & 1)
                        vec.set_bit(vdx+bdx, BIT4_1);
                  word.bits >>= 1;
            }
      }

      return vec;
}

vvp_darray_string::~vvp_darray_string()
{
}

size_t vvp_darray_string::get_size() const
{
      return array_.size();
}

void vvp_darray_string::set_word(unsigned adr, const string&value)
{
      if (adr >= array_.size())
	    return;
      array_[adr] = value;
}

void vvp_darray_string::get_word(unsigned adr, string&value)
{
      if (adr >= array_.size()) {
	    value = "";
	    return;
      }

      value = array_[adr];
}

void vvp_darray_string::shallow_copy(const vvp_object*obj)
{
      const vvp_darray_string*that = dynamic_cast<const vvp_darray_string*>(obj);
      assert(that);

      unsigned num_items = min(array_.size(), that->array_.size());
      for (unsigned idx = 0 ; idx < num_items ; idx += 1)
	    array_[idx] = that->array_[idx];
}

vvp_queue::~vvp_queue()
{
}

void vvp_queue::push_back(const vvp_vector4_t&, unsigned)
{
      cerr << "XXXX push_back(vvp_vector4_t) not implemented for " << typeid(*this).name() << endl;
}

void vvp_queue::push_front(const vvp_vector4_t&, unsigned)
{
      cerr << "XXXX push_front(vvp_vector4_t) not implemented for " << typeid(*this).name() << endl;
}

void vvp_queue::push_back(double, unsigned)
{
      cerr << "XXXX push_back(double) not implemented for " << typeid(*this).name() << endl;
}

void vvp_queue::push_front(double, unsigned)
{
      cerr << "XXXX push_front(double) not implemented for " << typeid(*this).name() << endl;
}

void vvp_queue::push_back(const string&, unsigned)
{
      cerr << "XXXX push_back(string) not implemented for " << typeid(*this).name() << endl;
}

void vvp_queue::push_front(const string&, unsigned)
{
      cerr << "XXXX push_front(string) not implemented for " << typeid(*this).name() << endl;
}

vvp_queue_real::~vvp_queue_real()
{
}

void vvp_queue_real::set_word(unsigned adr, double value)
{
      if (adr < queue.size())
	    queue[adr] = value;
}

void vvp_queue_real::get_word(unsigned adr, double&value)
{
      if (adr >= queue.size())
	    value = 0.0;
      else
	    value = queue[adr];
}

void vvp_queue_real::push_back(double value, unsigned max_size)
{
      if (!max_size || (queue.size() < max_size)) queue.push_back(value);
      else cerr << "Warning: push_back(" << value
                << ") skipped for already full bounded queue ["
                << max_size << "]." << endl;
}

void vvp_queue_real::push_front(double value, unsigned max_size)
{
      if (max_size && (queue.size() == max_size)) {
	    cerr << "Warning: push_front(" << value << ") removed "
	         << queue.back() << " from already full bounded queue ["
	         << max_size << "]." << endl;
	    queue.pop_back();
      }
      queue.push_front(value);
}

void vvp_queue_real::erase(unsigned idx)
{
      std::deque<double>::iterator pos = queue.begin();
      for (unsigned count = 0; count < idx; ++count) ++pos;
      queue.erase(pos);
}

vvp_queue_string::~vvp_queue_string()
{
}

void vvp_queue_string::set_word(unsigned adr, const string&value)
{
      if (adr < queue.size())
	    queue[adr] = value;
}

void vvp_queue_string::get_word(unsigned adr, string&value)
{
      if (adr >= queue.size())
	    value = "";
      else
	    value = queue[adr];
}

void vvp_queue_string::push_back(const string&value, unsigned max_size)
{
      if (!max_size || (queue.size() < max_size)) queue.push_back(value);
      else cerr << "Warning: push_back(\"" << value
                << "\") skipped for already full bounded queue ["
                << max_size << "]." << endl;
}

void vvp_queue_string::push_front(const string&value, unsigned max_size)
{
      if (max_size && (queue.size() == max_size)) {
	    cerr << "Warning: push_front(\"" << value << "\") removed \""
	         << queue.back() << "\" from already full bounded queue ["
	         << max_size << "]." << endl;
	    queue.pop_back();
      }
      queue.push_front(value);
}

void vvp_queue_string::erase(unsigned idx)
{
      std::deque<std::string>::iterator pos = queue.begin();
      for (unsigned count = 0; count < idx; ++count) ++pos;
      queue.erase(pos);
}

vvp_queue_vec4::~vvp_queue_vec4()
{
}

void vvp_queue_vec4::set_word(unsigned adr, const vvp_vector4_t&value)
{
      if (adr < queue.size())
	    queue[adr] = value;
}

void vvp_queue_vec4::get_word(unsigned adr, vvp_vector4_t&value)
{
      if (adr >= queue.size())
	    value = vvp_vector4_t(queue[0].size());
      else
	    value = queue[adr];
}

void vvp_queue_vec4::push_back(const vvp_vector4_t&value, unsigned max_size)
{
      if (!max_size || (queue.size() < max_size)) queue.push_back(value);
      else cerr << "Warning: push_back(" << value
                << ") skipped for already full bounded queue ["
                << max_size << "]." << endl;
}

void vvp_queue_vec4::push_front(const vvp_vector4_t&value, unsigned max_size)
{
      if (max_size && (queue.size() == max_size)) {
	    cerr << "Warning: push_front(" << value << ") removed "
	         << queue.back() << " from already full bounded queue ["
	         << max_size << "]." << endl;
	    queue.pop_back();
      }
      queue.push_front(value);
}

void vvp_queue_vec4::erase(unsigned idx)
{
      std::deque<vvp_vector4_t>::iterator pos = queue.begin();
      for (unsigned count = 0; count < idx; ++count) ++pos;
      queue.erase(pos);
}