The vast majority of Route signal processing is now simply in the list of processors. There are definitely regressions here, but there's also a lot of things fixed. It's far too much work to let diverge anymore regardless, so here it is. The basic model is: A route has a fixed set of input channels (matching its JACK input ports and diskstream). The first processor takes this as input. The next processor is configured using the first processor's output as input, and is allowed to choose whatever output it wants given that input... and so on, and so on. Finally, the last processor's requested output is used to set up the panner and create whatever Jack ports are needed to output the data. All 'special' internal processors (meter, fader, amp, insert, send) are currently transparent: they read any input, and return the same set of channels back (unmodified, except for amp). User visible changes: * LV2 Instrument support (tracks with both MIDI and audio channels) * MIDI in/out plugin support * Generic plugin replication (for MIDI plugins, MIDI/audio plugins) * Movable meter point Known Bugs: * Things seem to get weird on loaded sessions * Output delivery is sketchy * 2.0 session loading was probably already broken... but it's definitely broken now :) Please test this and file bugs if you have any time... git-svn-id: svn://localhost/ardour2/branches/3.0@5055 d708f5d6-7413-0410-9779-e7cbd77b26cf
198 lines
4.7 KiB
C++
198 lines
4.7 KiB
C++
/*
|
|
Copyright (C) 2009 Paul Davis
|
|
Author: Dave Robillard
|
|
|
|
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.
|
|
*/
|
|
|
|
#define __STDC_LIMIT_MACROS 1
|
|
#include <stdint.h>
|
|
#include <iostream>
|
|
#include "lv2ext/lv2_event.h"
|
|
#include "lv2ext/lv2_event_helpers.h"
|
|
#include "ardour/lv2_event_buffer.h"
|
|
|
|
using namespace std;
|
|
|
|
namespace ARDOUR {
|
|
|
|
|
|
/** Allocate a new event buffer.
|
|
* \a capacity is in bytes (not number of events).
|
|
*/
|
|
LV2EventBuffer::LV2EventBuffer(size_t capacity)
|
|
: _latest_frames(0)
|
|
, _latest_subframes(0)
|
|
{
|
|
if (capacity > UINT32_MAX) {
|
|
cerr << "Event buffer size " << capacity << " too large, aborting." << endl;
|
|
throw std::bad_alloc();
|
|
}
|
|
|
|
if (capacity == 0) {
|
|
cerr << "ERROR: LV2 event buffer of size 0 created." << endl;
|
|
capacity = 1024;
|
|
}
|
|
|
|
#ifdef NO_POSIX_MEMALIGN
|
|
_data = (LV2_Event_Buffer*)malloc(sizeof(LV2_Event_Buffer) + capacity);
|
|
int ret = (_data != NULL) ? 0 : -1;
|
|
#else
|
|
int ret = posix_memalign((void**)&_data, 16, sizeof(LV2_Event_Buffer) + capacity);
|
|
#endif
|
|
|
|
if (ret != 0) {
|
|
cerr << "Failed to allocate event buffer. Aborting." << endl;
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
_data->event_count = 0;
|
|
_data->capacity = (uint32_t)capacity;
|
|
_data->size = 0;
|
|
_data->data = reinterpret_cast<uint8_t*>(_data + 1);
|
|
|
|
reset();
|
|
}
|
|
|
|
|
|
LV2EventBuffer::~LV2EventBuffer()
|
|
{
|
|
free(_data);
|
|
}
|
|
|
|
|
|
/** Increment the read position by one event.
|
|
*
|
|
* \return true if increment was successful, or false if end of buffer reached.
|
|
*/
|
|
bool
|
|
LV2EventBuffer::increment() const
|
|
{
|
|
if (lv2_event_is_valid(&_iter)) {
|
|
lv2_event_increment(&_iter);
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
|
|
/** \return true iff the cursor is valid (ie get_event is safe)
|
|
*/
|
|
bool
|
|
LV2EventBuffer::is_valid() const
|
|
{
|
|
return lv2_event_is_valid(&_iter);
|
|
}
|
|
|
|
|
|
/** Read an event from the current position in the buffer
|
|
*
|
|
* \return true if read was successful, or false if end of buffer reached
|
|
*/
|
|
bool
|
|
LV2EventBuffer::get_event(uint32_t* frames,
|
|
uint32_t* subframes,
|
|
uint16_t* type,
|
|
uint16_t* size,
|
|
uint8_t** data) const
|
|
{
|
|
if (lv2_event_is_valid(&_iter)) {
|
|
LV2_Event* ev = lv2_event_get(&_iter, data);
|
|
*frames = ev->frames;
|
|
*subframes = ev->subframes;
|
|
*type = ev->type;
|
|
*size = ev->size;
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
|
|
/** Append an event to the buffer.
|
|
*
|
|
* \a timestamp must be >= the latest event in the buffer.
|
|
*
|
|
* \return true on success
|
|
*/
|
|
bool
|
|
LV2EventBuffer::append(uint32_t frames,
|
|
uint32_t subframes,
|
|
uint16_t type,
|
|
uint16_t size,
|
|
const uint8_t* data)
|
|
{
|
|
#ifndef NDEBUG
|
|
if (lv2_event_is_valid(&_iter)) {
|
|
LV2_Event* last_event = lv2_event_get(&_iter, NULL);
|
|
assert(last_event->frames < frames
|
|
|| (last_event->frames == frames && last_event->subframes <= subframes));
|
|
}
|
|
#endif
|
|
|
|
/*cout << "Appending event type " << type << ", size " << size
|
|
<< " @ " << frames << "." << subframes << endl;
|
|
cout << "Buffer capacity " << _data->capacity << ", size " << _data->size << endl;*/
|
|
|
|
if (!lv2_event_write(&_iter, frames, subframes, type, size, data)) {
|
|
cerr << "ERROR: Failed to write event." << endl;
|
|
return false;
|
|
} else {
|
|
_latest_frames = frames;
|
|
_latest_subframes = subframes;
|
|
return true;
|
|
}
|
|
}
|
|
|
|
|
|
/** Append a buffer of events to the buffer.
|
|
*
|
|
* \a timestamp must be >= the latest event in the buffer.
|
|
*
|
|
* \return true on success
|
|
*/
|
|
bool
|
|
LV2EventBuffer::append(const LV2_Event_Buffer* buf)
|
|
{
|
|
uint8_t** data = NULL;
|
|
bool ret = true;
|
|
|
|
LV2_Event_Iterator iter;
|
|
for (lv2_event_begin(&iter, _data); lv2_event_is_valid(&iter); lv2_event_increment(&iter)) {
|
|
LV2_Event* ev = lv2_event_get(&iter, data);
|
|
|
|
#ifndef NDEBUG
|
|
assert((ev->frames > _latest_frames)
|
|
|| (ev->frames == _latest_frames
|
|
&& ev->subframes >= _latest_subframes));
|
|
#endif
|
|
|
|
if (!(ret = append(ev->frames, ev->subframes, ev->type, ev->size, *data))) {
|
|
cerr << "ERROR: Failed to write event." << endl;
|
|
break;
|
|
}
|
|
|
|
_latest_frames = ev->frames;
|
|
_latest_subframes = ev->subframes;
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
|
|
} // namespace ARDOUR
|
|
|