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.66 by root, Wed Apr 2 11:13:55 2008 UTC vs.
Revision 1.86 by root, Sat Jan 3 01:04:19 2009 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * 5 *
6 * Deliantra is free software: you can redistribute it and/or modify 6 * Deliantra is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by 7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or 8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version. 9 * (at your option) any later version.
… …
20 */ 20 */
21 21
22#ifndef UTIL_H__ 22#ifndef UTIL_H__
23#define UTIL_H__ 23#define UTIL_H__
24 24
25#define DEBUG_SALLOC 0 25#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
26#define PREFER_MALLOC 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)
47 50
48#include <pthread.h> 51#include <pthread.h>
49 52
50#include <cstddef> 53#include <cstddef>
51#include <cmath> 54#include <cmath>
… …
62# define g_slice_alloc(s) debug_slice_alloc(s) 65# define g_slice_alloc(s) debug_slice_alloc(s)
63# define g_slice_free1(s,p) debug_slice_free1(s,p) 66# define g_slice_free1(s,p) debug_slice_free1(s,p)
64void *g_slice_alloc (unsigned long size); 67void *g_slice_alloc (unsigned long size);
65void *g_slice_alloc0 (unsigned long size); 68void *g_slice_alloc0 (unsigned long size);
66void g_slice_free1 (unsigned long size, void *ptr); 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))
67#endif 74#endif
68 75
69// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) 76// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
70#define auto(var,expr) decltype(expr) var = (expr) 77#define auto(var,expr) decltype(expr) var = (expr)
71 78
72// very ugly macro that basicaly declares and initialises a variable 79// very ugly macro that basically declares and initialises a variable
73// that is in scope for the next statement only 80// that is in scope for the next statement only
74// 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
75// (note: works great for pointers) 82// (note: works great for pointers)
76// most ugly macro I ever wrote 83// most ugly macro I ever wrote
77#define statementvar(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)
… …
91// 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.
92template<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; }
93template<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; }
94template<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; }
95 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
96template<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; }
97 108
98template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } 109template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
99template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (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)); }
100 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; }
129
101template<typename T> 130template<typename T>
102static inline T 131static inline T
103lerp (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)
104{ 133{
105 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);
106} 151}
107 152
108// lots of stuff taken from FXT 153// lots of stuff taken from FXT
109 154
110/* Rotate right. This is used in various places for checksumming */ 155/* Rotate right. This is used in various places for checksumming */
… …
188absdir (int d) 233absdir (int d)
189{ 234{
190 return ((d - 1) & 7) + 1; 235 return ((d - 1) & 7) + 1;
191} 236}
192 237
193extern size_t slice_alloc; // statistics 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}
194 276
195// makes dynamically allocated objects zero-initialised 277// makes dynamically allocated objects zero-initialised
196struct zero_initialised 278struct zero_initialised
197{ 279{
198 void *operator new (size_t s, void *p) 280 void *operator new (size_t s, void *p)
… …
201 return p; 283 return p;
202 } 284 }
203 285
204 void *operator new (size_t s) 286 void *operator new (size_t s)
205 { 287 {
206 slice_alloc += s;
207 return g_slice_alloc0 (s); 288 return salloc0<char> (s);
208 } 289 }
209 290
210 void *operator new[] (size_t s) 291 void *operator new[] (size_t s)
211 { 292 {
212 slice_alloc += s;
213 return g_slice_alloc0 (s); 293 return salloc0<char> (s);
214 } 294 }
215 295
216 void operator delete (void *p, size_t s) 296 void operator delete (void *p, size_t s)
217 { 297 {
218 slice_alloc -= s; 298 sfree ((char *)p, s);
219 g_slice_free1 (s, p);
220 } 299 }
221 300
222 void operator delete[] (void *p, size_t s) 301 void operator delete[] (void *p, size_t s)
223 { 302 {
224 slice_alloc -= s; 303 sfree ((char *)p, s);
225 g_slice_free1 (s, p);
226 } 304 }
227}; 305};
228 306
229void *salloc_ (int n) throw (std::bad_alloc); 307// makes dynamically allocated objects zero-initialised
230void *salloc_ (int n, void *src) throw (std::bad_alloc); 308struct slice_allocated
231
232// strictly the same as g_slice_alloc, but never returns 0
233template<typename T>
234inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
235
236// also copies src into the new area, like "memdup"
237// if src is 0, clears the memory
238template<typename T>
239inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
240
241// clears the memory
242template<typename T>
243inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
244
245// for symmetry
246template<typename T>
247inline void sfree (T *ptr, int n = 1) throw ()
248{ 309{
249#if PREFER_MALLOC 310 void *operator new (size_t s, void *p)
250 free (ptr); 311 {
251#else 312 return p;
252 slice_alloc -= n * sizeof (T); 313 }
253 g_slice_free1 (n * sizeof (T), (void *)ptr); 314
254#endif 315 void *operator new (size_t s)
255} 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};
256 335
257// a STL-compatible allocator that uses g_slice 336// a STL-compatible allocator that uses g_slice
258// boy, this is verbose 337// boy, this is verbose
259template<typename Tp> 338template<typename Tp>
260struct slice_allocator 339struct slice_allocator
… …
312// 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.
313// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps 392// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
314// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps 393// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
315struct tausworthe_random_generator 394struct tausworthe_random_generator
316{ 395{
317 // generator
318 uint32_t state [4]; 396 uint32_t state [4];
319 397
320 void operator =(const tausworthe_random_generator &src) 398 void operator =(const tausworthe_random_generator &src)
321 { 399 {
322 state [0] = src.state [0]; 400 state [0] = src.state [0];
… …
325 state [3] = src.state [3]; 403 state [3] = src.state [3];
326 } 404 }
327 405
328 void seed (uint32_t seed); 406 void seed (uint32_t seed);
329 uint32_t next (); 407 uint32_t next ();
408};
330 409
331 // 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)
332 uint32_t operator ()(uint32_t num) 444 uint32_t operator ()(uint32_t num)
333 { 445 {
334 return is_constant (num) 446 return !is_constant (num) ? get_range (num) // non-constant
335 ? (next () * (uint64_t)num) >> 32U 447 : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two
336 : get_range (num); 448 : this->next () & (num - 1); // constant, power-of-two
337 } 449 }
338 450
339 // return a number within (min .. max) 451 // return a number within (min .. max)
340 int operator () (int r_min, int r_max) 452 int operator () (int r_min, int r_max)
341 { 453 {
… …
352protected: 464protected:
353 uint32_t get_range (uint32_t r_max); 465 uint32_t get_range (uint32_t r_max);
354 int get_range (int r_min, int r_max); 466 int get_range (int r_min, int r_max);
355}; 467};
356 468
357typedef tausworthe_random_generator rand_gen; 469typedef random_number_generator<tausworthe_random_generator> rand_gen;
358 470
359extern rand_gen rndm; 471extern rand_gen rndm, rmg_rndm;
360 472
361INTERFACE_CLASS (attachable) 473INTERFACE_CLASS (attachable)
362struct refcnt_base 474struct refcnt_base
363{ 475{
364 typedef int refcnt_t; 476 typedef int refcnt_t;
… …
431 543
432struct str_hash 544struct str_hash
433{ 545{
434 std::size_t operator ()(const char *s) const 546 std::size_t operator ()(const char *s) const
435 { 547 {
436 unsigned long hash = 0; 548#if 0
549 uint32_t hash = 0;
437 550
438 /* use the one-at-a-time hash function, which supposedly is 551 /* use the one-at-a-time hash function, which supposedly is
439 * better than the djb2-like one used by perl5.005, but 552 * better than the djb2-like one used by perl5.005, but
440 * certainly is better then the bug used here before. 553 * certainly is better then the bug used here before.
441 * see http://burtleburtle.net/bob/hash/doobs.html 554 * see http://burtleburtle.net/bob/hash/doobs.html
… …
448 } 561 }
449 562
450 hash += hash << 3; 563 hash += hash << 3;
451 hash ^= hash >> 11; 564 hash ^= hash >> 11;
452 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
453 577
454 return hash; 578 return hash;
455 } 579 }
456}; 580};
457 581
… …
606#else 730#else
607 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER 731 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
608#endif 732#endif
609 733
610#define SMUTEX(name) smutex name = SMUTEX_INITIALISER 734#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
611#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) 735#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
612#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) 736#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
613 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
614#endif 745#endif
615 746

Diff Legend

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