[ViewVC] Diff of: cvs/deliantra/server/include/util.h

Comparing deliantra/server/include/util.h (file contents):
Revision 1.60 by root, Tue Jan 22 15:53:01 2008 UTC vs.
Revision 1.107 by root, Sun May 2 14:46:56 2010 UTC

…		…
1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	*	5	*
6	* Deliantra is free software: you can redistribute it and/or modify	6	* Deliantra is free software: you can redistribute it and/or modify it under
7	* it under the terms of the GNU General Public License as published by	7	* the terms of the Affero GNU General Public License as published by the
8	* the Free Software Foundation, either version 3 of the License, or	8	* Free Software Foundation, either version 3 of the License, or (at your
9	* (at your option) any later version.	9	* option) any later version.
10	*	10	*
11	* This program is distributed in the hope that it will be useful,	11	* This program is distributed in the hope that it will be useful,
12	* but WITHOUT ANY WARRANTY; without even the implied warranty of	12	* but WITHOUT ANY WARRANTY; without even the implied warranty of
13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14	* GNU General Public License for more details.	14	* GNU General Public License for more details.
15	*	15	*
16	* You should have received a copy of the GNU General Public License	16	* You should have received a copy of the Affero GNU General Public License
17	* along with this program. If not, see <http://www.gnu.org/licenses/>.	17	* and the GNU General Public License along with this program. If not, see
		18	* <http://www.gnu.org/licenses/>.
18	*	19	*
19	* The authors can be reached via e-mail to <support@deliantra.net>	20	* The authors can be reached via e-mail to <support@deliantra.net>
20	*/	21	*/
21		22
22	#ifndef UTIL_H__	23	#ifndef UTIL_H__
23	#define UTIL_H__	24	#define UTIL_H__
24		25
25	//#define PREFER_MALLOC	26	#include <compiler.h>
26	#define DEBUG_SALLOC
27		27
28	#if __GNUC__ >= 3	28	#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
29	# define is_constant(c) __builtin_constant_p (c)	29	#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
30	# define expect(expr,value) __builtin_expect ((expr),(value))	30	#define PREFER_MALLOC 0 // use malloc and not the slice allocator
31	# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
32	#else
33	# define is_constant(c) 0
34	# define expect(expr,value) (expr)
35	# define prefetch(addr,rw,locality)
36	#endif
37		31
38	#if __GNUC__ < 4 \|\| (__GNUC__ == 4 \|\| __GNUC_MINOR__ < 4)	32	#include <pthread.h>
39	# define decltype(x) typeof(x)
40	#endif
41
42	// put into ifs if you are very sure that the expression
43	// is mostly true or mosty false. note that these return
44	// booleans, not the expression.
45	#define expect_false(expr) expect ((expr) != 0, 0)
46	#define expect_true(expr) expect ((expr) != 0, 1)
47		33
48	#include <cstddef>	34	#include <cstddef>
49	#include <cmath>	35	#include <cmath>
50	#include <new>	36	#include <new>
51	#include <vector>	37	#include <vector>
53	#include <glib.h>	39	#include <glib.h>
54		40
55	#include <shstr.h>	41	#include <shstr.h>
56	#include <traits.h>	42	#include <traits.h>
57		43
58	#ifdef DEBUG_SALLOC	44	#if DEBUG_SALLOC
59	# define g_slice_alloc0(s) debug_slice_alloc0(s)	45	# define g_slice_alloc0(s) debug_slice_alloc0(s)
60	# define g_slice_alloc(s) debug_slice_alloc(s)	46	# define g_slice_alloc(s) debug_slice_alloc(s)
61	# define g_slice_free1(s,p) debug_slice_free1(s,p)	47	# define g_slice_free1(s,p) debug_slice_free1(s,p)
62	void *g_slice_alloc (unsigned long size);	48	void *g_slice_alloc (unsigned long size);
63	void *g_slice_alloc0 (unsigned long size);	49	void *g_slice_alloc0 (unsigned long size);
64	void g_slice_free1 (unsigned long size, void *ptr);	50	void g_slice_free1 (unsigned long size, void *ptr);
		51	#elif PREFER_MALLOC
		52	# define g_slice_alloc0(s) calloc (1, (s))
		53	# define g_slice_alloc(s) malloc ((s))
		54	# define g_slice_free1(s,p) free ((p))
