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
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
|
// $Id$
#ifndef CACHING_UTILITY_T_C
#define CACHING_UTILITY_T_C
#include "ace/Caching_Utility_T.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
#define ACE_LACKS_PRAGMA_ONCE
#endif /* ACE_LACKS_PRAGMA_ONCE */
#include "ace/Min_Max.h"
#include "ace/OS_Memory.h"
// #include "ace/Strategies.h"
#include "ace/Recyclable.h"
ACE_RCSID(ace, Caching_Utility_T, "$Id$")
//////////////////////////////////////////////////////////////////////////////
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES>
ACE_Pair_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::ACE_Pair_Caching_Utility (ACE_Cleanup_Strategy<KEY, VALUE, CONTAINER> *cleanup_strategy,
int delete_cleanup_strategy)
: cleanup_strategy_ (cleanup_strategy),
delete_cleanup_strategy_ (delete_cleanup_strategy)
{
if (cleanup_strategy == 0)
{
ACE_NEW (this->cleanup_strategy_,
CLEANUP_STRATEGY);
this->delete_cleanup_strategy_ = 1;
}
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES>
ACE_Pair_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::~ACE_Pair_Caching_Utility (void)
{
if (this->delete_cleanup_strategy_)
delete this->cleanup_strategy_;
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES> int
ACE_Pair_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::clear_cache (CONTAINER &container,
double purge_percent)
{
// Check that the purge_percent is non-zero.
if (purge_percent == 0)
return 0;
// Get the number of entries in the container.
size_t current_map_size = container.current_size ();
// Also whether the number of entries in the cache!
// Oops! then there is no way out but exiting. So return an error.
if (current_map_size == 0)
return 0;
// Calculate the no of entries to remove from the cache depending
// upon the <purge_percent>.
size_t entries_to_remove
= ACE_MAX (ACE_static_cast (size_t, 1),
ACE_static_cast (size_t,
ACE_static_cast(double, purge_percent)
/ 100 * current_map_size));
KEY *key_to_remove = 0;
VALUE *value_to_remove = 0;
for (size_t i = 0; i < entries_to_remove ; ++i)
{
this->minimum (container,
key_to_remove,
value_to_remove);
// Simply verifying that the key is non-zero.
// This is important for strategies where the minimum
// entry cant be found due to constraints on the type of entry
// to remove.
if (key_to_remove == 0)
return 0;
if (this->cleanup_strategy_->cleanup (container,
key_to_remove,
value_to_remove) == -1)
return -1;
}
return 0;
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES> void
ACE_Pair_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::minimum (CONTAINER &container,
KEY *&key_to_remove,
VALUE *&value_to_remove)
{
// Starting values.
ITERATOR iter = container.begin ();
ITERATOR end = container.end ();
ATTRIBUTES min = (*iter).int_id_.second ();
key_to_remove = &(*iter).ext_id_;
value_to_remove = &(*iter).int_id_;
// The iterator moves thru the container searching for the entry
// with the lowest ATTRIBUTES.
for (++iter;
iter != end;
++iter)
{
if (min > (*iter).int_id_.second ())
{
// Ah! an item with lower ATTTRIBUTES...
min = (*iter).int_id_.second ();
key_to_remove = &(*iter).ext_id_;
value_to_remove = &(*iter).int_id_;
}
}
}
////////////////////////////////////////////////////////////////////////////////////////////////////////
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES>
ACE_Recyclable_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::ACE_Recyclable_Handler_Caching_Utility (ACE_Cleanup_Strategy<KEY, VALUE, CONTAINER> *cleanup_strategy,
int delete_cleanup_strategy)
: cleanup_strategy_ (cleanup_strategy),
delete_cleanup_strategy_ (delete_cleanup_strategy)
{
if (cleanup_strategy == 0)
{
ACE_NEW (this->cleanup_strategy_,
CLEANUP_STRATEGY);
this->delete_cleanup_strategy_ = 1;
}
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES>
ACE_Recyclable_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::~ACE_Recyclable_Handler_Caching_Utility (void)
{
if (this->delete_cleanup_strategy_)
delete this->cleanup_strategy_;
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES> int
ACE_Recyclable_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::clear_cache (CONTAINER &container,
double purge_percent)
{
// Check that the purge_percent is non-zero.
if (purge_percent == 0)
return 0;
// Get the number of entries in the container.
size_t current_map_size = container.current_size ();
// Also whether the number of entries in the cache is just one!
// Oops! then there is no way out but exiting. So return an error.
// if (current_map_size <= 1)
if (current_map_size == 0)
return 0;
// Calculate the no of entries to remove from the cache depending
// upon the <purge_percent>.
size_t entries_to_remove
= ACE_MAX (ACE_static_cast (size_t, 1),
ACE_static_cast(size_t,
ACE_static_cast(double, purge_percent)
/ 100 * current_map_size));
KEY *key_to_remove = 0;
VALUE *value_to_remove = 0;
for (size_t i = 0; i < entries_to_remove ; ++i)
{
this->minimum (container,
key_to_remove,
value_to_remove);
// Simply verifying that the key is non-zero.
// This is important for strategies where the minimum
// entry cant be found due to constraints on the type of entry
// to remove.
if (key_to_remove == 0)
return 0;
if (this->cleanup_strategy_->cleanup (container,
key_to_remove,
value_to_remove) == -1)
return -1;
}
return 0;
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES> void
ACE_Recyclable_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::minimum (CONTAINER &container,
KEY *&key_to_remove,
VALUE *&value_to_remove)
{
// Starting values.
ITERATOR end = container.end ();
ITERATOR iter = container.begin ();
ATTRIBUTES min = (*iter).int_id_.second ();
key_to_remove = 0;
value_to_remove = 0;
// Found the minimum entry to be purged?
int found = 0;
// The iterator moves thru the container searching for the entry
// with the lowest ATTRIBUTES.
for (;
iter != end;
++iter)
{
// If the <min> entry isnt IDLE_AND_PURGABLE continue until you reach
// the first entry which can be purged. This is the minimum with
// which you will compare the rest of the purgable entries.
if ((*iter).ext_id_.recycle_state () == ACE_RECYCLABLE_IDLE_AND_PURGABLE ||
(*iter).ext_id_.recycle_state () == ACE_RECYCLABLE_PURGABLE_BUT_NOT_IDLE)
{
if (found == 0)
{
min = (*iter).int_id_.second ();
key_to_remove = &(*iter).ext_id_;
value_to_remove = &(*iter).int_id_;
found = 1;
}
else
{
// Ah! an entry with lower ATTTRIBUTES...
if (min > (*iter).int_id_.second ())
{
min = (*iter).int_id_.second ();
key_to_remove = &(*iter).ext_id_;
value_to_remove = &(*iter).int_id_;
}
}
}
}
}
////////////////////////////////////////////////////////////////////////////////
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES>
ACE_Refcounted_Recyclable_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::ACE_Refcounted_Recyclable_Handler_Caching_Utility (ACE_Cleanup_Strategy<KEY, VALUE, CONTAINER> *cleanup_strategy,
int delete_cleanup_strategy)
: cleanup_strategy_ (cleanup_strategy),
delete_cleanup_strategy_ (delete_cleanup_strategy),
marked_as_closed_entries_ (0)
{
if (cleanup_strategy == 0)
{
ACE_NEW (this->cleanup_strategy_,
CLEANUP_STRATEGY);
this->delete_cleanup_strategy_ = 1;
}
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES>
ACE_Refcounted_Recyclable_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::~ACE_Refcounted_Recyclable_Handler_Caching_Utility (void)
{
if (this->delete_cleanup_strategy_)
delete this->cleanup_strategy_;
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES> int
ACE_Refcounted_Recyclable_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::clear_cache (CONTAINER &container,
double purge_percent)
{
// Check that the purge_percent is non-zero.
if (purge_percent == 0)
return 0;
// Get the number of entries in the container which can be considered for purging.
size_t available_entries = container.current_size () - this->marked_as_closed_entries_;
// Also whether the number of entries in the cache zero.
// Oops! then there is no way out but exiting.
if (available_entries <= 0)
return 0;
// Calculate the no of entries to remove from the cache depending
// upon the <purge_percent>.
size_t entries_to_remove
= ACE_MAX (ACE_static_cast (size_t, 1),
ACE_static_cast(size_t,
ACE_static_cast(double, purge_percent)
/ 100 * available_entries));
if (entries_to_remove >= available_entries ||
entries_to_remove == 0)
entries_to_remove = available_entries - 1;
KEY *key_to_remove = 0;
VALUE *value_to_remove = 0;
for (size_t i = 0; i < entries_to_remove ; ++i)
{
this->minimum (container,
key_to_remove,
value_to_remove);
// Simply verifying that the key is non-zero.
// This is important for strategies where the minimum
// entry cant be found due to constraints on the type of entry
// to remove.
if (key_to_remove == 0)
return 0;
if (this->cleanup_strategy_->cleanup (container,
key_to_remove,
value_to_remove) == -1)
return -1;
++this->marked_as_closed_entries_;
}
return 0;
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES> void
ACE_Refcounted_Recyclable_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::minimum (CONTAINER &container,
KEY *&key_to_remove,
VALUE *&value_to_remove)
{
// Starting values.
ITERATOR end = container.end ();
ITERATOR iter = container.begin ();
ATTRIBUTES min = (*iter).int_id_.second ();
key_to_remove = 0;
value_to_remove = 0;
// Found the minimum entry to be purged?
int found = 0;
// The iterator moves thru the container searching for the entry
// with the lowest ATTRIBUTES.
for (;
iter != end;
++iter)
{
// If the <min> entry isnt IDLE_AND_PURGABLE continue until you reach
// the first entry which can be purged. This is the minimum with
// which you will compare the rest of the purgable entries.
if ((*iter).ext_id_.recycle_state () == ACE_RECYCLABLE_IDLE_AND_PURGABLE ||
(*iter).ext_id_.recycle_state () == ACE_RECYCLABLE_PURGABLE_BUT_NOT_IDLE)
{
if (found == 0)
{
min = (*iter).int_id_.second ();
key_to_remove = &(*iter).ext_id_;
value_to_remove = &(*iter).int_id_;
found = 1;
}
else
{
// Ah! an entry with lower ATTTRIBUTES...
if (min > (*iter).int_id_.second ())
{
min = (*iter).int_id_.second ();
key_to_remove = &(*iter).ext_id_;
value_to_remove = &(*iter).int_id_;
}
}
}
}
}
////////////////////////////////////////////////////////////////////////////////
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES>
ACE_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::ACE_Handler_Caching_Utility (ACE_Cleanup_Strategy<KEY, VALUE, CONTAINER> *cleanup_strategy,
int delete_cleanup_strategy)
: cleanup_strategy_ (cleanup_strategy),
delete_cleanup_strategy_ (delete_cleanup_strategy)
{
if (cleanup_strategy == 0)
{
ACE_NEW (this->cleanup_strategy_,
CLEANUP_STRATEGY);
this->delete_cleanup_strategy_ = 1;
}
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES>
ACE_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::~ACE_Handler_Caching_Utility (void)
{
if (this->delete_cleanup_strategy_)
delete this->cleanup_strategy_;
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES> int
ACE_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::clear_cache (CONTAINER &container,
double purge_percent)
{
// Check that the purge_percent is non-zero.
if (purge_percent == 0)
return 0;
// Get the number of entries in the container.
size_t current_map_size = container.current_size ();
// Also whether the number of entries in the cache is just one!
// Oops! then there is no way out but exiting. So return an error.
if (current_map_size == 0)
return 0;
// Calculate the no of entries to remove from the cache depending
// upon the <purge_percent>.
size_t entries_to_remove
= ACE_MAX (ACE_static_cast (size_t, 1),
ACE_static_cast(size_t,
ACE_static_cast(double, purge_percent)
/ 100 * current_map_size));
KEY *key_to_remove = 0;
VALUE *value_to_remove = 0;
for (size_t i = 0; i < entries_to_remove ; ++i)
{
this->minimum (container,
key_to_remove,
value_to_remove);
if (this->cleanup_strategy_->cleanup (container,
key_to_remove,
value_to_remove) == -1)
return -1;
}
return 0;
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES> void
ACE_Handler_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::minimum (CONTAINER &container,
KEY *&key_to_remove,
VALUE *&value_to_remove)
{
// Starting values.
ITERATOR iter = container.begin ();
ITERATOR end = container.end ();
ATTRIBUTES min = (*iter).int_id_->caching_attributes ();
key_to_remove = &(*iter).ext_id_;
value_to_remove = &(*iter).int_id_;
// The iterator moves thru the container searching for the entry
// with the lowest ATTRIBUTES.
for (++iter;
iter != end;
++iter)
{
if (min > (*iter).int_id_->caching_attributes () &&
(*iter).int_id_->active () != 1)
{
// Ah! an item with lower ATTTRIBUTES...
min = (*iter).int_id_->caching_attributes ();
key_to_remove = &(*iter).ext_id_;
value_to_remove = &(*iter).int_id_;
}
}
}
////////////////////////////////////////////////////////////////////////////////////////////////////////
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES>
ACE_Null_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::ACE_Null_Caching_Utility (ACE_Cleanup_Strategy<KEY, VALUE, CONTAINER> *cleanup_strategy,
int delete_cleanup_strategy)
: cleanup_strategy_ (cleanup_strategy),
delete_cleanup_strategy_ (delete_cleanup_strategy)
{
if (cleanup_strategy == 0)
{
ACE_NEW (this->cleanup_strategy_,
CLEANUP_STRATEGY);
this->delete_cleanup_strategy_ = 1;
}
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES>
ACE_Null_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::~ACE_Null_Caching_Utility (void)
{
if (this->delete_cleanup_strategy_)
delete this->cleanup_strategy_;
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES> int
ACE_Null_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::clear_cache (CONTAINER &container,
double purge_percent)
{
ACE_UNUSED_ARG (container);
ACE_UNUSED_ARG (purge_percent);
return 0;
}
template <class KEY, class VALUE, class CONTAINER, class ITERATOR, class ATTRIBUTES> void
ACE_Null_Caching_Utility<KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES>::minimum (CONTAINER &container,
KEY *&key_to_remove,
VALUE *&value_to_remove)
{
ACE_UNUSED_ARG (container);
ACE_UNUSED_ARG (key_to_remove);
ACE_UNUSED_ARG (value_to_remove);
}
#endif /* CACHING_UTILITY_T_C */
|
