summaryrefslogtreecommitdiff
path: root/libs/ardour/buffer_set.cc
blob: 2a1e7f2498da908a45ab0ecb19bb5e26413e7a4c (plain)
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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
/*
    Copyright (C) 2006 Paul Davis

    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.

    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.,
    675 Mass Ave, Cambridge, MA 02139, USA.
*/


#ifdef WAF_BUILD
#include "libardour-config.h"
#endif

#include <iostream>
#include <algorithm>
#include "ardour/buffer.h"
#include "ardour/buffer_set.h"
#include "ardour/midi_buffer.h"
#include "ardour/port.h"
#include "ardour/port_set.h"
#include "ardour/audioengine.h"
#ifdef HAVE_SLV2
#include "ardour/lv2_plugin.h"
#include "ardour/lv2_event_buffer.h"
#endif

namespace ARDOUR {

/** Create a new, empty BufferSet */
BufferSet::BufferSet()
	: _is_mirror(false)
{
	for (size_t i=0; i < DataType::num_types; ++i) {
		_buffers.push_back(BufferVec());
	}

	_count.reset();
	_available.reset();
}

BufferSet::~BufferSet()
{
	clear();
}

/** Destroy all contained buffers.
 */
void
BufferSet::clear()
{
	if (!_is_mirror) {
		for (std::vector<BufferVec>::iterator i = _buffers.begin(); i != _buffers.end(); ++i) {
			for (BufferVec::iterator j = (*i).begin(); j != (*i).end(); ++j) {
				delete *j;
			}
			(*i).clear();
		}
	}
	_buffers.clear();
	_count.reset();
	_available.reset();
}

/** Make this BufferSet a direct mirror of a PortSet's buffers.
 */
void
BufferSet::attach_buffers(PortSet& ports, nframes_t nframes, nframes_t offset)
{
	clear();

	for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
		_buffers.push_back(BufferVec());
		BufferVec& v = _buffers[*t];

		for (PortSet::iterator p = ports.begin(*t); p != ports.end(*t); ++p) {
			assert(p->type() == *t);
			v.push_back(&(p->get_buffer(nframes, offset)));
		}
	}

	_count = ports.count();
	_available = ports.count();

	_is_mirror = true;
}

/** Ensure that there are @a num_buffers buffers of type @a type available,
 * each of size at least @a buffer_size
 */
void
BufferSet::ensure_buffers(DataType type, size_t num_buffers, size_t buffer_capacity)
{
	assert(type != DataType::NIL);
	assert(type < _buffers.size());

	if (num_buffers == 0) {
		return;
	}

	// The vector of buffers of the type we care about
	BufferVec& bufs = _buffers[type];

	// If we're a mirror just make sure we're ok
	if (_is_mirror) {
		assert(_count.get(type) >= num_buffers);
		assert(bufs[0]->type() == type);
		return;
	}

	// If there's not enough or they're too small, just nuke the whole thing and
	// rebuild it (so I'm lazy..)
	if (bufs.size() < num_buffers
			|| (bufs.size() > 0 && bufs[0]->capacity() < buffer_capacity)) {

		// Nuke it
		for (BufferVec::iterator i = bufs.begin(); i != bufs.end(); ++i) {
			delete (*i);
		}
		bufs.clear();

		// Rebuild it
		for (size_t i = 0; i < num_buffers; ++i) {
			bufs.push_back(Buffer::create(type, buffer_capacity));
		}

		_available.set(type, num_buffers);
		_count.set (type, num_buffers);
	}

#ifdef HAVE_SLV2
	// Ensure enough low level MIDI format buffers are available for conversion
	// in both directions (input & output, out-of-place)
	if (type == DataType::MIDI && _lv2_buffers.size() < _buffers[type].size() * 2 + 1) {
		while (_lv2_buffers.size() < _buffers[type].size() * 2) {
			_lv2_buffers.push_back(std::make_pair(false, new LV2EventBuffer(buffer_capacity)));
		}
	}
#endif

	// Post-conditions
	assert(bufs[0]->type() == type);
	assert(bufs.size() >= num_buffers);
	assert(bufs.size() == _available.get(type));
	assert(bufs[0]->capacity() >= buffer_capacity);
}

/** Ensure that the number of buffers of each type @a type matches @a chns
 * and each buffer is of size at least @a buffer_capacity
 */
