annotate devuvuzelator-vst.cpp @ 7:5adad2ca3188

* minor tidy
author Chris Cannam
date Fri, 11 Jun 2010 16:38:16 +0100
parents 24dae253d31f
children e15ebd222c63
rev   line source
Chris@0 1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
Chris@0 2
Chris@2 3 #define _USE_MATH_DEFINES
Chris@2 4
Chris@0 5 #include <iostream>
Chris@0 6 #include <cmath>
Chris@2 7 #include <cstdio>
Chris@2 8 #include <malloc.h>
Chris@0 9
Chris@2 10 #include "public.sdk/source/vst2.x/audioeffect.h"
Chris@2 11
Chris@2 12 #define snprintf _snprintf
Chris@2 13 #define alloca _alloca
Chris@0 14
Chris@4 15 #define FFTSIZE 4096
Chris@4 16 #define WINSIZE 1024
Chris@4 17
Chris@4 18 #include "median.h"
Chris@0 19
Chris@0 20 class Devuvuzelator : public AudioEffect
Chris@0 21 {
Chris@0 22 enum {
Chris@6 23 FundamentalParam = 0,
Chris@6 24 BandwidthParam = 1,
Chris@6 25 HarmonicsParam = 2,
Chris@6 26 ReductionParam = 3,
Chris@6 27 NumParams = 4
Chris@0 28 };
Chris@0 29
Chris@0 30 public:
Chris@0 31 Devuvuzelator(audioMasterCallback cb);
Chris@0 32 ~Devuvuzelator();
Chris@0 33
Chris@0 34 virtual void getEffectName(char *n) {
Chris@0 35 vst_strncpy(n, "Devuvuzelator", kVstMaxEffectNameLen);
Chris@0 36 }
Chris@0 37 virtual void getProductString(char *n) {
Chris@0 38 vst_strncpy(n, "Devuvuzelator", kVstMaxProductStrLen);
Chris@0 39 }
Chris@0 40 virtual void getVendorString(char *n) {
Chris@0 41 vst_strncpy(n, "Queen Mary, University of London", kVstMaxVendorStrLen);
Chris@0 42 }
Chris@0 43
Chris@0 44 virtual void setParameter(VstInt32 index, float value);
Chris@0 45 virtual float getParameter(VstInt32 index);
Chris@0 46 virtual void getParameterLabel(VstInt32 index, char* label);
Chris@0 47 virtual void getParameterDisplay(VstInt32 index, char* text);
Chris@0 48 virtual void getParameterName(VstInt32 index, char* text);
Chris@0 49
Chris@0 50 virtual void setSampleRate (float sampleRate) {
Chris@0 51 m_sampleRate = sampleRate;
Chris@0 52 AudioEffect::setSampleRate(sampleRate);
Chris@0 53 }
Chris@0 54
Chris@0 55 virtual void processReplacing (float** inputs, float** outputs, VstInt32 sampleFrames) {
Chris@0 56 m_input = inputs[0];
Chris@0 57 m_output = outputs[0];
Chris@0 58 runImpl(sampleFrames);
Chris@0 59 }
Chris@0 60
Chris@0 61 void reset();
Chris@0 62 void window(float *);
Chris@0 63 void runImpl(unsigned long);
Chris@0 64 void processFrame();
Chris@0 65 void processSpectralFrame();
Chris@0 66
Chris@0 67 static void fft(unsigned int n, bool inverse,
Chris@0 68 double *ri, double *ii, double *ro, double *io);
Chris@0 69
Chris@2 70 float m_sampleRate;
Chris@0 71 float *m_input;
Chris@0 72 float *m_output;
Chris@0 73
Chris@0 74 float m_fundamental;
Chris@0 75 float m_bandwidth;
Chris@2 76 int m_harmonics;
Chris@0 77 float m_reduction;
Chris@0 78
Chris@0 79 const int m_fftsize;
Chris@4 80 const int m_winsize;
Chris@0 81 const int m_increment;
Chris@0 82 int m_fill;
Chris@0 83 int m_read;
Chris@0 84 float *m_buffer;
Chris@0 85 float *m_outacc;
Chris@0 86 double *m_real;
Chris@0 87 double *m_imag;
Chris@0 88 double *m_window;
Chris@4 89 MedianFilter<double> **m_medians;
Chris@0 90 };
Chris@0 91
Chris@1 92 // VST params 0->1
Chris@1 93
Chris@0 94 void
Chris@0 95 Devuvuzelator::setParameter(VstInt32 index, float value)
Chris@0 96 {
Chris@1 97 switch (index) {
Chris@4 98 case 0: m_fundamental = 50 + 720 * value; break;
Chris@4 99 case 1: m_bandwidth = 20 + 80 * value; break;
Chris@4 100 case 2: m_harmonics = int(value * 6 + 0.5); break;
Chris@4 101 case 3: m_reduction = 100 * value; break;
Chris@1 102 }
Chris@0 103 }
Chris@0 104
Chris@0 105 float
Chris@0 106 Devuvuzelator::getParameter(VstInt32 index)
Chris@0 107 {
Chris@1 108 switch (index) {
Chris@4 109 case 0: return (m_fundamental - 50) / 720;
Chris@4 110 case 1: return (m_bandwidth - 20) / 80;
Chris@4 111 case 2: return (m_harmonics / 6.f);
Chris@4 112 case 3: return m_reduction / 100;
Chris@1 113 }
Chris@4 114 return 0;
Chris@0 115 }
Chris@0 116
Chris@0 117 // NB! The max name length for VST parameter names, labels
Chris@0 118 // (i.e. units) and display values (i.e. string renderings of current
Chris@0 119 // value) is a rather amazing 8 bytes
Chris@0 120
Chris@0 121 void
Chris@0 122 Devuvuzelator::getParameterLabel(VstInt32 index, char *label)
Chris@0 123 {
Chris@0 124 const char *units[NumParams] = {
Chris@0 125 "Hz",
Chris@0 126 "Hz",
Chris@0 127 "",
Chris@4 128 "%",
Chris@0 129 };
Chris@0 130
Chris@0 131 vst_strncpy(label, units[index], kVstMaxParamStrLen);
Chris@0 132 }
Chris@0 133
Chris@0 134 void
Chris@0 135 Devuvuzelator::getParameterDisplay(VstInt32 index, char *label)
Chris@0 136 {
Chris@4 137 switch (index) {
Chris@4 138 case 0: snprintf(label, kVstMaxParamStrLen, "%f", m_fundamental); break;
Chris@4 139 case 1: snprintf(label, kVstMaxParamStrLen, "%f", m_bandwidth); break;
Chris@4 140 case 2: snprintf(label, kVstMaxParamStrLen, "%d", m_harmonics); break;
Chris@4 141 case 3: snprintf(label, kVstMaxParamStrLen, "%f", m_reduction); break;
Chris@4 142 }
Chris@0 143 }
Chris@0 144
Chris@0 145 void
Chris@0 146 Devuvuzelator::getParameterName(VstInt32 index, char *label)
Chris@0 147 {
Chris@0 148 const char *names[NumParams] = {
Chris@0 149 "Pitch",
Chris@0 150 "B/W",
Chris@0 151 "Partials",
Chris@0 152 "Reductn",
Chris@0 153 };
Chris@0 154
Chris@0 155 vst_strncpy(label, names[index], kVstMaxParamStrLen);
Chris@0 156 }
Chris@0 157
Chris@0 158 Devuvuzelator::Devuvuzelator(audioMasterCallback cb) :
Chris@0 159 AudioEffect(cb, 0, NumParams),
Chris@0 160 m_sampleRate(0),
Chris@0 161 m_input(0),
Chris@0 162 m_output(0),
Chris@0 163 m_fftsize(FFTSIZE),
Chris@7 164 m_winsize(WINSIZE),
Chris@5 165 m_increment(m_winsize/2),
Chris@0 166 m_fill(0),
Chris@0 167 m_read(0)
Chris@0 168 {
Chris@4 169 m_buffer = new float[m_winsize];
Chris@4 170 m_outacc = new float[m_winsize * 2];
Chris@4 171 m_window = new double[m_winsize];
Chris@0 172 m_real = new double[m_fftsize];
Chris@0 173 m_imag = new double[m_fftsize];
Chris@4 174 m_medians = new MedianFilter<double> *[m_fftsize/2+1];
Chris@0 175
Chris@4 176 for (int i = 0; i < m_winsize; ++i) {
Chris@4 177 m_window[i] = 0.5 - 0.5 * cos(2 * M_PI * i / m_winsize);
Chris@4 178 }
Chris@4 179 for (int i = 0; i < m_fftsize/2+1; ++i) {
Chris@4 180 m_medians[i] = 0;
Chris@0 181 }
Chris@0 182
Chris@4 183 m_fundamental = 230;
Chris@0 184 m_bandwidth = 60;
Chris@0 185 m_harmonics = 3;
Chris@4 186 m_reduction = 30;
Chris@0 187
Chris@2 188 setUniqueID('qmvz');
Chris@0 189 setNumInputs(1);
Chris@0 190 setNumOutputs(1);
Chris@0 191 canProcessReplacing(true);
Chris@0 192 canDoubleReplacing(false);
Chris@0 193
Chris@0 194 reset();
Chris@0 195 }
Chris@0 196
Chris@0 197 Devuvuzelator::~Devuvuzelator()
Chris@0 198 {
Chris@0 199 delete[] m_buffer;
Chris@0 200 delete[] m_outacc;
Chris@0 201 delete[] m_real;
Chris@0 202 delete[] m_imag;
Chris@0 203 delete[] m_window;
Chris@4 204 for (int i = 0; i < m_fftsize/2+1; ++i) {
Chris@4 205 delete m_medians[i];
Chris@4 206 }
Chris@4 207 delete[] m_medians;
Chris@0 208 }
Chris@0 209
Chris@0 210 void
Chris@0 211 Devuvuzelator::reset()
Chris@0 212 {
Chris@4 213 for (int i = 0; i < m_winsize; ++i) {
Chris@0 214 m_buffer[i] = 0.f;
Chris@0 215 }
Chris@4 216 for (int i = 0; i < m_winsize*2; ++i) {
Chris@0 217 m_outacc[i] = 0.f;
Chris@0 218 }
Chris@0 219 m_fill = 0;
Chris@0 220 m_read = 0;
Chris@4 221 for (int i = 0; i < m_fftsize/2+1; ++i) {
Chris@4 222 if (m_medians[i]) m_medians[i]->reset();
Chris@4 223 }
Chris@0 224 }
Chris@0 225
Chris@0 226 void
Chris@0 227 Devuvuzelator::runImpl(unsigned long sampleCount)
Chris@0 228 {
Chris@0 229 if (!m_input || !m_output) return;
Chris@0 230
Chris@0 231 int ii = 0;
Chris@0 232 int oi = 0;
Chris@4 233 const int sc = sampleCount;
Chris@0 234
Chris@2 235 while (ii < sc) {
Chris@0 236
Chris@4 237 m_output[oi++] = m_outacc[m_read++];
Chris@0 238
Chris@4 239 if (m_fill == m_winsize) {
Chris@0 240
Chris@0 241 processFrame();
Chris@0 242
Chris@4 243 for (int j = m_increment; j < m_winsize; ++j) {
Chris@0 244 m_buffer[j - m_increment] = m_buffer[j];
Chris@0 245 }
Chris@0 246
Chris@4 247 for (int j = m_increment; j < m_winsize*2; ++j) {
Chris@0 248 m_outacc[j - m_increment] = m_outacc[j];
Chris@0 249 }
Chris@0 250
Chris@4 251 for (int j = m_winsize*2 - m_increment; j < m_winsize*2; ++j) {
Chris@0 252 m_outacc[j] = 0.f;
Chris@0 253 }
Chris@0 254
Chris@0 255 m_fill -= m_increment;
Chris@0 256 m_read -= m_increment;
Chris@0 257 }
Chris@0 258
Chris@0 259 m_buffer[m_fill++] = m_input[ii++];
Chris@0 260 }
Chris@0 261 }
Chris@0 262
Chris@0 263 void
Chris@0 264 Devuvuzelator::processFrame()
Chris@0 265 {
Chris@0 266 double *frame = (double *)alloca(m_fftsize * sizeof(double));
Chris@0 267 for (int i = 0; i < m_fftsize; ++i) {
Chris@4 268 frame[i] = 0.0;
Chris@4 269 }
Chris@4 270
Chris@4 271 int ix = m_fftsize - m_winsize/2;
Chris@4 272 while (ix < 0) ix += m_fftsize;
Chris@4 273 for (int i = 0; i < m_winsize; ++i) {
Chris@4 274 frame[ix++] += m_buffer[i] * m_window[i];
Chris@0 275 if (ix == m_fftsize) ix = 0;
Chris@0 276 }
Chris@0 277
Chris@0 278 fft(m_fftsize, false, frame, 0, m_real, m_imag);
Chris@0 279
Chris@0 280 processSpectralFrame();
Chris@0 281
Chris@0 282 for (int i = 0; i < m_fftsize/2-1; ++i) {
Chris@3 283 m_real[m_fftsize-i-1] = m_real[i+1];
Chris@3 284 m_imag[m_fftsize-i-1] = -m_imag[i+1];
Chris@0 285 }
Chris@0 286
Chris@0 287 double *spare = (double *)alloca(m_fftsize * sizeof(double));
Chris@0 288 fft(m_fftsize, true, m_real, m_imag, frame, spare);
Chris@0 289
Chris@4 290 ix = m_fftsize - m_winsize/2;
Chris@4 291 while (ix < 0) ix += m_fftsize;
Chris@4 292 for (int i = 0; i < m_winsize; ++i) {
Chris@4 293 m_outacc[m_winsize + i] += frame[ix++];
Chris@0 294 if (ix == m_fftsize) ix = 0;
Chris@0 295 }
Chris@0 296 }
Chris@0 297
Chris@0 298 // FFT implementation by Don Cross, public domain.
Chris@0 299 // This version scales the forward transform.
Chris@0 300
Chris@0 301 void Devuvuzelator::fft(unsigned int n, bool inverse,
Chris@0 302 double *ri, double *ii, double *ro, double *io)
Chris@0 303 {
Chris@0 304 if (!ri || !ro || !io) return;
Chris@0 305
Chris@0 306 unsigned int bits;
Chris@0 307 unsigned int i, j, k, m;
Chris@0 308 unsigned int blockSize, blockEnd;
Chris@0 309
Chris@0 310 double tr, ti;
Chris@0 311
Chris@0 312 if (n < 2) return;
Chris@0 313 if (n & (n-1)) return;
Chris@0 314
Chris@0 315 double angle = 2.0 * M_PI;
Chris@0 316 if (inverse) angle = -angle;
Chris@0 317
Chris@0 318 for (i = 0; ; ++i) {
Chris@0 319 if (n & (1 << i)) {
Chris@0 320 bits = i;
Chris@0 321 break;
Chris@0 322 }
Chris@0 323 }
Chris@0 324
Chris@0 325 static unsigned int tableSize = 0;
Chris@0 326 static int *table = 0;
Chris@0 327
Chris@0 328 if (tableSize != n) {
Chris@0 329
Chris@0 330 delete[] table;
Chris@0 331
Chris@0 332 table = new int[n];
Chris@0 333
Chris@0 334 for (i = 0; i < n; ++i) {
Chris@0 335
Chris@0 336 m = i;
Chris@0 337
Chris@0 338 for (j = k = 0; j < bits; ++j) {
Chris@0 339 k = (k << 1) | (m & 1);
Chris@0 340 m >>= 1;
Chris@0 341 }
Chris@0 342
Chris@0 343 table[i] = k;
Chris@0 344 }
Chris@0 345
Chris@0 346 tableSize = n;
Chris@0 347 }
Chris@0 348
Chris@0 349 if (ii) {
Chris@0 350 for (i = 0; i < n; ++i) {
Chris@0 351 ro[table[i]] = ri[i];
Chris@0 352 io[table[i]] = ii[i];
Chris@0 353 }
Chris@0 354 } else {
Chris@0 355 for (i = 0; i < n; ++i) {
Chris@0 356 ro[table[i]] = ri[i];
Chris@0 357 io[table[i]] = 0.0;
Chris@0 358 }
Chris@0 359 }
Chris@0 360
Chris@0 361 blockEnd = 1;
Chris@0 362
Chris@0 363 for (blockSize = 2; blockSize <= n; blockSize <<= 1) {
Chris@0 364
Chris@0 365 double delta = angle / (double)blockSize;
Chris@0 366 double sm2 = -sin(-2 * delta);
Chris@0 367 double sm1 = -sin(-delta);
Chris@0 368 double cm2 = cos(-2 * delta);
Chris@0 369 double cm1 = cos(-delta);
Chris@0 370 double w = 2 * cm1;
Chris@0 371 double ar[3], ai[3];
Chris@0 372
Chris@0 373 for (i = 0; i < n; i += blockSize) {
Chris@0 374
Chris@0 375 ar[2] = cm2;
Chris@0 376 ar[1] = cm1;
Chris@0 377
Chris@0 378 ai[2] = sm2;
Chris@0 379 ai[1] = sm1;
Chris@0 380
Chris@0 381 for (j = i, m = 0; m < blockEnd; j++, m++) {
Chris@0 382
Chris@0 383 ar[0] = w * ar[1] - ar[2];
Chris@0 384 ar[2] = ar[1];
Chris@0 385 ar[1] = ar[0];
Chris@0 386
Chris@0 387 ai[0] = w * ai[1] - ai[2];
Chris@0 388 ai[2] = ai[1];
Chris@0 389 ai[1] = ai[0];
Chris@0 390
Chris@0 391 k = j + blockEnd;
Chris@0 392 tr = ar[0] * ro[k] - ai[0] * io[k];
Chris@0 393 ti = ar[0] * io[k] + ai[0] * ro[k];
Chris@0 394
Chris@0 395 ro[k] = ro[j] - tr;
Chris@0 396 io[k] = io[j] - ti;
Chris@0 397
Chris@0 398 ro[j] += tr;
Chris@0 399 io[j] += ti;
Chris@0 400 }
Chris@0 401 }
Chris@0 402
Chris@0 403 blockEnd = blockSize;
Chris@0 404 }
Chris@0 405
Chris@0 406 if (!inverse) {
Chris@0 407
Chris@0 408 double denom = (double)n;
Chris@0 409
Chris@0 410 for (i = 0; i < n; i++) {
Chris@0 411 ro[i] /= denom;
Chris@0 412 io[i] /= denom;
Chris@0 413 }
Chris@0 414 }
Chris@0 415 }
Chris@0 416
Chris@0 417 AudioEffect *createEffectInstance(audioMasterCallback audioMaster)
Chris@0 418 {
Chris@0 419 return new Devuvuzelator(audioMaster);
Chris@0 420 }
Chris@0 421
Chris@1 422 #include "devuvuzelator.cpp"
Chris@1 423