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
|
/*
Rosegarden
A sequencer and musical notation editor.
This program is Copyright 2000-2008
Guillaume Laurent <[email protected]>,
Chris Cannam <[email protected]>,
Richard Bown <[email protected]>
The moral right of the authors to claim authorship of this work
has been asserted.
This program 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. See the file
COPYING included with this distribution for more information.
*/
#include "AudioCache.h"
#include <iostream>
//#define DEBUG_AUDIO_CACHE 1
namespace Rosegarden
{
AudioCache::~AudioCache()
{
clear();
}
bool
AudioCache::has(void *index)
{
return m_cache.find(index) != m_cache.end();
}
float **
AudioCache::getData(void *index, size_t &channels, size_t &frames)
{
if (m_cache.find(index) == m_cache.end())
return 0;
CacheRec *rec = m_cache[index];
channels = rec->channels;
frames = rec->nframes;
return rec->data;
}
void
AudioCache::addData(void *index, size_t channels, size_t nframes, float **data)
{
#ifdef DEBUG_AUDIO_CACHE
std::cerr << "AudioCache::addData(" << index << ")" << std::endl;
#endif
if (m_cache.find(index) != m_cache.end()) {
std::cerr << "WARNING: AudioCache::addData(" << index << ", "
<< channels << ", " << nframes
<< ": already cached" << std::endl;
return ;
}
m_cache[index] = new CacheRec(data, channels, nframes);
}
void
AudioCache::incrementReference(void *index)
{
if (m_cache.find(index) == m_cache.end()) {
std::cerr << "WARNING: AudioCache::incrementReference(" << index
<< "): not found" << std::endl;
return ;
}
++m_cache[index]->refCount;
#ifdef DEBUG_AUDIO_CACHE
std::cerr << "AudioCache::incrementReference(" << index << ") [to " << (m_cache[index]->refCount) << "]" << std::endl;
#endif
}
void
AudioCache::decrementReference(void *index)
{
std::map<void *, CacheRec *>::iterator i = m_cache.find(index);
if (i == m_cache.end()) {
std::cerr << "WARNING: AudioCache::decrementReference(" << index
<< "): not found" << std::endl;
return ;
}
if (i->second->refCount <= 1) {
delete i->second;
m_cache.erase(i);
#ifdef DEBUG_AUDIO_CACHE
std::cerr << "AudioCache::decrementReference(" << index << ") [deleting]" << std::endl;
#endif
} else {
--i->second->refCount;
#ifdef DEBUG_AUDIO_CACHE
std::cerr << "AudioCache::decrementReference(" << index << ") [to " << (m_cache[index]->refCount) << "]" << std::endl;
#endif
}
}
void
AudioCache::clear()
{
#ifdef DEBUG_AUDIO_CACHE
std::cerr << "AudioCache::clear()" << std::endl;
#endif
for (std::map<void *, CacheRec *>::iterator i = m_cache.begin();
i != m_cache.end(); ++i) {
if (i->second->refCount > 0) {
std::cerr << "WARNING: AudioCache::clear: deleting cached data with refCount " << i->second->refCount << std::endl;
}
}
m_cache.clear();
}
AudioCache::CacheRec::~CacheRec()
{
for (size_t j = 0; j < channels; ++j)
delete[] data[j];
delete[] data;
}
}
|