ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/util.h
(Generate patch)

Comparing deliantra/server/include/util.h (file contents):
Revision 1.47 by root, Sat Jun 2 03:48:29 2007 UTC vs.
Revision 1.86 by root, Sat Jan 3 01:04:19 2009 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * 5 *
6 * Crossfire TRT is free software; you can redistribute it and/or modify it 6 * Deliantra is free software: you can redistribute it and/or modify
7 * under the terms of the GNU General Public License as published by the Free 7 * it under the terms of the GNU General Public License as published by
8 * Software Foundation; either version 2 of the License, or (at your option) 8 * the Free Software Foundation, either version 3 of the License, or
9 * any later version. 9 * (at your option) any later version.
10 * 10 *
11 * This program is distributed in the hope that it will be useful, but 11 * This program is distributed in the hope that it will be useful,
12 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * for more details. 14 * GNU General Public License for more details.
15 * 15 *
16 * You should have received a copy of the GNU General Public License along 16 * You should have received a copy of the GNU General Public License
17 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 * 18 *
20 * The authors can be reached via e-mail to <crossfire@schmorp.de> 19 * The authors can be reached via e-mail to <support@deliantra.net>
21 */ 20 */
22 21
23#ifndef UTIL_H__ 22#ifndef UTIL_H__
24#define UTIL_H__ 23#define UTIL_H__
25 24
26//#define PREFER_MALLOC 25#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
26#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
27#define PREFER_MALLOC 0 // use malloc and not the slice allocator
27 28
28#if __GNUC__ >= 3 29#if __GNUC__ >= 3
29# define is_constant(c) __builtin_constant_p (c) 30# define is_constant(c) __builtin_constant_p (c)
30# define expect(expr,value) __builtin_expect ((expr),(value)) 31# define expect(expr,value) __builtin_expect ((expr),(value))
31# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) 32# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
33# define noinline __attribute__((__noinline__))
32#else 34#else
33# define is_constant(c) 0 35# define is_constant(c) 0
34# define expect(expr,value) (expr) 36# define expect(expr,value) (expr)
35# define prefetch(addr,rw,locality) 37# define prefetch(addr,rw,locality)
38# define noinline
36#endif 39#endif
37 40
38#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) 41#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4)
39# define decltype(x) typeof(x) 42# define decltype(x) typeof(x)
40#endif 43#endif
41 44
42// put into ifs if you are very sure that the expression 45// put into ifs if you are very sure that the expression
43// is mostly true or mosty false. note that these return 46// is mostly true or mosty false. note that these return
44// booleans, not the expression. 47// booleans, not the expression.
45#define expect_false(expr) expect ((expr) != 0, 0) 48#define expect_false(expr) expect ((expr) ? 1 : 0, 0)
46#define expect_true(expr) expect ((expr) != 0, 1) 49#define expect_true(expr) expect ((expr) ? 1 : 0, 1)
50
51#include <pthread.h>
47 52
48#include <cstddef> 53#include <cstddef>
49#include <cmath> 54#include <cmath>
50#include <new> 55#include <new>
51#include <vector> 56#include <vector>
… …
53#include <glib.h> 58#include <glib.h>
54 59
55#include <shstr.h> 60#include <shstr.h>
56#include <traits.h> 61#include <traits.h>
57 62
63#if DEBUG_SALLOC
64# define g_slice_alloc0(s) debug_slice_alloc0(s)
65# define g_slice_alloc(s) debug_slice_alloc(s)
66# define g_slice_free1(s,p) debug_slice_free1(s,p)
67void *g_slice_alloc (unsigned long size);
68void *g_slice_alloc0 (unsigned long size);
69void g_slice_free1 (unsigned long size, void *ptr);
70#elif PREFER_MALLOC
71# define g_slice_alloc0(s) calloc (1, (s))
72# define g_slice_alloc(s) malloc ((s))
73# define g_slice_free1(s,p) free ((p))
74#endif
75
58// use a gcc extension for auto declarations until ISO C++ sanctifies them 76// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
59#define auto(var,expr) decltype(expr) var = (expr) 77#define auto(var,expr) decltype(expr) var = (expr)
60 78
61// very ugly macro that basicaly declares and initialises a variable 79// very ugly macro that basically declares and initialises a variable
62// that is in scope for the next statement only 80// that is in scope for the next statement only
63// works only for stuff that can be assigned 0 and converts to false 81// works only for stuff that can be assigned 0 and converts to false
64// (note: works great for pointers) 82// (note: works great for pointers)
65// most ugly macro I ever wrote 83// most ugly macro I ever wrote
66#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) 84#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
67 85
68// in range including end 86// in range including end
69#define IN_RANGE_INC(val,beg,end) \ 87#define IN_RANGE_INC(val,beg,end) \
70 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 88 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
71 89
72// in range excluding end 90// in range excluding end
73#define IN_RANGE_EXC(val,beg,end) \ 91#define IN_RANGE_EXC(val,beg,end) \
74 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 92 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
75 93
94void cleanup (const char *cause, bool make_core = false);
76void fork_abort (const char *msg); 95void fork_abort (const char *msg);
77 96
78// rationale for using (U) not (T) is to reduce signed/unsigned issues, 97// rationale for using (U) not (T) is to reduce signed/unsigned issues,
79// as a is often a constant while b is the variable. it is still a bug, though. 98// as a is often a constant while b is the variable. it is still a bug, though.
80template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } 99template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
81template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } 100template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
82template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } 101template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; }
83 102
103template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); }
104template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); }
105template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); }
106
84template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 107template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
108
109template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
110template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
111
112// sign returns -1 or +1
113template<typename T>
114static inline T sign (T v) { return v < 0 ? -1 : +1; }
115// relies on 2c representation
116template<>
117inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); }
118
119// sign0 returns -1, 0 or +1
120template<typename T>
121static inline T sign0 (T v) { return v ? sign (v) : 0; }
122
123// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
124template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; }
125// div, round-up
126template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; }
127// div, round-down
128template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; }
85 129
86template<typename T> 130template<typename T>
87static inline T 131static inline T
88lerp (T val, T min_in, T max_in, T min_out, T max_out) 132lerp (T val, T min_in, T max_in, T min_out, T max_out)
89{ 133{
90 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; 134 return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
135}
136
137// lerp, round-down
138template<typename T>
139static inline T
140lerp_rd (T val, T min_in, T max_in, T min_out, T max_out)
141{
142 return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
143}
144
145// lerp, round-up
146template<typename T>
147static inline T
148lerp_ru (T val, T min_in, T max_in, T min_out, T max_out)
149{
150 return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
91} 151}
92 152
93// lots of stuff taken from FXT 153// lots of stuff taken from FXT
94 154
95/* Rotate right. This is used in various places for checksumming */ 155/* Rotate right. This is used in various places for checksumming */
… …
173absdir (int d) 233absdir (int d)
174{ 234{
175 return ((d - 1) & 7) + 1; 235 return ((d - 1) & 7) + 1;
176} 236}
177 237
238extern ssize_t slice_alloc; // statistics
239
240void *salloc_ (int n) throw (std::bad_alloc);
241void *salloc_ (int n, void *src) throw (std::bad_alloc);
242
243// strictly the same as g_slice_alloc, but never returns 0
244template<typename T>
245inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
246
247// also copies src into the new area, like "memdup"
248// if src is 0, clears the memory
249template<typename T>
250inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
251
252// clears the memory
253template<typename T>
254inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
255
256// for symmetry
257template<typename T>
258inline void sfree (T *ptr, int n = 1) throw ()
259{
260 if (expect_true (ptr))
261 {
262 slice_alloc -= n * sizeof (T);
263 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
264 g_slice_free1 (n * sizeof (T), (void *)ptr);
265 assert (slice_alloc >= 0);//D
266 }
267}
268
269// nulls the pointer
270template<typename T>
271inline void sfree0 (T *&ptr, int n = 1) throw ()
272{
273 sfree<T> (ptr, n);
274 ptr = 0;
275}
276
178// makes dynamically allocated objects zero-initialised 277// makes dynamically allocated objects zero-initialised
179struct zero_initialised 278struct zero_initialised
180{ 279{
181 void *operator new (size_t s, void *p) 280 void *operator new (size_t s, void *p)
182 { 281 {
… …
184 return p; 283 return p;
185 } 284 }
186 285
187 void *operator new (size_t s) 286 void *operator new (size_t s)
188 { 287 {
189 return g_slice_alloc0 (s); 288 return salloc0<char> (s);
190 } 289 }
191 290
192 void *operator new[] (size_t s) 291 void *operator new[] (size_t s)
193 { 292 {
194 return g_slice_alloc0 (s); 293 return salloc0<char> (s);
195 } 294 }
196 295
197 void operator delete (void *p, size_t s) 296 void operator delete (void *p, size_t s)
198 { 297 {
199 g_slice_free1 (s, p); 298 sfree ((char *)p, s);
200 } 299 }
201 300
202 void operator delete[] (void *p, size_t s) 301 void operator delete[] (void *p, size_t s)
203 { 302 {
204 g_slice_free1 (s, p); 303 sfree ((char *)p, s);
205 } 304 }
206}; 305};
207 306
208void *salloc_ (int n) throw (std::bad_alloc); 307// makes dynamically allocated objects zero-initialised
209void *salloc_ (int n, void *src) throw (std::bad_alloc); 308struct slice_allocated
210
211// strictly the same as g_slice_alloc, but never returns 0
212template<typename T>
213inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
214
215// also copies src into the new area, like "memdup"
216// if src is 0, clears the memory
217template<typename T>
218inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
219
220// clears the memory
221template<typename T>
222inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
223
224// for symmetry
225template<typename T>
226inline void sfree (T *ptr, int n = 1) throw ()
227{ 309{
228#ifdef PREFER_MALLOC 310 void *operator new (size_t s, void *p)
229 free (ptr); 311 {
230#else 312 return p;
231 g_slice_free1 (n * sizeof (T), (void *)ptr); 313 }
232#endif 314
233} 315 void *operator new (size_t s)
316 {
317 return salloc<char> (s);
318 }
319
320 void *operator new[] (size_t s)
321 {
322 return salloc<char> (s);
323 }
324
325 void operator delete (void *p, size_t s)
326 {
327 sfree ((char *)p, s);
328 }
329
330 void operator delete[] (void *p, size_t s)
331 {
332 sfree ((char *)p, s);
333 }
334};
234 335
235// a STL-compatible allocator that uses g_slice 336// a STL-compatible allocator that uses g_slice
236// boy, this is verbose 337// boy, this is verbose
237template<typename Tp> 338template<typename Tp>
238struct slice_allocator 339struct slice_allocator
… …
250 { 351 {
251 typedef slice_allocator<U> other; 352 typedef slice_allocator<U> other;
252 }; 353 };
253 354
254 slice_allocator () throw () { } 355 slice_allocator () throw () { }
255 slice_allocator (const slice_allocator &o) throw () { } 356 slice_allocator (const slice_allocator &) throw () { }
256 template<typename Tp2> 357 template<typename Tp2>
257 slice_allocator (const slice_allocator<Tp2> &) throw () { } 358 slice_allocator (const slice_allocator<Tp2> &) throw () { }
258 359
259 ~slice_allocator () { } 360 ~slice_allocator () { }
260 361
… …
269 void deallocate (pointer p, size_type n) 370 void deallocate (pointer p, size_type n)
270 { 371 {
271 sfree<Tp> (p, n); 372 sfree<Tp> (p, n);
272 } 373 }
273 374
274 size_type max_size ()const throw () 375 size_type max_size () const throw ()
275 { 376 {
276 return size_t (-1) / sizeof (Tp); 377 return size_t (-1) / sizeof (Tp);
277 } 378 }
278 379
279 void construct (pointer p, const Tp &val) 380 void construct (pointer p, const Tp &val)
… …
290// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. 391// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
291// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps 392// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
292// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps 393// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
293struct tausworthe_random_generator 394struct tausworthe_random_generator
294{ 395{
295 // generator
296 uint32_t state [4]; 396 uint32_t state [4];
297 397
298 void operator =(const tausworthe_random_generator &src) 398 void operator =(const tausworthe_random_generator &src)
299 { 399 {
300 state [0] = src.state [0]; 400 state [0] = src.state [0];
… …
303 state [3] = src.state [3]; 403 state [3] = src.state [3];
304 } 404 }
305 405
306 void seed (uint32_t seed); 406 void seed (uint32_t seed);
307 uint32_t next (); 407 uint32_t next ();
408};
308 409
309 // uniform distribution 410// Xorshift RNGs, George Marsaglia
411// http://www.jstatsoft.org/v08/i14/paper
412// this one is about 40% faster than the tausworthe one above (i.e. not much),
413// despite the inlining, and has the issue of only creating 2**32-1 numbers.
414// see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf
415struct xorshift_random_generator
416{
417 uint32_t x, y;
418
419 void operator =(const xorshift_random_generator &src)
420 {
421 x = src.x;
422 y = src.y;
423 }
424
425 void seed (uint32_t seed)
426 {
427 x = seed;
428 y = seed * 69069U;
429 }
430
431 uint32_t next ()
432 {
433 uint32_t t = x ^ (x << 10);
434 x = y;
435 y = y ^ (y >> 13) ^ t ^ (t >> 10);
436 return y;
437 }
438};
439
440template<class generator>
441struct random_number_generator : generator
442{
443 // uniform distribution, 0 .. max (0, num - 1)
310 uint32_t operator ()(uint32_t num) 444 uint32_t operator ()(uint32_t num)
311 { 445 {
312 return is_constant (num) 446 return !is_constant (num) ? get_range (num) // non-constant
313 ? (next () * (uint64_t)num) >> 32U 447 : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two
314 : get_range (num); 448 : this->next () & (num - 1); // constant, power-of-two
315 } 449 }
316 450
317 // return a number within (min .. max) 451 // return a number within (min .. max)
318 int operator () (int r_min, int r_max) 452 int operator () (int r_min, int r_max)
319 { 453 {
… …
330protected: 464protected:
331 uint32_t get_range (uint32_t r_max); 465 uint32_t get_range (uint32_t r_max);
332 int get_range (int r_min, int r_max); 466 int get_range (int r_min, int r_max);
333}; 467};
334 468
335typedef tausworthe_random_generator rand_gen; 469typedef random_number_generator<tausworthe_random_generator> rand_gen;
336 470
337extern rand_gen rndm; 471extern rand_gen rndm, rmg_rndm;
472
473INTERFACE_CLASS (attachable)
474struct refcnt_base
475{
476 typedef int refcnt_t;
477 mutable refcnt_t ACC (RW, refcnt);
478
479 MTH void refcnt_inc () const { ++refcnt; }
480 MTH void refcnt_dec () const { --refcnt; }
481
482 refcnt_base () : refcnt (0) { }
483};
484
485// to avoid branches with more advanced compilers
486extern refcnt_base::refcnt_t refcnt_dummy;
338 487
339template<class T> 488template<class T>
340struct refptr 489struct refptr
341{ 490{
491 // p if not null
492 refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
493
494 void refcnt_dec ()
495 {
496 if (!is_constant (p))
497 --*refcnt_ref ();
498 else if (p)
499 --p->refcnt;
500 }
501
502 void refcnt_inc ()
503 {
504 if (!is_constant (p))
505 ++*refcnt_ref ();
506 else if (p)
507 ++p->refcnt;
508 }
509
342 T *p; 510 T *p;
343 511
344 refptr () : p(0) { } 512 refptr () : p(0) { }
345 refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } 513 refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
346 refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } 514 refptr (T *p) : p(p) { refcnt_inc (); }
347 ~refptr () { if (p) p->refcnt_dec (); } 515 ~refptr () { refcnt_dec (); }
348 516
349 const refptr<T> &operator =(T *o) 517 const refptr<T> &operator =(T *o)
350 { 518 {
519 // if decrementing ever destroys we need to reverse the order here
351 if (p) p->refcnt_dec (); 520 refcnt_dec ();
352 p = o; 521 p = o;
353 if (p) p->refcnt_inc (); 522 refcnt_inc ();
354
355 return *this; 523 return *this;
356 } 524 }
357 525
358 const refptr<T> &operator =(const refptr<T> o) 526 const refptr<T> &operator =(const refptr<T> &o)
359 { 527 {
360 *this = o.p; 528 *this = o.p;
361 return *this; 529 return *this;
362 } 530 }
363 531
364 T &operator * () const { return *p; } 532 T &operator * () const { return *p; }
365 T *operator ->() const { return p; } 533 T *operator ->() const { return p; }
366 534
367 operator T *() const { return p; } 535 operator T *() const { return p; }
368}; 536};
369 537
370typedef refptr<maptile> maptile_ptr; 538typedef refptr<maptile> maptile_ptr;
… …
375 543
376struct str_hash 544struct str_hash
377{ 545{
378 std::size_t operator ()(const char *s) const 546 std::size_t operator ()(const char *s) const
379 { 547 {
380 unsigned long hash = 0; 548#if 0
549 uint32_t hash = 0;
381 550
382 /* use the one-at-a-time hash function, which supposedly is 551 /* use the one-at-a-time hash function, which supposedly is
383 * better than the djb2-like one used by perl5.005, but 552 * better than the djb2-like one used by perl5.005, but
384 * certainly is better then the bug used here before. 553 * certainly is better then the bug used here before.
385 * see http://burtleburtle.net/bob/hash/doobs.html 554 * see http://burtleburtle.net/bob/hash/doobs.html
… …
392 } 561 }
393 562
394 hash += hash << 3; 563 hash += hash << 3;
395 hash ^= hash >> 11; 564 hash ^= hash >> 11;
396 hash += hash << 15; 565 hash += hash << 15;
566#else
567 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
568 // it is about twice as fast as the one-at-a-time one,
569 // with good distribution.
570 // FNV-1a is faster on many cpus because the multiplication
571 // runs concurrent with the looping logic.
572 uint32_t hash = 2166136261;
573
574 while (*s)
575 hash = (hash ^ *s++) * 16777619;
576#endif
397 577
398 return hash; 578 return hash;
399 } 579 }
400}; 580};
401 581
… …
405 { 585 {
406 return !strcmp (a, b); 586 return !strcmp (a, b);
407 } 587 }
408}; 588};
409 589
590// Mostly the same as std::vector, but insert/erase can reorder
591// the elements, making append(=insert)/remove O(1) instead of O(n).
592//
593// NOTE: only some forms of erase are available
410template<class T> 594template<class T>
411struct unordered_vector : std::vector<T, slice_allocator<T> > 595struct unordered_vector : std::vector<T, slice_allocator<T> >
412{ 596{
413 typedef typename unordered_vector::iterator iterator; 597 typedef typename unordered_vector::iterator iterator;
414 598
… …
424 { 608 {
425 erase ((unsigned int )(i - this->begin ())); 609 erase ((unsigned int )(i - this->begin ()));
426 } 610 }
427}; 611};
428 612
429template<class T, int T::* index> 613// This container blends advantages of linked lists
614// (efficiency) with vectors (random access) by
615// by using an unordered vector and storing the vector
616// index inside the object.
617//
618// + memory-efficient on most 64 bit archs
619// + O(1) insert/remove
620// + free unique (but varying) id for inserted objects
621// + cache-friendly iteration
622// - only works for pointers to structs
623//
624// NOTE: only some forms of erase/insert are available
625typedef int object_vector_index;
626
627template<class T, object_vector_index T::*indexmember>
430struct object_vector : std::vector<T *, slice_allocator<T *> > 628struct object_vector : std::vector<T *, slice_allocator<T *> >
431{ 629{
630 typedef typename object_vector::iterator iterator;
631
632 bool contains (const T *obj) const
633 {
634 return obj->*indexmember;
635 }
636
637 iterator find (const T *obj)
638 {
639 return obj->*indexmember
640 ? this->begin () + obj->*indexmember - 1
641 : this->end ();
642 }
643
644 void push_back (T *obj)
645 {
646 std::vector<T *, slice_allocator<T *> >::push_back (obj);
647 obj->*indexmember = this->size ();
648 }
649
432 void insert (T *obj) 650 void insert (T *obj)
433 { 651 {
434 assert (!(obj->*index));
435 push_back (obj); 652 push_back (obj);
436 obj->*index = this->size ();
437 } 653 }
438 654
439 void insert (T &obj) 655 void insert (T &obj)
440 { 656 {
441 insert (&obj); 657 insert (&obj);
442 } 658 }
443 659
444 void erase (T *obj) 660 void erase (T *obj)
445 { 661 {
446 assert (obj->*index);
447 unsigned int pos = obj->*index; 662 unsigned int pos = obj->*indexmember;
448 obj->*index = 0; 663 obj->*indexmember = 0;
449 664
450 if (pos < this->size ()) 665 if (pos < this->size ())
451 { 666 {
452 (*this)[pos - 1] = (*this)[this->size () - 1]; 667 (*this)[pos - 1] = (*this)[this->size () - 1];
453 (*this)[pos - 1]->*index = pos; 668 (*this)[pos - 1]->*indexmember = pos;
454 } 669 }
455 670
456 this->pop_back (); 671 this->pop_back ();
457 } 672 }
458 673
459 void erase (T &obj) 674 void erase (T &obj)
460 { 675 {
461 errase (&obj); 676 erase (&obj);
462 } 677 }
463}; 678};
464 679
465// basically does what strncpy should do, but appends "..." to strings exceeding length 680// basically does what strncpy should do, but appends "..." to strings exceeding length
466void assign (char *dst, const char *src, int maxlen); 681void assign (char *dst, const char *src, int maxlen);
… …
472 assign ((char *)&dst, src, N); 687 assign ((char *)&dst, src, N);
473} 688}
474 689
475typedef double tstamp; 690typedef double tstamp;
476 691
477// return current time as timestampe 692// return current time as timestamp
478tstamp now (); 693tstamp now ();
479 694
480int similar_direction (int a, int b); 695int similar_direction (int a, int b);
481 696
482// like printf, but returns a std::string 697// like sprintf, but returns a "static" buffer
483const std::string format (const char *format, ...); 698const char *format (const char *format, ...);
484 699
700/////////////////////////////////////////////////////////////////////////////
701// threads, very very thin wrappers around pthreads
702
703struct thread
704{
705 pthread_t id;
706
707 void start (void *(*start_routine)(void *), void *arg = 0);
708
709 void cancel ()
710 {
711 pthread_cancel (id);
712 }
713
714 void *join ()
715 {
716 void *ret;
717
718 if (pthread_join (id, &ret))
719 cleanup ("pthread_join failed", 1);
720
721 return ret;
722 }
723};
724
725// note that mutexes are not classes
726typedef pthread_mutex_t smutex;
727
728#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
729 #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
730#else
731 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
485#endif 732#endif
486 733
734#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
735#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
736#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
737
738typedef pthread_cond_t scond;
739
740#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
741#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
742#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
743#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
744
745#endif
746

Diff Legend

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