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.23 by root, Sat Dec 23 16:05:19 2006 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
8#endif 10#endif
9 11
10#include <cstddef> 12#include <cstddef>
13#include <cmath>
14#include <new>
15#include <vector>
11 16
12#include <glib.h> 17#include <glib.h>
18
19#include <shstr.h>
20#include <traits.h>
13 21
14// 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
15#define AUTODECL(var,expr) typeof(expr) var = (expr) 23#define AUTODECL(var,expr) typeof(expr) var = (expr)
24
25// very ugly macro that basicaly declares and initialises a variable
26// that is in scope for the next statement only
27// works only for stuff that can be assigned 0 and converts to false
28// (note: works great for pointers)
29// most ugly macro I ever wrote
30#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
31
32// in range including end
33#define IN_RANGE_INC(val,beg,end) \
34 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
35
36// in range excluding end
37#define IN_RANGE_EXC(val,beg,end) \
38 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
39
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}
94
95// this is much faster than crossfires original algorithm
96// on modern cpus
97inline int
98isqrt (int n)
99{
100 return (int)sqrtf ((float)n);
101}
102
103// this is only twice as fast as naive sqrtf (dx*dy+dy*dy)
104#if 0
105// and has a max. error of 6 in the range -100..+100.
106#else
107// and has a max. error of 9 in the range -100..+100.
108#endif
109inline int
110idistance (int dx, int dy)
111{
112 unsigned int dx_ = abs (dx);
113 unsigned int dy_ = abs (dy);
114
115#if 0
116 return dx_ > dy_
117 ? (dx_ * 61685 + dy_ * 26870) >> 16
118 : (dy_ * 61685 + dx_ * 26870) >> 16;
119#else
120 return dx_ + dy_ - min (dx_, dy_) * 5 / 8;
121#endif
122}
123
124/*
125 * absdir(int): Returns a number between 1 and 8, which represent
126 * the "absolute" direction of a number (it actually takes care of
127 * "overflow" in previous calculations of a direction).
128 */
129inline int
130absdir (int d)
131{
132 return ((d - 1) & 7) + 1;
133}
16 134
17// makes dynamically allocated objects zero-initialised 135// makes dynamically allocated objects zero-initialised
18struct zero_initialised 136struct zero_initialised
19{ 137{
20 void *operator new (size_t s, void *p) 138 void *operator new (size_t s, void *p)
… …
62 180
63// for symmetry 181// for symmetry
64template<typename T> 182template<typename T>
65inline void sfree (T *ptr, int n = 1) throw () 183inline void sfree (T *ptr, int n = 1) throw ()
66{ 184{
185#ifdef PREFER_MALLOC
186 free (ptr);
187#else
67 g_slice_free1 (n * sizeof (T), (void *)ptr); 188 g_slice_free1 (n * sizeof (T), (void *)ptr);
189#endif
68} 190}
69 191
70// a STL-compatible allocator that uses g_slice 192// a STL-compatible allocator that uses g_slice
71// boy, this is verbose 193// boy, this is verbose
72template<typename Tp> 194template<typename Tp>
… …
120 { 242 {
121 p->~Tp (); 243 p->~Tp ();
122 } 244 }
123}; 245};
124 246
125struct refcounted 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
126{ 251{
127 refcounted () : refcnt (0) { } 252 // generator
128 virtual ~refcounted (); 253 uint32_t state [4];
129 void refcnt_inc () { ++refcnt; } 254
130 void refcnt_dec () { --refcnt; } 255 void operator =(const tausworthe_random_generator &src)
131 bool dead () { return refcnt == 0; } 256 {
132 mutable int refcnt; 257 state [0] = src.state [0];
133#if 0 258 state [1] = src.state [1];
134private: 259 state [2] = src.state [2];
135 static refcounted *rc_first; 260 state [3] = src.state [3];
136 refcounted *rc_next; 261 }
137#endif 262
263 void seed (uint32_t seed);
264 uint32_t next ();
265
266 // uniform distribution
267 uint32_t operator ()(uint32_t r_max)
268 {
269 return is_constant (r_max)
270 ? this->next () % r_max
271 : get_range (r_max);
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)
278 ? r_min + (*this) (max (r_max - r_min + 1, 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);
138}; 290};
291
292typedef tausworthe_random_generator rand_gen;
293
294extern rand_gen rndm;
139 295
140template<class T> 296template<class T>
141struct refptr 297struct refptr
142{ 298{
143 T *p; 299 T *p;
… …
166 T *operator ->() const { return p; } 322 T *operator ->() const { return p; }
167 323
168 operator T *() const { return p; } 324 operator T *() const { return p; }
169}; 325};
170 326
171typedef refptr<player> player_ptr; 327typedef refptr<maptile> maptile_ptr;
172typedef refptr<object> object_ptr; 328typedef refptr<object> object_ptr;
173typedef refptr<archetype> arch_ptr; 329typedef refptr<archetype> arch_ptr;
330typedef refptr<client> client_ptr;
331typedef refptr<player> player_ptr;
174 332
175struct str_hash 333struct str_hash
176{ 334{
177 std::size_t operator ()(const char *s) const 335 std::size_t operator ()(const char *s) const
178 { 336 {
… …
204 { 362 {
205 return !strcmp (a, b); 363 return !strcmp (a, b);
206 } 364 }
207}; 365};
208 366
209#include <vector>
210
211template<class obj> 367template<class T>
212struct unordered_vector : std::vector<obj, slice_allocator<obj> > 368struct unordered_vector : std::vector<T, slice_allocator<T> >
213{ 369{
214 typedef typename unordered_vector::iterator iterator; 370 typedef typename unordered_vector::iterator iterator;
215 371
216 void erase (unsigned int pos) 372 void erase (unsigned int pos)
217 { 373 {
… …
225 { 381 {
226 erase ((unsigned int )(i - this->begin ())); 382 erase ((unsigned int )(i - this->begin ()));
227 } 383 }
228}; 384};
229 385
230template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 386template<class T, int T::* index>
231template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 387struct object_vector : std::vector<T *, slice_allocator<T *> >
232template<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; } 388{
389 void insert (T *obj)
390 {
391 assert (!(obj->*index));
392 push_back (obj);
393 obj->*index = this->size ();
394 }
233 395
234template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 396 void insert (T &obj)
397 {
398 insert (&obj);
399 }
400
401 void erase (T *obj)
402 {
403 assert (obj->*index);
404 unsigned int pos = obj->*index;
405 obj->*index = 0;
406
407 if (pos < this->size ())
408 {
409 (*this)[pos - 1] = (*this)[this->size () - 1];
410 (*this)[pos - 1]->*index = pos;
411 }
412
413 this->pop_back ();
414 }
415
416 void erase (T &obj)
417 {
418 errase (&obj);
419 }
420};
235 421
236// 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
237void assign (char *dst, const char *src, int maxlen); 423void assign (char *dst, const char *src, int maxlen);
238 424
239// type-safe version of assign 425// type-safe version of assign
… …
246typedef double tstamp; 432typedef double tstamp;
247 433
248// return current time as timestampe 434// return current time as timestampe
249tstamp now (); 435tstamp now ();
250 436
437int similar_direction (int a, int b);
438
251#endif 439#endif
252 440

Diff Legend

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