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

Comparing deliantra/server/include/util.h (file contents):
Revision 1.30 by root, Mon Jan 15 01:50:33 2007 UTC vs.
Revision 1.100 by root, Thu Apr 22 13:01:58 2010 UTC

…		…
		1	/*
		2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
		3	*
		4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
		5	*
		6	* Deliantra is free software: you can redistribute it and/or modify it under
		7	* the terms of the Affero GNU General Public License as published by the
		8	* Free Software Foundation, either version 3 of the License, or (at your
		9	* option) any later version.
		10	*
		11	* This program is distributed in the hope that it will be useful,
		12	* but WITHOUT ANY WARRANTY; without even the implied warranty of
		13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
		14	* GNU General Public License for more details.
		15	*
		16	* You should have received a copy of the Affero GNU General Public License
		17	* and the GNU General Public License along with this program. If not, see
		18	* <http://www.gnu.org/licenses/>.
		19	*
		20	* The authors can be reached via e-mail to <support@deliantra.net>
		21	*/
		22
1	#ifndef UTIL_H__	23	#ifndef UTIL_H__
2	#define UTIL_H__	24	#define UTIL_H__
3		25
4	#if __GNUC__ >= 3	26	#include <compiler.h>
5	# define is_constant(c) __builtin_constant_p (c)	27
6	#else	28	#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
7	# define is_constant(c) 0	29	#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
8	#endif	30	#define PREFER_MALLOC 0 // use malloc and not the slice allocator
		31
		32	#include <pthread.h>
