server/include/util.h

#ifndef UTIL_H__
#define UTIL_H__

#if __GNUC__ >= 3
# define is_constant(c) __builtin_constant_p (c)
#else
# define is_constant(c) 0
#endif

#include <cstddef>

#include <glib.h>

// use a gcc extension for auto declarations until ISO C++ sanctifies them
#define AUTODECL(var,expr) typeof(expr) var = (expr)

// makes dynamically allocated objects zero-initialised
struct zero_initialised
{
  void *operator new (size_t s, void *p)
  {
    memset (p, 0, s);
    return p;
  }

  void *operator new (size_t s)
  {
    return g_slice_alloc0 (s);
  }

  void *operator new[] (size_t s)
  {
    return g_slice_alloc0 (s);
  }

  void operator delete (void *p, size_t s)
  {
    g_slice_free1 (s, p);
  }

  void operator delete[] (void *p, size_t s)
  {
    g_slice_free1 (s, p);
  }
};

// strictly the same as g_slice_alloc, but never returns 0
void *salloc (int size)                throw (std::bad_alloc);
// also copies src into the new area, like "memdup"
// if src is 0, clears the memory
void *salloc (int size, void *src)     throw (std::bad_alloc);

// and as a template
template<typename T>
inline T *salloc (int size)            throw (std::bad_alloc) { return (T *)salloc (size * sizeof (T));              }
template<typename T>
inline T *salloc (int size, T *src)    throw (std::bad_alloc) { return (T *)salloc (size * sizeof (T), (void *)src); }

// for symmetry
template<typename T>
inline void sfree (T *ptr, int size) throw ()
{
  g_slice_free1 (size * sizeof (T), (void *)ptr);
}

// a STL-compatible allocator that uses g_slice
// boy, this is verbose
template<typename Tp>
struct slice_allocator
{
  typedef size_t size_type;
  typedef ptrdiff_t difference_type;
  typedef Tp *pointer;
  typedef const Tp *const_pointer;
  typedef Tp &reference;
  typedef const Tp &const_reference;
  typedef Tp value_type;

  template <class U> 
  struct rebind
  {
    typedef slice_allocator<U> other;
  };

  slice_allocator () throw () { }
  slice_allocator (const slice_allocator &o) throw () { }
  template<typename Tp2>
  slice_allocator (const slice_allocator<Tp2> &) throw () { }

  ~slice_allocator () { }

  pointer address (reference x) const { return &x; }
  const_pointer address (const_reference x) const { return &x; }

  pointer allocate (size_type n, const_pointer = 0)
  {
    return salloc<Tp> (n);
  }

  void deallocate (pointer p, size_type n)
  {
    sfree<Tp> (p, n);
  }

  size_type max_size ()const throw ()
  {
    return size_t (-1) / sizeof (Tp);
  }

  void construct (pointer p, const Tp &val)
  {
    ::new (p) Tp (val);
  }

  void destroy (pointer p)
  {
    p->~Tp ();
  }
};

struct refcounted
{
  refcounted () : refcnt (0) { }
//  virtual ~refcounted ();
  void refcnt_inc () { ++refcnt; }
  void refcnt_dec () { --refcnt; }
  bool dead () { return refcnt == 0; }
  mutable int refcnt;
#if 0
private:
  static refcounted *rc_first;
  refcounted *rc_next;
#endif
};

template<class T>
struct refptr
{
  T *p;

  refptr () : p(0) { }
  refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); }
  refptr (T *p) : p(p) { if (p) p->refcnt_inc (); }
  ~refptr () { if (p) p->refcnt_dec (); }

  const refptr<T> &operator =(T *o)
  {
    if (p) p->refcnt_dec ();
    p = o;
    if (p) p->refcnt_inc ();

    return *this;
  }

  const refptr<T> &operator =(const refptr<T> o)
  {
    *this = o.p;
    return *this;
  }

  T &operator * () const { return *p; }
  T *operator ->() const { return p; }

  operator T *() const { return p; }
};

