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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.34 by root, Mon Jan 1 12:28:46 2007 UTC vs.
Revision 1.74 by root, Fri Apr 11 21:09:52 2008 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3		3	*
		4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
18	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
20		21	* The authors can be reached via e-mail to <support@deliantra.net>
21	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	22	*/
23		23
24	/*	24	/*
25	* General convenience functions for crossfire.	25	* General convenience functions for crossfire.
26	*/	26	*/
		27
		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>
27		34
28	#include <global.h>	35	#include <global.h>
29	#include <funcpoint.h>	36	#include <funcpoint.h>
30	#include <material.h>	37	#include <material.h>
31		38
32	#include <sys/time.h>
33	#include <time.h>
34	#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	}
35		80
36	/*	81	/*
37	* The random functions here take luck into account when rolling random	82	* The random functions here take luck into account when rolling random
38	* 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
39	* difference becomes in the random numbers. IE, the effect is lessened	84	* difference becomes in the random numbers. IE, the effect is lessened
46	* 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,
47	* 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.
48	* Generally, op should be the player/caster/hitter requesting the roll,	93	* Generally, op should be the player/caster/hitter requesting the roll,
49	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]	94	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]
50	*/	95	*/
51
52	int	96	int
53	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)
54	{	98	{
55	int omin, diff, luck, base, ran;	99	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
56		100
57	omin = min;	101	if (r_max < r_min)
58	diff = max - min + 1;
59	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
60
61	if (max < 1 \|\| diff < 1)
62	{	102	{
63	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);
64	return (min); /* avoids a float exception */	134	return (min); /* avoids a float exception */
65	}	135	}
66		136
67	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);
68		142
69	if (op->type != PLAYER)	143	if (op->type != PLAYER)
70	return ((ran % diff) + min);	144	return ((ran % diff) + min);
71		145
72	luck = op->stats.luck;	146	int luck = op->stats.luck;
		147
73	if (RANDOM () % base < MIN (10, abs (luck)))	148	if (rndm (base) < MIN (10, abs (luck)))
74	{	149	{
75	/* we have a winner */	150	/* we have a winner */
76	((luck > 0) ? (luck = 1) : (luck = -1));	151	((luck > 0) ? (luck = 1) : (luck = -1));
77	diff -= luck;	152	diff -= luck;
78	if (diff < 1)	153	if (diff < 1)
79	return (omin); /check again /	154	return (omin); /check again /
		155
80	((goodbad) ? (min += luck) : (diff));	156	((goodbad) ? (min += luck) : (diff));
81		157
82	return (MAX (omin, MIN (max, (ran % diff) + min)));	158	return (MAX (omin, MIN (max, (ran % diff) + min)));
83	}	159	}
		160
