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

Comparing deliantra/server/include/util.h (file contents):
Revision 1.27 by root, Mon Jan 15 00:40:49 2007 UTC vs.
Revision 1.44 by root, Fri May 11 08:00:00 2007 UTC

…		…
1	#ifndef UTIL_H__	1	#ifndef UTIL_H__
2	#define UTIL_H__	2	#define UTIL_H__
		3
		4	//#define PREFER_MALLOC
3		5
4	#if __GNUC__ >= 3	6	#if __GNUC__ >= 3
5	# define is_constant(c) __builtin_constant_p (c)	7	# define is_constant(c) __builtin_constant_p (c)
6	#else	8	#else
7	# define is_constant(c) 0	9	# define is_constant(c) 0
8	#endif	10	#endif
9		11
10	#include <cstddef>	12	#include <cstddef>
		13	#include <cmath>
11	#include <new>	14	#include <new>
12	#include <vector>	15	#include <vector>
13		16
14	#include <glib.h>	17	#include <glib.h>
15		18
16	#include <shstr.h>	19	#include <shstr.h>
17	#include <traits.h>	20	#include <traits.h>
18		21
19	// use a gcc extension for auto declarations until ISO C++ sanctifies them	22	// use a gcc extension for auto declarations until ISO C++ sanctifies them
20	#define AUTODECL(var,expr) typeof(expr) var = (expr)	23	#define auto(var,expr) typeof(expr) var = (expr)
21		24
22	// very ugly macro that basicaly declares and initialises a variable	25	// very ugly macro that basicaly declares and initialises a variable
23	// that is in scope for the next statement only	26	// that is in scope for the next statement only
24	// works only for stuff that can be assigned 0 and converts to false	27	// works only for stuff that can be assigned 0 and converts to false
25	// (note: works great for pointers)	28	// (note: works great for pointers)
32		35
33	// in range excluding end	36	// in range excluding end
34	#define IN_RANGE_EXC(val,beg,end) \	37	#define IN_RANGE_EXC(val,beg,end) \
35	((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))	38	((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
36		39
		40	void fork_abort (const char *msg);
		41
		42	// 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.
		44	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; }
		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; }
		47
		48	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
		49
		50	template<typename T>
		51	static inline T
		52	lerp (T val, T min_in, T max_in, T min_out, T max_out)
		53	{
		54	return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out;
		55	}
		56
		57	// lots of stuff taken from FXT
		58
		59	/* Rotate right. This is used in various places for checksumming */
		60	//TODO: that sucks, use a better checksum algo
		61	static inline uint32_t
		62	rotate_right (uint32_t c, uint32_t count = 1)
		63	{
		64	return (c << (32 - count)) \| (c >> count);
		65	}
		66
		67	static inline uint32_t
		68	rotate_left (uint32_t c, uint32_t count = 1)
		69	{
		70	return (c >> (32 - count)) \| (c << count);
		71	}
		72
		73	// Return abs(a-b)
		74	// Both a and b must not have the most significant bit set
		75	static inline uint32_t
		76	upos_abs_diff (uint32_t a, uint32_t b)
		77	{
		78	long d1 = b - a;
		79	long d2 = (d1 & (d1 >> 31)) << 1;
		80
		81	return d1 - d2; // == (b - d) - (a + d);
		82	}
		83
		84	// Both a and b must not have the most significant bit set
		85	static inline uint32_t
		86	upos_min (uint32_t a, uint32_t b)
		87	{
		88	int32_t d = b - a;
		89	d &= d >> 31;
		90	return a + d;
		91	}
		92
		93	// Both a and b must not have the most significant bit set
		94	static inline uint32_t
		95	upos_max (uint32_t a, uint32_t b)
		96	{
		97	int32_t d = b - a;
		98	d &= d >> 31;
		99	return b - d;
		100	}
		101
		102	// this is much faster than crossfires original algorithm
		103	// on modern cpus
		104	inline int
		105	isqrt (int n)
		106	{
		107	return (int)sqrtf ((float)n);
		108	}
		109
		110	// this is only twice as fast as naive sqrtf (dxdy+dydy)
		111	#if 0
		112	// and has a max. error of 6 in the range -100..+100.
		113	#else
		114	// and has a max. error of 9 in the range -100..+100.
		115	#endif
		116	inline int
		117	idistance (int dx, int dy)
		118	{
		119	unsigned int dx_ = abs (dx);
		120	unsigned int dy_ = abs (dy);
		121
		122	#if 0
		123	return dx_ > dy_
		124	? (dx_ * 61685 + dy_ * 26870) >> 16
		125	: (dy_ * 61685 + dx_ * 26870) >> 16;
		126	#else
		127	return dx_ + dy_ - min (dx_, dy_) * 5 / 8;
		128	#endif
		129	}
		130
		131	/*
		132	* absdir(int): Returns a number between 1 and 8, which represent
		133	* the "absolute" direction of a number (it actually takes care of
		134	* "overflow" in previous calculations of a direction).
		135	*/
		136	inline int
		137	absdir (int d)
		138	{
		139	return ((d - 1) & 7) + 1;
		140	}
		141