9		33
10	#include <cstddef>	34	#include <cstddef>
11	#include <cmath>	35	#include <cmath>
12	#include <new>	36	#include <new>
13	#include <vector>	37	#include <vector>
15	#include <glib.h>	39	#include <glib.h>
16		40
17	#include <shstr.h>	41	#include <shstr.h>
18	#include <traits.h>	42	#include <traits.h>
19		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
20	// use a gcc extension for auto declarations until ISO C++ sanctifies them	57	// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
21	#define AUTODECL(var,expr) typeof(expr) var = (expr)	58	#define auto(var,expr) decltype(expr) var = (expr)
22		59
23	// very ugly macro that basicaly declares and initialises a variable	60	// very ugly macro that basically declares and initialises a variable
24	// that is in scope for the next statement only	61	// that is in scope for the next statement only
25	// works only for stuff that can be assigned 0 and converts to false	62	// works only for stuff that can be assigned 0 and converts to false
26	// (note: works great for pointers)	63	// (note: works great for pointers)
27	// most ugly macro I ever wrote	64	// most ugly macro I ever wrote
28	#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)	65	#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
29		66
30	// in range including end	67	// in range including end
31	#define IN_RANGE_INC(val,beg,end) \	68	#define IN_RANGE_INC(val,beg,end) \
32	((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))	69	((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
33		70
34	// in range excluding end	71	// in range excluding end
35	#define IN_RANGE_EXC(val,beg,end) \	72	#define IN_RANGE_EXC(val,beg,end) \
36	((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))	73	((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
37		74
		75	void cleanup (const char *cause, bool make_core = false);
		76	void fork_abort (const char *msg);
		77
		78	// rationale for using (U) not (T) is to reduce signed/unsigned issues,
		79	// as a is often a constant while b is the variable. it is still a bug, though.
		80	template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
		81	template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
		82	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; }
		83
		84	template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); }
		85	template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); }
		86	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); }
		87
		88	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
		89
		90	template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
		91	template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
		92
		93	// sign returns -1 or +1
		94	template<typename T>
		95	static inline T sign (T v) { return v < 0 ? -1 : +1; }
		96	// relies on 2c representation
		97	template<>
		98	inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); }
		99
		100	// sign0 returns -1, 0 or +1
		101	template<typename T>
		102	static inline T sign0 (T v) { return v ? sign (v) : 0; }
		103
		104	template<typename T, typename U>
		105	static inline T copysign (T a, U b) { return a > 0 ? b : -b; }
		106
		107	// div* only work correctly for div > 0
		108	// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
		109	template<typename T> static inline T div (T val, T div)
		110	{
		111	return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div;
		112	}
		113	// div, round-up
		114	template<typename T> static inline T div_ru (T val, T div)
		115	{
		116	return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div;
		117	}
		118	// div, round-down
		119	template<typename T> static inline T div_rd (T val, T div)
		120	{
		121	return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div;
		122	}
		123
		124	// lerp* only work correctly for min_in < max_in
		125	// Linear intERPolate, scales val from min_in..max_in to min_out..max_out
		126	template<typename T>
		127	static inline T
		128	lerp (T val, T min_in, T max_in, T min_out, T max_out)
		129	{
		130	return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
		131	}
		132
		133	// lerp, round-down
		134	template<typename T>
		135	static inline T
		136	lerp_rd (T val, T min_in, T max_in, T min_out, T max_out)
		137	{
		138	return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
		139	}
		140
		141	// lerp, round-up
		142	template<typename T>
		143	static inline T
		144	lerp_ru (T val, T min_in, T max_in, T min_out, T max_out)
		145	{
		146	return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
		147	}
		148
		149	// lots of stuff taken from FXT
		150
		151	/* Rotate right. This is used in various places for checksumming */
		152	//TODO: that sucks, use a better checksum algo
		153	static inline uint32_t
		154	rotate_right (uint32_t c, uint32_t count = 1)
		155	{
		156	return (c << (32 - count)) \| (c >> count);
		157	}
		158
		159	static inline uint32_t
		160	rotate_left (uint32_t c, uint32_t count = 1)
		161	{
		162	return (c >> (32 - count)) \| (c << count);
		163	}
		164
		165	// Return abs(a-b)
		166	// Both a and b must not have the most significant bit set
		167	static inline uint32_t
		168	upos_abs_diff (uint32_t a, uint32_t b)
		169	{
		170	long d1 = b - a;
		171	long d2 = (d1 & (d1 >> 31)) << 1;
		172
		173	return d1 - d2; // == (b - d) - (a + d);
		174	}
		175
		176	// Both a and b must not have the most significant bit set
		177	static inline uint32_t
		178	upos_min (uint32_t a, uint32_t b)
		179	{
		180	int32_t d = b - a;
		181	d &= d >> 31;
		182	return a + d;
		183	}
		184
		185	// Both a and b must not have the most significant bit set
		186	static inline uint32_t
		187	upos_max (uint32_t a, uint32_t b)
		188	{
		189	int32_t d = b - a;
		190	d &= d >> 31;
		191	return b - d;
		192	}
		193
