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

Comparing deliantra/server/include/util.h (file contents):
Revision 1.61 by root, Fri Jan 25 18:09:23 2008 UTC vs.
Revision 1.133 by root, Sat Oct 8 21:54:05 2022 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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
		5	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	*	6	*
6	* Deliantra is free software: you can redistribute it and/or modify	7	* Deliantra is free software: you can redistribute it and/or modify it under
7	* it under the terms of the GNU General Public License as published by	8	* the terms of the Affero GNU General Public License as published by the
8	* the Free Software Foundation, either version 3 of the License, or	9	* Free Software Foundation, either version 3 of the License, or (at your
9	* (at your option) any later version.	10	* option) any later version.
10	*	11	*
11	* This program is distributed in the hope that it will be useful,	12	* This program is distributed in the hope that it will be useful,
12	* but WITHOUT ANY WARRANTY; without even the implied warranty of	13	* but WITHOUT ANY WARRANTY; without even the implied warranty of
13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	14	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14	* GNU General Public License for more details.	15	* GNU General Public License for more details.
15	*	16	*
16	* You should have received a copy of the GNU General Public License	17	* You should have received a copy of the Affero GNU General Public License
17	* along with this program. If not, see <http://www.gnu.org/licenses/>.	18	* and the GNU General Public License along with this program. If not, see
		19	* <http://www.gnu.org/licenses/>.
18	*	20	*
19	* The authors can be reached via e-mail to <support@deliantra.net>	21	* The authors can be reached via e-mail to <support@deliantra.net>
20	*/	22	*/
21		23
22	#ifndef UTIL_H__	24	#ifndef UTIL_H__
23	#define UTIL_H__	25	#define UTIL_H__
24		26
25	//#define PREFER_MALLOC	27	#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
26	//#define DEBUG_SALLOC	28	#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
		29	#define PREFER_MALLOC 0 // use malloc and not the slice allocator
27		30
28	#if __GNUC__ >= 3	31	#include <pthread.h>
29	# define is_constant(c) __builtin_constant_p (c)
30	# define expect(expr,value) __builtin_expect ((expr),(value))
31	# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
32	#else
33	# define is_constant(c) 0
34	# define expect(expr,value) (expr)
35	# define prefetch(addr,rw,locality)
36	#endif
37
38	#if __GNUC__ < 4 \|\| (__GNUC__ == 4 \|\| __GNUC_MINOR__ < 4)
39	# define decltype(x) typeof(x)
40	#endif
41
42	// put into ifs if you are very sure that the expression
43	// is mostly true or mosty false. note that these return
44	// booleans, not the expression.
45	#define expect_false(expr) expect ((expr) != 0, 0)
46	#define expect_true(expr) expect ((expr) != 0, 1)
47		32
48	#include <cstddef>	33	#include <cstddef>
49	#include <cmath>	34	#include <cmath>
50	#include <new>	35	#include <new>
51	#include <vector>	36	#include <vector>
52		37
53	#include <glib.h>	38	#include <glib.h>
54		39
		40	#include <flat_hash_map.hpp>
		41
55	#include <shstr.h>	42	#include <shstr.h>
56	#include <traits.h>	43	#include <traits.h>
57		44
		45	#include "ecb.h"
		46
58	#ifdef DEBUG_SALLOC	47	#if DEBUG_SALLOC
59	# define g_slice_alloc0(s) debug_slice_alloc0(s)	48	# define g_slice_alloc0(s) debug_slice_alloc0(s)
60	# define g_slice_alloc(s) debug_slice_alloc(s)	49	# define g_slice_alloc(s) debug_slice_alloc(s)
61	# define g_slice_free1(s,p) debug_slice_free1(s,p)	50	# define g_slice_free1(s,p) debug_slice_free1(s,p)
62	void *g_slice_alloc (unsigned long size);	51	void *g_slice_alloc (unsigned long size);
63	void *g_slice_alloc0 (unsigned long size);	52	void *g_slice_alloc0 (unsigned long size);
64	void g_slice_free1 (unsigned long size, void *ptr);	53	void g_slice_free1 (unsigned long size, void *ptr);
		54	#elif PREFER_MALLOC
		55	# define g_slice_alloc0(s) calloc (1, (s))
		56	# define g_slice_alloc(s) malloc ((s))
		57	# define g_slice_free1(s,p) free ((p))
