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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.11 by root, Tue Sep 12 19:20:06 2006 UTC vs.
Revision 1.59 by root, Thu Jun 7 19:12:22 2007 UTC

…		…
1
2	/*	1	/*
3	* static char *rcsid_utils_c =	2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
4	* "$Id: utils.C,v 1.11 2006/09/12 19:20:06 root Exp $";	3	*
5	*/	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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	* Crossfire TRT is free software; you can redistribute it and/or modify it
14	it under the terms of the GNU General Public License as published by	9	* under the terms of the GNU General Public License as published by the Free
15	the Free Software Foundation; either version 2 of the License, or	10	* Software Foundation; either version 2 of the License, or (at your option)
16	(at your option) any later version.	11	* 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, but
19	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
20	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
21	GNU General Public License for more details.	16	* 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 along
24	along with this program; if not, write to the Free Software	19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
25	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
26		21	*
27	The authors can be reached via e-mail at crossfire-devel@real-time.com	22	* The authors can be reached via e-mail to <crossfire@schmorp.de>
28	*/	23	*/
29		24
30	/*	25	/*
31	* General convenience functions for crossfire.	26	* General convenience functions for crossfire.
32	*/	27	*/
		28
		29	#include <cstdlib>
		30	#include <sys/types.h>
		31	#include <unistd.h>
		32	#include <sys/time.h>
		33	#include <time.h>
		34	#include <signal.h>
33		35
34	#include <global.h>	36	#include <global.h>
35	#include <funcpoint.h>	37	#include <funcpoint.h>
36	#include <material.h>	38	#include <material.h>
37		39
38	#include <glib.h>	40	#include <glib.h>
		41
		42	rand_gen 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] < 128) 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)
282		215	if (name == mt->name)
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;	216	return mt;
		217
		218	return materialt;
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	*/
…		…
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)
…		…
346		272
347	if (nmt == NULL)	273	if (nmt == NULL)
348	{	274	{
349	lmt = NULL;	275	lmt = NULL;
350	#ifndef NEW_MATERIAL_CODE	276	#ifndef NEW_MATERIAL_CODE
351	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)	277	for (mt = materialt; mt && mt->next; mt = mt->next)
352	{	278	{
353	if (op->material & mt->material)	279	if (op->materials & mt->material)
354	{	280	{
355	lmt = mt;	281	lmt = mt;
356	break;	282	break;
357	}	283	}
358	}	284	}
359		285
360	#else	286	#else
361	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)	287	for (mt = materialt; mt && mt->next; mt = mt->next)
362	{	288	{
363	if (op->material & mt->material && rndm (1, 100) <= mt->chance &&	289	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
364	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))	290	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
365	{	291	{
366	lmt = mt;	292	lmt = mt;
367	if (!(IS_WEAPON (op) \|\| IS_ARMOR (op)))	293	if (!(op->is_weapon () \|\| op->is_armor ()))
368	break;	294	break;
369	}	295	}
370	}	296	}
371	#endif	297	#endif
372	}	298	}
…		…
380	#ifndef NEW_MATERIAL_CODE	306	#ifndef NEW_MATERIAL_CODE
381	op->materialname = lmt->name;	307	op->materialname = lmt->name;
382	return;	308	return;
383	#else	309	#else
384		310
385	if (op->stats.dam && IS_WEAPON (op))	311	if (op->stats.dam && op->is_weapon ())
386	{	312	{
387	op->stats.dam += lmt->damage;	313	op->stats.dam += lmt->damage;
388	if (op->stats.dam < 1)	314	if (op->stats.dam < 1)
389	op->stats.dam = 1;	315	op->stats.dam = 1;
390	}	316	}
		317
391	if (op->stats.sp && op->type == BOW)	318	if (op->stats.sp && op->type == BOW)
392	op->stats.sp += lmt->sp;	319	op->stats.sp += lmt->sp;
393	if (op->stats.wc && IS_WEAPON (op))	320	if (op->stats.wc && op->is_weapon ())
394	op->stats.wc += lmt->wc;	321	op->stats.wc += lmt->wc;
395	if (IS_ARMOR (op))	322	if (op->is_armor ())
396	{	323	{
397	if (op->stats.ac)	324	if (op->stats.ac)
398	op->stats.ac += lmt->ac;	325	op->stats.ac += lmt->ac;
399	for (j = 0; j < NROFATTACKS; j++)	326	for (j = 0; j < NROFATTACKS; j++)
400	if (op->resist[j] != 0)	327	if (op->resist[j] != 0)
…		…
404	op->resist[j] = 100;	331	op->resist[j] = 100;
405	if (op->resist[j] < -100)	332	if (op->resist[j] < -100)
406	op->resist[j] = -100;	333	op->resist[j] = -100;
407	}	334	}
408	}	335	}
409	op->materialname = add_string (lmt->name);	336	op->materialname = lmt->name;
410	/* dont make it unstackable if it doesn't need to be */	337	/* dont make it unstackable if it doesn't need to be */
411	if (IS_WEAPON (op) \|\| IS_ARMOR (op))	338	if (op->is_weapon () \|\| op->is_armor ())
412	{	339	{
413	op->weight = (op->weight * lmt->weight) / 100;	340	op->weight = (op->weight * lmt->weight) / 100;
414	op->value = (op->value * lmt->value) / 100;	341	op->value = (op->value * lmt->value) / 100;
415	}	342	}
416	#endif	343	#endif
…		…
549	strcpy (input, tmp);	476	strcpy (input, tmp);
550		477
551	return;	478	return;
552	}	479	}
553		480
		481	/////////////////////////////////////////////////////////////////////////////
		482
