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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.12 by root, Tue Sep 12 20:55:40 2006 UTC vs.
Revision 1.77 by root, Sun May 4 14:12:37 2008 UTC

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.12 by root, Tue Sep 12 20:55:40 2006 UTC vs. Revision 1.77 by root, Sun May 4 14:12:37 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.12 by root, Tue Sep 12 20:55:40 2006 UTC vs.
Revision 1.77 by root, Sun May 4 14:12:37 2008 UTC