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 *alloc (int s) throw (std::bad_alloc);
// for symmetry
inline void dealloc (void *p, int s) throw ()
{
  g_slice_free1 (s, p);
}

// 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 static_cast<pointer>(alloc (n * sizeof (Tp)));
  }

  void deallocate (pointer p, size_type n)
  {
    dealloc (static_cast<void *>(p), n * sizeof (Tp));
  }

  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);
}

#endif

Revision:	1.16
Committed:	Fri Nov 17 19:40:54 2006 UTC (17 years, 6 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.15:	+8 -1 lines
Log Message:	* remove arch.h * use refcounting for archetypes * cleanup * strat of generic garbage collector
#	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.11	void *alloc (int s) throw (std::bad_alloc);
49	root	1.12	// for symmetry
50			inline void dealloc (void *p, int s) throw ()
51			{
52			g_slice_free1 (s, p);
53			}
54	root	1.11
55			// a STL-compatible allocator that uses g_slice
56			// boy, this is verbose
57			template<typename Tp>
58			struct slice_allocator
59			{
60			typedef size_t size_type;
61			typedef ptrdiff_t difference_type;
62			typedef Tp *pointer;
63			typedef const Tp *const_pointer;
64			typedef Tp &reference;
65			typedef const Tp &const_reference;
66			typedef Tp value_type;
67
68			template <class U>
69			struct rebind
70			{
71			typedef slice_allocator<U> other;
72			};
73
74			slice_allocator () throw () { }
75			slice_allocator (const slice_allocator &o) throw () { }
76			template<typename Tp2>
77			slice_allocator (const slice_allocator<Tp2> &) throw () { }
78
79			~slice_allocator () { }
80
81			pointer address (reference x) const { return &x; }
82			const_pointer address (const_reference x) const { return &x; }
83
84			pointer allocate (size_type n, const_pointer = 0)
85			{
86			return static_cast<pointer>(alloc (n * sizeof (Tp)));
87			}
88
89			void deallocate (pointer p, size_type n)
90			{
91	root	1.13	dealloc (static_cast<void >(p), n sizeof (Tp));
92	root	1.11	}
93
94			size_type max_size ()const throw ()
95			{
96			return size_t (-1) / sizeof (Tp);
97			}
98
99			void construct (pointer p, const Tp &val)
100			{
101			::new (p) Tp (val);
102			}
103
104			void destroy (pointer p)
105			{
106			p->~Tp ();
107			}
108	root	1.1	};
109
110	root	1.7	struct refcounted
111			{
112			refcounted () : refcnt (0) { }
113	root	1.16	// virtual ~refcounted ();
114	root	1.7	void refcnt_inc () { ++refcnt; }
115	root	1.15	void refcnt_dec () { --refcnt; }
116	root	1.16	bool dead () { return refcnt == 0; }
117			mutable int refcnt;
118			#if 0
119			private:
120			static refcounted *rc_first;
121			refcounted *rc_next;
122			#endif
123	root	1.7	};
124
125			template<class T>
126			struct refptr
127			{
128			T *p;
129
130			refptr () : p(0) { }
131			refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); }
132			refptr (T *p) : p(p) { if (p) p->refcnt_inc (); }
133			~refptr () { if (p) p->refcnt_dec (); }
134
135			const refptr<T> &operator =(T *o)
136			{
137			if (p) p->refcnt_dec ();
138			p = o;
139			if (p) p->refcnt_inc ();
140
141			return *this;
142			}
143
144			const refptr<T> &operator =(const refptr<T> o)
145			{
146			*this = o.p;
147			return *this;
148			}
149
150			T &operator * () const { return *p; }
151			T *operator ->() const { return p; }
152
153			operator T *() const { return p; }
154			};
155
156	root	1.4	struct str_hash
157			{
158			std::size_t operator ()(const char *s) const
159			{
160			unsigned long hash = 0;
161
162			/* use the one-at-a-time hash function, which supposedly is
163			* better than the djb2-like one used by perl5.005, but
164			* certainly is better then the bug used here before.
165			* see http://burtleburtle.net/bob/hash/doobs.html
166			*/
167			while (*s)
168			{
169			hash += *s++;
170			hash += hash << 10;
171			hash ^= hash >> 6;
172			}
173
174			hash += hash << 3;
175			hash ^= hash >> 11;
176			hash += hash << 15;
177
178			return hash;
179			}
180			};
181
182			struct str_equal
183			{
184			bool operator ()(const char a, const char b) const
185			{
186			return !strcmp (a, b);
187			}
188			};
189
190	root	1.6	#include <vector>
191
192			template<class obj>
193	root	1.11	struct unordered_vector : std::vector<obj, slice_allocator<obj> >
194	root	1.6	{
195	root	1.11	typedef typename unordered_vector::iterator iterator;
196	root	1.6
197			void erase (unsigned int pos)
198			{
199			if (pos < this->size () - 1)
200			(this)[pos] = (this)[this->size () - 1];
201
202			this->pop_back ();
203			}
204
205			void erase (iterator i)
206			{
207			erase ((unsigned int )(i - this->begin ()));
208			}
209			};
210
211	root	1.8	template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
212			template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
213			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; }
214
215			template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
216
217	root	1.10	// basically does what strncpy should do, but appends "..." to strings exceeding length
218			void assign (char dst, const char src, int maxlen);
219
220			// type-safe version of assign
221	root	1.9	template<int N>
222			inline void assign (char (&dst)[N], const char *src)
223			{
224	root	1.10	assign ((char *)&dst, src, N);
225	root	1.9	}
226
227	root	1.1	#endif
228