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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.10 by root, Mon Sep 11 01:16:20 2006 UTC vs.
Revision 1.74 by root, Fri Apr 11 21:09:52 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.10 2006/09/11 01:16:20 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	*/
		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>
33		34
34	#include <global.h>	35	#include <global.h>
35	#include <funcpoint.h>	36	#include <funcpoint.h>
36	#include <material.h>	37	#include <material.h>
37		38
38	#include <glib.h>	39	#include <glib.h>
		40
		41	refcnt_base::refcnt_t refcnt_dummy;
		42	ssize_t slice_alloc;
		43	rand_gen rndm;
		44
		45	void
		46	tausworthe_random_generator::seed (uint32_t seed)
		47	{
		48	state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
		49	state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
		50	state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
		51	state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
		52
		53	for (int i = 11; --i; )
		54	operator ()();
		55	}
		56
		57	uint32_t
		58	tausworthe_random_generator::next ()
		59	{
		60	state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U);
		61	state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U);
		62	state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U);
		63	state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
		64
		65	return state [0] ^ state [1] ^ state [2] ^ state [3];
		66	}
		67
		68	uint32_t
		69	tausworthe_random_generator::get_range (uint32_t num)
		70	{
		71	return (next () * (uint64_t)num) >> 32U;
		72	}
		73
		74	// return a number within (min .. max)
		75	int
		76	tausworthe_random_generator::get_range (int r_min, int r_max)
		77	{
		78	return r_min + get_range (max (r_max - r_min + 1, 0));
		79	}
