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.45 by root, Sat May 26 15:44:05 2007 UTC vs.
Revision 1.107 by root, Sun May 2 14:46:56 2010 UTC

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

Diff Legend

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