blob: 91a1457175f4bbc7eeb876969ab33aa9570123cc (
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
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/***************************************************************************
* audiocacheidmanager.cc
*
* Tue Jan 5 10:59:37 CET 2016
* Copyright 2016 Bent Bisballe Nyeng
* deva@aasimon.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 Lesser General Public License as published by
* the Free Software Foundation; either version 3 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser 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 "audiocacheidmanager.h"
#include <limits>
#include <cassert>
AudioCacheIDManager::~AudioCacheIDManager()
{
assert(available_ids.size() == id2cache.size()); // All ids should be released.
}
void AudioCacheIDManager::init(unsigned int capacity)
{
std::lock_guard<std::mutex> guard(mutex);
id2cache.resize(capacity);
available_ids.resize(capacity);
for(size_t i = 0; i < capacity; ++i)
{
available_ids[i] = i;
}
}
cache_t& AudioCacheIDManager::getCache(cacheid_t id)
{
std::lock_guard<std::mutex> guard(mutex);
assert(id != CACHE_NOID);
assert(id != CACHE_DUMMYID);
assert(id >= 0);
assert(id < (int)id2cache.size());
assert(id2cache[id].id == id);
return id2cache[id];
}
cacheid_t AudioCacheIDManager::registerID(const cache_t& cache)
{
std::lock_guard<std::mutex> guard(mutex);
cacheid_t id = CACHE_NOID;
if(available_ids.empty())
{
return CACHE_DUMMYID;
}
else
{
id = available_ids.back();
available_ids.pop_back();
}
assert(id2cache[id].id == CACHE_NOID); // Make sure it is not already in use
id2cache[id] = cache;
id2cache[id].id = id;
return id;
}
void AudioCacheIDManager::releaseID(cacheid_t id)
{
std::lock_guard<std::mutex> guard(mutex);
assert(id2cache[id].id != CACHE_NOID); // Test if it wasn't already released.
id2cache[id].id = CACHE_NOID;
available_ids.push_back(id);
}
void AudioCacheIDManager::disableActive()
{
// Run through all active cache_ts and disable them.
for(auto& cache : id2cache)
{
if(cache.id != CACHE_NOID)
{
// Force use of nodata in all of the rest of the next() calls:
cache.localpos = std::numeric_limits<size_t>::max();
cache.ready = false;
}
}
}
std::vector<cacheid_t> AudioCacheIDManager::getActiveIDs()
{
std::vector<cacheid_t> active_ids;
for(auto& cache : id2cache)
{
if(cache.id != CACHE_NOID)
{
active_ids.push_back(cache.id);
}
}
return active_ids;
}
|
