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
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
|
#ifndef ACE_CACHE_MAP_MANAGER_T_CPP
#define ACE_CACHE_MAP_MANAGER_T_CPP
#include "ace/Cache_Map_Manager_T.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
#pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
#include "ace/Log_Category.h"
#include "ace/Malloc_Base.h"
#if !defined (__ACE_INLINE__)
#include "ace/Cache_Map_Manager_T.inl"
#endif /* __ACE_INLINE__ */
ACE_BEGIN_VERSIONED_NAMESPACE_DECL
ACE_ALLOC_HOOK_DEFINE_Tc7(ACE_Cache_Map_Manager)
ACE_ALLOC_HOOK_DEFINE_Tc5(ACE_Cache_Map_Iterator)
ACE_ALLOC_HOOK_DEFINE_Tc5(ACE_Cache_Map_Reverse_Iterator)
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES>
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::ACE_Cache_Map_Manager (CACHING_STRATEGY &caching_s,
size_t size,
ACE_Allocator *alloc)
: caching_strategy_ (caching_s)
{
if (this->open (size, alloc) == -1)
ACELIB_ERROR ((LM_ERROR,
ACE_TEXT ("%p\n"),
ACE_TEXT ("ACE_Cache_Map_Manager::ACE_Cache_Map_Manager")));
}
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES>
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::~ACE_Cache_Map_Manager (void)
{
this->close ();
}
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::open (size_t length,
ACE_Allocator *alloc)
{
return this->map_.open (length,
alloc);
}
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::close (void)
{
return this->map_.close ();
}
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::bind (const KEY &key,
const VALUE &value)
{
// Insert an 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);
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 <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::rebind (const KEY &key,
const VALUE &value)
{
CACHE_VALUE cache_value (value,
this->caching_strategy_.attributes ());
int rebind_result = this->map_.rebind (key,
cache_value);
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 <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::rebind (const KEY &key,
const VALUE &value,
VALUE &old_value)
{
CACHE_VALUE cache_value (value,
this->caching_strategy_.attributes ());
CACHE_VALUE old_cache_value (old_value,
this->caching_strategy_.attributes ());
int rebind_result = this->map_.rebind (key,
cache_value,
old_cache_value);
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;
}
else
{
old_value = old_cache_value.first ();
}
}
return rebind_result;
}
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::rebind (const KEY &key,
const VALUE &value,
KEY &old_key,
VALUE &old_value)
{
CACHE_VALUE cache_value (value,
this->caching_strategy_.attributes ());
CACHE_VALUE old_cache_value (old_value,
this->caching_strategy_.attributes ());
int rebind_result = this->map_.rebind (key,
cache_value,
old_key,
old_cache_value);
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;
}
else
{
old_value = old_cache_value.first ();
}
}
return rebind_result;
}
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::trybind (const KEY &key,
VALUE &value)
{
CACHE_VALUE cache_value (value,
this->caching_strategy_.attributes ());
int trybind_result = this->map_.trybind (key,
cache_value);
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 <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::find (const KEY &key,
VALUE &value)
{
// Lookup the key and populate the <value>.
CACHE_VALUE cache_value;
int find_result = this->map_.find (key,
cache_value);
if (find_result != -1)
{
int result = this->caching_strategy_.notify_find (find_result,
cache_value.second);
// Unless the find and notification operations go thru, this
// method is not successful.
if (result == -1)
find_result = -1;
else
{
// Since the <cache_value> has now changed after the
// notification, we need to bind to the map again.
int rebind_result = this->map_.rebind (key,
cache_value);
if (rebind_result == -1)
find_result = -1;
else
value = cache_value.first;
}
}
return find_result;
}
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::find (const KEY &key)
{
// Lookup the key and populate the <value>.
CACHE_VALUE cache_value;
int find_result = this->map_.find (key,
cache_value);
if (find_result != -1)
{
int result = this->caching_strategy_.notify_find (find_result,
cache_value.second);
// Unless the find and notification operations go thru, this
// method is not successful.
if (result == -1)
find_result = -1;
else
{
// Since the <cache_value> has now changed after the
// notification, we need to bind to the map again.
int rebind_result = this->map_.rebind (key,
cache_value);
if (rebind_result == -1)
find_result = -1;
}
}
return find_result;
}
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::unbind (const KEY &key)
{
// Remove the entry from the cache.
CACHE_VALUE cache_value;
int unbind_result = this->map_.unbind (key,
cache_value);
if (unbind_result != -1)
{
int result = this->caching_strategy_.notify_unbind (unbind_result,
cache_value.second);
if (result == -1)
unbind_result = -1;
}
return unbind_result;
}
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> int
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::unbind (const KEY &key,
VALUE &value)
{
// Remove the entry from the cache.
CACHE_VALUE cache_value;
int unbind_result = this->map_.unbind (key,
cache_value);
if (unbind_result != -1)
{
int result = this->caching_strategy_.notify_unbind (unbind_result,
cache_value.second ());
if (result == -1)
unbind_result = -1;
else
value = cache_value.first ();
}
return unbind_result;
}
template <class KEY, class VALUE, class CMAP_TYPE, class ITERATOR_IMPL, class REVERSE_ITERATOR_IMPL, class CACHING_STRATEGY, class ATTRIBUTES> void
ACE_Cache_Map_Manager<KEY, VALUE, CMAP_TYPE, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES>::dump (void) const
{
#if defined (ACE_HAS_DUMP)
this->map_.dump ();
this->caching_strategy_.dump ();
#endif /* ACE_HAS_DUMP */
}
template <class KEY, class VALUE, class IMPLEMENTATION, class CACHING_STRATEGY, class ATTRIBUTES>
ACE_Cache_Map_Iterator<KEY, VALUE, IMPLEMENTATION, CACHING_STRATEGY, ATTRIBUTES>::~ACE_Cache_Map_Iterator (void)
{
}
ACE_END_VERSIONED_NAMESPACE_DECL
#endif /* ACE_CACHE_MAP_MANAGER_T_CPP */
|