39		80
40	/*	81	/*
41	* The random functions here take luck into account when rolling random	82	* 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	83	* 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	84	* 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,	91	* 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.	92	* 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,	93	* Generally, op should be the player/caster/hitter requesting the roll,
53	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]	94	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]
54	*/	95	*/
55
56	int	96	int
57	random_roll (int min, int max, const object *op, int goodbad)	97	random_roll (int r_min, int r_max, const object *op, int goodbad)
58	{	98	{
59	int omin, diff, luck, base, ran;	99	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
60		100
61	omin = min;	101	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	{	102	{
67	LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max);	103	LOG (llevError \| logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
		104	return r_min;
		105	}
		106
		107	if (op->type == PLAYER)
		108	{
		109	int luck = op->stats.luck;
		110
		111	if (rndm (base) < min (10, abs (luck)))
		112	{
		113	//TODO: take luck into account
		114	}
		115	}
		116
		117	return rndm (r_min, r_max);
		118	}
		119
		120	/*
		121	* This is a 64 bit version of random_roll above. This is needed
		122	* for exp loss calculations for players changing religions.
		123	*/
		124	sint64
		125	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
		126	{
		127	sint64 omin = min;
		128	sint64 diff = max - min + 1;
		129	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
		130
		131	if (diff < 0)
		132	{
		133	LOG (llevError \| logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max);
68	return (min); /* avoids a float exception */	134	return (min); /* avoids a float exception */
69	}	135	}
70		136
71	ran = RANDOM ();	137	/*
		138	* Make a call to get two 32 bit unsigned random numbers, and just to
		139	* a little bitshifting.
		140	*/
		141	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
72		142
73	if (op->type != PLAYER)	143	if (op->type != PLAYER)
74	return ((ran % diff) + min);	144	return ((ran % diff) + min);
75		145
76	luck = op->stats.luck;	146	int luck = op->stats.luck;
		147
77	if (RANDOM () % base < MIN (10, abs (luck)))	148	if (rndm (base) < MIN (10, abs (luck)))
78	{	149	{
79	/* we have a winner */	150	/* we have a winner */
80	((luck > 0) ? (luck = 1) : (luck = -1));	151	((luck > 0) ? (luck = 1) : (luck = -1));
81	diff -= luck;	152	diff -= luck;
82	if (diff < 1)	153	if (diff < 1)
83	return (omin); /check again /	154	return (omin); /check again /
		155
84	((goodbad) ? (min += luck) : (diff));	156	((goodbad) ? (min += luck) : (diff));
85		157
86	return (MAX (omin, MIN (max, (ran % diff) + min)));	158	return (MAX (omin, MIN (max, (ran % diff) + min)));
87	}	159	}
		160
88	return ((ran % diff) + min);	161	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	}	162	}
140		163
141	/*	164	/*
142	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,	165	* Roll a number of dice (2d3, 4d6). Uses op to determine luck,
143	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.	166	* If goodbad is non-zero, luck increases the roll, if zero, it decreases.
144	* Generally, op should be the player/caster/hitter requesting the roll,	167	* Generally, op should be the player/caster/hitter requesting the roll,
145	* not the recipient (ie, the poor slob getting hit).	168	* not the recipient (ie, the poor slob getting hit).
146	* The args are num D size (ie 4d6) [garbled 20010916]	169	* The args are num D size (ie 4d6) [garbled 20010916]
147	*/	170	*/
148
149	int	171	int
150	die_roll (int num, int size, const object *op, int goodbad)	172	die_roll (int num, int size, const object *op, int goodbad)
151	{	173	{
152	int min, diff, luck, total, i, gotlucky, base, ran;	174	int min, luck, total, i, gotlucky;
153		175
154	diff = size;	176	int diff = size;
155	min = 1;	177	min = 1;
156	luck = total = gotlucky = 0;	178	luck = total = gotlucky = 0;
157	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	179	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
		180
158	if (size < 2 \|\| diff < 1)	181	if (size < 2 \|\| diff < 1)
159	{	182	{
160	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);	183	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
161	return (num); /* avoids a float exception */	184	return num; /* avoids a float exception */
162	}	185	}
163		186
164	if (op->type == PLAYER)	187	if (op->type == PLAYER)
165	luck = op->stats.luck;	188	luck = op->stats.luck;
166		189
167	for (i = 0; i < num; i++)	190	for (i = 0; i < num; i++)
168	{	191	{
169	if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)	192	if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
170	{	193	{
171	/* we have a winner */	194	/* we have a winner */
172	gotlucky++;	195	gotlucky++;
173	((luck > 0) ? (luck = 1) : (luck = -1));	196	((luck > 0) ? (luck = 1) : (luck = -1));
174	diff -= luck;	197	diff -= luck;
175	if (diff < 1)	198	if (diff < 1)
176	return (num); /check again /	199	return (num); /check again /
177	((goodbad) ? (min += luck) : (diff));	200	((goodbad) ? (min += luck) : (diff));
178	ran = RANDOM ();
179	total += MAX (1, MIN (size, (ran % diff) + min));	201	total += MAX (1, MIN (size, rndm (diff) + min));
180	}	202	}
181	else	203	else
182	{
183	total += RANDOM () % size + 1;	204	total += rndm (size) + 1;
184	}
185	}	205	}
		206
