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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "bladerunner/audio_cache.h"
#include "common/stream.h"
namespace BladeRunner {
AudioCache::AudioCache() :
_totalSize(0),
_maxSize(2457600),
_accessCounter(0) {}
AudioCache::~AudioCache() {
for (uint i = 0; i != _cacheItems.size(); ++i) {
free(_cacheItems[i].data);
}
}
bool AudioCache::canAllocate(uint32 size) const {
Common::StackLock lock(_mutex);
return _maxSize - _totalSize >= size;
}
bool AudioCache::dropOldest() {
Common::StackLock lock(_mutex);
if (_cacheItems.size() == 0)
return false;
int oldest = -1;
for (uint i = 1; i != _cacheItems.size(); ++i) {
if (_cacheItems[i].refs == 0) {
if (oldest == -1 || _cacheItems[i].lastAccess < _cacheItems[oldest].lastAccess) {
oldest = i;
}
}
}
if (oldest == -1) {
return false;
}
memset(_cacheItems[oldest].data, 0x00, _cacheItems[oldest].size);
free(_cacheItems[oldest].data);
_totalSize -= _cacheItems[oldest].size;
_cacheItems.remove_at(oldest);
return true;
}
byte *AudioCache::findByHash(int32 hash) {
Common::StackLock lock(_mutex);
for (uint i = 0; i != _cacheItems.size(); ++i) {
if (_cacheItems[i].hash == hash) {
_cacheItems[i].lastAccess = _accessCounter++;
return _cacheItems[i].data;
}
}
return nullptr;
}
void AudioCache::storeByHash(int32 hash, Common::SeekableReadStream *stream) {
Common::StackLock lock(_mutex);
uint32 size = stream->size();
byte *data = (byte *)malloc(size);
stream->read(data, size);
cacheItem item = {
hash,
0,
_accessCounter++,
data,
size
};
_cacheItems.push_back(item);
_totalSize += size;
}
void AudioCache::incRef(int32 hash) {
Common::StackLock lock(_mutex);
for (uint i = 0; i != _cacheItems.size(); ++i) {
if (_cacheItems[i].hash == hash) {
_cacheItems[i].refs++;
return;
}
}
assert(false && "AudioCache::incRef: hash not found");
}
void AudioCache::decRef(int32 hash) {
Common::StackLock lock(_mutex);
for (uint i = 0; i != _cacheItems.size(); ++i) {
if (_cacheItems[i].hash == hash) {
assert(_cacheItems[i].refs > 0);
_cacheItems[i].refs--;
return;
}
}
assert(false && "AudioCache::decRef: hash not found");
}
} // End of namespace BladeRunner
|
