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

Comparing deliantra/server/include/util.h (file contents):
Revision 1.66 by root, Wed Apr 2 11:13:55 2008 UTC vs.
Revision 1.79 by root, Fri Dec 19 22:47:29 2008 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 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
7	* it under the terms of the GNU General Public License as published by	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	8	* the Free Software Foundation, either version 3 of the License, or
9	* (at your option) any later version.	9	* (at your option) any later version.
20	*/	20	*/
21		21
22	#ifndef UTIL_H__	22	#ifndef UTIL_H__
23	#define UTIL_H__	23	#define UTIL_H__
24		24
25	#define DEBUG_SALLOC 0	25	#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
26	#define PREFER_MALLOC 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
27		28
28	#if __GNUC__ >= 3	29	#if __GNUC__ >= 3
29	# define is_constant(c) __builtin_constant_p (c)	30	# define is_constant(c) __builtin_constant_p (c)
30	# define expect(expr,value) __builtin_expect ((expr),(value))	31	# define expect(expr,value) __builtin_expect ((expr),(value))
31	# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)	32	# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
…		…
62	# define g_slice_alloc(s) debug_slice_alloc(s)	63	# define g_slice_alloc(s) debug_slice_alloc(s)
63	# define g_slice_free1(s,p) debug_slice_free1(s,p)	64	# define g_slice_free1(s,p) debug_slice_free1(s,p)
64	void *g_slice_alloc (unsigned long size);	65	void *g_slice_alloc (unsigned long size);
65	void *g_slice_alloc0 (unsigned long size);	66	void *g_slice_alloc0 (unsigned long size);
66	void g_slice_free1 (unsigned long size, void *ptr);	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))
67	#endif	72	#endif
68		73
69	// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)	74	// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
70	#define auto(var,expr) decltype(expr) var = (expr)	75	#define auto(var,expr) decltype(expr) var = (expr)
71		76
…		…
91	// 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.
92	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; }
93	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; }
94	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; }
95		100
		101	template<typename T> static inline void min_it (T &v, T m) { v = min (v, m); }
		102	template<typename T> static inline void max_it (T &v, T m) { v = max (v, m); }
		103	template<typename T> static inline void clamp_it (T &v, T a, T b) { v = clamp (v, a, b); }
		104
96	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }	105	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
97		106
98	template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }	107	template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
99	template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }	108	template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
100		109
		110	// sign returns -1 or +1
		111	template<typename T>
		112	static inline T sign (T v) { return v < 0 ? -1 : +1; }
		113	// relies on 2c representation
		114	template<>
		115	inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); }
		116
		117	// sign0 returns -1, 0 or +1
		118	template<typename T>
		119	static inline T sign0 (T v) { return v ? sign (v) : 0; }
		120
		121	// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
		122	template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; }
		123	// div, round-up
		124	template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; }
		125	// div, round-down
		126	template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; }
		127
101	template<typename T>	128	template<typename T>
102	static inline T	129	static inline T
103	lerp (T val, T min_in, T max_in, T min_out, T max_out)	130	lerp (T val, T min_in, T max_in, T min_out, T max_out)
104	{	131	{
105	return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out;	132	return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
		133	}
		134
		135	// lerp, round-down
		136	template<typename T>
		137	static inline T
		138	lerp_rd (T val, T min_in, T max_in, T min_out, T max_out)
		139	{
		140	return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
		141	}
		142
		143	// lerp, round-up
		144	template<typename T>
		145	static inline T
		146	lerp_ru (T val, T min_in, T max_in, T min_out, T max_out)
		147	{
		148	return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
106	}	149	}
107		150
108	// lots of stuff taken from FXT	151	// lots of stuff taken from FXT
109		152
110	/* Rotate right. This is used in various places for checksumming */	153	/* Rotate right. This is used in various places for checksumming */
…		…
188	absdir (int d)	231	absdir (int d)
189	{	232	{
190	return ((d - 1) & 7) + 1;	233	return ((d - 1) & 7) + 1;
191	}	234	}
192		235
193	extern size_t slice_alloc; // statistics	236	extern ssize_t slice_alloc; // statistics
		237
		238	void *salloc_ (int n) throw (std::bad_alloc);
		239	void salloc_ (int n, void src) throw (std::bad_alloc);
		240
		241	// strictly the same as g_slice_alloc, but never returns 0
		242	template<typename T>
		243	inline T salloc (int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T)); }
		244
		245	// also copies src into the new area, like "memdup"
		246	// if src is 0, clears the memory
		247	template<typename T>
		248	inline T salloc (int n, T src) throw (std::bad_alloc) { return (T )salloc_ (n sizeof (T), (void *)src); }
		249
		250	// clears the memory
		251	template<typename T>
		252	inline T salloc0(int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T), 0); }
		253
		254	// for symmetry
		255	template<typename T>
		256	inline void sfree (T *ptr, int n = 1) throw ()
		257	{
		258	if (expect_true (ptr))
		259	{
		260	slice_alloc -= n * sizeof (T);
		261	if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
		262	g_slice_free1 (n * sizeof (T), (void *)ptr);
		263	assert (slice_alloc >= 0);//D
		264	}
		265	}
		266
		267	// nulls the pointer
		268	template<typename T>
		269	inline void sfree0 (T *&ptr, int n = 1) throw ()
		270	{
		271	sfree<T> (ptr, n);
		272	ptr = 0;
		273	}
