cannam@59
|
1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
cannam@59
|
2
|
cannam@59
|
3 /*
|
cannam@59
|
4 Vamp
|
cannam@59
|
5
|
cannam@59
|
6 An API for audio analysis and feature extraction plugins.
|
cannam@59
|
7
|
cannam@59
|
8 Centre for Digital Music, Queen Mary, University of London.
|
cannam@59
|
9 Copyright 2006 Chris Cannam.
|
cannam@59
|
10
|
cannam@59
|
11 Permission is hereby granted, free of charge, to any person
|
cannam@59
|
12 obtaining a copy of this software and associated documentation
|
cannam@59
|
13 files (the "Software"), to deal in the Software without
|
cannam@59
|
14 restriction, including without limitation the rights to use, copy,
|
cannam@59
|
15 modify, merge, publish, distribute, sublicense, and/or sell copies
|
cannam@59
|
16 of the Software, and to permit persons to whom the Software is
|
cannam@59
|
17 furnished to do so, subject to the following conditions:
|
cannam@59
|
18
|
cannam@59
|
19 The above copyright notice and this permission notice shall be
|
cannam@59
|
20 included in all copies or substantial portions of the Software.
|
cannam@59
|
21
|
cannam@59
|
22 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
cannam@59
|
23 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
cannam@59
|
24 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
cannam@59
|
25 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
|
cannam@59
|
26 ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
|
cannam@59
|
27 CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
cannam@59
|
28 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
cannam@59
|
29
|
cannam@59
|
30 Except as contained in this notice, the names of the Centre for
|
cannam@59
|
31 Digital Music; Queen Mary, University of London; and Chris Cannam
|
cannam@59
|
32 shall not be used in advertising or otherwise to promote the sale,
|
cannam@59
|
33 use or other dealings in this Software without prior written
|
cannam@59
|
34 authorization.
|
cannam@59
|
35 */
|
cannam@59
|
36
|
cannam@59
|
37 #include "PluginChannelAdapter.h"
|
cannam@59
|
38
|
cannam@59
|
39 namespace Vamp {
|
cannam@59
|
40
|
cannam@59
|
41 namespace HostExt {
|
cannam@59
|
42
|
cannam@59
|
43 PluginChannelAdapter::PluginChannelAdapter(Plugin *plugin) :
|
cannam@59
|
44 PluginWrapper(plugin),
|
cannam@59
|
45 m_blockSize(0),
|
cannam@59
|
46 m_inputChannels(0),
|
cannam@59
|
47 m_pluginChannels(0),
|
cannam@59
|
48 m_buffer(0),
|
cannam@59
|
49 m_forwardPtrs(0)
|
cannam@59
|
50 {
|
cannam@59
|
51 }
|
cannam@59
|
52
|
cannam@59
|
53 PluginChannelAdapter::~PluginChannelAdapter()
|
cannam@59
|
54 {
|
cannam@59
|
55 if (m_buffer) {
|
cannam@59
|
56 if (m_inputChannels > m_pluginChannels) {
|
cannam@59
|
57 delete[] m_buffer[0];
|
cannam@59
|
58 } else {
|
cannam@59
|
59 for (size_t i = 0; i < m_pluginChannels - m_inputChannels; ++i) {
|
cannam@59
|
60 delete[] m_buffer[i];
|
cannam@59
|
61 }
|
cannam@59
|
62 }
|
cannam@59
|
63 delete[] m_buffer;
|
cannam@59
|
64 m_buffer = 0;
|
cannam@59
|
65 }
|
cannam@59
|
66
|
cannam@59
|
67 if (m_forwardPtrs) {
|
cannam@59
|
68 delete[] m_forwardPtrs;
|
cannam@59
|
69 m_forwardPtrs = 0;
|
cannam@59
|
70 }
|
cannam@59
|
71 }
|
cannam@59
|
72
|
cannam@59
|
73 bool
|
cannam@59
|
74 PluginChannelAdapter::initialise(size_t channels, size_t stepSize, size_t blockSize)
|
cannam@59
|
75 {
|
cannam@59
|
76 m_blockSize = blockSize;
|
cannam@59
|
77
|
cannam@59
|
78 size_t minch = m_plugin->getMinChannelCount();
|
cannam@59
|
79 size_t maxch = m_plugin->getMaxChannelCount();
|
cannam@59
|
80
|
cannam@59
|
81 m_inputChannels = channels;
|
cannam@59
|
82
|
cannam@59
|
83 if (channels < minch) {
|
cannam@59
|
84 m_forwardPtrs = new const float *[minch];
|
cannam@59
|
85 if (m_inputChannels > 1) {
|
cannam@59
|
86 // We need a set of zero-valued buffers to add to the
|
cannam@59
|
87 // forwarded pointers
|
cannam@59
|
88 m_buffer = new float*[minch - channels];
|
cannam@59
|
89 for (size_t i = 0; i < minch; ++i) {
|
cannam@59
|
90 m_buffer[i] = new float[blockSize];
|
cannam@59
|
91 for (size_t j = 0; j < blockSize; ++j) {
|
cannam@59
|
92 m_buffer[i][j] = 0.f;
|
cannam@59
|
93 }
|
cannam@59
|
94 }
|
cannam@59
|
95 }
|
cannam@59
|
96 m_pluginChannels = minch;
|
cannam@59
|
97 return m_plugin->initialise(minch, stepSize, blockSize);
|
cannam@59
|
98 }
|
cannam@59
|
99
|
cannam@59
|
100 if (channels > maxch) {
|
cannam@59
|
101 // We only need m_buffer if we are mixing down to a single
|
cannam@59
|
102 // channel -- otherwise we can just forward the same float* as
|
cannam@59
|
103 // passed in to process(), expecting the excess to be ignored
|
cannam@59
|
104 if (maxch == 1) {
|
cannam@59
|
105 m_buffer = new float *[1];
|
cannam@59
|
106 m_buffer[0] = new float[blockSize];
|
cannam@59
|
107 }
|
cannam@59
|
108 m_pluginChannels = maxch;
|
cannam@59
|
109 return m_plugin->initialise(maxch, stepSize, blockSize);
|
cannam@59
|
110 }
|
cannam@59
|
111
|
cannam@59
|
112 m_pluginChannels = channels;
|
cannam@59
|
113 return m_plugin->initialise(channels, stepSize, blockSize);
|
cannam@59
|
114 }
|
cannam@59
|
115
|
cannam@59
|
116 PluginChannelAdapter::FeatureSet
|
cannam@59
|
117 PluginChannelAdapter::process(const float *const *inputBuffers,
|
cannam@59
|
118 RealTime timestamp)
|
cannam@59
|
119 {
|
cannam@59
|
120 if (m_inputChannels < m_pluginChannels) {
|
cannam@59
|
121
|
cannam@59
|
122 if (m_inputChannels == 1) {
|
cannam@59
|
123 for (size_t i = 0; i < m_pluginChannels; ++i) {
|
cannam@59
|
124 m_forwardPtrs[i] = inputBuffers[0];
|
cannam@59
|
125 }
|
cannam@59
|
126 } else {
|
cannam@59
|
127 for (size_t i = 0; i < m_inputChannels; ++i) {
|
cannam@59
|
128 m_forwardPtrs[i] = inputBuffers[i];
|
cannam@59
|
129 }
|
cannam@59
|
130 for (size_t i = m_inputChannels; i < m_pluginChannels; ++i) {
|
cannam@59
|
131 m_forwardPtrs[i] = m_buffer[i - m_inputChannels];
|
cannam@59
|
132 }
|
cannam@59
|
133 }
|
cannam@59
|
134
|
cannam@59
|
135 return m_plugin->process(m_forwardPtrs, timestamp);
|
cannam@59
|
136 }
|
cannam@59
|
137
|
cannam@59
|
138 if (m_inputChannels > m_pluginChannels) {
|
cannam@59
|
139
|
cannam@59
|
140 if (m_pluginChannels == 1) {
|
cannam@59
|
141 for (size_t j = 0; j < m_blockSize; ++j) {
|
cannam@59
|
142 m_buffer[0][j] = inputBuffers[0][j];
|
cannam@59
|
143 }
|
cannam@59
|
144 for (size_t i = 1; i < m_inputChannels; ++i) {
|
cannam@59
|
145 for (size_t j = 0; j < m_blockSize; ++j) {
|
cannam@59
|
146 m_buffer[0][j] += inputBuffers[i][j];
|
cannam@59
|
147 }
|
cannam@59
|
148 }
|
cannam@59
|
149 for (size_t j = 0; j < m_blockSize; ++j) {
|
cannam@59
|
150 m_buffer[0][j] /= m_inputChannels;
|
cannam@59
|
151 }
|
cannam@59
|
152 return m_plugin->process(m_buffer, timestamp);
|
cannam@59
|
153 } else {
|
cannam@59
|
154 return m_plugin->process(inputBuffers, timestamp);
|
cannam@59
|
155 }
|
cannam@59
|
156 }
|
cannam@59
|
157
|
cannam@59
|
158 return m_plugin->process(inputBuffers, timestamp);
|
cannam@59
|
159 }
|
cannam@59
|
160
|
cannam@59
|
161 }
|
cannam@59
|
162
|
cannam@59
|
163 }
|
cannam@59
|
164
|
cannam@59
|
165
|