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.12 by root, Sat May 19 01:57:09 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 (e.g. at())
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
37// - no bool specialisation
42template<class T> 38template<class T>
43struct simplevec 39struct simplevec
44{ 40{
41#if ESTL_BIG_VECTOR
42 // shoudl use size_t/ssize_t, but that's not portable enough for us
43 typedef unsigned long size_type;
44 typedef long difference_type;
45#else
46 typedef uint32_t size_type;
47 typedef int32_t difference_type;
48#endif
49
50 typedef T value_type;
45 typedef T *iterator; 51 typedef T *iterator;
46 typedef const T *const_iterator; 52 typedef const T *const_iterator;
47 typedef unsigned long size_type; 53 typedef T *pointer;
54 typedef const T *const_pointer;
55 typedef T &reference;
56 typedef const T &const_reference;
57 // missing: allocator_type
58 // missing: reverse iterator
48 59
60private:
61 size_type sze, res;
62 T *buf;
63
64 // we shamelessly optimise for "simple" types. everything
65 // "not simple enough" will use the slow path.
49 static bool is_simple_enough () 66 static bool is_simple_enough ()
50 { 67 {
68 return 1; // we are not there yet
51 #if __cplusplus >= 201103L 69 #if __cplusplus >= 201103L
52 return std::is_trivially_assignable<T, T>::value 70 return std::is_trivially_assignable<T, T>::value
53 && std::is_trivially_constructable<T>::value 71 && std::is_trivially_constructable<T>::value
54 && std::is_trivially_copyable<T>::value 72 && std::is_trivially_copyable<T>::value
55 && std::is_trivially_destructible<T>::value; 73 && std::is_trivially_destructible<T>::value;
… …
61 #else 79 #else
62 return 0; 80 return 0;
63 #endif 81 #endif
64 } 82 }
65 83
66private: 84 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 { 85 {
88 if (!is_simple_enough ()) 86 if (!is_simple_enough ())
89 for (size_type i = 0; i < _last; ++i) 87 while (n--)
90 _buf [i].~T (); 88 new (*a++) T ();
91
92 ::operator delete (_buf);
93 } 89 }
94 90
95 size_type good_size (size_type n) 91 static void destruct (iterator a, size_type n = 1)
96 { 92 {
97 return max (n, _size ? _size * 2 : 5); 93 if (!is_simple_enough ())
94 while (n--)
95 (*a++).~T ();
98 } 96 }
99 97
100 // these copy helpers actually use the copy constructor, not assignment 98 template<class I>
99 static void cop_new (iterator a, I b) { new (a) T (*b); }
100 template<class I>
101 static void cop_set (iterator a, I b) { *a = *b ; }
102
103 template<class I>
104 static void copy_lower (iterator dst, I src, size_type n, void (*op)(iterator, I ) = cop_new)
105 {
106 while (n--)
107 op (dst++, src++);
108 }
109
101 static void copy_lower (iterator dst, iterator src, size_type n) 110 static void copy_lower (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator) = cop_new)
111 {
112 if (is_simple_enough ())
113 memmove (dst, src, sizeof (T) * n);
114 else
115 copy_lower<iterator> (dst, src, n, cop_new);
116 }
117
118 static void copy_higher (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator) = cop_new)
102 { 119 {
103 if (is_simple_enough ()) 120 if (is_simple_enough ())
104 memmove (dst, src, sizeof (T) * n); 121 memmove (dst, src, sizeof (T) * n);
105 else 122 else
106 while (n--) 123 while (n--)
107 new (dst++) T (*src++);
108 }
109
110 static void copy_higher (iterator dst, iterator src, size_type n)
111 {
112 if (is_simple_enough ())
113 memmove (dst, src, sizeof (T) * n);
114 else
115 while (n--)
116 new (dst + n) T (*(src + n)); 124 op (dst + n, src + n);
117 } 125 }
118 126
119 static void copy (iterator dst, iterator src, size_type n) 127 template<class I>
128 static void copy (iterator dst, I src, size_type n, void (*op)(iterator, I) = cop_new)
129 {
130 copy_lower<I> (dst, src, n, op);
131 }
132
133 static void copy (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator) = cop_new)
120 { 134 {
121 if (is_simple_enough ()) 135 if (is_simple_enough ())
122 memcpy (dst, src, sizeof (T) * n); 136 memcpy (dst, src, sizeof (T) * n);
123 else 137 else
124 copy_lower (dst, src, n); 138 copy<iterator> (dst, src, n, op);
139 }
140
141 static T *alloc (size_type n) ecb_cold
142 {
143 return (T *)::operator new ((size_t) (sizeof (T) * n));
144 }
145
146 void dealloc () ecb_cold
147 {
148 destruct (buf, sze);
149 ::operator delete (buf);
150 }
151
152 size_type good_size (size_type n) ecb_cold
153 {
154 return n ? 2UL << ecb_ld32 (n) : 5;
125 } 155 }
126 156
127 void ins (iterator where, size_type n) 157 void ins (iterator where, size_type n)
128 { 158 {
129 if (_last + n <= _size) 159 size_type pos = where - begin ();
130 copy_higher (where + n, where, end () - where); 160
161 if (ecb_expect_false (sze + n > res))
162 {
163 res = good_size (sze + n);
164
165 T *nbuf = alloc (res);
166 copy (nbuf, buf, sze, cop_new);
167 dealloc ();
168 buf = nbuf;
169 }
170
171 construct (buf + sze, n);
172 copy_higher (buf + pos + n, buf + pos, sze - pos, cop_set);
173 sze += n;
174 }
175
176public:
177 size_type capacity () const { return res; }
178 size_type size () const { return sze; }
179 bool empty () const { return size () == 0; }
180
181 size_t max_size () const
182 {
183 return (~(size_type)0) >> 1;
184 }
185
186 const_iterator begin () const { return &buf [ 0]; }
187 iterator begin () { return &buf [ 0]; }
188 const_iterator end () const { return &buf [sze ]; }
189 iterator end () { return &buf [sze ]; }
190 const_reference front () const { return buf [ 0]; }
191 reference front () { return buf [ 0]; }
192 const_reference back () const { return buf [sze - 1]; }
193 reference back () { return buf [sze - 1]; }
194
195 void reserve (size_type sz)
196 {
197 if (ecb_expect_true (sz <= res))
198 return;
199
200 sz = good_size (sz);
201 T *nbuf = alloc (sz);
202
203 copy (nbuf, begin (), sze);
204 dealloc ();
205
206 buf = nbuf;
207 res = sz;
208 }
209
210 void resize (size_type sz)
211 {
212 reserve (sz);
213
214 if (is_simple_enough ())
215 sze = sz;
131 else 216 else
132 { 217 {
133 size_type sz = _last + n; 218 while (sze < sz) construct (buf + sze++);
134 sz = good_size (sz); 219 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 } 220 }
147 } 221 }
148 222
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 () 223 simplevec ()
184 : _last(0), _size(0), _buf(0) 224 : sze(0), res(0), buf(0)
185 { 225 {
186 } 226 }
187 227
188 simplevec (size_type n, const T& t = T ()) 228 simplevec (size_type n, const T &t = T ())
189 : _last(0), _size(0), _buf(0)
190 { 229 {
191 insert (begin (), n, t); 230 sze = res = n;
192 } 231 buf = alloc (sze);
193 232
194 simplevec (const_iterator first, const_iterator last) 233 while (n--)
195 : _last(0), _size(0), _buf(0) 234 new (buf + n) T (t);
235 }
236
237 template<class I>
238 simplevec (I first, I last)
196 { 239 {
197 insert (begin (), first, last); 240 sze = res = last - first;
241 buf = alloc (sze);
242 copy (buf, first, sze);
198 } 243 }
199 244
200 simplevec (const simplevec<T> &v) 245 simplevec (const simplevec<T> &v)
201 : _last(0), _size(0), _buf(0) 246 : sze(0), res(0), buf(0)
202 { 247 {
203 insert (begin (), v.begin (), v.end ()); 248 sze = res = v.size ();
249 buf = alloc (sze);
250 copy (buf, v.begin (), sze);
251 }
252
253 ~simplevec ()
254 {
255 dealloc ();
256 }
257
258 void swap (simplevec<T> &t)
259 {
260 ::swap (sze, t.sze);
261 ::swap (res, t.res);
262 ::swap (buf, t.buf);
263 }
264
265 void clear ()
266 {
267 destruct (buf, sze);
268 sze = 0;
269 }
270
271 void push_back (const T &t)
272 {
273 reserve (sze + 1);
274 new (buf + sze++) T (t);
275 }
276
277 void pop_back ()
278 {
279 destruct (buf + --sze);
280 }
281
282 const_reference operator [](size_type idx) const { return buf[idx]; }
283 reference operator [](size_type idx) { return buf[idx]; }
284
285 const_reference at (size_type idx) const { return buf [idx]; }
286 reference at (size_type idx) { return buf [idx]; }
287
288 template<class I>
289 void assign (I first, I last)
290 {
291 swap (simplevec<T> (first, last));
292 }
293
294 void assign (size_type n, const T &t)
295 {
296 swap (simplevec<T> (n, t));
204 } 297 }
205 298
206 simplevec<T> &operator= (const simplevec<T> &v) 299 simplevec<T> &operator= (const simplevec<T> &v)
207 { 300 {
208 if (this != &v) 301 assign (v.begin (), v.end ());
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; 302 return *this;
222 } 303 }
223 304
224 ~simplevec ()
225 {
226 dealloc ();
227 }
228
229 const T &front () const { return _buf[ 0]; }
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 {
236 return _last == 0;
237 }
238
239 void clear ()
240 {
241 _last = 0;
242 }
243
244 void push_back (const T &t)
245 {
246 reserve (_last + 1);
247 new (_buf + _last++) T (t);
248 }
249
250 void pop_back ()
251 {
252 --_last;
253 }
254
255 const T &operator [](size_type idx) const { return _buf[idx]; }
256 T &operator [](size_type idx) { return _buf[idx]; }
257
258 iterator insert (iterator pos, const T &t) 305 iterator insert (iterator pos, const T &t)
259 { 306 {
260 size_type at = pos - begin (); 307 size_type at = pos - begin ();
308
261 ins (pos, 1); 309 ins (pos, 1);
262 pos = begin () + at; 310 buf [at] = t;
263 *pos = t;
264 ++_last;
265 return pos;
266 }
267 311
312 return buf + at;
313 }
314
315 template<class I>
268 iterator insert (iterator pos, const_iterator first, const_iterator last) 316 iterator insert (iterator pos, I first, I last)
269 { 317 {
270 size_type n = last - first; 318 size_type n = last - first;
271 size_type at = pos - begin (); 319 size_type at = pos - begin ();
272 320
273 if (n > 0)
274 {
275 ins (pos, n); 321 ins (pos, n);
276 _last += n; 322 copy (buf + at, first, n, cop_set);
277 copy (pos, first, n);
278 }
279 323
280 return pos; 324 return buf + at;
281 } 325 }
282 326
283 iterator insert (iterator pos, size_type n, const T &t) 327 iterator insert (iterator pos, size_type n, const T &t)
284 { 328 {
285 size_type at = pos - begin (); 329 size_type at = pos - begin ();
286 330
287 if (n > 0)
288 {
289 ins (pos, n); 331 ins (pos, n);
290 pos = begin () + at;
291 for (size_type i = 0; i < n; ++i)
292 pos[i] = t;
293 _last += n;
294 }
295 332
296 return pos; 333 for (iterator i = buf + at; n--; )
334 *i++ = t;
335
336 return buf + at;
297 } 337 }
298 338
299 void erase (iterator first, iterator last) 339 void erase (iterator first, iterator last)
300 { 340 {
301 if (last != first) 341 size_t n = last - first;
302 {
303 if (!is_simple_enough ())
304 for (iterator i = first; i < last; ++i)
305 i->~T ();
306 342
307 copy_lower (last, first, end () - last); 343 copy_lower (last, first, end () - last, cop_set);
308 344 sze -= n;
309 _last -= last - first; 345 destruct (buf + sze, n);
310 }
311 } 346 }
312 347
313 void erase (iterator pos) 348 void erase (iterator pos)
314 { 349 {
315 if (pos != end ()) 350 if (pos != end ())
316 erase (pos, pos + 1); 351 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 } 352 }
325}; 353};
326 354
327template<class T> 355template<class T>
328bool operator ==(const simplevec<T> &v1, const simplevec<T> &v2) 356bool operator ==(const simplevec<T> &v1, const simplevec<T> &v2)

Diff Legend

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