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.84 by root, Wed Dec 31 17:35:37 2008 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)
… …
40#endif 41#endif
41 42
42// put into ifs if you are very sure that the expression 43// put into ifs if you are very sure that the expression
43// is mostly true or mosty false. note that these return 44// is mostly true or mosty false. note that these return
44// booleans, not the expression. 45// booleans, not the expression.
45#define expect_false(expr) expect ((expr) != 0, 0) 46#define expect_false(expr) expect ((expr) ? 1 : 0, 0)
46#define expect_true(expr) expect ((expr) != 0, 1) 47#define expect_true(expr) expect ((expr) ? 1 : 0, 1)
47 48
48#include <pthread.h> 49#include <pthread.h>
49 50
50#include <cstddef> 51#include <cstddef>
51#include <cmath> 52#include <cmath>
… …
62# define g_slice_alloc(s) debug_slice_alloc(s) 63# define g_slice_alloc(s) debug_slice_alloc(s)
63# define g_slice_free1(s,p) debug_slice_free1(s,p) 64# define g_slice_free1(s,p) debug_slice_free1(s,p)
64void *g_slice_alloc (unsigned long size); 65void *g_slice_alloc (unsigned long size);
65void *g_slice_alloc0 (unsigned long size); 66void *g_slice_alloc0 (unsigned long size);
66void g_slice_free1 (unsigned long size, void *ptr); 67void g_slice_free1 (unsigned long size, void *ptr);
68#elif PREFER_MALLOC
69# define g_slice_alloc0(s) calloc (1, (s))
70# define g_slice_alloc(s) malloc ((s))
71# define g_slice_free1(s,p) free ((p))
67#endif 72#endif
68 73
69// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) 74// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
70#define auto(var,expr) decltype(expr) var = (expr) 75#define auto(var,expr) decltype(expr) var = (expr)
71 76
72// very ugly macro that basicaly declares and initialises a variable 77// very ugly macro that basically declares and initialises a variable
73// that is in scope for the next statement only 78// that is in scope for the next statement only
74// works only for stuff that can be assigned 0 and converts to false 79// works only for stuff that can be assigned 0 and converts to false
75// (note: works great for pointers) 80// (note: works great for pointers)
76// most ugly macro I ever wrote 81// most ugly macro I ever wrote
77#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) 82#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. 96// 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; } 97template<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; } 98template<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; } 99template<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 100
101template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); }
102template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); }
103template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); }
104
96template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 105template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
97 106
98template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } 107template<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)); } 108template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
100 109
110// sign returns -1 or +1
111template<typename T>
112static inline T sign (T v) { return v < 0 ? -1 : +1; }
113// relies on 2c representation
114template<>
115inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); }
116
117// sign0 returns -1, 0 or +1
118template<typename T>
119static inline T sign0 (T v) { return v ? sign (v) : 0; }
120
121// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
122template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; }
123// div, round-up
124template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; }
125// div, round-down
126template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; }
127
101template<typename T> 128template<typename T>
102static inline T 129static inline T
103lerp (T val, T min_in, T max_in, T min_out, T max_out) 130lerp (T val, T min_in, T max_in, T min_out, T max_out)
104{ 131{
105 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; 132 return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
133}
134
135// lerp, round-down
136template<typename T>
137static inline T
138lerp_rd (T val, T min_in, T max_in, T min_out, T max_out)
139{
140 return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
141}
142
143// lerp, round-up
144template<typename T>
145static inline T
146lerp_ru (T val, T min_in, T max_in, T min_out, T max_out)
147{
148 return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
106} 149}
107 150
108// lots of stuff taken from FXT 151// lots of stuff taken from FXT
109 152
110/* Rotate right. This is used in various places for checksumming */ 153/* Rotate right. This is used in various places for checksumming */
… …
188absdir (int d) 231absdir (int d)
189{ 232{
190 return ((d - 1) & 7) + 1; 233 return ((d - 1) & 7) + 1;
191} 234}
192 235
193extern size_t slice_alloc; // statistics 236extern ssize_t slice_alloc; // statistics
237
238void *salloc_ (int n) throw (std::bad_alloc);
239void *salloc_ (int n, void *src) throw (std::bad_alloc);
240
241// strictly the same as g_slice_alloc, but never returns 0
242template<typename T>
243inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
244
245// also copies src into the new area, like "memdup"
246// if src is 0, clears the memory
247template<typename T>
248inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
249
250// clears the memory
251template<typename T>
252inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
253
254// for symmetry
255template<typename T>
256inline void sfree (T *ptr, int n = 1) throw ()
257{
258 if (expect_true (ptr))
259 {
260 slice_alloc -= n * sizeof (T);
261 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
262 g_slice_free1 (n * sizeof (T), (void *)ptr);
263 assert (slice_alloc >= 0);//D
264 }
265}
266
267// nulls the pointer
268template<typename T>
269inline void sfree0 (T *&ptr, int n = 1) throw ()
270{
271 sfree<T> (ptr, n);
272 ptr = 0;
273}
194 274
195// makes dynamically allocated objects zero-initialised 275// makes dynamically allocated objects zero-initialised
196struct zero_initialised 276struct zero_initialised
197{ 277{
198 void *operator new (size_t s, void *p) 278 void *operator new (size_t s, void *p)
… …
201 return p; 281 return p;
202 } 282 }
203 283
204 void *operator new (size_t s) 284 void *operator new (size_t s)
205 { 285 {
206 slice_alloc += s;
207 return g_slice_alloc0 (s); 286 return salloc0<char> (s);
208 } 287 }
209 288
210 void *operator new[] (size_t s) 289 void *operator new[] (size_t s)
211 { 290 {
212 slice_alloc += s;
213 return g_slice_alloc0 (s); 291 return salloc0<char> (s);
214 } 292 }
215 293
216 void operator delete (void *p, size_t s) 294 void operator delete (void *p, size_t s)
217 { 295 {
218 slice_alloc -= s; 296 sfree ((char *)p, s);
219 g_slice_free1 (s, p);
220 } 297 }
221 298
222 void operator delete[] (void *p, size_t s) 299 void operator delete[] (void *p, size_t s)
223 { 300 {
224 slice_alloc -= s; 301 sfree ((char *)p, s);
225 g_slice_free1 (s, p);
226 } 302 }
227}; 303};
228 304
229void *salloc_ (int n) throw (std::bad_alloc); 305// makes dynamically allocated objects zero-initialised
230void *salloc_ (int n, void *src) throw (std::bad_alloc); 306struct 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{ 307{
249#if PREFER_MALLOC 308 void *operator new (size_t s, void *p)
250 free (ptr); 309 {
251#else 310 return p;
252 slice_alloc -= n * sizeof (T); 311 }
253 g_slice_free1 (n * sizeof (T), (void *)ptr); 312
254#endif 313 void *operator new (size_t s)
255} 314 {
315 return salloc<char> (s);
316 }
317
318 void *operator new[] (size_t s)
319 {
320 return salloc<char> (s);
321 }
322
323 void operator delete (void *p, size_t s)
324 {
325 sfree ((char *)p, s);
326 }
327
328 void operator delete[] (void *p, size_t s)
329 {
330 sfree ((char *)p, s);
331 }
332};
256 333
257// a STL-compatible allocator that uses g_slice 334// a STL-compatible allocator that uses g_slice
258// boy, this is verbose 335// boy, this is verbose
259template<typename Tp> 336template<typename Tp>
260struct slice_allocator 337struct slice_allocator
… …
312// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. 389// 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 390// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
314// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps 391// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
315struct tausworthe_random_generator 392struct tausworthe_random_generator
316{ 393{
317 // generator
318 uint32_t state [4]; 394 uint32_t state [4];
319 395
320 void operator =(const tausworthe_random_generator &src) 396 void operator =(const tausworthe_random_generator &src)
321 { 397 {
322 state [0] = src.state [0]; 398 state [0] = src.state [0];
… …
325 state [3] = src.state [3]; 401 state [3] = src.state [3];
326 } 402 }
327 403
328 void seed (uint32_t seed); 404 void seed (uint32_t seed);
329 uint32_t next (); 405 uint32_t next ();
406};
330 407
331 // uniform distribution 408// Xorshift RNGs, George Marsaglia
409// http://www.jstatsoft.org/v08/i14/paper
410// this one is about 40% faster than the tausworthe one above (i.e. not much),
411// despite the inlining, and has the issue of only creating 2**32-1 numbers.
412struct xorshift_random_generator
413{
414 uint32_t x, y;
415
416 void operator =(const xorshift_random_generator &src)
417 {
418 x = src.x;
419 y = src.y;
420 }
421
422 void seed (uint32_t seed)
423 {
424 x = seed;
425 y = seed * 69069U;
426 }
427
428 uint32_t next ()
429 {
430 uint32_t t = x ^ (x << 10);
431 x = y;
432 y = y ^ (y >> 13) ^ t ^ (t >> 10);
433 return y;
434 }
435};
436
437template<class generator>
438struct random_number_generator : generator
439{
440 // uniform distribution, 0 .. max (0, num - 1)
332 uint32_t operator ()(uint32_t num) 441 uint32_t operator ()(uint32_t num)
333 { 442 {
334 return is_constant (num) 443 return !is_constant (num) ? get_range (num) // non-constant
335 ? (next () * (uint64_t)num) >> 32U 444 : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two
336 : get_range (num); 445 : this->next () & (num - 1); // constant, power-of-two
337 } 446 }
338 447
339 // return a number within (min .. max) 448 // return a number within (min .. max)
340 int operator () (int r_min, int r_max) 449 int operator () (int r_min, int r_max)
341 { 450 {
… …
352protected: 461protected:
353 uint32_t get_range (uint32_t r_max); 462 uint32_t get_range (uint32_t r_max);
354 int get_range (int r_min, int r_max); 463 int get_range (int r_min, int r_max);
355}; 464};
356 465
357typedef tausworthe_random_generator rand_gen; 466typedef random_number_generator<tausworthe_random_generator> rand_gen;
358 467
359extern rand_gen rndm; 468extern rand_gen rndm, rmg_rndm;
360 469
361INTERFACE_CLASS (attachable) 470INTERFACE_CLASS (attachable)
362struct refcnt_base 471struct refcnt_base
363{ 472{
364 typedef int refcnt_t; 473 typedef int refcnt_t;
… …
431 540
432struct str_hash 541struct str_hash
433{ 542{
434 std::size_t operator ()(const char *s) const 543 std::size_t operator ()(const char *s) const
435 { 544 {
436 unsigned long hash = 0; 545#if 0
546 uint32_t hash = 0;
437 547
438 /* use the one-at-a-time hash function, which supposedly is 548 /* use the one-at-a-time hash function, which supposedly is
439 * better than the djb2-like one used by perl5.005, but 549 * better than the djb2-like one used by perl5.005, but
440 * certainly is better then the bug used here before. 550 * certainly is better then the bug used here before.
441 * see http://burtleburtle.net/bob/hash/doobs.html 551 * see http://burtleburtle.net/bob/hash/doobs.html
… …
448 } 558 }
449 559
450 hash += hash << 3; 560 hash += hash << 3;
451 hash ^= hash >> 11; 561 hash ^= hash >> 11;
452 hash += hash << 15; 562 hash += hash << 15;
563#else
564 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
565 // it is about twice as fast as the one-at-a-time one,
566 // with good distribution.
567 // FNV-1a is faster on many cpus because the multiplication
568 // runs concurrent with the looping logic.
569 uint32_t hash = 2166136261;
570
571 while (*s)
572 hash = (hash ^ *s++) * 16777619;
573#endif
453 574
454 return hash; 575 return hash;
455 } 576 }
456}; 577};
457 578
… …
606#else 727#else
607 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER 728 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
608#endif 729#endif
609 730
610#define SMUTEX(name) smutex name = SMUTEX_INITIALISER 731#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
611#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) 732#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
612#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) 733#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
613 734
735typedef pthread_cond_t scond;
736
737#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
738#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
739#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
740#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
741
614#endif 742#endif
615 743

Diff Legend

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