ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libptytty/src/estl.h
(Generate patch)

Comparing libptytty/src/estl.h (file contents):
Revision 1.8 by root, Fri May 18 00:10:51 2012 UTC vs.
Revision 1.9 by root, Sat May 19 01:03:36 2012 UTC

… …
2#define ESTL_H_ 2#define ESTL_H_
3 3
4#include <stdlib.h> 4#include <stdlib.h>
5#include <string.h> 5#include <string.h>
6 6
7#include "ecb.h"
8
7template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 9template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
8template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 10template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
9 11
10template<typename T, typename U> static inline void swap (T& a, U& b) { T t = a; a = (T)b; b = (U)t; } 12template<typename T, typename U> static inline void swap (T& a, U& b) { T t = a; a = (T)b; b = (U)t; }
11 13
… …
15 while (first != last && *first != value) 17 while (first != last && *first != value)
16 ++first; 18 ++first;
17 19
18 return first; 20 return first;
19} 21}
20
21// see ecb.h for details
22#ifndef ECB_GCC_VERSION
23 #if !defined __GNUC_MINOR__ || defined __INTEL_COMPILER || defined __SUNPRO_C || defined __SUNPRO_CC || defined __llvm__ || defined __clang__
24 #define ECB_GCC_VERSION(major,minor) 0
25 #else
26 #define ECB_GCC_VERSION(major,minor) (__GNUC__ > (major) || (__GNUC__ == (major) && __GNUC_MINOR__ >= (minor)))
27 #endif
28#endif
29 22
30#include <new> 23#include <new>
31 24
32#if __cplusplus >= 201103L 25#if __cplusplus >= 201103L
33 #include <type_traits> 26 #include <type_traits>
34#endif 27#endif
35 28
36/* simplevec taken (and heavily modified), from: 29// original version taken from MICO, but this has been completely rewritten
37 * 30// known limitations w.r.t. std::vector
38 * MICO --- a free CORBA implementation 31// - many methods missing
39 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 32// - no error checking, no exceptions thrown
40 * originally GPLv2 or any later 33// - size_type is 32bit even on 64 bit hosts, so limited to 2**31 elements
41 */ 34// - no allocator support
35// - we don't really care about const correctness, but we try
36// - we don't care about namespaces and stupid macros the user might define
42template<class T> 37template<class T>
43struct simplevec 38struct simplevec
44{ 39{
40#if ESTL_BIG_VECTOR
41 // shoudl use size_t/ssize_t, but that's not portable enough for us
42 typedef unsigned long size_type;
43 typedef long difference_type;
44#else
45 typedef uint32_t size_type;
46 typedef int32_t difference_type;
47#endif
48
49 typedef T value_type;
45 typedef T *iterator; 50 typedef T *iterator;
46 typedef const T *const_iterator; 51 typedef const T *const_iterator;
47 typedef unsigned long size_type; 52 typedef T *pointer;
53 typedef const T *const_pointer;
54 typedef T &reference;
55 typedef const T &const_reference;
56 // missing: allocator_type
57 // missing: reverse iterator
48 58
59private:
60 size_type sze, res;
61 T *buf;
62
63 // we shamelessly optimise for "simple" types. everything
64 // "not simple enough" will use the slow path.
49 static bool is_simple_enough () 65 static bool is_simple_enough ()
50 { 66 {
67 return 1; // we are not there yet
51 #if __cplusplus >= 201103L 68 #if __cplusplus >= 201103L
52 return std::is_trivially_assignable<T, T>::value 69 return std::is_trivially_assignable<T, T>::value
53 && std::is_trivially_constructable<T>::value 70 && std::is_trivially_constructable<T>::value
54 && std::is_trivially_copyable<T>::value 71 && std::is_trivially_copyable<T>::value
55 && std::is_trivially_destructible<T>::value; 72 && std::is_trivially_destructible<T>::value;
… …
61 #else 78 #else
62 return 0; 79 return 0;
63 #endif 80 #endif
64 } 81 }
65 82
66private: 83 static void construct (iterator a, size_type n = 1)
67 size_type _last, _size;
68 T *_buf;
69
70public:
71 const_iterator begin () const { return &_buf[0]; }
72 iterator begin () { return &_buf[0]; }
73
74 const_iterator end () const { return &_buf[_last]; }
75 iterator end () { return &_buf[_last]; }
76
77 size_type capacity () const { return _size; }
78 size_type size () const { return _last; }
79
80private:
81 static T *alloc (size_type n)
82 {
83 return (T *)::operator new ((size_t) (n * sizeof (T)));
84 }
85
86 void dealloc ()
87 { 84 {
88 if (!is_simple_enough ()) 85 if (!is_simple_enough ())
89 for (size_type i = 0; i < _last; ++i) 86 while (n--)
90 _buf [i].~T (); 87 new (*a++) T ();
91
92 ::operator delete (_buf);
93 } 88 }
94 89
95 size_type good_size (size_type n) 90 static void destruct (iterator a, size_type n = 1)
96 { 91 {
97 return max (n, _size ? _size * 2 : 5); 92 if (!is_simple_enough ())
93 while (n--)
94 (*a++).~T ();
98 } 95 }
96
97 static void cop_new (iterator a, iterator b) { new (a) T (*b); }
98 static void cop_set (iterator a, iterator b) { *a = *b ; }
99 99
100 // these copy helpers actually use the copy constructor, not assignment 100 // these copy helpers actually use the copy constructor, not assignment
101 static void copy_lower (iterator dst, iterator src, size_type n) 101 static void copy_lower (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator) = cop_new)
102 { 102 {
103 if (is_simple_enough ()) 103 if (is_simple_enough ())
104 memmove (dst, src, sizeof (T) * n); 104 memmove (dst, src, sizeof (T) * n);
105 else 105 else
106 while (n--) 106 while (n--)
107 new (dst++) T (*src++); 107 op (dst++, src++);
108 } 108 }
109 109
110 static void copy_higher (iterator dst, iterator src, size_type n) 110 static void copy_higher (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator) = cop_new)
111 { 111 {
112 if (is_simple_enough ()) 112 if (is_simple_enough ())
113 memmove (dst, src, sizeof (T) * n); 113 memmove (dst, src, sizeof (T) * n);
114 else 114 else
115 while (n--) 115 while (n--)
116 new (dst + n) T (*(src + n)); 116 op (dst + n, src + n);
117 } 117 }
118 118
119 static void copy (iterator dst, iterator src, size_type n) 119 static void copy (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator) = cop_new)
120 { 120 {
121 if (is_simple_enough ()) 121 if (is_simple_enough ())
122 memcpy (dst, src, sizeof (T) * n); 122 memcpy (dst, src, sizeof (T) * n);
123 else 123 else
124 copy_lower (dst, src, n); 124 copy_lower (dst, src, n, op);
125 }
126
127 static T *alloc (size_type n) ecb_cold
128 {
129 return (T *)::operator new ((size_t) (sizeof (T) * n));
130 }
131
132 void dealloc () ecb_cold
133 {
134 destruct (buf, sze);
135 ::operator delete (buf);
136 }
137
138 size_type good_size (size_type n) ecb_cold
139 {
140 return n ? 2UL << ecb_ld32 (n) : 5;
125 } 141 }
126 142
127 void ins (iterator where, size_type n) 143 void ins (iterator where, size_type n)
128 { 144 {
129 if (_last + n <= _size) 145 size_type pos = where - begin ();
130 copy_higher (where + n, where, end () - where); 146
147 if (ecb_expect_false (sze + n > res))
148 {
149 res = good_size (sze + n);
150
151 T *nbuf = alloc (res);
152 copy (nbuf, buf, sze, cop_new);
153 dealloc ();
154 buf = nbuf;
155 }
156
157 construct (buf + sze, n);
158 copy_higher (buf + pos + n, buf + pos, sze - pos, cop_set);
159 sze += n;
160 }
161
162public:
163 size_type capacity () const { return res; }
164 size_type size () const { return sze; }
165 bool empty () const { return size () == 0; }
166
167 const_iterator begin () const { return &buf [ 0]; }
168 iterator begin () { return &buf [ 0]; }
169 const_iterator end () const { return &buf [sze ]; }
170 iterator end () { return &buf [sze ]; }
171 const_reference front () const { return buf [ 0]; }
172 reference front () { return buf [ 0]; }
173 const_reference back () const { return buf [sze - 1]; }
174 reference back () { return buf [sze - 1]; }
175
176 void reserve (size_type sz)
177 {
178 if (ecb_expect_true (sz <= res))
179 return;
180
181 sz = good_size (sz);
182 T *nbuf = alloc (sz);
183
184 copy (nbuf, begin (), sze);
185 dealloc ();
186
187 buf = nbuf;
188 res = sz;
189 }
190
191 void resize (size_type sz)
192 {
193 reserve (sz);
194
195 if (is_simple_enough ())
196 sze = sz;
131 else 197 else
132 { 198 {
133 size_type sz = _last + n; 199 while (sze < sz) construct (buf + sze++);
134 sz = good_size (sz); 200 while (sze > sz) destruct (buf + --sze);
135 T *nbuf = alloc (sz);
136
137 if (_buf)
138 {
139 copy (nbuf, begin (), where - begin ());
140 copy (nbuf + (where - begin ()) + n, where, end () - where);
141 dealloc ();
142 }
143
144 _buf = nbuf;
145 _size = sz;
146 } 201 }
147 } 202 }
148 203
149public:
150 void reserve (size_type sz)
151 {
152 if (_size < sz)
153 {
154 sz = good_size (sz);
155 T *nbuf = alloc (sz);
156
157 if (_buf)
158 {
159 copy (nbuf, begin (), _last);
160 dealloc ();
161 }
162
163 _buf = nbuf;
164 _size = sz;
165 }
166 }
167
168 void resize (size_type sz)
169 {
170 reserve (sz);
171
172 if (is_simple_enough ())
173 _last = sz;
174 else
175 {
176 while (_last < sz)
177 new (_buf + _last++) T ();
178 while (_last > sz)
179 _buf [--_last].~T ();
180 }
181 }
182
183 simplevec () 204 simplevec ()
184 : _last(0), _size(0), _buf(0) 205 : sze(0), res(0), buf(0)
185 { 206 {
186 } 207 }
187 208
188 simplevec (size_type n, const T& t = T ()) 209 simplevec (size_type n, const T &t = T ())
189 : _last(0), _size(0), _buf(0) 210 : sze(0), res(0), buf(0)
190 { 211 {
191 insert (begin (), n, t); 212 insert (begin (), n, t);
192 } 213 }
193 214
194 simplevec (const_iterator first, const_iterator last) 215 simplevec (const_iterator first, const_iterator last)
195 : _last(0), _size(0), _buf(0) 216 : sze(0), res(0), buf(0)
196 { 217 {
197 insert (begin (), first, last); 218 insert (begin (), first, last);
198 } 219 }
199 220
200 simplevec (const simplevec<T> &v) 221 simplevec (const simplevec<T> &v)
201 : _last(0), _size(0), _buf(0) 222 : sze(0), res(0), buf(0)
202 { 223 {
203 insert (begin (), v.begin (), v.end ()); 224 insert (begin (), v.begin (), v.end ());
204 } 225 }
205 226
206 simplevec<T> &operator= (const simplevec<T> &v) 227 simplevec<T> &operator= (const simplevec<T> &v)
207 { 228 {
208 if (this != &v) 229 swap (simplevec<T> (v));
209 {
210
211 dealloc ();
212 _size = 0;
213 _buf = 0;
214 _last = 0;
215 reserve (v._last);
216
217 copy (_buf, v.begin (), v.size ());
218 _last = v._last;
219 }
220
221 return *this; 230 return *this;
222 } 231 }
223 232
224 ~simplevec () 233 ~simplevec ()
225 { 234 {
226 dealloc (); 235 dealloc ();
227 } 236 }
228 237
229 const T &front () const { return _buf[ 0]; } 238 void swap (simplevec<T> &t)
230 T &front () { return _buf[ 0]; }
231 const T &back () const { return _buf[_last-1]; }
232 T &back () { return _buf[_last-1]; }
233
234 bool empty () const
235 { 239 {
236 return _last == 0; 240 ::swap (sze, t.sze);
241 ::swap (res, t.res);
242 ::swap (buf, t.buf);
237 } 243 }
238 244
239 void clear () 245 void clear ()
240 { 246 {
247 destruct (buf, sze);
241 _last = 0; 248 sze = 0;
242 } 249 }
243 250
244 void push_back (const T &t) 251 void push_back (const T &t)
245 { 252 {
246 reserve (_last + 1); 253 reserve (sze + 1);
247 new (_buf + _last++) T (t); 254 new (buf + sze++) T (t);
248 } 255 }
249 256
250 void pop_back () 257 void pop_back ()
251 { 258 {
252 --_last; 259 destruct (buf + --sze);
253 } 260 }
254 261
255 const T &operator [](size_type idx) const { return _buf[idx]; } 262 const T &operator [](size_type idx) const { return buf[idx]; }
256 T &operator [](size_type idx) { return _buf[idx]; } 263 T &operator [](size_type idx) { return buf[idx]; }
257 264
258 iterator insert (iterator pos, const T &t) 265 iterator insert (iterator pos, const T &t)
259 { 266 {
260 size_type at = pos - begin (); 267 size_type at = pos - begin ();
261 ins (pos, 1); 268 ins (pos, 1);
262 pos = begin () + at;
263 *pos = t; 269 buf [pos] = t;
264 ++_last;
265 return pos; 270 return pos;
266 } 271 }
267 272
268 iterator insert (iterator pos, const_iterator first, const_iterator last) 273 iterator insert (iterator pos, const_iterator first, const_iterator last)
269 { 274 {
270 size_type n = last - first; 275 size_type n = last - first;
271 size_type at = pos - begin (); 276 size_type at = pos - begin ();
272 277
273 if (n > 0)
274 {
275 ins (pos, n); 278 ins (pos, n);
276 _last += n;
277 copy (pos, first, n); 279 copy (pos, first, n, cop_set);
278 }
279 280
280 return pos; 281 return pos;
281 } 282 }
282 283
283 iterator insert (iterator pos, size_type n, const T &t) 284 iterator insert (iterator pos, size_type n, const T &t)
284 { 285 {
285 size_type at = pos - begin (); 286 size_type at = pos - begin ();
286 287
287 if (n > 0)
288 {
289 ins (pos, n); 288 ins (pos, n);
290 pos = begin () + at; 289
291 for (size_type i = 0; i < n; ++i) 290 for (size_type i = 0; i < n; ++i)
292 pos[i] = t; 291 buf [at + i] = t;
293 _last += n;
294 }
295 292
296 return pos; 293 return pos;
297 } 294 }
298 295
299 void erase (iterator first, iterator last) 296 void erase (iterator first, iterator last)
300 { 297 {
301 if (last != first) 298 size_t n = last - first;
302 {
303 if (!is_simple_enough ())
304 for (iterator i = first; i < last; ++i)
305 i->~T ();
306 299
307 copy_lower (last, first, end () - last); 300 copy_lower (last, first, end () - last, cop_set);
308 301 sze -= n;
309 _last -= last - first; 302 destruct (buf + sze, n);
310 }
311 } 303 }
312 304
313 void erase (iterator pos) 305 void erase (iterator pos)
314 { 306 {
315 if (pos != end ()) 307 if (pos != end ())
316 erase (pos, pos + 1); 308 erase (pos, pos + 1);
317 }
318
319 void swap (simplevec<T> &t)
320 {
321 ::swap (_last, t._last);
322 ::swap (_size, t._size);
323 ::swap (_buf , t._buf );
324 } 309 }
325}; 310};
326 311
327template<class T> 312template<class T>
328bool operator ==(const simplevec<T> &v1, const simplevec<T> &v2) 313bool operator ==(const simplevec<T> &v1, const simplevec<T> &v2)

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines