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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.23 by root, Sat Dec 16 03:08:25 2006 UTC vs.
Revision 1.97 by root, Fri Jul 2 02:00:47 2010 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) 2002 Mark Wedel & Crossfire Development Team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	Copyright (C) 1992 Frank Tore Johansen	5	*
6		6	* Deliantra is free software: you can redistribute it and/or modify it under
7	This program is free software; you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by	7	* the terms of the Affero GNU General Public License as published by the
9	the Free Software Foundation; either version 2 of the License, or	8	* Free Software Foundation, either version 3 of the License, or (at your
10	(at your option) any later version.	9	* option) any later version.
11		10	*
12	This program is distributed in the hope that it will be useful,	11	* This program is distributed in the hope that it will be useful,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	12	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	14	* GNU General Public License for more details.
16		15	*
17	You should have received a copy of the GNU General Public License	16	* You should have received a copy of the Affero GNU General Public License
18	along with this program; if not, write to the Free Software	17	* and the GNU General Public License along with this program. If not, see
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	18	* <http://www.gnu.org/licenses/>.
20		19	*
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	20	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	21	*/
23		22
24	/*	23	/*
25	* General convenience functions for crossfire.	24	* General convenience functions for deliantra.
26	*/	25	*/
27		26
28	#include <global.h>	27	#include <cstdlib>
		28	#include <sys/types.h>
29	#include <funcpoint.h>	29	#include <unistd.h>
30	#include <material.h>
31
32	#include <sys/time.h>	30	#include <sys/time.h>
33	#include <time.h>	31	#include <time.h>
		32	#include <signal.h>
		33
		34	#include <global.h>
		35	#include <material.h>
		36	#include <object.h>
		37
		38	#include <sys/time.h>
		39	#include <sys/resource.h>
		40
