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

void *salloc_ (int n)            throw (std::bad_alloc);
void *salloc_ (int n, void *src) throw (std::bad_alloc);

// strictly the same as g_slice_alloc, but never returns 0
template<typename T>
inline T *salloc (int n = 1)     throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T));              }

// also copies src into the new area, like "memdup"
// if src is 0, clears the memory
template<typename T>
inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }

// clears the memory
template<typename T>
inline T *salloc0(int n = 1)     throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0);           }

// for symmetry
template<typename T>
inline void sfree (T *ptr, int n = 1) throw ()
{
  g_slice_free1 (n * 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 ();
  }
};

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

typedef refptr<maptile>   maptile_ptr;
typedef refptr<object>    object_ptr;
typedef refptr<archetype> arch_ptr;
typedef refptr<client>    client_ptr;
typedef refptr<player>    player_ptr;

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.24
Committed:	Mon Dec 25 11:25:49 2006 UTC (17 years, 5 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.23:	+3 -16 lines
Log Message:	- small, but subtle, rewrite of object management - perl will now keep attachable objects alive - objects are now refcounted - refcouts need to be tested explicitly (refcnt_chk) - explicit destroy is required current - explicit destroy asks "nicely" for the object to self destruct, if possible - refcounts will be used during mortal killing - minor bugfixes, optimisations etc. - some former hacks removed.
#	Content
1	#ifndef UTIL_H__
2	#define UTIL_H__
3
4	#if __GNUC__ >= 3
5	# define is_constant(c) __builtin_constant_p (c)
6	#else
7	# define is_constant(c) 0
8	#endif
9
10	#include <cstddef>
11
12	#include <glib.h>
13
14	// use a gcc extension for auto declarations until ISO C++ sanctifies them
15	#define AUTODECL(var,expr) typeof(expr) var = (expr)
16
17	// makes dynamically allocated objects zero-initialised
18	struct zero_initialised
19	{
20	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	void *salloc_ (int n) throw (std::bad_alloc);
48	void salloc_ (int n, void src) throw (std::bad_alloc);
49
50	// strictly the same as g_slice_alloc, but never returns 0
51	template<typename T>
52	inline T salloc (int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T)); }
53
54	// also copies src into the new area, like "memdup"
55	// if src is 0, clears the memory
56	template<typename T>
57	inline T salloc (int n, T src) throw (std::bad_alloc) { return (T )salloc_ (n sizeof (T), (void *)src); }
58
59	// clears the memory
60	template<typename T>
61	inline T salloc0(int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T), 0); }
62
63	// for symmetry
64	template<typename T>
65	inline void sfree (T *ptr, int n = 1) throw ()
66	{
67	g_slice_free1 (n * sizeof (T), (void *)ptr);
68	}
69
70	// a STL-compatible allocator that uses g_slice
71	// boy, this is verbose
72	template<typename Tp>
73	struct slice_allocator
74	{
75	typedef size_t size_type;
76	typedef ptrdiff_t difference_type;
77	typedef Tp *pointer;
78	typedef const Tp *const_pointer;
79	typedef Tp &reference;
80	typedef const Tp &const_reference;
81	typedef Tp value_type;
82
83	template <class U>
84	struct rebind
85	{
86	typedef slice_allocator<U> other;
87	};
88
89	slice_allocator () throw () { }
90	slice_allocator (const slice_allocator &o) throw () { }
91	template<typename Tp2>
92	slice_allocator (const slice_allocator<Tp2> &) throw () { }
93
94	~slice_allocator () { }
95
96	pointer address (reference x) const { return &x; }
97	const_pointer address (const_reference x) const { return &x; }
98
99	pointer allocate (size_type n, const_pointer = 0)
100	{
101	return salloc<Tp> (n);
102	}
103
104	void deallocate (pointer p, size_type n)
105	{
106	sfree<Tp> (p, n);
107	}
108
109	size_type max_size ()const throw ()
110	{
111	return size_t (-1) / sizeof (Tp);
112	}
113
114	void construct (pointer p, const Tp &val)
115	{
116	::new (p) Tp (val);
117	}
118
119	void destroy (pointer p)
120	{
121	p->~Tp ();
122	}
123	};
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	typedef refptr<maptile> maptile_ptr;
157	typedef refptr<object> object_ptr;
158	typedef refptr<archetype> arch_ptr;
159	typedef refptr<client> client_ptr;
160	typedef refptr<player> player_ptr;
161
162	struct str_hash
163	{
164	std::size_t operator ()(const char *s) const
165	{
166	unsigned long hash = 0;
167
168	/* use the one-at-a-time hash function, which supposedly is
169	* better than the djb2-like one used by perl5.005, but
170	* certainly is better then the bug used here before.
171	* see http://burtleburtle.net/bob/hash/doobs.html
172	*/
173	while (*s)
174	{
175	hash += *s++;
176	hash += hash << 10;
177	hash ^= hash >> 6;
178	}
179
180	hash += hash << 3;
181	hash ^= hash >> 11;
182	hash += hash << 15;
183
184	return hash;
185	}
186	};
187
188	struct str_equal
189	{
190	bool operator ()(const char a, const char b) const
191	{
192	return !strcmp (a, b);
193	}
194	};
195
196	#include <vector>
197
198	template<class obj>
199	struct unordered_vector : std::vector<obj, slice_allocator<obj> >
200	{
201	typedef typename unordered_vector::iterator iterator;
202
203	void erase (unsigned int pos)
204	{
205	if (pos < this->size () - 1)
206	(this)[pos] = (this)[this->size () - 1];
207
208	this->pop_back ();
209	}
210
211	void erase (iterator i)
212	{
213	erase ((unsigned int )(i - this->begin ()));
214	}
215	};
216
217	template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
218	template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
219	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; }
220
221	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
222
223	// basically does what strncpy should do, but appends "..." to strings exceeding length
224	void assign (char dst, const char src, int maxlen);
225
226	// type-safe version of assign
227	template<int N>
228	inline void assign (char (&dst)[N], const char *src)
229	{
230	assign ((char *)&dst, src, N);
231	}
232
233	typedef double tstamp;
234
235	// return current time as timestampe
236	tstamp now ();
237
238	#endif
239