summaryrefslogtreecommitdiff
path: root/src/cachemanager.cc
blob: b2e10ac7f2dc18098feba92403f94a20d192366a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/***************************************************************************
 *            cachemanager.cc
 *
 *  Fri Apr 10 10:39:24 CEST 2015
 *  Copyright 2015 Jonas Suhr Christensen
 *  jsc@umbraculum.org
 ****************************************************************************/

/*
 *  This file is part of DrumGizmo.
 *
 *  DrumGizmo 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.
 *
 *  DrumGizmo 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 DrumGizmo; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA.
 */
#include "cachemanager.h"

#include <string.h>
#include <stdio.h>
#include <assert.h>

#include <hugin.hpp>

#include "cacheaudiofile.h"

#define CHUNKSIZE(x) (x * CHUNK_MULTIPLIER)


CacheManager::CacheManager()
	: framesize(0)
	, nodata(nullptr)
{
}

CacheManager::~CacheManager()
{
	deinit();
	delete[] nodata;
}

void CacheManager::init(size_t poolsize, bool threaded)
{
	this->threaded = threaded;

	id2cache.resize(poolsize);
	for(size_t i = 0; i < poolsize; ++i)
	{
		availableids.push_back(i);
	}

	running = true;
	if(threaded)
	{
		run();
		sem_run.wait();
	}
}

void CacheManager::deinit()
{
	if(!running) return;
	running = false;
	if(threaded)
	{
		sem.post();
		wait_stop();
	}
}

// Invariant: initial_samples_needed < preloaded audio data
sample_t *CacheManager::open(AudioFile *file, size_t initial_samples_needed,
                             int channel, cacheid_t &id)
{
	if(!file->isValid())
	{
		// File preload not yet ready - skip this sample.
		id = CACHE_DUMMYID;
		assert(nodata);
		return nodata;
	}

	{
		MutexAutolock l(m_ids);
		if(availableids.empty())
		{
			id = CACHE_DUMMYID;
		}
		else
		{
			id = availableids.front();
			availableids.pop_front();
		}
	}

	if(id == CACHE_DUMMYID)
	{
		assert(nodata);
		return nodata;
	}

	CacheAudioFile& afile = files.getAudioFile(file->filename);

	cache_t c;
	c.afile = &afile;
	c.channel = channel;

	// next call to 'next' will read from this point.
	c.localpos = initial_samples_needed;

	c.front = nullptr; // This is allocated when needed.
	c.back = nullptr; // This is allocated when needed.

	// cropped_size is the preload chunk size cropped to sample length.
	size_t cropped_size = file->preloadedsize - c.localpos;
	cropped_size /= framesize;
	cropped_size *= framesize;
	cropped_size += initial_samples_needed;

	if(file->preloadedsize == file->size)
	{
		// We have preloaded the entire file, so use it.
		cropped_size = file->preloadedsize;
	}

	c.preloaded_samples = file->data;
	c.preloaded_samples_size = cropped_size;

	// next read from disk will read from this point.
	c.pos = cropped_size;//c.preloaded_samples_size;

	{
		MutexAutolock l(m_ids);
		id2cache[id] = c;
	}
	// NOTE: Below this point we can no longer write to 'c'.

	// Only load next buffer if there are more data in the file to be loaded...
	if(c.pos < file->size)
	{
		cache_t& c = id2cache[id]; // Create new writeable 'c'.

		if(c.back == nullptr)
		{
			c.back = new sample_t[CHUNKSIZE(framesize)];
		}

		cevent_t e =
			createLoadNextEvent(c.afile, c.channel, c.pos, c.back, &c.ready);
		pushEvent(e);
	}

	return c.preloaded_samples; // return preloaded data
}