65	#endif	55	#endif
66		56
67	// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)	57	// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
68	#define auto(var,expr) decltype(expr) var = (expr)	58	#define auto(var,expr) decltype(expr) var = (expr)
69		59
		60	#if cplusplus_does_not_suck
		61	// does not work for local types (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2657.htm)
		62	template<typename T, int N>
		63	static inline int array_length (const T (&arr)[N])
		64	{
		65	return N;
		66	}
		67	#else
		68	#define array_length(name) (sizeof (name) / sizeof (name [0]))
		69	#endif
		70
70	// very ugly macro that basicaly declares and initialises a variable	71	// very ugly macro that basically declares and initialises a variable
71	// that is in scope for the next statement only	72	// that is in scope for the next statement only
72	// works only for stuff that can be assigned 0 and converts to false	73	// works only for stuff that can be assigned 0 and converts to false
73	// (note: works great for pointers)	74	// (note: works great for pointers)
74	// most ugly macro I ever wrote	75	// most ugly macro I ever wrote
75	#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)	76	#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
…		…
80		81
81	// in range excluding end	82	// in range excluding end
82	#define IN_RANGE_EXC(val,beg,end) \	83	#define IN_RANGE_EXC(val,beg,end) \
83	((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))	84	((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
84		85
		86	void cleanup (const char *cause, bool make_core = false);
85	void fork_abort (const char *msg);	87	void fork_abort (const char *msg);
86		88
87	// rationale for using (U) not (T) is to reduce signed/unsigned issues,	89	// rationale for using (U) not (T) is to reduce signed/unsigned issues,
88	// as a is often a constant while b is the variable. it is still a bug, though.	90	// as a is often a constant while b is the variable. it is still a bug, though.
89	template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }	91	template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
90	template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }	92	template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
91	template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; }	93	template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; }
92		94
		95	template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); }
		96	template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); }
		97	template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); }
		98
93	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }	99	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
94		100
		101	template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
		102	template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
		103
		104	// sign returns -1 or +1
		105	template<typename T>
		106	static inline T sign (T v) { return v < 0 ? -1 : +1; }
		107	// relies on 2c representation
		108	template<>
		109	inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); }
		110	template<>
		111	inline sint16 sign (sint16 v) { return 1 - (sint16 (uint16 (v) >> 15) * 2); }
		112	template<>
		113	inline sint32 sign (sint32 v) { return 1 - (sint32 (uint32 (v) >> 31) * 2); }
		114
		115	// sign0 returns -1, 0 or +1
		116	template<typename T>
		117	static inline T sign0 (T v) { return v ? sign (v) : 0; }
		118
		119	template<typename T, typename U>
		120	static inline T copysign (T a, U b) { return a > 0 ? b : -b; }
		121
		122	// div* only work correctly for div > 0
		123	// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
		124	template<typename T> static inline T div (T val, T div)
		125	{
		126	return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div;
		127	}
		128
		129	template<> inline float div (float val, float div) { return val / div; }
		130	template<> inline double div (double val, double div) { return val / div; }
		131
		132	// div, round-up
		133	template<typename T> static inline T div_ru (T val, T div)
		134	{
		135	return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div;
		136	}
		137	// div, round-down
		138	template<typename T> static inline T div_rd (T val, T div)
		139	{
		140	return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div;
		141	}
		142
		143	// lerp* only work correctly for min_in < max_in
		144	// Linear intERPolate, scales val from min_in..max_in to min_out..max_out
