2 Copyright (C) 2006 Paul Davis
5 This program is free software; you can redistribute it and/or modify it
6 under the terms of the GNU General Public License as published by the Free
7 Software Foundation; either version 2 of the License, or (at your option)
10 This program is distributed in the hope that it will be useful, but WITHOUT
11 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 You should have received a copy of the GNU General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 675 Mass Ave, Cambridge, MA 02139, USA.
20 #ifndef __ardour_midi_buffer_h__
21 #define __ardour_midi_buffer_h__
23 #include <ardour/buffer.h>
24 #include <ardour/midi_event.h>
29 /** Buffer containing 8-bit unsigned char (MIDI) data. */
30 class MidiBuffer : public Buffer
33 MidiBuffer(size_t capacity);
36 void silence(nframes_t dur, nframes_t offset=0);
38 void read_from(const Buffer& src, nframes_t nframes, nframes_t offset);
40 void copy(const MidiBuffer& copy);
42 bool push_back(const ARDOUR::MidiEvent& event);
43 bool push_back(const jack_midi_event_t& event);
44 Byte* reserve(double time, size_t size);
48 bool merge(const MidiBuffer& a, const MidiBuffer& b);
51 iterator(MidiBuffer& b, size_t i) : buffer(b), index(i) {}
53 inline MidiEvent& operator*() const { return buffer[index]; }
54 inline iterator& operator++() { ++index; return *this; } // prefix
55 inline bool operator!=(const iterator& other) const { return index != other.index; }
61 struct const_iterator {
62 const_iterator(const MidiBuffer& b, size_t i) : buffer(b), index(i) {}
64 inline const MidiEvent& operator*() const { return buffer[index]; }
65 inline const_iterator& operator++() { ++index; return *this; } // prefix
66 inline bool operator!=(const const_iterator& other) const { return index != other.index; }
68 const MidiBuffer& buffer;
72 iterator begin() { return iterator(*this, 0); }
73 iterator end() { return iterator(*this, _size); }
75 const_iterator begin() const { return const_iterator(*this, 0); }
76 const_iterator end() const { return const_iterator(*this, _size); }
80 friend class iterator;
81 friend class const_iterator;
83 const MidiEvent& operator[](size_t i) const { assert(i < _size); return _events[i]; }
84 MidiEvent& operator[](size_t i) { assert(i < _size); return _events[i]; }
86 // FIXME: Eliminate this
87 static const size_t MAX_EVENT_SIZE = 4; // bytes
89 /* We use _size as "number of events", so the size of _data is
90 * (_size * MAX_EVENT_SIZE)
93 /* FIXME: this is utter crap. rewrite as a flat/packed buffer like MidiRingBuffer */
95 MidiEvent* _events; ///< Event structs that point to offsets in _data
96 Byte* _data; ///< MIDI, straight up. No time stamps.
100 } // namespace ARDOUR
102 #endif // __ardour_midi_buffer_h__