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

Diff Legend

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