37	// makes dynamically allocated objects zero-initialised	142	// makes dynamically allocated objects zero-initialised
38	struct zero_initialised	143	struct zero_initialised
39	{	144	{
40	void operator new (size_t s, void p)	145	void operator new (size_t s, void p)
41	{	146	{
…		…
82		187
83	// for symmetry	188	// for symmetry
84	template<typename T>	189	template<typename T>
85	inline void sfree (T *ptr, int n = 1) throw ()	190	inline void sfree (T *ptr, int n = 1) throw ()
86	{	191	{
		192	#ifdef PREFER_MALLOC
		193	free (ptr);
		194	#else
87	g_slice_free1 (n * sizeof (T), (void *)ptr);	195	g_slice_free1 (n * sizeof (T), (void *)ptr);
		196	#endif
88	}	197	}
89		198
90	// a STL-compatible allocator that uses g_slice	199	// a STL-compatible allocator that uses g_slice
91	// boy, this is verbose	200	// boy, this is verbose
92	template<typename Tp>	201	template<typename Tp>
…		…
139	void destroy (pointer p)	248	void destroy (pointer p)
140	{	249	{
141	p->~Tp ();	250	p->~Tp ();
142	}	251	}
143	};	252	};
		253
		254	// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
		255	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
		256	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
		257	struct tausworthe_random_generator
		258	{
		259	// generator
		260	uint32_t state [4];
		261
		262	void operator =(const tausworthe_random_generator &src)
		263	{
		264	state [0] = src.state [0];
		265	state [1] = src.state [1];
		266	state [2] = src.state [2];
		267	state [3] = src.state [3];
		268	}
		269
		270	void seed (uint32_t seed);
		271	uint32_t next ();
		272
		273	// uniform distribution
		274	uint32_t operator ()(uint32_t num)
		275	{
		276	return is_constant (num)
		277	? (next () * (uint64_t)num) >> 32U
		278	: get_range (num);
		279	}
		280
		281	// return a number within (min .. max)
		282	int operator () (int r_min, int r_max)
		283	{
		284	return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
		285	? r_min + operator ()(r_max - r_min + 1)
		286	: get_range (r_min, r_max);
		287	}
		288
		289	double operator ()()
		290	{
		291	return this->next () / (double)0xFFFFFFFFU;
		292	}
		293
		294	protected:
		295	uint32_t get_range (uint32_t r_max);
		296	int get_range (int r_min, int r_max);
		297	};
		298
		299	typedef tausworthe_random_generator rand_gen;
		300
		301	extern rand_gen rndm;
144		302
145	template<class T>	303	template<class T>
146	struct refptr	304	struct refptr
147	{	305	{
148	T *p;	306	T *p;
…		…
248	}	406	}
249		407
250	void erase (T *obj)	408	void erase (T *obj)
251	{	409	{
252	assert (obj->*index);	410	assert (obj->*index);
253	int pos = obj->*index;	411	unsigned int pos = obj->*index;
254	obj->*index = 0;	412	obj->*index = 0;
255		413
256	if (pos < this->size ())	414	if (pos < this->size ())
257	{	415	{
258	(this)[pos - 1] = (this)[this->size () - 1];	416	(this)[pos - 1] = (this)[this->size () - 1];
…		…
266	{	424	{
267	errase (&obj);	425	errase (&obj);
268	}	426	}
269	};	427	};
270		428
271	template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
272	template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
273	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; }
274
275	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
276
277	// basically does what strncpy should do, but appends "..." to strings exceeding length	429	// basically does what strncpy should do, but appends "..." to strings exceeding length
278	void assign (char dst, const char src, int maxlen);	430	void assign (char dst, const char src, int maxlen);
279		431
280	// type-safe version of assign	432	// type-safe version of assign
281	template<int N>	433	template<int N>
…		…
289	// return current time as timestampe	441	// return current time as timestampe
290	tstamp now ();	442	tstamp now ();
291		443
292	int similar_direction (int a, int b);	444	int similar_direction (int a, int b);
293		445
		446	// like printf, but returns a std::string
		447	const std::string format (const char *format, ...);
		448
294	#endif	449	#endif
295		450

Diff Legend

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

Comparing deliantra/server/include/util.h (file contents): Revision 1.27 by root, Mon Jan 15 00:40:49 2007 UTC vs. Revision 1.44 by root, Fri May 11 08:00:00 2007 UTC

Diff Legend

Comparing deliantra/server/include/util.h (file contents):
Revision 1.27 by root, Mon Jan 15 00:40:49 2007 UTC vs.
Revision 1.44 by root, Fri May 11 08:00:00 2007 UTC