1
0
mirror of https://github.com/f4exb/sdrangel.git synced 2024-11-22 16:08:39 -05:00
sdrangel/sdrbase/dsp/datafifo.cpp

313 lines
7.0 KiB
C++

///////////////////////////////////////////////////////////////////////////////////
// Copyright (C) 2020 F4EXB //
// written by Edouard Griffiths //
// //
// This program is free software; you can redistribute it and/or modify //
// it under the terms of the GNU General Public License as published by //
// the Free Software Foundation as version 3 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 V3 for more details. //
// //
// You should have received a copy of the GNU General Public License //
// along with this program. If not, see <http://www.gnu.org/licenses/>. //
///////////////////////////////////////////////////////////////////////////////////
#include "datafifo.h"
void DataFifo::create(unsigned int s)
{
m_size = 0;
m_fill = 0;
m_head = 0;
m_tail = 0;
m_data.resize(s);
m_size = m_data.size();
}
void DataFifo::reset()
{
QMutexLocker mutexLocker(&m_mutex);
m_suppressed = -1;
m_fill = 0;
m_head = 0;
m_tail = 0;
}
DataFifo::DataFifo(QObject* parent) :
QObject(parent),
m_data(),
m_currentDataType(DataTypeI16),
m_mutex(QMutex::Recursive)
{
m_suppressed = -1;
m_size = 0;
m_fill = 0;
m_head = 0;
m_tail = 0;
}
DataFifo::DataFifo(int size, QObject* parent) :
QObject(parent),
m_data(),
m_currentDataType(DataTypeI16),
m_mutex(QMutex::Recursive)
{
m_suppressed = -1;
create(size);
}
DataFifo::DataFifo(const DataFifo& other) :
QObject(other.parent()),
m_data(other.m_data),
m_currentDataType(DataTypeI16),
m_mutex(QMutex::Recursive)
{
m_suppressed = -1;
m_size = m_data.size();
m_fill = 0;
m_head = 0;
m_tail = 0;
}
DataFifo::~DataFifo()
{
QMutexLocker mutexLocker(&m_mutex);
m_size = 0;
}
bool DataFifo::setSize(int size)
{
QMutexLocker mutexLocker(&m_mutex);
create(size);
return m_data.size() == size;
}
unsigned int DataFifo::write(const quint8* data, unsigned int count, DataType dataType)
{
QMutexLocker mutexLocker(&m_mutex);
if (dataType != m_currentDataType)
{
m_suppressed = -1;
m_fill = 0;
m_head = 0;
m_tail = 0;
m_currentDataType = dataType;
}
unsigned int total;
unsigned int remaining;
unsigned int len;
const quint8* begin = (const quint8*) data;
//count /= sizeof(Sample);
total = std::min(count, m_size - m_fill);
if (total < count)
{
if (m_suppressed < 0)
{
m_suppressed = 0;
m_msgRateTimer.start();
qCritical("DataFifo::write: overflow - dropping %u samples", count - total);
}
else
{
if (m_msgRateTimer.elapsed() > 2500)
{
qCritical("DataFifo::write: %u messages dropped", m_suppressed);
qCritical("DataFifo::write: overflow - dropping %u samples", count - total);
m_suppressed = -1;
}
else
{
m_suppressed++;
}
}
}
remaining = total;
while (remaining > 0)
{
len = std::min(remaining, m_size - m_tail);
std::copy(begin, begin + len, m_data.begin() + m_tail);
m_tail += len;
m_tail %= m_size;
m_fill += len;
begin += len;
remaining -= len;
}
if (m_fill > 0) {
emit dataReady();
}
return total;
}
unsigned int DataFifo::write(QByteArray::const_iterator begin, QByteArray::const_iterator end, DataType dataType)
{
QMutexLocker mutexLocker(&m_mutex);
if (dataType != m_currentDataType)
{
m_suppressed = -1;
m_fill = 0;
m_head = 0;
m_tail = 0;
m_currentDataType = dataType;
}
unsigned int count = end - begin;
unsigned int total;
unsigned int remaining;
unsigned int len;
total = std::min(count, m_size - m_fill);
if (total < count)
{
if (m_suppressed < 0)
{
m_suppressed = 0;
m_msgRateTimer.start();
qCritical("DataFifo::write: overflow - dropping %u samples", count - total);
}
else
{
if (m_msgRateTimer.elapsed() > 2500)
{
qCritical("DataFifo::write: %u messages dropped", m_suppressed);
qCritical("DataFifo::write: overflow - dropping %u samples", count - total);
m_suppressed = -1;
}
else
{
m_suppressed++;
}
}
}
remaining = total;
while (remaining > 0)
{
len = std::min(remaining, m_size - m_tail);
std::copy(begin, begin + len, m_data.begin() + m_tail);
m_tail += len;
m_tail %= m_size;
m_fill += len;
begin += len;
remaining -= len;
}
if (m_fill > 0) {
emit dataReady();
}
return total;
}
unsigned int DataFifo::read(QByteArray::iterator begin, QByteArray::iterator end, DataType& dataType)
{
QMutexLocker mutexLocker(&m_mutex);
dataType = m_currentDataType;
unsigned int count = end - begin;
unsigned int total;
unsigned int remaining;
unsigned int len;
total = std::min(count, m_fill);
if (total < count) {
qCritical("DataFifo::read: underflow - missing %u samples", count - total);
}
remaining = total;
while (remaining > 0)
{
len = std::min(remaining, m_size - m_head);
std::copy(m_data.begin() + m_head, m_data.begin() + m_head + len, begin);
m_head += len;
m_head %= m_size;
m_fill -= len;
begin += len;
remaining -= len;
}
return total;
}
unsigned int DataFifo::readBegin(unsigned int count,
QByteArray::iterator* part1Begin, QByteArray::iterator* part1End,
QByteArray::iterator* part2Begin, QByteArray::iterator* part2End,
DataType& dataType)
{
QMutexLocker mutexLocker(&m_mutex);
dataType = m_currentDataType;
unsigned int total;
unsigned int remaining;
unsigned int len;
unsigned int head = m_head;
total = std::min(count, m_fill);
if (total < count) {
qCritical("DataFifo::readBegin: underflow - missing %u samples", count - total);
}
remaining = total;
if (remaining > 0)
{
len = std::min(remaining, m_size - head);
*part1Begin = m_data.begin() + head;
*part1End = m_data.begin() + head + len;
head += len;
head %= m_size;
remaining -= len;
}
else
{
*part1Begin = m_data.end();
*part1End = m_data.end();
}
if (remaining > 0)
{
len = std::min(remaining, m_size - head);
*part2Begin = m_data.begin() + head;
*part2End = m_data.begin() + head + len;
}
else
{
*part2Begin = m_data.end();
*part2End = m_data.end();
}
return total;
}
unsigned int DataFifo::readCommit(unsigned int count)
{
QMutexLocker mutexLocker(&m_mutex);
if (count > m_fill)
{
qCritical("DataFifo::readCommit: cannot commit more than available samples");
count = m_fill;
}
m_head = (m_head + count) % m_size;
m_fill -= count;
return count;
}