sample_t *CacheManager::next(cacheid_t id, size_t &size)
{
	size = framesize;

	if(id == CACHE_DUMMYID)
	{
		assert(nodata);
		return nodata;
	}

	cache_t& c = id2cache[id];

	if(c.preloaded_samples)
	{

		// We are playing from memory:
		if(c.localpos < c.preloaded_samples_size)
		{
			sample_t *s = c.preloaded_samples + c.localpos;
			c.localpos += framesize;
			return s;
		}

		c.preloaded_samples = nullptr; // Start using samples from disk.

	}
	else
	{

		// We are playing from cache:
		if(c.localpos < CHUNKSIZE(framesize))
		{
			sample_t *s = c.front + c.localpos;
			c.localpos += framesize;
			return s;
		}
	}

	if(!c.ready)
	{
		//printf("#%d: NOT READY!\n", id); // TODO: Count and show in UI?
		return nodata;
	}

	// Swap buffers
	std::swap(c.front, c.back);

	// Next time we go here we have already read the first frame.
	c.localpos = framesize;

	c.pos += CHUNKSIZE(framesize);

	if(c.pos < c.afile->getSize())
	{
		if(c.back == nullptr)
		{
			c.back = new sample_t[CHUNKSIZE(framesize)];
		}

		cevent_t e = createLoadNextEvent(c.afile, c.channel, c.pos, c.back, &c.ready);
		pushEvent(e);
	}

	if(!c.front)
	{
		printf("We shouldn't get here... ever!\n");
		assert(false);
		return nodata;
	}

	return c.front;
}

void CacheManager::close(cacheid_t id)
{
	if(id == CACHE_DUMMYID)
	{
		return;
	}

	cevent_t e = createCloseEvent(id);
	pushEvent(e);
}

void CacheManager::setFrameSize(size_t framesize)
{
	if(framesize > this->framesize)
	{
		delete[] nodata;
		nodata = new sample_t[framesize];

		for(size_t i = 0; i < framesize; ++i)
		{
			nodata[i] = 0;
		}
	}

	this->framesize = framesize;
}

void CacheManager::setAsyncMode(bool async)
{
	// TODO: Clean out read queue.
	// TODO: Block until reader thread is idle, otherwise we might screw up the
	// buffers...?
	threaded = async;
}

void CacheManager::handleLoadNextEvent(cevent_t &event)
{
	event.afile->readChunk(event.channels, event.pos, CHUNKSIZE(framesize));
}

void CacheManager::handleCloseEvent(cevent_t &e)
{
	handleCloseCache(e.id);
}

void CacheManager::handleCloseCache(cacheid_t& cacheid)
{
	cache_t& cache = id2cache[cacheid];
	{
		MutexAutolock l(m_events);

		files.release(cache.afile->getFilename());
	}

	delete[] cache.front;
	delete[] cache.back;

	{
		MutexAutolock l(m_ids);
		availableids.push_back(cacheid);
	}
}

void CacheManager::handleEvent(cevent_t &e)
{
	switch(e.cmd)
	{
	case LOADNEXT:
		handleLoadNextEvent(e);
		break;
	case CLOSE:
		handleCloseEvent(e);
		break;
	}
}

void CacheManager::thread_main()
{
	sem_run.post(); // Signal that the thread has been started

	while(running)
	{
		sem.wait();

		m_events.lock();
		if(eventqueue.empty())
		{
			m_events.unlock();
			continue;
		}

		cevent_t e = eventqueue.front();
		eventqueue.pop_front();
		m_events.unlock();

		// TODO: Skip event if e.pos < cache.pos
		// if(!e.active) continue;

		handleEvent(e);
	}
}

void CacheManager::pushEvent(cevent_t& e)
{
	if(!threaded)
	{
		handleEvent(e);
		return;
	}

	{
		MutexAutolock l(m_events);

		bool found = false;

		if(e.cmd == LOADNEXT)
		{
			for(auto it = eventqueue.begin(); it != eventqueue.end(); ++it)
			{
				auto& event = *it;
				if((event.cmd == LOADNEXT) &&
				   (e.afile->getFilename() == event.afile->getFilename()) &&
				   (e.pos == event.pos))
				{
					// Append channel and buffer to the existing event.
					event.channels.insert(event.channels.end(), e.channels.begin(),
					                      e.channels.end());
					found = true;
					break;
				}
			}
		}

		if(!found)
		{
			// The event was not already on the list, create a new one.
			eventqueue.push_back(e);
		}
	}

	sem.post();
}

CacheManager::cevent_t
CacheManager::createLoadNextEvent(CacheAudioFile *afile, size_t channel,
                                  size_t pos, sample_t* buffer,
                                  volatile bool* ready)
{
	cevent_t e;
	e.cmd = LOADNEXT;
	e.pos = pos;
	e.afile = afile;

	CacheChannel c;
	c.channel = channel;
	c.samples = buffer;

	*ready = false;
	c.ready = ready;

	e.channels.insert(e.channels.end(), c);

	return e;
}

CacheManager::cevent_t
CacheManager::createCloseEvent(cacheid_t id)
{
	cevent_t e;
	e.cmd = CLOSE;
	e.id = id;
	return e;
}