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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.44 by root, Thu Jan 25 03:54:44 2007 UTC vs.
Revision 1.73 by root, Wed Apr 2 11:13:53 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 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	*/
37	#include <funcpoint.h>	36	#include <funcpoint.h>
38	#include <material.h>	37	#include <material.h>
39		38
40	#include <glib.h>	39	#include <glib.h>
41		40
		41	refcnt_base::refcnt_t refcnt_dummy;
		42	size_t slice_alloc;
42	rand_gen rndm;	43	rand_gen rndm;
43		44
44	void	45	void
45	tausworthe_random_generator::seed (uint32_t seed)	46	tausworthe_random_generator::seed (uint32_t seed)
46	{	47	{
47	state [0] = max ( 2U, seed * 69069U);	48	state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
48	state [1] = max ( 8U, state [0] * 69069U);	49	state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
49	state [2] = max ( 16U, state [1] * 69069U);	50	state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
50	state [3] = max (128U, state [2] * 69069U);	51	state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U;
51		52
52	for (int i = 11; --i; )	53	for (int i = 11; --i; )
53	operator ()();	54	operator ()();
54	}	55	}
55		56
…		…
63		64
64	return state [0] ^ state [1] ^ state [2] ^ state [3];	65	return state [0] ^ state [1] ^ state [2] ^ state [3];
65	}	66	}
66		67
67	uint32_t	68	uint32_t
68	tausworthe_random_generator::get_range (uint32_t r_max)	69	tausworthe_random_generator::get_range (uint32_t num)
69	{	70	{
70	return next () % r_max;	71	return (next () * (uint64_t)num) >> 32U;
71	}	72	}
72		73
73	// return a number within (min .. max)	74	// return a number within (min .. max)
74	int	75	int
75	tausworthe_random_generator::get_range (int r_min, int r_max)	76	tausworthe_random_generator::get_range (int r_min, int r_max)
76	{	77	{
77	return r_min + (*this) (max (r_max - r_min + 1, 1));	78	return r_min + get_range (max (r_max - r_min + 1, 0));
78	}	79	}
79		80
80	/*	81	/*
81	* The random functions here take luck into account when rolling random	82	* 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	83	* dice or numbers. This function has less of an impact the larger the
…		…
95	int	96	int
96	random_roll (int r_min, int r_max, const object *op, int goodbad)	97	random_roll (int r_min, int r_max, const object *op, int goodbad)
97	{	98	{
98	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */	99	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
99		100
100	if (r_max < 1 \|\| r_max < r_min)	101	if (r_max < r_min)
101	{	102	{
102	LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max);	103	LOG (llevError \| logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
103	return r_min;	104	return r_min;
104	}	105	}
105		106
106	if (op->type == PLAYER)	107	if (op->type == PLAYER)
107	{	108	{
…		…
118		119
119	/*	120	/*
120	* This is a 64 bit version of random_roll above. This is needed	121	* This is a 64 bit version of random_roll above. This is needed
121	* for exp loss calculations for players changing religions.	122	* for exp loss calculations for players changing religions.
122	*/	123	*/
123
124	sint64	124	sint64
125	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)	125	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
126	{	126	{
127	sint64 omin, diff, luck, ran;
128	int base;
129
130	omin = min;	127	sint64 omin = min;
131	diff = max - min + 1;	128	sint64 diff = max - min + 1;
132	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	129	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
133		130
134	if (max < 1 \|\| diff < 1)	131	if (diff < 0)
135	{	132	{
136	LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);	133	LOG (llevError \| logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max);
137	return (min); /* avoids a float exception */	134	return (min); /* avoids a float exception */
138	}	135	}
139		136
140	/* Don't know of a portable call to get 64 bit random values.	137	/*
141	* So make a call to get two 32 bit random numbers, and just to	138	* Make a call to get two 32 bit unsigned random numbers, and just to
142	* a little byteshifting. Do make sure the first one is only	139	* a little bitshifting.
143	* 32 bit, so we don't get skewed results
144	*/	140	*/
145	ran = (RANDOM () & 0xffffffff) \| ((sint64) RANDOM () << 32);	141	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
146		142
147	if (op->type != PLAYER)	143	if (op->type != PLAYER)
148	return ((ran % diff) + min);	144	return ((ran % diff) + min);
149		145
150	luck = op->stats.luck;	146	int luck = op->stats.luck;
		147
151	if (RANDOM () % base < MIN (10, abs (luck)))	148	if (rndm (base) < MIN (10, abs (luck)))
152	{	149	{
153	/* we have a winner */	150	/* we have a winner */
154	((luck > 0) ? (luck = 1) : (luck = -1));	151	((luck > 0) ? (luck = 1) : (luck = -1));
155	diff -= luck;	152	diff -= luck;
156	if (diff < 1)	153	if (diff < 1)
157	return (omin); /check again /	154	return (omin); /check again /
		155
158	((goodbad) ? (min += luck) : (diff));	156	((goodbad) ? (min += luck) : (diff));
159		157
160	return (MAX (omin, MIN (max, (ran % diff) + min)));	158	return (MAX (omin, MIN (max, (ran % diff) + min)));
161	}	159	}
		160
162	return ((ran % diff) + min);	161	return ran % diff + min;
163	}	162	}
164		163
165	/*	164	/*
166	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,	165	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,
167	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.	166	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.
168	* Generally, op should be the player/caster/hitter requesting the roll,	167	* Generally, op should be the player/caster/hitter requesting the roll,
169	* not the recipient (ie, the poor slob getting hit).	168	* not the recipient (ie, the poor slob getting hit).
170	* The args are num D size (ie 4d6) [garbled 20010916]	169	* The args are num D size (ie 4d6) [garbled 20010916]
171	*/	170	*/
172
173	int	171	int
174	die_roll (int num, int size, const object *op, int goodbad)	172	die_roll (int num, int size, const object *op, int goodbad)
175	{	173	{
176	int min, diff, luck, total, i, gotlucky, base, ran;	174	int min, luck, total, i, gotlucky;
177		175
178	diff = size;	176	int diff = size;
179	min = 1;	177	min = 1;
180	luck = total = gotlucky = 0;	178	luck = total = gotlucky = 0;
181	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	179	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
		180
182	if (size < 2 \|\| diff < 1)	181	if (size < 2 \|\| diff < 1)
183	{	182	{
184	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);	183	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
185	return (num); /* avoids a float exception */	184	return num; /* avoids a float exception */
186	}	185	}
187		186
188	if (op->type == PLAYER)	187	if (op->type == PLAYER)
189	luck = op->stats.luck;	188	luck = op->stats.luck;
190		189
191	for (i = 0; i < num; i++)	190	for (i = 0; i < num; i++)
192	{	191	{
193	if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)	192	if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
194	{	193	{
195	/* we have a winner */	194	/* we have a winner */
196	gotlucky++;	195	gotlucky++;
197	((luck > 0) ? (luck = 1) : (luck = -1));	196	((luck > 0) ? (luck = 1) : (luck = -1));
198	diff -= luck;	197	diff -= luck;
199	if (diff < 1)	198	if (diff < 1)
200	return (num); /check again /	199	return (num); /check again /
201	((goodbad) ? (min += luck) : (diff));	200	((goodbad) ? (min += luck) : (diff));
202	ran = RANDOM ();
203	total += MAX (1, MIN (size, (ran % diff) + min));	201	total += MAX (1, MIN (size, rndm (diff) + min));
204	}	202	}
205	else	203	else
206	{
207	total += RANDOM () % size + 1;	204	total += rndm (size) + 1;
208	}
209	}	205	}
		206
