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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.28 by root, Sat Dec 23 16:05:19 2006 UTC vs. Revision 1.83 by root, Sun Dec 28 06:59:26 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.28 by root, Sat Dec 23 16:05:19 2006 UTC vs.
Revision 1.83 by root, Sun Dec 28 06:59:26 2008 UTC