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