38	// this is much faster than crossfires original algorithm	194	// this is much faster than crossfire's original algorithm
39	// on modern cpus	195	// on modern cpus
40	inline int	196	inline int
41	isqrt (int n)	197	isqrt (int n)
42	{	198	{
43	return (int)sqrtf ((float)n);	199	return (int)sqrtf ((float)n);
		200	}
		201
		202	// this is kind of like the ^^ operator, if it would exist, without sequence point.
		203	// more handy than it looks like, due to the implicit !! done on its arguments
		204	inline bool
		205	logical_xor (bool a, bool b)
		206	{
		207	return a != b;
		208	}
		209
		210	inline bool
		211	logical_implies (bool a, bool b)
		212	{
		213	return a <= b;
44	}	214	}
45		215
46	// this is only twice as fast as naive sqrtf (dxdy+dydy)	216	// this is only twice as fast as naive sqrtf (dxdy+dydy)
47	#if 0	217	#if 0
48	// and has a max. error of 6 in the range -100..+100.	218	// and has a max. error of 6 in the range -100..+100.
…		…
73	absdir (int d)	243	absdir (int d)
74	{	244	{
75	return ((d - 1) & 7) + 1;	245	return ((d - 1) & 7) + 1;
76	}	246	}
77		247
		248	// avoid ctz name because netbsd or freebsd spams it's namespace with it
		249	#if GCC_VERSION(3,4)
		250	static inline int least_significant_bit (uint32_t x)
		251	{
		252	return __builtin_ctz (x);
		253	}
		254	#else
		255	int least_significant_bit (uint32_t x);
		256	#endif
		257
		258	#define for_all_bits_sparse_32(mask, idxvar) \
		259	for (uint32_t idxvar, mask_ = mask; \
		260	mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);)
		261
		262	extern ssize_t slice_alloc; // statistics
		263
		264	void *salloc_ (int n) throw (std::bad_alloc);
		265	void salloc_ (int n, void src) throw (std::bad_alloc);
		266
		267	// strictly the same as g_slice_alloc, but never returns 0
		268	template<typename T>
		269	inline T salloc (int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T)); }
		270
		271	// also copies src into the new area, like "memdup"
		272	// if src is 0, clears the memory
		273	template<typename T>
		274	inline T salloc (int n, T src) throw (std::bad_alloc) { return (T )salloc_ (n sizeof (T), (void *)src); }
		275
		276	// clears the memory
		277	template<typename T>
		278	inline T salloc0(int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T), 0); }
		279
		280	// for symmetry
		281	template<typename T>
		282	inline void sfree (T *ptr, int n = 1) throw ()
		283	{
		284	if (expect_true (ptr))
		285	{
		286	slice_alloc -= n * sizeof (T);
		287	if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
		288	g_slice_free1 (n * sizeof (T), (void *)ptr);
		289	assert (slice_alloc >= 0);//D
		290	}
		291	}
		292
		293	// nulls the pointer
		294	template<typename T>
		295	inline void sfree0 (T *&ptr, int n = 1) throw ()
		296	{
		297	sfree<T> (ptr, n);
		298	ptr = 0;
		299	}
		300
78	// makes dynamically allocated objects zero-initialised	301	// makes dynamically allocated objects zero-initialised
79	struct zero_initialised	302	struct zero_initialised
80	{	303	{
81	void operator new (size_t s, void p)	304	void operator new (size_t s, void p)
82	{	305	{
…		…
84	return p;	307	return p;
85	}	308	}
86		309
87	void *operator new (size_t s)	310	void *operator new (size_t s)
88	{	311	{
89	return g_slice_alloc0 (s);	312	return salloc0<char> (s);
90	}	313	}
91		314
92	void *operator new[] (size_t s)	315	void *operator new[] (size_t s)
93	{	316	{
94	return g_slice_alloc0 (s);	317	return salloc0<char> (s);
95	}	318	}
96		319
97	void operator delete (void *p, size_t s)	320	void operator delete (void *p, size_t s)
98	{	321	{
99	g_slice_free1 (s, p);	322	sfree ((char *)p, s);
100	}	323	}
101		324
102	void operator delete[] (void *p, size_t s)	325	void operator delete[] (void *p, size_t s)
103	{	326	{
104	g_slice_free1 (s, p);	327	sfree ((char *)p, s);
105	}	328	}
106	};	329	};
107		330
108	void *salloc_ (int n) throw (std::bad_alloc);	331	// makes dynamically allocated objects zero-initialised
109	void salloc_ (int n, void src) throw (std::bad_alloc);	332	struct slice_allocated
110
111	// strictly the same as g_slice_alloc, but never returns 0
112	template<typename T>
113	inline T salloc (int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T)); }
114
115	// also copies src into the new area, like "memdup"
116	// if src is 0, clears the memory
117	template<typename T>
118	inline T salloc (int n, T src) throw (std::bad_alloc) { return (T )salloc_ (n sizeof (T), (void *)src); }
119
120	// clears the memory
121	template<typename T>
122	inline T salloc0(int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T), 0); }
123
124	// for symmetry
125	template<typename T>
126	inline void sfree (T *ptr, int n = 1) throw ()
127	{	333	{
128	g_slice_free1 (n * sizeof (T), (void *)ptr);	334	void operator new (size_t s, void p)
129	}	335	{
		336	return p;
		337	}
		338
		339	void *operator new (size_t s)
		340	{
		341	return salloc<char> (s);
		342	}
		343
		344	void *operator new[] (size_t s)
		345	{
		346	return salloc<char> (s);
		347	}
		348
		349	void operator delete (void *p, size_t s)
		350	{
		351	sfree ((char *)p, s);
		352	}
		353
		354	void operator delete[] (void *p, size_t s)
		355	{
		356	sfree ((char *)p, s);
		357	}
		358	};