186	return (total);	207	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	}	208	}
275		209
276	/* convert materialname to materialtype_t */	210	/* convert materialname to materialtype_t */
277		211
278	materialtype_t *	212	materialtype_t *
279	name_to_material (const char *name)	213	name_to_material (const shstr &name)
280	{	214	{
281	materialtype_t mt, nmt;	215	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
		216	if (name == mt->name)
		217	return mt;
282		218
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;	219	return 0;
293	}	220	}
294		221
295	/* when doing transmutation of objects, we have to recheck the resistances,	222	/* when doing transmutation of objects, we have to recheck the resistances,
296	* as some that did not apply previously, may apply now.	223	* as some that did not apply previously, may apply now.
297	*/	224	*/
298
299	void	225	void
300	transmute_materialname (object op, const object change)	226	transmute_materialname (object op, const object change)
301	{	227	{
302	materialtype_t *mt;	228	materialtype_t *mt;
303	int j;	229	int j;
…		…
306	return;	232	return;
307		233
308	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))	234	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
309	return;	235	return;
310		236
311	if (!IS_ARMOR (op))	237	if (!op->is_armor ())
312	return;	238	return;
313		239
314	mt = name_to_material (op->materialname);	240	mt = name_to_material (op->materialname);
315	if (!mt)	241	if (!mt)
316	{	242	{
317	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);	243	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
318	return;	244	return;
319	}	245	}
320		246
321	for (j = 0; j < NROFATTACKS; j++)	247	for (j = 0; j < NROFATTACKS; j++)
322	if (op->resist[j] == 0 && change->resist[j] != 0)	248	if (op->resist[j] == 0 && change->resist[j] != 0)
…		…
333	void	259	void
334	set_materialname (object op, int difficulty, materialtype_t nmt)	260	set_materialname (object op, int difficulty, materialtype_t nmt)
335	{	261	{
336	materialtype_t mt, lmt;	262	materialtype_t mt, lmt;
337		263
338	#ifdef NEW_MATERIAL_CODE
339	int j;
340	#endif
341
342	if (op->materialname != NULL)	264	if (op->materialname != NULL)
343	return;	265	return;
344		266
345
346
347	if (nmt == NULL)	267	if (nmt == NULL)
348	{	268	{
349	lmt = NULL;	269	lmt = NULL;
350	#ifndef NEW_MATERIAL_CODE	270
351	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)	271	for (mt = materialt; mt && mt->next; mt = mt->next)
352	{	272	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
353	if (op->material & mt->material)	273	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
354	{	274	{
355	lmt = mt;	275	lmt = mt;
		276	if (!(op->is_weapon () \|\| op->is_armor ()))
356	break;	277	break;
357	}	278	}
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	}	279	}
373	else	280	else
374	{
375	lmt = nmt;	281	lmt = nmt;
376	}
377		282
378	if (lmt != NULL)	283	if (lmt != NULL)
379	{	284	{
380	#ifndef NEW_MATERIAL_CODE	285	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	{	286	{
387	op->stats.dam += lmt->damage;	287	op->stats.dam += lmt->damage;
388	if (op->stats.dam < 1)	288	if (op->stats.dam < 1)
389	op->stats.dam = 1;	289	op->stats.dam = 1;
390	}	290	}
		291
391	if (op->stats.sp && op->type == BOW)	292	if (op->stats.sp && op->type == BOW)
392	op->stats.sp += lmt->sp;	293	op->stats.sp += lmt->sp;
393	if (op->stats.wc && IS_WEAPON (op))	294	if (op->stats.wc && op->is_weapon ())
394	op->stats.wc += lmt->wc;	295	op->stats.wc += lmt->wc;
395	if (IS_ARMOR (op))	296	if (op->is_armor ())
396	{	297	{
397	if (op->stats.ac)	298	if (op->stats.ac)
398	op->stats.ac += lmt->ac;	299	op->stats.ac += lmt->ac;
		300
399	for (j = 0; j < NROFATTACKS; j++)	301	for (int j = 0; j < NROFATTACKS; j++)
400	if (op->resist[j] != 0)	302	if (op->resist[j] != 0)
401	{	303	{
402	op->resist[j] += lmt->mod[j];	304	op->resist[j] += lmt->mod[j];
403	if (op->resist[j] > 100)	305	if (op->resist[j] > 100)
404	op->resist[j] = 100;	306	op->resist[j] = 100;
405	if (op->resist[j] < -100)	307	if (op->resist[j] < -100)
406	op->resist[j] = -100;	308	op->resist[j] = -100;
407	}	309	}
408	}	310	}
		311
409	op->materialname = add_string (lmt->name);	312	op->materialname = lmt->name;
410	/* dont make it unstackable if it doesn't need to be */	313	/* dont make it unstackable if it doesn't need to be */
411	if (IS_WEAPON (op) \|\| IS_ARMOR (op))	314	if (op->is_weapon () \|\| op->is_armor ())
412	{	315	{
413	op->weight = (op->weight * lmt->weight) / 100;	316	op->weight = (op->weight * lmt->weight) / 100;
414	op->value = (op->value * lmt->value) / 100;	317	op->value = (op->value * lmt->value) / 100;
415	}	318	}
416	#endif
417	}	319	}
418	}	320	}
419		321
420	/*	322	/*
421	* Strip out the media tags from a String.	323	* Strip out the media tags from a String.
…		…
516	* a 'list' for the purposes here, is a string of items, seperated by commas, except	418	* a 'list' for the purposes here, is a string of items, seperated by commas, except
517	* for the last entry, which has an 'and' before it, and a full stop (period) after it.	419	* for the last entry, which has an 'and' before it, and a full stop (period) after it.
518	* This function will also strip all trailing non alphanumeric characters.	420	* This function will also strip all trailing non alphanumeric characters.
519	* It does not insert an oxford comma.	421	* It does not insert an oxford comma.
520	*/	422	*/
521
522	void	423	void
523	make_list_like (char *input)	424	make_list_like (char *input)
524	{	425	{
525	char *p, tmp[MAX_BUF];	426	char *p, tmp[MAX_BUF];
526	int i;	427	int i;
…		…
531		432
532	strncpy (tmp, input, MAX_BUF - 5);	433	strncpy (tmp, input, MAX_BUF - 5);
533	/trim all trailing commas, spaces etc. /	434	/trim all trailing commas, spaces etc. /
534	for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)	435	for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
535	tmp[i] = '\0';	436	tmp[i] = '\0';
		437
536	strcat (tmp, ".");	438	strcat (tmp, ".");
537		439
538	p = strrchr (tmp, ',');	440	p = strrchr (tmp, ',');
539	if (p)	441	if (p)
540	{	442	{
…		…
544	strcat (input, " and");	446	strcat (input, " and");
545	strcat (input, p);	447	strcat (input, p);
546	}	448	}
547	else	449	else
548	strcpy (input, tmp);	450	strcpy (input, tmp);
		451
549	return;	452	return;
550	}	453	}
551		454
		455	/////////////////////////////////////////////////////////////////////////////
		456