void
BufferSet::ensure_buffers(const ChanCount& chns, size_t buffer_capacity)
{
	if (chns == ChanCount::ZERO) {
		return;
	}

	// If we're a mirror just make sure we're ok
	if (_is_mirror) {
		assert(_count >= chns);
		return;
	}

	for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {

		// The vector of buffers of this type
		BufferVec& bufs = _buffers[*t];

		uint32_t nbufs = chns.get (*t);

		if (nbufs == 0) {
			// Nuke it
			for (BufferVec::iterator i = bufs.begin(); i != bufs.end(); ++i) {
				delete (*i);
			}
			bufs.clear();
			continue;
		}

		// If there's not enough or they're too small, just nuke the whole thing and
		// rebuild it (so I'm lazy..)
		if (bufs.size() < nbufs
		    || (bufs.size() > 0 && bufs[0]->capacity() < buffer_capacity)) {

			// Nuke it
			for (BufferVec::iterator i = bufs.begin(); i != bufs.end(); ++i) {
				delete (*i);
			}
			bufs.clear();

			// Rebuild it
			for (size_t i = 0; i < nbufs; ++i) {
				bufs.push_back(Buffer::create(*t, buffer_capacity));
			}

			_available.set (*t, nbufs);
		}

#ifdef HAVE_SLV2
		// Ensure enough low level MIDI format buffers are available for conversion
		// in both directions (input & output, out-of-place)
		if (*t == DataType::MIDI && _lv2_buffers.size() < _buffers[DataType::MIDI].size() * 2 + 1) {
			while (_lv2_buffers.size() < _buffers[DataType::MIDI].size() * 2) {
				_lv2_buffers.push_back(std::make_pair(false, new LV2EventBuffer(buffer_capacity)));
			}
		}
#endif

		// Post-conditions
		assert(bufs[0]->type() == *t);
		assert(bufs.size() == _available.get(*t));
		assert(bufs[0]->capacity() >= buffer_capacity);
	}

	assert (available() == chns);
}

/** Get the capacity (size) of the available buffers of the given type.
 *
 * All buffers of a certain type always have the same capacity.
 */
size_t
BufferSet::buffer_capacity(DataType type) const
{
	assert(_available.get(type) > 0);
	return _buffers[type][0]->capacity();
}

Buffer&
BufferSet::get(DataType type, size_t i)
{
	assert(i < _available.get(type));
	return *_buffers[type][i];
}

const Buffer&
BufferSet::get(DataType type, size_t i) const
{
	assert(i < _available.get(type));
	return *_buffers[type][i];
}

#ifdef HAVE_SLV2

LV2EventBuffer&
BufferSet::get_lv2_midi(bool input, size_t i)
{
	MidiBuffer& mbuf = get_midi(i);
	LV2Buffers::value_type b = _lv2_buffers.at(i * 2 + (input ? 0 : 1));
	LV2EventBuffer* ebuf = b.second;

	ebuf->reset();
	if (input) {
		for (MidiBuffer::iterator e = mbuf.begin(); e != mbuf.end(); ++e) {
			const Evoral::MIDIEvent<nframes_t> ev(*e, false);
			uint32_t type = LV2Plugin::midi_event_type();
			ebuf->append(ev.time(), 0, type, ev.size(), ev.buffer());
		}
	}
	return *ebuf;
}

void
BufferSet::flush_lv2_midi(bool input, size_t i)
{
	MidiBuffer& mbuf = get_midi(i);
	LV2Buffers::value_type b = _lv2_buffers.at(i * 2 + (input ? 0 : 1));
	LV2EventBuffer* ebuf = b.second;

	mbuf.silence(0, 0);
	for (ebuf->rewind(); ebuf->is_valid(); ebuf->increment()) {
		uint32_t frames;
		uint32_t subframes;
		uint16_t type;
		uint16_t size;
		uint8_t* data;
		ebuf->get_event(&frames, &subframes, &type, &size, &data);
		mbuf.push_back(frames, size, data);
	}
}

#endif

void
BufferSet::read_from (const BufferSet& in, nframes_t nframes)
{
	assert(available() >= in.count());

	// Copy all buffers 1:1
	for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
		BufferSet::iterator o = begin(*t);
		for (BufferSet::const_iterator i = in.begin(*t); i != in.end(*t); ++i, ++o) {
			o->read_from (*i, nframes);
		}
	}

	set_count(in.count());
}

void
BufferSet::merge_from (const BufferSet& in, nframes_t nframes)
{
	/* merge all input buffers into out existing buffers.

	   NOTE: if "in" contains more buffers than this set,
	   we will drop the extra buffers.

	*/

	for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
		BufferSet::iterator o = begin(*t);
		for (BufferSet::const_iterator i = in.begin(*t); i != in.end(*t) && o != end (*t); ++i, ++o) {
			o->merge_from (*i, nframes);
		}
	}
}

void
BufferSet::silence (nframes_t nframes, nframes_t offset)
{
	for (std::vector<BufferVec>::iterator i = _buffers.begin(); i != _buffers.end(); ++i) {
		for (BufferVec::iterator b = i->begin(); b != i->end(); ++b) {
			(*b)->silence (nframes, offset);
		}
	}
}

void
BufferSet::is_silent (bool yn)
{
	for (std::vector<BufferVec>::iterator i = _buffers.begin(); i != _buffers.end(); ++i) {
		for (BufferVec::iterator b = i->begin(); b != i->end(); ++b) {
			(*b)->is_silent (yn);
		}
	}
		
}

} // namespace ARDOUR