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.7 by root, Mon Sep 11 20:28:37 2006 UTC vs.
Revision 1.26 by root, Sun Jan 7 02:39:14 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 <new>
12#include <vector>
13
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
10// makes dynamically allocated objects zero-initialised 29// makes dynamically allocated objects zero-initialised
11struct zero_initialised 30struct zero_initialised
12{ 31{
13 void *operator new (size_t s, void *); 32 void *operator new (size_t s, void *p)
33 {
34 memset (p, 0, s);
35 return p;
36 }
37
14 void *operator new (size_t s); 38 void *operator new (size_t s)
39 {
40 return g_slice_alloc0 (s);
41 }
42
15 void *operator new [] (size_t s); 43 void *operator new[] (size_t s)
44 {
45 return g_slice_alloc0 (s);
46 }
47
16 void operator delete (void *p, size_t s); 48 void operator delete (void *p, size_t s)
49 {
50 g_slice_free1 (s, p);
51 }
52
17 void operator delete [] (void *p, size_t s); 53 void operator delete[] (void *p, size_t s)
54 {
55 g_slice_free1 (s, p);
56 }
18}; 57};
19 58
20struct refcounted 59void *salloc_ (int n) throw (std::bad_alloc);
60void *salloc_ (int n, void *src) throw (std::bad_alloc);
61
62// strictly the same as g_slice_alloc, but never returns 0
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
75// for symmetry
76template<typename T>
77inline void sfree (T *ptr, int n = 1) throw ()
21{ 78{
22 mutable int refcnt; 79 g_slice_free1 (n * sizeof (T), (void *)ptr);
23 refcounted () : refcnt (0) { } 80}
24 void refcnt_inc () { ++refcnt; } 81
25 void refcnt_dec () { --refcnt; 82// a STL-compatible allocator that uses g_slice
26 if (refcnt < 0)abort();}//D 83// boy, this is verbose
84template<typename Tp>
85struct slice_allocator
86{
87 typedef size_t size_type;
88 typedef ptrdiff_t difference_type;
89 typedef Tp *pointer;
90 typedef const Tp *const_pointer;
91 typedef Tp &reference;
92 typedef const Tp &const_reference;
93 typedef Tp value_type;
94
95 template <class U>
96 struct rebind
97 {
98 typedef slice_allocator<U> other;
99 };
100
101 slice_allocator () throw () { }
102 slice_allocator (const slice_allocator &o) throw () { }
103 template<typename Tp2>
104 slice_allocator (const slice_allocator<Tp2> &) throw () { }
105
106 ~slice_allocator () { }
107
108 pointer address (reference x) const { return &x; }
109 const_pointer address (const_reference x) const { return &x; }
110
111 pointer allocate (size_type n, const_pointer = 0)
112 {
113 return salloc<Tp> (n);
114 }
115
116 void deallocate (pointer p, size_type n)
117 {
118 sfree<Tp> (p, n);
119 }
120
121 size_type max_size ()const throw ()
122 {
123 return size_t (-1) / sizeof (Tp);
124 }
125
126 void construct (pointer p, const Tp &val)
127 {
128 ::new (p) Tp (val);
129 }
130
131 void destroy (pointer p)
132 {
133 p->~Tp ();
134 }
27}; 135};
28 136
29template<class T> 137template<class T>
30struct refptr 138struct refptr
31{ 139{
… …
54 T &operator * () const { return *p; } 162 T &operator * () const { return *p; }
55 T *operator ->() const { return p; } 163 T *operator ->() const { return p; }
56 164
57 operator T *() const { return p; } 165 operator T *() const { return p; }
58}; 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;
59 173
60struct str_hash 174struct str_hash
61{ 175{
62 std::size_t operator ()(const char *s) const 176 std::size_t operator ()(const char *s) const
63 { 177 {
… …
89 { 203 {
90 return !strcmp (a, b); 204 return !strcmp (a, b);
91 } 205 }
92}; 206};
93 207
94#include <vector>
95
96template<class obj> 208template<class T>
97struct unordered_vector : std::vector<obj> 209struct unordered_vector : std::vector<T, slice_allocator<T> >
98{ 210{
99 typedef typename std::vector<obj>::iterator iterator; 211 typedef typename unordered_vector::iterator iterator;
100 212
101 void erase (unsigned int pos) 213 void erase (unsigned int pos)
102 { 214 {
103 if (pos < this->size () - 1) 215 if (pos < this->size () - 1)
104 (*this)[pos] = (*this)[this->size () - 1]; 216 (*this)[pos] = (*this)[this->size () - 1];
… …
110 { 222 {
111 erase ((unsigned int )(i - this->begin ())); 223 erase ((unsigned int )(i - this->begin ()));
112 } 224 }
113}; 225};
114 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);
260 }
261};
262
263template<typename T, typename U> static inline T min (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; }
265template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; }
266
267template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
268
269// basically does what strncpy should do, but appends "..." to strings exceeding length
270void assign (char *dst, const char *src, int maxlen);
271
272// type-safe version of assign
273template<int N>
274inline void assign (char (&dst)[N], const char *src)
275{
276 assign ((char *)&dst, src, N);
277}
278
279typedef double tstamp;
280
281// return current time as timestampe
282tstamp now ();
283
284int similar_direction (int a, int b);
285
115#endif 286#endif
116 287

Diff Legend

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