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
|
/* -*- 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 <stdio.h>
#define CHUNKSIZE 256
CacheManager::CacheManager()
{
}
CacheManager::~CacheManager()
{
deinit();
}
void CacheManager::init(int poolsize)
{
id2cache.resize(poolsize);
for(int i = 0; i < poolsize; i++) {
availableids.push_back(i);
}
running = true;
run();
}
void CacheManager::deinit()
{
if(!running) return;
running = false;
wait_stop();
}
// Invariant: initial_samples_needed < preloaded audio data
sample_t *CacheManager::open(AudioFile *file, int initial_samples_needed, int channel, cacheid_t &id)
{
// What if no free ids is available?
m_ids.lock();
id = availableids.front();
availableids.pop_front();
m_ids.unlock();
if(initial_samples_needed < file->size) {
cache_t c;
c.file = file;
c.channel = channel;
c.pos = initial_samples_needed;
// Allocate buffers
// Increase audio ref count
id2cache[id] = c;
event_t e = createEvent(id, LOADNEXT);
pushEvent(e);
}
return file->data;
}
void CacheManager::close(cacheid_t id)
{
{
event_t e = createEvent(id, CLEAN);
MutexAutolock l(m_events);
eventqueue.push_front(e);
}
{
MutexAutolock l(m_ids);
availableids.push_back(id);
}
// Clean cache_t mapped to event
// Decrement audiofile ref count
}
sample_t *CacheManager::next(cacheid_t id, size_t &size)
{
size = CHUNKSIZE;
m_caches.lock();
cache_t c = id2cache[id];
c.pos += size;
id2cache[id] = c;
m_caches.unlock();
// If more is left of file
if(c.pos < c.file->size) {
event_t e = createEvent(id, LOADNEXT);
pushEvent(e);
}
sample_t *s = c.file->data + c.pos;
return s;
}
void CacheManager::loadNext(cacheid_t id)
{
MutexAutolock l(m_caches);
cache_t c = id2cache[id];
c.pos += CHUNKSIZE;
id2cache[id] = c;
}
void CacheManager::thread_main()
{
while(running) {
sem.wait();
m_events.lock();
if(eventqueue.empty()) {
event_t e = eventqueue.front();
eventqueue.pop_front();
m_events.unlock();
if(!e.active) continue;
switch(e.cmd) {
case LOADNEXT:
loadNext(e.id);
break;
case CLEAN:
break;
}
}
else {
m_events.unlock();
}
}
}
void CacheManager::pushEvent(event_t e)
{
// Check that if event should be merged (Maybe by event queue (ie. push in front).
MutexAutolock l(m_events);
eventqueue.push_back(e);
}
CacheManager::event_t CacheManager::createEvent(cacheid_t id, cmd_t cmd)
{
event_t e;
e.active = true;
e.id = id;
e.cmd = cmd;
return e;
}
|
