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
|
/*
Copyright (C) 2009 Red Hat, Inc.
This library 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 2.1 of the License, or (at your option) any later version.
This library 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 this library; if not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _H_CACHE
#define _H_CACHE
#include "utils.h"
/*class Cache::Treat {
T* get(T*);
void release(T*);
const char* name();
};*/
template <class T, class Treat, int HASH_SIZE, class Base = EmptyBase>
class Cache : public Base {
public:
Cache()
{
memset(_hash, 0, sizeof(_hash));
}
~Cache()
{
clear();
}
void add(uint64_t id, T* data)
{
Item** item = &_hash[key(id)];
while (*item) {
if ((*item)->id == id) {
THROW("%s id %lu, double insert", Treat::name(), id);
}
item = &(*item)->next;
}
*item = new Item(id, data);
}
T* get(uint64_t id)
{
Item* item = _hash[key(id)];
while (item && item->id != id) {
item = item->next;
}
if (!item) {
THROW("%s id %lu, not found", Treat::name(), id);
}
return Treat::get(item->data);
}
void remove(uint64_t id)
{
Item** item = &_hash[key(id)];
while (*item) {
if ((*item)->id == id) {
Item *rm_item = *item;
*item = rm_item->next;
delete rm_item;
return;
}
item = &(*item)->next;
}
THROW("%s id %lu, not found", Treat::name(), id);
}
void clear()
{
for (int i = 0; i < HASH_SIZE; i++) {
while (_hash[i]) {
Item *item = _hash[i];
_hash[i] = item->next;
delete item;
}
}
}
private:
inline uint32_t key(uint64_t id) {return uint32_t(id) % HASH_SIZE;}
private:
class Item {
public:
Item(uint64_t in_id, T* data)
: id (in_id)
, next (NULL)
, data (Treat::get(data)) {}
~Item()
{
Treat::release(data);
}
uint64_t id;
Item* next;
T* data;
};
Item* _hash[HASH_SIZE];
};
#endif
|