554	void *	483	void
555	zero_initialised::operator new (size_t s, void *p)	484	fork_abort (const char *msg)
556	{	485	{
557	memset (p, 0, s);	486	if (!fork ())
		487	{
		488	signal (SIGABRT, SIG_DFL);
		489	// try to put corefiles into a subdirectory, if existing, to allow
		490	// an administrator to reduce the I/O load.
		491	chdir ("cores");
		492	abort ();
		493	}
		494
		495	LOG (llevError, "fork abort: %s\n", msg);
		496	}
		497
		498	void *salloc_ (int n) throw (std::bad_alloc)
		499	{
		500	#ifdef PREFER_MALLOC
		501	void *ptr = malloc (n);
		502	#else
		503	void *ptr = g_slice_alloc (n);
		504	#endif
		505
		506	if (!ptr)
		507	throw std::bad_alloc ();
		508
558	return p;	509	return ptr;
559	}	510	}
560		511
561	void *	512	void salloc_ (int n, void src) throw (std::bad_alloc)
562	zero_initialised::operator new (size_t s)
563	{	513	{
564	//return calloc (1, s);	514	void *ptr = salloc_ (n);
565	return g_slice_alloc0 (s);
566	}
567		515
568	void *	516	if (src)
569	zero_initialised::operator new[] (size_t s)	517	memcpy (ptr, src, n);
570	{	518	else
571	//return calloc (1, s);	519	memset (ptr, 0, n);
572	return g_slice_alloc0 (s);
573	}
574		520
575	void	521	return ptr;
576	zero_initialised::operator delete (void *p, size_t s)
577	{
578	//free (p); return;
579	g_slice_free1 (s, p);
580	}
581
582	void
583	zero_initialised::operator delete[] (void *p, size_t s)
584	{
585	//free (p); return;
586	g_slice_free1 (s, p);
587	}	522	}
588		523
589	void assign (char dst, const char src, int maxlen)	524	void assign (char dst, const char src, int maxlen)
590	{	525	{
591	if (!src)	526	if (!src)
…		…
608	}	543	}
609	else	544	else
610	memcpy (dst, src, len + 1);	545	memcpy (dst, src, len + 1);
611	}	546	}
612		547
		548	const std::string
		549	format (const char *format, ...)
		550	{
		551	int len;
		552
		553	{
		554	char buf[128];
		555
		556	va_list ap;
		557	va_start (ap, format);
		558	len = vsnprintf (buf, sizeof (buf), format, ap);
		559	va_end (ap);
		560
		561	assert (len >= 0); // shield againstz broken vsnprintf's
		562
		563	// was our static buffer short enough?
		564	if (len < sizeof (buf))
		565	return std::string (buf, len);
		566	}
		567
		568	{
		569	// longer, try harder
		570	char *buf = salloc<char> (len + 1);
		571
		572	va_list ap;
		573	va_start (ap, format);
		574	vsnprintf (buf, len + 1, format, ap);
		575	va_end (ap);
		576
		577	const std::string s (buf, len);
		578	sfree<char> (buf, len + 1);
		579
		580	return buf;
		581	}
		582	}
		583
		584	tstamp now ()
		585	{
		586	struct timeval tv;
		587
		588	gettimeofday (&tv, 0);
		589	return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
		590	}
		591
		592	int
		593	similar_direction (int a, int b)
		594	{
		595	if (!a \|\| !b)
		596	return 0;
		597
		598	int diff = (b - a) & 7;
		599	return diff <= 1 \|\| diff >= 7;
		600	}
		601
		602	/* crc32 0xdebb20e3 table and supplementary functions. */
		603	extern const uint32_t crc_32_tab[256] =
		604	{
		605	0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
		606	0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
		607	0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
		608	0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
		609	0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
		610	0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
		611	0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
		612	0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
		613	0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
		614	0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
		615	0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
		616	0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
		617	0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
		618	0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
		619	0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
		620	0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
		621	0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
		622	0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
		623	0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
		624	0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
		625	0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
		626	0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
		627	0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
		628	0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
		629	0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
		630	0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
		631	0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
		632	0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
		633	0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
		634	0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
		635	0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
		636	0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
		637	0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
		638	0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
		639	0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
		640	0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
		641	0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
		642	0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
		643	0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
		644	0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
		645	0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
		646	0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
		647	0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
		648	0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
		649	0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
		650	0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
		651	0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
		652	0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
		653	0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
		654	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
		655	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
		656	0x2d02ef8dL
		657	};
		658
		659

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.11 by root, Tue Sep 12 19:20:06 2006 UTC vs. Revision 1.59 by root, Thu Jun 7 19:12:22 2007 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.11 by root, Tue Sep 12 19:20:06 2006 UTC vs.
Revision 1.59 by root, Thu Jun 7 19:12:22 2007 UTC