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
|
/* -*- C++ -*- */
//=============================================================================
/**
* @file Free_List.h
*
* @author Darrell Brunsch (brunsch@cs.wustl.edu)
*/
//=============================================================================
#ifndef ACE_FREE_LIST_H
#define ACE_FREE_LIST_H
#include /**/ "ace/pre.h"
#include /**/ "ace/config-all.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
#include "ace/Global_Macros.h"
#include "ace/Default_Constants.h"
#include "ace/os_include/os_stddef.h"
ACE_BEGIN_VERSIONED_NAMESPACE_DECL
/**
* @class ACE_Free_List
*
* @brief Implements a free list.
*
* This class maintains a free list of nodes of type T.
*/
template <class T>
class ACE_Free_List
{
public:
/// Destructor - removes all the elements from the free_list.
virtual ~ACE_Free_List () = default;
/// Inserts an element onto the free list (if it isn't past the high
/// water mark).
virtual void add (T *element) = 0;
/// Takes a element off the freelist and returns it. It creates
/// <inc> new elements if the size is at or below the low water mark.
virtual T *remove () = 0;
/// Returns the current size of the free list.
virtual size_t size () = 0;
/// Resizes the free list to @a newsize.
virtual void resize (size_t newsize) = 0;
};
/**
* @class ACE_Locked_Free_List
*
* @brief Implements a free list.
*
* This class maintains a free list of nodes of type T. It
* depends on the type T having a get_next() and set_next()
* method. It maintains a mutex so the freelist can be used in
* a multithreaded program .
*/
template <class T, class ACE_LOCK>
class ACE_Locked_Free_List : public ACE_Free_List<T>
{
public:
/**
* Constructor takes a @a mode (i.e., ACE_FREE_LIST_WITH_POOL or
* ACE_PURE_FREE_LIST), a count of the number of nodes to
* @a prealloc, a low and high water mark (@a lwm and @a hwm) that
* indicate when to allocate more nodes, an increment value (@a inc)
* that indicates how many nodes to allocate when the list must
* grow.
*/
ACE_Locked_Free_List (int mode = ACE_FREE_LIST_WITH_POOL,
size_t prealloc = ACE_DEFAULT_FREE_LIST_PREALLOC,
size_t lwm = ACE_DEFAULT_FREE_LIST_LWM,
size_t hwm = ACE_DEFAULT_FREE_LIST_HWM,
size_t inc = ACE_DEFAULT_FREE_LIST_INC);
/// Destructor - removes all the elements from the free_list.
virtual ~ACE_Locked_Free_List ();
/// Inserts an element onto the free list (if it isn't past the high
/// water mark).
virtual void add (T *element);
/// Takes a element off the freelist and returns it. It creates
/// <inc> new elements if the size is at or below the low water mark.
virtual T *remove ();
/// Returns the current size of the free list.
virtual size_t size ();
/// Resizes the free list to @a newsize.
virtual void resize (size_t newsize);
ACE_ALLOC_HOOK_DECLARE;
protected:
/// Allocates @a n extra nodes for the freelist.
virtual void alloc (size_t n);
/// Removes and frees @a n nodes from the freelist.
virtual void dealloc (size_t n);
/// Free list operation mode, either ACE_FREE_LIST_WITH_POOL or
/// ACE_PURE_FREE_LIST.
int mode_;
/// Pointer to the first node in the freelist.
T *free_list_;
/// Low water mark.
size_t lwm_;
/// High water mark.
size_t hwm_;
/// Increment value.
size_t inc_;
/// Keeps track of the size of the list.
size_t size_;
/// Synchronization variable for ACE_Timer_Queue.
ACE_LOCK mutex_;
private:
// = Don't allow these operations for now.
ACE_Locked_Free_List (const ACE_Locked_Free_List<T, ACE_LOCK> &) = delete;
void operator= (const ACE_Locked_Free_List<T, ACE_LOCK> &) = delete;
};
ACE_END_VERSIONED_NAMESPACE_DECL
#if defined (ACE_TEMPLATES_REQUIRE_SOURCE)
#include "ace/Free_List.cpp"
#endif /* ACE_TEMPLATES_REQUIRE_SOURCE */
#if defined (ACE_TEMPLATES_REQUIRE_PRAGMA)
#pragma implementation ("Free_List.cpp")
#endif /* ACE_TEMPLATES_REQUIRE_PRAGMA */
#include /**/ "ace/post.h"
#endif /* ACE_FREE_LIST_H */
|
