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

Comparing deliantra/server/include/util.h (file contents):
Revision 1.17 by root, Sat Dec 16 03:08:26 2006 UTC vs.
Revision 1.36 by root, Thu Jan 25 03:54:45 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>
		14	#include <new>
		15	#include <vector>
11		16
12	#include <glib.h>	17	#include <glib.h>
		18
		19	#include <shstr.h>
		20	#include <traits.h>
13		21
14	// 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
15	#define AUTODECL(var,expr) typeof(expr) var = (expr)	23	#define AUTODECL(var,expr) typeof(expr) var = (expr)
16		24
		25	// very ugly macro that basicaly declares and initialises a variable
		26	// that is in scope for the next statement only
		27	// works only for stuff that can be assigned 0 and converts to false
		28	// (note: works great for pointers)
		29	// most ugly macro I ever wrote
		30	#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
		31
		32	// in range including end
		33	#define IN_RANGE_INC(val,beg,end) \
		34	((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
		35
		36	// in range excluding end
		37	#define IN_RANGE_EXC(val,beg,end) \
		38	((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
		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	// this is much faster than crossfires original algorithm
		51	// on modern cpus
		52	inline int
		53	isqrt (int n)
		54	{
		55	return (int)sqrtf ((float)n);
		56	}
		57
		58	// this is only twice as fast as naive sqrtf (dxdy+dydy)
		59	#if 0
		60	// and has a max. error of 6 in the range -100..+100.
		61	#else
		62	// and has a max. error of 9 in the range -100..+100.
		63	#endif
		64	inline int
		65	idistance (int dx, int dy)
		66	{
		67	unsigned int dx_ = abs (dx);
		68	unsigned int dy_ = abs (dy);
		69
		70	#if 0
		71	return dx_ > dy_
		72	? (dx_ * 61685 + dy_ * 26870) >> 16
		73	: (dy_ * 61685 + dx_ * 26870) >> 16;
		74	#else
		75	return dx_ + dy_ - min (dx_, dy_) * 5 / 8;
		76	#endif
		77	}
		78
		79	/*
		80	* absdir(int): Returns a number between 1 and 8, which represent
		81	* the "absolute" direction of a number (it actually takes care of
		82	* "overflow" in previous calculations of a direction).
		83	*/
		84	inline int
		85	absdir (int d)
		86	{
		87	return ((d - 1) & 7) + 1;
		88	}
		89
17	// makes dynamically allocated objects zero-initialised	90	// makes dynamically allocated objects zero-initialised
18	struct zero_initialised	91	struct zero_initialised
19	{	92	{
20	void operator new (size_t s, void p)	93	void operator new (size_t s, void p)
21	{	94	{
42	{	115	{
43	g_slice_free1 (s, p);	116	g_slice_free1 (s, p);
44	}	117	}
45	};	118	};
46		119
		120	void *salloc_ (int n) throw (std::bad_alloc);
		121	void salloc_ (int n, void src) throw (std::bad_alloc);
		122
47	// strictly the same as g_slice_alloc, but never returns 0	123	// strictly the same as g_slice_alloc, but never returns 0
48	void *salloc (int size) throw (std::bad_alloc);	124	template<typename T>
		125	inline T salloc (int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T)); }
		126
49	// also copies src into the new area, like "memdup"	127	// also copies src into the new area, like "memdup"
50	void salloc (int size, void src) throw (std::bad_alloc);	128	// if src is 0, clears the memory
		129	template<typename T>
		130	inline T salloc (int n, T src) throw (std::bad_alloc) { return (T )salloc_ (n sizeof (T), (void *)src); }
		131
		132	// clears the memory
		133	template<typename T>
		134	inline T salloc0(int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T), 0); }
		135
51	// for symmetry	136	// for symmetry
		137	template<typename T>
52	inline void sfree (void *ptr, int size) throw ()	138	inline void sfree (T *ptr, int n = 1) throw ()
53	{	139	{
		140	#ifdef PREFER_MALLOC
		141	free (ptr);
		142	#else
54	g_slice_free1 (size, ptr);	143	g_slice_free1 (n * sizeof (T), (void *)ptr);
		144	#endif
55	}	145	}
56		146
57	// a STL-compatible allocator that uses g_slice	147	// a STL-compatible allocator that uses g_slice
58	// boy, this is verbose	148	// boy, this is verbose
59	template<typename Tp>	149	template<typename Tp>
…		…
83	pointer address (reference x) const { return &x; }	173	pointer address (reference x) const { return &x; }
84	const_pointer address (const_reference x) const { return &x; }	174	const_pointer address (const_reference x) const { return &x; }
85		175
86	pointer allocate (size_type n, const_pointer = 0)	176	pointer allocate (size_type n, const_pointer = 0)
87	{	177	{
88	return static_cast<pointer>(salloc (n * sizeof (Tp)));	178	return salloc<Tp> (n);
89	}	179	}
90		180
91	void deallocate (pointer p, size_type n)	181	void deallocate (pointer p, size_type n)
92	{	182	{
93	sfree (static_cast<void >(p), n sizeof (Tp));	183	sfree<Tp> (p, n);
94	}	184	}
95		185
96	size_type max_size ()const throw ()	186	size_type max_size ()const throw ()
97	{	187	{
98	return size_t (-1) / sizeof (Tp);	188	return size_t (-1) / sizeof (Tp);
…		…
107	{	197	{
108	p->~Tp ();	198	p->~Tp ();
109	}	199	}
110	};	200	};
111		201
112	struct refcounted	202	// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
		203	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
		204	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
		205	struct tausworthe_random_generator
113	{	206	{
114	refcounted () : refcnt (0) { }	207	// generator
115	// virtual ~refcounted ();	208	uint32_t state [4];
116	void refcnt_inc () { ++refcnt; }	209
117	void refcnt_dec () { --refcnt; }	210	void operator =(const tausworthe_random_generator &src)
118	bool dead () { return refcnt == 0; }	211	{
119	mutable int refcnt;	212	state [0] = src.state [0];
120	#if 0	213	state [1] = src.state [1];
121	private:	214	state [2] = src.state [2];
122	static refcounted *rc_first;	215	state [3] = src.state [3];
123	refcounted *rc_next;	216	}
124	#endif	217
		218	void seed (uint32_t seed);
		219	uint32_t next ();
		220
		221	// uniform distribution
		222	uint32_t operator ()(uint32_t r_max)
		223	{
		224	return is_constant (r_max)
		225	? this->next () % r_max
		226	: get_range (r_max);
		227	}
		228
		229	// return a number within (min .. max)
		230	int operator () (int r_min, int r_max)
		231	{
		232	return is_constant (r_min) && is_constant (r_max)
		233	? r_min + (*this) (max (r_max - r_min + 1, 1))
		234	: get_range (r_min, r_max);
		235	}
		236
		237	double operator ()()
		238	{
		239	return this->next () / (double)0xFFFFFFFFU;
		240	}
		241
		242	protected:
		243	uint32_t get_range (uint32_t r_max);
		244	int get_range (int r_min, int r_max);
125	};	245	};
		246
		247	typedef tausworthe_random_generator rand_gen;
		248
		249	extern rand_gen rndm;
126		250
127	template<class T>	251	template<class T>
128	struct refptr	252	struct refptr
129	{	253	{
130	T *p;	254	T *p;
…		…
152	T &operator * () const { return *p; }	276	T &operator * () const { return *p; }
153	T *operator ->() const { return p; }	277	T *operator ->() const { return p; }
154		278
155	operator T *() const { return p; }	279	operator T *() const { return p; }
156	};	280	};
		281
		282	typedef refptr<maptile> maptile_ptr;
		283	typedef refptr<object> object_ptr;
		284	typedef refptr<archetype> arch_ptr;
		285	typedef refptr<client> client_ptr;
		286	typedef refptr<player> player_ptr;
157		287
158	struct str_hash	288	struct str_hash
159	{	289	{
160	std::size_t operator ()(const char *s) const	290	std::size_t operator ()(const char *s) const
161	{	291	{
…		…
187	{	317	{
188	return !strcmp (a, b);	318	return !strcmp (a, b);
189	}	319	}
190	};	320	};
191		321
192	#include <vector>
193
194	template<class obj>	322	template<class T>
195	struct unordered_vector : std::vector<obj, slice_allocator<obj> >	323	struct unordered_vector : std::vector<T, slice_allocator<T> >
196	{	324	{
197	typedef typename unordered_vector::iterator iterator;	325	typedef typename unordered_vector::iterator iterator;
198		326
199	void erase (unsigned int pos)	327	void erase (unsigned int pos)
200	{	328	{
…		…
208	{	336	{
209	erase ((unsigned int )(i - this->begin ()));	337	erase ((unsigned int )(i - this->begin ()));
210	}	338	}
211	};	339	};
212		340
213	template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }	341	template<class T, int T::* index>
214	template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }	342	struct object_vector : std::vector<T , slice_allocator<T > >
215	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; }	343	{
		344	void insert (T *obj)
		345	{
		346	assert (!(obj->*index));
		347	push_back (obj);
		348	obj->*index = this->size ();
		349	}
216		350
217	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }	351	void insert (T &obj)
		352	{
		353	insert (&obj);
		354	}
		355
		356	void erase (T *obj)
		357	{
		358	assert (obj->*index);
		359	int pos = obj->*index;
		360	obj->*index = 0;
		361
		362	if (pos < this->size ())
		363	{
		364	(this)[pos - 1] = (this)[this->size () - 1];
		365	(this)[pos - 1]->index = pos;
		366	}
		367
		368	this->pop_back ();
		369	}
		370
		371	void erase (T &obj)
		372	{
		373	errase (&obj);
		374	}
		375	};
218		376
219	// basically does what strncpy should do, but appends "..." to strings exceeding length	377	// basically does what strncpy should do, but appends "..." to strings exceeding length
220	void assign (char dst, const char src, int maxlen);	378	void assign (char dst, const char src, int maxlen);
221		379
222	// type-safe version of assign	380	// type-safe version of assign
…		…
229	typedef double tstamp;	387	typedef double tstamp;
230		388
231	// return current time as timestampe	389	// return current time as timestampe
232	tstamp now ();	390	tstamp now ();
233		391
234	#endif	392	int similar_direction (int a, int b);
235		393
		394	#endif
		395

Diff Legend

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

Comparing deliantra/server/include/util.h (file contents): Revision 1.17 by root, Sat Dec 16 03:08:26 2006 UTC vs. Revision 1.36 by root, Thu Jan 25 03:54:45 2007 UTC

Diff Legend

Comparing deliantra/server/include/util.h (file contents):
Revision 1.17 by root, Sat Dec 16 03:08:26 2006 UTC vs.
Revision 1.36 by root, Thu Jan 25 03:54:45 2007 UTC