65	#endif	58	#endif
66		59
67	// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
68	#define auto(var,expr) decltype(expr) var = (expr)
69
70	// very ugly macro that basicaly declares and initialises a variable	60	// very ugly macro that basically declares and initialises a variable
71	// that is in scope for the next statement only	61	// that is in scope for the next statement only
72	// 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
73	// (note: works great for pointers)	63	// (note: works great for pointers)
74	// most ugly macro I ever wrote	64	// most ugly macro I ever wrote
75	#define statementvar(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)
80		70
81	// in range excluding end	71	// in range excluding end
82	#define IN_RANGE_EXC(val,beg,end) \	72	#define IN_RANGE_EXC(val,beg,end) \
83	((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))
84		74
		75	ecb_cold void cleanup (const char *cause, bool make_core = false);
85	void fork_abort (const char *msg);	76	ecb_cold void fork_abort (const char *msg);
86		77
87	// rationale for using (U) not (T) is to reduce signed/unsigned issues,	78	// rationale for using (U) not (T) is to reduce signed/unsigned issues,
88	// as a is often a constant while b is the variable. it is still a bug, though.	79	// as a is often a constant while b is the variable. it is still a bug, though.
89	template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }	80	template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
90	template<typename T, typename U> static inline T max (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 a > (T)b ? a : (T)b; }
91	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; }	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; }
92		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
93	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }	88	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
94		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	template<>
		100	inline sint16 sign (sint16 v) { return 1 - (sint16 (uint16 (v) >> 15) * 2); }
		101	template<>
		102	inline sint32 sign (sint32 v) { return 1 - (sint32 (uint32 (v) >> 31) * 2); }
		103
		104	// sign0 returns -1, 0 or +1
		105	template<typename T>
		106	static inline T sign0 (T v) { return v ? sign (v) : 0; }
		107
		108	//clashes with C++0x
		109	template<typename T, typename U>
		110	static inline T copysign (T a, U b) { return a > 0 ? b : -b; }
		111
		112	// div* only work correctly for div > 0
		113	// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
		114	template<typename T> static inline T div (T val, T div)
		115	{
		116	return ecb_expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div;
		117	}
		118
		119	template<> inline float div (float val, float div) { return val / div; }
		120	template<> inline double div (double val, double div) { return val / div; }
		121
		122	// div, round-up
		123	template<typename T> static inline T div_ru (T val, T div)
		124	{
		125	return ecb_expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div;
		126	}
		127	// div, round-down
		128	template<typename T> static inline T div_rd (T val, T div)
		129	{
		130	return ecb_expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div;
		131	}
		132
		133	// lerp* only work correctly for min_in < max_in
		134	// Linear intERPolate, scales val from min_in..max_in to min_out..max_out
