mirror of
https://github.com/f4exb/sdrangel.git
synced 2024-11-26 09:48:45 -05:00
232 lines
5.7 KiB
C++
232 lines
5.7 KiB
C++
///////////////////////////////////////////////////////////////////////////////////
|
|
// Copyright (C) 2012 maintech GmbH, Otto-Hahn-Str. 15, 97204 Hoechberg, Germany //
|
|
// written by Christian Daniel //
|
|
// //
|
|
// 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 //
|
|
// //
|
|
// 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 "samplesinkfifo.h"
|
|
|
|
#define MIN(x, y) (((x) < (y)) ? (x) : (y))
|
|
|
|
void SampleSinkFifo::create(uint s)
|
|
{
|
|
m_size = 0;
|
|
m_fill = 0;
|
|
m_head = 0;
|
|
m_tail = 0;
|
|
|
|
m_data.resize(s);
|
|
m_size = m_data.size();
|
|
|
|
if(m_size != s)
|
|
qCritical("SampleSinkFifo: out of memory");
|
|
}
|
|
|
|
SampleSinkFifo::SampleSinkFifo(QObject* parent) :
|
|
QObject(parent),
|
|
m_data()
|
|
{
|
|
m_suppressed = -1;
|
|
m_size = 0;
|
|
m_fill = 0;
|
|
m_head = 0;
|
|
m_tail = 0;
|
|
}
|
|
|
|
SampleSinkFifo::SampleSinkFifo(int size, QObject* parent) :
|
|
QObject(parent),
|
|
m_data()
|
|
{
|
|
m_suppressed = -1;
|
|
|
|
create(size);
|
|
}
|
|
|
|
SampleSinkFifo::~SampleSinkFifo()
|
|
{
|
|
QMutexLocker mutexLocker(&m_mutex);
|
|
|
|
m_size = 0;
|
|
}
|
|
|
|
bool SampleSinkFifo::setSize(int size)
|
|
{
|
|
create(size);
|
|
|
|
return m_data.size() == (uint)size;
|
|
}
|
|
|
|
uint SampleSinkFifo::write(const quint8* data, uint count)
|
|
{
|
|
QMutexLocker mutexLocker(&m_mutex);
|
|
uint total;
|
|
uint remaining;
|
|
uint len;
|
|
const Sample* begin = (const Sample*)data;
|
|
count /= sizeof(Sample);
|
|
|
|
total = MIN(count, m_size - m_fill);
|
|
if(total < count) {
|
|
if(m_suppressed < 0) {
|
|
m_suppressed = 0;
|
|
m_msgRateTimer.start();
|
|
qCritical("SampleSinkFifo: overflow - dropping %u samples", count - total);
|
|
} else {
|
|
if(m_msgRateTimer.elapsed() > 2500) {
|
|
qCritical("SampleSinkFifo: %u messages dropped", m_suppressed);
|
|
qCritical("SampleSinkFifo: overflow - dropping %u samples", count - total);
|
|
m_suppressed = -1;
|
|
} else {
|
|
m_suppressed++;
|
|
}
|
|
}
|
|
}
|
|
|
|
remaining = total;
|
|
while(remaining > 0) {
|
|
len = 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;
|
|
}
|
|
|
|
uint SampleSinkFifo::write(SampleVector::const_iterator begin, SampleVector::const_iterator end)
|
|
{
|
|
QMutexLocker mutexLocker(&m_mutex);
|
|
uint count = end - begin;
|
|
uint total;
|
|
uint remaining;
|
|
uint len;
|
|
|
|
total = MIN(count, m_size - m_fill);
|
|
if(total < count) {
|
|
if(m_suppressed < 0) {
|
|
m_suppressed = 0;
|
|
m_msgRateTimer.start();
|
|
qCritical("SampleSinkFifo: overflow - dropping %u samples", count - total);
|
|
} else {
|
|
if(m_msgRateTimer.elapsed() > 2500) {
|
|
qCritical("SampleSinkFifo: %u messages dropped", m_suppressed);
|
|
qCritical("SampleSinkFifo: overflow - dropping %u samples", count - total);
|
|
m_suppressed = -1;
|
|
} else {
|
|
m_suppressed++;
|
|
}
|
|
}
|
|
}
|
|
|
|
remaining = total;
|
|
while(remaining > 0) {
|
|
len = 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;
|
|
}
|
|
|
|
uint SampleSinkFifo::read(SampleVector::iterator begin, SampleVector::iterator end)
|
|
{
|
|
QMutexLocker mutexLocker(&m_mutex);
|
|
uint count = end - begin;
|
|
uint total;
|
|
uint remaining;
|
|
uint len;
|
|
|
|
total = MIN(count, m_fill);
|
|
if(total < count)
|
|
qCritical("SampleSinkFifo: underflow - missing %u samples", count - total);
|
|
|
|
remaining = total;
|
|
while(remaining > 0) {
|
|
len = 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;
|
|
}
|
|
|
|
uint SampleSinkFifo::readBegin(uint count,
|
|
SampleVector::iterator* part1Begin, SampleVector::iterator* part1End,
|
|
SampleVector::iterator* part2Begin, SampleVector::iterator* part2End)
|
|
{
|
|
QMutexLocker mutexLocker(&m_mutex);
|
|
uint total;
|
|
uint remaining;
|
|
uint len;
|
|
uint head = m_head;
|
|
|
|
total = MIN(count, m_fill);
|
|
if(total < count)
|
|
qCritical("SampleSinkFifo: underflow - missing %u samples", count - total);
|
|
|
|
remaining = total;
|
|
if(remaining > 0) {
|
|
len = 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 = 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;
|
|
}
|
|
|
|
uint SampleSinkFifo::readCommit(uint count)
|
|
{
|
|
QMutexLocker mutexLocker(&m_mutex);
|
|
|
|
if(count > m_fill) {
|
|
qCritical("SampleSinkFifo: cannot commit more than available samples");
|
|
count = m_fill;
|
|
}
|
|
m_head = (m_head + count) % m_size;
|
|
m_fill -= count;
|
|
|
|
return count;
|
|
}
|