84	return ((ran % diff) + min);	161	return ran % diff + min;
85	}
86
87	/*
88	* This is a 64 bit version of random_roll above. This is needed
89	* for exp loss calculations for players changing religions.
90	*/
91
92	sint64
93	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
94	{
95	sint64 omin, diff, luck, ran;
96	int base;
97
98	omin = min;
99	diff = max - min + 1;
100	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
101
102	if (max < 1 \|\| diff < 1)
103	{
104	LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
105	return (min); /* avoids a float exception */
106	}
107
108	/* Don't know of a portable call to get 64 bit random values.
109	* So make a call to get two 32 bit random numbers, and just to
110	* a little byteshifting. Do make sure the first one is only
111	* 32 bit, so we don't get skewed results
112	*/
113	ran = (RANDOM () & 0xffffffff) \| ((sint64) RANDOM () << 32);
114
115	if (op->type != PLAYER)
116	return ((ran % diff) + min);
117
118	luck = op->stats.luck;
119	if (RANDOM () % base < MIN (10, abs (luck)))
120	{
121	/* we have a winner */
122	((luck > 0) ? (luck = 1) : (luck = -1));
123	diff -= luck;
124	if (diff < 1)
125	return (omin); /check again /
126	((goodbad) ? (min += luck) : (diff));
127
128	return (MAX (omin, MIN (max, (ran % diff) + min)));
129	}
130	return ((ran % diff) + min);
131	}	162	}
132		163
133	/*	164	/*
134	* 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,
135	* 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.
136	* Generally, op should be the player/caster/hitter requesting the roll,	167	* Generally, op should be the player/caster/hitter requesting the roll,
137	* not the recipient (ie, the poor slob getting hit).	168	* not the recipient (ie, the poor slob getting hit).
138	* The args are num D size (ie 4d6) [garbled 20010916]	169	* The args are num D size (ie 4d6) [garbled 20010916]
139	*/	170	*/
140
141	int	171	int
142	die_roll (int num, int size, const object *op, int goodbad)	172	die_roll (int num, int size, const object *op, int goodbad)
143	{	173	{
144	int min, diff, luck, total, i, gotlucky, base, ran;	174	int min, luck, total, i, gotlucky;
145		175
146	diff = size;	176	int diff = size;
147	min = 1;	177	min = 1;
148	luck = total = gotlucky = 0;	178	luck = total = gotlucky = 0;
149	((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
150	if (size < 2 \|\| diff < 1)	181	if (size < 2 \|\| diff < 1)
151	{	182	{
152	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);
153	return (num); /* avoids a float exception */	184	return num; /* avoids a float exception */
154	}	185	}
155		186
156	if (op->type == PLAYER)	187	if (op->type == PLAYER)
157	luck = op->stats.luck;	188	luck = op->stats.luck;
158		189
159	for (i = 0; i < num; i++)	190	for (i = 0; i < num; i++)
160	{	191	{
161	if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)	192	if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
162	{	193	{
163	/* we have a winner */	194	/* we have a winner */
164	gotlucky++;	195	gotlucky++;
165	((luck > 0) ? (luck = 1) : (luck = -1));	196	((luck > 0) ? (luck = 1) : (luck = -1));
166	diff -= luck;	197	diff -= luck;
167	if (diff < 1)	198	if (diff < 1)
168	return (num); /check again /	199	return (num); /check again /
169	((goodbad) ? (min += luck) : (diff));	200	((goodbad) ? (min += luck) : (diff));
170	ran = RANDOM ();
171	total += MAX (1, MIN (size, (ran % diff) + min));	201	total += MAX (1, MIN (size, rndm (diff) + min));
172	}	202	}
173	else	203	else
174	{
175	total += RANDOM () % size + 1;	204	total += rndm (size) + 1;
176	}
177	}	205	}
		206
178	return (total);	207	return total;
179	}
180
181	/*
182	* Another convenience function. Returns a number between min and max.
183	* It is suggested one use these functions rather than RANDOM()%, as it
184	* would appear that a number of off-by-one-errors exist due to improper
185	* use of %. This should also prevent SIGFPE.
186	*/
187
188	int
189	rndm (int min, int max)
190	{
191	int diff;
192
193	diff = max - min + 1;
194	if (max < 1 \|\| diff < 1)
195	return (min);
196
197	return (RANDOM () % diff + min);
198	}
199
200	/* decay and destroy perishable items in a map */
201	void
202	maptile::decay_objects ()
203	{
204	for (int x = 0; x < width; x++)
205	for (int y = 0; y < height; y++)
206	for (object above = 0, op = at (x, y).bot; op; op = above)
207	{
208	bool destroy = 0;
209
210	above = op->above;
211
212	// do not decay anything above unique floor tiles (yet :)
213	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
214	break;
215
216	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
217	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
218	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
219	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
220	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
221	\|\| QUERY_FLAG (op, FLAG_UNPAID)
222	\|\| op->is_alive ())
223	; // do not decay
224	else if (op->is_weapon ())
225	{
226	op->stats.dam--;
227	if (op->stats.dam < 0)
228	destroy = 1;
229	}
230	else if (op->is_armor ())
231	{
232	op->stats.ac--;
233	if (op->stats.ac < 0)
234	destroy = 1;
235	}
236	else if (op->type == FOOD)
237	{
238	op->stats.food -= rndm (5, 20);
239	if (op->stats.food < 0)
240	destroy = 1;
241	}
242	else
243	{
244	int mat = op->material;
245
246	if (mat & M_PAPER
247	\|\| mat & M_LEATHER
248	\|\| mat & M_WOOD
249	\|\| mat & M_ORGANIC
250	\|\| mat & M_CLOTH
251	\|\| mat & M_LIQUID
252	\|\| (mat & M_IRON && rndm (1, 5) == 1)
253	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
254	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
255	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
256	\|\| (mat & M_ICE && temp > 32))
257	destroy = 1;
258	}
259
260	/* adjust overall chance below */
261	if (destroy && rndm (0, 1))
262	op->destroy ();
263	}
264	}	208	}
265		209
266	/* convert materialname to materialtype_t */	210	/* convert materialname to materialtype_t */
267		211
268	materialtype_t *	212	materialtype_t *
269	name_to_material (const char *name)	213	name_to_material (const shstr &name)
270	{	214	{
271	materialtype_t mt, nmt;	215	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
		216	if (name == mt->name)
		217	return mt;
272		218
273	mt = NULL;
274	for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
275	{
276	if (strcmp (name, nmt->name) == 0)
277	{
278	mt = nmt;
279	break;
280	}
281	}
282	return mt;	219	return 0;
283	}	220	}
284		221
285	/* when doing transmutation of objects, we have to recheck the resistances,	222	/* when doing transmutation of objects, we have to recheck the resistances,
286	* as some that did not apply previously, may apply now.	223	* as some that did not apply previously, may apply now.
287	*/	224	*/
288
289	void	225	void
290	transmute_materialname (object op, const object change)	226	transmute_materialname (object op, const object change)
291	{	227	{
292	materialtype_t *mt;	228	materialtype_t *mt;
293	int j;	229	int j;
…		…
302	return;	238	return;
303		239
304	mt = name_to_material (op->materialname);	240	mt = name_to_material (op->materialname);
305	if (!mt)	241	if (!mt)
306	{	242	{
307	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);
308	return;	244	return;
309	}	245	}
310		246
311	for (j = 0; j < NROFATTACKS; j++)	247	for (j = 0; j < NROFATTACKS; j++)
312	if (op->resist[j] == 0 && change->resist[j] != 0)	248	if (op->resist[j] == 0 && change->resist[j] != 0)
…		…
323	void	259	void
324	set_materialname (object op, int difficulty, materialtype_t nmt)	260	set_materialname (object op, int difficulty, materialtype_t nmt)
325	{	261	{
326	materialtype_t mt, lmt;	262	materialtype_t mt, lmt;
327		263
328	#ifdef NEW_MATERIAL_CODE
329	int j;
330	#endif
331
332	if (op->materialname != NULL)	264	if (op->materialname != NULL)
333	return;	265	return;
334		266
335
336
337	if (nmt == NULL)	267	if (nmt == NULL)
338	{	268	{
339	lmt = NULL;	269	lmt = NULL;
340	#ifndef NEW_MATERIAL_CODE	270
341	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)	271	for (mt = materialt; mt && mt->next; mt = mt->next)
342	{	272	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
343	if (op->material & mt->material)	273	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
344	{	274	{
345	lmt = mt;	275	lmt = mt;
		276	if (!(op->is_weapon () \|\| op->is_armor ()))
346	break;	277	break;
347	}	278	}
348	}
349
350	#else
351	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
352	{
353	if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
354	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
355	{
356	lmt = mt;
357	if (!(op->is_weapon () \|\| op->is_armor ()))
358	break;
359	}
360	}
361	#endif
362	}	279	}
363	else	280	else
364	{
365	lmt = nmt;	281	lmt = nmt;
366	}
367		282
368	if (lmt != NULL)	283	if (lmt != NULL)
369	{	284	{
370	#ifndef NEW_MATERIAL_CODE
371	op->materialname = lmt->name;
372	return;
373	#else
374
375	if (op->stats.dam && op->is_weapon ())	285	if (op->stats.dam && op->is_weapon ())
376	{	286	{
377	op->stats.dam += lmt->damage;	287	op->stats.dam += lmt->damage;
378	if (op->stats.dam < 1)	288	if (op->stats.dam < 1)
379	op->stats.dam = 1;	289	op->stats.dam = 1;
380	}	290	}
		291
381	if (op->stats.sp && op->type == BOW)	292	if (op->stats.sp && op->type == BOW)
382	op->stats.sp += lmt->sp;	293	op->stats.sp += lmt->sp;
383	if (op->stats.wc && op->is_weapon ())	294	if (op->stats.wc && op->is_weapon ())
384	op->stats.wc += lmt->wc;	295	op->stats.wc += lmt->wc;
385	if (op->is_armor ())	296	if (op->is_armor ())
386	{	297	{
387	if (op->stats.ac)	298	if (op->stats.ac)
388	op->stats.ac += lmt->ac;	299	op->stats.ac += lmt->ac;
		300
389	for (j = 0; j < NROFATTACKS; j++)	301	for (int j = 0; j < NROFATTACKS; j++)
390	if (op->resist[j] != 0)	302	if (op->resist[j] != 0)
391	{	303	{
392	op->resist[j] += lmt->mod[j];	304	op->resist[j] += lmt->mod[j];
393	if (op->resist[j] > 100)	305	if (op->resist[j] > 100)
394	op->resist[j] = 100;	306	op->resist[j] = 100;
395	if (op->resist[j] < -100)	307	if (op->resist[j] < -100)
396	op->resist[j] = -100;	308	op->resist[j] = -100;
397	}	309	}
398	}	310	}
		311
399	op->materialname = add_string (lmt->name);	312	op->materialname = lmt->name;
400	/* dont make it unstackable if it doesn't need to be */	313	/* dont make it unstackable if it doesn't need to be */
401	if (op->is_weapon () \|\| op->is_armor ())	314	if (op->is_weapon () \|\| op->is_armor ())
402	{	315	{
403	op->weight = (op->weight * lmt->weight) / 100;	316	op->weight = (op->weight * lmt->weight) / 100;
404	op->value = (op->value * lmt->value) / 100;	317	op->value = (op->value * lmt->value) / 100;
405	}	318	}
406	#endif
407	}	319	}
408	}	320	}
409		321
410	/*	322	/*
411	* Strip out the media tags from a String.	323	* Strip out the media tags from a String.
…		…
506	* 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
507	* 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.
508	* This function will also strip all trailing non alphanumeric characters.	420	* This function will also strip all trailing non alphanumeric characters.
509	* It does not insert an oxford comma.	421	* It does not insert an oxford comma.
510	*/	422	*/
511
512	void	423	void
513	make_list_like (char *input)	424	make_list_like (char *input)
514	{	425	{
515	char *p, tmp[MAX_BUF];	426	char *p, tmp[MAX_BUF];
516	int i;	427	int i;
…		…
541	return;	452	return;
542	}	453	}
543		454
544	/////////////////////////////////////////////////////////////////////////////	455	/////////////////////////////////////////////////////////////////////////////
545		456
		457	void
		458	fork_abort (const char *msg)
		459	{
		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
546	void *salloc_ (int n) throw (std::bad_alloc)	472	void *salloc_ (int n) throw (std::bad_alloc)
547	{	473	{
548	void *ptr = g_slice_alloc (n);	474	void *ptr = g_slice_alloc (n);
549		475
550	if (!ptr)	476	if (!ptr)
551	throw std::bad_alloc ();	477	throw std::bad_alloc ();
552		478
		479	slice_alloc += n;
553	return ptr;	480	return ptr;
554	}	481	}
555		482
556	void salloc_ (int n, void src) throw (std::bad_alloc)	483	void salloc_ (int n, void src) throw (std::bad_alloc)
557	{	484	{
…		…
563	memset (ptr, 0, n);	490	memset (ptr, 0, n);
564		491
565	return ptr;	492	return ptr;
566	}	493	}
567		494
		495	/******************************************************************************/
		496
		497	#if DEBUG_SALLOC
		498
		499	#define MAGIC 0xa1b2c35543deadLL
		500
		501	void *g_slice_alloc (unsigned long size)
		502	{
		503	unsigned long p = (unsigned long ) (g_slice_alloc)(size + sizeof (unsigned long));
		504	*p++ = size ^ MAGIC;
		505	//fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
		506	return (void *)p;
		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
568	void assign (char dst, const char src, int maxlen)	538	void assign (char dst, const char src, int maxlen)
569	{	539	{
570	if (!src)	540	if (!src)
571	src = "";	541	src = "";
572		542
…		…
587	}	557	}
588	else	558	else
589	memcpy (dst, src, len + 1);	559	memcpy (dst, src, len + 1);
590	}	560	}
591		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
592	tstamp now ()	577	tstamp now ()
593	{	578	{
594	struct timeval tv;	579	struct timeval tv;
595		580
596	gettimeofday (&tv, 0);	581	gettimeofday (&tv, 0);
…		…
605		590
606	int diff = (b - a) & 7;	591	int diff = (b - a) & 7;
607	return diff <= 1 \|\| diff >= 7;	592	return diff <= 1 \|\| diff >= 7;
608	}	593	}
609		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.34 by root, Mon Jan 1 12:28:46 2007 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.34 by root, Mon Jan 1 12:28:46 2007 UTC vs.
Revision 1.74 by root, Fri Apr 11 21:09:52 2008 UTC