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.11 by root, Tue Sep 12 20:55:40 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>
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
13 67
14// makes dynamically allocated objects zero-initialised 68// makes dynamically allocated objects zero-initialised
15struct zero_initialised 69struct zero_initialised
16{ 70{
17 void *operator new (size_t s, void *p) 71 void *operator new (size_t s, void *p)
… …
39 { 93 {
40 g_slice_free1 (s, p); 94 g_slice_free1 (s, p);
41 } 95 }
42}; 96};
43 97
44void throw_bad_alloc () throw (std::bad_alloc); 98void *salloc_ (int n) throw (std::bad_alloc);
45
46void *alloc (int s) throw (std::bad_alloc); 99void *salloc_ (int n, void *src) throw (std::bad_alloc);
47void dealloc (void *p, int s) throw (); 100
101// strictly the same as g_slice_alloc, but never returns 0
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
114// for symmetry
115template<typename T>
116inline void sfree (T *ptr, int n = 1) throw ()
117{
118 g_slice_free1 (n * sizeof (T), (void *)ptr);
119}
48 120
49// a STL-compatible allocator that uses g_slice 121// a STL-compatible allocator that uses g_slice
50// boy, this is verbose 122// boy, this is verbose
51template<typename Tp> 123template<typename Tp>
52struct slice_allocator 124struct slice_allocator
… …
75 pointer address (reference x) const { return &x; } 147 pointer address (reference x) const { return &x; }
76 const_pointer address (const_reference x) const { return &x; } 148 const_pointer address (const_reference x) const { return &x; }
77 149
78 pointer allocate (size_type n, const_pointer = 0) 150 pointer allocate (size_type n, const_pointer = 0)
79 { 151 {
80 return static_cast<pointer>(alloc (n * sizeof (Tp))); 152 return salloc<Tp> (n);
81 } 153 }
82 154
83 void deallocate (pointer p, size_type n) 155 void deallocate (pointer p, size_type n)
84 { 156 {
85 dealloc (static_cast<void *>(p), n); 157 sfree<Tp> (p, n);
86 } 158 }
87 159
88 size_type max_size ()const throw () 160 size_type max_size ()const throw ()
89 { 161 {
90 return size_t (-1) / sizeof (Tp); 162 return size_t (-1) / sizeof (Tp);
… …
97 169
98 void destroy (pointer p) 170 void destroy (pointer p)
99 { 171 {
100 p->~Tp (); 172 p->~Tp ();
101 } 173 }
102};
103
104struct refcounted
105{
106 mutable int refcnt;
107 refcounted () : refcnt (0) { }
108 void refcnt_inc () { ++refcnt; }
109 void refcnt_dec () { --refcnt;
110 if (refcnt < 0)abort();}//D
111}; 174};
112 175
113template<class T> 176template<class T>
114struct refptr 177struct refptr
115{ 178{
… …
138 T &operator * () const { return *p; } 201 T &operator * () const { return *p; }
139 T *operator ->() const { return p; } 202 T *operator ->() const { return p; }
140 203
141 operator T *() const { return p; } 204 operator T *() const { return p; }
142}; 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;
143 212
144struct str_hash 213struct str_hash
145{ 214{
146 std::size_t operator ()(const char *s) const 215 std::size_t operator ()(const char *s) const
147 { 216 {
… …
173 { 242 {
174 return !strcmp (a, b); 243 return !strcmp (a, b);
175 } 244 }
176}; 245};
177 246
178#include <vector>
179
180template<class obj> 247template<class T>
181struct unordered_vector : std::vector<obj, slice_allocator<obj> > 248struct unordered_vector : std::vector<T, slice_allocator<T> >
182{ 249{
183 typedef typename unordered_vector::iterator iterator; 250 typedef typename unordered_vector::iterator iterator;
184 251
185 void erase (unsigned int pos) 252 void erase (unsigned int pos)
186 { 253 {
… …
191 } 258 }
192 259
193 void erase (iterator i) 260 void erase (iterator i)
194 { 261 {
195 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);
196 } 299 }
197}; 300};
198 301
199template<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; }
200template<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; }
… …
210inline void assign (char (&dst)[N], const char *src) 313inline void assign (char (&dst)[N], const char *src)
211{ 314{
212 assign ((char *)&dst, src, N); 315 assign ((char *)&dst, src, N);
213} 316}
214 317
318typedef double tstamp;
319
320// return current time as timestampe
321tstamp now ();
322
323int similar_direction (int a, int b);
324
215#endif 325#endif
216 326

Diff Legend

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