95	template<typename T>	145	template<typename T>
96	static inline T	146	static inline T
97	lerp (T val, T min_in, T max_in, T min_out, T max_out)	147	lerp (T val, T min_in, T max_in, T min_out, T max_out)
98	{	148	{
99	return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out;	149	return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
		150	}
		151
		152	// lerp, round-down
		153	template<typename T>
		154	static inline T
		155	lerp_rd (T val, T min_in, T max_in, T min_out, T max_out)
		156	{
		157	return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
		158	}
		159
		160	// lerp, round-up
		161	template<typename T>
		162	static inline T
		163	lerp_ru (T val, T min_in, T max_in, T min_out, T max_out)
		164	{
		165	return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
100	}	166	}
101		167
102	// lots of stuff taken from FXT	168	// lots of stuff taken from FXT
103		169
104	/* Rotate right. This is used in various places for checksumming */	170	/* Rotate right. This is used in various places for checksumming */
…		…
142	int32_t d = b - a;	208	int32_t d = b - a;
143	d &= d >> 31;	209	d &= d >> 31;
144	return b - d;	210	return b - d;
145	}	211	}
146		212
147	// this is much faster than crossfires original algorithm	213	// this is much faster than crossfire's original algorithm
148	// on modern cpus	214	// on modern cpus
149	inline int	215	inline int
150	isqrt (int n)	216	isqrt (int n)
151	{	217	{
152	return (int)sqrtf ((float)n);	218	return (int)sqrtf ((float)n);
		219	}
		220
		221	// this is kind of like the ^^ operator, if it would exist, without sequence point.
		222	// more handy than it looks like, due to the implicit !! done on its arguments
		223	inline bool
		224	logical_xor (bool a, bool b)
		225	{
		226	return a != b;
		227	}
		228
		229	inline bool
		230	logical_implies (bool a, bool b)
		231	{
		232	return a <= b;
153	}	233	}
154		234
155	// this is only twice as fast as naive sqrtf (dxdy+dydy)	235	// this is only twice as fast as naive sqrtf (dxdy+dydy)
156	#if 0	236	#if 0
157	// and has a max. error of 6 in the range -100..+100.	237	// and has a max. error of 6 in the range -100..+100.
…		…
182	absdir (int d)	262	absdir (int d)
183	{	263	{
184	return ((d - 1) & 7) + 1;	264	return ((d - 1) & 7) + 1;
185	}	265	}
186		266
		267	// avoid ctz name because netbsd or freebsd spams it's namespace with it
		268	#if GCC_VERSION(3,4)
		269	static inline int least_significant_bit (uint32_t x)
		270	{
		271	return __builtin_ctz (x);
		272	}
		273	#else
		274	int least_significant_bit (uint32_t x);
		275	#endif
		276
		277	#define for_all_bits_sparse_32(mask, idxvar) \
		278	for (uint32_t idxvar, mask_ = mask; \
		279	mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);)
		280
187	extern size_t slice_alloc; // statistics	281	extern ssize_t slice_alloc; // statistics
		282
		283	void *salloc_ (int n) throw (std::bad_alloc);
		284	void salloc_ (int n, void src) throw (std::bad_alloc);
		285
		286	// strictly the same as g_slice_alloc, but never returns 0
		287	template<typename T>
		288	inline T salloc (int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T)); }
		289
		290	// also copies src into the new area, like "memdup"
		291	// if src is 0, clears the memory
		292	template<typename T>
		293	inline T salloc (int n, T src) throw (std::bad_alloc) { return (T )salloc_ (n sizeof (T), (void *)src); }
		294
		295	// clears the memory
		296	template<typename T>
		297	inline T salloc0(int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T), 0); }
		298
		299	// for symmetry
		300	template<typename T>
		301	inline void sfree (T *ptr, int n = 1) throw ()
		302	{
		303	if (expect_true (ptr))
		304	{
		305	slice_alloc -= n * sizeof (T);
		306	if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
		307	g_slice_free1 (n * sizeof (T), (void *)ptr);
		308	assert (slice_alloc >= 0);//D
		309	}
		310	}
		311
		312	// nulls the pointer
		313	template<typename T>
		314	inline void sfree0 (T *&ptr, int n = 1) throw ()
		315	{
		316	sfree<T> (ptr, n);
		317	ptr = 0;
		318	}