34	#include <glib.h>	41	#include <glib.h>
35		42
36	/*	43	refcnt_base::refcnt_t refcnt_dummy;
37	* The random functions here take luck into account when rolling random	44	ssize_t slice_alloc;
38	* dice or numbers. This function has less of an impact the larger the	45
39	* difference becomes in the random numbers. IE, the effect is lessened	46	#if !GCC_VERSION(3,4)
40	* on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers,	47	int least_significant_bit (uint32_t x)
41	* to specifically disable luck in certain rolls, simply by making the	48	{
42	* numbers larger (ie, 1d1000 > 500 vs 1d6 > 3)	49	x &= -x; // this isolates the lowest bit
		50
		51	int r = 0;
		52
		53	if (x & 0xaaaaaaaa) r += 1;
		54	if (x & 0xcccccccc) r += 2;
		55	if (x & 0xf0f0f0f0) r += 4;
		56	if (x & 0xff00ff00) r += 8;
		57	if (x & 0xffff0000) r += 16;
		58
		59	return r;
		60	}
		61	#endif
		62
		63	/******************************************************************************/
		64
		65	/* Checks a player-provided string which will become the msg property of
		66	* an object for dangerous input.
43	*/	67	*/
		68	bool
		69	msg_is_safe (const char *msg)
		70	{
		71	bool safe = true;
44		72
45	/*	73	/* Trying to cheat by getting data into the object */
46	* Roll a random number between min and max. Uses op to determine luck,	74	if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1)
47	* and if goodbad is non-zero, luck increases the roll, if zero, it decreases.	75	\|\| strstr (msg, "\nendmsg"))
48	* Generally, op should be the player/caster/hitter requesting the roll,	76	safe = false;
49	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]	77
50	*/	78	/* Trying to make the object talk, and potentially access arbitrary code */
		79	if (object::msg_has_dialogue (msg))
		80	safe = false;
		81
		82	return safe;
		83	}
		84
		85	/////////////////////////////////////////////////////////////////////////////
		86
		87	void
		88	fork_abort (const char *msg)
		89	{
		90	if (!fork ())
		91	{
		92	signal (SIGINT , SIG_IGN);
		93	signal (SIGTERM, SIG_IGN);
		94	signal (SIGABRT, SIG_IGN);
		95
		96	signal (SIGSEGV, SIG_DFL);
		97	signal (SIGBUS , SIG_DFL);
		98	signal (SIGILL , SIG_DFL);
		99	signal (SIGTRAP, SIG_DFL);
		100
		101	// try to put corefiles into a subdirectory, if existing, to allow
		102	// an administrator to reduce the I/O load.
		103	chdir ("cores");
		104
		105	// try to detach us from as many external dependencies as possible
		106	// as coredumping can take time by closing all fd's.
		107	{
		108	struct rlimit lim;
		109
		110	if (getrlimit (RLIMIT_NOFILE, &lim))
		111	lim.rlim_cur = 1024;
		112
		113	for (int i = 0; i < lim.rlim_cur; ++i)
		114	close (i);
		115	}
		116
		117	{
		118	sigset_t empty;
		119	sigemptyset (&empty);
		120	sigprocmask (SIG_SETMASK, &empty, 0);
		121	}
		122
		123	// try to coredump with SIGTRAP
		124	kill (getpid (), SIGTRAP);
		125	abort ();
		126	}
		127
		128	LOG (llevError, "fork abort: %s\n", msg);
		129	}
		130
		131	void *salloc_ (int n) throw (std::bad_alloc)
		132	{
		133	void *ptr = g_slice_alloc (n);
		134
		135	if (!ptr)
		136	throw std::bad_alloc ();
		137
		138	slice_alloc += n;
		139	return ptr;
		140	}
		141
		142	void salloc_ (int n, void src) throw (std::bad_alloc)
		143	{
		144	void *ptr = salloc_ (n);
		145
		146	if (src)
		147	memcpy (ptr, src, n);
		148	else
		149	memset (ptr, 0, n);
		150
		151	return ptr;
		152	}
		153
		154	/******************************************************************************/
		155
		156	#if DEBUG_SALLOC
		157
		158	#define MAGIC 0xa1b2c35543deadLL
		159
		160	void *g_slice_alloc (unsigned long size)
		161	{
		162	unsigned long p = (unsigned long ) (g_slice_alloc)(size + sizeof (unsigned long));
		163	*p++ = size ^ MAGIC;
		164	//fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
		165	return (void *)p;
		166	}
		167
		168	void *g_slice_alloc0 (unsigned long size)
		169	{
		170	return memset (g_slice_alloc (size), 0, size);
		171	}
		172
		173	void g_slice_free1 (unsigned long size, void *ptr)
		174	{
		175	//fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
		176	if (expect_true (ptr))
		177	{
		178	unsigned long p = (unsigned long )ptr;
		179	unsigned long s = *--p ^ MAGIC;
		180
		181	if (size != (unsigned long)(*p ^ MAGIC))
		182	{
		183	LOG (logBacktrace \| llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
		184	abort ();
		185	}
		186
		187	*p = MAGIC;
		188
		189	(g_slice_free1)(s + sizeof (unsigned long), p);
		190	}
		191	}
		192
		193	#endif
		194
		195	/******************************************************************************/
51		196
52	int	197	int
53	random_roll (int min, int max, const object *op, int goodbad)	198	assign (char dst, const char src, int maxsize)
54	{	199	{
55	int omin, diff, luck, base, ran;	200	if (!src)
		201	src = "";
56		202
57	omin = min;	203	int len = strlen (src);
58	diff = max - min + 1;
59	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
60		204
61	if (max < 1 \|\| diff < 1)	205	if (len >= maxsize)
62	{	206	{
63	LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max);	207	if (maxsize <= 4)
64	return (min); /* avoids a float exception */
65	}
66
67	ran = RANDOM ();
68
69	if (op->type != PLAYER)
70	return ((ran % diff) + min);
71
72	luck = op->stats.luck;
73	if (RANDOM () % base < MIN (10, abs (luck)))
74	{
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
82	return (MAX (omin, MIN (max, (ran % diff) + min)));
83	}
84	return ((ran % diff) + min);
85	}
86
87	/*
88	* This is a 64 bit version of random_roll above. This is needed
89	* for exp loss calculations for players changing religions.
90	*/
91
92	sint64
93	random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
94	{
95	sint64 omin, diff, luck, ran;
96	int base;
97
98	omin = min;
99	diff = max - min + 1;
100	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
101
102	if (max < 1 \|\| diff < 1)
103	{
104	LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
105	return (min); /* avoids a float exception */
106	}
107
108	/* Don't know of a portable call to get 64 bit random values.
109	* So make a call to get two 32 bit random numbers, and just to
110	* a little byteshifting. Do make sure the first one is only
111	* 32 bit, so we don't get skewed results
112	*/
113	ran = (RANDOM () & 0xffffffff) \| ((sint64) RANDOM () << 32);
114
115	if (op->type != PLAYER)
116	return ((ran % diff) + min);
117
118	luck = op->stats.luck;
119	if (RANDOM () % base < MIN (10, abs (luck)))
120	{
121	/* we have a winner */
122	((luck > 0) ? (luck = 1) : (luck = -1));
123	diff -= luck;
124	if (diff < 1)
125	return (omin); /check again /
126	((goodbad) ? (min += luck) : (diff));
127
128	return (MAX (omin, MIN (max, (ran % diff) + min)));
129	}
130	return ((ran % diff) + min);
131	}
132
133	/*
134	* 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.
136	* Generally, op should be the player/caster/hitter requesting the roll,
137	* not the recipient (ie, the poor slob getting hit).
138	* The args are num D size (ie 4d6) [garbled 20010916]
139	*/
140
141	int
142	die_roll (int num, int size, const object *op, int goodbad)
143	{
144	int min, diff, luck, total, i, gotlucky, base, ran;
145
146	diff = size;
147	min = 1;
148	luck = total = gotlucky = 0;
149	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
150	if (size < 2 \|\| diff < 1)
151	{
152	LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
153	return (num); /* avoids a float exception */
154	}
155
156	if (op->type == PLAYER)
157	luck = op->stats.luck;
158
159	for (i = 0; i < num; i++)
160	{
161	if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)
162	{	208	{
163	/* we have a winner */	209	memset (dst, '.', maxsize - 2);
164	gotlucky++;	210	dst [maxsize - 1] = 0;
165	((luck > 0) ? (luck = 1) : (luck = -1));
166	diff -= luck;
167	if (diff < 1)
168	return (num); /check again /
169	((goodbad) ? (min += luck) : (diff));
170	ran = RANDOM ();
171	total += MAX (1, MIN (size, (ran % diff) + min));
172	}	211	}
173	else	212	else
174	{	213	{
175	total += RANDOM () % size + 1;	214	memcpy (dst, src, maxsize - 4);
		215	memcpy (dst + maxsize - 4, "...", 4);
176	}	216	}
177	}
178	return (total);
179	}
180		217
181	/*	218	len = maxsize;
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 persihable items in a map */
201
202	void
203	decay_objects (maptile *m)
204	{
205	int x, y, destroy;
206	object op, otmp;
207
208	if (m->unique)
209	return;
210
211	for (x = 0; x < MAP_WIDTH (m); x++)
212	for (y = 0; y < MAP_HEIGHT (m); y++)
213	for (op = get_map_ob (m, x, y); op; op = otmp)
214	{
215	destroy = 0;
216	otmp = op->above;
217	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
218	break;
219	if (QUERY_FLAG (op, FLAG_IS_FLOOR) \|\|
220	QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) \|\|
221	QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) \|\|
222	QUERY_FLAG (op, FLAG_UNIQUE) \|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) \|\| QUERY_FLAG (op, FLAG_UNPAID) \|\| IS_LIVE (op))
223	continue;
224	/* otherwise, we decay and destroy */
225	if (IS_WEAPON (op))
226	{
227	op->stats.dam--;
228	if (op->stats.dam < 0)
229	destroy = 1;
230	}
231	else if (IS_ARMOR (op))
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	if (op->material & M_PAPER \|\| op->material & M_LEATHER \|\|
246	op->material & M_WOOD \|\| op->material & M_ORGANIC \|\| op->material & M_CLOTH \|\| op->material & M_LIQUID)
247	destroy = 1;
248	if (op->material & M_IRON && rndm (1, 5) == 1)
249	destroy = 1;
250	if (op->material & M_GLASS && rndm (1, 2) == 1)
251	destroy = 1;
252	if ((op->material & M_STONE \|\| op->material & M_ADAMANT) && rndm (1, 10) == 1)
253	destroy = 1;
254	if ((op->material & M_SOFT_METAL \|\| op->material & M_BONE) && rndm (1, 3) == 1)
255	destroy = 1;
256	if (op->material & M_ICE && MAP_TEMP (m) > 32)
257	destroy = 1;
258	}
259	/* adjust overall chance below */
260	if (destroy && rndm (0, 1))
261	op->destroy ();
262	}
263	}
264
265	/* convert materialname to materialtype_t */
266
267	materialtype_t *
268	name_to_material (const char *name)
269	{
270	materialtype_t mt, nmt;
271
272	mt = NULL;
273	for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
274	{
275	if (strcmp (name, nmt->name) == 0)
276	{
277	mt = nmt;
278	break;
279	}
280	}
281	return mt;
282	}
283
284	/* when doing transmutation of objects, we have to recheck the resistances,
285	* as some that did not apply previously, may apply now.
286	*/
287
288	void
289	transmute_materialname (object op, const object change)
290	{
291	materialtype_t *mt;
292	int j;
293
294	if (op->materialname == NULL)
295	return;
296
297	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
298	return;
299
300	if (!IS_ARMOR (op))
301	return;
302
303	mt = name_to_material (op->materialname);
304	if (!mt)
305	{
306	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);
307	return;
308	}
309
310	for (j = 0; j < NROFATTACKS; j++)
311	if (op->resist[j] == 0 && change->resist[j] != 0)
312	{
313	op->resist[j] += mt->mod[j];
314	if (op->resist[j] > 100)
315	op->resist[j] = 100;
316	if (op->resist[j] < -100)
317	op->resist[j] = -100;
318	}
319	}
320
321	/* set the materialname and type for an item */
322	void
323	set_materialname (object op, int difficulty, materialtype_t nmt)
324	{
325	materialtype_t mt, lmt;
326
327	#ifdef NEW_MATERIAL_CODE
328	int j;
329	#endif
330
331	if (op->materialname != NULL)
332	return;
333
334
335
336	if (nmt == NULL)
337	{
338	lmt = NULL;
339	#ifndef NEW_MATERIAL_CODE
340	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
341	{
342	if (op->material & mt->material)
343	{
344	lmt = mt;
345	break;
346	}
347	}
348
349	#else
350	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
351	{
352	if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
353	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
354	{
355	lmt = mt;
356	if (!(IS_WEAPON (op) \|\| IS_ARMOR (op)))
357	break;
358	}
359	}
360	#endif
361	}	219	}
362	else	220	else
363	{
364	lmt = nmt;
365	}
366
367	if (lmt != NULL)
368	{
369	#ifndef NEW_MATERIAL_CODE
370	op->materialname = lmt->name;
371	return;
372	#else
373
374	if (op->stats.dam && IS_WEAPON (op))
375	{
376	op->stats.dam += lmt->damage;
377	if (op->stats.dam < 1)
378	op->stats.dam = 1;
379	}
380	if (op->stats.sp && op->type == BOW)
381	op->stats.sp += lmt->sp;
382	if (op->stats.wc && IS_WEAPON (op))
383	op->stats.wc += lmt->wc;
384	if (IS_ARMOR (op))
385	{
386	if (op->stats.ac)
387	op->stats.ac += lmt->ac;
388	for (j = 0; j < NROFATTACKS; j++)
389	if (op->resist[j] != 0)
390	{
391	op->resist[j] += lmt->mod[j];
392	if (op->resist[j] > 100)
393	op->resist[j] = 100;
394	if (op->resist[j] < -100)
395	op->resist[j] = -100;
396	}
397	}
398	op->materialname = add_string (lmt->name);
399	/* dont make it unstackable if it doesn't need to be */
400	if (IS_WEAPON (op) \|\| IS_ARMOR (op))
401	{
402	op->weight = (op->weight * lmt->weight) / 100;
403	op->value = (op->value * lmt->value) / 100;
404	}
405	#endif
406	}
407	}
408
409	/*
410	* Strip out the media tags from a String.
411	* Warning the input string will contain the result string
412	*/
413	void
414	strip_media_tag (char *message)
415	{
416	int in_tag = 0;
417	char *dest;
418	char *src;
419
420	src = dest = message;
421	while (*src != '\0')
422	{
423	if (*src == '[')
424	{
425	in_tag = 1;
426	}
427	else if (in_tag && (*src == ']'))
428	in_tag = 0;
429	else if (!in_tag)
430	{
431	dest = src;
432	dest++;
433	}
434	src++;
435	}
436	*dest = '\0';
437	}
438
439	const char *
440	strrstr (const char haystack, const char needle)
441	{
442	const char *lastneedle;
443
444	lastneedle = NULL;
445	while ((haystack = strstr (haystack, needle)) != NULL)
446	{
447	lastneedle = haystack;
448	haystack++;
449	}
450	return lastneedle;
451
452	}
453
454	#define EOL_SIZE (sizeof("\n")-1)
455	void
456	strip_endline (char *buf)
457	{
458	if (strlen (buf) < sizeof ("\n"))
459	{
460	return;
461	}
462	if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
463	buf[strlen (buf) - EOL_SIZE] = '\0';
464	}
465
466	/**
467	* Replace in string src all occurrences of key by replacement. The resulting
468	* string is put into result; at most resultsize characters (including the
469	* terminating null character) will be written to result.
470	*/
471	void
472	replace (const char src, const char key, const char replacement, char result, size_t resultsize)
473	{
474	size_t resultlen;
475	size_t keylen;
476
477	/* special case to prevent infinite loop if key==replacement=="" */
478	if (strcmp (key, replacement) == 0)
479	{
480	snprintf (result, resultsize, "%s", src);
481	return;
482	}
483
484	keylen = strlen (key);
485
486	resultlen = 0;
487	while (*src != '\0' && resultlen + 1 < resultsize)
488	{
489	if (strncmp (src, key, keylen) == 0)
490	{
491	snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
492	resultlen += strlen (result + resultlen);
493	src += keylen;
494	}
495	else
496	{
497	result[resultlen++] = *src++;
498	}
499	}
500	result[resultlen] = '\0';
501	}
502
503	/**
504	* Taking a string as an argument, mutate it into a string that looks like a list.
505	* a 'list' for the purposes here, is a string of items, seperated by commas, except
506	* for the last entry, which has an 'and' before it, and a full stop (period) after it.
507	* This function will also strip all trailing non alphanumeric characters.
508	* It does not insert an oxford comma.
509	*/
510
511	void
512	make_list_like (char *input)
513	{
514	char *p, tmp[MAX_BUF];
515	int i;
516
517	if (!input \|\| strlen (input) > MAX_BUF - 5)
518	return;
519	/* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
520
521	strncpy (tmp, input, MAX_BUF - 5);
522	/trim all trailing commas, spaces etc. /
523	for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
524	tmp[i] = '\0';
525
526	strcat (tmp, ".");
527
528	p = strrchr (tmp, ',');
529	if (p)
530	{
531	*p = '\0';
532	strcpy (input, tmp);
533	p++;
534	strcat (input, " and");
535	strcat (input, p);
536	}
537	else
538	strcpy (input, tmp);
539
540	return;
541	}
542
543	/////////////////////////////////////////////////////////////////////////////
544
545	#if 0
546	refcounted *refcounted::rc_first;
547
548	refcounted::refcounted ()
549	{
550	refcnt = 0;
551	rc_next = rc_first;
552	rc_first = this;
553	}
554
555	refcounted::~refcounted ()
556	{
557	assert (!rc_next);
558	assert (!refcnt);
559	}
560	#endif
561
562	void *salloc (int size) throw (std::bad_alloc)
563	{
564	void *ptr = g_slice_alloc (size);
565
566	if (!ptr)
567	throw std::bad_alloc ();
568
569	return ptr;
570	}
571
572	void salloc (int size, void src) throw (std::bad_alloc)
573	{
574	void *ptr = salloc (size);
575
576	memcpy (ptr, src, size);
577
578	return ptr;
579	}
580
581	void assign (char dst, const char src, int maxlen)
582	{
583	if (!src)
584	src = "";
585
586	int len = strlen (src);
587
588	if (len >= maxlen - 1)
589	{
590	if (maxlen <= 4)
591	{
592	memset (dst, '.', maxlen - 1);
593	dst [maxlen - 1] = 0;
594	}
595	else
596	{
597	memcpy (dst, src, maxlen - 4);
598	memcpy (dst + maxlen - 4, "...", 4);
599	}
600	}
601	else
602	memcpy (dst, src, len + 1);	221	memcpy (dst, src, ++len);
		222
		223	return len;
		224	}
		225
		226	char *
		227	vformat (const char *format, va_list ap)
		228	{
		229	static dynbuf_text bufs[8];
		230	static int bufidx;
		231
		232	dynbuf_text &buf = bufs [++bufidx & 7];
		233
		234	buf.clear ();
		235	buf.vprintf (format, ap);
		236	return buf;
		237	}
		238
		239	char *
		240	format (const char *format, ...)
		241	{
		242	va_list ap;
		243	va_start (ap, format);
		244	char *buf = vformat (format, ap);
		245	va_end (ap);
		246
		247	return buf;
603	}	248	}
604		249
605	tstamp now ()	250	tstamp now ()
606	{	251	{
607	struct timeval tv;	252	struct timeval tv;
608		253
609	gettimeofday (&tv, 0);	254	gettimeofday (&tv, 0);
610	return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);	255	return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
611	}	256	}
612		257
		258	int
		259	similar_direction (int a, int b)
		260	{
		261	if (!a \|\| !b)
		262	return 0;
		263
		264	int diff = (b - a) & 7;
		265	return diff <= 1 \|\| diff >= 7;
		266	}
		267
		268	/* crc32 0xdebb20e3 table and supplementary functions. */
		269	extern const uint32_t crc_32_tab[256] =
		270	{
		271	0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
		272	0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
		273	0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
		274	0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
		275	0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
		276	0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
		277	0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
		278	0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
		279	0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
		280	0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
		281	0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
		282	0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
		283	0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
		284	0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
		285	0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
		286	0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
		287	0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
		288	0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
		289	0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
		290	0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
		291	0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
		292	0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
		293	0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
		294	0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
		295	0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
		296	0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
		297	0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
		298	0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
		299	0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
		300	0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
		301	0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
		302	0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
		303	0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
		304	0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
		305	0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
		306	0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
		307	0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
		308	0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
		309	0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
		310	0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
		311	0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
		312	0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
		313	0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
		314	0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
		315	0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
		316	0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
		317	0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
		318	0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
		319	0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
		320	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
		321	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
		322	0x2d02ef8dL
		323	};
		324
		325	void thread::start (void (start_routine)(void ), void arg)
		326	{
		327	pthread_attr_t attr;
		328
		329	pthread_attr_init (&attr);
		330	pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
		331	pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
		332	? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
		333	#ifdef PTHREAD_SCOPE_PROCESS
		334	pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
		335	#endif
		336
		337	sigset_t fullsigset, oldsigset;
		338	sigfillset (&fullsigset);
		339
		340	pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
		341
		342	if (pthread_create (&id, &attr, start_routine, arg))
		343	cleanup ("unable to create a new thread");
		344
		345	pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
		346	}
		347

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.23 by root, Sat Dec 16 03:08:25 2006 UTC vs. Revision 1.97 by root, Fri Jul 2 02:00:47 2010 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.23 by root, Sat Dec 16 03:08:25 2006 UTC vs.
Revision 1.97 by root, Fri Jul 2 02:00:47 2010 UTC