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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.9 by root, Sun Sep 10 16:00:23 2006 UTC vs. Revision 1.88 by root, Sun Oct 11 05:31:54 2009 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.9 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.88 by root, Sun Oct 11 05:31:54 2009 UTC