194		274
195	// makes dynamically allocated objects zero-initialised	275	// makes dynamically allocated objects zero-initialised
196	struct zero_initialised	276	struct zero_initialised
197	{	277	{
198	void operator new (size_t s, void p)	278	void operator new (size_t s, void p)
…		…
201	return p;	281	return p;
202	}	282	}
203		283
204	void *operator new (size_t s)	284	void *operator new (size_t s)
205	{	285	{
206	slice_alloc += s;
207	return g_slice_alloc0 (s);	286	return salloc0<char> (s);
208	}	287	}
209		288
210	void *operator new[] (size_t s)	289	void *operator new[] (size_t s)
211	{	290	{
212	slice_alloc += s;
213	return g_slice_alloc0 (s);	291	return salloc0<char> (s);
214	}	292	}
215		293
216	void operator delete (void *p, size_t s)	294	void operator delete (void *p, size_t s)
217	{	295	{
218	slice_alloc -= s;	296	sfree ((char *)p, s);
219	g_slice_free1 (s, p);
220	}	297	}
221		298
222	void operator delete[] (void *p, size_t s)	299	void operator delete[] (void *p, size_t s)
223	{	300	{
224	slice_alloc -= s;	301	sfree ((char *)p, s);
225	g_slice_free1 (s, p);
226	}	302	}
227	};	303	};
228		304
229	void *salloc_ (int n) throw (std::bad_alloc);	305	// makes dynamically allocated objects zero-initialised
230	void salloc_ (int n, void src) throw (std::bad_alloc);	306	struct slice_allocated
231
232	// strictly the same as g_slice_alloc, but never returns 0
233	template<typename T>
234	inline T salloc (int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T)); }
235
236	// also copies src into the new area, like "memdup"
237	// if src is 0, clears the memory
238	template<typename T>
239	inline T salloc (int n, T src) throw (std::bad_alloc) { return (T )salloc_ (n sizeof (T), (void *)src); }
240
241	// clears the memory
242	template<typename T>
243	inline T salloc0(int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T), 0); }
244
245	// for symmetry
246	template<typename T>
247	inline void sfree (T *ptr, int n = 1) throw ()
248	{	307	{
249	#if PREFER_MALLOC	308	void operator new (size_t s, void p)
250	free (ptr);	309	{
251	#else	310	return p;
252	slice_alloc -= n * sizeof (T);	311	}
253	g_slice_free1 (n * sizeof (T), (void *)ptr);	312
254	#endif	313	void *operator new (size_t s)
255	}	314	{
		315	return salloc<char> (s);
		316	}
		317
		318	void *operator new[] (size_t s)
		319	{
		320	return salloc<char> (s);
		321	}
		322
		323	void operator delete (void *p, size_t s)
		324	{
		325	sfree ((char *)p, s);
		326	}
		327
		328	void operator delete[] (void *p, size_t s)
		329	{
		330	sfree ((char *)p, s);
		331	}
		332	};
256		333
257	// a STL-compatible allocator that uses g_slice	334	// a STL-compatible allocator that uses g_slice
258	// boy, this is verbose	335	// boy, this is verbose
259	template<typename Tp>	336	template<typename Tp>
260	struct slice_allocator	337	struct slice_allocator
…		…
326	}	403	}
327		404
328	void seed (uint32_t seed);	405	void seed (uint32_t seed);
329	uint32_t next ();	406	uint32_t next ();
330		407
331	// uniform distribution	408	// uniform distribution, 0 .. max (0, num - 1)
332	uint32_t operator ()(uint32_t num)	409	uint32_t operator ()(uint32_t num)
333	{	410	{
334	return is_constant (num)	411	return is_constant (num)
335	? (next () * (uint64_t)num) >> 32U	412	? (next () * (uint64_t)num) >> 32U
336	: get_range (num);	413	: get_range (num);
…		…
354	int get_range (int r_min, int r_max);	431	int get_range (int r_min, int r_max);
355	};	432	};
356		433
357	typedef tausworthe_random_generator rand_gen;	434	typedef tausworthe_random_generator rand_gen;
358		435
359	extern rand_gen rndm;	436	extern rand_gen rndm, rmg_rndm;
360		437
361	INTERFACE_CLASS (attachable)	438	INTERFACE_CLASS (attachable)
362	struct refcnt_base	439	struct refcnt_base
363	{	440	{
364	typedef int refcnt_t;	441	typedef int refcnt_t;
…		…
606	#else	683	#else
607	#define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER	684	#define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
608	#endif	685	#endif
609		686
610	#define SMUTEX(name) smutex name = SMUTEX_INITIALISER	687	#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
611	#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))	688	#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
612	#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))	689	#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
613		690
		691	typedef pthread_cond_t scond;
		692
		693	#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
		694	#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
		695	#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
		696	#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
		697
614	#endif	698	#endif
615		699

Diff Legend

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

Comparing deliantra/server/include/util.h (file contents): Revision 1.66 by root, Wed Apr 2 11:13:55 2008 UTC vs. Revision 1.79 by root, Fri Dec 19 22:47:29 2008 UTC

Diff Legend

Comparing deliantra/server/include/util.h (file contents):
Revision 1.66 by root, Wed Apr 2 11:13:55 2008 UTC vs.
Revision 1.79 by root, Fri Dec 19 22:47:29 2008 UTC