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
|
/* -*- C++ -*- */
// $Id$
// Inserts an element onto the free list (if we are allowed to manage
// elements withing and it pasts the high water mark, delete the
// element)
template <class T, class ACE_LOCK> ACE_INLINE void
ACE_Locked_Free_List<T, ACE_LOCK>::add (T *element)
{
ACE_MT (ACE_GUARD (ACE_LOCK, ace_mon, this->mutex_));
// Check to see that we not at the high water mark.
if (this->mode_ == ACE_PURE_FREE_LIST
|| this->size_ < this->hwm_)
{
element->set_next (this->free_list_);
this->free_list_ = element;
this->size_++;
}
else
delete element;
}
// Takes a element off the freelist and returns it. It creates <inc>
// new elements if we are allowed to do it and the size is at the low
// water mark.
template <class T, class ACE_LOCK> ACE_INLINE T *
ACE_Locked_Free_List<T, ACE_LOCK>::remove (void)
{
ACE_MT (ACE_GUARD_RETURN (ACE_LOCK, ace_mon, this->mutex_, 0));
// If we are at the low water mark, add some nodes
if (this->mode_ != ACE_PURE_FREE_LIST && this->size_ <= this->lwm_)
this->alloc (this->inc_);
// Remove a node
T *temp = this->free_list_;
if (temp != 0)
{
this->free_list_ = this->free_list_->get_next ();
this->size_--;
}
return temp;
}
// Returns the current size of the free list
template <class T, class ACE_LOCK> ACE_INLINE size_t
ACE_Locked_Free_List<T, ACE_LOCK>::size (void)
{
return this->size_;
}
// Resizes the free list to <newsize>
template <class T, class ACE_LOCK> ACE_INLINE void
ACE_Locked_Free_List<T, ACE_LOCK>::resize (size_t newsize)
{
ACE_MT (ACE_GUARD (ACE_LOCK, ace_mon, this->mutex_));
// Check if we are allowed to resize
if (this->mode_ != ACE_PURE_FREE_LIST)
// Check to see if we grow or shrink
if (newsize < this->size_)
this->dealloc (this->size_ - newsize);
else
this->alloc (newsize - this->size_);
}
|
