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.29 by sf-exg, Thu Nov 13 13:58:12 2014 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
… …
16 ++first; 18 ++first;
17 19
18 return first; 20 return first;
19} 21}
20 22
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
30#include <new> 23#include <new>
31 24
32#if __cplusplus >= 201103L 25#if ECB_CPP11
33 #include <type_traits> 26 #include <type_traits>
34#endif 27#endif
35 28
36/* simplevec taken (and heavily modified), from: 29namespace estl
37 * 30{
38 * MICO --- a free CORBA implementation 31#if ESTL_LARGE_MEMORY_MODEL
39 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 32 // should use size_t/ssize_t, but that's not portable enough for us
40 * originally GPLv2 or any later 33 typedef unsigned long size_type;
41 */ 34 typedef long difference_type;
35#else
36 typedef uint32_t size_type;
37 typedef int32_t difference_type;
38#endif
39
40 template<typename T>
41 struct scoped_ptr
42 {
43 T *p;
44
45 scoped_ptr () : p (0) { }
46
47 explicit
48 scoped_ptr (T *a) : p (a) { }
49
50 ~scoped_ptr ()
51 {
52 delete p;
53 }
54
55 void reset (T *a)
56 {
57 delete p;
58 p = a;
59 }
60
61 T *operator ->() const { return p; }
62 T &operator *() const { return *p; }
63
64 operator T *() { return p; }
65 T *get () const { return p; }
66
67 private:
68 scoped_ptr (const scoped_ptr &);
69 scoped_ptr &operator =(const scoped_ptr &);
70 };
71
72 template<typename T>
73 struct scoped_array
74 {
75 T *p;
76
77 scoped_array () : p (0) { }
78
79 explicit
80 scoped_array (T *a) : p (a) { }
81
82 ~scoped_array ()
83 {
84 delete [] p;
85 }
86
87 void reset (T *a)
88 {
89 delete [] p;
90 p = a;
91 }
92
93 operator T *() { return p; }
94 T *get () const { return p; }
95
96 private:
97 scoped_array (const scoped_array &);
98 scoped_array &operator =(const scoped_array &);
99 };
100}
101
102// original version taken from MICO, but this has been completely rewritten
103// known limitations w.r.t. std::vector
104// - many methods missing
105// - no error checking, no exceptions thrown (e.g. at())
106// - size_type is 32bit even on 64 bit hosts, so limited to 2**31 elements
107// - no allocator support
108// - we don't really care about const correctness, but we try
109// - we don't care about namespaces and stupid macros the user might define
110// - no bool specialisation
42template<class T> 111template<class T>
43struct simplevec 112struct simplevec
44{ 113{
114 typedef estl::size_type size_type;
115
116 typedef T value_type;
45 typedef T *iterator; 117 typedef T *iterator;
46 typedef const T *const_iterator; 118 typedef const T *const_iterator;
47 typedef unsigned long size_type; 119 typedef T *pointer;
120 typedef const T *const_pointer;
121 typedef T &reference;
122 typedef const T &const_reference;
123 // missing: allocator_type
124 // missing: reverse iterator
48 125
126private:
127 size_type sze, res;
128 T *buf;
129
130 // we shamelessly optimise for "simple" types. everything
131 // "not simple enough" will use the slow path.
49 static bool is_simple_enough () 132 static bool is_simple_enough ()
50 { 133 {
51 #if __cplusplus >= 201103L 134 #if ECB_CPP11
52 return std::is_trivially_assignable<T, T>::value 135 return std::is_trivially_assignable<T, T>::value
53 && std::is_trivially_constructable<T>::value 136 && std::is_trivially_constructible<T>::value
54 && std::is_trivially_copyable<T>::value 137 && std::is_trivially_copyable<T>::value
55 && std::is_trivially_destructible<T>::value; 138 && std::is_trivially_destructible<T>::value;
56 #elif ECB_GCC_VERSION(4,4) 139 #elif ECB_GCC_VERSION(4,4) || ECB_CLANG_VERSION(2,8)
57 return __has_trivial_assign (T) 140 return __has_trivial_assign (T)
58 && __has_trivial_constructor (T) 141 && __has_trivial_constructor (T)
59 && __has_trivial_copy (T) 142 && __has_trivial_copy (T)
60 && __has_trivial_destructor (T); 143 && __has_trivial_destructor (T);
61 #else 144 #else
62 return 0; 145 return 0;
63 #endif 146 #endif
64 } 147 }
65 148
66private: 149 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 { 150 {
88 if (!is_simple_enough ()) 151 if (!is_simple_enough ())
89 for (size_type i = 0; i < _last; ++i)
90 _buf [i].~T ();
91
92 ::operator delete (_buf);
93 }
94
95 size_type good_size (size_type n)
96 {
97 return max (n, _size ? _size * 2 : 5);
98 }
99
100 // these copy helpers actually use the copy constructor, not assignment
101 static void copy_lower (iterator dst, iterator src, size_type n)
102 {
103 if (is_simple_enough ())
104 memmove (dst, src, sizeof (T) * n);
105 else
106 while (n--) 152 while (n--)
107 new (dst++) T (*src++); 153 new (a++) T ();
108 } 154 }
109 155
110 static void copy_higher (iterator dst, iterator src, size_type n) 156 static void destruct (iterator a, size_type n = 1)
111 { 157 {
112 if (is_simple_enough ()) 158 if (!is_simple_enough ())
113 memmove (dst, src, sizeof (T) * n);
114 else
115 while (n--) 159 while (n--)
116 new (dst + n) T (*(src + n)); 160 (*a++).~T ();
117 } 161 }
118 162
163 template<class I>
164 static void cop_new (iterator a, I b) { new (a) T (*b); }
165 template<class I>
166 static void cop_set (iterator a, I b) { *a = *b ; }
167
168 // MUST copy forwards
169 template<class I>
170 static void copy (iterator dst, I src, size_type n, void (*op)(iterator, I))
171 {
172 while (n--)
173 op (dst++, src++);
174 }
175
119 static void copy (iterator dst, iterator src, size_type n) 176 static void copy (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator))
120 { 177 {
121 if (is_simple_enough ()) 178 if (is_simple_enough ())
122 memcpy (dst, src, sizeof (T) * n); 179 memcpy (dst, src, sizeof (T) * n);
123 else 180 else
124 copy_lower (dst, src, n); 181 copy<iterator> (dst, src, n, op);
182 }
183
184 static T *alloc (size_type n) ecb_cold
185 {
186 return (T *)::operator new ((size_t) (sizeof (T) * n));
187 }
188
189 void dealloc () ecb_cold
190 {
191 destruct (buf, sze);
192 ::operator delete (buf);
193 }
194
195 size_type good_size (size_type n) ecb_cold
196 {
197 return n ? 2UL << ecb_ld32 (n) : 5;
125 } 198 }
126 199
127 void ins (iterator where, size_type n) 200 void ins (iterator where, size_type n)
128 { 201 {
129 if (_last + n <= _size) 202 size_type pos = where - begin ();
130 copy_higher (where + n, where, end () - where); 203
204 if (ecb_expect_false (sze + n > res))
205 {
206 res = good_size (sze + n);
207
208 T *nbuf = alloc (res);
209 copy (nbuf, buf, sze, cop_new);
210 dealloc ();
211 buf = nbuf;
212 }
213
214 construct (buf + sze, n);
215
216 iterator src = buf + pos;
217 if (is_simple_enough ())
218 memmove (src + n, src, sizeof (T) * (sze - pos));
219 else
220 for (size_type i = sze - pos; i--; )
221 cop_set (src + n + i, src + i);
222
223 sze += n;
224 }
225
226public:
227 size_type capacity () const { return res; }
228 size_type size () const { return sze; }
229 bool empty () const { return size () == 0; }
230
231 size_t max_size () const
232 {
233 return (~(size_type)0) >> 1;
234 }
235
236 const_iterator begin () const { return &buf [ 0]; }
237 iterator begin () { return &buf [ 0]; }
238 const_iterator end () const { return &buf [sze ]; }
239 iterator end () { return &buf [sze ]; }
240 const_reference front () const { return buf [ 0]; }
241 reference front () { return buf [ 0]; }
242 const_reference back () const { return buf [sze - 1]; }
243 reference back () { return buf [sze - 1]; }
244
245 void reserve (size_type sz)
246 {
247 if (ecb_expect_true (sz <= res))
248 return;
249
250 sz = good_size (sz);
251 T *nbuf = alloc (sz);
252
253 copy (nbuf, begin (), sze, cop_new);
254 dealloc ();
255
256 buf = nbuf;
257 res = sz;
258 }
259
260 void resize (size_type sz)
261 {
262 reserve (sz);
263
264 if (is_simple_enough ())
265 sze = sz;
131 else 266 else
132 { 267 {
133 size_type sz = _last + n; 268 while (sze < sz) construct (buf + sze++);
134 sz = good_size (sz); 269 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 } 270 }
147 } 271 }
148 272
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 () 273 simplevec ()
184 : _last(0), _size(0), _buf(0) 274 : sze(0), res(0), buf(0)
185 { 275 {
186 } 276 }
187 277
188 simplevec (size_type n, const T& t = T ()) 278 simplevec (size_type n, const T &t = T ())
189 : _last(0), _size(0), _buf(0)
190 { 279 {
191 insert (begin (), n, t); 280 sze = res = n;
281 buf = alloc (sze);
282
283 while (n--)
284 new (buf + n) T (t);
192 } 285 }
193 286
194 simplevec (const_iterator first, const_iterator last) 287 simplevec (const_iterator first, const_iterator last)
195 : _last(0), _size(0), _buf(0)
196 { 288 {
197 insert (begin (), first, last); 289 sze = res = last - first;
290 buf = alloc (sze);
291 copy (buf, first, sze, cop_new);
198 } 292 }
199 293
200 simplevec (const simplevec<T> &v) 294 simplevec (const simplevec<T> &v)
201 : _last(0), _size(0), _buf(0) 295 : sze(0), res(0), buf(0)
202 { 296 {
203 insert (begin (), v.begin (), v.end ()); 297 sze = res = v.size ();
298 buf = alloc (sze);
299 copy (buf, v.begin (), sze, cop_new);
300 }
301
302 ~simplevec ()
303 {
304 dealloc ();
305 }
306
307 void swap (simplevec<T> &t)
308 {
309 ::swap (sze, t.sze);
310 ::swap (res, t.res);
311 ::swap (buf, t.buf);
312 }
313
314 void clear ()
315 {
316 destruct (buf, sze);
317 sze = 0;
318 }
319
320 void push_back (const T &t)
321 {
322 reserve (sze + 1);
323 new (buf + sze++) T (t);
324 }
325
326 void pop_back ()
327 {
328 destruct (buf + --sze);
329 }
330
331 const_reference operator [](size_type idx) const { return buf[idx]; }
332 reference operator [](size_type idx) { return buf[idx]; }
333
334 const_reference at (size_type idx) const { return buf [idx]; }
335 reference at (size_type idx) { return buf [idx]; }
336
337 void assign (const_iterator first, const_iterator last)
338 {
339 simplevec<T> v (first, last);
340 swap (v);
341 }
342
343 void assign (size_type n, const T &t)
344 {
345 simplevec<T> v (n, t);
346 swap (v);
204 } 347 }
205 348
206 simplevec<T> &operator= (const simplevec<T> &v) 349 simplevec<T> &operator= (const simplevec<T> &v)
207 { 350 {
208 if (this != &v) 351 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; 352 return *this;
222 } 353 }
223 354
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) 355 iterator insert (iterator pos, const T &t)
259 { 356 {
260 size_type at = pos - begin (); 357 size_type at = pos - begin ();
358
261 ins (pos, 1); 359 ins (pos, 1);
262 pos = begin () + at; 360 buf [at] = t;
263 *pos = t; 361
264 ++_last; 362 return buf + at;
265 return pos;
266 } 363 }
267 364
268 iterator insert (iterator pos, const_iterator first, const_iterator last) 365 iterator insert (iterator pos, const_iterator first, const_iterator last)
269 { 366 {
270 size_type n = last - first; 367 size_type n = last - first;
271 size_type at = pos - begin (); 368 size_type at = pos - begin ();
272 369
273 if (n > 0)
274 {
275 ins (pos, n); 370 ins (pos, n);
276 _last += n; 371 copy (buf + at, first, n, cop_set);
277 copy (pos, first, n);
278 }
279 372
280 return pos; 373 return buf + at;
281 } 374 }
282 375
283 iterator insert (iterator pos, size_type n, const T &t) 376 iterator insert (iterator pos, size_type n, const T &t)
284 { 377 {
285 size_type at = pos - begin (); 378 size_type at = pos - begin ();
286 379
287 if (n > 0)
288 {
289 ins (pos, n); 380 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 381
296 return pos; 382 for (iterator i = buf + at; n--; )
297 } 383 *i++ = t;
298 384
385 return buf + at;
386 }
387
299 void erase (iterator first, iterator last) 388 iterator erase (iterator first, iterator last)
300 { 389 {
301 if (last != first) 390 size_type n = last - first;
302 { 391 size_type c = end () - last;
392
303 if (!is_simple_enough ()) 393 if (is_simple_enough ())
304 for (iterator i = first; i < last; ++i) 394 memmove (first, last, sizeof (T) * c);
305 i->~T (); 395 else
396 copy (first, last, c, cop_set);
306 397
307 copy_lower (last, first, end () - last); 398 sze -= n;
399 destruct (buf + sze, n);
308 400
309 _last -= last - first; 401 return first;
310 }
311 } 402 }
312 403
313 void erase (iterator pos) 404 iterator erase (iterator pos)
314 { 405 {
315 if (pos != end ()) 406 if (pos != end ())
316 erase (pos, pos + 1); 407 erase (pos, pos + 1);
317 }
318 408
319 void swap (simplevec<T> &t) 409 return pos;
320 {
321 ::swap (_last, t._last);
322 ::swap (_size, t._size);
323 ::swap (_buf , t._buf );
324 } 410 }
325}; 411};
326 412
327template<class T> 413template<class T>
328bool operator ==(const simplevec<T> &v1, const simplevec<T> &v2) 414bool operator ==(const simplevec<T> &v1, const simplevec<T> &v2)

Diff Legend

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