552	void *	457	void
553	zero_initialised::operator new (size_t s, void *p)	458	fork_abort (const char *msg)
554	{	459	{
555	memset (p, 0, s);	460	if (!fork ())
		461	{
		462	signal (SIGABRT, SIG_DFL);
		463	// try to put corefiles into a subdirectory, if existing, to allow
		464	// an administrator to reduce the I/O load.
		465	chdir ("cores");
		466	abort ();
		467	}
		468
		469	LOG (llevError, "fork abort: %s\n", msg);
		470	}
		471
		472	void *salloc_ (int n) throw (std::bad_alloc)
		473	{
		474	void *ptr = g_slice_alloc (n);
		475
		476	if (!ptr)
		477	throw std::bad_alloc ();
		478
		479	slice_alloc += n;
556	return p;	480	return ptr;
557	}	481	}
558		482
559	void *	483	void salloc_ (int n, void src) throw (std::bad_alloc)
560	zero_initialised::operator new (size_t s)
561	{	484	{
562	//return calloc (1, s);	485	void *ptr = salloc_ (n);
563	return g_slice_alloc0 (s);
564	}
565		486
566	void *	487	if (src)
567	zero_initialised::operator new[] (size_t s)	488	memcpy (ptr, src, n);
568	{	489	else
569	//return calloc (1, s);	490	memset (ptr, 0, n);
570	return g_slice_alloc0 (s);
571	}
572		491
573	void	492	return ptr;
574	zero_initialised::operator delete (void *p, size_t s)
575	{
576	//free (p); return;
577	g_slice_free1 (s, p);
578	}	493	}
579		494
580	void	495	/******************************************************************************/
581	zero_initialised::operator delete[] (void *p, size_t s)	496
		497	#if DEBUG_SALLOC
		498
		499	#define MAGIC 0xa1b2c35543deadLL
		500
		501	void *g_slice_alloc (unsigned long size)
