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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.20 by root, Mon Dec 11 21:32:16 2006 UTC vs.
Revision 1.82 by root, Thu Sep 11 12:43:17 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	LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
103	return (min); /* avoids a float exception */
104	}
105
106	/* Don't know of a portable call to get 64 bit random values.
107	* 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
108	* a little byteshifting. Do make sure the first one is only	131	* a little bitshifting.
109	* 32 bit, so we don't get skewed results
110	*/	132	*/
111	ran = (RANDOM () & 0xffffffff) \| ((sint64) RANDOM () << 32);	133	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
112		134
113	if (op->type != PLAYER)	135	if (op->type != PLAYER)
114	return ((ran % diff) + min);	136	return ((ran % range) + r_min);
115		137
116	luck = op->stats.luck;	138	int luck = op->stats.luck;
		139
117	if (RANDOM () % base < MIN (10, abs (luck)))	140	if (rndm (base) < min (10, abs (luck)))
118	{	141	{
119	/* we have a winner */	142	/* we have a winner */
120	((luck > 0) ? (luck = 1) : (luck = -1));	143	((luck > 0) ? (luck = 1) : (luck = -1));
121	diff -= luck;	144	range -= luck;
122	if (diff < 1)	145	if (range < 1)
123	return (omin); /check again /	146	return (omin); /check again /
		147
124	((goodbad) ? (min += luck) : (diff));	148	((goodbad) ? (r_min += luck) : (range));
125		149
126	return (MAX (omin, MIN (max, (ran % diff) + min)));	150	return (max (omin, min (r_max, (ran % range) + r_min)));
127	}	151	}
128	return ((ran % diff) + min);	152
		153	return ran % range + r_min;
