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/midi_buffer.h"
29 #include "ardour/port.h"
30 #include "ardour/port_set.h"
31 #include "ardour/audioengine.h"
33 #include "ardour/lv2_plugin.h"
34 #include "ardour/lv2_event_buffer.h"
37 #include "vestige/aeffectx.h"
42 /** Create a new, empty BufferSet */
43 BufferSet::BufferSet()
46 for (size_t i=0; i < DataType::num_types; ++i) {
47 _buffers.push_back(BufferVec());
54 BufferSet::~BufferSet()
59 /** Destroy all contained buffers.
65 for (std::vector<BufferVec>::iterator i = _buffers.begin(); i != _buffers.end(); ++i) {
66 for (BufferVec::iterator j = (*i).begin(); j != (*i).end(); ++j) {
77 for (VSTBuffers::iterator i = _vst_buffers.begin(); i != _vst_buffers.end(); ++i) {
81 _vst_buffers.clear ();
85 /** Set up this BufferSet so that its data structures mirror a PortSet's buffers.
86 * This is quite expensive and not RT-safe, so it should not be called in a process context;
87 * get_jack_port_addresses() will fill in a structure set up by this method.
90 BufferSet::attach_buffers (PortSet& ports)
94 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
95 _buffers.push_back(BufferVec());
96 BufferVec& v = _buffers[*t];
98 for (PortSet::iterator p = ports.begin(*t); p != ports.end(*t); ++p) {
99 assert(p->type() == *t);
104 _count = ports.count();
105 _available = ports.count();
110 /** Write the JACK port addresses from a PortSet into our data structures. This
111 * call assumes that attach_buffers() has already been called for the same PortSet.
112 * Does not allocate, so RT-safe.
115 BufferSet::get_jack_port_addresses (PortSet& ports, framecnt_t nframes, framecnt_t offset)
117 assert (_count == ports.count ());
118 assert (_available == ports.count ());
121 assert (_buffers.size() == DataType::num_types);
123 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
124 BufferVec& v = _buffers[*t];
126 assert (v.size() == ports.num_ports (*t));
129 for (PortSet::iterator p = ports.begin(*t); p != ports.end(*t); ++p) {
130 v[i] = &p->get_buffer (nframes, offset);
136 /** Ensure that there are @a num_buffers buffers of type @a type available,
137 * each of size at least @a buffer_size
140 BufferSet::ensure_buffers(DataType type, size_t num_buffers, size_t buffer_capacity)
142 assert(type != DataType::NIL);
143 assert(type < _buffers.size());
145 if (num_buffers == 0) {
149 // The vector of buffers of the type we care about
150 BufferVec& bufs = _buffers[type];
152 // If we're a mirror just make sure we're ok
154 assert(_count.get(type) >= num_buffers);
155 assert(bufs[0]->type() == type);
159 // If there's not enough or they're too small, just nuke the whole thing and
160 // rebuild it (so I'm lazy..)
161 if (bufs.size() < num_buffers
162 || (bufs.size() > 0 && bufs[0]->capacity() < buffer_capacity)) {
165 for (BufferVec::iterator i = bufs.begin(); i != bufs.end(); ++i) {
171 for (size_t i = 0; i < num_buffers; ++i) {
172 bufs.push_back(Buffer::create(type, buffer_capacity));
175 _available.set(type, num_buffers);
176 _count.set (type, num_buffers);
180 // Ensure enough low level MIDI format buffers are available for conversion
181 // in both directions (input & output, out-of-place)
182 if (type == DataType::MIDI && _lv2_buffers.size() < _buffers[type].size() * 2 + 1) {
183 while (_lv2_buffers.size() < _buffers[type].size() * 2) {
184 _lv2_buffers.push_back(std::make_pair(false, new LV2EventBuffer(buffer_capacity)));
190 // As above but for VST
191 if (type == DataType::MIDI) {
192 while (_vst_buffers.size() < _buffers[type].size()) {
193 _vst_buffers.push_back (new VSTBuffer (buffer_capacity));
199 assert(bufs[0]->type() == type);
200 assert(bufs.size() >= num_buffers);
201 assert(bufs.size() == _available.get(type));
202 assert(bufs[0]->capacity() >= buffer_capacity);
205 /** Ensure that the number of buffers of each type @a type matches @a chns
206 * and each buffer is of size at least @a buffer_capacity
209 BufferSet::ensure_buffers(const ChanCount& chns, size_t buffer_capacity)
211 for (DataType::iterator i = DataType::begin(); i != DataType::end(); ++i) {
212 ensure_buffers (*i, chns.get (*i), buffer_capacity);
216 /** Get the capacity (size) of the available buffers of the given type.
218 * All buffers of a certain type always have the same capacity.
221 BufferSet::buffer_capacity(DataType type) const
223 assert(_available.get(type) > 0);
224 return _buffers[type][0]->capacity();
228 BufferSet::get(DataType type, size_t i)
230 assert(i < _available.get(type));
231 return *_buffers[type][i];
235 BufferSet::get(DataType type, size_t i) const
237 assert(i < _available.get(type));
238 return *_buffers[type][i];
244 BufferSet::get_lv2_midi(bool input, size_t i)
246 assert (count().get(DataType::MIDI) > i);
248 MidiBuffer& mbuf = get_midi(i);
249 LV2Buffers::value_type b = _lv2_buffers.at(i * 2 + (input ? 0 : 1));
250 LV2EventBuffer* ebuf = b.second;
254 for (MidiBuffer::iterator e = mbuf.begin(); e != mbuf.end(); ++e) {
255 const Evoral::MIDIEvent<framepos_t> ev(*e, false);
256 uint32_t type = LV2Plugin::midi_event_type();
257 ebuf->append(ev.time(), 0, type, ev.size(), ev.buffer());
264 BufferSet::flush_lv2_midi(bool input, size_t i)
266 MidiBuffer& mbuf = get_midi(i);
267 LV2Buffers::value_type b = _lv2_buffers.at(i * 2 + (input ? 0 : 1));
268 LV2EventBuffer* ebuf = b.second;
271 for (ebuf->rewind(); ebuf->is_valid(); ebuf->increment()) {
277 ebuf->get_event(&frames, &subframes, &type, &size, &data);
278 mbuf.push_back(frames, size, data);
282 #endif /* HAVE_SLV2 */
287 BufferSet::get_vst_midi (size_t b)
289 MidiBuffer& m = get_midi (b);
290 VSTBuffer* vst = _vst_buffers[b];
294 for (MidiBuffer::iterator i = m.begin(); i != m.end(); ++i) {
298 return vst->events();
301 BufferSet::VSTBuffer::VSTBuffer (size_t c)
304 _events = static_cast<VstEvents*> (malloc (sizeof (VstEvents) + _capacity * sizeof (VstEvent *)));
305 _midi_events = static_cast<VstMidiEvent*> (malloc (sizeof (VstMidiEvent) * _capacity));
307 if (_events == 0 || _midi_events == 0) {
310 throw failed_constructor ();
313 _events->numEvents = 0;
314 _events->reserved = 0;
317 BufferSet::VSTBuffer::~VSTBuffer ()
324 BufferSet::VSTBuffer::clear ()
326 _events->numEvents = 0;
330 BufferSet::VSTBuffer::push_back (Evoral::MIDIEvent<framepos_t> const & ev)
333 /* XXX: this will silently drop MIDI messages longer than 3 bytes, so
334 they won't be passed to VST plugins or VSTis
338 int const n = _events->numEvents;
339 assert (n < (int) _capacity);
341 _events->events[n] = reinterpret_cast<VstEvent*> (_midi_events + n);
342 VstMidiEvent* v = reinterpret_cast<VstMidiEvent*> (_events->events[n]);
344 v->type = kVstMidiType;
345 v->byteSize = sizeof (VstMidiEvent);
346 v->deltaFrames = ev.time ();
354 v->noteOffVelocity = 0;
355 memcpy (v->midiData, ev.buffer(), ev.size());
358 _events->numEvents++;
361 #endif /* VST_SUPPORT */
364 BufferSet::read_from (const BufferSet& in, framecnt_t nframes)
366 assert(available() >= in.count());
368 // Copy all buffers 1:1
369 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
370 BufferSet::iterator o = begin(*t);
371 for (BufferSet::const_iterator i = in.begin(*t); i != in.end(*t); ++i, ++o) {
372 o->read_from (*i, nframes);
376 set_count(in.count());
380 BufferSet::merge_from (const BufferSet& in, framecnt_t nframes)
382 /* merge all input buffers into out existing buffers.
384 NOTE: if "in" contains more buffers than this set,
385 we will drop the extra buffers.
389 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
390 BufferSet::iterator o = begin(*t);
391 for (BufferSet::const_iterator i = in.begin(*t); i != in.end(*t) && o != end (*t); ++i, ++o) {
392 o->merge_from (*i, nframes);
398 BufferSet::silence (framecnt_t nframes, framecnt_t offset)
400 for (std::vector<BufferVec>::iterator i = _buffers.begin(); i != _buffers.end(); ++i) {
401 for (BufferVec::iterator b = i->begin(); b != i->end(); ++b) {
402 (*b)->silence (nframes, offset);
408 BufferSet::is_silent (bool yn)
410 for (std::vector<BufferVec>::iterator i = _buffers.begin(); i != _buffers.end(); ++i) {
411 for (BufferVec::iterator b = i->begin(); b != i->end(); ++b) {
412 (*b)->is_silent (yn);
418 } // namespace ARDOUR