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.16 by root, Fri Nov 17 19:40:54 2006 UTC vs.
Revision 1.28 by root, Mon Jan 15 01:25:41 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
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
17// makes dynamically allocated objects zero-initialised 68// makes dynamically allocated objects zero-initialised
18struct zero_initialised 69struct zero_initialised
19{ 70{
20 void *operator new (size_t s, void *p) 71 void *operator new (size_t s, void *p)
21 { 72 {
… …
42 { 93 {
43 g_slice_free1 (s, p); 94 g_slice_free1 (s, p);
44 } 95 }
45}; 96};
46 97
98void *salloc_ (int n) throw (std::bad_alloc);
99void *salloc_ (int n, void *src) throw (std::bad_alloc);
100
47// strictly the same as g_slice_alloc, but never returns 0 101// strictly the same as g_slice_alloc, but never returns 0
48void *alloc (int s) throw (std::bad_alloc); 102template<typename T>
103inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
104
105// also copies src into the new area, like "memdup"
106// if src is 0, clears the memory
107template<typename T>
108inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
109
110// clears the memory
111template<typename T>
112inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
113
49// for symmetry 114// for symmetry
50inline void dealloc (void *p, int s) throw () 115template<typename T>
116inline void sfree (T *ptr, int n = 1) throw ()
51{ 117{
52 g_slice_free1 (s, p); 118 g_slice_free1 (n * sizeof (T), (void *)ptr);
53} 119}
54 120
55// a STL-compatible allocator that uses g_slice 121// a STL-compatible allocator that uses g_slice
56// boy, this is verbose 122// boy, this is verbose
57template<typename Tp> 123template<typename Tp>
… …
81 pointer address (reference x) const { return &x; } 147 pointer address (reference x) const { return &x; }
82 const_pointer address (const_reference x) const { return &x; } 148 const_pointer address (const_reference x) const { return &x; }
83 149
84 pointer allocate (size_type n, const_pointer = 0) 150 pointer allocate (size_type n, const_pointer = 0)
85 { 151 {
86 return static_cast<pointer>(alloc (n * sizeof (Tp))); 152 return salloc<Tp> (n);
87 } 153 }
88 154
89 void deallocate (pointer p, size_type n) 155 void deallocate (pointer p, size_type n)
90 { 156 {
91 dealloc (static_cast<void *>(p), n * sizeof (Tp)); 157 sfree<Tp> (p, n);
92 } 158 }
93 159
94 size_type max_size ()const throw () 160 size_type max_size ()const throw ()
95 { 161 {
96 return size_t (-1) / sizeof (Tp); 162 return size_t (-1) / sizeof (Tp);
… …
103 169
104 void destroy (pointer p) 170 void destroy (pointer p)
105 { 171 {
106 p->~Tp (); 172 p->~Tp ();
107 } 173 }
108};
109
110struct refcounted
111{
112 refcounted () : refcnt (0) { }
113// virtual ~refcounted ();
114 void refcnt_inc () { ++refcnt; }
115 void refcnt_dec () { --refcnt; }
116 bool dead () { return refcnt == 0; }
117 mutable int refcnt;
118#if 0
119private:
120 static refcounted *rc_first;
121 refcounted *rc_next;
122#endif
123}; 174};
124 175
125template<class T> 176template<class T>
126struct refptr 177struct refptr
127{ 178{
… …
150 T &operator * () const { return *p; } 201 T &operator * () const { return *p; }
151 T *operator ->() const { return p; } 202 T *operator ->() const { return p; }
152 203
153 operator T *() const { return p; } 204 operator T *() const { return p; }
154}; 205};
206
207typedef refptr<maptile> maptile_ptr;
208typedef refptr<object> object_ptr;
209typedef refptr<archetype> arch_ptr;
210typedef refptr<client> client_ptr;
211typedef refptr<player> player_ptr;
155 212
156struct str_hash 213struct str_hash
157{ 214{
158 std::size_t operator ()(const char *s) const 215 std::size_t operator ()(const char *s) const
159 { 216 {
… …
185 { 242 {
186 return !strcmp (a, b); 243 return !strcmp (a, b);
187 } 244 }
188}; 245};
189 246
190#include <vector>
191
192template<class obj> 247template<class T>
193struct unordered_vector : std::vector<obj, slice_allocator<obj> > 248struct unordered_vector : std::vector<T, slice_allocator<T> >
194{ 249{
195 typedef typename unordered_vector::iterator iterator; 250 typedef typename unordered_vector::iterator iterator;
196 251
197 void erase (unsigned int pos) 252 void erase (unsigned int pos)
198 { 253 {
… …
203 } 258 }
204 259
205 void erase (iterator i) 260 void erase (iterator i)
206 { 261 {
207 erase ((unsigned int )(i - this->begin ())); 262 erase ((unsigned int )(i - this->begin ()));
263 }
264};
265
266template<class T, int T::* index>
267struct object_vector : std::vector<T *, slice_allocator<T *> >
268{
269 void insert (T *obj)
270 {
271 assert (!(obj->*index));
272 push_back (obj);
273 obj->*index = this->size ();
274 }
275
276 void insert (T &obj)
277 {
278 insert (&obj);
279 }
280
281 void erase (T *obj)
282 {
283 assert (obj->*index);
284 int pos = obj->*index;
285 obj->*index = 0;
286
287 if (pos < this->size ())
288 {
289 (*this)[pos - 1] = (*this)[this->size () - 1];
290 (*this)[pos - 1]->*index = pos;
291 }
292
293 this->pop_back ();
294 }
295
296 void erase (T &obj)
297 {
298 errase (&obj);
208 } 299 }
209}; 300};
210 301
211template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 302template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
212template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 303template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
… …
222inline void assign (char (&dst)[N], const char *src) 313inline void assign (char (&dst)[N], const char *src)
223{ 314{
224 assign ((char *)&dst, src, N); 315 assign ((char *)&dst, src, N);
225} 316}
226 317
318typedef double tstamp;
319
320// return current time as timestampe
321tstamp now ();
322
323int similar_direction (int a, int b);
324
227#endif 325#endif
228 326

Diff Legend

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