[ViewVC] Diff of: cvs/deliantra/server/common/utils.C

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.45 by root, Sat Jan 27 02:19:36 2007 UTC vs.
Revision 1.84 by root, Tue Dec 30 07:24:16 2008 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
9	* it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
10	* the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	22	*/
24		23
25	/*	24	/*
26	* General convenience functions for crossfire.	25	* General convenience functions for crossfire.
27	*/	26	*/
32	#include <sys/time.h>	31	#include <sys/time.h>
33	#include <time.h>	32	#include <time.h>
34	#include <signal.h>	33	#include <signal.h>
35		34
36	#include <global.h>	35	#include <global.h>
37	#include <funcpoint.h>
38	#include <material.h>	36	#include <material.h>
39		37
		38	#include <sys/time.h>
		39	#include <sys/resource.h>
		40
40	#include <glib.h>	41	#include <glib.h>
41		42
42	rand_gen rndm;	43	refcnt_base::refcnt_t refcnt_dummy;
		44	ssize_t slice_alloc;
		45	rand_gen rndm, rmg_rndm;
43		46
44	void	47	void
45	tausworthe_random_generator::seed (uint32_t seed)	48	tausworthe_random_generator::seed (uint32_t seed)
46	{	49	{
47	state [0] = max ( 2U, seed * 69069U);	50	state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
48	state [1] = max ( 8U, state [0] * 69069U);	51	state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
49	state [2] = max ( 16U, state [1] * 69069U);	52	state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
50	state [3] = max (128U, state [2] * 69069U);	53	state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
51		54
52	for (int i = 11; --i; )	55	for (int i = 11; --i; )
53	operator ()();	56	next ();
54	}	57	}
55		58
56	uint32_t	59	uint32_t
57	tausworthe_random_generator::next ()	60	tausworthe_random_generator::next ()
58	{	61	{
…		…
62	state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);	65	state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
63		66
64	return state [0] ^ state [1] ^ state [2] ^ state [3];	67	return state [0] ^ state [1] ^ state [2] ^ state [3];
65	}	68	}
66		69
		70	template<class generator>
67	uint32_t	71	uint32_t
68	tausworthe_random_generator::get_range (uint32_t r_max)	72	random_number_generator<generator>::get_range (uint32_t num)
69	{	73	{
70	return next () % r_max;	74	return (this->next () * (uint64_t)num) >> 32U;
71	}	75	}
72		76
73	// return a number within (min .. max)	77	// return a number within (min .. max)
		78	template<class generator>
74	int	79	int
75	tausworthe_random_generator::get_range (int r_min, int r_max)	80	random_number_generator<generator>::get_range (int r_min, int r_max)
76	{	81	{
77	return r_min + (*this) (max (r_max - r_min + 1, 1));	82	return r_min + get_range (max (r_max - r_min + 1, 0));
78	}	83	}
		84
		85	template struct random_number_generator<tausworthe_random_generator>;
		86	template struct random_number_generator<xorshift_random_generator>;