582	{	502	{
583	//free (p); return;	503	unsigned long p = (unsigned long ) (g_slice_alloc)(size + sizeof (unsigned long));
584	g_slice_free1 (s, p);	504	*p++ = size ^ MAGIC;
		505	//fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
		506	return (void *)p;
585	}	507	}
		508
		509	void *g_slice_alloc0 (unsigned long size)
		510	{
		511	return memset (g_slice_alloc (size), 0, size);
		512	}
		513
		514	void g_slice_free1 (unsigned long size, void *ptr)
		515	{
		516	//fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
		517	if (expect_true (ptr))
		518	{
		519	unsigned long p = (unsigned long )ptr;
		520	unsigned long s = *--p ^ MAGIC;
		521
		522	if (size != (unsigned long)(*p ^ MAGIC))
		523	{
		524	LOG (logBacktrace \| llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
		525	abort ();
		526	}
		527
		528	*p = MAGIC;
		529
		530	(g_slice_free1)(s + sizeof (unsigned long), p);
		531	}
		532	}
		533
		534	#endif
		535
		536	/******************************************************************************/
		537
		538	void assign (char dst, const char src, int maxlen)
		539	{
		540	if (!src)
		541	src = "";
		542
		543	int len = strlen (src);
		544
		545	if (len >= maxlen - 1)
		546	{
		547	if (maxlen <= 4)
		548	{
		549	memset (dst, '.', maxlen - 1);
		550	dst [maxlen - 1] = 0;
		551	}
		552	else
		553	{
		554	memcpy (dst, src, maxlen - 4);
		555	memcpy (dst + maxlen - 4, "...", 4);
		556	}
		557	}
		558	else
		559	memcpy (dst, src, len + 1);
		560	}
		561
		562	const char *
		563	format (const char *format, ...)
		564	{
		565	static dynbuf_text buf;
		566
		567	buf.clear ();
		568
		569	va_list ap;
		570	va_start (ap, format);
		571	buf.vprintf (format, ap);
		572	va_end (ap);
		573
		574	return buf;
		575	}
		576
		577	tstamp now ()
		578	{
		579	struct timeval tv;
		580
		581	gettimeofday (&tv, 0);
		582	return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
		583	}
		584
		585	int
		586	similar_direction (int a, int b)
		587	{
		588	if (!a \|\| !b)
		589	return 0;
		590
		591	int diff = (b - a) & 7;
		592	return diff <= 1 \|\| diff >= 7;
		593	}
		594
		595	/* crc32 0xdebb20e3 table and supplementary functions. */
		596	extern const uint32_t crc_32_tab[256] =
		597	{
		598	0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
		599	0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
		600	0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
		601	0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
		602	0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
		603	0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
		604	0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
		605	0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
		606	0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
		607	0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
		608	0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
		609	0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
		610	0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
		611	0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
		612	0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
		613	0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
		614	0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
		615	0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
		616	0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
		617	0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
		618	0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
		619	0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
		620	0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
		621	0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
		622	0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
		623	0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
		624	0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
		625	0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
		626	0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
		627	0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
		628	0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
		629	0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
		630	0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
		631	0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
		632	0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
		633	0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
		634	0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
		635	0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
		636	0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
		637	0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
		638	0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
		639	0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
		640	0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
		641	0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
		642	0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
		643	0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
		644	0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
		645	0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
		646	0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
		647	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
		648	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
		649	0x2d02ef8dL
		650	};
		651
		652	void thread::start (void (start_routine)(void ), void arg)
		653	{
		654	sigset_t fullsigset, oldsigset;
		655	sigfillset (&fullsigset);
		656
		657	pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
		658
		659	if (pthread_create (&id, 0, start_routine, arg))
		660	cleanup ("unable to create a new thread");
		661
		662	pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
		663	}

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.10 by root, Mon Sep 11 01:16:20 2006 UTC vs. Revision 1.74 by root, Fri Apr 11 21:09:52 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.10 by root, Mon Sep 11 01:16:20 2006 UTC vs.
Revision 1.74 by root, Fri Apr 11 21:09:52 2008 UTC