188		319
189	// makes dynamically allocated objects zero-initialised	320	// makes dynamically allocated objects zero-initialised
190	struct zero_initialised	321	struct zero_initialised
191	{	322	{
192	void operator new (size_t s, void p)	323	void operator new (size_t s, void p)
…		…
195	return p;	326	return p;
196	}	327	}
197		328
198	void *operator new (size_t s)	329	void *operator new (size_t s)
199	{	330	{
200	slice_alloc += s;
201	return g_slice_alloc0 (s);	331	return salloc0<char> (s);
202	}	332	}
203		333
204	void *operator new[] (size_t s)	334	void *operator new[] (size_t s)
205	{	335	{
206	slice_alloc += s;
207	return g_slice_alloc0 (s);	336	return salloc0<char> (s);
208	}	337	}
209		338
210	void operator delete (void *p, size_t s)	339	void operator delete (void *p, size_t s)
211	{	340	{
212	slice_alloc -= s;	341	sfree ((char *)p, s);
213	g_slice_free1 (s, p);
214	}	342	}
215		343
216	void operator delete[] (void *p, size_t s)	344	void operator delete[] (void *p, size_t s)
217	{	345	{
218	slice_alloc -= s;	346	sfree ((char *)p, s);
219	g_slice_free1 (s, p);
220	}	347	}
221	};	348	};
222		349
223	void *salloc_ (int n) throw (std::bad_alloc);	350	// makes dynamically allocated objects zero-initialised
224	void salloc_ (int n, void src) throw (std::bad_alloc);	351	struct slice_allocated
225
226	// strictly the same as g_slice_alloc, but never returns 0
227	template<typename T>
228	inline T salloc (int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T)); }
229
230	// also copies src into the new area, like "memdup"
231	// if src is 0, clears the memory
232	template<typename T>
233	inline T salloc (int n, T src) throw (std::bad_alloc) { return (T )salloc_ (n sizeof (T), (void *)src); }
234
235	// clears the memory
236	template<typename T>
237	inline T salloc0(int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T), 0); }
238
239	// for symmetry
240	template<typename T>
241	inline void sfree (T *ptr, int n = 1) throw ()
242	{	352	{
243	#ifdef PREFER_MALLOC	353	void operator new (size_t s, void p)
244	free (ptr);	354	{
245	#else	355	return p;
246	slice_alloc -= n * sizeof (T);	356	}
247	g_slice_free1 (n * sizeof (T), (void *)ptr);	357
248	#endif	358	void *operator new (size_t s)
249	}	359	{
		360	return salloc<char> (s);
		361	}
		362
		363	void *operator new[] (size_t s)
		364	{
		365	return salloc<char> (s);
		366	}
		367
		368	void operator delete (void *p, size_t s)
		369	{
		370	sfree ((char *)p, s);
		371	}
		372
		373	void operator delete[] (void *p, size_t s)
		374	{
		375	sfree ((char *)p, s);
		376	}
		377	};
