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.33 by root, Thu Jan 18 22:20:00 2007 UTC vs.
Revision 1.39 by pippijn, Thu Mar 1 12:28:16 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
… …
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);
39 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.
40template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 44template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
41template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 45template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
42template<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; } 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; }
43 47
44template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 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}
45 94
46// this is much faster than crossfires original algorithm 95// this is much faster than crossfires original algorithm
47// on modern cpus 96// on modern cpus
48inline int 97inline int
49isqrt (int n) 98isqrt (int n)
… …
131 180
132// for symmetry 181// for symmetry
133template<typename T> 182template<typename T>
134inline void sfree (T *ptr, int n = 1) throw () 183inline void sfree (T *ptr, int n = 1) throw ()
135{ 184{
185#ifdef PREFER_MALLOC
186 free (ptr);
187#else
136 g_slice_free1 (n * sizeof (T), (void *)ptr); 188 g_slice_free1 (n * sizeof (T), (void *)ptr);
189#endif
137} 190}
138 191
139// a STL-compatible allocator that uses g_slice 192// a STL-compatible allocator that uses g_slice
140// boy, this is verbose 193// boy, this is verbose
141template<typename Tp> 194template<typename Tp>
… …
194// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. 247// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
195// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps 248// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
196// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps 249// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
197struct tausworthe_random_generator 250struct tausworthe_random_generator
198{ 251{
252 // generator
199 uint32_t state [4]; 253 uint32_t state [4];
200 254
201 tausworthe_random_generator (uint32_t seed); 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);
202 uint32_t next (); 264 uint32_t next ();
203 265
266 // uniform distribution
204 uint32_t operator ()(uint32_t r_max) 267 uint32_t operator ()(uint32_t r_max)
205 { 268 {
206 return next () % r_max; 269 return is_constant (r_max)
270 ? this->next () % r_max
271 : get_range (r_max);
207 } 272 }
208 273
209 // return a number within (min .. max) 274 // return a number within (min .. max)
210 int operator () (int r_min, int r_max) 275 int operator () (int r_min, int r_max)
211 { 276 {
277 return is_constant (r_min) && is_constant (r_max)
212 return r_min + (*this) (max (r_max - r_min + 1, 1)); 278 ? r_min + (*this) (max (r_max - r_min + 1, 1))
279 : get_range (r_min, r_max);
213 } 280 }
214 281
215 double operator ()() 282 double operator ()()
216 { 283 {
217 return next () / (double)0xFFFFFFFFU; 284 return this->next () / (double)0xFFFFFFFFU;
218 } 285 }
286
287protected:
288 uint32_t get_range (uint32_t r_max);
289 int get_range (int r_min, int r_max);
219}; 290};
220 291
221typedef tausworthe_random_generator rand_gen; 292typedef tausworthe_random_generator rand_gen;
222 293
223extern rand_gen rndm; 294extern rand_gen rndm;
… …
328 } 399 }
329 400
330 void erase (T *obj) 401 void erase (T *obj)
331 { 402 {
332 assert (obj->*index); 403 assert (obj->*index);
333 int pos = obj->*index; 404 unsigned int pos = obj->*index;
334 obj->*index = 0; 405 obj->*index = 0;
335 406
336 if (pos < this->size ()) 407 if (pos < this->size ())
337 { 408 {
338 (*this)[pos - 1] = (*this)[this->size () - 1]; 409 (*this)[pos - 1] = (*this)[this->size () - 1];

Diff Legend

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