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.29 by root, Mon Jan 15 01:39:42 2007 UTC vs.
Revision 1.45 by root, Sat May 26 15:44:05 2007 UTC

1#ifndef UTIL_H__ 1#ifndef UTIL_H__
2#define UTIL_H__ 2#define UTIL_H__
3 3
4//#define PREFER_MALLOC
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)
8# define expect(expr,value) __builtin_expect ((expr),(value))
9# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
6#else 10#else
7# define is_constant(c) 0 11# define is_constant(c) 0
12# define expect(expr,value) (expr)
13# define prefetch(addr,rw,locality)
8#endif 14#endif
15
16// put into ifs if you are very sure that the expression
17// is mostly true or mosty false. note that these return
18// booleans, not the expression.
19#define expect_false(expr) expect ((expr) != 0, 0)
20#define expect_true(expr) expect ((expr) != 0, 1)
9 21
10#include <cstddef> 22#include <cstddef>
11#include <cmath> 23#include <cmath>
12#include <new> 24#include <new>
13#include <vector> 25#include <vector>
… …
16 28
17#include <shstr.h> 29#include <shstr.h>
18#include <traits.h> 30#include <traits.h>
19 31
20// use a gcc extension for auto declarations until ISO C++ sanctifies them 32// use a gcc extension for auto declarations until ISO C++ sanctifies them
21#define AUTODECL(var,expr) typeof(expr) var = (expr) 33#define auto(var,expr) typeof(expr) var = (expr)
22 34
23// very ugly macro that basicaly declares and initialises a variable 35// very ugly macro that basicaly declares and initialises a variable
24// that is in scope for the next statement only 36// that is in scope for the next statement only
25// works only for stuff that can be assigned 0 and converts to false 37// works only for stuff that can be assigned 0 and converts to false
26// (note: works great for pointers) 38// (note: works great for pointers)
… …
32 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 44 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
33 45
34// in range excluding end 46// in range excluding end
35#define IN_RANGE_EXC(val,beg,end) \ 47#define IN_RANGE_EXC(val,beg,end) \
36 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 48 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
49
50void fork_abort (const char *msg);
51
52// rationale for using (U) not (T) is to reduce signed/unsigned issues,
53// as a is often a constant while b is the variable. it is still a bug, though.
54template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
55template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
56template<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; }
57
58template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
59
60template<typename T>
61static inline T
62lerp (T val, T min_in, T max_in, T min_out, T max_out)
63{
64 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out;
65}
66
67// lots of stuff taken from FXT
68
69/* Rotate right. This is used in various places for checksumming */
70//TODO: that sucks, use a better checksum algo
71static inline uint32_t
72rotate_right (uint32_t c, uint32_t count = 1)
73{
74 return (c << (32 - count)) | (c >> count);
75}
76
77static inline uint32_t
78rotate_left (uint32_t c, uint32_t count = 1)
79{
80 return (c >> (32 - count)) | (c << count);
81}
82
83// Return abs(a-b)
84// Both a and b must not have the most significant bit set
85static inline uint32_t
86upos_abs_diff (uint32_t a, uint32_t b)
87{
88 long d1 = b - a;
89 long d2 = (d1 & (d1 >> 31)) << 1;
90
91 return d1 - d2; // == (b - d) - (a + d);
92}
93
94// Both a and b must not have the most significant bit set
95static inline uint32_t
96upos_min (uint32_t a, uint32_t b)
97{
98 int32_t d = b - a;
99 d &= d >> 31;
100 return a + d;
101}
102
103// Both a and b must not have the most significant bit set
104static inline uint32_t
105upos_max (uint32_t a, uint32_t b)
106{
107 int32_t d = b - a;
108 d &= d >> 31;
109 return b - d;
110}
37 111
38// this is much faster than crossfires original algorithm 112// this is much faster than crossfires original algorithm
39// on modern cpus 113// on modern cpus
40inline int 114inline int
41isqrt (int n) 115isqrt (int n)
… …
58#if 0 132#if 0
59 return dx_ > dy_ 133 return dx_ > dy_
60 ? (dx_ * 61685 + dy_ * 26870) >> 16 134 ? (dx_ * 61685 + dy_ * 26870) >> 16
61 : (dy_ * 61685 + dx_ * 26870) >> 16; 135 : (dy_ * 61685 + dx_ * 26870) >> 16;
62#else 136#else
63 return dx + dy - min (dx, dy) * 5 / 8; 137 return dx_ + dy_ - min (dx_, dy_) * 5 / 8;
64#endif 138#endif
65} 139}
66 140
67/* 141/*
68 * absdir(int): Returns a number between 1 and 8, which represent 142 * absdir(int): Returns a number between 1 and 8, which represent
… …
123 197
124// for symmetry 198// for symmetry
125template<typename T> 199template<typename T>
126inline void sfree (T *ptr, int n = 1) throw () 200inline void sfree (T *ptr, int n = 1) throw ()
127{ 201{
202#ifdef PREFER_MALLOC
203 free (ptr);
204#else
128 g_slice_free1 (n * sizeof (T), (void *)ptr); 205 g_slice_free1 (n * sizeof (T), (void *)ptr);
206#endif
129} 207}
130 208
131// a STL-compatible allocator that uses g_slice 209// a STL-compatible allocator that uses g_slice
132// boy, this is verbose 210// boy, this is verbose
133template<typename Tp> 211template<typename Tp>
… …
180 void destroy (pointer p) 258 void destroy (pointer p)
181 { 259 {
182 p->~Tp (); 260 p->~Tp ();
183 } 261 }
184}; 262};
263
264// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
265// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
266// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
267struct tausworthe_random_generator
268{
269 // generator
270 uint32_t state [4];
271
272 void operator =(const tausworthe_random_generator &src)
273 {
274 state [0] = src.state [0];
275 state [1] = src.state [1];
276 state [2] = src.state [2];
277 state [3] = src.state [3];
278 }
279
280 void seed (uint32_t seed);
281 uint32_t next ();
282
283 // uniform distribution
284 uint32_t operator ()(uint32_t num)
285 {
286 return is_constant (num)
287 ? (next () * (uint64_t)num) >> 32U
288 : get_range (num);
289 }
290
291 // return a number within (min .. max)
292 int operator () (int r_min, int r_max)
293 {
294 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
295 ? r_min + operator ()(r_max - r_min + 1)
296 : get_range (r_min, r_max);
297 }
298
299 double operator ()()
300 {
301 return this->next () / (double)0xFFFFFFFFU;
302 }
303
304protected:
305 uint32_t get_range (uint32_t r_max);
306 int get_range (int r_min, int r_max);
307};
308
309typedef tausworthe_random_generator rand_gen;
310
311extern rand_gen rndm;
185 312
186template<class T> 313template<class T>
187struct refptr 314struct refptr
188{ 315{
189 T *p; 316 T *p;
… …
289 } 416 }
290 417
291 void erase (T *obj) 418 void erase (T *obj)
292 { 419 {
293 assert (obj->*index); 420 assert (obj->*index);
294 int pos = obj->*index; 421 unsigned int pos = obj->*index;
295 obj->*index = 0; 422 obj->*index = 0;
296 423
297 if (pos < this->size ()) 424 if (pos < this->size ())
298 { 425 {
299 (*this)[pos - 1] = (*this)[this->size () - 1]; 426 (*this)[pos - 1] = (*this)[this->size () - 1];
… …
307 { 434 {
308 errase (&obj); 435 errase (&obj);
309 } 436 }
310}; 437};
311 438
312template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
313template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
314template<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; }
315
316template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
317
318// basically does what strncpy should do, but appends "..." to strings exceeding length 439// basically does what strncpy should do, but appends "..." to strings exceeding length
319void assign (char *dst, const char *src, int maxlen); 440void assign (char *dst, const char *src, int maxlen);
320 441
321// type-safe version of assign 442// type-safe version of assign
322template<int N> 443template<int N>
… …
330// return current time as timestampe 451// return current time as timestampe
331tstamp now (); 452tstamp now ();
332 453
333int similar_direction (int a, int b); 454int similar_direction (int a, int b);
334 455
456// like printf, but returns a std::string
457const std::string format (const char *format, ...);
458
335#endif 459#endif
336 460

Diff Legend

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