| blob | 646f000c13ba473054cf63d3bb526b810527632a |
1 A simplistic mem free list implementation using vector
3 From: Thorsten Behrens <thb@openoffice.org>
6 ---
8 o3tl/inc/o3tl/vector_pool.hxx | 132 +++++++++++++++++++++++++++++++++++++++++
9 o3tl/qa/makefile.mk | 1
10 o3tl/qa/test-vector_pool.cxx | 73 +++++++++++++++++++++++
11 3 files changed, 206 insertions(+), 0 deletions(-)
12 create mode 100644 o3tl/inc/o3tl/vector_pool.hxx
13 create mode 100644 o3tl/qa/test-vector_pool.cxx
16 diff --git o3tl/inc/o3tl/vector_pool.hxx o3tl/inc/o3tl/vector_pool.hxx
17 new file mode 100644
18 index 0000000..9f80e3b
19 --- /dev/null
20 +++ o3tl/inc/o3tl/vector_pool.hxx
21 @@ -0,0 +1,132 @@
22 +/*************************************************************************
23 + *
24 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25 + *
26 + * Copyright 2008 by Sun Microsystems, Inc.
27 + *
28 + * OpenOffice.org - a multi-platform office productivity suite
29 + *
30 + * $RCSfile: lazy_update.hxx,v $
31 + * $Revision: 1.3 $
32 + *
33 + * This file is part of OpenOffice.org.
34 + *
35 + * OpenOffice.org is free software: you can redistribute it and/or modify
36 + * it under the terms of the GNU Lesser General Public License version 3
37 + * only, as published by the Free Software Foundation.
38 + *
39 + * OpenOffice.org is distributed in the hope that it will be useful,
40 + * but WITHOUT ANY WARRANTY; without even the implied warranty of
41 + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
42 + * GNU Lesser General Public License version 3 for more details
43 + * (a copy is included in the LICENSE file that accompanied this code).
44 + *
45 + * You should have received a copy of the GNU Lesser General Public License
46 + * version 3 along with OpenOffice.org. If not, see
47 + * <http://www.openoffice.org/license.html>
48 + * for a copy of the LGPLv3 License.
49 + *
50 + ************************************************************************/
51 +
52 +#ifndef INCLUDED_O3TL_VECTOR_POOL_HXX
53 +#define INCLUDED_O3TL_VECTOR_POOL_HXX
54 +
55 +#include <sal/types.h>
56 +#include <vector>
57 +
58 +namespace o3tl
59 +{
60 + namespace detail
61 + {
62 + template<typename ValueType, class Container> class simple_pool_impl :
63 + public Container
64 + {
65 + typedef typename Container::value_type value_type;
66 + std::ptrdiff_t mnFirstFreeIndex;
67 +
68 + public:
69 + simple_pool_impl() :
70 + mnFirstFreeIndex(-1)
71 + {}
72 +
73 + std::ptrdiff_t alloc()
74 + {
75 + return store(ValueType());
76 + }
77 +
78 + std::ptrdiff_t store(const ValueType& rCopy)
79 + {
80 + if( mnFirstFreeIndex != -1 )
81 + {
82 + std::ptrdiff_t nIdx=mnFirstFreeIndex;
83 + mnFirstFreeIndex = this->at(mnFirstFreeIndex).nextFree;
84 + this->at(nIdx).value = rCopy;
85 + this->at(nIdx).nextFree = -1;
86 +
87 + return nIdx;
88 + }
89 + else
90 + {
91 + push_back(value_type(rCopy));
92 + return this->size()-1;
93 + }
94 + }
95 +
96 + void free( std::ptrdiff_t nIdx )
97 + {
98 + this->at(nIdx).nextFree = mnFirstFreeIndex;
99 + mnFirstFreeIndex = nIdx;
100 + }
101 +
102 + const ValueType& get( std::ptrdiff_t nIdx ) const
103 + {
104 + return this->operator[](nIdx).value;
105 + }
106 + ValueType& get( std::ptrdiff_t nIdx )
107 + {
108 + return this->operator[](nIdx).value;
109 + }
110 + };
111 +
112 + template< typename ValueType > struct struct_from_value
113 + {
114 + struct type
115 + {
116 + type() :
117 + value(),
118 + nextFree(-1)
119 + {}
120 + explicit type( const ValueType& val ) :
121 + value(val),
122 + nextFree(-1)
123 + {}
124 +
125 + ValueType value;
126 + std::ptrdiff_t nextFree;
127 + };
128 + };
129 + }
130 +
131 + /** Simple vector-based memory pool allocator
132 +
133 + This template can be used to provide simple pooled memory
134 + allocation from a container class that adheres to the stl
135 + random access container concept. Note that alloc/free works
136 + with _indices_ into the container!
137 +
138 + @example
139 + <pre>
140 +vector_pool<type> myPool;
141 +int nIdx=myPool.alloc();
142 +myPool[nIdx] = myVal;
143 + ... do stuff ...
144 +myPool.free(nIdx);
145 + </pre>
146 + */
147 + template<typename ValueType> struct vector_pool :
148 + public detail::simple_pool_impl<ValueType,
149 + std::vector<typename detail::struct_from_value<ValueType>::type > >
150 + {};
151 +}
152 +
153 +#endif /* INCLUDED_O3TL_VECTOR_POOL_HXX */
154 diff --git o3tl/qa/makefile.mk o3tl/qa/makefile.mk
155 index 5a71a78..dd69222 100644
156 --- o3tl/qa/makefile.mk
157 +++ o3tl/qa/makefile.mk
158 @@ -46,6 +46,7 @@ ENABLE_EXCEPTIONS=TRUE
159 SHL1OBJS= \
160 $(SLO)$/cow_wrapper_clients.obj \
161 $(SLO)$/test-cow_wrapper.obj \
162 + $(SLO)$/test-vector_pool.obj \
163 $(SLO)$/test-heap_ptr.obj \
164 $(SLO)$/test-range.obj
166 diff --git o3tl/qa/test-vector_pool.cxx o3tl/qa/test-vector_pool.cxx
167 new file mode 100644
168 index 0000000..46f188e
169 --- /dev/null
170 +++ o3tl/qa/test-vector_pool.cxx
171 @@ -0,0 +1,73 @@
172 +// autogenerated file with codegen.pl
173 +
174 +#include <cppunit/simpleheader.hxx>
175 +
176 +#include <o3tl/vector_pool.hxx>
177 +
178 +using namespace ::o3tl;
179 +
180 +class vector_pool_test : public CppUnit::TestFixture
181 +{
182 +public:
183 + void testPoolBasics()
184 + {
185 + vector_pool<int> aPool;
186 +
187 + std::ptrdiff_t nIdx1 = aPool.alloc();
188 + std::ptrdiff_t nIdx2 = aPool.alloc();
189 + std::ptrdiff_t nIdx3 = aPool.alloc();
190 +
191 + CPPUNIT_ASSERT_MESSAGE("allocator idx order 1", nIdx1 < nIdx2 );
192 + CPPUNIT_ASSERT_MESSAGE("allocator idx order 2", nIdx2 < nIdx3 );
193 +
194 + aPool.free(nIdx2);
195 + aPool.free(nIdx3);
196 +
197 + nIdx2 = aPool.alloc();
198 + nIdx3 = aPool.alloc();
199 +
200 + CPPUNIT_ASSERT_MESSAGE("allocator idx order 1 after fragmentation", nIdx1 < nIdx3 );
201 + CPPUNIT_ASSERT_MESSAGE("allocator idx order 2 after fragmentation", nIdx3 < nIdx2 );
202 + }
203 +
204 + void testPoolValueSemantics()
205 + {
206 + vector_pool<int> aPool;
207 +
208 + std::ptrdiff_t nIdx1 = aPool.store(0);
209 + CPPUNIT_ASSERT_MESSAGE("allocator value semantics 1", aPool.get(nIdx1) == 0 );
210 +
211 + std::ptrdiff_t nIdx2 = aPool.store(1);
212 + CPPUNIT_ASSERT_MESSAGE("allocator value semantics 2", aPool.get(nIdx2) == 1 );
213 +
214 + std::ptrdiff_t nIdx3 = aPool.store(2);
215 + CPPUNIT_ASSERT_MESSAGE("allocator value semantics 3", aPool.get(nIdx3) == 2 );
216 +
217 + aPool.free(nIdx2);
218 + aPool.free(nIdx3);
219 +
220 + nIdx2 = aPool.store(1);
221 + CPPUNIT_ASSERT_MESSAGE("allocator value semantics 2 after fragmentation", aPool.get(nIdx2) == 1 );
222 +
223 + nIdx3 = aPool.store(2);
224 + CPPUNIT_ASSERT_MESSAGE("allocator value semantics 3 after fragmentation", aPool.get(nIdx3) == 2 );
225 + }
226 +
227 + // Change the following lines only, if you add, remove or rename
228 + // member functions of the current class,
229 + // because these macros are need by auto register mechanism.
230 +
231 + CPPUNIT_TEST_SUITE(vector_pool_test);
232 + CPPUNIT_TEST(testPoolBasics);
233 + CPPUNIT_TEST(testPoolValueSemantics);
234 + CPPUNIT_TEST_SUITE_END();
235 +};
236 +
237 +// -----------------------------------------------------------------------------
238 +CPPUNIT_TEST_SUITE_NAMED_REGISTRATION(vector_pool_test, "vector pool test");
239 +
240 +
241 +// -----------------------------------------------------------------------------
242 +
243 +// NOADDITIONAL;
244 +