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

Diff Legend

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