Chris@148
|
1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
Chris@148
|
2
|
Chris@148
|
3 /*
|
Chris@148
|
4 Sonic Visualiser
|
Chris@148
|
5 An audio file viewer and annotation editor.
|
Chris@148
|
6 Centre for Digital Music, Queen Mary, University of London.
|
Chris@148
|
7 This file copyright 2006 Chris Cannam.
|
Chris@148
|
8
|
Chris@148
|
9 This program is free software; you can redistribute it and/or
|
Chris@148
|
10 modify it under the terms of the GNU General Public License as
|
Chris@148
|
11 published by the Free Software Foundation; either version 2 of the
|
Chris@148
|
12 License, or (at your option) any later version. See the file
|
Chris@148
|
13 COPYING included with this distribution for more information.
|
Chris@148
|
14 */
|
Chris@148
|
15
|
Chris@148
|
16 #include "FFTDataServer.h"
|
Chris@148
|
17
|
Chris@148
|
18 #include "FFTFileCache.h"
|
Chris@148
|
19
|
Chris@148
|
20 #include "model/DenseTimeValueModel.h"
|
Chris@148
|
21
|
Chris@150
|
22 #include "system/System.h"
|
Chris@148
|
23
|
Chris@153
|
24 #define DEBUG_FFT_SERVER 1
|
Chris@154
|
25 //#define DEBUG_FFT_SERVER_FILL 1
|
Chris@148
|
26
|
Chris@148
|
27 #ifdef DEBUG_FFT_SERVER_FILL
|
Chris@153
|
28 #ifndef DEBUG_FFT_SERVER
|
Chris@153
|
29 #define DEBUG_FFT_SERVER 1
|
Chris@153
|
30 #endif
|
Chris@148
|
31 #endif
|
Chris@148
|
32
|
Chris@148
|
33 FFTDataServer::ServerMap FFTDataServer::m_servers;
|
Chris@148
|
34 QMutex FFTDataServer::m_serverMapMutex;
|
Chris@148
|
35
|
Chris@148
|
36 FFTDataServer *
|
Chris@148
|
37 FFTDataServer::getInstance(const DenseTimeValueModel *model,
|
Chris@148
|
38 int channel,
|
Chris@148
|
39 WindowType windowType,
|
Chris@148
|
40 size_t windowSize,
|
Chris@148
|
41 size_t windowIncrement,
|
Chris@148
|
42 size_t fftSize,
|
Chris@148
|
43 bool polar,
|
Chris@148
|
44 size_t fillFromColumn)
|
Chris@148
|
45 {
|
Chris@148
|
46 QString n = generateFileBasename(model,
|
Chris@148
|
47 channel,
|
Chris@148
|
48 windowType,
|
Chris@148
|
49 windowSize,
|
Chris@148
|
50 windowIncrement,
|
Chris@148
|
51 fftSize,
|
Chris@148
|
52 polar);
|
Chris@148
|
53
|
Chris@148
|
54 FFTDataServer *server = 0;
|
Chris@148
|
55
|
Chris@148
|
56 QMutexLocker locker(&m_serverMapMutex);
|
Chris@148
|
57
|
Chris@148
|
58 if ((server = findServer(n))) {
|
Chris@148
|
59 return server;
|
Chris@148
|
60 }
|
Chris@148
|
61
|
Chris@148
|
62 QString npn = generateFileBasename(model,
|
Chris@148
|
63 channel,
|
Chris@148
|
64 windowType,
|
Chris@148
|
65 windowSize,
|
Chris@148
|
66 windowIncrement,
|
Chris@148
|
67 fftSize,
|
Chris@148
|
68 !polar);
|
Chris@148
|
69
|
Chris@148
|
70 if ((server = findServer(npn))) {
|
Chris@148
|
71 return server;
|
Chris@148
|
72 }
|
Chris@148
|
73
|
Chris@148
|
74 m_servers[n] = ServerCountPair
|
Chris@148
|
75 (new FFTDataServer(n,
|
Chris@148
|
76 model,
|
Chris@148
|
77 channel,
|
Chris@148
|
78 windowType,
|
Chris@148
|
79 windowSize,
|
Chris@148
|
80 windowIncrement,
|
Chris@148
|
81 fftSize,
|
Chris@148
|
82 polar,
|
Chris@148
|
83 fillFromColumn),
|
Chris@148
|
84 1);
|
Chris@148
|
85
|
Chris@148
|
86 return m_servers[n].first;
|
Chris@148
|
87 }
|
Chris@148
|
88
|
Chris@148
|
89 FFTDataServer *
|
Chris@148
|
90 FFTDataServer::getFuzzyInstance(const DenseTimeValueModel *model,
|
Chris@148
|
91 int channel,
|
Chris@148
|
92 WindowType windowType,
|
Chris@148
|
93 size_t windowSize,
|
Chris@148
|
94 size_t windowIncrement,
|
Chris@148
|
95 size_t fftSize,
|
Chris@148
|
96 bool polar,
|
Chris@148
|
97 size_t fillFromColumn)
|
Chris@148
|
98 {
|
Chris@148
|
99 // Fuzzy matching:
|
Chris@148
|
100 //
|
Chris@148
|
101 // -- if we're asked for polar and have non-polar, use it (and
|
Chris@148
|
102 // vice versa). This one is vital, and we do it for non-fuzzy as
|
Chris@148
|
103 // well (above).
|
Chris@148
|
104 //
|
Chris@148
|
105 // -- if we're asked for an instance with a given fft size and we
|
Chris@148
|
106 // have one already with a multiple of that fft size but the same
|
Chris@148
|
107 // window size and type (and model), we can draw the results from
|
Chris@148
|
108 // it (e.g. the 1st, 2nd, 3rd etc bins of a 512-sample FFT are the
|
Chris@148
|
109 // same as the the 1st, 5th, 9th etc of a 2048-sample FFT of the
|
Chris@148
|
110 // same window plus zero padding).
|
Chris@148
|
111 //
|
Chris@148
|
112 // -- if we're asked for an instance with a given window type and
|
Chris@148
|
113 // size and fft size and we have one already the same but with a
|
Chris@148
|
114 // smaller increment, we can draw the results from it (provided
|
Chris@148
|
115 // our increment is a multiple of its)
|
Chris@148
|
116 //
|
Chris@152
|
117 // The FFTModel knows how to interpret these things. In
|
Chris@148
|
118 // both cases we require that the larger one is a power-of-two
|
Chris@148
|
119 // multiple of the smaller (e.g. even though in principle you can
|
Chris@148
|
120 // draw the results at increment 256 from those at increment 768
|
Chris@152
|
121 // or 1536, the model doesn't support this).
|
Chris@148
|
122
|
Chris@148
|
123 {
|
Chris@148
|
124 QMutexLocker locker(&m_serverMapMutex);
|
Chris@148
|
125
|
Chris@148
|
126 ServerMap::iterator best = m_servers.end();
|
Chris@148
|
127 int bestdist = -1;
|
Chris@148
|
128
|
Chris@148
|
129 for (ServerMap::iterator i = m_servers.begin(); i != m_servers.end(); ++i) {
|
Chris@148
|
130
|
Chris@148
|
131 FFTDataServer *server = i->second.first;
|
Chris@148
|
132
|
Chris@148
|
133 if (server->getModel() == model &&
|
Chris@148
|
134 (server->getChannel() == channel || model->getChannelCount() == 1) &&
|
Chris@148
|
135 server->getWindowType() == windowType &&
|
Chris@148
|
136 server->getWindowSize() == windowSize &&
|
Chris@148
|
137 server->getWindowIncrement() <= windowIncrement &&
|
Chris@148
|
138 server->getFFTSize() >= fftSize) {
|
Chris@148
|
139
|
Chris@148
|
140 if ((windowIncrement % server->getWindowIncrement()) != 0) continue;
|
Chris@148
|
141 int ratio = windowIncrement / server->getWindowIncrement();
|
Chris@148
|
142 bool poweroftwo = true;
|
Chris@148
|
143 while (ratio > 1) {
|
Chris@148
|
144 if (ratio & 0x1) {
|
Chris@148
|
145 poweroftwo = false;
|
Chris@148
|
146 break;
|
Chris@148
|
147 }
|
Chris@148
|
148 ratio >>= 1;
|
Chris@148
|
149 }
|
Chris@148
|
150 if (!poweroftwo) continue;
|
Chris@148
|
151
|
Chris@148
|
152 if ((server->getFFTSize() % fftSize) != 0) continue;
|
Chris@148
|
153 ratio = server->getFFTSize() / fftSize;
|
Chris@148
|
154 while (ratio > 1) {
|
Chris@148
|
155 if (ratio & 0x1) {
|
Chris@148
|
156 poweroftwo = false;
|
Chris@148
|
157 break;
|
Chris@148
|
158 }
|
Chris@148
|
159 ratio >>= 1;
|
Chris@148
|
160 }
|
Chris@148
|
161 if (!poweroftwo) continue;
|
Chris@148
|
162
|
Chris@148
|
163 int distance = 0;
|
Chris@148
|
164
|
Chris@148
|
165 if (server->getPolar() != polar) distance += 1;
|
Chris@148
|
166
|
Chris@148
|
167 distance += ((windowIncrement / server->getWindowIncrement()) - 1) * 15;
|
Chris@148
|
168 distance += ((server->getFFTSize() / fftSize) - 1) * 10;
|
Chris@148
|
169
|
Chris@148
|
170 if (server->getFillCompletion() < 50) distance += 100;
|
Chris@148
|
171
|
Chris@148
|
172 #ifdef DEBUG_FFT_SERVER
|
Chris@148
|
173 std::cerr << "Distance " << distance << ", best is " << bestdist << std::endl;
|
Chris@148
|
174 #endif
|
Chris@148
|
175
|
Chris@148
|
176 if (bestdist == -1 || distance < bestdist) {
|
Chris@148
|
177 bestdist = distance;
|
Chris@148
|
178 best = i;
|
Chris@148
|
179 }
|
Chris@148
|
180 }
|
Chris@148
|
181 }
|
Chris@148
|
182
|
Chris@148
|
183 if (bestdist >= 0) {
|
Chris@148
|
184 ++best->second.second;
|
Chris@148
|
185 return best->second.first;
|
Chris@148
|
186 }
|
Chris@148
|
187 }
|
Chris@148
|
188
|
Chris@148
|
189 // Nothing found, make a new one
|
Chris@148
|
190
|
Chris@148
|
191 return getInstance(model,
|
Chris@148
|
192 channel,
|
Chris@148
|
193 windowType,
|
Chris@148
|
194 windowSize,
|
Chris@148
|
195 windowIncrement,
|
Chris@148
|
196 fftSize,
|
Chris@148
|
197 polar,
|
Chris@148
|
198 fillFromColumn);
|
Chris@148
|
199 }
|
Chris@148
|
200
|
Chris@148
|
201 FFTDataServer *
|
Chris@148
|
202 FFTDataServer::findServer(QString n)
|
Chris@148
|
203 {
|
Chris@148
|
204 if (m_servers.find(n) != m_servers.end()) {
|
Chris@148
|
205 ++m_servers[n].second;
|
Chris@148
|
206 return m_servers[n].first;
|
Chris@148
|
207 }
|
Chris@148
|
208
|
Chris@148
|
209 return 0;
|
Chris@148
|
210 }
|
Chris@148
|
211
|
Chris@148
|
212 void
|
Chris@152
|
213 FFTDataServer::claimInstance(FFTDataServer *server)
|
Chris@152
|
214 {
|
Chris@152
|
215
|
Chris@152
|
216 QMutexLocker locker(&m_serverMapMutex);
|
Chris@152
|
217
|
Chris@152
|
218 for (ServerMap::iterator i = m_servers.begin(); i != m_servers.end(); ++i) {
|
Chris@152
|
219 if (i->second.first == server) {
|
Chris@152
|
220 ++i->second.second;
|
Chris@152
|
221 return;
|
Chris@152
|
222 }
|
Chris@152
|
223 }
|
Chris@152
|
224
|
Chris@152
|
225 std::cerr << "ERROR: FFTDataServer::claimInstance: instance "
|
Chris@152
|
226 << server << " unknown!" << std::endl;
|
Chris@152
|
227 }
|
Chris@152
|
228
|
Chris@152
|
229 void
|
Chris@148
|
230 FFTDataServer::releaseInstance(FFTDataServer *server)
|
Chris@148
|
231 {
|
Chris@148
|
232 #ifdef DEBUG_FFT_SERVER
|
Chris@148
|
233 std::cerr << "FFTDataServer::releaseInstance(" << server << ")" << std::endl;
|
Chris@148
|
234 #endif
|
Chris@148
|
235
|
Chris@148
|
236 QMutexLocker locker(&m_serverMapMutex);
|
Chris@148
|
237
|
Chris@148
|
238 //!!! not a good strategy. Want something like:
|
Chris@148
|
239
|
Chris@148
|
240 // -- if ref count > 0, decrement and return
|
Chris@148
|
241 // -- if the instance hasn't been used at all, delete it immediately
|
Chris@148
|
242 // -- if fewer than N instances (N = e.g. 3) remain with zero refcounts,
|
Chris@148
|
243 // leave them hanging around
|
Chris@148
|
244 // -- if N instances with zero refcounts remain, delete the one that
|
Chris@148
|
245 // was last released first
|
Chris@148
|
246 // -- if we run out of disk space when allocating an instance, go back
|
Chris@148
|
247 // and delete the spare N instances before trying again
|
Chris@148
|
248 // -- have an additional method to indicate that a model has been
|
Chris@148
|
249 // destroyed, so that we can delete all of its fft server instances
|
Chris@148
|
250
|
Chris@148
|
251 // also:
|
Chris@148
|
252 //
|
Chris@148
|
253
|
Chris@148
|
254 for (ServerMap::iterator i = m_servers.begin(); i != m_servers.end(); ++i) {
|
Chris@148
|
255 if (i->second.first == server) {
|
Chris@148
|
256 if (i->second.second == 0) {
|
Chris@148
|
257 std::cerr << "ERROR: FFTDataServer::releaseInstance("
|
Chris@148
|
258 << server << "): instance not allocated" << std::endl;
|
Chris@148
|
259 } else if (--i->second.second == 0) {
|
Chris@148
|
260 if (server->m_lastUsedCache == -1) { // never used
|
Chris@148
|
261 delete server;
|
Chris@148
|
262 m_servers.erase(i);
|
Chris@148
|
263 } else {
|
Chris@148
|
264 server->suspend();
|
Chris@148
|
265 purgeLimbo();
|
Chris@148
|
266 }
|
Chris@148
|
267 }
|
Chris@148
|
268 return;
|
Chris@148
|
269 }
|
Chris@148
|
270 }
|
Chris@148
|
271
|
Chris@148
|
272 std::cerr << "ERROR: FFTDataServer::releaseInstance(" << server << "): "
|
Chris@148
|
273 << "instance not found" << std::endl;
|
Chris@148
|
274 }
|
Chris@148
|
275
|
Chris@148
|
276 void
|
Chris@148
|
277 FFTDataServer::purgeLimbo(int maxSize)
|
Chris@148
|
278 {
|
Chris@148
|
279 ServerMap::iterator i = m_servers.end();
|
Chris@148
|
280
|
Chris@148
|
281 int count = 0;
|
Chris@148
|
282
|
Chris@148
|
283 while (i != m_servers.begin()) {
|
Chris@148
|
284 --i;
|
Chris@148
|
285 if (i->second.second == 0) {
|
Chris@148
|
286 if (++count > maxSize) {
|
Chris@148
|
287 delete i->second.first;
|
Chris@148
|
288 m_servers.erase(i);
|
Chris@148
|
289 return;
|
Chris@148
|
290 }
|
Chris@148
|
291 }
|
Chris@148
|
292 }
|
Chris@148
|
293 }
|
Chris@148
|
294
|
Chris@148
|
295 FFTDataServer::FFTDataServer(QString fileBaseName,
|
Chris@148
|
296 const DenseTimeValueModel *model,
|
Chris@148
|
297 int channel,
|
Chris@148
|
298 WindowType windowType,
|
Chris@148
|
299 size_t windowSize,
|
Chris@148
|
300 size_t windowIncrement,
|
Chris@148
|
301 size_t fftSize,
|
Chris@148
|
302 bool polar,
|
Chris@148
|
303 size_t fillFromColumn) :
|
Chris@148
|
304 m_fileBaseName(fileBaseName),
|
Chris@148
|
305 m_model(model),
|
Chris@148
|
306 m_channel(channel),
|
Chris@148
|
307 m_windower(windowType, windowSize),
|
Chris@148
|
308 m_windowSize(windowSize),
|
Chris@148
|
309 m_windowIncrement(windowIncrement),
|
Chris@148
|
310 m_fftSize(fftSize),
|
Chris@148
|
311 m_polar(polar),
|
Chris@148
|
312 m_lastUsedCache(-1),
|
Chris@148
|
313 m_fftInput(0),
|
Chris@148
|
314 m_exiting(false),
|
Chris@153
|
315 m_suspended(true), //!!! or false?
|
Chris@148
|
316 m_fillThread(0)
|
Chris@148
|
317 {
|
Chris@148
|
318 size_t start = m_model->getStartFrame();
|
Chris@148
|
319 size_t end = m_model->getEndFrame();
|
Chris@148
|
320
|
Chris@148
|
321 m_width = (end - start) / m_windowIncrement + 1;
|
Chris@148
|
322 m_height = m_fftSize / 2;
|
Chris@148
|
323
|
Chris@148
|
324 size_t maxCacheSize = 20 * 1024 * 1024;
|
Chris@148
|
325 size_t columnSize = m_height * sizeof(fftsample) * 2 + sizeof(fftsample);
|
Chris@148
|
326 if (m_width * columnSize < maxCacheSize * 2) m_cacheWidth = m_width;
|
Chris@148
|
327 else m_cacheWidth = maxCacheSize / columnSize;
|
Chris@148
|
328
|
Chris@148
|
329 int bits = 0;
|
Chris@148
|
330 while (m_cacheWidth) { m_cacheWidth >>= 1; ++bits; }
|
Chris@148
|
331 m_cacheWidth = 2;
|
Chris@148
|
332 while (bits) { m_cacheWidth <<= 1; --bits; }
|
Chris@148
|
333
|
Chris@148
|
334 #ifdef DEBUG_FFT_SERVER
|
Chris@148
|
335 std::cerr << "Width " << m_width << ", cache width " << m_cacheWidth << " (size " << m_cacheWidth * columnSize << ")" << std::endl;
|
Chris@148
|
336 #endif
|
Chris@148
|
337
|
Chris@148
|
338 for (size_t i = 0; i <= m_width / m_cacheWidth; ++i) {
|
Chris@148
|
339 m_caches.push_back(0);
|
Chris@148
|
340 }
|
Chris@148
|
341
|
Chris@148
|
342 m_fftInput = (fftsample *)
|
Chris@148
|
343 fftwf_malloc(fftSize * sizeof(fftsample));
|
Chris@148
|
344
|
Chris@148
|
345 m_fftOutput = (fftwf_complex *)
|
Chris@148
|
346 fftwf_malloc(fftSize * sizeof(fftwf_complex));
|
Chris@148
|
347
|
Chris@148
|
348 m_workbuffer = (float *)
|
Chris@148
|
349 fftwf_malloc(fftSize * sizeof(float));
|
Chris@148
|
350
|
Chris@148
|
351 m_fftPlan = fftwf_plan_dft_r2c_1d(m_fftSize,
|
Chris@148
|
352 m_fftInput,
|
Chris@148
|
353 m_fftOutput,
|
Chris@148
|
354 FFTW_ESTIMATE);
|
Chris@148
|
355
|
Chris@148
|
356 if (!m_fftPlan) {
|
Chris@148
|
357 std::cerr << "ERROR: fftwf_plan_dft_r2c_1d(" << m_windowSize << ") failed!" << std::endl;
|
Chris@148
|
358 throw(0);
|
Chris@148
|
359 }
|
Chris@148
|
360
|
Chris@148
|
361 m_fillThread = new FillThread(*this, fillFromColumn);
|
Chris@148
|
362
|
Chris@148
|
363 //!!! respond appropriately when thread exits (deleteProcessingData etc)
|
Chris@148
|
364 }
|
Chris@148
|
365
|
Chris@148
|
366 FFTDataServer::~FFTDataServer()
|
Chris@148
|
367 {
|
Chris@148
|
368 #ifdef DEBUG_FFT_SERVER
|
Chris@148
|
369 std::cerr << "FFTDataServer(" << this << ")::~FFTDataServer()" << std::endl;
|
Chris@148
|
370 #endif
|
Chris@148
|
371
|
Chris@155
|
372 m_suspended = false;
|
Chris@148
|
373 m_exiting = true;
|
Chris@148
|
374 m_condition.wakeAll();
|
Chris@148
|
375 if (m_fillThread) {
|
Chris@148
|
376 m_fillThread->wait();
|
Chris@148
|
377 delete m_fillThread;
|
Chris@148
|
378 }
|
Chris@148
|
379
|
Chris@148
|
380 QMutexLocker locker(&m_writeMutex);
|
Chris@148
|
381
|
Chris@148
|
382 for (CacheVector::iterator i = m_caches.begin(); i != m_caches.end(); ++i) {
|
Chris@148
|
383 delete *i;
|
Chris@148
|
384 }
|
Chris@148
|
385
|
Chris@148
|
386 deleteProcessingData();
|
Chris@148
|
387 }
|
Chris@148
|
388
|
Chris@148
|
389 void
|
Chris@148
|
390 FFTDataServer::deleteProcessingData()
|
Chris@148
|
391 {
|
Chris@148
|
392 if (m_fftInput) {
|
Chris@148
|
393 fftwf_destroy_plan(m_fftPlan);
|
Chris@148
|
394 fftwf_free(m_fftInput);
|
Chris@148
|
395 fftwf_free(m_fftOutput);
|
Chris@148
|
396 fftwf_free(m_workbuffer);
|
Chris@148
|
397 }
|
Chris@148
|
398 m_fftInput = 0;
|
Chris@148
|
399 }
|
Chris@148
|
400
|
Chris@148
|
401 void
|
Chris@148
|
402 FFTDataServer::suspend()
|
Chris@148
|
403 {
|
Chris@148
|
404 #ifdef DEBUG_FFT_SERVER
|
Chris@148
|
405 std::cerr << "FFTDataServer(" << this << "): suspend" << std::endl;
|
Chris@148
|
406 #endif
|
Chris@148
|
407 QMutexLocker locker(&m_writeMutex);
|
Chris@148
|
408 m_suspended = true;
|
Chris@148
|
409 for (CacheVector::iterator i = m_caches.begin(); i != m_caches.end(); ++i) {
|
Chris@148
|
410 if (*i) (*i)->suspend();
|
Chris@148
|
411 }
|
Chris@148
|
412 }
|
Chris@148
|
413
|
Chris@148
|
414 void
|
Chris@155
|
415 FFTDataServer::suspendWrites()
|
Chris@155
|
416 {
|
Chris@155
|
417 #ifdef DEBUG_FFT_SERVER
|
Chris@155
|
418 std::cerr << "FFTDataServer(" << this << "): suspendWrites" << std::endl;
|
Chris@155
|
419 #endif
|
Chris@155
|
420 m_suspended = true;
|
Chris@155
|
421 }
|
Chris@155
|
422
|
Chris@155
|
423 void
|
Chris@148
|
424 FFTDataServer::resume()
|
Chris@148
|
425 {
|
Chris@154
|
426 #ifdef DEBUG_FFT_SERVER
|
Chris@154
|
427 std::cerr << "FFTDataServer(" << this << "): resume" << std::endl;
|
Chris@154
|
428 #endif
|
Chris@148
|
429 m_suspended = false;
|
Chris@148
|
430 m_condition.wakeAll();
|
Chris@148
|
431 }
|
Chris@148
|
432
|
Chris@148
|
433 FFTCache *
|
Chris@148
|
434 FFTDataServer::getCacheAux(size_t c)
|
Chris@148
|
435 {
|
Chris@148
|
436 QMutexLocker locker(&m_writeMutex);
|
Chris@148
|
437
|
Chris@148
|
438 if (m_lastUsedCache == -1) {
|
Chris@148
|
439 m_fillThread->start();
|
Chris@148
|
440 }
|
Chris@148
|
441
|
Chris@148
|
442 if (int(c) != m_lastUsedCache) {
|
Chris@148
|
443
|
Chris@148
|
444 // std::cerr << "switch from " << m_lastUsedCache << " to " << c << std::endl;
|
Chris@148
|
445
|
Chris@148
|
446 for (IntQueue::iterator i = m_dormantCaches.begin();
|
Chris@148
|
447 i != m_dormantCaches.end(); ++i) {
|
Chris@148
|
448 if (*i == c) {
|
Chris@148
|
449 m_dormantCaches.erase(i);
|
Chris@148
|
450 break;
|
Chris@148
|
451 }
|
Chris@148
|
452 }
|
Chris@148
|
453
|
Chris@148
|
454 if (m_lastUsedCache >= 0) {
|
Chris@148
|
455 bool inDormant = false;
|
Chris@148
|
456 for (size_t i = 0; i < m_dormantCaches.size(); ++i) {
|
Chris@148
|
457 if (m_dormantCaches[i] == m_lastUsedCache) {
|
Chris@148
|
458 inDormant = true;
|
Chris@148
|
459 break;
|
Chris@148
|
460 }
|
Chris@148
|
461 }
|
Chris@148
|
462 if (!inDormant) {
|
Chris@148
|
463 m_dormantCaches.push_back(m_lastUsedCache);
|
Chris@148
|
464 }
|
Chris@148
|
465 while (m_dormantCaches.size() > 4) {
|
Chris@148
|
466 int dc = m_dormantCaches.front();
|
Chris@148
|
467 m_dormantCaches.pop_front();
|
Chris@148
|
468 m_caches[dc]->suspend();
|
Chris@148
|
469 }
|
Chris@148
|
470 }
|
Chris@148
|
471 }
|
Chris@148
|
472
|
Chris@148
|
473 if (m_caches[c]) {
|
Chris@148
|
474 m_lastUsedCache = c;
|
Chris@148
|
475 return m_caches[c];
|
Chris@148
|
476 }
|
Chris@148
|
477
|
Chris@148
|
478 QString name = QString("%1-%2").arg(m_fileBaseName).arg(c);
|
Chris@148
|
479
|
Chris@148
|
480 FFTCache *cache = new FFTFileCache(name, MatrixFile::ReadWrite,
|
Chris@148
|
481 m_polar ? FFTFileCache::Polar :
|
Chris@148
|
482 FFTFileCache::Rectangular);
|
Chris@148
|
483
|
Chris@148
|
484 size_t width = m_cacheWidth;
|
Chris@148
|
485 if (c * m_cacheWidth + width > m_width) {
|
Chris@148
|
486 width = m_width - c * m_cacheWidth;
|
Chris@148
|
487 }
|
Chris@148
|
488
|
Chris@148
|
489 cache->resize(width, m_height);
|
Chris@148
|
490 cache->reset();
|
Chris@148
|
491
|
Chris@148
|
492 m_caches[c] = cache;
|
Chris@148
|
493 m_lastUsedCache = c;
|
Chris@148
|
494
|
Chris@148
|
495 return cache;
|
Chris@148
|
496 }
|
Chris@148
|
497
|
Chris@148
|
498 float
|
Chris@148
|
499 FFTDataServer::getMagnitudeAt(size_t x, size_t y)
|
Chris@148
|
500 {
|
Chris@148
|
501 size_t col;
|
Chris@148
|
502 FFTCache *cache = getCache(x, col);
|
Chris@148
|
503
|
Chris@148
|
504 if (!cache->haveSetColumnAt(col)) {
|
Chris@148
|
505 fillColumn(x);
|
Chris@148
|
506 }
|
Chris@148
|
507 return cache->getMagnitudeAt(col, y);
|
Chris@148
|
508 }
|
Chris@148
|
509
|
Chris@148
|
510 float
|
Chris@148
|
511 FFTDataServer::getNormalizedMagnitudeAt(size_t x, size_t y)
|
Chris@148
|
512 {
|
Chris@148
|
513 size_t col;
|
Chris@148
|
514 FFTCache *cache = getCache(x, col);
|
Chris@148
|
515
|
Chris@148
|
516 if (!cache->haveSetColumnAt(col)) {
|
Chris@148
|
517 fillColumn(x);
|
Chris@148
|
518 }
|
Chris@148
|
519 return cache->getNormalizedMagnitudeAt(col, y);
|
Chris@148
|
520 }
|
Chris@148
|
521
|
Chris@148
|
522 float
|
Chris@148
|
523 FFTDataServer::getMaximumMagnitudeAt(size_t x)
|
Chris@148
|
524 {
|
Chris@148
|
525 size_t col;
|
Chris@148
|
526 FFTCache *cache = getCache(x, col);
|
Chris@148
|
527
|
Chris@148
|
528 if (!cache->haveSetColumnAt(col)) {
|
Chris@148
|
529 fillColumn(x);
|
Chris@148
|
530 }
|
Chris@148
|
531 return cache->getMaximumMagnitudeAt(col);
|
Chris@148
|
532 }
|
Chris@148
|
533
|
Chris@148
|
534 float
|
Chris@148
|
535 FFTDataServer::getPhaseAt(size_t x, size_t y)
|
Chris@148
|
536 {
|
Chris@148
|
537 size_t col;
|
Chris@148
|
538 FFTCache *cache = getCache(x, col);
|
Chris@148
|
539
|
Chris@148
|
540 if (!cache->haveSetColumnAt(col)) {
|
Chris@148
|
541 fillColumn(x);
|
Chris@148
|
542 }
|
Chris@148
|
543 return cache->getPhaseAt(col, y);
|
Chris@148
|
544 }
|
Chris@148
|
545
|
Chris@148
|
546 void
|
Chris@148
|
547 FFTDataServer::getValuesAt(size_t x, size_t y, float &real, float &imaginary)
|
Chris@148
|
548 {
|
Chris@148
|
549 size_t col;
|
Chris@148
|
550 FFTCache *cache = getCache(x, col);
|
Chris@148
|
551
|
Chris@148
|
552 if (!cache->haveSetColumnAt(col)) {
|
Chris@148
|
553 #ifdef DEBUG_FFT_SERVER
|
Chris@148
|
554 std::cerr << "FFTDataServer::getValuesAt(" << x << ", " << y << "): filling" << std::endl;
|
Chris@148
|
555 #endif
|
Chris@148
|
556 fillColumn(x);
|
Chris@148
|
557 }
|
Chris@148
|
558 float magnitude = cache->getMagnitudeAt(col, y);
|
Chris@148
|
559 float phase = cache->getPhaseAt(col, y);
|
Chris@148
|
560 real = magnitude * cosf(phase);
|
Chris@148
|
561 imaginary = magnitude * sinf(phase);
|
Chris@148
|
562 }
|
Chris@148
|
563
|
Chris@148
|
564 bool
|
Chris@148
|
565 FFTDataServer::isColumnReady(size_t x)
|
Chris@148
|
566 {
|
Chris@148
|
567 if (!haveCache(x)) {
|
Chris@148
|
568 if (m_lastUsedCache == -1) {
|
Chris@154
|
569 if (m_suspended) resume();
|
Chris@148
|
570 m_fillThread->start();
|
Chris@148
|
571 }
|
Chris@148
|
572 return false;
|
Chris@148
|
573 }
|
Chris@148
|
574
|
Chris@148
|
575 size_t col;
|
Chris@148
|
576 FFTCache *cache = getCache(x, col);
|
Chris@148
|
577
|
Chris@148
|
578 return cache->haveSetColumnAt(col);
|
Chris@148
|
579 }
|
Chris@148
|
580
|
Chris@148
|
581 void
|
Chris@148
|
582 FFTDataServer::fillColumn(size_t x)
|
Chris@148
|
583 {
|
Chris@148
|
584 size_t col;
|
Chris@148
|
585 #ifdef DEBUG_FFT_SERVER_FILL
|
Chris@148
|
586 std::cout << "FFTDataServer::fillColumn(" << x << ")" << std::endl;
|
Chris@148
|
587 #endif
|
Chris@148
|
588 FFTCache *cache = getCache(x, col);
|
Chris@148
|
589
|
Chris@148
|
590 QMutexLocker locker(&m_writeMutex);
|
Chris@148
|
591
|
Chris@148
|
592 if (cache->haveSetColumnAt(col)) return;
|
Chris@148
|
593
|
Chris@148
|
594 int startFrame = m_windowIncrement * x;
|
Chris@148
|
595 int endFrame = startFrame + m_windowSize;
|
Chris@148
|
596
|
Chris@148
|
597 startFrame -= int(m_windowSize - m_windowIncrement) / 2;
|
Chris@148
|
598 endFrame -= int(m_windowSize - m_windowIncrement) / 2;
|
Chris@148
|
599 size_t pfx = 0;
|
Chris@148
|
600
|
Chris@148
|
601 size_t off = (m_fftSize - m_windowSize) / 2;
|
Chris@148
|
602
|
Chris@148
|
603 for (size_t i = 0; i < off; ++i) {
|
Chris@148
|
604 m_fftInput[i] = 0.0;
|
Chris@148
|
605 m_fftInput[m_fftSize - i - 1] = 0.0;
|
Chris@148
|
606 }
|
Chris@148
|
607
|
Chris@148
|
608 if (startFrame < 0) {
|
Chris@148
|
609 pfx = size_t(-startFrame);
|
Chris@148
|
610 for (size_t i = 0; i < pfx; ++i) {
|
Chris@148
|
611 m_fftInput[off + i] = 0.0;
|
Chris@148
|
612 }
|
Chris@148
|
613 }
|
Chris@148
|
614
|
Chris@148
|
615 size_t got = m_model->getValues(m_channel, startFrame + pfx,
|
Chris@148
|
616 endFrame, m_fftInput + off + pfx);
|
Chris@148
|
617
|
Chris@148
|
618 while (got + pfx < m_windowSize) {
|
Chris@148
|
619 m_fftInput[off + got + pfx] = 0.0;
|
Chris@148
|
620 ++got;
|
Chris@148
|
621 }
|
Chris@148
|
622
|
Chris@148
|
623 if (m_channel == -1) {
|
Chris@148
|
624 int channels = m_model->getChannelCount();
|
Chris@148
|
625 if (channels > 1) {
|
Chris@148
|
626 for (size_t i = 0; i < m_windowSize; ++i) {
|
Chris@148
|
627 m_fftInput[off + i] /= channels;
|
Chris@148
|
628 }
|
Chris@148
|
629 }
|
Chris@148
|
630 }
|
Chris@148
|
631
|
Chris@148
|
632 m_windower.cut(m_fftInput + off);
|
Chris@148
|
633
|
Chris@148
|
634 for (size_t i = 0; i < m_fftSize/2; ++i) {
|
Chris@148
|
635 fftsample temp = m_fftInput[i];
|
Chris@148
|
636 m_fftInput[i] = m_fftInput[i + m_fftSize/2];
|
Chris@148
|
637 m_fftInput[i + m_fftSize/2] = temp;
|
Chris@148
|
638 }
|
Chris@148
|
639
|
Chris@148
|
640 fftwf_execute(m_fftPlan);
|
Chris@148
|
641
|
Chris@148
|
642 fftsample factor = 0.0;
|
Chris@148
|
643
|
Chris@148
|
644 for (size_t i = 0; i < m_fftSize/2; ++i) {
|
Chris@148
|
645
|
Chris@148
|
646 fftsample mag = sqrtf(m_fftOutput[i][0] * m_fftOutput[i][0] +
|
Chris@148
|
647 m_fftOutput[i][1] * m_fftOutput[i][1]);
|
Chris@148
|
648 mag /= m_windowSize / 2;
|
Chris@148
|
649
|
Chris@148
|
650 if (mag > factor) factor = mag;
|
Chris@148
|
651
|
Chris@148
|
652 fftsample phase = atan2f(m_fftOutput[i][1], m_fftOutput[i][0]);
|
Chris@148
|
653 phase = princargf(phase);
|
Chris@148
|
654
|
Chris@148
|
655 m_workbuffer[i] = mag;
|
Chris@148
|
656 m_workbuffer[i + m_fftSize/2] = phase;
|
Chris@148
|
657 }
|
Chris@148
|
658
|
Chris@148
|
659 cache->setColumnAt(col,
|
Chris@148
|
660 m_workbuffer,
|
Chris@148
|
661 m_workbuffer + m_fftSize/2,
|
Chris@148
|
662 factor);
|
Chris@154
|
663
|
Chris@154
|
664 if (m_suspended) resume();
|
Chris@148
|
665 }
|
Chris@148
|
666
|
Chris@148
|
667 size_t
|
Chris@148
|
668 FFTDataServer::getFillCompletion() const
|
Chris@148
|
669 {
|
Chris@148
|
670 if (m_fillThread) return m_fillThread->getCompletion();
|
Chris@148
|
671 else return 100;
|
Chris@148
|
672 }
|
Chris@148
|
673
|
Chris@148
|
674 size_t
|
Chris@148
|
675 FFTDataServer::getFillExtent() const
|
Chris@148
|
676 {
|
Chris@148
|
677 if (m_fillThread) return m_fillThread->getExtent();
|
Chris@148
|
678 else return m_model->getEndFrame();
|
Chris@148
|
679 }
|
Chris@148
|
680
|
Chris@148
|
681 QString
|
Chris@148
|
682 FFTDataServer::generateFileBasename() const
|
Chris@148
|
683 {
|
Chris@148
|
684 return generateFileBasename(m_model, m_channel, m_windower.getType(),
|
Chris@148
|
685 m_windowSize, m_windowIncrement, m_fftSize,
|
Chris@148
|
686 m_polar);
|
Chris@148
|
687 }
|
Chris@148
|
688
|
Chris@148
|
689 QString
|
Chris@148
|
690 FFTDataServer::generateFileBasename(const DenseTimeValueModel *model,
|
Chris@148
|
691 int channel,
|
Chris@148
|
692 WindowType windowType,
|
Chris@148
|
693 size_t windowSize,
|
Chris@148
|
694 size_t windowIncrement,
|
Chris@148
|
695 size_t fftSize,
|
Chris@148
|
696 bool polar)
|
Chris@148
|
697 {
|
Chris@148
|
698 char buffer[200];
|
Chris@148
|
699
|
Chris@148
|
700 sprintf(buffer, "%u-%u-%u-%u-%u-%u%s",
|
Chris@148
|
701 (unsigned int)XmlExportable::getObjectExportId(model),
|
Chris@148
|
702 (unsigned int)(channel + 1),
|
Chris@148
|
703 (unsigned int)windowType,
|
Chris@148
|
704 (unsigned int)windowSize,
|
Chris@148
|
705 (unsigned int)windowIncrement,
|
Chris@148
|
706 (unsigned int)fftSize,
|
Chris@148
|
707 polar ? "-p" : "-r");
|
Chris@148
|
708
|
Chris@148
|
709 return buffer;
|
Chris@148
|
710 }
|
Chris@148
|
711
|
Chris@148
|
712 void
|
Chris@148
|
713 FFTDataServer::FillThread::run()
|
Chris@148
|
714 {
|
Chris@148
|
715 m_extent = 0;
|
Chris@148
|
716 m_completion = 0;
|
Chris@148
|
717
|
Chris@148
|
718 size_t start = m_server.m_model->getStartFrame();
|
Chris@148
|
719 size_t end = m_server.m_model->getEndFrame();
|
Chris@148
|
720 size_t remainingEnd = end;
|
Chris@148
|
721
|
Chris@148
|
722 int counter = 0;
|
Chris@148
|
723 int updateAt = (end / m_server.m_windowIncrement) / 20;
|
Chris@148
|
724 if (updateAt < 100) updateAt = 100;
|
Chris@148
|
725
|
Chris@148
|
726 if (m_fillFrom > start) {
|
Chris@148
|
727
|
Chris@148
|
728 for (size_t f = m_fillFrom; f < end; f += m_server.m_windowIncrement) {
|
Chris@148
|
729
|
Chris@148
|
730 m_server.fillColumn(int((f - start) / m_server.m_windowIncrement));
|
Chris@148
|
731
|
Chris@148
|
732 if (m_server.m_exiting) return;
|
Chris@148
|
733
|
Chris@148
|
734 while (m_server.m_suspended) {
|
Chris@148
|
735 #ifdef DEBUG_FFT_SERVER
|
Chris@148
|
736 std::cerr << "FFTDataServer(" << this << "): suspended, waiting..." << std::endl;
|
Chris@148
|
737 #endif
|
Chris@148
|
738 m_server.m_writeMutex.lock();
|
Chris@148
|
739 m_server.m_condition.wait(&m_server.m_writeMutex, 10000);
|
Chris@148
|
740 m_server.m_writeMutex.unlock();
|
Chris@148
|
741 if (m_server.m_exiting) return;
|
Chris@148
|
742 }
|
Chris@148
|
743
|
Chris@148
|
744 if (++counter == updateAt) {
|
Chris@148
|
745 m_extent = f;
|
Chris@148
|
746 m_completion = size_t(100 * fabsf(float(f - m_fillFrom) /
|
Chris@148
|
747 float(end - start)));
|
Chris@148
|
748 counter = 0;
|
Chris@148
|
749 }
|
Chris@148
|
750 }
|
Chris@148
|
751
|
Chris@148
|
752 remainingEnd = m_fillFrom;
|
Chris@148
|
753 if (remainingEnd > start) --remainingEnd;
|
Chris@148
|
754 else remainingEnd = start;
|
Chris@148
|
755 }
|
Chris@148
|
756
|
Chris@148
|
757 size_t baseCompletion = m_completion;
|
Chris@148
|
758
|
Chris@148
|
759 for (size_t f = start; f < remainingEnd; f += m_server.m_windowIncrement) {
|
Chris@148
|
760
|
Chris@148
|
761 m_server.fillColumn(int((f - start) / m_server.m_windowIncrement));
|
Chris@148
|
762
|
Chris@148
|
763 if (m_server.m_exiting) return;
|
Chris@148
|
764
|
Chris@148
|
765 while (m_server.m_suspended) {
|
Chris@148
|
766 #ifdef DEBUG_FFT_SERVER
|
Chris@148
|
767 std::cerr << "FFTDataServer(" << this << "): suspended, waiting..." << std::endl;
|
Chris@148
|
768 #endif
|
Chris@148
|
769 m_server.m_writeMutex.lock();
|
Chris@148
|
770 m_server.m_condition.wait(&m_server.m_writeMutex, 10000);
|
Chris@148
|
771 m_server.m_writeMutex.unlock();
|
Chris@148
|
772 if (m_server.m_exiting) return;
|
Chris@148
|
773 }
|
Chris@148
|
774
|
Chris@148
|
775 if (++counter == updateAt) {
|
Chris@148
|
776 m_extent = f;
|
Chris@148
|
777 m_completion = baseCompletion +
|
Chris@148
|
778 size_t(100 * fabsf(float(f - start) /
|
Chris@148
|
779 float(end - start)));
|
Chris@148
|
780 counter = 0;
|
Chris@148
|
781 }
|
Chris@148
|
782 }
|
Chris@148
|
783
|
Chris@148
|
784 m_completion = 100;
|
Chris@148
|
785 m_extent = end;
|
Chris@148
|
786 }
|
Chris@148
|
787
|