129	}	154	}
130		155
131	/*	156	/*
132	* 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,
133	* 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.
134	* Generally, op should be the player/caster/hitter requesting the roll,	159	* Generally, op should be the player/caster/hitter requesting the roll,
135	* not the recipient (ie, the poor slob getting hit).	160	* not the recipient (ie, the poor slob getting hit).
136	* The args are num D size (ie 4d6) [garbled 20010916]	161	* The args are num D size (ie 4d6) [garbled 20010916]
137	*/	162	*/
138
139	int	163	int
140	die_roll (int num, int size, const object *op, int goodbad)	164	die_roll (int num, int size, const object *op, int goodbad)
141	{	165	{
142	int min, diff, luck, total, i, gotlucky, base, ran;	166	int min, luck, total, i, gotlucky;
143		167
144	diff = size;	168	int diff = size;
145	min = 1;	169	min = 1;
146	luck = total = gotlucky = 0;	170	luck = total = gotlucky = 0;
147	((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
148	if (size < 2 \|\| diff < 1)	173	if (size < 2 \|\| diff < 1)
149	{	174	{
150	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);
151	return (num); /* avoids a float exception */	176	return num; /* avoids a float exception */
152	}	177	}
153		178
154	if (op->type == PLAYER)	179	if (op->type == PLAYER)
155	luck = op->stats.luck;	180	luck = op->stats.luck;
156		181
157	for (i = 0; i < num; i++)	182	for (i = 0; i < num; i++)
158	{	183	{
159	if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)	184	if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
160	{	185	{
161	/* we have a winner */	186	/* we have a winner */
162	gotlucky++;	187	gotlucky++;
163	((luck > 0) ? (luck = 1) : (luck = -1));	188	((luck > 0) ? (luck = 1) : (luck = -1));
164	diff -= luck;	189	diff -= luck;
165	if (diff < 1)	190	if (diff < 1)
166	return (num); /check again /	191	return (num); /check again /
167	((goodbad) ? (min += luck) : (diff));	192	((goodbad) ? (min += luck) : (diff));
168	ran = RANDOM ();
169	total += MAX (1, MIN (size, (ran % diff) + min));	193	total += MAX (1, MIN (size, rndm (diff) + min));
170	}	194	}
171	else	195	else
172	{
173	total += RANDOM () % size + 1;	196	total += rndm (size) + 1;
174	}
175	}	197	}
		198
176	return (total);	199	return total;
177	}
178
179	/*
180	* Another convenience function. Returns a number between min and max.
181	* It is suggested one use these functions rather than RANDOM()%, as it
182	* would appear that a number of off-by-one-errors exist due to improper
183	* use of %. This should also prevent SIGFPE.
184	*/
185
186	int
187	rndm (int min, int max)
188	{
189	int diff;
190
191	diff = max - min + 1;
192	if (max < 1 \|\| diff < 1)
193	return (min);
194
195	return (RANDOM () % diff + min);
196	}
197
198	/* decay and destroy persihable items in a map */
199
200	void
201	decay_objects (maptile *m)
202	{
203	int x, y, destroy;
204	object op, otmp;
205
206	if (m->unique)
207	return;
208
209	for (x = 0; x < MAP_WIDTH (m); x++)
210	for (y = 0; y < MAP_HEIGHT (m); y++)
211	for (op = get_map_ob (m, x, y); op; op = otmp)
212	{
213	destroy = 0;
214	otmp = op->above;
215	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
216	break;
217	if (QUERY_FLAG (op, FLAG_IS_FLOOR) \|\|
218	QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) \|\|
219	QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) \|\|
220	QUERY_FLAG (op, FLAG_UNIQUE) \|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) \|\| QUERY_FLAG (op, FLAG_UNPAID) \|\| IS_LIVE (op))
221	continue;
222	/* otherwise, we decay and destroy */
223	if (IS_WEAPON (op))
224	{
225	op->stats.dam--;
226	if (op->stats.dam < 0)
227	destroy = 1;
228	}
229	else if (IS_ARMOR (op))
230	{
231	op->stats.ac--;
232	if (op->stats.ac < 0)
233	destroy = 1;
234	}
235	else if (op->type == FOOD)
236	{
237	op->stats.food -= rndm (5, 20);
238	if (op->stats.food < 0)
239	destroy = 1;
240	}
241	else
242	{
243	if (op->material & M_PAPER \|\| op->material & M_LEATHER \|\|
244	op->material & M_WOOD \|\| op->material & M_ORGANIC \|\| op->material & M_CLOTH \|\| op->material & M_LIQUID)
245	destroy = 1;
246	if (op->material & M_IRON && rndm (1, 5) == 1)
247	destroy = 1;
248	if (op->material & M_GLASS && rndm (1, 2) == 1)
249	destroy = 1;
250	if ((op->material & M_STONE \|\| op->material & M_ADAMANT) && rndm (1, 10) == 1)
251	destroy = 1;
252	if ((op->material & M_SOFT_METAL \|\| op->material & M_BONE) && rndm (1, 3) == 1)
253	destroy = 1;
254	if (op->material & M_ICE && MAP_TEMP (m) > 32)
255	destroy = 1;
256	}
257	/* adjust overall chance below */
258	if (destroy && rndm (0, 1))
259	{
260	remove_ob (op);
261	free_object (op);
262	}
263	}
264	}	200	}
265		201
266	/* convert materialname to materialtype_t */	202	/* convert materialname to materialtype_t */
267		203
268	materialtype_t *	204	materialtype_t *
269	name_to_material (const char *name)	205	name_to_material (const shstr &name)
270	{	206	{
271	materialtype_t mt, nmt;	207	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
		208	if (name == mt->name)
		209	return mt;
272		210
273	mt = NULL;
274	for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
275	{
276	if (strcmp (name, nmt->name) == 0)
277	{
278	mt = nmt;
279	break;
280	}
281	}
282	return mt;	211	return 0;
283	}	212	}
284		213
285	/* when doing transmutation of objects, we have to recheck the resistances,	214	/* when doing transmutation of objects, we have to recheck the resistances,
286	* as some that did not apply previously, may apply now.	215	* as some that did not apply previously, may apply now.
287	*/	216	*/
288
289	void	217	void
290	transmute_materialname (object op, const object change)	218	transmute_materialname (object op, const object change)
291	{	219	{
292	materialtype_t *mt;	220	materialtype_t *mt;
293	int j;	221	int j;
…		…
296	return;	224	return;
297		225
298	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))	226	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
299	return;	227	return;
300		228
301	if (!IS_ARMOR (op))	229	if (!op->is_armor ())
302	return;	230	return;
303		231
304	mt = name_to_material (op->materialname);	232	mt = name_to_material (op->materialname);
305	if (!mt)	233	if (!mt)
306	{	234	{
307	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);
308	return;	236	return;
309	}	237	}
310		238
311	for (j = 0; j < NROFATTACKS; j++)	239	for (j = 0; j < NROFATTACKS; j++)
312	if (op->resist[j] == 0 && change->resist[j] != 0)	240	if (op->resist[j] == 0 && change->resist[j] != 0)
…		…
323	void	251	void
324	set_materialname (object op, int difficulty, materialtype_t nmt)	252	set_materialname (object op, int difficulty, materialtype_t nmt)
325	{	253	{
326	materialtype_t mt, lmt;	254	materialtype_t mt, lmt;
327		255
328	#ifdef NEW_MATERIAL_CODE
329	int j;
330	#endif
331
332	if (op->materialname != NULL)	256	if (op->materialname != NULL)
333	return;	257	return;
334		258
335
336
337	if (nmt == NULL)	259	if (nmt == NULL)
338	{	260	{
339	lmt = NULL;	261	lmt = NULL;
340	#ifndef NEW_MATERIAL_CODE	262
341	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)	263	for (mt = materialt; mt && mt->next; mt = mt->next)
342	{	264	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
343	if (op->material & mt->material)	265	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
344	{	266	{
345	lmt = mt;	267	lmt = mt;
		268	if (!(op->is_weapon () \|\| op->is_armor ()))
346	break;	269	break;
347	}	270	}
348	}
349
350	#else
351	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
352	{
353	if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
354	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
355	{
356	lmt = mt;
357	if (!(IS_WEAPON (op) \|\| IS_ARMOR (op)))
358	break;
359	}
360	}
361	#endif
362	}	271	}
363	else	272	else
364	{
365	lmt = nmt;	273	lmt = nmt;
366	}
367		274
368	if (lmt != NULL)	275	if (lmt != NULL)
369	{	276	{
370	#ifndef NEW_MATERIAL_CODE	277	if (op->stats.dam && op->is_weapon ())
371	op->materialname = lmt->name;
372	return;
373	#else
374
375	if (op->stats.dam && IS_WEAPON (op))
376	{	278	{
377	op->stats.dam += lmt->damage;	279	op->stats.dam += lmt->damage;
378	if (op->stats.dam < 1)	280	if (op->stats.dam < 1)
379	op->stats.dam = 1;	281	op->stats.dam = 1;
380	}	282	}
		283
381	if (op->stats.sp && op->type == BOW)	284	if (op->stats.sp && op->type == BOW)
382	op->stats.sp += lmt->sp;	285	op->stats.sp += lmt->sp;
383	if (op->stats.wc && IS_WEAPON (op))	286	if (op->stats.wc && op->is_weapon ())
384	op->stats.wc += lmt->wc;	287	op->stats.wc += lmt->wc;
385	if (IS_ARMOR (op))	288	if (op->is_armor ())
386	{	289	{
387	if (op->stats.ac)	290	if (op->stats.ac)
388	op->stats.ac += lmt->ac;	291	op->stats.ac += lmt->ac;
		292
389	for (j = 0; j < NROFATTACKS; j++)	293	for (int j = 0; j < NROFATTACKS; j++)
390	if (op->resist[j] != 0)	294	if (op->resist[j] != 0)
391	{	295	{
392	op->resist[j] += lmt->mod[j];	296	op->resist[j] += lmt->mod[j];
393	if (op->resist[j] > 100)	297	if (op->resist[j] > 100)
394	op->resist[j] = 100;	298	op->resist[j] = 100;
395	if (op->resist[j] < -100)	299	if (op->resist[j] < -100)
396	op->resist[j] = -100;	300	op->resist[j] = -100;
397	}	301	}
398	}	302	}
		303
399	op->materialname = add_string (lmt->name);	304	op->materialname = lmt->name;
400	/* dont make it unstackable if it doesn't need to be */	305	/* dont make it unstackable if it doesn't need to be */
401	if (IS_WEAPON (op) \|\| IS_ARMOR (op))	306	if (op->is_weapon () \|\| op->is_armor ())
402	{	307	{
403	op->weight = (op->weight * lmt->weight) / 100;	308	op->weight = (op->weight * lmt->weight) / 100;
404	op->value = (op->value * lmt->value) / 100;	309	op->value = (op->value * lmt->value) / 100;
405	}	310	}
406	#endif
407	}	311	}
408	}	312	}
409		313
410	/*	314	/*
411	* Strip out the media tags from a String.	315	* Strip out the media tags from a String.
…		…
506	* 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
507	* 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.
508	* This function will also strip all trailing non alphanumeric characters.	412	* This function will also strip all trailing non alphanumeric characters.
509	* It does not insert an oxford comma.	413	* It does not insert an oxford comma.
510	*/	414	*/
511
512	void	415	void
513	make_list_like (char *input)	416	make_list_like (char *input)
514	{	417	{
515	char *p, tmp[MAX_BUF];	418	char *p, tmp[MAX_BUF];
516	int i;	419	int i;
…		…
541	return;	444	return;
542	}	445	}
543		446
544	/////////////////////////////////////////////////////////////////////////////	447	/////////////////////////////////////////////////////////////////////////////
545		448
546	#if 0	449	void
547	refcounted *refcounted::rc_first;	450	fork_abort (const char *msg)
548
549	refcounted::refcounted ()
550	{	451	{
551	refcnt = 0;	452	if (!fork ())
552	rc_next = rc_first;	453	{
553	rc_first = this;	454	signal (SIGINT , SIG_IGN);
554	}	455	signal (SIGTERM, SIG_IGN);
		456	signal (SIGABRT, SIG_IGN);
555		457
556	refcounted::~refcounted ()	458	signal (SIGSEGV, SIG_DFL);
557	{	459	signal (SIGBUS , SIG_DFL);
558	assert (!rc_next);	460	signal (SIGILL , SIG_DFL);
559	assert (!refcnt);	461	signal (SIGTRAP, SIG_DFL);
		462
		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);
560	}	491	}
		492
		493	void *salloc_ (int n) throw (std::bad_alloc)
		494	{
		495	void *ptr = g_slice_alloc (n);
		496
		497	if (!ptr)
		498	throw std::bad_alloc ();
		499
		500	slice_alloc += n;
		501	return ptr;
		502	}
		503
		504	void salloc_ (int n, void src) throw (std::bad_alloc)
		505	{
		506	void *ptr = salloc_ (n);
		507
		508	if (src)
		509	memcpy (ptr, src, n);
		510	else
		511	memset (ptr, 0, n);
		512
		513	return ptr;
		514	}
		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
561	#endif	555	#endif
562		556
563	void *alloc (int s) throw (std::bad_alloc)	557	/******************************************************************************/
564	{
565	void *p = g_slice_alloc (s);
566
567	if (!p)
568	throw std::bad_alloc ();
569
570	return p;
571	}
572		558
573	void assign (char dst, const char src, int maxlen)	559	void assign (char dst, const char src, int maxlen)
574	{	560	{
575	if (!src)	561	if (!src)
576	src = "";	562	src = "";
…		…
592	}	578	}
593	else	579	else
594	memcpy (dst, src, len + 1);	580	memcpy (dst, src, len + 1);
595	}	581	}
596		582
		583	const char *
		584	format (const char *format, ...)
		585	{
		586	static dynbuf_text buf;
597		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
		598	tstamp now ()
		599	{
		600	struct timeval tv;
		601
		602	gettimeofday (&tv, 0);
		603	return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
		604	}
		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.20 by root, Mon Dec 11 21:32:16 2006 UTC vs. Revision 1.82 by root, Thu Sep 11 12:43:17 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.20 by root, Mon Dec 11 21:32:16 2006 UTC vs.
Revision 1.82 by root, Thu Sep 11 12:43:17 2008 UTC