130		359
131	// a STL-compatible allocator that uses g_slice	360	// a STL-compatible allocator that uses g_slice
132	// boy, this is verbose	361	// boy, this is verbose
133	template<typename Tp>	362	template<typename Tp>
134	struct slice_allocator	363	struct slice_allocator
…		…
146	{	375	{
147	typedef slice_allocator<U> other;	376	typedef slice_allocator<U> other;
148	};	377	};
149		378
150	slice_allocator () throw () { }	379	slice_allocator () throw () { }
151	slice_allocator (const slice_allocator &o) throw () { }	380	slice_allocator (const slice_allocator &) throw () { }
152	template<typename Tp2>	381	template<typename Tp2>
153	slice_allocator (const slice_allocator<Tp2> &) throw () { }	382	slice_allocator (const slice_allocator<Tp2> &) throw () { }
154		383
155	~slice_allocator () { }	384	~slice_allocator () { }
156		385
…		…
165	void deallocate (pointer p, size_type n)	394	void deallocate (pointer p, size_type n)
166	{	395	{
167	sfree<Tp> (p, n);	396	sfree<Tp> (p, n);
168	}	397	}
169		398
170	size_type max_size ()const throw ()	399	size_type max_size () const throw ()
171	{	400	{
172	return size_t (-1) / sizeof (Tp);	401	return size_t (-1) / sizeof (Tp);
173	}	402	}
174		403
175	void construct (pointer p, const Tp &val)	404	void construct (pointer p, const Tp &val)
…		…
180	void destroy (pointer p)	409	void destroy (pointer p)
181	{	410	{
182	p->~Tp ();	411	p->~Tp ();
183	}	412	}
184	};	413	};
		414
		415	// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
		416	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
		417	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
		418	struct tausworthe_random_generator
		419	{
		420	uint32_t state [4];
		421
		422	void operator =(const tausworthe_random_generator &src)
		423	{
		424	state [0] = src.state [0];
		425	state [1] = src.state [1];
		426	state [2] = src.state [2];
		427	state [3] = src.state [3];
		428	}
		429
		430	void seed (uint32_t seed);
		431	uint32_t next ();
		432	};
		433
		434	// Xorshift RNGs, George Marsaglia
		435	// http://www.jstatsoft.org/v08/i14/paper
		436	// this one is about 40% faster than the tausworthe one above (i.e. not much),
		437	// despite the inlining, and has the issue of only creating 2**32-1 numbers.
		438	// see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf
		439	struct xorshift_random_generator
		440	{
		441	uint32_t x, y;
		442
		443	void operator =(const xorshift_random_generator &src)
		444	{
		445	x = src.x;
		446	y = src.y;
		447	}
		448
		449	void seed (uint32_t seed)
		450	{
		451	x = seed;
		452	y = seed * 69069U;
		453	}
		454
		455	uint32_t next ()
		456	{
		457	uint32_t t = x ^ (x << 10);
		458	x = y;
		459	y = y ^ (y >> 13) ^ t ^ (t >> 10);
		460	return y;
		461	}
		462	};
		463
		464	template<class generator>
		465	struct random_number_generator : generator
		466	{
		467	// uniform distribution, 0 .. max (0, num - 1)
		468	uint32_t operator ()(uint32_t num)
		469	{
		470	return !is_constant (num) ? get_range (num) // non-constant
		471	: num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two
		472	: this->next () & (num - 1); // constant, power-of-two
		473	}
		474
		475	// return a number within the closed interval [min .. max]
		476	int operator () (int r_min, int r_max)
		477	{
		478	return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
		479	? r_min + operator ()(r_max - r_min + 1)
		480	: get_range (r_min, r_max);
		481	}
		482
		483	// return a number within the closed interval [0..1]
		484	double operator ()()
		485	{
		486	return this->next () / (double)0xFFFFFFFFU;
		487	}
		488
		489	protected:
		490	uint32_t get_range (uint32_t r_max);
		491	int get_range (int r_min, int r_max);
		492	};
		493
		494	typedef random_number_generator<tausworthe_random_generator> rand_gen;
		495
		496	extern rand_gen rndm, rmg_rndm;
		497
		498	INTERFACE_CLASS (attachable)
		499	struct refcnt_base
		500	{
		501	typedef int refcnt_t;
		502	mutable refcnt_t ACC (RW, refcnt);
		503
		504	MTH void refcnt_inc () const { ++refcnt; }
		505	MTH void refcnt_dec () const { --refcnt; }
		506
		507	refcnt_base () : refcnt (0) { }
		508	};
		509
		510	// to avoid branches with more advanced compilers
		511	extern refcnt_base::refcnt_t refcnt_dummy;
