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.10 by root, Tue Sep 12 19:20:08 2006 UTC vs.
Revision 1.35 by root, Fri Jan 19 22:47:57 2007 UTC

… …
5# define is_constant(c) __builtin_constant_p (c) 5# define is_constant(c) __builtin_constant_p (c)
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>
11#include <cmath>
12#include <new>
13#include <vector>
14
15#include <glib.h>
16
17#include <shstr.h>
18#include <traits.h>
19
20// use a gcc extension for auto declarations until ISO C++ sanctifies them
21#define AUTODECL(var,expr) typeof(expr) var = (expr)
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
40// rationale for using (U) not (T) is to reduce signed/unsigned issues,
41// as a is often a constant while b is the variable. it is still a bug, though.
42template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
43template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
44template<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; }
45
46template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
47
48// this is much faster than crossfires original algorithm
49// on modern cpus
50inline int
51isqrt (int n)
52{
53 return (int)sqrtf ((float)n);
54}
55
56// this is only twice as fast as naive sqrtf (dx*dy+dy*dy)
57#if 0
58// and has a max. error of 6 in the range -100..+100.
59#else
60// and has a max. error of 9 in the range -100..+100.
61#endif
62inline int
63idistance (int dx, int dy)
64{
65 unsigned int dx_ = abs (dx);
66 unsigned int dy_ = abs (dy);
67
68#if 0
69 return dx_ > dy_
70 ? (dx_ * 61685 + dy_ * 26870) >> 16
71 : (dy_ * 61685 + dx_ * 26870) >> 16;
72#else
73 return dx_ + dy_ - min (dx_, dy_) * 5 / 8;
74#endif
75}
76
77/*
78 * absdir(int): Returns a number between 1 and 8, which represent
79 * the "absolute" direction of a number (it actually takes care of
80 * "overflow" in previous calculations of a direction).
81 */
82inline int
83absdir (int d)
84{
85 return ((d - 1) & 7) + 1;
86}
87
10// makes dynamically allocated objects zero-initialised 88// makes dynamically allocated objects zero-initialised
11struct zero_initialised 89struct zero_initialised
12{ 90{
13 void *operator new (size_t s, void *); 91 void *operator new (size_t s, void *p)
92 {
93 memset (p, 0, s);
94 return p;
95 }
96
14 void *operator new (size_t s); 97 void *operator new (size_t s)
98 {
99 return g_slice_alloc0 (s);
100 }
101
15 void *operator new [] (size_t s); 102 void *operator new[] (size_t s)
103 {
104 return g_slice_alloc0 (s);
105 }
106
16 void operator delete (void *p, size_t s); 107 void operator delete (void *p, size_t s)
108 {
109 g_slice_free1 (s, p);
110 }
111
17 void operator delete [] (void *p, size_t s); 112 void operator delete[] (void *p, size_t s)
113 {
114 g_slice_free1 (s, p);
115 }
18}; 116};
19 117
20struct refcounted 118void *salloc_ (int n) throw (std::bad_alloc);
119void *salloc_ (int n, void *src) throw (std::bad_alloc);
120
121// strictly the same as g_slice_alloc, but never returns 0
122template<typename T>
123inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
124
125// also copies src into the new area, like "memdup"
126// if src is 0, clears the memory
127template<typename T>
128inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
129
130// clears the memory
131template<typename T>
132inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
133
134// for symmetry
135template<typename T>
136inline void sfree (T *ptr, int n = 1) throw ()
21{ 137{
22 mutable int refcnt; 138 g_slice_free1 (n * sizeof (T), (void *)ptr);
23 refcounted () : refcnt (0) { } 139}
24 void refcnt_inc () { ++refcnt; } 140
25 void refcnt_dec () { --refcnt; 141// a STL-compatible allocator that uses g_slice
26 if (refcnt < 0)abort();}//D 142// boy, this is verbose
143template<typename Tp>
144struct slice_allocator
145{
146 typedef size_t size_type;
147 typedef ptrdiff_t difference_type;
148 typedef Tp *pointer;
149 typedef const Tp *const_pointer;
150 typedef Tp &reference;
151 typedef const Tp &const_reference;
152 typedef Tp value_type;
153
154 template <class U>
155 struct rebind
156 {
157 typedef slice_allocator<U> other;
158 };
159
160 slice_allocator () throw () { }
161 slice_allocator (const slice_allocator &o) throw () { }
162 template<typename Tp2>
163 slice_allocator (const slice_allocator<Tp2> &) throw () { }
164
165 ~slice_allocator () { }
166
167 pointer address (reference x) const { return &x; }
168 const_pointer address (const_reference x) const { return &x; }
169
170 pointer allocate (size_type n, const_pointer = 0)
171 {
172 return salloc<Tp> (n);
173 }
174
175 void deallocate (pointer p, size_type n)
176 {
177 sfree<Tp> (p, n);
178 }
179
180 size_type max_size ()const throw ()
181 {
182 return size_t (-1) / sizeof (Tp);
183 }
184
185 void construct (pointer p, const Tp &val)
186 {
187 ::new (p) Tp (val);
188 }
189
190 void destroy (pointer p)
191 {
192 p->~Tp ();
193 }
27}; 194};
195
196// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
197// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
198// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
199struct tausworthe_random_generator
200{
201 // generator
202 uint32_t state [4];
203
204 void operator =(const tausworthe_random_generator &src)
205 {
206 state [0] = src.state [0];
207 state [1] = src.state [1];
208 state [2] = src.state [2];
209 state [3] = src.state [3];
210 }
211
212 void seed (uint32_t seed);
213 uint32_t next ();
214
215 // uniform distribution
216 uint32_t operator ()(uint32_t r_max)
217 {
218 return is_constant (r_max)
219 ? this->next () % r_max
220 : get_range (r_max);
221 }
222
223 // return a number within (min .. max)
224 int operator () (int r_min, int r_max)
225 {
226 return is_constant (r_min) && is_constant (r_max)
227 ? r_min + (*this) (max (r_max - r_min + 1, 1))
228 : get_range (r_min, r_max);
229 }
230
231 double operator ()()
232 {
233 return this->next () / (double)0xFFFFFFFFU;
234 }
235
236protected:
237 uint32_t get_range (uint32_t r_max);
238 int get_range (int r_min, int r_max);
239};
240
241typedef tausworthe_random_generator rand_gen;
242
243extern rand_gen rndm;
28 244
29template<class T> 245template<class T>
30struct refptr 246struct refptr
31{ 247{
32 T *p; 248 T *p;
… …
54 T &operator * () const { return *p; } 270 T &operator * () const { return *p; }
55 T *operator ->() const { return p; } 271 T *operator ->() const { return p; }
56 272
57 operator T *() const { return p; } 273 operator T *() const { return p; }
58}; 274};
275
276typedef refptr<maptile> maptile_ptr;
277typedef refptr<object> object_ptr;
278typedef refptr<archetype> arch_ptr;
279typedef refptr<client> client_ptr;
280typedef refptr<player> player_ptr;
59 281
60struct str_hash 282struct str_hash
61{ 283{
62 std::size_t operator ()(const char *s) const 284 std::size_t operator ()(const char *s) const
63 { 285 {
… …
89 { 311 {
90 return !strcmp (a, b); 312 return !strcmp (a, b);
91 } 313 }
92}; 314};
93 315
94#include <vector>
95
96template<class obj> 316template<class T>
97struct unordered_vector : std::vector<obj> 317struct unordered_vector : std::vector<T, slice_allocator<T> >
98{ 318{
99 typedef typename std::vector<obj>::iterator iterator; 319 typedef typename unordered_vector::iterator iterator;
100 320
101 void erase (unsigned int pos) 321 void erase (unsigned int pos)
102 { 322 {
103 if (pos < this->size () - 1) 323 if (pos < this->size () - 1)
104 (*this)[pos] = (*this)[this->size () - 1]; 324 (*this)[pos] = (*this)[this->size () - 1];
… …
110 { 330 {
111 erase ((unsigned int )(i - this->begin ())); 331 erase ((unsigned int )(i - this->begin ()));
112 } 332 }
113}; 333};
114 334
115template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 335template<class T, int T::* index>
116template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 336struct object_vector : std::vector<T *, slice_allocator<T *> >
117template<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; } 337{
338 void insert (T *obj)
339 {
340 assert (!(obj->*index));
341 push_back (obj);
342 obj->*index = this->size ();
343 }
118 344
119template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 345 void insert (T &obj)
346 {
347 insert (&obj);
348 }
349
350 void erase (T *obj)
351 {
352 assert (obj->*index);
353 int pos = obj->*index;
354 obj->*index = 0;
355
356 if (pos < this->size ())
357 {
358 (*this)[pos - 1] = (*this)[this->size () - 1];
359 (*this)[pos - 1]->*index = pos;
360 }
361
362 this->pop_back ();
363 }
364
365 void erase (T &obj)
366 {
367 errase (&obj);
368 }
369};
120 370
121// basically does what strncpy should do, but appends "..." to strings exceeding length 371// basically does what strncpy should do, but appends "..." to strings exceeding length
122void assign (char *dst, const char *src, int maxlen); 372void assign (char *dst, const char *src, int maxlen);
123 373
124// type-safe version of assign 374// type-safe version of assign
… …
126inline void assign (char (&dst)[N], const char *src) 376inline void assign (char (&dst)[N], const char *src)
127{ 377{
128 assign ((char *)&dst, src, N); 378 assign ((char *)&dst, src, N);
129} 379}
130 380
381typedef double tstamp;
382
383// return current time as timestampe
384tstamp now ();
385
386int similar_direction (int a, int b);
387
131#endif 388#endif
132 389

Diff Legend

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