79		87
80	/*	88	/*
81	* The random functions here take luck into account when rolling random	89	* The random functions here take luck into account when rolling random
82	* dice or numbers. This function has less of an impact the larger the	90	* dice or numbers. This function has less of an impact the larger the
83	* difference becomes in the random numbers. IE, the effect is lessened	91	* difference becomes in the random numbers. IE, the effect is lessened
…		…
93	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]	101	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]
94	*/	102	*/
95	int	103	int
96	random_roll (int r_min, int r_max, const object *op, int goodbad)	104	random_roll (int r_min, int r_max, const object *op, int goodbad)
97	{	105	{
		106	r_max = max (r_min, r_max);
		107
98	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */	108	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
99
100	if (r_max < 1 \|\| r_max < r_min)
101	{
102	LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
103	return r_min;
104	}
105		109
106	if (op->type == PLAYER)	110	if (op->type == PLAYER)
107	{	111	{
108	int luck = op->stats.luck;	112	int luck = op->stats.luck;
109		113
…		…
119	/*	123	/*
120	* This is a 64 bit version of random_roll above. This is needed	124	* This is a 64 bit version of random_roll above. This is needed
121	* for exp loss calculations for players changing religions.	125	* for exp loss calculations for players changing religions.
122	*/	126	*/
123	sint64	127	sint64
124	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)	128	random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
125	{	129	{
126	sint64 omin, diff, luck, ran;	130	sint64 omin = r_min;
127	int base;	131	sint64 range = max (0, r_max - r_min + 1);
128		132	int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */
129	omin = min;
130	diff = max - min + 1;
131	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
132
133	if (max < 1 \|\| diff < 1)
134	{
135	LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
136	return (min); /* avoids a float exception */
137	}
138		133
139	/*	134	/*
140	* Make a call to get two 32 bit unsigned random numbers, and just to	135	* Make a call to get two 32 bit unsigned random numbers, and just to
141	* a little bitshifting.	136	* a little bitshifting.
142	*/	137	*/
143	ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);	138	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
144		139
145	if (op->type != PLAYER)	140	if (op->type != PLAYER)
146	return ((ran % diff) + min);	141	return ((ran % range) + r_min);
147		142
148	luck = op->stats.luck;	143	int luck = op->stats.luck;
		144
149	if (rndm (base) < MIN (10, abs (luck)))	145	if (rndm (base) < min (10, abs (luck)))
150	{	146	{
151	/* we have a winner */	147	/* we have a winner */
152	((luck > 0) ? (luck = 1) : (luck = -1));	148	((luck > 0) ? (luck = 1) : (luck = -1));
153	diff -= luck;	149	range -= luck;
154	if (diff < 1)	150	if (range < 1)
155	return (omin); /check again /	151	return (omin); /check again /
		152
156	((goodbad) ? (min += luck) : (diff));	153	((goodbad) ? (r_min += luck) : (range));
157		154
158	return (MAX (omin, MIN (max, (ran % diff) + min)));	155	return (max (omin, min (r_max, (ran % range) + r_min)));
159	}	156	}
160		157
161	return ((ran % diff) + min);	158	return ran % range + r_min;
162	}	159	}
163		160
164	/*	161	/*
165	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,	162	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,
166	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.	163	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.
167	* Generally, op should be the player/caster/hitter requesting the roll,	164	* Generally, op should be the player/caster/hitter requesting the roll,
168	* not the recipient (ie, the poor slob getting hit).	165	* not the recipient (ie, the poor slob getting hit).
169	* The args are num D size (ie 4d6) [garbled 20010916]	166	* The args are num D size (ie 4d6) [garbled 20010916]
170	*/	167	*/
171
172	int	168	int
173	die_roll (int num, int size, const object *op, int goodbad)	169	die_roll (int num, int size, const object *op, int goodbad)
174	{	170	{
175	int min, diff, luck, total, i, gotlucky, base;	171	int min, luck, total, i, gotlucky;
176		172
177	diff = size;	173	int diff = size;
178	min = 1;	174	min = 1;
179	luck = total = gotlucky = 0;	175	luck = total = gotlucky = 0;
180	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	176	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
		177
181	if (size < 2 \|\| diff < 1)	178	if (size < 2 \|\| diff < 1)
182	{	179	{
183	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);	180	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
184	return (num); /* avoids a float exception */	181	return num; /* avoids a float exception */
185	}	182	}
186		183
187	if (op->type == PLAYER)	184	if (op->type == PLAYER)
188	luck = op->stats.luck;	185	luck = op->stats.luck;
189		186
…		…
205	}	202	}
206		203
207	return total;	204	return total;
208	}	205	}
209		206
210	/* decay and destroy perishable items in a map */
211	void
212	maptile::decay_objects ()
213	{
214	if (!spaces)
215	return;
216
217	for (mapspace *ms = spaces + size (); ms-- > spaces; )
218	for (object above, op = ms->bot; op; op = above)
219	{
220	above = op->above;
221
222	bool destroy = 0;
223
224	// do not decay anything above unique floor tiles (yet :)
225	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
226	break;
227
228	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
229	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
230	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
231	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
232	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
233	\|\| QUERY_FLAG (op, FLAG_UNPAID)
234	\|\| op->is_alive ())
235	; // do not decay
236	else if (op->is_weapon ())
237	{
238	op->stats.dam--;
239	if (op->stats.dam < 0)
240	destroy = 1;
241	}
242	else if (op->is_armor ())
243	{
244	op->stats.ac--;
245	if (op->stats.ac < 0)
246	destroy = 1;
247	}
248	else if (op->type == FOOD)
249	{
250	op->stats.food -= rndm (5, 20);
251	if (op->stats.food < 0)
252	destroy = 1;
253	}
254	else
255	{
256	int mat = op->material;
257
258	if (mat & M_PAPER
259	\|\| mat & M_LEATHER
260	\|\| mat & M_WOOD
261	\|\| mat & M_ORGANIC
262	\|\| mat & M_CLOTH
263	\|\| mat & M_LIQUID
264	\|\| (mat & M_IRON && rndm (1, 5) == 1)
265	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
266	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
267	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
268	\|\| (mat & M_ICE && temp > 32))
269	destroy = 1;
270	}
271
272	/* adjust overall chance below */
273	if (destroy && rndm (0, 1))
274	op->destroy ();
275	}
276	}
277
278	/* convert materialname to materialtype_t */	207	/* convert materialname to materialtype_t */
279		208
280	materialtype_t *	209	materialtype_t *
281	name_to_material (const char *name)	210	name_to_material (const shstr_cmp name)
282	{	211	{
283	materialtype_t mt, nmt;	212	for (materialtype_t *mt = materialt; mt; mt = mt->next)
		213	if (name == mt->name)
		214	return mt;
284		215
285	mt = NULL;
286	for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
287	{
288	if (strcmp (name, nmt->name) == 0)
289	{
290	mt = nmt;
291	break;
292	}
293	}
294	return mt;	216	return 0;
295	}	217	}
296		218
297	/* when doing transmutation of objects, we have to recheck the resistances,	219	/* when doing transmutation of objects, we have to recheck the resistances,
298	* as some that did not apply previously, may apply now.	220	* as some that did not apply previously, may apply now.
299	*/	221	*/
300
301	void	222	void
302	transmute_materialname (object op, const object change)	223	transmute_materialname (object op, const object change)
303	{	224	{
304	materialtype_t *mt;	225	materialtype_t *mt;
305	int j;	226	int j;
306		227
307	if (op->materialname == NULL)	228	if (!op->materialname)
308	return;	229	return;
309		230
310	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))	231	if (change->materialname && strcmp (op->materialname, change->materialname))
311	return;	232	return;
312		233
313	if (!op->is_armor ())	234	if (!op->is_armor ())
314	return;	235	return;
315		236
316	mt = name_to_material (op->materialname);	237	mt = name_to_material (op->materialname);
317	if (!mt)	238	if (!mt)
318	{	239	{
319	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);	240	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
320	return;	241	return;
321	}	242	}
322		243
323	for (j = 0; j < NROFATTACKS; j++)	244	for (j = 0; j < NROFATTACKS; j++)
324	if (op->resist[j] == 0 && change->resist[j] != 0)	245	if (op->resist[j] == 0 && change->resist[j] != 0)
…		…
335	void	256	void
336	set_materialname (object op, int difficulty, materialtype_t nmt)	257	set_materialname (object op, int difficulty, materialtype_t nmt)
337	{	258	{
338	materialtype_t mt, lmt;	259	materialtype_t mt, lmt;
339		260
340	#ifdef NEW_MATERIAL_CODE
341	int j;
342	#endif
343
344	if (op->materialname != NULL)	261	if (!op->materialname)
345	return;	262	return;
346		263
347		264	if (nmt)
348		265	lmt = nmt;
349	if (nmt == NULL)	266	else
350	{	267	{
351	lmt = NULL;	268	lmt = 0;
352	#ifndef NEW_MATERIAL_CODE	269
353	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)	270	for (mt = materialt; mt; mt = mt->next)
354	{	271	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
355	if (op->material & mt->material)	272	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
356	{	273	{
357	lmt = mt;	274	lmt = mt;
		275	if (!(op->is_weapon () \|\| op->is_armor ()))
358	break;	276	break;
359	}	277	}
360	}
361
362	#else
363	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
364	{
365	if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
366	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
367	{
368	lmt = mt;
369	if (!(op->is_weapon () \|\| op->is_armor ()))
370	break;
371	}
372	}
373	#endif
374	}
375	else
376	{	278	}
377	lmt = nmt;	279
		280	if (lmt)
378	}	281	{
379
380	if (lmt != NULL)
381	{
382	#ifndef NEW_MATERIAL_CODE
383	op->materialname = lmt->name;
384	return;
385	#else
386
387	if (op->stats.dam && op->is_weapon ())	282	if (op->stats.dam && op->is_weapon ())
388	{	283	{
389	op->stats.dam += lmt->damage;	284	op->stats.dam += lmt->damage;
390	if (op->stats.dam < 1)	285	if (op->stats.dam < 1)
391	op->stats.dam = 1;	286	op->stats.dam = 1;
392	}	287	}
		288
393	if (op->stats.sp && op->type == BOW)	289	if (op->stats.sp && op->type == BOW)
394	op->stats.sp += lmt->sp;	290	op->stats.sp += lmt->sp;
395	if (op->stats.wc && op->is_weapon ())	291	if (op->stats.wc && op->is_weapon ())
396	op->stats.wc += lmt->wc;	292	op->stats.wc += lmt->wc;
397	if (op->is_armor ())	293	if (op->is_armor ())
398	{	294	{
399	if (op->stats.ac)	295	if (op->stats.ac)
400	op->stats.ac += lmt->ac;	296	op->stats.ac += lmt->ac;
		297
401	for (j = 0; j < NROFATTACKS; j++)	298	for (int j = 0; j < NROFATTACKS; j++)
402	if (op->resist[j] != 0)	299	if (op->resist[j] != 0)
403	{	300	{
404	op->resist[j] += lmt->mod[j];	301	op->resist[j] += lmt->mod[j];
405	if (op->resist[j] > 100)	302	if (op->resist[j] > 100)
406	op->resist[j] = 100;	303	op->resist[j] = 100;
407	if (op->resist[j] < -100)	304	if (op->resist[j] < -100)
408	op->resist[j] = -100;	305	op->resist[j] = -100;
409	}	306	}
410	}	307	}
		308
411	op->materialname = add_string (lmt->name);	309	op->materialname = lmt->name;
412	/* dont make it unstackable if it doesn't need to be */	310	/* dont make it unstackable if it doesn't need to be */
413	if (op->is_weapon () \|\| op->is_armor ())	311	if (op->is_weapon () \|\| op->is_armor ())
414	{	312	{
415	op->weight = (op->weight * lmt->weight) / 100;	313	op->weight = (op->weight * lmt->weight) / 100;
416	op->value = (op->value * lmt->value) / 100;	314	op->value = (op->value * lmt->value) / 100;
417	}	315	}
418	#endif
419	}	316	}
420	}	317	}
421		318
422	/*	319	/*
423	* Strip out the media tags from a String.	320	* Strip out the media tags from a String.
…		…
518	* a 'list' for the purposes here, is a string of items, seperated by commas, except	415	* a 'list' for the purposes here, is a string of items, seperated by commas, except
519	* for the last entry, which has an 'and' before it, and a full stop (period) after it.	416	* for the last entry, which has an 'and' before it, and a full stop (period) after it.
520	* This function will also strip all trailing non alphanumeric characters.	417	* This function will also strip all trailing non alphanumeric characters.
521	* It does not insert an oxford comma.	418	* It does not insert an oxford comma.
522	*/	419	*/
523
524	void	420	void
525	make_list_like (char *input)	421	make_list_like (char *input)
526	{	422	{
527	char *p, tmp[MAX_BUF];	423	char *p, tmp[MAX_BUF];
528	int i;	424	int i;
…		…
558	void	454	void
559	fork_abort (const char *msg)	455	fork_abort (const char *msg)
560	{	456	{
561	if (!fork ())	457	if (!fork ())
562	{	458	{
		459	signal (SIGINT , SIG_IGN);
		460	signal (SIGTERM, SIG_IGN);
563	signal (SIGABRT, SIG_DFL);	461	signal (SIGABRT, SIG_IGN);
		462
		463	signal (SIGSEGV, SIG_DFL);
		464	signal (SIGBUS , SIG_DFL);
		465	signal (SIGILL , SIG_DFL);
		466	signal (SIGTRAP, SIG_DFL);
		467
		468	// try to put corefiles into a subdirectory, if existing, to allow
		469	// an administrator to reduce the I/O load.
		470	chdir ("cores");
		471
		472	// try to detach us from as many external dependencies as possible
		473	// as coredumping can take time by closing all fd's.
		474	{
		475	struct rlimit lim;
		476
		477	if (getrlimit (RLIMIT_NOFILE, &lim))
		478	lim.rlim_cur = 1024;
		479
		480	for (int i = 0; i < lim.rlim_cur; ++i)
		481	close (i);
		482	}
		483
		484	{
		485	sigset_t empty;
		486	sigemptyset (&empty);
		487	sigprocmask (SIG_SETMASK, &empty, 0);
		488	}
		489
		490	// try to coredump with SIGTRAP
		491	kill (getpid (), SIGTRAP);
564	abort ();	492	abort ();
565	}	493	}
566		494
567	LOG (llevError, "fork abort: %s\n", msg);	495	LOG (llevError, "fork abort: %s\n", msg);
568	}	496	}
569		497
570	void *salloc_ (int n) throw (std::bad_alloc)	498	void *salloc_ (int n) throw (std::bad_alloc)
571	{	499	{
572	#ifdef PREFER_MALLOC
573	void *ptr = malloc (n);
574	#else
575	void *ptr = g_slice_alloc (n);	500	void *ptr = g_slice_alloc (n);
576	#endif
577		501
578	if (!ptr)	502	if (!ptr)
579	throw std::bad_alloc ();	503	throw std::bad_alloc ();
580		504
		505	slice_alloc += n;
581	return ptr;	506	return ptr;
582	}	507	}
583		508
584	void salloc_ (int n, void src) throw (std::bad_alloc)	509	void salloc_ (int n, void src) throw (std::bad_alloc)
585	{	510	{
…		…
591	memset (ptr, 0, n);	516	memset (ptr, 0, n);
592		517
593	return ptr;	518	return ptr;
594	}	519	}
595		520
		521	/******************************************************************************/
		522
		523	#if DEBUG_SALLOC
		524
		525	#define MAGIC 0xa1b2c35543deadLL
		526
		527	void *g_slice_alloc (unsigned long size)
		528	{
		529	unsigned long p = (unsigned long ) (g_slice_alloc)(size + sizeof (unsigned long));
		530	*p++ = size ^ MAGIC;
		531	//fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
		532	return (void *)p;
		533	}
		534
		535	void *g_slice_alloc0 (unsigned long size)
		536	{
		537	return memset (g_slice_alloc (size), 0, size);
		538	}
		539
		540	void g_slice_free1 (unsigned long size, void *ptr)
		541	{
		542	//fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
		543	if (expect_true (ptr))
		544	{
		545	unsigned long p = (unsigned long )ptr;
		546	unsigned long s = *--p ^ MAGIC;
		547
		548	if (size != (unsigned long)(*p ^ MAGIC))
		549	{
		550	LOG (logBacktrace \| llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
		551	abort ();
		552	}
		553
		554	*p = MAGIC;
		555
		556	(g_slice_free1)(s + sizeof (unsigned long), p);
		557	}
		558	}
		559
		560	#endif
		561
		562	/******************************************************************************/
		563
596	void assign (char dst, const char src, int maxlen)	564	void assign (char dst, const char src, int maxlen)
597	{	565	{
598	if (!src)	566	if (!src)
599	src = "";	567	src = "";
600		568
…		…
615	}	583	}
616	else	584	else
617	memcpy (dst, src, len + 1);	585	memcpy (dst, src, len + 1);
618	}	586	}
619		587
		588	const char *
		589	format (const char *format, ...)
		590	{
		591	static dynbuf_text buf;
		592
		593	buf.clear ();
		594
		595	va_list ap;
		596	va_start (ap, format);
		597	buf.vprintf (format, ap);
		598	va_end (ap);
		599
		600	return buf;
		601	}
		602
620	tstamp now ()	603	tstamp now ()
621	{	604	{
622	struct timeval tv;	605	struct timeval tv;
623		606
624	gettimeofday (&tv, 0);	607	gettimeofday (&tv, 0);
…		…
633		616
634	int diff = (b - a) & 7;	617	int diff = (b - a) & 7;
635	return diff <= 1 \|\| diff >= 7;	618	return diff <= 1 \|\| diff >= 7;
636	}	619	}
637		620
		621	/* crc32 0xdebb20e3 table and supplementary functions. */
		622	extern const uint32_t crc_32_tab[256] =
		623	{
		624	0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
		625	0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
		626	0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
		627	0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
		628	0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
		629	0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
		630	0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
		631	0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
		632	0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
		633	0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
		634	0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
		635	0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
		636	0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
		637	0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
		638	0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
		639	0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
		640	0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
		641	0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
		642	0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
		643	0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
		644	0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
		645	0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
		646	0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
		647	0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
		648	0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
		649	0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
		650	0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
		651	0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
		652	0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
		653	0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
		654	0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
		655	0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
		656	0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
		657	0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
		658	0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
		659	0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
		660	0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
		661	0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
		662	0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
		663	0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
		664	0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
		665	0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
		666	0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
		667	0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
		668	0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
		669	0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
		670	0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
		671	0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
		672	0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
		673	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
		674	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
		675	0x2d02ef8dL
		676	};
		677
		678	void thread::start (void (start_routine)(void ), void arg)
		679	{
		680	pthread_attr_t attr;
		681
		682	pthread_attr_init (&attr);
		683	pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
		684	pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
		685	? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
		686	#ifdef PTHREAD_SCOPE_PROCESS
		687	pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
		688	#endif
		689
		690	sigset_t fullsigset, oldsigset;
		691	sigfillset (&fullsigset);
		692
		693	pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
		694
		695	if (pthread_create (&id, &attr, start_routine, arg))
		696	cleanup ("unable to create a new thread");
		697
		698	pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
		699	}
		700

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.45 by root, Sat Jan 27 02:19:36 2007 UTC vs. Revision 1.84 by root, Tue Dec 30 07:24:16 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.45 by root, Sat Jan 27 02:19:36 2007 UTC vs.
Revision 1.84 by root, Tue Dec 30 07:24:16 2008 UTC