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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.41 by root, Thu Jan 18 22:19:59 2007 UTC vs.
Revision 1.77 by root, Sun May 4 14:12:37 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
40	#include <glib.h>	38	#include <glib.h>
41		39
42	rand_gen rndm (time (0));	40	refcnt_base::refcnt_t refcnt_dummy;
		41	ssize_t slice_alloc;
		42	rand_gen rndm, rmg_rndm;
43		43
		44	void
44	tausworthe_random_generator::tausworthe_random_generator (uint32_t seed)	45	tausworthe_random_generator::seed (uint32_t seed)
45	{	46	{
46	state [0] = max ( 2, seed * 69069U);	47	state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
47	state [1] = max ( 8, state [0] * 69069U);	48	state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
48	state [2] = max ( 16, state [1] * 69069U);	49	state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
49	state [3] = max (128, state [2] * 69069U);	50	state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
50		51
51	for (int i = 11; --i; )	52	for (int i = 11; --i; )
52	operator ()();	53	operator ()();
53	}	54	}
54		55
…		…
59	state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U);	60	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);	61	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);	62	state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
62		63
63	return state [0] ^ state [1] ^ state [2] ^ state [3];	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));
64	}	78	}
65		79
66	/*	80	/*
67	* The random functions here take luck into account when rolling random	81	* 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	82	* dice or numbers. This function has less of an impact the larger the
…		…
81	int	95	int
82	random_roll (int r_min, int r_max, const object *op, int goodbad)	96	random_roll (int r_min, int r_max, const object *op, int goodbad)
83	{	97	{
84	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */	98	int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
85		99
86	if (r_max < 1 \|\| r_max < r_min)	100	if (r_max < r_min)
87	{	101	{
88	LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max);	102	LOG (llevError \| logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
89	return r_min;	103	return r_min;
90	}	104	}
91		105
92	if (op->type == PLAYER)	106	if (op->type == PLAYER)
93	{	107	{
…		…
104		118
105	/*	119	/*
106	* This is a 64 bit version of random_roll above. This is needed	120	* This is a 64 bit version of random_roll above. This is needed
107	* for exp loss calculations for players changing religions.	121	* for exp loss calculations for players changing religions.
108	*/	122	*/
109
110	sint64	123	sint64
111	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)	124	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
112	{	125	{
113	sint64 omin, diff, luck, ran;
114	int base;
115
116	omin = min;	126	sint64 omin = min;
117	diff = max - min + 1;	127	sint64 diff = max - min + 1;
118	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	128	int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
119		129
120	if (max < 1 \|\| diff < 1)	130	if (diff < 0)
121	{	131	{
122	LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);	132	LOG (llevError \| logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max);
123	return (min); /* avoids a float exception */	133	return (min); /* avoids a float exception */
124	}	134	}
125		135
126	/* Don't know of a portable call to get 64 bit random values.	136	/*
127	* So make a call to get two 32 bit random numbers, and just to	137	* Make a call to get two 32 bit unsigned random numbers, and just to
128	* a little byteshifting. Do make sure the first one is only	138	* a little bitshifting.
129	* 32 bit, so we don't get skewed results
130	*/	139	*/
131	ran = (RANDOM () & 0xffffffff) \| ((sint64) RANDOM () << 32);	140	sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
132		141
133	if (op->type != PLAYER)	142	if (op->type != PLAYER)
134	return ((ran % diff) + min);	143	return ((ran % diff) + min);
135		144
136	luck = op->stats.luck;	145	int luck = op->stats.luck;
		146
137	if (RANDOM () % base < MIN (10, abs (luck)))	147	if (rndm (base) < MIN (10, abs (luck)))
138	{	148	{
139	/* we have a winner */	149	/* we have a winner */
140	((luck > 0) ? (luck = 1) : (luck = -1));	150	((luck > 0) ? (luck = 1) : (luck = -1));
141	diff -= luck;	151	diff -= luck;
142	if (diff < 1)	152	if (diff < 1)
143	return (omin); /check again /	153	return (omin); /check again /
		154
144	((goodbad) ? (min += luck) : (diff));	155	((goodbad) ? (min += luck) : (diff));
145		156
146	return (MAX (omin, MIN (max, (ran % diff) + min)));	157	return (MAX (omin, MIN (max, (ran % diff) + min)));
147	}	158	}
		159
148	return ((ran % diff) + min);	160	return ran % diff + min;
149	}	161	}
150		162
151	/*	163	/*
152	* 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,
153	* 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.
154	* Generally, op should be the player/caster/hitter requesting the roll,	166	* Generally, op should be the player/caster/hitter requesting the roll,
155	* not the recipient (ie, the poor slob getting hit).	167	* not the recipient (ie, the poor slob getting hit).
156	* The args are num D size (ie 4d6) [garbled 20010916]	168	* The args are num D size (ie 4d6) [garbled 20010916]
157	*/	169	*/
158
159	int	170	int
160	die_roll (int num, int size, const object *op, int goodbad)	171	die_roll (int num, int size, const object *op, int goodbad)
161	{	172	{
162	int min, diff, luck, total, i, gotlucky, base, ran;	173	int min, luck, total, i, gotlucky;
163		174
164	diff = size;	175	int diff = size;
165	min = 1;	176	min = 1;
166	luck = total = gotlucky = 0;	177	luck = total = gotlucky = 0;
167	((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
168	if (size < 2 \|\| diff < 1)	180	if (size < 2 \|\| diff < 1)
169	{	181	{
170	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);
171	return (num); /* avoids a float exception */	183	return num; /* avoids a float exception */
172	}	184	}
173		185
174	if (op->type == PLAYER)	186	if (op->type == PLAYER)
175	luck = op->stats.luck;	187	luck = op->stats.luck;
176		188
177	for (i = 0; i < num; i++)	189	for (i = 0; i < num; i++)
178	{	190	{
179	if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)	191	if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
180	{	192	{
181	/* we have a winner */	193	/* we have a winner */
182	gotlucky++;	194	gotlucky++;
183	((luck > 0) ? (luck = 1) : (luck = -1));	195	((luck > 0) ? (luck = 1) : (luck = -1));
184	diff -= luck;	196	diff -= luck;
185	if (diff < 1)	197	if (diff < 1)
186	return (num); /check again /	198	return (num); /check again /
187	((goodbad) ? (min += luck) : (diff));	199	((goodbad) ? (min += luck) : (diff));
188	ran = RANDOM ();
189	total += MAX (1, MIN (size, (ran % diff) + min));	200	total += MAX (1, MIN (size, rndm (diff) + min));
190	}	201	}
191	else	202	else
192	{
193	total += RANDOM () % size + 1;	203	total += rndm (size) + 1;
194	}
195	}	204	}
		205
196	return (total);	206	return total;
197	}
198
199	/* decay and destroy perishable items in a map */
200	void
201	maptile::decay_objects ()
202	{
203	if (!spaces)
204	return;
205
206	for (mapspace *ms = spaces + size (); ms-- > spaces; )
207	for (object above, op = ms->bot; op; op = above)
208	{
209	above = op->above;
210
211	bool destroy = 0;
212
213	// do not decay anything above unique floor tiles (yet :)
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	; // do not decay
225	else if (op->is_weapon ())
226	{
227	op->stats.dam--;
228	if (op->stats.dam < 0)
229	destroy = 1;
230	}
231	else if (op->is_armor ())
232	{
233	op->stats.ac--;
234	if (op->stats.ac < 0)
235	destroy = 1;
236	}
237	else if (op->type == FOOD)
238	{
239	op->stats.food -= rndm (5, 20);
240	if (op->stats.food < 0)
241	destroy = 1;
242	}
243	else
244	{
245	int mat = op->material;
246
247	if (mat & M_PAPER
248	\|\| mat & M_LEATHER
249	\|\| mat & M_WOOD
250	\|\| mat & M_ORGANIC
251	\|\| mat & M_CLOTH
252	\|\| mat & M_LIQUID
253	\|\| (mat & M_IRON && rndm (1, 5) == 1)
254	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
255	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
256	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
257	\|\| (mat & M_ICE && temp > 32))
258	destroy = 1;
259	}
260
261	/* adjust overall chance below */
262	if (destroy && rndm (0, 1))
263	op->destroy ();
264	}
265	}	207	}
266		208
267	/* convert materialname to materialtype_t */	209	/* convert materialname to materialtype_t */
268		210
269	materialtype_t *	211	materialtype_t *
270	name_to_material (const char *name)	212	name_to_material (const shstr &name)
271	{	213	{
272	materialtype_t mt, nmt;	214	for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
		215	if (name == mt->name)
		216	return mt;
273		217
274	mt = NULL;
275	for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
276	{
277	if (strcmp (name, nmt->name) == 0)
278	{
279	mt = nmt;
280	break;
281	}
282	}
283	return mt;	218	return 0;
284	}	219	}
285		220
286	/* when doing transmutation of objects, we have to recheck the resistances,	221	/* when doing transmutation of objects, we have to recheck the resistances,
287	* as some that did not apply previously, may apply now.	222	* as some that did not apply previously, may apply now.
288	*/	223	*/
289
290	void	224	void
291	transmute_materialname (object op, const object change)	225	transmute_materialname (object op, const object change)
292	{	226	{
293	materialtype_t *mt;	227	materialtype_t *mt;
294	int j;	228	int j;
…		…
303	return;	237	return;
304		238
305	mt = name_to_material (op->materialname);	239	mt = name_to_material (op->materialname);
306	if (!mt)	240	if (!mt)
307	{	241	{
308	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);
309	return;	243	return;
310	}	244	}
311		245
312	for (j = 0; j < NROFATTACKS; j++)	246	for (j = 0; j < NROFATTACKS; j++)
313	if (op->resist[j] == 0 && change->resist[j] != 0)	247	if (op->resist[j] == 0 && change->resist[j] != 0)
…		…
324	void	258	void
325	set_materialname (object op, int difficulty, materialtype_t nmt)	259	set_materialname (object op, int difficulty, materialtype_t nmt)
326	{	260	{
327	materialtype_t mt, lmt;	261	materialtype_t mt, lmt;
328		262
329	#ifdef NEW_MATERIAL_CODE
330	int j;
331	#endif
332
333	if (op->materialname != NULL)	263	if (op->materialname != NULL)
334	return;	264	return;
335		265
336
337
338	if (nmt == NULL)	266	if (nmt == NULL)
339	{	267	{
340	lmt = NULL;	268	lmt = NULL;
341	#ifndef NEW_MATERIAL_CODE	269
342	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)	270	for (mt = materialt; mt && mt->next; mt = mt->next)
343	{	271	if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
344	if (op->material & mt->material)	272	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
345	{	273	{
346	lmt = mt;	274	lmt = mt;
		275	if (!(op->is_weapon () \|\| op->is_armor ()))
347	break;	276	break;
348	}	277	}
349	}
350
351	#else
352	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
353	{
354	if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
355	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
356	{
357	lmt = mt;
358	if (!(op->is_weapon () \|\| op->is_armor ()))
359	break;
360	}
361	}
362	#endif
363	}	278	}
364	else	279	else
365	{
366	lmt = nmt;	280	lmt = nmt;
367	}
368		281
369	if (lmt != NULL)	282	if (lmt != NULL)
370	{	283	{
371	#ifndef NEW_MATERIAL_CODE
372	op->materialname = lmt->name;
373	return;
374	#else
375
376	if (op->stats.dam && op->is_weapon ())	284	if (op->stats.dam && op->is_weapon ())
377	{	285	{
378	op->stats.dam += lmt->damage;	286	op->stats.dam += lmt->damage;
379	if (op->stats.dam < 1)	287	if (op->stats.dam < 1)
380	op->stats.dam = 1;	288	op->stats.dam = 1;
381	}	289	}
		290
382	if (op->stats.sp && op->type == BOW)	291	if (op->stats.sp && op->type == BOW)
383	op->stats.sp += lmt->sp;	292	op->stats.sp += lmt->sp;
384	if (op->stats.wc && op->is_weapon ())	293	if (op->stats.wc && op->is_weapon ())
385	op->stats.wc += lmt->wc;	294	op->stats.wc += lmt->wc;
386	if (op->is_armor ())	295	if (op->is_armor ())
387	{	296	{
388	if (op->stats.ac)	297	if (op->stats.ac)
389	op->stats.ac += lmt->ac;	298	op->stats.ac += lmt->ac;
		299
390	for (j = 0; j < NROFATTACKS; j++)	300	for (int j = 0; j < NROFATTACKS; j++)
391	if (op->resist[j] != 0)	301	if (op->resist[j] != 0)
392	{	302	{
393	op->resist[j] += lmt->mod[j];	303	op->resist[j] += lmt->mod[j];
394	if (op->resist[j] > 100)	304	if (op->resist[j] > 100)
395	op->resist[j] = 100;	305	op->resist[j] = 100;
396	if (op->resist[j] < -100)	306	if (op->resist[j] < -100)
397	op->resist[j] = -100;	307	op->resist[j] = -100;
398	}	308	}
399	}	309	}
		310
400	op->materialname = add_string (lmt->name);	311	op->materialname = lmt->name;
401	/* dont make it unstackable if it doesn't need to be */	312	/* dont make it unstackable if it doesn't need to be */
402	if (op->is_weapon () \|\| op->is_armor ())	313	if (op->is_weapon () \|\| op->is_armor ())
403	{	314	{
404	op->weight = (op->weight * lmt->weight) / 100;	315	op->weight = (op->weight * lmt->weight) / 100;
405	op->value = (op->value * lmt->value) / 100;	316	op->value = (op->value * lmt->value) / 100;
406	}	317	}
407	#endif
408	}	318	}
409	}	319	}
410		320
411	/*	321	/*
412	* Strip out the media tags from a String.	322	* Strip out the media tags from a String.
…		…
507	* 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
508	* 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.
509	* This function will also strip all trailing non alphanumeric characters.	419	* This function will also strip all trailing non alphanumeric characters.
510	* It does not insert an oxford comma.	420	* It does not insert an oxford comma.
511	*/	421	*/
512
513	void	422	void
514	make_list_like (char *input)	423	make_list_like (char *input)
515	{	424	{
516	char *p, tmp[MAX_BUF];	425	char *p, tmp[MAX_BUF];
517	int i;	426	int i;
…		…
548	fork_abort (const char *msg)	457	fork_abort (const char *msg)
549	{	458	{
550	if (!fork ())	459	if (!fork ())
551	{	460	{
552	signal (SIGABRT, SIG_DFL);	461	signal (SIGABRT, SIG_DFL);
		462	// try to put corefiles into a subdirectory, if existing, to allow
		463	// an administrator to reduce the I/O load.
		464	chdir ("cores");
553	abort ();	465	abort ();
554	}	466	}
555		467
556	LOG (llevError, "fork abort: %s\n", msg);	468	LOG (llevError, "fork abort: %s\n", msg);
557	}	469	}
…		…
561	void *ptr = g_slice_alloc (n);	473	void *ptr = g_slice_alloc (n);
562		474
563	if (!ptr)	475	if (!ptr)
564	throw std::bad_alloc ();	476	throw std::bad_alloc ();
565		477
		478	slice_alloc += n;
566	return ptr;	479	return ptr;
567	}	480	}
568		481
569	void salloc_ (int n, void src) throw (std::bad_alloc)	482	void salloc_ (int n, void src) throw (std::bad_alloc)
570	{	483	{
…		…
576	memset (ptr, 0, n);	489	memset (ptr, 0, n);
577		490
578	return ptr;	491	return ptr;
579	}	492	}
580		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
		533	#endif
		534
		535	/******************************************************************************/
		536
581	void assign (char dst, const char src, int maxlen)	537	void assign (char dst, const char src, int maxlen)
582	{	538	{
583	if (!src)	539	if (!src)
584	src = "";	540	src = "";
585		541
…		…
600	}	556	}
601	else	557	else
602	memcpy (dst, src, len + 1);	558	memcpy (dst, src, len + 1);
603	}	559	}
604		560
		561	const char *
		562	format (const char *format, ...)
		563	{
		564	static dynbuf_text buf;
		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
605	tstamp now ()	576	tstamp now ()
606	{	577	{
607	struct timeval tv;	578	struct timeval tv;
608		579
609	gettimeofday (&tv, 0);	580	gettimeofday (&tv, 0);
…		…
618		589
619	int diff = (b - a) & 7;	590	int diff = (b - a) & 7;
620	return diff <= 1 \|\| diff >= 7;	591	return diff <= 1 \|\| diff >= 7;
621	}	592	}
622		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.41 by root, Thu Jan 18 22:19:59 2007 UTC vs. Revision 1.77 by root, Sun May 4 14:12:37 2008 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.41 by root, Thu Jan 18 22:19:59 2007 UTC vs.
Revision 1.77 by root, Sun May 4 14:12:37 2008 UTC