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.12 by root, Tue Sep 12 21:10:32 2006 UTC vs.
Revision 1.27 by root, Mon Jan 15 00:40:49 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 <new>
12#include <vector>
11 13
12#include <glib.h> 14#include <glib.h>
15
16#include <shstr.h>
17#include <traits.h>
18
19// use a gcc extension for auto declarations until ISO C++ sanctifies them
20#define AUTODECL(var,expr) typeof(expr) var = (expr)
21
22// very ugly macro that basicaly declares and initialises a variable
23// that is in scope for the next statement only
24// works only for stuff that can be assigned 0 and converts to false
25// (note: works great for pointers)
26// most ugly macro I ever wrote
27#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
28
29// in range including end
30#define IN_RANGE_INC(val,beg,end) \
31 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
32
33// in range excluding end
34#define IN_RANGE_EXC(val,beg,end) \
35 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
13 36
14// makes dynamically allocated objects zero-initialised 37// makes dynamically allocated objects zero-initialised
15struct zero_initialised 38struct zero_initialised
16{ 39{
17 void *operator new (size_t s, void *p) 40 void *operator new (size_t s, void *p)
… …
39 { 62 {
40 g_slice_free1 (s, p); 63 g_slice_free1 (s, p);
41 } 64 }
42}; 65};
43 66
67void *salloc_ (int n) throw (std::bad_alloc);
68void *salloc_ (int n, void *src) throw (std::bad_alloc);
69
44// strictly the same as g_slice_alloc, but never returns 0 70// strictly the same as g_slice_alloc, but never returns 0
45void *alloc (int s) throw (std::bad_alloc); 71template<typename T>
72inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
73
74// also copies src into the new area, like "memdup"
75// if src is 0, clears the memory
76template<typename T>
77inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
78
79// clears the memory
80template<typename T>
81inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
82
46// for symmetry 83// for symmetry
47inline void dealloc (void *p, int s) throw () 84template<typename T>
85inline void sfree (T *ptr, int n = 1) throw ()
48{ 86{
49 g_slice_free1 (s, p); 87 g_slice_free1 (n * sizeof (T), (void *)ptr);
50} 88}
51 89
52// a STL-compatible allocator that uses g_slice 90// a STL-compatible allocator that uses g_slice
53// boy, this is verbose 91// boy, this is verbose
54template<typename Tp> 92template<typename Tp>
… …
78 pointer address (reference x) const { return &x; } 116 pointer address (reference x) const { return &x; }
79 const_pointer address (const_reference x) const { return &x; } 117 const_pointer address (const_reference x) const { return &x; }
80 118
81 pointer allocate (size_type n, const_pointer = 0) 119 pointer allocate (size_type n, const_pointer = 0)
82 { 120 {
83 return static_cast<pointer>(alloc (n * sizeof (Tp))); 121 return salloc<Tp> (n);
84 } 122 }
85 123
86 void deallocate (pointer p, size_type n) 124 void deallocate (pointer p, size_type n)
87 { 125 {
88 dealloc (static_cast<void *>(p), n); 126 sfree<Tp> (p, n);
89 } 127 }
90 128
91 size_type max_size ()const throw () 129 size_type max_size ()const throw ()
92 { 130 {
93 return size_t (-1) / sizeof (Tp); 131 return size_t (-1) / sizeof (Tp);
… …
100 138
101 void destroy (pointer p) 139 void destroy (pointer p)
102 { 140 {
103 p->~Tp (); 141 p->~Tp ();
104 } 142 }
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}; 143};
115 144
116template<class T> 145template<class T>
117struct refptr 146struct refptr
118{ 147{
… …
141 T &operator * () const { return *p; } 170 T &operator * () const { return *p; }
142 T *operator ->() const { return p; } 171 T *operator ->() const { return p; }
143 172
144 operator T *() const { return p; } 173 operator T *() const { return p; }
145}; 174};
175
176typedef refptr<maptile> maptile_ptr;
177typedef refptr<object> object_ptr;
178typedef refptr<archetype> arch_ptr;
179typedef refptr<client> client_ptr;
180typedef refptr<player> player_ptr;
146 181
147struct str_hash 182struct str_hash
148{ 183{
149 std::size_t operator ()(const char *s) const 184 std::size_t operator ()(const char *s) const
150 { 185 {
… …
176 { 211 {
177 return !strcmp (a, b); 212 return !strcmp (a, b);
178 } 213 }
179}; 214};
180 215
181#include <vector>
182
183template<class obj> 216template<class T>
184struct unordered_vector : std::vector<obj, slice_allocator<obj> > 217struct unordered_vector : std::vector<T, slice_allocator<T> >
185{ 218{
186 typedef typename unordered_vector::iterator iterator; 219 typedef typename unordered_vector::iterator iterator;
187 220
188 void erase (unsigned int pos) 221 void erase (unsigned int pos)
189 { 222 {
… …
194 } 227 }
195 228
196 void erase (iterator i) 229 void erase (iterator i)
197 { 230 {
198 erase ((unsigned int )(i - this->begin ())); 231 erase ((unsigned int )(i - this->begin ()));
232 }
233};
234
235template<class T, int T::* index>
236struct object_vector : std::vector<T *, slice_allocator<T *> >
237{
238 void insert (T *obj)
239 {
240 assert (!(obj->*index));
241 push_back (obj);
242 obj->*index = this->size ();
243 }
244
245 void insert (T &obj)
246 {
247 insert (&obj);
248 }
249
250 void erase (T *obj)
251 {
252 assert (obj->*index);
253 int pos = obj->*index;
254 obj->*index = 0;
255
256 if (pos < this->size ())
257 {
258 (*this)[pos - 1] = (*this)[this->size () - 1];
259 (*this)[pos - 1]->*index = pos;
260 }
261
262 this->pop_back ();
263 }
264
265 void erase (T &obj)
266 {
267 errase (&obj);
199 } 268 }
200}; 269};
201 270
202template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 271template<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; } 272template<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) 282inline void assign (char (&dst)[N], const char *src)
214{ 283{
215 assign ((char *)&dst, src, N); 284 assign ((char *)&dst, src, N);
216} 285}
217 286
287typedef double tstamp;
288
289// return current time as timestampe
290tstamp now ();
291
292int similar_direction (int a, int b);
293
218#endif 294#endif
219 295

Diff Legend

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