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

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

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.40 by root, Thu Jan 18 19:32:37 2007 UTC vs. Revision 1.79 by root, Sat Aug 30 05:19:03 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.40 by root, Thu Jan 18 19:32:37 2007 UTC vs.
Revision 1.79 by root, Sat Aug 30 05:19:03 2008 UTC