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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.33 by root, Sun Dec 31 18:10:40 2006 UTC vs. Revision 1.80 by root, Wed Sep 10 18:18:10 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.33 by root, Sun Dec 31 18:10:40 2006 UTC vs.
Revision 1.80 by root, Wed Sep 10 18:18:10 2008 UTC