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

Comparing deliantra/server/include/util.h (file contents):
Revision 1.36 by root, Thu Jan 25 03:54:45 2007 UTC vs.
Revision 1.72 by root, Wed Apr 30 16:26:28 2008 UTC

…		…
		1	/*
		2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
		3	*
		4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
		5	*
		6	* Deliantra is free software: you can redistribute it and/or modify
		7	* it under the terms of the GNU General Public License as published by
		8	* the Free Software Foundation, either version 3 of the License, or
		9	* (at your 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 GNU General Public License
		17	* along with this program. If not, see <http://www.gnu.org/licenses/>.
		18	*
		19	* The authors can be reached via e-mail to <support@deliantra.net>
		20	*/
		21
1	#ifndef UTIL_H__	22	#ifndef UTIL_H__
2	#define UTIL_H__	23	#define UTIL_H__
3		24
4	//#define PREFER_MALLOC	25	#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
		26	#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
		27	#define PREFER_MALLOC 0 // use malloc and not the slice allocator
5		28
6	#if __GNUC__ >= 3	29	#if __GNUC__ >= 3
7	# define is_constant(c) __builtin_constant_p (c)	30	# define is_constant(c) __builtin_constant_p (c)
		31	# define expect(expr,value) __builtin_expect ((expr),(value))
		32	# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
8	#else	33	#else
9	# define is_constant(c) 0	34	# define is_constant(c) 0
		35	# define expect(expr,value) (expr)
		36	# define prefetch(addr,rw,locality)
10	#endif	37	#endif
		38
		39	#if __GNUC__ < 4 \|\| (__GNUC__ == 4 \|\| __GNUC_MINOR__ < 4)
		40	# define decltype(x) typeof(x)
		41	#endif
		42
		43	// put into ifs if you are very sure that the expression
		44	// is mostly true or mosty false. note that these return
		45	// booleans, not the expression.
		46	#define expect_false(expr) expect ((expr) != 0, 0)
		47	#define expect_true(expr) expect ((expr) != 0, 1)
		48
		49	#include <pthread.h>
11		50
12	#include <cstddef>	51	#include <cstddef>
13	#include <cmath>	52	#include <cmath>
14	#include <new>	53	#include <new>
15	#include <vector>	54	#include <vector>
17	#include <glib.h>	56	#include <glib.h>
18		57
19	#include <shstr.h>	58	#include <shstr.h>
20	#include <traits.h>	59	#include <traits.h>
21		60
		61	#if DEBUG_SALLOC
		62	# define g_slice_alloc0(s) debug_slice_alloc0(s)
		63	# define g_slice_alloc(s) debug_slice_alloc(s)
		64	# define g_slice_free1(s,p) debug_slice_free1(s,p)
		65	void *g_slice_alloc (unsigned long size);
		66	void *g_slice_alloc0 (unsigned long size);
		67	void g_slice_free1 (unsigned long size, void *ptr);
		68	#elif PREFER_MALLOC
		69	# define g_slice_alloc0(s) calloc (1, (s))
		70	# define g_slice_alloc(s) malloc ((s))
		71	# define g_slice_free1(s,p) free ((p))
		72	#endif
		73