struct str_hash
{
  std::size_t operator ()(const char *s) const
  {
    unsigned long hash = 0;

    /* use the one-at-a-time hash function, which supposedly is
     * better than the djb2-like one used by perl5.005, but
     * certainly is better then the bug used here before.
     * see http://burtleburtle.net/bob/hash/doobs.html
     */
    while (*s)
      {
        hash += *s++;
        hash += hash << 10;
        hash ^= hash >>  6;
      }

    hash += hash <<  3;
    hash ^= hash >> 11;
    hash += hash << 15;

    return hash;
  }
};

struct str_equal
{
  bool operator ()(const char *a, const char *b) const
  {
    return !strcmp (a, b);
  }
};

#include <vector>

template<class obj>
struct unordered_vector : std::vector<obj, slice_allocator<obj> >
{
  typedef typename unordered_vector::iterator iterator;

  void erase (unsigned int pos)
  {
    if (pos < this->size () - 1)
      (*this)[pos] = (*this)[this->size () - 1];

    this->pop_back ();
  }

  void erase (iterator i)
  {
    erase ((unsigned int )(i - this->begin ()));
  }
};

template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
template<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; }

template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }

// basically does what strncpy should do, but appends "..." to strings exceeding length
void assign (char *dst, const char *src, int maxlen);

// type-safe version of assign
template<int N>
inline void assign (char (&dst)[N], const char *src)
{
  assign ((char *)&dst, src, N);
}

typedef double tstamp;

// return current time as timestampe
tstamp now ();

#endif