185		512
186	template<class T>	513	template<class T>
187	struct refptr	514	struct refptr
188	{	515	{
		516	// p if not null
		517	refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
		518
		519	void refcnt_dec ()
		520	{
		521	if (!is_constant (p))
		522	--*refcnt_ref ();
		523	else if (p)
		524	--p->refcnt;
		525	}
		526
		527	void refcnt_inc ()
		528	{
		529	if (!is_constant (p))
		530	++*refcnt_ref ();
		531	else if (p)
		532	++p->refcnt;
		533	}
		534
189	T *p;	535	T *p;
190		536
191	refptr () : p(0) { }	537	refptr () : p(0) { }
192	refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); }	538	refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
193	refptr (T *p) : p(p) { if (p) p->refcnt_inc (); }	539	refptr (T *p) : p(p) { refcnt_inc (); }
194	~refptr () { if (p) p->refcnt_dec (); }	540	~refptr () { refcnt_dec (); }
195		541
196	const refptr<T> &operator =(T *o)	542	const refptr<T> &operator =(T *o)
197	{	543	{
		544	// if decrementing ever destroys we need to reverse the order here
198	if (p) p->refcnt_dec ();	545	refcnt_dec ();
199	p = o;	546	p = o;
200	if (p) p->refcnt_inc ();	547	refcnt_inc ();
201
202	return *this;	548	return *this;
203	}	549	}
204		550
205	const refptr<T> &operator =(const refptr<T> o)	551	const refptr<T> &operator =(const refptr<T> &o)
206	{	552	{
207	*this = o.p;	553	*this = o.p;
208	return *this;	554	return *this;
209	}	555	}
210		556
211	T &operator * () const { return *p; }	557	T &operator * () const { return *p; }
212	T *operator ->() const { return p; }	558	T *operator ->() const { return p; }
213		559
214	operator T *() const { return p; }	560	operator T *() const { return p; }
215	};	561	};
216		562
217	typedef refptr<maptile> maptile_ptr;	563	typedef refptr<maptile> maptile_ptr;
218	typedef refptr<object> object_ptr;	564	typedef refptr<object> object_ptr;
219	typedef refptr<archetype> arch_ptr;	565	typedef refptr<archetype> arch_ptr;
220	typedef refptr<client> client_ptr;	566	typedef refptr<client> client_ptr;
221	typedef refptr<player> player_ptr;	567	typedef refptr<player> player_ptr;
222		568
		569	#define STRHSH_NULL 2166136261
		570
		571	static inline uint32_t
		572	strhsh (const char *s)
		573	{
		574	// use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
		575	// it is about twice as fast as the one-at-a-time one,
		576	// with good distribution.
		577	// FNV-1a is faster on many cpus because the multiplication
		578	// runs concurrently with the looping logic.
		579	uint32_t hash = STRHSH_NULL;
		580
		581	while (*s)
		582	hash = (hash ^ s++) 16777619U;
		583
		584	return hash;
		585	}
		586
		587	static inline uint32_t
		588	memhsh (const char *s, size_t len)
		589	{
		590	uint32_t hash = STRHSH_NULL;
		591
		592	while (len--)
		593	hash = (hash ^ s++) 16777619U;
		594
		595	return hash;
		596	}
		597
