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

Diff Legend

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