250		378
251	// a STL-compatible allocator that uses g_slice	379	// a STL-compatible allocator that uses g_slice
252	// boy, this is verbose	380	// boy, this is verbose
253	template<typename Tp>	381	template<typename Tp>
254	struct slice_allocator	382	struct slice_allocator
…		…
266	{	394	{
267	typedef slice_allocator<U> other;	395	typedef slice_allocator<U> other;
268	};	396	};
269		397
270	slice_allocator () throw () { }	398	slice_allocator () throw () { }
271	slice_allocator (const slice_allocator &o) throw () { }	399	slice_allocator (const slice_allocator &) throw () { }
272	template<typename Tp2>	400	template<typename Tp2>
273	slice_allocator (const slice_allocator<Tp2> &) throw () { }	401	slice_allocator (const slice_allocator<Tp2> &) throw () { }
274		402
275	~slice_allocator () { }	403	~slice_allocator () { }
276		404
…		…
285	void deallocate (pointer p, size_type n)	413	void deallocate (pointer p, size_type n)
286	{	414	{
287	sfree<Tp> (p, n);	415	sfree<Tp> (p, n);
288	}	416	}
289		417
290	size_type max_size ()const throw ()	418	size_type max_size () const throw ()
291	{	419	{
292	return size_t (-1) / sizeof (Tp);	420	return size_t (-1) / sizeof (Tp);
293	}	421	}
294		422
295	void construct (pointer p, const Tp &val)	423	void construct (pointer p, const Tp &val)
…		…
306	// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.	434	// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
307	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps	435	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
308	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps	436	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
309	struct tausworthe_random_generator	437	struct tausworthe_random_generator
310	{	438	{
311	// generator
312	uint32_t state [4];	439	uint32_t state [4];
313		440
314	void operator =(const tausworthe_random_generator &src)	441	void operator =(const tausworthe_random_generator &src)
315	{	442	{
316	state [0] = src.state [0];	443	state [0] = src.state [0];
…		…
319	state [3] = src.state [3];	446	state [3] = src.state [3];
320	}	447	}
321		448
322	void seed (uint32_t seed);	449	void seed (uint32_t seed);
323	uint32_t next ();	450	uint32_t next ();
		451	};
324		452
		453	// Xorshift RNGs, George Marsaglia
		454	// http://www.jstatsoft.org/v08/i14/paper
		455	// this one is about 40% faster than the tausworthe one above (i.e. not much),
		456	// despite the inlining, and has the issue of only creating 2**32-1 numbers.
		457	// see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf
		458	struct xorshift_random_generator
		459	{
		460	uint32_t x, y;
		461
		462	void operator =(const xorshift_random_generator &src)
		463	{
		464	x = src.x;
		465	y = src.y;
		466	}
		467
		468	void seed (uint32_t seed)
		469	{
		470	x = seed;
		471	y = seed * 69069U;
		472	}
		473
		474	uint32_t next ()
		475	{
		476	uint32_t t = x ^ (x << 10);
		477	x = y;
		478	y = y ^ (y >> 13) ^ t ^ (t >> 10);
		479	return y;
		480	}
		481	};
		482
		483	template<class generator>
		484	struct random_number_generator : generator
		485	{
325	// uniform distribution	486	// uniform distribution, [0 .. num - 1]
326	uint32_t operator ()(uint32_t num)	487	uint32_t operator ()(uint32_t num)
327	{	488	{
328	return is_constant (num)	489	return !is_constant (num) ? get_range (num) // non-constant
329	? (next () * (uint64_t)num) >> 32U	490	: num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two
330	: get_range (num);	491	: this->next () & (num - 1); // constant, power-of-two
331	}	492	}
332		493
333	// return a number within (min .. max)	494	// return a number within the closed interval [min .. max]
334	int operator () (int r_min, int r_max)	495	int operator () (int r_min, int r_max)
335	{	496	{
336	return is_constant (r_min) && is_constant (r_max) && r_min <= r_max	497	return is_constant (r_min <= r_max) && r_min <= r_max
337	? r_min + operator ()(r_max - r_min + 1)	498	? r_min + operator ()(r_max - r_min + 1)
338	: get_range (r_min, r_max);	499	: get_range (r_min, r_max);
339	}	500	}
340		501
		502	// return a number within the half-open interval [0..1[
341	double operator ()()	503	double operator ()()
342	{	504	{
343	return this->next () / (double)0xFFFFFFFFU;	505	return this->next () / (double)0x100000000;
344	}	506	}
345		507
346	protected:	508	protected:
347	uint32_t get_range (uint32_t r_max);	509	uint32_t get_range (uint32_t r_max);
348	int get_range (int r_min, int r_max);	510	int get_range (int r_min, int r_max);
349	};	511	};
350		512
351	typedef tausworthe_random_generator rand_gen;	513	typedef random_number_generator<tausworthe_random_generator> rand_gen;
352		514
353	extern rand_gen rndm;	515	extern rand_gen rndm, rmg_rndm;
354		516
355	INTERFACE_CLASS (attachable)	517	INTERFACE_CLASS (attachable)
356	struct refcnt_base	518	struct refcnt_base
357	{	519	{
358	typedef int refcnt_t;	520	typedef int refcnt_t;
…		…
420	typedef refptr<maptile> maptile_ptr;	582	typedef refptr<maptile> maptile_ptr;
421	typedef refptr<object> object_ptr;	583	typedef refptr<object> object_ptr;
422	typedef refptr<archetype> arch_ptr;	584	typedef refptr<archetype> arch_ptr;
423	typedef refptr<client> client_ptr;	585	typedef refptr<client> client_ptr;
424	typedef refptr<player> player_ptr;	586	typedef refptr<player> player_ptr;
		587	typedef refptr<region> region_ptr;
		588
		589	#define STRHSH_NULL 2166136261
		590
		591	static inline uint32_t
		592	strhsh (const char *s)
		593	{
		594	// use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
		595	// it is about twice as fast as the one-at-a-time one,
		596	// with good distribution.
		597	// FNV-1a is faster on many cpus because the multiplication
		598	// runs concurrently with the looping logic.
		599	uint32_t hash = STRHSH_NULL;
		600
		601	while (*s)
		602	hash = (hash ^ s++) 16777619U;
		603
		604	return hash;
		605	}
		606
		607	static inline uint32_t
		608	memhsh (const char *s, size_t len)
		609	{
		610	uint32_t hash = STRHSH_NULL;
		611
		612	while (len--)
		613	hash = (hash ^ s++) 16777619U;
		614
		615	return hash;
		616	}
425		617
426	struct str_hash	618	struct str_hash
427	{	619	{
428	std::size_t operator ()(const char *s) const	620	std::size_t operator ()(const char *s) const
429	{	621	{
430	unsigned long hash = 0;
431
432	/* use the one-at-a-time hash function, which supposedly is
433	* better than the djb2-like one used by perl5.005, but
434	* certainly is better then the bug used here before.
435	* see http://burtleburtle.net/bob/hash/doobs.html
436	*/
437	while (*s)
438	{
439	hash += *s++;
440	hash += hash << 10;
441	hash ^= hash >> 6;
442	}
443
444	hash += hash << 3;
445	hash ^= hash >> 11;
446	hash += hash << 15;
447
448	return hash;	622	return strhsh (s);
		623	}
		624
		625	std::size_t operator ()(const shstr &s) const
		626	{
		627	return strhsh (s);
449	}	628	}
450	};	629	};
451		630
452	struct str_equal	631	struct str_equal
453	{	632	{
…		…
546	erase (&obj);	725	erase (&obj);
547	}	726	}
548	};	727	};
549		728
550	// basically does what strncpy should do, but appends "..." to strings exceeding length	729	// basically does what strncpy should do, but appends "..." to strings exceeding length
		730	// returns the number of bytes actually used (including \0)