210	return (total);	207	return total;
211	}
212
213	/* decay and destroy perishable items in a map */
214	void
215	maptile::decay_objects ()
216	{
217	if (!spaces)
218	return;
219
220	for (mapspace *ms = spaces + size (); ms-- > spaces; )
221	for (object above, op = ms->bot; op; op = above)
222	{
223	above = op->above;
224
225	bool destroy = 0;
226
227	// do not decay anything above unique floor tiles (yet :)
228	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
229	break;
230
231	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
232	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
233	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
234	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
235	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
236	\|\| QUERY_FLAG (op, FLAG_UNPAID)
237	\|\| op->is_alive ())
238	; // do not decay
239	else if (op->is_weapon ())
240	{
241	op->stats.dam--;
242	if (op->stats.dam < 0)
243	destroy = 1;
244	}
245	else if (op->is_armor ())
246	{
247	op->stats.ac--;
248	if (op->stats.ac < 0)
249	destroy = 1;
250	}
251	else if (op->type == FOOD)
252	{
253	op->stats.food -= rndm (5, 20);
254	if (op->stats.food < 0)
255	destroy = 1;
256	}
257	else
258	{
259	int mat = op->material;
260
261	if (mat & M_PAPER
262	\|\| mat & M_LEATHER
263	\|\| mat & M_WOOD
264	\|\| mat & M_ORGANIC
265	\|\| mat & M_CLOTH
266	\|\| mat & M_LIQUID
267	\|\| (mat & M_IRON && rndm (1, 5) == 1)
268	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
269	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
270	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
271	\|\| (mat & M_ICE && temp > 32))
272	destroy = 1;
273	}
274
275	/* adjust overall chance below */
276	if (destroy && rndm (0, 1))
277	op->destroy ();
278	}
279	}	208	}
280		209
281	/* convert materialname to materialtype_t */	210	/* convert materialname to materialtype_t */
282		211
283	materialtype_t *	212	materialtype_t *
284	name_to_material (const char *name)	213	name_to_material (const shstr &name)
285	{	214	{
286	materialtype_t mt, nmt;	215	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
		216	if (name == mt->name)
		217	return mt;
287		218
288	mt = NULL;
289	for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
290	{
291	if (strcmp (name, nmt->name) == 0)
292	{
293	mt = nmt;
294	break;
295	}
296	}
297	return mt;	219	return 0;
298	}	220	}
299		221
300	/* when doing transmutation of objects, we have to recheck the resistances,	222	/* when doing transmutation of objects, we have to recheck the resistances,
301	* as some that did not apply previously, may apply now.	223	* as some that did not apply previously, may apply now.
302	*/	224	*/
303
304	void	225	void
305	transmute_materialname (object op, const object change)	226	transmute_materialname (object op, const object change)
306	{	227	{
307	materialtype_t *mt;	228	materialtype_t *mt;
308	int j;	229	int j;
…		…
317	return;	238	return;
318		239
319	mt = name_to_material (op->materialname);	240	mt = name_to_material (op->materialname);
320	if (!mt)	241	if (!mt)
321	{	242	{
322	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);	243	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
323	return;	244	return;
324	}	245	}
325		246
326	for (j = 0; j < NROFATTACKS; j++)	247	for (j = 0; j < NROFATTACKS; j++)
327	if (op->resist[j] == 0 && change->resist[j] != 0)	248	if (op->resist[j] == 0 && change->resist[j] != 0)
…		…
338	void	259	void
339	set_materialname (object op, int difficulty, materialtype_t nmt)	260	set_materialname (object op, int difficulty, materialtype_t nmt)
340	{	261	{
341	materialtype_t mt, lmt;	262	materialtype_t mt, lmt;
342		263
343	#ifdef NEW_MATERIAL_CODE
344	int j;
345	#endif
346
347	if (op->materialname != NULL)	264	if (op->materialname != NULL)
348	return;	265	return;
349		266
350
351
352	if (nmt == NULL)	267	if (nmt == NULL)
353	{	268	{
354	lmt = NULL;	269	lmt = NULL;
355	#ifndef NEW_MATERIAL_CODE	270
356	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)	271	for (mt = materialt; mt && mt->next; mt = mt->next)
357	{	272	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
358	if (op->material & mt->material)	273	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
359	{	274	{
360	lmt = mt;	275	lmt = mt;
		276	if (!(op->is_weapon () \|\| op->is_armor ()))
361	break;	277	break;
362	}	278	}
363	}
364
365	#else
366	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
367	{
368	if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
369	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
370	{
371	lmt = mt;
372	if (!(op->is_weapon () \|\| op->is_armor ()))
373	break;
374	}
375	}
376	#endif
377	}	279	}
378	else	280	else
379	{
380	lmt = nmt;	281	lmt = nmt;
381	}
382		282
383	if (lmt != NULL)	283	if (lmt != NULL)
384	{	284	{
385	#ifndef NEW_MATERIAL_CODE
386	op->materialname = lmt->name;
387	return;
388	#else
389
390	if (op->stats.dam && op->is_weapon ())	285	if (op->stats.dam && op->is_weapon ())
391	{	286	{
392	op->stats.dam += lmt->damage;	287	op->stats.dam += lmt->damage;
393	if (op->stats.dam < 1)	288	if (op->stats.dam < 1)
394	op->stats.dam = 1;	289	op->stats.dam = 1;
395	}	290	}
		291
396	if (op->stats.sp && op->type == BOW)	292	if (op->stats.sp && op->type == BOW)
397	op->stats.sp += lmt->sp;	293	op->stats.sp += lmt->sp;
398	if (op->stats.wc && op->is_weapon ())	294	if (op->stats.wc && op->is_weapon ())
399	op->stats.wc += lmt->wc;	295	op->stats.wc += lmt->wc;
400	if (op->is_armor ())	296	if (op->is_armor ())
401	{	297	{
402	if (op->stats.ac)	298	if (op->stats.ac)
403	op->stats.ac += lmt->ac;	299	op->stats.ac += lmt->ac;
		300
404	for (j = 0; j < NROFATTACKS; j++)	301	for (int j = 0; j < NROFATTACKS; j++)
405	if (op->resist[j] != 0)	302	if (op->resist[j] != 0)
406	{	303	{
407	op->resist[j] += lmt->mod[j];	304	op->resist[j] += lmt->mod[j];
408	if (op->resist[j] > 100)	305	if (op->resist[j] > 100)
409	op->resist[j] = 100;	306	op->resist[j] = 100;
410	if (op->resist[j] < -100)	307	if (op->resist[j] < -100)
411	op->resist[j] = -100;	308	op->resist[j] = -100;
412	}	309	}
413	}	310	}
		311
414	op->materialname = add_string (lmt->name);	312	op->materialname = lmt->name;
415	/* dont make it unstackable if it doesn't need to be */	313	/* dont make it unstackable if it doesn't need to be */
416	if (op->is_weapon () \|\| op->is_armor ())	314	if (op->is_weapon () \|\| op->is_armor ())
417	{	315	{
418	op->weight = (op->weight * lmt->weight) / 100;	316	op->weight = (op->weight * lmt->weight) / 100;
419	op->value = (op->value * lmt->value) / 100;	317	op->value = (op->value * lmt->value) / 100;
420	}	318	}
421	#endif
422	}	319	}
423	}	320	}
424		321
425	/*	322	/*
426	* Strip out the media tags from a String.	323	* Strip out the media tags from a String.
…		…
521	* a 'list' for the purposes here, is a string of items, seperated by commas, except	418	* a 'list' for the purposes here, is a string of items, seperated by commas, except
522	* for the last entry, which has an 'and' before it, and a full stop (period) after it.	419	* for the last entry, which has an 'and' before it, and a full stop (period) after it.
523	* This function will also strip all trailing non alphanumeric characters.	420	* This function will also strip all trailing non alphanumeric characters.
524	* It does not insert an oxford comma.	421	* It does not insert an oxford comma.
525	*/	422	*/
526
527	void	423	void
528	make_list_like (char *input)	424	make_list_like (char *input)
529	{	425	{
530	char *p, tmp[MAX_BUF];	426	char *p, tmp[MAX_BUF];
531	int i;	427	int i;
…		…
562	fork_abort (const char *msg)	458	fork_abort (const char *msg)
563	{	459	{
564	if (!fork ())	460	if (!fork ())
565	{	461	{
566	signal (SIGABRT, SIG_DFL);	462	signal (SIGABRT, SIG_DFL);
		463	// try to put corefiles into a subdirectory, if existing, to allow
		464	// an administrator to reduce the I/O load.
		465	chdir ("cores");
567	abort ();	466	abort ();
568	}	467	}
569		468
570	LOG (llevError, "fork abort: %s\n", msg);	469	LOG (llevError, "fork abort: %s\n", msg);
571	}	470	}
572		471
573	void *salloc_ (int n) throw (std::bad_alloc)	472	void *salloc_ (int n) throw (std::bad_alloc)
574	{	473	{
575	#ifdef PREFER_MALLOC	474	#if PREFER_MALLOC
576	void *ptr = malloc (n);	475	void *ptr = malloc (n);
577	#else	476	#else
		477	slice_alloc += n;
578	void *ptr = g_slice_alloc (n);	478	void *ptr = g_slice_alloc (n);
579	#endif	479	#endif
580		480
581	if (!ptr)	481	if (!ptr)
582	throw std::bad_alloc ();	482	throw std::bad_alloc ();
…		…
594	memset (ptr, 0, n);	494	memset (ptr, 0, n);
595		495
596	return ptr;	496	return ptr;
597	}	497	}
598		498
		499	/******************************************************************************/
		500
		501	#if DEBUG_SALLOC
		502
		503	#define MAGIC 0xa1b2c35543deadLL
		504
		505	void *g_slice_alloc (unsigned long size)
		506	{
		507	unsigned long p = (unsigned long ) (g_slice_alloc)(size + sizeof (unsigned long));
		508	*p++ = size ^ MAGIC;
		509	//fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
		510	return (void *)p;
		511	}
		512
		513	void *g_slice_alloc0 (unsigned long size)
		514	{
		515	return memset (g_slice_alloc (size), 0, size);
		516	}
		517
		518	void g_slice_free1 (unsigned long size, void *ptr)
		519	{
		520	if (expect_true (ptr))
		521	{
		522	//fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
		523	unsigned long p = (unsigned long )ptr;
		524	unsigned long s = *--p ^ MAGIC;
		525
		526	if (size != (unsigned long)(*p ^ MAGIC))
		527	LOG (logBacktrace \| llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
		528
		529	*p = MAGIC;
		530
		531	(g_slice_free1)(s + sizeof (unsigned long), p);
		532	}
		533	}
		534
		535	#endif
		536
		537	/******************************************************************************/
		538
599	void assign (char dst, const char src, int maxlen)	539	void assign (char dst, const char src, int maxlen)
600	{	540	{
601	if (!src)	541	if (!src)
602	src = "";	542	src = "";
603		543
…		…
618	}	558	}
619	else	559	else
620	memcpy (dst, src, len + 1);	560	memcpy (dst, src, len + 1);
621	}	561	}
622		562
		563	const char *
		564	format (const char *format, ...)
		565	{
		566	static dynbuf_text buf;
		567
		568	buf.clear ();
		569
		570	va_list ap;
		571	va_start (ap, format);
		572	buf.vprintf (format, ap);
		573	va_end (ap);
		574
		575	return buf;
		576	}
		577
623	tstamp now ()	578	tstamp now ()
624	{	579	{
625	struct timeval tv;	580	struct timeval tv;
626		581
627	gettimeofday (&tv, 0);	582	gettimeofday (&tv, 0);
…		…
636		591
637	int diff = (b - a) & 7;	592	int diff = (b - a) & 7;
638	return diff <= 1 \|\| diff >= 7;	593	return diff <= 1 \|\| diff >= 7;
639	}	594	}
640		595
		596	/* crc32 0xdebb20e3 table and supplementary functions. */
		597	extern const uint32_t crc_32_tab[256] =
		598	{
		599	0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
		600	0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
		601	0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
		602	0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
		603	0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
		604	0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
		605	0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
		606	0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
		607	0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
		608	0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
		609	0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
		610	0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
		611	0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
		612	0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
		613	0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
		614	0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
		615	0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
		616	0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
		617	0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
		618	0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
		619	0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
		620	0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
		621	0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
		622	0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
		623	0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
		624	0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
		625	0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
		626	0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
		627	0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
		628	0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
		629	0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
		630	0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
		631	0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
		632	0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
		633	0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
		634	0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
		635	0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
		636	0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
		637	0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
		638	0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
		639	0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
		640	0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
		641	0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
		642	0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
		643	0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
		644	0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
		645	0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
		646	0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
		647	0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
		648	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
		649	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
		650	0x2d02ef8dL
		651	};
		652
		653	void thread::start (void (start_routine)(void ), void arg)
		654	{
		655	sigset_t fullsigset, oldsigset;
		656	sigfillset (&fullsigset);
		657
		658	pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
		659
		660	if (pthread_create (&id, 0, start_routine, arg))
		661	cleanup ("unable to create a new thread");
		662
		663	pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
		664	}

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.44 by root, Thu Jan 25 03:54:44 2007 UTC vs. Revision 1.73 by root, Wed Apr 2 11:13:53 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.44 by root, Thu Jan 25 03:54:44 2007 UTC vs.
Revision 1.73 by root, Wed Apr 2 11:13:53 2008 UTC