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.14 by root, Thu Sep 14 18:13:02 2006 UTC vs.
Revision 1.26 by root, Sun Jan 7 02:39:14 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>
13 18
14// use a gcc extension for auto declarations until ISO C++ sanctifies them 19// use a gcc extension for auto declarations until ISO C++ sanctifies them
15#define AUTODECL(var,expr) typeof(expr) var = (expr) 20#define AUTODECL(var,expr) typeof(expr) var = (expr)
16 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
17// makes dynamically allocated objects zero-initialised 29// makes dynamically allocated objects zero-initialised
18struct zero_initialised 30struct zero_initialised
19{ 31{
20 void *operator new (size_t s, void *p) 32 void *operator new (size_t s, void *p)
21 { 33 {
… …
42 { 54 {
43 g_slice_free1 (s, p); 55 g_slice_free1 (s, p);
44 } 56 }
45}; 57};
46 58
59void *salloc_ (int n) throw (std::bad_alloc);
60void *salloc_ (int n, void *src) throw (std::bad_alloc);
61
47// strictly the same as g_slice_alloc, but never returns 0 62// strictly the same as g_slice_alloc, but never returns 0
48void *alloc (int s) throw (std::bad_alloc); 63template<typename T>
64inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
65
66// also copies src into the new area, like "memdup"
67// if src is 0, clears the memory
68template<typename T>
69inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
70
71// clears the memory
72template<typename T>
73inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
74
49// for symmetry 75// for symmetry
50inline void dealloc (void *p, int s) throw () 76template<typename T>
77inline void sfree (T *ptr, int n = 1) throw ()
51{ 78{
52 g_slice_free1 (s, p); 79 g_slice_free1 (n * sizeof (T), (void *)ptr);
53} 80}
54 81
55// a STL-compatible allocator that uses g_slice 82// a STL-compatible allocator that uses g_slice
56// boy, this is verbose 83// boy, this is verbose
57template<typename Tp> 84template<typename Tp>
… …
81 pointer address (reference x) const { return &x; } 108 pointer address (reference x) const { return &x; }
82 const_pointer address (const_reference x) const { return &x; } 109 const_pointer address (const_reference x) const { return &x; }
83 110
84 pointer allocate (size_type n, const_pointer = 0) 111 pointer allocate (size_type n, const_pointer = 0)
85 { 112 {
86 return static_cast<pointer>(alloc (n * sizeof (Tp))); 113 return salloc<Tp> (n);
87 } 114 }
88 115
89 void deallocate (pointer p, size_type n) 116 void deallocate (pointer p, size_type n)
90 { 117 {
91 dealloc (static_cast<void *>(p), n * sizeof (Tp)); 118 sfree<Tp> (p, n);
92 } 119 }
93 120
94 size_type max_size ()const throw () 121 size_type max_size ()const throw ()
95 { 122 {
96 return size_t (-1) / sizeof (Tp); 123 return size_t (-1) / sizeof (Tp);
… …
103 130
104 void destroy (pointer p) 131 void destroy (pointer p)
105 { 132 {
106 p->~Tp (); 133 p->~Tp ();
107 } 134 }
108};
109
110struct refcounted
111{
112 mutable int refcnt;
113 refcounted () : refcnt (0) { }
114 void refcnt_inc () { ++refcnt; }
115 void refcnt_dec () { --refcnt;
116 if (refcnt < 0)abort();}//D
117}; 135};
118 136
119template<class T> 137template<class T>
120struct refptr 138struct refptr
121{ 139{
… …
144 T &operator * () const { return *p; } 162 T &operator * () const { return *p; }
145 T *operator ->() const { return p; } 163 T *operator ->() const { return p; }
146 164
147 operator T *() const { return p; } 165 operator T *() const { return p; }
148}; 166};
167
168typedef refptr<maptile> maptile_ptr;
169typedef refptr<object> object_ptr;
170typedef refptr<archetype> arch_ptr;
171typedef refptr<client> client_ptr;
172typedef refptr<player> player_ptr;
149 173
150struct str_hash 174struct str_hash
151{ 175{
152 std::size_t operator ()(const char *s) const 176 std::size_t operator ()(const char *s) const
153 { 177 {
… …
179 { 203 {
180 return !strcmp (a, b); 204 return !strcmp (a, b);
181 } 205 }
182}; 206};
183 207
184#include <vector>
185
186template<class obj> 208template<class T>
187struct unordered_vector : std::vector<obj, slice_allocator<obj> > 209struct unordered_vector : std::vector<T, slice_allocator<T> >
188{ 210{
189 typedef typename unordered_vector::iterator iterator; 211 typedef typename unordered_vector::iterator iterator;
190 212
191 void erase (unsigned int pos) 213 void erase (unsigned int pos)
192 { 214 {
… …
197 } 219 }
198 220
199 void erase (iterator i) 221 void erase (iterator i)
200 { 222 {
201 erase ((unsigned int )(i - this->begin ())); 223 erase ((unsigned int )(i - this->begin ()));
224 }
225};
226
227template<class T, int T::* index>
228struct object_vector : std::vector<T *, slice_allocator<T *> >
229{
230 void insert (T *obj)
231 {
232 assert (!(obj->*index));
233 push_back (obj);
234 obj->*index = this->size ();
235 }
236
237 void insert (T &obj)
238 {
239 insert (&obj);
240 }
241
242 void erase (T *obj)
243 {
244 assert (obj->*index);
245 int pos = obj->*index;
246 obj->*index = 0;
247
248 if (pos < this->size ())
249 {
250 (*this)[pos - 1] = (*this)[this->size () - 1];
251 (*this)[pos - 1]->*index = pos;
252 }
253
254 this->pop_back ();
255 }
256
257 void erase (T &obj)
258 {
259 errase (&obj);
202 } 260 }
203}; 261};
204 262
205template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 263template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
206template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 264template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
… …
216inline void assign (char (&dst)[N], const char *src) 274inline void assign (char (&dst)[N], const char *src)
217{ 275{
218 assign ((char *)&dst, src, N); 276 assign ((char *)&dst, src, N);
219} 277}
220 278
279typedef double tstamp;
280
281// return current time as timestampe
282tstamp now ();
283
284int similar_direction (int a, int b);
285
221#endif 286#endif
222 287

Diff Legend

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