551	void assign (char dst, const char src, int maxlen);	731	int assign (char dst, const char src, int maxsize);
552		732
553	// type-safe version of assign	733	// type-safe version of assign
554	template<int N>	734	template<int N>
555	inline void assign (char (&dst)[N], const char *src)	735	inline int assign (char (&dst)[N], const char *src)
556	{	736	{
557	assign ((char *)&dst, src, N);	737	return assign ((char *)&dst, src, N);
558	}	738	}
559		739
560	typedef double tstamp;	740	typedef double tstamp;
561		741
562	// return current time as timestamp	742	// return current time as timestamp
563	tstamp now ();	743	tstamp now ();
564		744
565	int similar_direction (int a, int b);	745	int similar_direction (int a, int b);
566		746
567	// like sprintf, but returns a "static" buffer	747	// like v?sprintf, but returns a "static" buffer
568	const char format (const char format, ...);	748	char vformat (const char format, va_list ap);
		749	char format (const char format, ...) attribute ((format (printf, 1, 2)));
569		750
		751	// safety-check player input which will become object->msg
		752	bool msg_is_safe (const char *msg);
		753
		754	/////////////////////////////////////////////////////////////////////////////
		755	// threads, very very thin wrappers around pthreads
		756
		757	struct thread
		758	{
		759	pthread_t id;
		760
		761	void start (void (start_routine)(void ), void arg = 0);
		762
		763	void cancel ()
		764	{
		765	pthread_cancel (id);
		766	}
		767
		768	void *join ()
		769	{
		770	void *ret;
		771
		772	if (pthread_join (id, &ret))
		773	cleanup ("pthread_join failed", 1);
		774
		775	return ret;
		776	}
		777	};
		778
		779	// note that mutexes are not classes
		780	typedef pthread_mutex_t smutex;
		781
		782	#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
		783	#define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
		784	#else
		785	#define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
570	#endif	786	#endif
571		787
		788	#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
		789	#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
		790	#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
		791
		792	typedef pthread_cond_t scond;
		793
		794	#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
		795	#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
		796	#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
		797	#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
		798
		799	#endif
		800

Diff Legend

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

Comparing deliantra/server/include/util.h (file contents): Revision 1.60 by root, Tue Jan 22 15:53:01 2008 UTC vs. Revision 1.107 by root, Sun May 2 14:46:56 2010 UTC

Diff Legend

Comparing deliantra/server/include/util.h (file contents):
Revision 1.60 by root, Tue Jan 22 15:53:01 2008 UTC vs.
Revision 1.107 by root, Sun May 2 14:46:56 2010 UTC