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.31 by root, Mon Jan 15 02:39:41 2007 UTC vs.
Revision 1.42 by root, Sat Apr 21 23:03:54 2007 UTC

1#ifndef UTIL_H__ 1#ifndef UTIL_H__
2#define UTIL_H__ 2#define UTIL_H__
3
4//#define PREFER_MALLOC
3 5
4#if __GNUC__ >= 3 6#if __GNUC__ >= 3
5# define is_constant(c) __builtin_constant_p (c) 7# define is_constant(c) __builtin_constant_p (c)
6#else 8#else
7# define is_constant(c) 0 9# define is_constant(c) 0
… …
16 18
17#include <shstr.h> 19#include <shstr.h>
18#include <traits.h> 20#include <traits.h>
19 21
20// use a gcc extension for auto declarations until ISO C++ sanctifies them 22// use a gcc extension for auto declarations until ISO C++ sanctifies them
21#define AUTODECL(var,expr) typeof(expr) var = (expr) 23#define auto(var,expr) typeof(expr) var = (expr)
22 24
23// very ugly macro that basicaly declares and initialises a variable 25// very ugly macro that basicaly declares and initialises a variable
24// that is in scope for the next statement only 26// that is in scope for the next statement only
25// works only for stuff that can be assigned 0 and converts to false 27// works only for stuff that can be assigned 0 and converts to false
26// (note: works great for pointers) 28// (note: works great for pointers)
… …
34// in range excluding end 36// in range excluding end
35#define IN_RANGE_EXC(val,beg,end) \ 37#define IN_RANGE_EXC(val,beg,end) \
36 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 38 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
37 39
38void fork_abort (const char *msg); 40void fork_abort (const char *msg);
41
42// rationale for using (U) not (T) is to reduce signed/unsigned issues,
43// as a is often a constant while b is the variable. it is still a bug, though.
44template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
45template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
46template<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; }
47
48template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
49
50// lots of stuff taken from FXT
51
52/* Rotate right. This is used in various places for checksumming */
53//TODO: that sucks, use a better checksum algo
54static inline uint32_t
55rotate_right (uint32_t c, uint32_t count = 1)
56{
57 return (c << (32 - count)) | (c >> count);
58}
59
60static inline uint32_t
61rotate_left (uint32_t c, uint32_t count = 1)
62{
63 return (c >> (32 - count)) | (c << count);
64}
65
66// Return abs(a-b)
67// Both a and b must not have the most significant bit set
68static inline uint32_t
69upos_abs_diff (uint32_t a, uint32_t b)
70{
71 long d1 = b - a;
72 long d2 = (d1 & (d1 >> 31)) << 1;
73
74 return d1 - d2; // == (b - d) - (a + d);
75}
76
77// Both a and b must not have the most significant bit set
78static inline uint32_t
79upos_min (uint32_t a, uint32_t b)
80{
81 int32_t d = b - a;
82 d &= d >> 31;
83 return a + d;
84}
85
86// Both a and b must not have the most significant bit set
87static inline uint32_t
88upos_max (uint32_t a, uint32_t b)
89{
90 int32_t d = b - a;
91 d &= d >> 31;
92 return b - d;
93}
39 94
40// this is much faster than crossfires original algorithm 95// this is much faster than crossfires original algorithm
41// on modern cpus 96// on modern cpus
42inline int 97inline int
43isqrt (int n) 98isqrt (int n)
… …
125 180
126// for symmetry 181// for symmetry
127template<typename T> 182template<typename T>
128inline void sfree (T *ptr, int n = 1) throw () 183inline void sfree (T *ptr, int n = 1) throw ()
129{ 184{
185#ifdef PREFER_MALLOC
186 free (ptr);
187#else
130 g_slice_free1 (n * sizeof (T), (void *)ptr); 188 g_slice_free1 (n * sizeof (T), (void *)ptr);
189#endif
131} 190}
132 191
133// a STL-compatible allocator that uses g_slice 192// a STL-compatible allocator that uses g_slice
134// boy, this is verbose 193// boy, this is verbose
135template<typename Tp> 194template<typename Tp>
… …
182 void destroy (pointer p) 241 void destroy (pointer p)
183 { 242 {
184 p->~Tp (); 243 p->~Tp ();
185 } 244 }
186}; 245};
246
247// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
248// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
249// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
250struct tausworthe_random_generator
251{
252 // generator
253 uint32_t state [4];
254
255 void operator =(const tausworthe_random_generator &src)
256 {
257 state [0] = src.state [0];
258 state [1] = src.state [1];
259 state [2] = src.state [2];
260 state [3] = src.state [3];
261 }
262
263 void seed (uint32_t seed);
264 uint32_t next ();
265
266 // uniform distribution
267 uint32_t operator ()(uint32_t num)
268 {
269 return is_constant (num)
270 ? (next () * (uint64_t)num) >> 32U
271 : get_range (num);
272 }
273
274 // return a number within (min .. max)
275 int operator () (int r_min, int r_max)
276 {
277 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
278 ? r_min + operator ()(r_max - r_min + 1)
279 : get_range (r_min, r_max);
280 }
281
282 double operator ()()
283 {
284 return this->next () / (double)0xFFFFFFFFU;
285 }
286
287protected:
288 uint32_t get_range (uint32_t r_max);
289 int get_range (int r_min, int r_max);
290};
291
292typedef tausworthe_random_generator rand_gen;
293
294extern rand_gen rndm;
187 295
188template<class T> 296template<class T>
189struct refptr 297struct refptr
190{ 298{
191 T *p; 299 T *p;
… …
291 } 399 }
292 400
293 void erase (T *obj) 401 void erase (T *obj)
294 { 402 {
295 assert (obj->*index); 403 assert (obj->*index);
296 int pos = obj->*index; 404 unsigned int pos = obj->*index;
297 obj->*index = 0; 405 obj->*index = 0;
298 406
299 if (pos < this->size ()) 407 if (pos < this->size ())
300 { 408 {
301 (*this)[pos - 1] = (*this)[this->size () - 1]; 409 (*this)[pos - 1] = (*this)[this->size () - 1];
… …
309 { 417 {
310 errase (&obj); 418 errase (&obj);
311 } 419 }
312}; 420};
313 421
314template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
315template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
316template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; }
317
318template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
319
320// basically does what strncpy should do, but appends "..." to strings exceeding length 422// basically does what strncpy should do, but appends "..." to strings exceeding length
321void assign (char *dst, const char *src, int maxlen); 423void assign (char *dst, const char *src, int maxlen);
322 424
323// type-safe version of assign 425// type-safe version of assign
324template<int N> 426template<int N>

Diff Legend

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