95	template<typename T>	135	template<typename T>
96	static inline T	136	static inline T
97	lerp (T val, T min_in, T max_in, T min_out, T max_out)	137	lerp (T val, T min_in, T max_in, T min_out, T max_out)
98	{	138	{
99	return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out;	139	return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
		140	}
		141
		142	// lerp, round-down
		143	template<typename T>
		144	static inline T
		145	lerp_rd (T val, T min_in, T max_in, T min_out, T max_out)
		146	{
		147	return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
		148	}
		149
		150	// lerp, round-up
		151	template<typename T>
		152	static inline T
		153	lerp_ru (T val, T min_in, T max_in, T min_out, T max_out)
		154	{
		155	return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
100	}	156	}
101		157
102	// lots of stuff taken from FXT	158	// lots of stuff taken from FXT
103		159
104	/* Rotate right. This is used in various places for checksumming */	160	/* Rotate right. This is used in various places for checksumming */
…		…
142	int32_t d = b - a;	198	int32_t d = b - a;
143	d &= d >> 31;	199	d &= d >> 31;
144	return b - d;	200	return b - d;
145	}	201	}
146		202
147	// this is much faster than crossfires original algorithm	203	// this is much faster than crossfire's original algorithm
148	// on modern cpus	204	// on modern cpus
149	inline int	205	inline int
150	isqrt (int n)	206	isqrt (int n)
151	{	207	{
152	return (int)sqrtf ((float)n);	208	return (int)sqrtf ((float)n);
		209	}
		210
		211	// this is kind of like the ^^ operator, if it would exist, without sequence point.
		212	// more handy than it looks like, due to the implicit !! done on its arguments
		213	inline bool
		214	logical_xor (bool a, bool b)
		215	{
		216	return a != b;
		217	}
		218
		219	inline bool
		220	logical_implies (bool a, bool b)
		221	{
		222	return a <= b;
153	}	223	}
154		224
155	// this is only twice as fast as naive sqrtf (dxdy+dydy)	225	// this is only twice as fast as naive sqrtf (dxdy+dydy)
156	#if 0	226	#if 0
157	// and has a max. error of 6 in the range -100..+100.	227	// and has a max. error of 6 in the range -100..+100.
158	#else	228	#else
159	// and has a max. error of 9 in the range -100..+100.	229	// and has a max. error of 9 in the range -100..+100.
160	#endif	230	#endif
161	inline int	231	inline int
162	idistance (int dx, int dy)	232	idistance (int dx, int dy)
163	{	233	{
164	unsigned int dx_ = abs (dx);	234	unsigned int dx_ = abs (dx);
165	unsigned int dy_ = abs (dy);	235	unsigned int dy_ = abs (dy);
166		236
167	#if 0	237	#if 0
168	return dx_ > dy_	238	return dx_ > dy_
…		…
171	#else	241	#else
172	return dx_ + dy_ - min (dx_, dy_) * 5 / 8;	242	return dx_ + dy_ - min (dx_, dy_) * 5 / 8;
173	#endif	243	#endif
174	}	244	}
175		245
		246	// can be substantially faster than floor, if your value range allows for it
		247	template<typename T>
		248	inline T
		249	fastfloor (T x)
		250	{
		251	return std::floor (x);
		252	}
		253
		254	inline float
		255	fastfloor (float x)
		256	{
		257	return sint32(x) - (x < 0);
		258	}
		259
		260	inline double
		261	fastfloor (double x)
		262	{
		263	return sint64(x) - (x < 0);
		264	}
		265
176	/*	266	/*
177	* absdir(int): Returns a number between 1 and 8, which represent	267	* absdir(int): Returns a number between 1 and 8, which represent
178	* the "absolute" direction of a number (it actually takes care of	268	* the "absolute" direction of a number (it actually takes care of
179	* "overflow" in previous calculations of a direction).	269	* "overflow" in previous calculations of a direction).
180	*/	270	*/
…		…
182	absdir (int d)	272	absdir (int d)
183	{	273	{
184	return ((d - 1) & 7) + 1;	274	return ((d - 1) & 7) + 1;
185	}	275	}
186		276
		277	#define for_all_bits_sparse_32(mask, idxvar) \
		278	for (uint32_t idxvar, mask_ = mask; \
		279	mask_ && ((idxvar = ecb_ctz32 (mask_)), mask_ &= ~(1 << idxvar), 1);)
		280
187	extern size_t slice_alloc; // statistics	281	extern ssize_t slice_alloc; // statistics
		282
		283	void *salloc_ (int n) noexcept;
		284	void salloc_ (int n, void src) noexcept;
		285
		286	// strictly the same as g_slice_alloc, but never returns 0
		287	template<typename T>
		288	inline T salloc (int n = 1) { return (T )salloc_ (n * sizeof (T)); }
		289
		290	// also copies src into the new area, like "memdup"
		291	// if src is 0, clears the memory
		292	template<typename T>
		293	inline T salloc (int n, T src) { return (T )salloc_ (n sizeof (T), (void *)src); }
		294
		295	// clears the memory
		296	template<typename T>
		297	inline T salloc0(int n = 1) { return (T )salloc_ (n * sizeof (T), 0); }
		298
		299	// for symmetry
		300	template<typename T>
		301	inline void sfree (T *ptr, int n = 1) noexcept
		302	{
		303	if (ecb_expect_true (ptr))
		304	{
		305	slice_alloc -= n * sizeof (T);
		306	if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
		307	g_slice_free1 (n * sizeof (T), (void *)ptr);
		308	}
		309	}
		310
		311	// nulls the pointer
		312	template<typename T>
		313	inline void sfree0 (T *&ptr, int n = 1) noexcept
		314	{
		315	sfree<T> (ptr, n);
		316	ptr = 0;
		317	}
