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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
// $Id$
#ifndef ACE_HASH_CACHE_MAP_MANAGER_T_C
#define ACE_HASH_CACHE_MAP_MANAGER_T_C
#include "ace/Hash_Cache_Map_Manager_T.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
#define ACE_LACKS_PRAGMA_ONCE
#endif /* ACE_LACKS_PRAGMA_ONCE */
#if !defined (__ACE_INLINE__)
#include "ace/Hash_Cache_Map_Manager_T.i"
#endif /* __ACE_INLINE__ */
ACE_RCSID(ace, Hash_Cache_Map_Manager_T, "$Id$")
ACE_ALLOC_HOOK_DEFINE(ACE_Hash_Cache_Map_Manager)
#define T_1 class KEY, class VALUE, class HASH_KEY, class COMPARE_KEYS, class CACHING_STRATEGY, class ATTRIBUTES
#define T_2 KEY, VALUE, HASH_KEY, COMPARE_KEYS, CACHING_STRATEGY, ATTRIBUTES
template <T_1>
ACE_Hash_Cache_Map_Manager<T_2>::ACE_Hash_Cache_Map_Manager (CACHING_STRATEGY &caching_s,
size_t size,
ACE_Allocator *alloc)
: ACE_HCMM_BASE (caching_s,
size,
alloc)
{
}
template <T_1>
ACE_Hash_Cache_Map_Manager<T_2>::~ACE_Hash_Cache_Map_Manager (void)
{
}
template <T_1> int
ACE_Hash_Cache_Map_Manager<T_2>:: bind (const KEY &key,
const VALUE &value,
ACE_Hash_Map_Entry<KEY, ACE_Pair<VALUE, ATTRIBUTES> > *&entry)
{
// Insert a entry which has the <key> and the <cache_value> which is
// the combination of the <value> and the attributes of the caching
// strategy.
CACHE_VALUE cache_value (value,
this->caching_strategy_.attributes ());
int bind_result = this->map_.bind (key,
cache_value,
entry);
if (bind_result != -1)
{
int result = this->caching_strategy_.notify_bind (bind_result,
cache_value.second ());
if (result == -1)
{
this->map_.unbind (key);
// Unless the notification goes thru the bind operation is
// not complete.
bind_result = -1;
}
}
return bind_result;
}
template <T_1> int
ACE_Hash_Cache_Map_Manager<T_2>::rebind (const KEY &key,
const VALUE &value,
ACE_Hash_Map_Entry<KEY, ACE_Pair<VALUE, ATTRIBUTES> > *&entry)
{
CACHE_VALUE cache_value (value,
this->caching_strategy_.attributes ());
int rebind_result = this->map_.rebind (key,
cache_value,
entry);
if (rebind_result != -1)
{
int result = this->caching_strategy_.notify_rebind (rebind_result,
cache_value.second ());
if (result == -1)
{
// Make sure the unbind operation is done only when the
// notification fails after a bind which is denoted by
// rebind_result = 0
if (rebind_result == 0)
this->map_.unbind (key);
// Unless the notification goes thru the rebind operation is
// not complete.
rebind_result = -1;
}
}
return rebind_result;
}
template <T_1> int
ACE_Hash_Cache_Map_Manager<T_2>::trybind (const KEY &key,
VALUE &value,
ACE_Hash_Map_Entry<KEY, ACE_Pair<VALUE, ATTRIBUTES> > *&entry)
{
CACHE_VALUE cache_value (value,
this->caching_strategy_.attributes ());
int trybind_result = this->map_.trybind (key,
cache_value,
entry);
if (trybind_result != -1)
{
int result = this->caching_strategy_.notify_trybind (trybind_result,
cache_value.second ());
if (result == -1)
{
// If the entry has got inserted into the map, it is removed
// due to failure.
if (trybind_result == 0)
this->map_.unbind (key);
trybind_result = -1;
}
else
{
// If an attempt is made to bind an existing entry the value
// is overwritten with the value from the map.
if (trybind_result == 1)
value = cache_value.first ();
}
}
return trybind_result;
}
template <T_1> int
ACE_Hash_Cache_Map_Manager<T_2>::find (const KEY &key,
ACE_Hash_Map_Entry<KEY, ACE_Pair<VALUE, ATTRIBUTES> > *&entry)
{
// Lookup the key and populate the <value>.
int find_result = this->map_.find (key,
entry);
if (find_result != -1)
{
int result = this->caching_strategy_.notify_find (find_result,
entry->int_id_.second ());
// Unless the find and notification operations go thru, this
// method is not successful.
if (result == -1)
find_result = -1;
else
find_result = 0;
}
return find_result;
}
template <T_1> int
ACE_Hash_Cache_Map_Manager<T_2>::find (const KEY &key,
VALUE &value)
{
CACHE_ENTRY *entry = 0;
int result = this->find (key,
entry);
if (result != -1)
{
value = entry->int_id_.first ();
}
return result;
}
template <T_1> int
ACE_Hash_Cache_Map_Manager<T_2>::find (const KEY &key)
{
CACHE_ENTRY *entry = 0;
return this->find (key,
entry);
}
template <T_1> int
ACE_Hash_Cache_Map_Manager<T_2>::unbind (ACE_Hash_Map_Entry<KEY, ACE_Pair<VALUE, ATTRIBUTES> > *entry)
{
// Remove the entry from the cache.
int unbind_result = this->map_.unbind (entry);
if (unbind_result != -1)
{
int result = this->caching_strategy_.notify_unbind (unbind_result,
entry->int_id_.second ());
if (result == -1)
unbind_result = -1;
}
return unbind_result;
}
#undef T_1
#undef T_2
#endif /* ACE_HASH_CACHE_MAP_MANAGER_T_C */
|
