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.14 by root, Thu Sep 14 18:13:02 2006 UTC vs.
Revision 1.32 by root, Thu Jan 18 19:32:37 2007 UTC

… …
6#else 6#else
7# define is_constant(c) 0 7# define is_constant(c) 0
8#endif 8#endif
9 9
10#include <cstddef> 10#include <cstddef>
11#include <cmath>
12#include <new>
13#include <vector>
11 14
12#include <glib.h> 15#include <glib.h>
16
17#include <shstr.h>
18#include <traits.h>
13 19
14// use a gcc extension for auto declarations until ISO C++ sanctifies them 20// use a gcc extension for auto declarations until ISO C++ sanctifies them
15#define AUTODECL(var,expr) typeof(expr) var = (expr) 21#define AUTODECL(var,expr) typeof(expr) var = (expr)
16 22
23// very ugly macro that basicaly declares and initialises a variable
24// that is in scope for the next statement only
25// works only for stuff that can be assigned 0 and converts to false
26// (note: works great for pointers)
27// most ugly macro I ever wrote
28#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
29
30// in range including end
31#define IN_RANGE_INC(val,beg,end) \
32 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
33
34// in range excluding end
35#define IN_RANGE_EXC(val,beg,end) \
36 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
37
38void fork_abort (const char *msg);
39
40template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
41template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)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; }
43
44template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
45
46// this is much faster than crossfires original algorithm
47// on modern cpus
48inline int
49isqrt (int n)
50{
51 return (int)sqrtf ((float)n);
52}
53
54// this is only twice as fast as naive sqrtf (dx*dy+dy*dy)
55#if 0
56// and has a max. error of 6 in the range -100..+100.
57#else
58// and has a max. error of 9 in the range -100..+100.
59#endif
60inline int
61idistance (int dx, int dy)
62{
63 unsigned int dx_ = abs (dx);
64 unsigned int dy_ = abs (dy);
65
66#if 0
67 return dx_ > dy_
68 ? (dx_ * 61685 + dy_ * 26870) >> 16
69 : (dy_ * 61685 + dx_ * 26870) >> 16;
70#else
71 return dx_ + dy_ - min (dx_, dy_) * 5 / 8;
72#endif
73}
74
75/*
76 * absdir(int): Returns a number between 1 and 8, which represent
77 * the "absolute" direction of a number (it actually takes care of
78 * "overflow" in previous calculations of a direction).
79 */
80inline int
81absdir (int d)
82{
83 return ((d - 1) & 7) + 1;
84}
85
17// makes dynamically allocated objects zero-initialised 86// makes dynamically allocated objects zero-initialised
18struct zero_initialised 87struct zero_initialised
19{ 88{
20 void *operator new (size_t s, void *p) 89 void *operator new (size_t s, void *p)
21 { 90 {
… …
42 { 111 {
43 g_slice_free1 (s, p); 112 g_slice_free1 (s, p);
44 } 113 }
45}; 114};
46 115
116void *salloc_ (int n) throw (std::bad_alloc);
117void *salloc_ (int n, void *src) throw (std::bad_alloc);
118
47// strictly the same as g_slice_alloc, but never returns 0 119// strictly the same as g_slice_alloc, but never returns 0
48void *alloc (int s) throw (std::bad_alloc); 120template<typename T>
121inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
122
123// also copies src into the new area, like "memdup"
124// if src is 0, clears the memory
125template<typename T>
126inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
127
128// clears the memory
129template<typename T>
130inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
131
49// for symmetry 132// for symmetry
50inline void dealloc (void *p, int s) throw () 133template<typename T>
134inline void sfree (T *ptr, int n = 1) throw ()
51{ 135{
52 g_slice_free1 (s, p); 136 g_slice_free1 (n * sizeof (T), (void *)ptr);
53} 137}
54 138
55// a STL-compatible allocator that uses g_slice 139// a STL-compatible allocator that uses g_slice
56// boy, this is verbose 140// boy, this is verbose
57template<typename Tp> 141template<typename Tp>
… …
81 pointer address (reference x) const { return &x; } 165 pointer address (reference x) const { return &x; }
82 const_pointer address (const_reference x) const { return &x; } 166 const_pointer address (const_reference x) const { return &x; }
83 167
84 pointer allocate (size_type n, const_pointer = 0) 168 pointer allocate (size_type n, const_pointer = 0)
85 { 169 {
86 return static_cast<pointer>(alloc (n * sizeof (Tp))); 170 return salloc<Tp> (n);
87 } 171 }
88 172
89 void deallocate (pointer p, size_type n) 173 void deallocate (pointer p, size_type n)
90 { 174 {
91 dealloc (static_cast<void *>(p), n * sizeof (Tp)); 175 sfree<Tp> (p, n);
92 } 176 }
93 177
94 size_type max_size ()const throw () 178 size_type max_size ()const throw ()
95 { 179 {
96 return size_t (-1) / sizeof (Tp); 180 return size_t (-1) / sizeof (Tp);
… …
105 { 189 {
106 p->~Tp (); 190 p->~Tp ();
107 } 191 }
108}; 192};
109 193
110struct refcounted 194// 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
196// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
197struct tausworthe_random_generator
111{ 198{
112 mutable int refcnt; 199 uint32_t state [4];
113 refcounted () : refcnt (0) { } 200
114 void refcnt_inc () { ++refcnt; } 201 tausworthe_random_generator (uint32_t seed);
115 void refcnt_dec () { --refcnt; 202 uint32_t next ();
116 if (refcnt < 0)abort();}//D 203
204 uint32_t operator ()(uint32_t r_max)
205 {
206 return next () % r_max;
207 }
208
209 // return a number within (min .. max)
210 int operator () (int r_min, int r_max)
211 {
212 return r_min + next () % max (r_max - r_min + 1, 1);
213 }
214
215 double operator ()()
216 {
217 return next () / (double)0xFFFFFFFFU;
218 }
117}; 219};
220
221typedef tausworthe_random_generator rand_gen;
222
223extern rand_gen rndm;
118 224
119template<class T> 225template<class T>
120struct refptr 226struct refptr
121{ 227{
122 T *p; 228 T *p;
… …
144 T &operator * () const { return *p; } 250 T &operator * () const { return *p; }
145 T *operator ->() const { return p; } 251 T *operator ->() const { return p; }
146 252
147 operator T *() const { return p; } 253 operator T *() const { return p; }
148}; 254};
255
256typedef refptr<maptile> maptile_ptr;
257typedef refptr<object> object_ptr;
258typedef refptr<archetype> arch_ptr;
259typedef refptr<client> client_ptr;
260typedef refptr<player> player_ptr;
149 261
150struct str_hash 262struct str_hash
151{ 263{
152 std::size_t operator ()(const char *s) const 264 std::size_t operator ()(const char *s) const
153 { 265 {
… …
179 { 291 {
180 return !strcmp (a, b); 292 return !strcmp (a, b);
181 } 293 }
182}; 294};
183 295
184#include <vector>
185
186template<class obj> 296template<class T>
187struct unordered_vector : std::vector<obj, slice_allocator<obj> > 297struct unordered_vector : std::vector<T, slice_allocator<T> >
188{ 298{
189 typedef typename unordered_vector::iterator iterator; 299 typedef typename unordered_vector::iterator iterator;
190 300
191 void erase (unsigned int pos) 301 void erase (unsigned int pos)
192 { 302 {
… …
200 { 310 {
201 erase ((unsigned int )(i - this->begin ())); 311 erase ((unsigned int )(i - this->begin ()));
202 } 312 }
203}; 313};
204 314
205template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 315template<class T, int T::* index>
206template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 316struct object_vector : std::vector<T *, slice_allocator<T *> >
207template<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{
318 void insert (T *obj)
319 {
320 assert (!(obj->*index));
321 push_back (obj);
322 obj->*index = this->size ();
323 }
208 324
209template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 325 void insert (T &obj)
326 {
327 insert (&obj);
328 }
329
330 void erase (T *obj)
331 {
332 assert (obj->*index);
333 int pos = obj->*index;
334 obj->*index = 0;
335
336 if (pos < this->size ())
337 {
338 (*this)[pos - 1] = (*this)[this->size () - 1];
339 (*this)[pos - 1]->*index = pos;
340 }
341
342 this->pop_back ();
343 }
344
345 void erase (T &obj)
346 {
347 errase (&obj);
348 }
349};
210 350
211// basically does what strncpy should do, but appends "..." to strings exceeding length 351// basically does what strncpy should do, but appends "..." to strings exceeding length
212void assign (char *dst, const char *src, int maxlen); 352void assign (char *dst, const char *src, int maxlen);
213 353
214// type-safe version of assign 354// type-safe version of assign
… …
216inline void assign (char (&dst)[N], const char *src) 356inline void assign (char (&dst)[N], const char *src)
217{ 357{
218 assign ((char *)&dst, src, N); 358 assign ((char *)&dst, src, N);
219} 359}
220 360
361typedef double tstamp;
362
363// return current time as timestampe
364tstamp now ();
365
366int similar_direction (int a, int b);
367
221#endif 368#endif
222 369

Diff Legend

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