22	// use a gcc extension for auto declarations until ISO C++ sanctifies them	74	// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
23	#define AUTODECL(var,expr) typeof(expr) var = (expr)	75	#define auto(var,expr) decltype(expr) var = (expr)
24		76
25	// very ugly macro that basicaly declares and initialises a variable	77	// very ugly macro that basicaly declares and initialises a variable
26	// that is in scope for the next statement only	78	// that is in scope for the next statement only
27	// works only for stuff that can be assigned 0 and converts to false	79	// works only for stuff that can be assigned 0 and converts to false
28	// (note: works great for pointers)	80	// (note: works great for pointers)
29	// most ugly macro I ever wrote	81	// most ugly macro I ever wrote
30	#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)	82	#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
31		83
32	// in range including end	84	// in range including end
33	#define IN_RANGE_INC(val,beg,end) \	85	#define IN_RANGE_INC(val,beg,end) \
34	((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))	86	((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
35		87
36	// in range excluding end	88	// in range excluding end
37	#define IN_RANGE_EXC(val,beg,end) \	89	#define IN_RANGE_EXC(val,beg,end) \
38	((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))	90	((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
39		91
		92	void cleanup (const char *cause, bool make_core = false);
40	void fork_abort (const char *msg);	93	void fork_abort (const char *msg);
41		94
42	// rationale for using (U) not (T) is to reduce signed/unsigned issues,	95	// rationale for using (U) not (T) is to reduce signed/unsigned issues,
43	// as a is often a constant while b is the variable. it is still a bug, though.	96	// as a is often a constant while b is the variable. it is still a bug, though.
44	template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }	97	template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
45	template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }	98	template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
46	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; }	99	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; }
47		100
48	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }	101	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
		102
		103	template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
		104	template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
		105
		106	template<typename T>
		107	static inline T
		108	lerp (T val, T min_in, T max_in, T min_out, T max_out)
		109	{
		110	return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out;
		111	}
		112
		113	// lots of stuff taken from FXT
		114
		115	/* Rotate right. This is used in various places for checksumming */
		116	//TODO: that sucks, use a better checksum algo
		117	static inline uint32_t
		118	rotate_right (uint32_t c, uint32_t count = 1)
		119	{
		120	return (c << (32 - count)) \| (c >> count);
		121	}
		122
		123	static inline uint32_t
		124	rotate_left (uint32_t c, uint32_t count = 1)
		125	{
		126	return (c >> (32 - count)) \| (c << count);
		127	}
		128
		129	// Return abs(a-b)
		130	// Both a and b must not have the most significant bit set
		131	static inline uint32_t
		132	upos_abs_diff (uint32_t a, uint32_t b)
		133	{
		134	long d1 = b - a;
		135	long d2 = (d1 & (d1 >> 31)) << 1;
		136
		137	return d1 - d2; // == (b - d) - (a + d);
		138	}
		139
		140	// Both a and b must not have the most significant bit set
		141	static inline uint32_t
		142	upos_min (uint32_t a, uint32_t b)
		143	{
		144	int32_t d = b - a;
		145	d &= d >> 31;
		146	return a + d;
		147	}
		148
		149	// Both a and b must not have the most significant bit set
		150	static inline uint32_t
		151	upos_max (uint32_t a, uint32_t b)
		152	{
		153	int32_t d = b - a;
		154	d &= d >> 31;
		155	return b - d;
		156	}
49		157
50	// this is much faster than crossfires original algorithm	158	// this is much faster than crossfires original algorithm
51	// on modern cpus	159	// on modern cpus
52	inline int	160	inline int
53	isqrt (int n)	161	isqrt (int n)
…		…
85	absdir (int d)	193	absdir (int d)
86	{	194	{
87	return ((d - 1) & 7) + 1;	195	return ((d - 1) & 7) + 1;
88	}	196	}
89		197
90	// makes dynamically allocated objects zero-initialised	198	extern ssize_t slice_alloc; // statistics
91	struct zero_initialised
92	{
93	void operator new (size_t s, void p)
94	{
95	memset (p, 0, s);
96	return p;
97	}
98
99	void *operator new (size_t s)
100	{
101	return g_slice_alloc0 (s);
102	}
103
104	void *operator new[] (size_t s)
105	{
106	return g_slice_alloc0 (s);
107	}
108
109	void operator delete (void *p, size_t s)
110	{
111	g_slice_free1 (s, p);
112	}
113
114	void operator delete[] (void *p, size_t s)
115	{
116	g_slice_free1 (s, p);
117	}
118	};
119		199
120	void *salloc_ (int n) throw (std::bad_alloc);	200	void *salloc_ (int n) throw (std::bad_alloc);
121	void salloc_ (int n, void src) throw (std::bad_alloc);	201	void salloc_ (int n, void src) throw (std::bad_alloc);
122		202
123	// strictly the same as g_slice_alloc, but never returns 0	203	// strictly the same as g_slice_alloc, but never returns 0
…		…
135		215
136	// for symmetry	216	// for symmetry
137	template<typename T>	217	template<typename T>
138	inline void sfree (T *ptr, int n = 1) throw ()	218	inline void sfree (T *ptr, int n = 1) throw ()
139	{	219	{
140	#ifdef PREFER_MALLOC	220	if (expect_true (ptr))
141	free (ptr);	221	{
142	#else	222	slice_alloc -= n * sizeof (T);
		223	if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
143	g_slice_free1 (n * sizeof (T), (void *)ptr);	224	g_slice_free1 (n * sizeof (T), (void *)ptr);
144	#endif	225	assert (slice_alloc >= 0);//D
		226	}
145	}	227	}
		228
		229	// nulls the pointer
		230	template<typename T>
		231	inline void sfree0 (T *&ptr, int n = 1) throw ()
		232	{
		233	sfree<T> (ptr, n);
		234	ptr = 0;
		235	}
		236
		237	// makes dynamically allocated objects zero-initialised
		238	struct zero_initialised
		239	{
		240	void operator new (size_t s, void p)
		241	{
		242	memset (p, 0, s);
		243	return p;
		244	}
		245
		246	void *operator new (size_t s)
		247	{
		248	return salloc0<char> (s);
		249	}
		250
		251	void *operator new[] (size_t s)
		252	{
		253	return salloc0<char> (s);
		254	}
		255
		256	void operator delete (void *p, size_t s)
		257	{
		258	sfree ((char *)p, s);
		259	}
		260
		261	void operator delete[] (void *p, size_t s)
		262	{
		263	sfree ((char *)p, s);
		264	}
		265	};