Revision:	1.19
Committed:	Sun Dec 17 19:07:23 2006 UTC (19 years, 9 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.18:	+1 -1 lines
Log Message:	thats the crash bug
#	User	Rev	Content
1	root	1.1	#ifndef UTIL_H__
2			#define UTIL_H__
3
4	root	1.2	#if __GNUC__ >= 3
5			# define is_constant(c) __builtin_constant_p (c)
6			#else
7			# define is_constant(c) 0
8			#endif
9
10	root	1.11	#include <cstddef>
11
12			#include <glib.h>
13
14	root	1.14	// use a gcc extension for auto declarations until ISO C++ sanctifies them
15			#define AUTODECL(var,expr) typeof(expr) var = (expr)
16
17	root	1.1	// makes dynamically allocated objects zero-initialised
18			struct zero_initialised
19			{
20	root	1.11	void operator new (size_t s, void p)
21			{
22			memset (p, 0, s);
23			return p;
24			}
25
26			void *operator new (size_t s)
27			{
28			return g_slice_alloc0 (s);
29			}
30
31			void *operator new[] (size_t s)
32			{
33			return g_slice_alloc0 (s);
34			}
35
36			void operator delete (void *p, size_t s)
37			{
38			g_slice_free1 (s, p);
39			}
40
41			void operator delete[] (void *p, size_t s)
42			{
43			g_slice_free1 (s, p);
44			}
45			};
46
47	root	1.12	// strictly the same as g_slice_alloc, but never returns 0
48	root	1.18	void *salloc (int size) throw (std::bad_alloc);
49	root	1.17	// also copies src into the new area, like "memdup"
50	root	1.18	// if src is 0, clears the memory
51			void salloc (int size, void src) throw (std::bad_alloc);
52
53			// and as a template
54			template<typename T>
55			inline T salloc (int size) throw (std::bad_alloc) { return (T )salloc (size * sizeof (T)); }
56			template<typename T>
57			inline T salloc (int size, T src) throw (std::bad_alloc) { return (T )salloc (size sizeof (T), (void *)src); }
58
59	root	1.12	// for symmetry
60	root	1.18	template<typename T>
61			inline void sfree (T *ptr, int size) throw ()
62	root	1.12	{
63	root	1.18	g_slice_free1 (size * sizeof (T), (void *)ptr);
64	root	1.12	}
65	root	1.11
66			// a STL-compatible allocator that uses g_slice
67			// boy, this is verbose
68			template<typename Tp>
69			struct slice_allocator
70			{
71			typedef size_t size_type;
72			typedef ptrdiff_t difference_type;
73			typedef Tp *pointer;
74			typedef const Tp *const_pointer;
75			typedef Tp &reference;
76			typedef const Tp &const_reference;
77			typedef Tp value_type;
78
79			template <class U>
80			struct rebind
81			{
82			typedef slice_allocator<U> other;
83			};
84
85			slice_allocator () throw () { }
86			slice_allocator (const slice_allocator &o) throw () { }
87			template<typename Tp2>
88			slice_allocator (const slice_allocator<Tp2> &) throw () { }
89
90			~slice_allocator () { }
91
92			pointer address (reference x) const { return &x; }
93			const_pointer address (const_reference x) const { return &x; }
94
95			pointer allocate (size_type n, const_pointer = 0)
96			{
97	root	1.18	return salloc<Tp> (n);
98	root	1.11	}
99
100			void deallocate (pointer p, size_type n)
101			{
102	root	1.19	sfree<Tp> (p, n);
103	root	1.11	}
104
105			size_type max_size ()const throw ()
106			{
107			return size_t (-1) / sizeof (Tp);
108			}
109
110			void construct (pointer p, const Tp &val)
111			{
112			::new (p) Tp (val);
113			}
114
115			void destroy (pointer p)
116			{
117			p->~Tp ();
118			}
119	root	1.1	};
120
121	root	1.7	struct refcounted
122			{
123			refcounted () : refcnt (0) { }
124	root	1.16	// virtual ~refcounted ();
125	root	1.7	void refcnt_inc () { ++refcnt; }
126	root	1.15	void refcnt_dec () { --refcnt; }
127	root	1.16	bool dead () { return refcnt == 0; }
128			mutable int refcnt;
129			#if 0
130			private:
131			static refcounted *rc_first;
132			refcounted *rc_next;
133			#endif
134	root	1.7	};
135
136			template<class T>
137			struct refptr
138			{
139			T *p;
140
141			refptr () : p(0) { }
142			refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); }
143			refptr (T *p) : p(p) { if (p) p->refcnt_inc (); }
144			~refptr () { if (p) p->refcnt_dec (); }
145
146			const refptr<T> &operator =(T *o)
147			{
148			if (p) p->refcnt_dec ();
149			p = o;
150			if (p) p->refcnt_inc ();
151
152			return *this;
153			}
154
155			const refptr<T> &operator =(const refptr<T> o)
156			{
157			*this = o.p;
158			return *this;
159			}
160
161			T &operator * () const { return *p; }
162			T *operator ->() const { return p; }
163
164			operator T *() const { return p; }
165			};
166
167	root	1.4	struct str_hash
168			{
169			std::size_t operator ()(const char *s) const
170			{
171			unsigned long hash = 0;
172
173			/* use the one-at-a-time hash function, which supposedly is
174			* better than the djb2-like one used by perl5.005, but
175			* certainly is better then the bug used here before.
176			* see http://burtleburtle.net/bob/hash/doobs.html
177			*/
178			while (*s)
179			{
180			hash += *s++;
181			hash += hash << 10;
182			hash ^= hash >> 6;
183			}
184
185			hash += hash << 3;
186			hash ^= hash >> 11;
187			hash += hash << 15;
188
189			return hash;
190			}
191			};
192
193			struct str_equal
194			{
195			bool operator ()(const char a, const char b) const
196			{
197			return !strcmp (a, b);
198			}
199			};
200
201	root	1.6	#include <vector>
202
203			template<class obj>
204	root	1.11	struct unordered_vector : std::vector<obj, slice_allocator<obj> >
205	root	1.6	{
206	root	1.11	typedef typename unordered_vector::iterator iterator;
207	root	1.6
208			void erase (unsigned int pos)
209			{
210			if (pos < this->size () - 1)
211			(this)[pos] = (this)[this->size () - 1];
212
213			this->pop_back ();
214			}
215
216			void erase (iterator i)
217			{
218			erase ((unsigned int )(i - this->begin ()));
219			}
220			};
221
222	root	1.8	template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
223			template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
224			template<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; }
225
226			template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
227
228	root	1.10	// basically does what strncpy should do, but appends "..." to strings exceeding length
229			void assign (char dst, const char src, int maxlen);
230
231			// type-safe version of assign
232	root	1.9	template<int N>
233			inline void assign (char (&dst)[N], const char *src)
234			{
235	root	1.10	assign ((char *)&dst, src, N);
236	root	1.9	}
237
238	root	1.17	typedef double tstamp;
239
240			// return current time as timestampe
241			tstamp now ();
242
243	root	1.1	#endif
244