223	struct str_hash	598	struct str_hash
224	{	599	{
225	std::size_t operator ()(const char *s) const	600	std::size_t operator ()(const char *s) const
226	{	601	{
227	unsigned long hash = 0;
228
229	/* use the one-at-a-time hash function, which supposedly is
230	* better than the djb2-like one used by perl5.005, but
231	* certainly is better then the bug used here before.
232	* see http://burtleburtle.net/bob/hash/doobs.html
233	*/
234	while (*s)
235	{
236	hash += *s++;
237	hash += hash << 10;
238	hash ^= hash >> 6;
239	}
240
241	hash += hash << 3;
242	hash ^= hash >> 11;
243	hash += hash << 15;
244
245	return hash;	602	return strhsh (s);
		603	}
		604
		605	std::size_t operator ()(const shstr &s) const
		606	{
		607	return strhsh (s);
246	}	608	}
247	};	609	};
248		610
249	struct str_equal	611	struct str_equal
250	{	612	{
…		…
252	{	614	{
253	return !strcmp (a, b);	615	return !strcmp (a, b);
254	}	616	}
255	};	617	};
256		618
		619	// Mostly the same as std::vector, but insert/erase can reorder
		620	// the elements, making append(=insert)/remove O(1) instead of O(n).
		621	//
		622	// NOTE: only some forms of erase are available
257	template<class T>	623	template<class T>
258	struct unordered_vector : std::vector<T, slice_allocator<T> >	624	struct unordered_vector : std::vector<T, slice_allocator<T> >
259	{	625	{
260	typedef typename unordered_vector::iterator iterator;	626	typedef typename unordered_vector::iterator iterator;
261		627
…		…
271	{	637	{
272	erase ((unsigned int )(i - this->begin ()));	638	erase ((unsigned int )(i - this->begin ()));
273	}	639	}
274	};	640	};
275		641
276	template<class T, int T::* index>	642	// This container blends advantages of linked lists
		643	// (efficiency) with vectors (random access) by
		644	// by using an unordered vector and storing the vector
		645	// index inside the object.
		646	//
		647	// + memory-efficient on most 64 bit archs
		648	// + O(1) insert/remove
		649	// + free unique (but varying) id for inserted objects
		650	// + cache-friendly iteration
		651	// - only works for pointers to structs
		652	//
		653	// NOTE: only some forms of erase/insert are available
		654	typedef int object_vector_index;
		655
		656	template<class T, object_vector_index T::*indexmember>