146		266
147	// a STL-compatible allocator that uses g_slice	267	// a STL-compatible allocator that uses g_slice
148	// boy, this is verbose	268	// boy, this is verbose
149	template<typename Tp>	269	template<typename Tp>
150	struct slice_allocator	270	struct slice_allocator
…		…
162	{	282	{
163	typedef slice_allocator<U> other;	283	typedef slice_allocator<U> other;
164	};	284	};
165		285
166	slice_allocator () throw () { }	286	slice_allocator () throw () { }
167	slice_allocator (const slice_allocator &o) throw () { }	287	slice_allocator (const slice_allocator &) throw () { }
168	template<typename Tp2>	288	template<typename Tp2>
169	slice_allocator (const slice_allocator<Tp2> &) throw () { }	289	slice_allocator (const slice_allocator<Tp2> &) throw () { }
170		290
171	~slice_allocator () { }	291	~slice_allocator () { }
172		292
…		…
181	void deallocate (pointer p, size_type n)	301	void deallocate (pointer p, size_type n)
182	{	302	{
183	sfree<Tp> (p, n);	303	sfree<Tp> (p, n);
184	}	304	}
185		305
186	size_type max_size ()const throw ()	306	size_type max_size () const throw ()
187	{	307	{
188	return size_t (-1) / sizeof (Tp);	308	return size_t (-1) / sizeof (Tp);
189	}	309	}
190		310
191	void construct (pointer p, const Tp &val)	311	void construct (pointer p, const Tp &val)
…		…
217		337
218	void seed (uint32_t seed);	338	void seed (uint32_t seed);
219	uint32_t next ();	339	uint32_t next ();
220		340
221	// uniform distribution	341	// uniform distribution
222	uint32_t operator ()(uint32_t r_max)	342	uint32_t operator ()(uint32_t num)
223	{	343	{
224	return is_constant (r_max)	344	return is_constant (num)
225	? this->next () % r_max	345	? (next () * (uint64_t)num) >> 32U
226	: get_range (r_max);	346	: get_range (num);
227	}	347	}
228		348
229	// return a number within (min .. max)	349	// return a number within (min .. max)
230	int operator () (int r_min, int r_max)	350	int operator () (int r_min, int r_max)
231	{	351	{
232	return is_constant (r_min) && is_constant (r_max)	352	return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
233	? r_min + (*this) (max (r_max - r_min + 1, 1))	353	? r_min + operator ()(r_max - r_min + 1)
234	: get_range (r_min, r_max);	354	: get_range (r_min, r_max);
235	}	355	}
236		356
237	double operator ()()	357	double operator ()()
238	{	358	{
…		…
246		366
247	typedef tausworthe_random_generator rand_gen;	367	typedef tausworthe_random_generator rand_gen;
248		368
249	extern rand_gen rndm;	369	extern rand_gen rndm;
250		370
		371	INTERFACE_CLASS (attachable)
		372	struct refcnt_base
		373	{
		374	typedef int refcnt_t;
		375	mutable refcnt_t ACC (RW, refcnt);
		376
		377	MTH void refcnt_inc () const { ++refcnt; }
		378	MTH void refcnt_dec () const { --refcnt; }
		379
		380	refcnt_base () : refcnt (0) { }
		381	};
		382
		383	// to avoid branches with more advanced compilers
		384	extern refcnt_base::refcnt_t refcnt_dummy;
		385
251	template<class T>	386	template<class T>
252	struct refptr	387	struct refptr
253	{	388	{
		389	// p if not null
		390	refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
		391
		392	void refcnt_dec ()
		393	{
		394	if (!is_constant (p))
		395	--*refcnt_ref ();
		396	else if (p)
		397	--p->refcnt;
		398	}
		399
		400	void refcnt_inc ()
		401	{
		402	if (!is_constant (p))
		403	++*refcnt_ref ();
		404	else if (p)
		405	++p->refcnt;
		406	}
		407
254	T *p;	408	T *p;
255		409
256	refptr () : p(0) { }	410	refptr () : p(0) { }
257	refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); }	411	refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
258	refptr (T *p) : p(p) { if (p) p->refcnt_inc (); }	412	refptr (T *p) : p(p) { refcnt_inc (); }
259	~refptr () { if (p) p->refcnt_dec (); }	413	~refptr () { refcnt_dec (); }
260		414
261	const refptr<T> &operator =(T *o)	415	const refptr<T> &operator =(T *o)
262	{	416	{
		417	// if decrementing ever destroys we need to reverse the order here
263	if (p) p->refcnt_dec ();	418	refcnt_dec ();
264	p = o;	419	p = o;
265	if (p) p->refcnt_inc ();	420	refcnt_inc ();
266
267	return *this;	421	return *this;
268	}	422	}
269		423
270	const refptr<T> &operator =(const refptr<T> o)	424	const refptr<T> &operator =(const refptr<T> &o)
271	{	425	{
272	*this = o.p;	426	*this = o.p;
273	return *this;	427	return *this;
274	}	428	}
275		429
276	T &operator * () const { return *p; }	430	T &operator * () const { return *p; }
277	T *operator ->() const { return p; }	431	T *operator ->() const { return p; }
278		432
279	operator T *() const { return p; }	433	operator T *() const { return p; }
280	};	434	};
281		435
282	typedef refptr<maptile> maptile_ptr;	436	typedef refptr<maptile> maptile_ptr;
…		…
317	{	471	{
318	return !strcmp (a, b);	472	return !strcmp (a, b);
319	}	473	}
320	};	474	};
321		475
		476	// Mostly the same as std::vector, but insert/erase can reorder
		477	// the elements, making append(=insert)/remove O(1) instead of O(n).
		478	//
		479	// NOTE: only some forms of erase are available
