summaryrefslogtreecommitdiff
path: root/libs/ardour/buffer_set.cc
diff options
context:
space:
mode:
authorPaul Davis <paul@linuxaudiosystems.com>2008-06-02 21:41:35 +0000
committerPaul Davis <paul@linuxaudiosystems.com>2008-06-02 21:41:35 +0000
commit449aab3c465bbbf66d221fac3d7ea559f1720357 (patch)
tree6843cc40c88250a132acac701271f1504cd2df04 /libs/ardour/buffer_set.cc
parent9c0d7d72d70082a54f823cd44c0ccda5da64bb6f (diff)
rollback to 3428, before the mysterious removal of libs/* at 3431/3432
git-svn-id: svn://localhost/ardour2/branches/3.0@3435 d708f5d6-7413-0410-9779-e7cbd77b26cf
Diffstat (limited to 'libs/ardour/buffer_set.cc')
-rw-r--r--libs/ardour/buffer_set.cc177
1 files changed, 177 insertions, 0 deletions
diff --git a/libs/ardour/buffer_set.cc b/libs/ardour/buffer_set.cc
new file mode 100644
index 0000000000..65e9f8ac8f
--- /dev/null
+++ b/libs/ardour/buffer_set.cc
@@ -0,0 +1,177 @@
+/*
+ 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.
+*/
+
+#include <algorithm>
+#include <ardour/buffer_set.h>
+#include <ardour/buffer.h>
+#include <ardour/port.h>
+#include <ardour/port_set.h>
+
+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)
+{
+ 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()));
+ }
+
+ }
+
+ _count = ports.count();
+
+ _is_mirror = true;
+}
+
+void
+BufferSet::ensure_buffers(const ChanCount& count, size_t buffer_capacity)
+{
+ for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
+ ensure_buffers(*t, count.get(*t), buffer_capacity);
+ }
+}
+
+
+/** 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());
+ assert(buffer_capacity > 0);
+
+ if (num_buffers == 0)
+ return;
+
+ // FIXME: Kludge to make MIDI buffers larger (size is bytes, not frames)
+ // See MidiPort::MidiPort
+ // We probably need a map<DataType, size_t> parameter for capacity
+ if (type == DataType::MIDI)
+ buffer_capacity *= 8;
+
+ // 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);
+ }
+
+ // Post-conditions
+ assert(bufs[0]->type() == type);
+ assert(bufs.size() >= num_buffers);
+ assert(bufs.size() == _available.get(type));
+ assert(bufs[0]->capacity() >= buffer_capacity);
+}
+
+/** 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();
+}
+
+// FIXME: make 'in' const
+void
+BufferSet::read_from(BufferSet& in, nframes_t nframes, nframes_t offset)
+{
+ 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::iterator i = in.begin(*t); i != in.end(*t); ++i, ++o) {
+ o->read_from(*i, nframes, offset);
+ }
+ }
+
+ set_count(in.count());
+}
+
+} // namespace ARDOUR
+