277	struct object_vector : std::vector<T , slice_allocator<T > >	657	struct object_vector : std::vector<T , slice_allocator<T > >
278	{	658	{
		659	typedef typename object_vector::iterator iterator;
		660
		661	bool contains (const T *obj) const
		662	{
		663	return obj->*indexmember;
		664	}
		665
		666	iterator find (const T *obj)
		667	{
		668	return obj->*indexmember
		669	? this->begin () + obj->*indexmember - 1
		670	: this->end ();
		671	}
		672
		673	void push_back (T *obj)
		674	{
		675	std::vector<T , slice_allocator<T > >::push_back (obj);
		676	obj->*indexmember = this->size ();
		677	}
		678
279	void insert (T *obj)	679	void insert (T *obj)
280	{	680	{
281	assert (!(obj->*index));
282	push_back (obj);	681	push_back (obj);
283	obj->*index = this->size ();
284	}	682	}
285		683
286	void insert (T &obj)	684	void insert (T &obj)
287	{	685	{
288	insert (&obj);	686	insert (&obj);
289	}	687	}
290		688
291	void erase (T *obj)	689	void erase (T *obj)
292	{	690	{
293	assert (obj->*index);
294	int pos = obj->*index;	691	unsigned int pos = obj->*indexmember;
295	obj->*index = 0;	692	obj->*indexmember = 0;
296		693
297	if (pos < this->size ())	694	if (pos < this->size ())
298	{	695	{
299	(this)[pos - 1] = (this)[this->size () - 1];	696	(this)[pos - 1] = (this)[this->size () - 1];
300	(this)[pos - 1]->index = pos;	697	(this)[pos - 1]->indexmember = pos;
301	}	698	}
302		699
303	this->pop_back ();	700	this->pop_back ();
304	}	701	}
305		702
306	void erase (T &obj)	703	void erase (T &obj)
307	{	704	{
308	errase (&obj);	705	erase (&obj);
309	}	706	}
310	};	707	};
311
312	template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
313	template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
314	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; }
315
316	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
317		708
318	// basically does what strncpy should do, but appends "..." to strings exceeding length	709	// basically does what strncpy should do, but appends "..." to strings exceeding length
		710	// returns the number of bytes actually used (including \0)
319	void assign (char dst, const char src, int maxlen);	711	int assign (char dst, const char src, int maxsize);
320		712
321	// type-safe version of assign	713	// type-safe version of assign
322	template<int N>	714	template<int N>
323	inline void assign (char (&dst)[N], const char *src)	715	inline int assign (char (&dst)[N], const char *src)
324	{	716	{
325	assign ((char *)&dst, src, N);	717	return assign ((char *)&dst, src, N);
326	}	718	}
327		719
328	typedef double tstamp;	720	typedef double tstamp;
329		721
330	// return current time as timestampe	722	// return current time as timestamp
331	tstamp now ();	723	tstamp now ();
332		724
333	int similar_direction (int a, int b);	725	int similar_direction (int a, int b);
334		726
		727	// like v?sprintf, but returns a "static" buffer
		728	char vformat (const char format, va_list ap);
		729	char format (const char format, ...) attribute ((format (printf, 1, 2)));
		730
		731	// safety-check player input which will become object->msg
		732	bool msg_is_safe (const char *msg);
		733
		734	/////////////////////////////////////////////////////////////////////////////
		735	// threads, very very thin wrappers around pthreads
		736
		737	struct thread
		738	{
		739	pthread_t id;
		740
		741	void start (void (start_routine)(void ), void arg = 0);
		742
		743	void cancel ()
		744	{
		745	pthread_cancel (id);
		746	}
		747
		748	void *join ()
		749	{
		750	void *ret;
		751
		752	if (pthread_join (id, &ret))
		753	cleanup ("pthread_join failed", 1);
		754
		755	return ret;
		756	}
		757	};
		758
		759	// note that mutexes are not classes
		760	typedef pthread_mutex_t smutex;
		761
		762	#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
		763	#define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
		764	#else
		765	#define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
335	#endif	766	#endif
336		767
		768	#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
		769	#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
		770	#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
		771
		772	typedef pthread_cond_t scond;
		773
		774	#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
		775	#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
		776	#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
		777	#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
		778
		779	#endif
		780

Diff Legend

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

Comparing deliantra/server/include/util.h (file contents): Revision 1.30 by root, Mon Jan 15 01:50:33 2007 UTC vs. Revision 1.100 by root, Thu Apr 22 13:01:58 2010 UTC

Diff Legend

Comparing deliantra/server/include/util.h (file contents):
Revision 1.30 by root, Mon Jan 15 01:50:33 2007 UTC vs.
Revision 1.100 by root, Thu Apr 22 13:01:58 2010 UTC