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

Comparing deliantra/server/include/util.h (file contents):
Revision 1.54 by root, Mon Aug 6 10:54:12 2007 UTC vs.
Revision 1.103 by root, Thu Apr 29 15:49:04 2010 UTC

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

Diff Legend

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

Comparing deliantra/server/include/util.h (file contents): Revision 1.54 by root, Mon Aug 6 10:54:12 2007 UTC vs. Revision 1.103 by root, Thu Apr 29 15:49:04 2010 UTC

Diff Legend

Comparing deliantra/server/include/util.h (file contents):
Revision 1.54 by root, Mon Aug 6 10:54:12 2007 UTC vs.
Revision 1.103 by root, Thu Apr 29 15:49:04 2010 UTC