2012-11-21 02:40:52 +01:00
|
|
|
/*
|
2019-09-11 22:56:27 +02:00
|
|
|
* Copyright (c) 2012-2019 Stephen Williams (steve@icarus.com)
|
2012-11-21 02:40:52 +01:00
|
|
|
*
|
|
|
|
|
* 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;
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-30 05:31:51 +02:00
|
|
|
void vvp_darray::set_word(unsigned, const vvp_object_t&)
|
|
|
|
|
{
|
|
|
|
|
cerr << "XXXX set_word(vvp_object_t) not implemented for " << typeid(*this).name() << endl;
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-21 02:40:52 +01:00
|
|
|
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;
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-30 05:31:51 +02:00
|
|
|
void vvp_darray::get_word(unsigned, vvp_object_t&)
|
|
|
|
|
{
|
|
|
|
|
cerr << "XXXX get_word(vvp_object_t) not implemented for " << typeid(*this).name() << endl;
|
|
|
|
|
}
|
|
|
|
|
|
2017-10-08 14:52:50 +02:00
|
|
|
void vvp_darray::shallow_copy(const vvp_object*)
|
|
|
|
|
{
|
|
|
|
|
cerr << "XXXX shallow_copy(vvp_object_t) not implemented for " << typeid(*this).name() << endl;
|
|
|
|
|
}
|
|
|
|
|
|
2019-09-11 22:56:27 +02:00
|
|
|
vvp_vector4_t vvp_darray::get_bitstream(bool)
|
|
|
|
|
{
|
|
|
|
|
cerr << "XXXX get_bitstream() not implemented for " << typeid(*this).name() << endl;
|
|
|
|
|
return vvp_vector4_t();
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-21 02:40:52 +01:00
|
|
|
template <class TYPE> vvp_darray_atom<TYPE>::~vvp_darray_atom()
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-10 05:43:53 +02:00
|
|
|
template <class TYPE> size_t vvp_darray_atom<TYPE>::get_size() const
|
|
|
|
|
{
|
|
|
|
|
return array_.size();
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-21 02:40:52 +01:00
|
|
|
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;
|
|
|
|
|
}
|
|
|
|
|
|
2017-10-08 14:52:50 +02:00
|
|
|
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];
|
|
|
|
|
}
|
|
|
|
|
|
2019-09-11 22:56:27 +02:00
|
|
|
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;
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-21 02:40:52 +01:00
|
|
|
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>;
|
|
|
|
|
|
2015-02-27 02:55:45 +01:00
|
|
|
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_);
|
|
|
|
|
}
|
|
|
|
|
|
2017-10-08 14:52:50 +02:00
|
|
|
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];
|
|
|
|
|
}
|
|
|
|
|
|
2019-09-11 22:56:27 +02:00
|
|
|
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;
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-27 20:39:57 +01:00
|
|
|
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));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-10-08 14:52:50 +02:00
|
|
|
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];
|
|
|
|
|
}
|
2015-02-27 20:39:57 +01:00
|
|
|
|
2019-09-11 22:56:27 +02:00
|
|
|
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;
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-30 05:31:51 +02:00
|
|
|
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];
|
|
|
|
|
}
|
|
|
|
|
|
2017-10-08 14:52:50 +02:00
|
|
|
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];
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-21 02:40:52 +01:00
|
|
|
vvp_darray_real::~vvp_darray_real()
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-10 05:43:53 +02:00
|
|
|
size_t vvp_darray_real::get_size() const
|
|
|
|
|
{
|
|
|
|
|
return array_.size();
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-21 02:40:52 +01:00
|
|
|
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];
|
|
|
|
|
}
|
|
|
|
|
|
2017-10-08 14:52:50 +02:00
|
|
|
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];
|
|
|
|
|
}
|
|
|
|
|
|
2019-09-11 22:56:27 +02:00
|
|
|
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;
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-21 02:40:52 +01:00
|
|
|
vvp_darray_string::~vvp_darray_string()
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-10 05:43:53 +02:00
|
|
|
size_t vvp_darray_string::get_size() const
|
|
|
|
|
{
|
|
|
|
|
return array_.size();
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-21 02:40:52 +01:00
|
|
|
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()) {
|
2013-04-18 02:44:45 +02:00
|
|
|
value = "";
|
2012-11-21 02:40:52 +01:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
value = array_[adr];
|
|
|
|
|
}
|
2014-08-05 05:11:21 +02:00
|
|
|
|
2017-10-08 14:52:50 +02:00
|
|
|
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];
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-05 05:11:21 +02:00
|
|
|
vvp_queue::~vvp_queue()
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue::push_back(const vvp_vector4_t&)
|
|
|
|
|
{
|
|
|
|
|
cerr << "XXXX push_back(vvp_vector4_t) not implemented for " << typeid(*this).name() << endl;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue::push_front(const vvp_vector4_t&)
|
|
|
|
|
{
|
|
|
|
|
cerr << "XXXX push_front(vvp_vector4_t) not implemented for " << typeid(*this).name() << endl;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue::push_back(double)
|
|
|
|
|
{
|
|
|
|
|
cerr << "XXXX push_back(double) not implemented for " << typeid(*this).name() << endl;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue::push_front(double)
|
|
|
|
|
{
|
|
|
|
|
cerr << "XXXX push_front(double) not implemented for " << typeid(*this).name() << endl;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue::push_back(const string&)
|
|
|
|
|
{
|
|
|
|
|
cerr << "XXXX push_back(string) not implemented for " << typeid(*this).name() << endl;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue::push_front(const string&)
|
|
|
|
|
{
|
|
|
|
|
cerr << "XXXX push_front(string) not implemented for " << typeid(*this).name() << endl;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
vvp_queue_string::~vvp_queue_string()
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-10 05:43:53 +02:00
|
|
|
size_t vvp_queue_string::get_size() const
|
|
|
|
|
{
|
|
|
|
|
return array_.size();
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-05 05:11:21 +02:00
|
|
|
void vvp_queue_string::push_back(const string&val)
|
|
|
|
|
{
|
|
|
|
|
array_.push_back(val);
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-11 02:58:26 +02:00
|
|
|
void vvp_queue_string::set_word(unsigned adr, const string&value)
|
|
|
|
|
{
|
|
|
|
|
if (adr >= array_.size())
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
list<string>::iterator cur = array_.begin();
|
|
|
|
|
while (adr > 0) {
|
2014-09-11 03:49:08 +02:00
|
|
|
++ cur;
|
2014-08-11 02:58:26 +02:00
|
|
|
adr -= 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*cur = value;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue_string::get_word(unsigned adr, string&value)
|
|
|
|
|
{
|
|
|
|
|
if (adr >= array_.size()) {
|
|
|
|
|
value = "";
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
list<string>::const_iterator cur = array_.begin();
|
|
|
|
|
while (adr > 0) {
|
2014-09-11 03:49:08 +02:00
|
|
|
++ cur;
|
2014-08-11 02:58:26 +02:00
|
|
|
adr -= 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
value = *cur;
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-18 03:36:47 +02:00
|
|
|
void vvp_queue_string::pop_back(void)
|
|
|
|
|
{
|
|
|
|
|
array_.pop_back();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue_string::pop_front(void)
|
|
|
|
|
{
|
|
|
|
|
array_.pop_front();
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-05 05:11:21 +02:00
|
|
|
vvp_queue_vec4::~vvp_queue_vec4()
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-10 05:43:53 +02:00
|
|
|
size_t vvp_queue_vec4::get_size() const
|
|
|
|
|
{
|
|
|
|
|
return array_.size();
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-11 02:58:26 +02:00
|
|
|
void vvp_queue_vec4::set_word(unsigned adr, const vvp_vector4_t&value)
|
|
|
|
|
{
|
|
|
|
|
if (adr >= array_.size())
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
list<vvp_vector4_t>::iterator cur = array_.begin();
|
|
|
|
|
while (adr > 0) {
|
2014-09-11 03:49:08 +02:00
|
|
|
++ cur;
|
2014-08-11 02:58:26 +02:00
|
|
|
adr -= 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*cur = value;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue_vec4::get_word(unsigned adr, vvp_vector4_t&value)
|
|
|
|
|
{
|
|
|
|
|
if (adr >= array_.size()) {
|
|
|
|
|
value = vvp_vector4_t();
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
list<vvp_vector4_t>::const_iterator cur = array_.begin();
|
|
|
|
|
while (adr > 0) {
|
2014-09-11 03:49:08 +02:00
|
|
|
++ cur;
|
2014-08-11 02:58:26 +02:00
|
|
|
adr -= 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
value = *cur;
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-05 05:11:21 +02:00
|
|
|
void vvp_queue_vec4::push_back(const vvp_vector4_t&val)
|
|
|
|
|
{
|
|
|
|
|
array_.push_back(val);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue_vec4::push_front(const vvp_vector4_t&val)
|
|
|
|
|
{
|
|
|
|
|
array_.push_front(val);
|
|
|
|
|
}
|
2014-08-18 03:36:47 +02:00
|
|
|
|
|
|
|
|
void vvp_queue_vec4::pop_back(void)
|
|
|
|
|
{
|
|
|
|
|
array_.pop_back();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_queue_vec4::pop_front(void)
|
|
|
|
|
{
|
|
|
|
|
array_.pop_front();
|
|
|
|
|
}
|