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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.51 by root, Mon Apr 23 18:09:57 2007 UTC vs.
Revision 1.75 by root, Tue Apr 15 03:16:02 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	*/
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	ssize_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] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;	48	state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
48	state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;	49	state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
49	state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;	50	state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
50	state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U;	51	state [3] = state [2] * 69069U; if (state [0] < 128U) 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
…		…
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	{
…		…
121	* for exp loss calculations for players changing religions.	122	* for exp loss calculations for players changing religions.
122	*/	123	*/
123	sint64	124	sint64
124	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)	125	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
125	{	126	{
126	sint64 omin, diff, luck, ran;
127	int base;
128
129	omin = min;	127	sint64 omin = min;
130	diff = max - min + 1;	128	sint64 diff = max - min + 1;
131	((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 */
132		130
133	if (max < 1 \|\| diff < 1)	131	if (diff < 0)
134	{	132	{
135	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);
136	return (min); /* avoids a float exception */	134	return (min); /* avoids a float exception */
137	}	135	}
138		136
139	/*	137	/*
140	* Make a call to get two 32 bit unsigned random numbers, and just to	138	* Make a call to get two 32 bit unsigned random numbers, and just to
141	* a little bitshifting.	139	* a little bitshifting.
142	*/	140	*/
143	ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);	141	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
144		142
145	if (op->type != PLAYER)	143	if (op->type != PLAYER)
146	return ((ran % diff) + min);	144	return ((ran % diff) + min);
147		145
148	luck = op->stats.luck;	146	int luck = op->stats.luck;
		147
149	if (rndm (base) < MIN (10, abs (luck)))	148	if (rndm (base) < MIN (10, abs (luck)))
150	{	149	{
151	/* we have a winner */	150	/* we have a winner */
152	((luck > 0) ? (luck = 1) : (luck = -1));	151	((luck > 0) ? (luck = 1) : (luck = -1));
153	diff -= luck;	152	diff -= luck;
154	if (diff < 1)	153	if (diff < 1)
155	return (omin); /check again /	154	return (omin); /check again /
		155
156	((goodbad) ? (min += luck) : (diff));	156	((goodbad) ? (min += luck) : (diff));
157		157
158	return (MAX (omin, MIN (max, (ran % diff) + min)));	158	return (MAX (omin, MIN (max, (ran % diff) + min)));
159	}	159	}
160		160
161	return ((ran % diff) + min);	161	return ran % diff + min;
162	}	162	}
163		163
164	/*	164	/*
165	* 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,
166	* 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.
167	* Generally, op should be the player/caster/hitter requesting the roll,	167	* Generally, op should be the player/caster/hitter requesting the roll,
168	* not the recipient (ie, the poor slob getting hit).	168	* not the recipient (ie, the poor slob getting hit).
169	* The args are num D size (ie 4d6) [garbled 20010916]	169	* The args are num D size (ie 4d6) [garbled 20010916]
170	*/	170	*/
171
172	int	171	int
173	die_roll (int num, int size, const object *op, int goodbad)	172	die_roll (int num, int size, const object *op, int goodbad)
174	{	173	{
175	int min, diff, luck, total, i, gotlucky, base;	174	int min, luck, total, i, gotlucky;
176		175
177	diff = size;	176	int diff = size;
178	min = 1;	177	min = 1;
179	luck = total = gotlucky = 0;	178	luck = total = gotlucky = 0;
180	((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
181	if (size < 2 \|\| diff < 1)	181	if (size < 2 \|\| diff < 1)
182	{	182	{
183	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);
184	return (num); /* avoids a float exception */	184	return num; /* avoids a float exception */
185	}	185	}
186		186
187	if (op->type == PLAYER)	187	if (op->type == PLAYER)
188	luck = op->stats.luck;	188	luck = op->stats.luck;
189		189
…		…
205	}	205	}
206		206
207	return total;	207	return total;
208	}	208	}
209		209
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->materials;
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 */	210	/* convert materialname to materialtype_t */
279		211
280	materialtype_t *	212	materialtype_t *
281	name_to_material (const shstr &name)	213	name_to_material (const shstr &name)
282	{	214	{
283	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)	215	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
284	if (name == mt->name)	216	if (name == mt->name)
285	return mt;	217	return mt;
286		218
287	return materialt;	219	return 0;
288	}	220	}
289		221
290	/* when doing transmutation of objects, we have to recheck the resistances,	222	/* when doing transmutation of objects, we have to recheck the resistances,
291	* as some that did not apply previously, may apply now.	223	* as some that did not apply previously, may apply now.
292	*/	224	*/
293
294	void	225	void
295	transmute_materialname (object op, const object change)	226	transmute_materialname (object op, const object change)
296	{	227	{
297	materialtype_t *mt;	228	materialtype_t *mt;
298	int j;	229	int j;
…		…
307	return;	238	return;
308		239
309	mt = name_to_material (op->materialname);	240	mt = name_to_material (op->materialname);
310	if (!mt)	241	if (!mt)
311	{	242	{
312	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);
313	return;	244	return;
314	}	245	}
315		246
316	for (j = 0; j < NROFATTACKS; j++)	247	for (j = 0; j < NROFATTACKS; j++)
317	if (op->resist[j] == 0 && change->resist[j] != 0)	248	if (op->resist[j] == 0 && change->resist[j] != 0)
…		…
328	void	259	void
329	set_materialname (object op, int difficulty, materialtype_t nmt)	260	set_materialname (object op, int difficulty, materialtype_t nmt)
330	{	261	{
331	materialtype_t mt, lmt;	262	materialtype_t mt, lmt;
332		263
333	#ifdef NEW_MATERIAL_CODE
334	int j;
335	#endif
336
337	if (op->materialname != NULL)	264	if (op->materialname != NULL)
338	return;	265	return;
339		266
340
341
342	if (nmt == NULL)	267	if (nmt == NULL)
343	{	268	{
344	lmt = NULL;	269	lmt = NULL;
345	#ifndef NEW_MATERIAL_CODE	270
346	for (mt = materialt; mt && mt->next; mt = mt->next)	271	for (mt = materialt; mt && mt->next; mt = mt->next)
347	{	272	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
348	if (op->materials & mt->material)	273	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
349	{	274	{
350	lmt = mt;	275	lmt = mt;
		276	if (!(op->is_weapon () \|\| op->is_armor ()))
351	break;	277	break;
352	}	278	}
353	}
354
355	#else
356	for (mt = materialt; mt && mt->next; mt = mt->next)
357	{
358	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
359	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
360	{
361	lmt = mt;
362	if (!(op->is_weapon () \|\| op->is_armor ()))
363	break;
364	}
365	}
366	#endif
367	}	279	}
368	else	280	else
369	{
370	lmt = nmt;	281	lmt = nmt;
371	}
372		282
373	if (lmt != NULL)	283	if (lmt != NULL)
374	{	284	{
375	#ifndef NEW_MATERIAL_CODE
376	op->materialname = lmt->name;
377	return;
378	#else
379
380	if (op->stats.dam && op->is_weapon ())	285	if (op->stats.dam && op->is_weapon ())
381	{	286	{
382	op->stats.dam += lmt->damage;	287	op->stats.dam += lmt->damage;
383	if (op->stats.dam < 1)	288	if (op->stats.dam < 1)
384	op->stats.dam = 1;	289	op->stats.dam = 1;
…		…
390	op->stats.wc += lmt->wc;	295	op->stats.wc += lmt->wc;
391	if (op->is_armor ())	296	if (op->is_armor ())
392	{	297	{
393	if (op->stats.ac)	298	if (op->stats.ac)
394	op->stats.ac += lmt->ac;	299	op->stats.ac += lmt->ac;
		300
395	for (j = 0; j < NROFATTACKS; j++)	301	for (int j = 0; j < NROFATTACKS; j++)
396	if (op->resist[j] != 0)	302	if (op->resist[j] != 0)
397	{	303	{
398	op->resist[j] += lmt->mod[j];	304	op->resist[j] += lmt->mod[j];
399	if (op->resist[j] > 100)	305	if (op->resist[j] > 100)
400	op->resist[j] = 100;	306	op->resist[j] = 100;
401	if (op->resist[j] < -100)	307	if (op->resist[j] < -100)
402	op->resist[j] = -100;	308	op->resist[j] = -100;
403	}	309	}
404	}	310	}
		311
405	op->materialname = lmt->name;	312	op->materialname = lmt->name;
406	/* dont make it unstackable if it doesn't need to be */	313	/* dont make it unstackable if it doesn't need to be */
407	if (op->is_weapon () \|\| op->is_armor ())	314	if (op->is_weapon () \|\| op->is_armor ())
408	{	315	{
409	op->weight = (op->weight * lmt->weight) / 100;	316	op->weight = (op->weight * lmt->weight) / 100;
410	op->value = (op->value * lmt->value) / 100;	317	op->value = (op->value * lmt->value) / 100;
411	}	318	}
412	#endif
413	}	319	}
414	}	320	}
415		321
416	/*	322	/*
417	* Strip out the media tags from a String.	323	* Strip out the media tags from a String.
…		…
512	* 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
513	* 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.
514	* This function will also strip all trailing non alphanumeric characters.	420	* This function will also strip all trailing non alphanumeric characters.
515	* It does not insert an oxford comma.	421	* It does not insert an oxford comma.
516	*/	422	*/
517
518	void	423	void
519	make_list_like (char *input)	424	make_list_like (char *input)
520	{	425	{
521	char *p, tmp[MAX_BUF];	426	char *p, tmp[MAX_BUF];
522	int i;	427	int i;
…		…
553	fork_abort (const char *msg)	458	fork_abort (const char *msg)
554	{	459	{
555	if (!fork ())	460	if (!fork ())
556	{	461	{
557	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");
558	abort ();	466	abort ();
559	}	467	}
560		468
561	LOG (llevError, "fork abort: %s\n", msg);	469	LOG (llevError, "fork abort: %s\n", msg);
562	}	470	}
563		471
564	void *salloc_ (int n) throw (std::bad_alloc)	472	void *salloc_ (int n) throw (std::bad_alloc)
565	{	473	{
566	#ifdef PREFER_MALLOC
567	void *ptr = malloc (n);
568	#else
569	void *ptr = g_slice_alloc (n);	474	void *ptr = g_slice_alloc (n);
570	#endif
571		475
572	if (!ptr)	476	if (!ptr)
573	throw std::bad_alloc ();	477	throw std::bad_alloc ();
574		478
		479	slice_alloc += n;
575	return ptr;	480	return ptr;
576	}	481	}
577		482
578	void salloc_ (int n, void src) throw (std::bad_alloc)	483	void salloc_ (int n, void src) throw (std::bad_alloc)
579	{	484	{
…		…
585	memset (ptr, 0, n);	490	memset (ptr, 0, n);
586		491
587	return ptr;	492	return ptr;
588	}	493	}
589		494
		495	/******************************************************************************/
		496
		497	#if DEBUG_SALLOC
		498
		499	#define MAGIC 0xa1b2c35543deadLL
		500
		501	void *g_slice_alloc (unsigned long size)
		502	{
		503	unsigned long p = (unsigned long ) (g_slice_alloc)(size + sizeof (unsigned long));
		504	*p++ = size ^ MAGIC;
		505	//fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
		506	return (void *)p;
		507	}
		508
		509	void *g_slice_alloc0 (unsigned long size)
		510	{
		511	return memset (g_slice_alloc (size), 0, size);
		512	}
		513
		514	void g_slice_free1 (unsigned long size, void *ptr)
		515	{
		516	//fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
		517	if (expect_true (ptr))
		518	{
		519	unsigned long p = (unsigned long )ptr;
		520	unsigned long s = *--p ^ MAGIC;
		521
		522	if (size != (unsigned long)(*p ^ MAGIC))
		523	{
		524	LOG (logBacktrace \| llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
		525	abort ();
		526	}
		527
		528	*p = MAGIC;
		529
		530	(g_slice_free1)(s + sizeof (unsigned long), p);
		531	}
		532	}
		533
		534	#endif
		535
		536	/******************************************************************************/
		537
590	void assign (char dst, const char src, int maxlen)	538	void assign (char dst, const char src, int maxlen)
591	{	539	{
592	if (!src)	540	if (!src)
593	src = "";	541	src = "";
594		542
…		…
609	}	557	}
610	else	558	else
611	memcpy (dst, src, len + 1);	559	memcpy (dst, src, len + 1);
612	}	560	}
613		561
614	const std::string	562	const char *
615	format (const char *format, ...)	563	format (const char *format, ...)
616	{	564	{
617	int len;	565	static dynbuf_text buf;
618		566
619	{	567	buf.clear ();
620	char buf[128];
621		568
622	va_list ap;	569	va_list ap;
623	va_start (ap, format);	570	va_start (ap, format);
624	len = vsnprintf (buf, sizeof (buf), format, ap);	571	buf.vprintf (format, ap);
625	va_end (ap);	572	va_end (ap);
626		573
627	assert (len >= 0); // shield againstz broken vsnprintf's
628
629	// was our static buffer short enough?
630	if (len < sizeof (buf))
631	return std::string (buf, len);
632	}
633
634	{
635	// longer, try harder
636	char *buf = salloc<char> (len + 1);
637
638	va_list ap;
639	va_start (ap, format);
640	vsnprintf (buf, len + 1, format, ap);
641	va_end (ap);
642
643	const std::string s (buf, len);
644	sfree<char> (buf, len + 1);
645
646	return buf;	574	return buf;
647	}
648	}	575	}
649		576
650	tstamp now ()	577	tstamp now ()
651	{	578	{
652	struct timeval tv;	579	struct timeval tv;
…		…
720	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,	647	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
721	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,	648	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
722	0x2d02ef8dL	649	0x2d02ef8dL
723	};	650	};
724		651
		652	void thread::start (void (start_routine)(void ), void arg)
		653	{
		654	pthread_attr_t attr;
725		655
		656	pthread_attr_init (&attr);
		657	pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
		658	pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
		659	? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
		660	#ifdef PTHREAD_SCOPE_PROCESS
		661	pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
		662	#endif
		663
		664	sigset_t fullsigset, oldsigset;
		665	sigfillset (&fullsigset);
		666
		667	pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
		668
		669	if (pthread_create (&id, &attr, start_routine, arg))
		670	cleanup ("unable to create a new thread");
		671
		672	pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
		673	}
		674

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.51 by root, Mon Apr 23 18:09:57 2007 UTC vs. Revision 1.75 by root, Tue Apr 15 03:16:02 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.51 by root, Mon Apr 23 18:09:57 2007 UTC vs.
Revision 1.75 by root, Tue Apr 15 03:16:02 2008 UTC