322	template<class T>	480	template<class T>
323	struct unordered_vector : std::vector<T, slice_allocator<T> >	481	struct unordered_vector : std::vector<T, slice_allocator<T> >
324	{	482	{
325	typedef typename unordered_vector::iterator iterator;	483	typedef typename unordered_vector::iterator iterator;
326		484
…		…
336	{	494	{
337	erase ((unsigned int )(i - this->begin ()));	495	erase ((unsigned int )(i - this->begin ()));
338	}	496	}
339	};	497	};
340		498
341	template<class T, int T::* index>	499	// This container blends advantages of linked lists
		500	// (efficiency) with vectors (random access) by
		501	// by using an unordered vector and storing the vector
		502	// index inside the object.
		503	//
		504	// + memory-efficient on most 64 bit archs
		505	// + O(1) insert/remove
		506	// + free unique (but varying) id for inserted objects
		507	// + cache-friendly iteration
		508	// - only works for pointers to structs
		509	//
		510	// NOTE: only some forms of erase/insert are available
		511	typedef int object_vector_index;
		512
		513	template<class T, object_vector_index T::*indexmember>
342	struct object_vector : std::vector<T , slice_allocator<T > >	514	struct object_vector : std::vector<T , slice_allocator<T > >
343	{	515	{
		516	typedef typename object_vector::iterator iterator;
		517
		518	bool contains (const T *obj) const
		519	{
		520	return obj->*indexmember;
		521	}
		522
		523	iterator find (const T *obj)
		524	{
		525	return obj->*indexmember
		526	? this->begin () + obj->*indexmember - 1
		527	: this->end ();
		528	}
		529
		530	void push_back (T *obj)
		531	{
		532	std::vector<T , slice_allocator<T > >::push_back (obj);
		533	obj->*indexmember = this->size ();
		534	}
		535
344	void insert (T *obj)	536	void insert (T *obj)
345	{	537	{
346	assert (!(obj->*index));
347	push_back (obj);	538	push_back (obj);
348	obj->*index = this->size ();
349	}	539	}
350		540
351	void insert (T &obj)	541	void insert (T &obj)
352	{	542	{
353	insert (&obj);	543	insert (&obj);
354	}	544	}
355		545
356	void erase (T *obj)	546	void erase (T *obj)
357	{	547	{
358	assert (obj->*index);
359	int pos = obj->*index;	548	unsigned int pos = obj->*indexmember;
360	obj->*index = 0;	549	obj->*indexmember = 0;
361		550
362	if (pos < this->size ())	551	if (pos < this->size ())
363	{	552	{
364	(this)[pos - 1] = (this)[this->size () - 1];	553	(this)[pos - 1] = (this)[this->size () - 1];
365	(this)[pos - 1]->index = pos;	554	(this)[pos - 1]->indexmember = pos;
366	}	555	}
367		556
368	this->pop_back ();	557	this->pop_back ();
369	}	558	}
370		559
371	void erase (T &obj)	560	void erase (T &obj)
372	{	561	{
373	errase (&obj);	562	erase (&obj);
374	}	563	}
375	};	564	};
376		565
377	// basically does what strncpy should do, but appends "..." to strings exceeding length	566	// basically does what strncpy should do, but appends "..." to strings exceeding length
378	void assign (char dst, const char src, int maxlen);	567	void assign (char dst, const char src, int maxlen);
…		…
384	assign ((char *)&dst, src, N);	573	assign ((char *)&dst, src, N);
385	}	574	}
386		575
387	typedef double tstamp;	576	typedef double tstamp;
388		577
389	// return current time as timestampe	578	// return current time as timestamp
390	tstamp now ();	579	tstamp now ();
391		580
392	int similar_direction (int a, int b);	581	int similar_direction (int a, int b);
393		582
		583	// like sprintf, but returns a "static" buffer
		584	const char format (const char format, ...);
		585
		586	/////////////////////////////////////////////////////////////////////////////
		587	// threads, very very thin wrappers around pthreads
		588
		589	struct thread
		590	{
		591	pthread_t id;
		592
		593	void start (void (start_routine)(void ), void arg = 0);
		594
		595	void cancel ()
		596	{
		597	pthread_cancel (id);
		598	}
		599
		600	void *join ()
		601	{
		602	void *ret;
		603
		604	if (pthread_join (id, &ret))
		605	cleanup ("pthread_join failed", 1);
		606
		607	return ret;
		608	}
		609	};
		610
		611	// note that mutexes are not classes
		612	typedef pthread_mutex_t smutex;
		613
		614	#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
		615	#define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
		616	#else
		617	#define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
394	#endif	618	#endif
395		619
		620	#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
		621	#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
		622	#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
		623
		624	typedef pthread_cond_t scond;
		625
		626	#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
		627	#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
		628	#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
		629	#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
		630
		631	#endif
		632

Diff Legend

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

Comparing deliantra/server/include/util.h (file contents): Revision 1.36 by root, Thu Jan 25 03:54:45 2007 UTC vs. Revision 1.72 by root, Wed Apr 30 16:26:28 2008 UTC

Diff Legend

Comparing deliantra/server/include/util.h (file contents):
Revision 1.36 by root, Thu Jan 25 03:54:45 2007 UTC vs.
Revision 1.72 by root, Wed Apr 30 16:26:28 2008 UTC