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.13 by root, Thu Sep 14 00:07:15 2006 UTC vs.
Revision 1.30 by root, Mon Jan 15 01:50:33 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>
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
38// this is much faster than crossfires original algorithm
39// on modern cpus
40inline int
41isqrt (int n)
42{
43 return (int)sqrtf ((float)n);
44}
45
46// this is only twice as fast as naive sqrtf (dx*dy+dy*dy)
47#if 0
48// and has a max. error of 6 in the range -100..+100.
49#else
50// and has a max. error of 9 in the range -100..+100.
51#endif
52inline int
53idistance (int dx, int dy)
54{
55 unsigned int dx_ = abs (dx);
56 unsigned int dy_ = abs (dy);
57
58#if 0
59 return dx_ > dy_
60 ? (dx_ * 61685 + dy_ * 26870) >> 16
61 : (dy_ * 61685 + dx_ * 26870) >> 16;
62#else
63 return dx_ + dy_ - min (dx_, dy_) * 5 / 8;
64#endif
65}
66
67/*
68 * absdir(int): Returns a number between 1 and 8, which represent
69 * the "absolute" direction of a number (it actually takes care of
70 * "overflow" in previous calculations of a direction).
71 */
72inline int
73absdir (int d)
74{
75 return ((d - 1) & 7) + 1;
76}
13 77
14// makes dynamically allocated objects zero-initialised 78// makes dynamically allocated objects zero-initialised
15struct zero_initialised 79struct zero_initialised
16{ 80{
17 void *operator new (size_t s, void *p) 81 void *operator new (size_t s, void *p)
… …
39 { 103 {
40 g_slice_free1 (s, p); 104 g_slice_free1 (s, p);
41 } 105 }
42}; 106};
43 107
108void *salloc_ (int n) throw (std::bad_alloc);
109void *salloc_ (int n, void *src) throw (std::bad_alloc);
110
44// strictly the same as g_slice_alloc, but never returns 0 111// strictly the same as g_slice_alloc, but never returns 0
45void *alloc (int s) throw (std::bad_alloc); 112template<typename T>
113inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
114
115// also copies src into the new area, like "memdup"
116// if src is 0, clears the memory
117template<typename T>
118inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
119
120// clears the memory
121template<typename T>
122inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
123
46// for symmetry 124// for symmetry
47inline void dealloc (void *p, int s) throw () 125template<typename T>
126inline void sfree (T *ptr, int n = 1) throw ()
48{ 127{
49 g_slice_free1 (s, p); 128 g_slice_free1 (n * sizeof (T), (void *)ptr);
50} 129}
51 130
52// a STL-compatible allocator that uses g_slice 131// a STL-compatible allocator that uses g_slice
53// boy, this is verbose 132// boy, this is verbose
54template<typename Tp> 133template<typename Tp>
… …
78 pointer address (reference x) const { return &x; } 157 pointer address (reference x) const { return &x; }
79 const_pointer address (const_reference x) const { return &x; } 158 const_pointer address (const_reference x) const { return &x; }
80 159
81 pointer allocate (size_type n, const_pointer = 0) 160 pointer allocate (size_type n, const_pointer = 0)
82 { 161 {
83 return static_cast<pointer>(alloc (n * sizeof (Tp))); 162 return salloc<Tp> (n);
84 } 163 }
85 164
86 void deallocate (pointer p, size_type n) 165 void deallocate (pointer p, size_type n)
87 { 166 {
88 dealloc (static_cast<void *>(p), n * sizeof (Tp)); 167 sfree<Tp> (p, n);
89 } 168 }
90 169
91 size_type max_size ()const throw () 170 size_type max_size ()const throw ()
92 { 171 {
93 return size_t (-1) / sizeof (Tp); 172 return size_t (-1) / sizeof (Tp);
… …
100 179
101 void destroy (pointer p) 180 void destroy (pointer p)
102 { 181 {
103 p->~Tp (); 182 p->~Tp ();
104 } 183 }
105};
106
107struct refcounted
108{
109 mutable int refcnt;
110 refcounted () : refcnt (0) { }
111 void refcnt_inc () { ++refcnt; }
112 void refcnt_dec () { --refcnt;
113 if (refcnt < 0)abort();}//D
114}; 184};
115 185
116template<class T> 186template<class T>
117struct refptr 187struct refptr
118{ 188{
… …
141 T &operator * () const { return *p; } 211 T &operator * () const { return *p; }
142 T *operator ->() const { return p; } 212 T *operator ->() const { return p; }
143 213
144 operator T *() const { return p; } 214 operator T *() const { return p; }
145}; 215};
216
217typedef refptr<maptile> maptile_ptr;
218typedef refptr<object> object_ptr;
219typedef refptr<archetype> arch_ptr;
220typedef refptr<client> client_ptr;
221typedef refptr<player> player_ptr;
146 222
147struct str_hash 223struct str_hash
148{ 224{
149 std::size_t operator ()(const char *s) const 225 std::size_t operator ()(const char *s) const
150 { 226 {
… …
176 { 252 {
177 return !strcmp (a, b); 253 return !strcmp (a, b);
178 } 254 }
179}; 255};
180 256
181#include <vector>
182
183template<class obj> 257template<class T>
184struct unordered_vector : std::vector<obj, slice_allocator<obj> > 258struct unordered_vector : std::vector<T, slice_allocator<T> >
185{ 259{
186 typedef typename unordered_vector::iterator iterator; 260 typedef typename unordered_vector::iterator iterator;
187 261
188 void erase (unsigned int pos) 262 void erase (unsigned int pos)
189 { 263 {
… …
194 } 268 }
195 269
196 void erase (iterator i) 270 void erase (iterator i)
197 { 271 {
198 erase ((unsigned int )(i - this->begin ())); 272 erase ((unsigned int )(i - this->begin ()));
273 }
274};
275
276template<class T, int T::* index>
277struct object_vector : std::vector<T *, slice_allocator<T *> >
278{
279 void insert (T *obj)
280 {
281 assert (!(obj->*index));
282 push_back (obj);
283 obj->*index = this->size ();
284 }
285
286 void insert (T &obj)
287 {
288 insert (&obj);
289 }
290
291 void erase (T *obj)
292 {
293 assert (obj->*index);
294 int pos = obj->*index;
295 obj->*index = 0;
296
297 if (pos < this->size ())
298 {
299 (*this)[pos - 1] = (*this)[this->size () - 1];
300 (*this)[pos - 1]->*index = pos;
301 }
302
303 this->pop_back ();
304 }
305
306 void erase (T &obj)
307 {
308 errase (&obj);
199 } 309 }
200}; 310};
201 311
202template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 312template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
203template<typename T, typename U> static inline T max (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; }
… …
213inline void assign (char (&dst)[N], const char *src) 323inline void assign (char (&dst)[N], const char *src)
214{ 324{
215 assign ((char *)&dst, src, N); 325 assign ((char *)&dst, src, N);
216} 326}
217 327
328typedef double tstamp;
329
330// return current time as timestampe
331tstamp now ();
332
333int similar_direction (int a, int b);
334
218#endif 335#endif
219 336

Diff Legend

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