2 Copyright (C) 2006 Paul Davis
4 This program is free software; you can redistribute it and/or modify it
5 under the terms of the GNU General Public License as published by the Free
6 Software Foundation; either version 2 of the License, or (at your option)
9 This program is distributed in the hope that it will be useful, but WITHOUT
10 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 You should have received a copy of the GNU General Public License along
15 with this program; if not, write to the Free Software Foundation, Inc.,
16 675 Mass Ave, Cambridge, MA 02139, USA.
21 #include "libardour-config.h"
26 #include "ardour/buffer.h"
27 #include "ardour/buffer_set.h"
28 #include "ardour/debug.h"
29 #include "ardour/midi_buffer.h"
30 #include "ardour/port.h"
31 #include "ardour/port_set.h"
32 #include "ardour/audioengine.h"
34 #include "ardour/lv2_plugin.h"
35 #include "ardour/lv2_event_buffer.h"
38 #include "vestige/aeffectx.h"
43 /** Create a new, empty BufferSet */
44 BufferSet::BufferSet()
47 for (size_t i=0; i < DataType::num_types; ++i) {
48 _buffers.push_back(BufferVec());
55 BufferSet::~BufferSet()
60 /** Destroy all contained buffers.
66 for (std::vector<BufferVec>::iterator i = _buffers.begin(); i != _buffers.end(); ++i) {
67 for (BufferVec::iterator j = (*i).begin(); j != (*i).end(); ++j) {
78 for (VSTBuffers::iterator i = _vst_buffers.begin(); i != _vst_buffers.end(); ++i) {
82 _vst_buffers.clear ();
86 /** Set up this BufferSet so that its data structures mirror a PortSet's buffers.
87 * This is quite expensive and not RT-safe, so it should not be called in a process context;
88 * get_jack_port_addresses() will fill in a structure set up by this method.
91 BufferSet::attach_buffers (PortSet& ports)
95 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
96 _buffers.push_back(BufferVec());
97 BufferVec& v = _buffers[*t];
99 for (PortSet::iterator p = ports.begin(*t); p != ports.end(*t); ++p) {
100 assert(p->type() == *t);
105 _count = ports.count();
106 _available = ports.count();
111 /** Write the JACK port addresses from a PortSet into our data structures. This
112 * call assumes that attach_buffers() has already been called for the same PortSet.
113 * Does not allocate, so RT-safe.
116 BufferSet::get_jack_port_addresses (PortSet& ports, framecnt_t nframes, framecnt_t offset)
118 assert (_count == ports.count ());
119 assert (_available == ports.count ());
122 assert (_buffers.size() == DataType::num_types);
124 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
125 BufferVec& v = _buffers[*t];
127 assert (v.size() == ports.num_ports (*t));
130 for (PortSet::iterator p = ports.begin(*t); p != ports.end(*t); ++p) {
131 v[i] = &p->get_buffer (nframes, offset);
137 /** Ensure that there are @a num_buffers buffers of type @a type available,
138 * each of size at least @a buffer_size
141 BufferSet::ensure_buffers(DataType type, size_t num_buffers, size_t buffer_capacity)
143 assert(type != DataType::NIL);
144 assert(type < _buffers.size());
146 if (num_buffers == 0) {
150 // The vector of buffers of the type we care about
151 BufferVec& bufs = _buffers[type];
153 // If we're a mirror just make sure we're ok
155 assert(_count.get(type) >= num_buffers);
156 assert(bufs[0]->type() == type);
160 // If there's not enough or they're too small, just nuke the whole thing and
161 // rebuild it (so I'm lazy..)
162 if (bufs.size() < num_buffers
163 || (bufs.size() > 0 && bufs[0]->capacity() < buffer_capacity)) {
166 for (BufferVec::iterator i = bufs.begin(); i != bufs.end(); ++i) {
172 for (size_t i = 0; i < num_buffers; ++i) {
173 bufs.push_back(Buffer::create(type, buffer_capacity));
176 _available.set(type, num_buffers);
177 _count.set (type, num_buffers);
181 // Ensure enough low level MIDI format buffers are available for conversion
182 // in both directions (input & output, out-of-place)
183 if (type == DataType::MIDI && _lv2_buffers.size() < _buffers[type].size() * 2 + 1) {
184 while (_lv2_buffers.size() < _buffers[type].size() * 2) {
185 _lv2_buffers.push_back(std::make_pair(false, new LV2EventBuffer(buffer_capacity)));
191 // As above but for VST
192 if (type == DataType::MIDI) {
193 while (_vst_buffers.size() < _buffers[type].size()) {
194 _vst_buffers.push_back (new VSTBuffer (buffer_capacity));
200 assert(bufs[0]->type() == type);
201 assert(bufs.size() >= num_buffers);
202 assert(bufs.size() == _available.get(type));
203 assert(bufs[0]->capacity() >= buffer_capacity);
206 /** Ensure that the number of buffers of each type @a type matches @a chns
207 * and each buffer is of size at least @a buffer_capacity
210 BufferSet::ensure_buffers(const ChanCount& chns, size_t buffer_capacity)
212 for (DataType::iterator i = DataType::begin(); i != DataType::end(); ++i) {
213 ensure_buffers (*i, chns.get (*i), buffer_capacity);
217 /** Get the capacity (size) of the available buffers of the given type.
219 * All buffers of a certain type always have the same capacity.
222 BufferSet::buffer_capacity(DataType type) const
224 assert(_available.get(type) > 0);
225 return _buffers[type][0]->capacity();
229 BufferSet::get(DataType type, size_t i)
231 assert(i < _available.get(type));
232 return *_buffers[type][i];
236 BufferSet::get(DataType type, size_t i) const
238 assert(i < _available.get(type));
239 return *_buffers[type][i];
245 BufferSet::get_lv2_midi(bool input, size_t i)
247 assert (count().get(DataType::MIDI) > i);
249 MidiBuffer& mbuf = get_midi(i);
250 LV2Buffers::value_type b = _lv2_buffers.at(i * 2 + (input ? 0 : 1));
251 LV2EventBuffer* ebuf = b.second;
255 for (MidiBuffer::iterator e = mbuf.begin(); e != mbuf.end(); ++e) {
256 const Evoral::MIDIEvent<framepos_t> ev(*e, false);
257 uint32_t type = LV2Plugin::midi_event_type();
259 DEBUG_TRACE (PBD::DEBUG::LV2, string_compose ("(FLUSH) MIDI event of size %1\n", ev.size()));
260 for (uint16_t x = 0; x < ev.size(); ++x) {
261 DEBUG_TRACE (PBD::DEBUG::LV2, string_compose ("\tByte[%1] = %2\n", x, (int) ev.buffer()[x]));
264 ebuf->append(ev.time(), 0, type, ev.size(), ev.buffer());
271 BufferSet::flush_lv2_midi(bool input, size_t i)
273 MidiBuffer& mbuf = get_midi(i);
274 LV2Buffers::value_type b = _lv2_buffers.at(i * 2 + (input ? 0 : 1));
275 LV2EventBuffer* ebuf = b.second;
278 for (ebuf->rewind(); ebuf->is_valid(); ebuf->increment()) {
284 ebuf->get_event(&frames, &subframes, &type, &size, &data);
286 DEBUG_TRACE (PBD::DEBUG::LV2, string_compose ("(FLUSH) MIDI event of size %1\n", size));
287 for (uint16_t x = 0; x < size; ++x) {
288 DEBUG_TRACE (PBD::DEBUG::LV2, string_compose ("\tByte[%1] = %2\n", x, (int) data[x]));
291 mbuf.push_back(frames, size, data);
295 #endif /* HAVE_SLV2 */
300 BufferSet::get_vst_midi (size_t b)
302 MidiBuffer& m = get_midi (b);
303 VSTBuffer* vst = _vst_buffers[b];
307 for (MidiBuffer::iterator i = m.begin(); i != m.end(); ++i) {
311 return vst->events();
314 BufferSet::VSTBuffer::VSTBuffer (size_t c)
317 _events = static_cast<VstEvents*> (malloc (sizeof (VstEvents) + _capacity * sizeof (VstEvent *)));
318 _midi_events = static_cast<VstMidiEvent*> (malloc (sizeof (VstMidiEvent) * _capacity));
320 if (_events == 0 || _midi_events == 0) {
323 throw failed_constructor ();
326 _events->numEvents = 0;
327 _events->reserved = 0;
330 BufferSet::VSTBuffer::~VSTBuffer ()
337 BufferSet::VSTBuffer::clear ()
339 _events->numEvents = 0;
343 BufferSet::VSTBuffer::push_back (Evoral::MIDIEvent<framepos_t> const & ev)
346 /* XXX: this will silently drop MIDI messages longer than 3 bytes, so
347 they won't be passed to VST plugins or VSTis
351 int const n = _events->numEvents;
352 assert (n < (int) _capacity);
354 _events->events[n] = reinterpret_cast<VstEvent*> (_midi_events + n);
355 VstMidiEvent* v = reinterpret_cast<VstMidiEvent*> (_events->events[n]);
357 v->type = kVstMidiType;
358 v->byteSize = sizeof (VstMidiEvent);
359 v->deltaFrames = ev.time ();
367 v->noteOffVelocity = 0;
368 memcpy (v->midiData, ev.buffer(), ev.size());
371 _events->numEvents++;
374 #endif /* VST_SUPPORT */
377 BufferSet::read_from (const BufferSet& in, framecnt_t nframes)
379 assert(available() >= in.count());
381 // Copy all buffers 1:1
382 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
383 BufferSet::iterator o = begin(*t);
384 for (BufferSet::const_iterator i = in.begin(*t); i != in.end(*t); ++i, ++o) {
385 o->read_from (*i, nframes);
389 set_count(in.count());
393 BufferSet::merge_from (const BufferSet& in, framecnt_t nframes)
395 /* merge all input buffers into out existing buffers.
397 NOTE: if "in" contains more buffers than this set,
398 we will drop the extra buffers.
402 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
403 BufferSet::iterator o = begin(*t);
404 for (BufferSet::const_iterator i = in.begin(*t); i != in.end(*t) && o != end (*t); ++i, ++o) {
405 o->merge_from (*i, nframes);
411 BufferSet::silence (framecnt_t nframes, framecnt_t offset)
413 for (std::vector<BufferVec>::iterator i = _buffers.begin(); i != _buffers.end(); ++i) {
414 for (BufferVec::iterator b = i->begin(); b != i->end(); ++b) {
415 (*b)->silence (nframes, offset);
421 BufferSet::is_silent (bool yn)
423 for (std::vector<BufferVec>::iterator i = _buffers.begin(); i != _buffers.end(); ++i) {
424 for (BufferVec::iterator b = i->begin(); b != i->end(); ++b) {
425 (*b)->is_silent (yn);
431 } // namespace ARDOUR