188		318
189	// makes dynamically allocated objects zero-initialised	319	// makes dynamically allocated objects zero-initialised
190	struct zero_initialised	320	struct zero_initialised
191	{	321	{
192	void operator new (size_t s, void p)	322	void operator new (size_t s, void p)
…		…
195	return p;	325	return p;
196	}	326	}
197		327
198	void *operator new (size_t s)	328	void *operator new (size_t s)
199	{	329	{
200	slice_alloc += s;
201	return g_slice_alloc0 (s);	330	return salloc0<char> (s);
202	}	331	}
203		332
204	void *operator new[] (size_t s)	333	void *operator new[] (size_t s)
205	{	334	{
206	slice_alloc += s;
207	return g_slice_alloc0 (s);	335	return salloc0<char> (s);
208	}	336	}
209		337
210	void operator delete (void *p, size_t s)	338	void operator delete (void *p, size_t s)
211	{	339	{
212	slice_alloc -= s;	340	sfree ((char *)p, s);
213	g_slice_free1 (s, p);
214	}	341	}
215		342
216	void operator delete[] (void *p, size_t s)	343	void operator delete[] (void *p, size_t s)
217	{	344	{
218	slice_alloc -= s;	345	sfree ((char *)p, s);
219	g_slice_free1 (s, p);
220	}	346	}
221	};	347	};
222		348
223	void *salloc_ (int n) throw (std::bad_alloc);	349	// makes dynamically allocated objects zero-initialised
224	void salloc_ (int n, void src) throw (std::bad_alloc);	350	struct slice_allocated
225
226	// strictly the same as g_slice_alloc, but never returns 0
227	template<typename T>
228	inline T salloc (int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T)); }
229
230	// also copies src into the new area, like "memdup"
231	// if src is 0, clears the memory
232	template<typename T>
233	inline T salloc (int n, T src) throw (std::bad_alloc) { return (T )salloc_ (n sizeof (T), (void *)src); }
234
235	// clears the memory
236	template<typename T>
237	inline T salloc0(int n = 1) throw (std::bad_alloc) { return (T )salloc_ (n * sizeof (T), 0); }
238
239	// for symmetry
240	template<typename T>
241	inline void sfree (T *ptr, int n = 1) throw ()
242	{	351	{
243	#ifdef PREFER_MALLOC	352	void operator new (size_t s, void p)
244	free (ptr);	353	{
245	#else	354	return p;
246	slice_alloc -= n * sizeof (T);	355	}
247	g_slice_free1 (n * sizeof (T), (void *)ptr);	356
248	#endif	357	void *operator new (size_t s)
249	}	358	{
		359	return salloc<char> (s);
		360	}
		361
		362	void *operator new[] (size_t s)
		363	{
		364	return salloc<char> (s);
		365	}
		366
		367	void operator delete (void *p, size_t s)
		368	{
		369	sfree ((char *)p, s);
		370	}
		371
		372	void operator delete[] (void *p, size_t s)
		373	{
		374	sfree ((char *)p, s);
		375	}
		376	};
