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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.22 by root, Tue Dec 12 21:39:56 2006 UTC vs. Revision 1.76 by root, Mon Apr 21 23:35:24 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.22 by root, Tue Dec 12 21:39:56 2006 UTC vs.
Revision 1.76 by root, Mon Apr 21 23:35:24 2008 UTC