1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/*************************************************************************
SampleFIFO.cpp - simple FIFO, tuned for sample_t
-------------------
begin : Sun Apr 11 2004
copyright : (C) 2004 by Thomas Eschenbacher
email : Thomas.Eschenbacher@gmx.de
***************************************************************************/
/***************************************************************************
* *
* 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; either version 2 of the License, or *
* (at your option) any later version. *
* *
***************************************************************************/
#include "config.h"
#include "libkwave/Sample.h"
#include "libkwave/SampleFIFO.h"
#include "libkwave/memcpy.h"
//***************************************************************************
Kwave::SampleFIFO::SampleFIFO()
:m_buffer(), m_size(0), m_read_offset(0), m_lock()
{
}
//***************************************************************************
Kwave::SampleFIFO::SampleFIFO(const Kwave::SampleFIFO &other)
:m_buffer(other.m_buffer), m_size(other.m_size),
m_read_offset(other.m_read_offset),
m_lock()
{
}
//***************************************************************************
Kwave::SampleFIFO& Kwave::SampleFIFO::operator=(const Kwave::SampleFIFO &other)
{
m_buffer = other.m_buffer;
m_size = other.m_size;
m_read_offset = other.m_read_offset;
return *this;
}
//***************************************************************************
Kwave::SampleFIFO::~SampleFIFO()
{
QMutexLocker _lock(&m_lock);
flush();
}
//***************************************************************************
void Kwave::SampleFIFO::flush()
{
QMutexLocker _lock(&m_lock);
m_buffer.clear();
m_read_offset = 0;
}
//***************************************************************************
void Kwave::SampleFIFO::put(const Kwave::SampleArray &buffer)
{
if (buffer.isEmpty()) return;
QMutexLocker _lock(&m_lock);
// always enqueue the new buffer
m_buffer.enqueue(buffer);
if (!m_size) return; // no limit set
// crop away whole unneeded buffers
while ((unlockedLength() - m_buffer.head().size()) > m_size)
m_buffer.dequeue();
}
//***************************************************************************
QList<Kwave::SampleArray> Kwave::SampleFIFO::getAll()
{
QMutexLocker _lock(&m_lock);
QList<Kwave::SampleArray> list;
while (!m_buffer.isEmpty())
list.push_front(m_buffer.dequeue());
m_read_offset = 0;
return list;
}
//***************************************************************************
unsigned int Kwave::SampleFIFO::get(Kwave::SampleArray &buffer)
{
QMutexLocker _lock(&m_lock);
if (m_buffer.isEmpty()) return 0;
unsigned int rest = buffer.size();
const unsigned int available = length();
if (rest > available) rest = available;
sample_t *dst = buffer.data();
unsigned int read = 0;
while (rest && !m_buffer.isEmpty()) {
const Kwave::SampleArray head = m_buffer.head();
const sample_t *src = head.constData();
unsigned int src_len = head.size();
Q_ASSERT(src_len > m_read_offset);
if (m_read_offset + rest >= src_len) {
// use the whole buffer up to it's end
size_t len = static_cast<size_t>(src_len - m_read_offset);
MEMCPY(dst, src + m_read_offset, len * sizeof(sample_t));
rest -= len;
read += len;
dst += len;
m_read_offset = 0;
// remove the buffer from the queue
m_buffer.dequeue();
} else {
// use only a portion of the buffer
MEMCPY(dst, src + m_read_offset, rest * sizeof(sample_t));
read += rest;
m_read_offset += rest;
Q_ASSERT(m_read_offset < src_len);
rest = 0;
}
}
return read;
}
//***************************************************************************
unsigned int Kwave::SampleFIFO::unlockedLength()
{
unsigned int len = 0;
foreach (const Kwave::SampleArray &buf, m_buffer)
len += buf.size();
return len;
}
//***************************************************************************
unsigned int Kwave::SampleFIFO::length()
{
QMutexLocker _lock(&m_lock);
return unlockedLength();
}
//***************************************************************************
void Kwave::SampleFIFO::setSize(unsigned int size)
{
QMutexLocker _lock(&m_lock);
m_size = size;
}
//***************************************************************************
void Kwave::SampleFIFO::crop()
{
QMutexLocker _lock(&m_lock);
if (!m_size) return; // no limit set
if (unlockedLength() <= m_size) return; // nothing to do
// we have to throw away some samples
while ((unlockedLength() - m_buffer.head().size()) > m_size)
m_buffer.dequeue();
m_read_offset = 0;
if (unlockedLength() <= m_size) return; // nothing more to do
// put the read offset into the next buffer
Q_ASSERT(unlockedLength() > m_size);
m_read_offset = unlockedLength() - m_size;
Q_ASSERT(unlockedLength() - m_read_offset == m_size);
}
//***************************************************************************
//***************************************************************************
|