250		377
251	// a STL-compatible allocator that uses g_slice	378	// a STL-compatible allocator that uses g_slice
252	// boy, this is verbose	379	// boy, this is much less verbose in newer C++ versions
253	template<typename Tp>	380	template<typename Tp>
254	struct slice_allocator	381	struct slice_allocator
255	{	382	{
256	typedef size_t size_type;	383	using value_type = Tp;
257	typedef ptrdiff_t difference_type;
258	typedef Tp *pointer;
259	typedef const Tp *const_pointer;
260	typedef Tp &reference;
261	typedef const Tp &const_reference;
262	typedef Tp value_type;
263		384
264	template <class U>	385	slice_allocator () noexcept { }
265	struct rebind	386	template<class U> slice_allocator (const slice_allocator<U> &) noexcept {}
		387
		388	value_type *allocate (std::size_t n)
266	{	389	{
267	typedef slice_allocator<U> other;	390	return salloc<Tp> (n);
		391	}
		392
		393	void deallocate (value_type *p, std::size_t n)
		394	{
		395	sfree<Tp> (p, n);
		396	}
		397	};
		398
		399	template<class T, class U>
		400	bool operator == (const slice_allocator<T> &, const slice_allocator<U> &) noexcept
		401	{
		402	return true;
		403	}
		404
		405	template<class T, class U>
		406	bool operator != (const slice_allocator<T> &x, const slice_allocator<U> &y) noexcept
		407	{
		408	return !(x == y);
		409	}
		410
		411	// basically a memory area, but refcounted
		412	struct refcnt_buf
		413	{
		414	char *data;
		415
		416	refcnt_buf (size_t size = 0);
		417	refcnt_buf (void *data, size_t size);
		418
		419	refcnt_buf (const refcnt_buf &src)
		420	{
		421	data = src.data;
		422	inc ();
		423	}
		424
		425	~refcnt_buf ();
		426
		427	refcnt_buf &operator =(const refcnt_buf &src);
		428
		429	operator char *()
		430	{
		431	return data;
		432	}
		433
		434	size_t size () const
		435	{
		436	return _size ();
		437	}
		438
		439	protected:
		440	enum {
		441	overhead = sizeof (uint32_t) * 2
268	};	442	};
269		443
270	slice_allocator () throw () { }	444	uint32_t &_size () const
271	slice_allocator (const slice_allocator &o) throw () { }
272	template<typename Tp2>
273	slice_allocator (const slice_allocator<Tp2> &) throw () { }
274
275	~slice_allocator () { }
276
277	pointer address (reference x) const { return &x; }
278	const_pointer address (const_reference x) const { return &x; }
279
280	pointer allocate (size_type n, const_pointer = 0)
281	{	445	{
282	return salloc<Tp> (n);	446	return ((unsigned int *)data)[-2];
283	}	447	}
284		448
285	void deallocate (pointer p, size_type n)	449	uint32_t &_refcnt () const
286	{	450	{
287	sfree<Tp> (p, n);	451	return ((unsigned int *)data)[-1];
288	}	452	}
289		453
290	size_type max_size ()const throw ()	454	void _alloc (uint32_t size)
291	{	455	{
292	return size_t (-1) / sizeof (Tp);	456	data = ((char *)salloc<char> (size + overhead)) + overhead;
		457	_size () = size;
		458	_refcnt () = 1;
293	}	459	}
294		460
295	void construct (pointer p, const Tp &val)	461	void _dealloc ();
296	{
297	::new (p) Tp (val);
298	}
299		462
300	void destroy (pointer p)	463	void inc ()
301	{	464	{
302	p->~Tp ();	465	++_refcnt ();
303	}	466	}
304	};
305		467
306	// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.	468	void dec ()
307	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
308	// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
309	struct tausworthe_random_generator
310	{
311	// generator
312	uint32_t state [4];
313
314	void operator =(const tausworthe_random_generator &src)
315	{	469	{
316	state [0] = src.state [0];	470	if (!--_refcnt ())
317	state [1] = src.state [1];	471	_dealloc ();
318	state [2] = src.state [2];
319	state [3] = src.state [3];
320	}	472	}
321
322	void seed (uint32_t seed);
323	uint32_t next ();
324
325	// uniform distribution
326	uint32_t operator ()(uint32_t num)
327	{
328	return is_constant (num)
329	? (next () * (uint64_t)num) >> 32U
330	: get_range (num);
331	}
332
333	// return a number within (min .. max)
334	int operator () (int r_min, int r_max)
335	{
336	return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
337	? r_min + operator ()(r_max - r_min + 1)
338	: get_range (r_min, r_max);
339	}
340
341	double operator ()()
342	{
343	return this->next () / (double)0xFFFFFFFFU;
344	}
345
346	protected:
347	uint32_t get_range (uint32_t r_max);
348	int get_range (int r_min, int r_max);
349	};	473	};
350
351	typedef tausworthe_random_generator rand_gen;
352
353	extern rand_gen rndm;
354		474
355	INTERFACE_CLASS (attachable)	475	INTERFACE_CLASS (attachable)
356	struct refcnt_base	476	struct refcnt_base
357	{	477	{
358	typedef int refcnt_t;	478	typedef int refcnt_t;
…		…
373	// p if not null	493	// p if not null
374	refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }	494	refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
375		495
376	void refcnt_dec ()	496	void refcnt_dec ()
377	{	497	{
378	if (!is_constant (p))	498	if (!ecb_is_constant (p))
379	--*refcnt_ref ();	499	--*refcnt_ref ();
380	else if (p)	500	else if (p)
381	--p->refcnt;	501	--p->refcnt;
382	}	502	}
383		503
384	void refcnt_inc ()	504	void refcnt_inc ()
385	{	505	{
386	if (!is_constant (p))	506	if (!ecb_is_constant (p))
387	++*refcnt_ref ();	507	++*refcnt_ref ();
388	else if (p)	508	else if (p)
389	++p->refcnt;	509	++p->refcnt;
390	}	510	}
391		511
…		…
420	typedef refptr<maptile> maptile_ptr;	540	typedef refptr<maptile> maptile_ptr;
421	typedef refptr<object> object_ptr;	541	typedef refptr<object> object_ptr;
422	typedef refptr<archetype> arch_ptr;	542	typedef refptr<archetype> arch_ptr;
423	typedef refptr<client> client_ptr;	543	typedef refptr<client> client_ptr;
424	typedef refptr<player> player_ptr;	544	typedef refptr<player> player_ptr;
		545	typedef refptr<region> region_ptr;
		546
		547	#define STRHSH_NULL 2166136261
		548
		549	static inline uint32_t
		550	strhsh (const char *s)
		551	{
		552	// use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
		553	// it is about twice as fast as the one-at-a-time one,
		554	// with good distribution.
		555	// FNV-1a is faster on many cpus because the multiplication
		556	// runs concurrently with the looping logic.
		557	// we modify the hash a bit to improve its distribution
		558	uint32_t hash = STRHSH_NULL;
		559
		560	while (*s)
		561	hash = (hash ^ s++) 16777619U;
		562
		563	return hash ^ (hash >> 16);
		564	}
		565
		566	static inline uint32_t
		567	memhsh (const char *s, size_t len)
		568	{
		569	uint32_t hash = STRHSH_NULL;
		570
		571	while (len--)
		572	hash = (hash ^ s++) 16777619U;
		573
		574	return hash;
		575	}
425		576
426	struct str_hash	577	struct str_hash
427	{	578	{
428	std::size_t operator ()(const char *s) const	579	std::size_t operator ()(const char *s) const
429	{	580	{
430	unsigned long hash = 0;
431
432	/* use the one-at-a-time hash function, which supposedly is
433	* better than the djb2-like one used by perl5.005, but
434	* certainly is better then the bug used here before.
435	* see http://burtleburtle.net/bob/hash/doobs.html
436	*/
437	while (*s)
438	{
439	hash += *s++;
440	hash += hash << 10;
441	hash ^= hash >> 6;
442	}
443
444	hash += hash << 3;
445	hash ^= hash >> 11;
446	hash += hash << 15;
447
448	return hash;	581	return strhsh (s);
449	}	582	}
		583
		584	std::size_t operator ()(const shstr &s) const
		585	{
		586	return strhsh (s);
		587	}
		588
		589	typedef ska::power_of_two_hash_policy hash_policy;
450	};	590	};
451		591
452	struct str_equal	592	struct str_equal
453	{	593	{
454	bool operator ()(const char a, const char b) const	594	bool operator ()(const char a, const char b) const
…		…
480	}	620	}
481	};	621	};
482		622
483	// This container blends advantages of linked lists	623	// This container blends advantages of linked lists
484	// (efficiency) with vectors (random access) by	624	// (efficiency) with vectors (random access) by
485	// by using an unordered vector and storing the vector	625	// using an unordered vector and storing the vector
486	// index inside the object.	626	// index inside the object.
487	//	627	//
488	// + memory-efficient on most 64 bit archs	628	// + memory-efficient on most 64 bit archs
489	// + O(1) insert/remove	629	// + O(1) insert/remove
490	// + free unique (but varying) id for inserted objects	630	// + free unique (but varying) id for inserted objects
…		…
527	insert (&obj);	667	insert (&obj);
528	}	668	}
529		669
530	void erase (T *obj)	670	void erase (T *obj)
531	{	671	{
532	unsigned int pos = obj->*indexmember;	672	object_vector_index pos = obj->*indexmember;
533	obj->*indexmember = 0;	673	obj->*indexmember = 0;
534		674
535	if (pos < this->size ())	675	if (pos < this->size ())
536	{	676	{
537	(this)[pos - 1] = (this)[this->size () - 1];	677	(this)[pos - 1] = (this)[this->size () - 1];
…		…
545	{	685	{
546	erase (&obj);	686	erase (&obj);
547	}	687	}
548	};	688	};
549		689
		690	/////////////////////////////////////////////////////////////////////////////
		691
		692	// something like a vector or stack, but without
		693	// out of bounds checking
		694	template<typename T>
		695	struct fixed_stack
		696	{
		697	T *data;
		698	int size;
		699	int max;
		700
		701	fixed_stack ()
		702	: size (0), data (0)
		703	{
		704	}
		705
		706	fixed_stack (int max)
		707	: size (0), max (max)
		708	{
		709	data = salloc<T> (max);
		710	}
		711
		712	void reset (int new_max)
		713	{
		714	sfree (data, max);
		715	size = 0;
		716	max = new_max;
		717	data = salloc<T> (max);
		718	}
		719
		720	void free ()
		721	{
		722	sfree (data, max);
		723	data = 0;
		724	}
		725
		726	~fixed_stack ()
		727	{
		728	sfree (data, max);
		729	}
		730
		731	T &operator[](int idx)
		732	{
		733	return data [idx];
		734	}
		735
		736	void push (T v)
		737	{
		738	data [size++] = v;
		739	}
		740
		741	T &pop ()
		742	{
		743	return data [--size];
		744	}
		745
		746	T remove (int idx)
		747	{
		748	T v = data [idx];
		749
		750	data [idx] = data [--size];
		751
		752	return v;
		753	}
		754	};
		755
		756	/////////////////////////////////////////////////////////////////////////////
		757
550	// basically does what strncpy should do, but appends "..." to strings exceeding length	758	// basically does what strncpy should do, but appends "..." to strings exceeding length
		759	// returns the number of bytes actually used (including \0)
551	void assign (char dst, const char src, int maxlen);	760	int assign (char dst, const char src, int maxsize);
552		761
553	// type-safe version of assign	762	// type-safe version of assign
554	template<int N>	763	template<int N>
555	inline void assign (char (&dst)[N], const char *src)	764	inline int assign (char (&dst)[N], const char *src)
556	{	765	{
557	assign ((char *)&dst, src, N);	766	return assign ((char *)&dst, src, N);
558	}	767	}
559		768
560	typedef double tstamp;	769	typedef double tstamp;
561		770
562	// return current time as timestamp	771	// return current time as timestamp
563	tstamp now ();	772	tstamp now ();
564		773
565	int similar_direction (int a, int b);	774	int similar_direction (int a, int b);
566		775
567	// like sprintf, but returns a "static" buffer	776	// like v?sprintf, but returns a "static" buffer
568	const char format (const char format, ...);	777	char vformat (const char format, va_list ap);
		778	char format (const char format, ...) ecb_attribute ((format (printf, 1, 2)));
569		779
		780	// safety-check player input which will become object->msg
		781	bool msg_is_safe (const char *msg);
		782
		783	/////////////////////////////////////////////////////////////////////////////
		784	// threads, very very thin wrappers around pthreads
		785
		786	struct thread
		787	{
		788	pthread_t id;
		789
		790	void start (void (start_routine)(void ), void arg = 0);
		791
		792	void cancel ()
		793	{
		794	pthread_cancel (id);
		795	}
		796
		797	void *join ()
		798	{
		799	void *ret;
		800
		801	if (pthread_join (id, &ret))
		802	cleanup ("pthread_join failed", 1);
		803
		804	return ret;
		805	}
		806	};
		807
		808	// note that mutexes are not classes
		809	typedef pthread_mutex_t smutex;
		810
		811	#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
		812	#define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
		813	#else
		814	#define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
570	#endif	815	#endif
571		816
		817	#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
		818	#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
		819	#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
		820
		821	typedef pthread_cond_t scond;
		822
		823	#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
		824	#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
		825	#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
		826	#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
		827
		828	#endif
		829

Diff Legend

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

Comparing deliantra/server/include/util.h (file contents): Revision 1.61 by root, Fri Jan 25 18:09:23 2008 UTC vs. Revision 1.133 by root, Sat Oct 8 21:54:05 2022 UTC

Diff Legend

Comparing deliantra/server/include/util.h (file contents):
Revision 1.61 by root, Fri Jan 25 18:09:23 2008 UTC vs.
Revision 1.133 by root, Sat Oct 8 21:54:05 2022 UTC