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

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.34 by root, Mon Jan 1 12:28:46 2007 UTC vs.
Revision 1.105 by root, Thu Jan 19 21:51:43 2017 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,2011,2012,2013,2014,2015,2016 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	*/
44		68	bool
45	/*	69	msg_is_safe (const char *msg)
46	* Roll a random number between min and max. Uses op to determine luck,
47	* and if goodbad is non-zero, luck increases the roll, if zero, it decreases.
48	* Generally, op should be the player/caster/hitter requesting the roll,
49	* not the recipient (ie, the poor slob getting hit). [garbled 20010916]
50	*/
51
52	int
53	random_roll (int min, int max, const object *op, int goodbad)
54	{	70	{
55	int omin, diff, luck, base, ran;	71	bool safe = true;
56		72
57	omin = min;	73	/* Trying to cheat by getting data into the object */
58	diff = max - min + 1;	74	if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1)
59	((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */	75	\|\| strstr (msg, "\nendmsg"))
		76	safe = false;
60		77
61	if (max < 1 \|\| diff < 1)	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 ())
62	{	91	{
63	LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max);	92	signal (SIGINT , SIG_IGN);
64	return (min); /* avoids a float exception */	93	signal (SIGTERM, SIG_IGN);
		94	signal (SIGABRT, SIG_IGN);
		95
		96	signal (SIGSEGV, SIG_DFL);
		97	signal (SIGFPE , SIG_DFL);
		98	#ifdef SIGBUS
		99	signal (SIGBUS , SIG_DFL);
		100	#endif
		101	signal (SIGILL , SIG_DFL);
		102	signal (SIGTRAP, SIG_DFL);
		103
		104	// try to put corefiles into a subdirectory, if existing, to allow
		105	// an administrator to reduce the I/O load.
		106	chdir ("cores");
		107
		108	// try to detach us from as many external dependencies as possible
		109	// as coredumping can take time by closing all fd's.
		110	{
		111	struct rlimit lim;
		112
		113	if (getrlimit (RLIMIT_NOFILE, &lim))
		114	lim.rlim_cur = 1024;
		115
		116	for (int i = 0; i < lim.rlim_cur; ++i)
		117	close (i);
		118	}
		119
		120	{
		121	sigset_t empty;
		122	sigemptyset (&empty);
		123	sigprocmask (SIG_SETMASK, &empty, 0);
		124	}
		125
		126	// try to coredump with SIGTRAP
		127	kill (getpid (), SIGTRAP);
		128	abort ();
65	}	129	}
66		130
67	ran = RANDOM ();	131	LOG (llevError, "fork abort: %s\n", msg);
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	}	132	}
86		133
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	{
163	/* we have a winner */
164	gotlucky++;
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	}
173	else
174	{
175	total += RANDOM () % size + 1;
176	}
177	}
178	return (total);
179	}
180
181	/*
182	* Another convenience function. Returns a number between min and max.
183	* It is suggested one use these functions rather than RANDOM()%, as it
184	* would appear that a number of off-by-one-errors exist due to improper
185	* use of %. This should also prevent SIGFPE.
186	*/
187
188	int
189	rndm (int min, int max)
190	{
191	int diff;
192
193	diff = max - min + 1;
194	if (max < 1 \|\| diff < 1)
195	return (min);
196
197	return (RANDOM () % diff + min);
198	}
199
200	/* decay and destroy perishable items in a map */
201	void	134	void *
202	maptile::decay_objects ()
203	{
204	for (int x = 0; x < width; x++)
205	for (int y = 0; y < height; y++)
206	for (object above = 0, op = at (x, y).bot; op; op = above)
207	{
208	bool destroy = 0;
209
210	above = op->above;
211
212	// do not decay anything above unique floor tiles (yet :)
213	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
214	break;
215
216	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
217	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
218	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
219	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
220	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
221	\|\| QUERY_FLAG (op, FLAG_UNPAID)
222	\|\| op->is_alive ())
223	; // do not decay
224	else if (op->is_weapon ())
225	{
226	op->stats.dam--;
227	if (op->stats.dam < 0)
228	destroy = 1;
229	}
230	else if (op->is_armor ())
231	{
232	op->stats.ac--;
233	if (op->stats.ac < 0)
234	destroy = 1;
235	}
236	else if (op->type == FOOD)
237	{
238	op->stats.food -= rndm (5, 20);
239	if (op->stats.food < 0)
240	destroy = 1;
241	}
242	else
243	{
244	int mat = op->material;
245
246	if (mat & M_PAPER
247	\|\| mat & M_LEATHER
248	\|\| mat & M_WOOD
249	\|\| mat & M_ORGANIC
250	\|\| mat & M_CLOTH
251	\|\| mat & M_LIQUID
252	\|\| (mat & M_IRON && rndm (1, 5) == 1)
253	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
254	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
255	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
256	\|\| (mat & M_ICE && temp > 32))
257	destroy = 1;
258	}
259
260	/* adjust overall chance below */
261	if (destroy && rndm (0, 1))
262	op->destroy ();
263	}
264	}
265
266	/* convert materialname to materialtype_t */
267
268	materialtype_t *
269	name_to_material (const char *name)
270	{
271	materialtype_t mt, nmt;
272
273	mt = NULL;
274	for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
275	{
276	if (strcmp (name, nmt->name) == 0)
277	{
278	mt = nmt;
279	break;
280	}
281	}
282	return mt;
283	}
284
285	/* when doing transmutation of objects, we have to recheck the resistances,
286	* as some that did not apply previously, may apply now.
287	*/
288
289	void
290	transmute_materialname (object op, const object change)
291	{
292	materialtype_t *mt;
293	int j;
294
295	if (op->materialname == NULL)
296	return;
297
298	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
299	return;
300
301	if (!op->is_armor ())
302	return;
303
304	mt = name_to_material (op->materialname);
305	if (!mt)
306	{
307	LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);
308	return;
309	}
310
311	for (j = 0; j < NROFATTACKS; j++)
312	if (op->resist[j] == 0 && change->resist[j] != 0)
313	{
314	op->resist[j] += mt->mod[j];
315	if (op->resist[j] > 100)
316	op->resist[j] = 100;
317	if (op->resist[j] < -100)
318	op->resist[j] = -100;
319	}
320	}
321
322	/* set the materialname and type for an item */
323	void
324	set_materialname (object op, int difficulty, materialtype_t nmt)
325	{
326	materialtype_t mt, lmt;
327
328	#ifdef NEW_MATERIAL_CODE
329	int j;
330	#endif
331
332	if (op->materialname != NULL)
333	return;
334
335
336
337	if (nmt == NULL)
338	{
339	lmt = NULL;
340	#ifndef NEW_MATERIAL_CODE
341	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
342	{
343	if (op->material & mt->material)
344	{
345	lmt = mt;
346	break;
347	}
348	}
349
350	#else
351	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
352	{
353	if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
354	difficulty >= mt->difficulty && (op->magic >= mt->magic \|\| mt->magic == 0))
355	{
356	lmt = mt;
357	if (!(op->is_weapon () \|\| op->is_armor ()))
358	break;
359	}
360	}
361	#endif
362	}
363	else
364	{
365	lmt = nmt;
366	}
367
368	if (lmt != NULL)
369	{
370	#ifndef NEW_MATERIAL_CODE
371	op->materialname = lmt->name;
372	return;
373	#else
374
375	if (op->stats.dam && op->is_weapon ())
376	{
377	op->stats.dam += lmt->damage;
378	if (op->stats.dam < 1)
379	op->stats.dam = 1;
380	}
381	if (op->stats.sp && op->type == BOW)
382	op->stats.sp += lmt->sp;
383	if (op->stats.wc && op->is_weapon ())
384	op->stats.wc += lmt->wc;
385	if (op->is_armor ())
386	{
387	if (op->stats.ac)
388	op->stats.ac += lmt->ac;
389	for (j = 0; j < NROFATTACKS; j++)
390	if (op->resist[j] != 0)
391	{
392	op->resist[j] += lmt->mod[j];
393	if (op->resist[j] > 100)
394	op->resist[j] = 100;
395	if (op->resist[j] < -100)
396	op->resist[j] = -100;
397	}
398	}
399	op->materialname = add_string (lmt->name);
400	/* dont make it unstackable if it doesn't need to be */
401	if (op->is_weapon () \|\| op->is_armor ())
402	{
403	op->weight = (op->weight * lmt->weight) / 100;
404	op->value = (op->value * lmt->value) / 100;
405	}
406	#endif
407	}
408	}
409
410	/*
411	* Strip out the media tags from a String.
412	* Warning the input string will contain the result string
413	*/
414	void
415	strip_media_tag (char *message)
416	{
417	int in_tag = 0;
418	char *dest;
419	char *src;
420
421	src = dest = message;
422	while (*src != '\0')
423	{
424	if (*src == '[')
425	{
426	in_tag = 1;
427	}
428	else if (in_tag && (*src == ']'))
429	in_tag = 0;
430	else if (!in_tag)
431	{
432	dest = src;
433	dest++;
434	}
435	src++;
436	}
437	*dest = '\0';
438	}
439
440	const char *
441	strrstr (const char haystack, const char needle)
442	{
443	const char *lastneedle;
444
445	lastneedle = NULL;
446	while ((haystack = strstr (haystack, needle)) != NULL)
447	{
448	lastneedle = haystack;
449	haystack++;
450	}
451	return lastneedle;
452
453	}
454
455	#define EOL_SIZE (sizeof("\n")-1)
456	void
457	strip_endline (char *buf)
458	{
459	if (strlen (buf) < sizeof ("\n"))
460	{
461	return;
462	}
463	if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
464	buf[strlen (buf) - EOL_SIZE] = '\0';
465	}
466
467	/**
468	* Replace in string src all occurrences of key by replacement. The resulting
469	* string is put into result; at most resultsize characters (including the
470	* terminating null character) will be written to result.
471	*/
472	void
473	replace (const char src, const char key, const char replacement, char result, size_t resultsize)
474	{
475	size_t resultlen;
476	size_t keylen;
477
478	/* special case to prevent infinite loop if key==replacement=="" */
479	if (strcmp (key, replacement) == 0)
480	{
481	snprintf (result, resultsize, "%s", src);
482	return;
483	}
484
485	keylen = strlen (key);
486
487	resultlen = 0;
488	while (*src != '\0' && resultlen + 1 < resultsize)
489	{
490	if (strncmp (src, key, keylen) == 0)
491	{
492	snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
493	resultlen += strlen (result + resultlen);
494	src += keylen;
495	}
496	else
497	{
498	result[resultlen++] = *src++;
499	}
500	}
501	result[resultlen] = '\0';
502	}
503
504	/**
505	* Taking a string as an argument, mutate it into a string that looks like a list.
506	* a 'list' for the purposes here, is a string of items, seperated by commas, except
507	* for the last entry, which has an 'and' before it, and a full stop (period) after it.
508	* This function will also strip all trailing non alphanumeric characters.
509	* It does not insert an oxford comma.
510	*/
511
512	void
513	make_list_like (char *input)
514	{
515	char *p, tmp[MAX_BUF];
516	int i;
517
518	if (!input \|\| strlen (input) > MAX_BUF - 5)
519	return;
520	/* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
521
522	strncpy (tmp, input, MAX_BUF - 5);
523	/trim all trailing commas, spaces etc. /
524	for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
525	tmp[i] = '\0';
526
527	strcat (tmp, ".");
528
529	p = strrchr (tmp, ',');
530	if (p)
531	{
532	*p = '\0';
533	strcpy (input, tmp);
534	p++;
535	strcat (input, " and");
536	strcat (input, p);
537	}
538	else
539	strcpy (input, tmp);
540
541	return;
542	}
543
544	/////////////////////////////////////////////////////////////////////////////
545
546	void *salloc_ (int n) throw (std::bad_alloc)	135	salloc_ (int n) throw (std::bad_alloc)
547	{	136	{
548	void *ptr = g_slice_alloc (n);	137	void *ptr = g_slice_alloc (n);
549		138
550	if (!ptr)	139	if (!ptr)
551	throw std::bad_alloc ();	140	throw std::bad_alloc ();
552		141
		142	slice_alloc += n;
553	return ptr;	143	return ptr;
554	}	144	}
555		145
		146	void *
556	void salloc_ (int n, void src) throw (std::bad_alloc)	147	salloc_ (int n, void *src) throw (std::bad_alloc)
557	{	148	{
558	void *ptr = salloc_ (n);	149	void *ptr = salloc_ (n);
559		150
560	if (src)	151	if (src)
561	memcpy (ptr, src, n);	152	memcpy (ptr, src, n);
563	memset (ptr, 0, n);	154	memset (ptr, 0, n);
564		155
565	return ptr;	156	return ptr;
566	}	157	}
567		158
		159	/******************************************************************************/
		160
		161	#if DEBUG_SALLOC
		162
		163	#define MAGIC 0xa1b2c35543deadLL
		164
		165	void *
		166	g_slice_alloc (unsigned long size)
		167	{
		168	unsigned long p = (unsigned long ) (g_slice_alloc)(size + sizeof (unsigned long));
		169	*p++ = size ^ MAGIC;
		170	//fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
		171	return (void *)p;
		172	}
		173
		174	void *
		175	g_slice_alloc0 (unsigned long size)
		176	{
		177	return memset (g_slice_alloc (size), 0, size);
		178	}
		179
		180	void
		181	g_slice_free1 (unsigned long size, void *ptr)
		182	{
		183	//fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
		184	if (expect_true (ptr))
		185	{
		186	unsigned long p = (unsigned long )ptr;
		187	unsigned long s = *--p ^ MAGIC;
		188
		189	if (size != (unsigned long)(*p ^ MAGIC))
		190	{
		191	LOG (logBacktrace \| llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
		192	abort ();
		193	}
		194
		195	*p = MAGIC;
		196
		197	(g_slice_free1)(s + sizeof (unsigned long), p);
		198	}
		199	}
		200
		201	#endif
		202
		203	/******************************************************************************/
		204
		205	refcnt_buf::refcnt_buf (size_t size)
		206	{
		207	static uint32_t empty_buf [2] = { 0, 1 }; // 2 == never deallocated
		208	data = (char *)empty_buf + overhead;
		209	assert (overhead == sizeof (empty_buf));
		210	inc ();
		211	}
		212
		213	refcnt_buf::refcnt_buf (void *data, size_t size)
		214	{
		215	_alloc (size);
		216	memcpy (this->data, data, size);
		217	}
		218
		219	refcnt_buf::~refcnt_buf ()
		220	{
		221	dec ();
		222	}
		223
		224	void
		225	refcnt_buf::_dealloc ()
		226	{
		227	sfree<char> (data - overhead, size () + overhead);
		228	}
		229
		230	refcnt_buf &
		231	refcnt_buf::operator =(const refcnt_buf &src)
		232	{
		233	dec ();
		234	data = src.data;
		235	inc ();
		236	return *this;
		237	}
		238
		239	/******************************************************************************/
		240
		241	int
568	void assign (char dst, const char src, int maxlen)	242	assign (char dst, const char src, int maxsize)
569	{	243	{
570	if (!src)	244	if (!src)
571	src = "";	245	src = "";
572		246
573	int len = strlen (src);	247	int len = strlen (src);
574		248
575	if (len >= maxlen - 1)	249	if (len >= maxsize)
576	{	250	{
577	if (maxlen <= 4)	251	if (maxsize <= 4)
578	{	252	{
579	memset (dst, '.', maxlen - 1);	253	memset (dst, '.', maxsize - 2);
580	dst [maxlen - 1] = 0;	254	dst [maxsize - 1] = 0;
581	}	255	}
582	else	256	else
583	{	257	{
584	memcpy (dst, src, maxlen - 4);	258	memcpy (dst, src, maxsize - 4);
585	memcpy (dst + maxlen - 4, "...", 4);	259	memcpy (dst + maxsize - 4, "...", 4);
586	}	260	}
		261
		262	len = maxsize;
587	}	263	}
588	else	264	else
589	memcpy (dst, src, len + 1);	265	memcpy (dst, src, ++len);
590	}
591		266
592	tstamp now ()	267	return len;
		268	}
		269
		270	char *
		271	vformat (const char *format, va_list ap)
		272	{
		273	static dynbuf_text bufs[8];
		274	static int bufidx;
		275
		276	dynbuf_text &buf = bufs [++bufidx & 7];
		277
		278	buf.clear ();
		279	buf.vprintf (format, ap);
		280	return buf;
		281	}
		282
		283	char *
		284	format (const char *format, ...)
		285	{
		286	va_list ap;
		287	va_start (ap, format);
		288	char *buf = vformat (format, ap);
		289	va_end (ap);
		290
		291	return buf;
		292	}
		293
		294	tstamp
		295	now ()
593	{	296	{
594	struct timeval tv;	297	struct timeval tv;
595		298
596	gettimeofday (&tv, 0);	299	gettimeofday (&tv, 0);
597	return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);	300	return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
…		…
605		308
606	int diff = (b - a) & 7;	309	int diff = (b - a) & 7;
607	return diff <= 1 \|\| diff >= 7;	310	return diff <= 1 \|\| diff >= 7;
608	}	311	}
609		312
		313	/* crc32 0xdebb20e3 table and supplementary functions. */
		314	extern const uint32_t crc_32_tab[256] =
		315	{
		316	0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
		317	0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
		318	0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
		319	0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
		320	0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
		321	0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
		322	0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
		323	0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
		324	0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
		325	0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
		326	0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
		327	0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
		328	0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
		329	0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
		330	0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
		331	0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
		332	0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
		333	0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
		334	0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
		335	0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
		336	0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
		337	0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
		338	0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
		339	0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
		340	0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
		341	0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
		342	0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
		343	0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
		344	0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
		345	0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
		346	0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
		347	0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
		348	0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
		349	0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
		350	0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
		351	0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
		352	0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
		353	0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
		354	0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
		355	0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
		356	0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
		357	0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
		358	0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
		359	0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
		360	0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
		361	0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
		362	0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
		363	0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
		364	0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
		365	0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
		366	0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
		367	0x2d02ef8dL
		368	};
		369
		370	void
		371	thread::start (void (start_routine)(void ), void arg)
		372	{
		373	pthread_attr_t attr;
		374
		375	pthread_attr_init (&attr);
		376	pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
		377	pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
		378	? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
		379	#ifdef PTHREAD_SCOPE_PROCESS
		380	pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
		381	#endif
		382
		383	sigset_t fullsigset, oldsigset;
		384	sigfillset (&fullsigset);
		385
		386	pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
		387
		388	if (pthread_create (&id, &attr, start_routine, arg))
		389	cleanup ("unable to create a new thread");
		390
		391	pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
		392	}
		393

Diff Legend

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

Comparing deliantra/server/common/utils.C (file contents): Revision 1.34 by root, Mon Jan 1 12:28:46 2007 UTC vs. Revision 1.105 by root, Thu Jan 19 21:51:43 2017 UTC

Diff Legend

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.34 by root, Mon Jan 1 12:28:46 2007 UTC vs.
Revision 1.105 by root, Thu Jan 19 21:51:43 2017 UTC