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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.17 by root, Fri Nov 17 19:40:53 2006 UTC vs. Revision 1.80 by root, Wed Sep 10 18:18:10 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.17 by root, Fri Nov 17 19:40:53 2006 UTC vs.
Revision 1.80 by root, Wed Sep 10 18:18:10 2008 UTC