server/server/dynbuf.C

/*
 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
 * 
 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
 * 
 * Crossfire TRT is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <crossfire@schmorp.de>
 */

#include "global.h"

#include <cstdio>

void
dynbuf::init (int initial)
{
  _size = 0;

  first = last = (chunk *)salloc<char> (sizeof (chunk) + initial);
  first->alloc = sizeof (chunk) + initial;
  first->next = 0;

  ptr = first->data;
  end = ptr + initial;
}

void
dynbuf::free (chunk *&chain)
{
  while (chain)
    {
      chunk *next = chain->next;

      sfree<char> ((char *)chain, chain->alloc);
      chain = next;
    }
}

void
dynbuf::clear ()
{
  free (first->next);

  _size = 0;
  ptr = first->data;
  end = ptr + first->alloc - sizeof (chunk);
}

void
dynbuf::finalise ()
{
  // finalise current chunk
  _size += last->size = ptr - last->data;
}

void
dynbuf::reserve (int size)
{
  finalise ();

  do
    {
      extend += extend >> 1;
      extend = (extend + 15) & ~15;
    }
  while (extend < size);

  chunk *add = (chunk *) salloc<char> (sizeof (chunk) + extend);
  add->alloc = sizeof (chunk) + extend;
  add->next = 0;

  last->next = add;
  last = add;

  ptr = last->data;
  end = ptr + extend;
}

void
dynbuf::linearise (void *data)
{
  last->size = ptr - last->data;

  for (chunk *c = first; c; c = c->next)
    {
      memcpy (data, c->data, c->size);
      data = (void *)(((char *)data) + c->size);
    }
}

char *
dynbuf::_linearise ()
{
  finalise ();

  chunk *add = (chunk *) salloc<char> (sizeof (chunk) + _size);
  add->alloc = sizeof (chunk) + _size;
  add->next = 0;

  linearise ((void *)add->data);
  free (first);

  first = last = add;
  ptr = last->data + _size;
  end = ptr;
  _size = 0;

  return first->data;
}

dynbuf::operator std::string ()
{
  // could optimise
  return std::string (linearise (), size ());
}

void
dynbuf_text::vprintf (const char *format, va_list ap)
{
  int len;

  {
    force (128);

    va_list apc;
    va_copy (apc, ap);
    len = vsnprintf (ptr, end - ptr, format, ap);
    va_end (apc);

    assert (len >= 0); // shield against broken vsnprintf's

    // was enough room available
    if (ptr + len < end)
      {
        ptr += len;
        return;
      }
  }

  // longer, try harder
  vsnprintf (force (len + 1), len + 1, format, ap);

  ptr += len;
}

void
dynbuf_text::printf (const char *format, ...)
{
  va_list ap;
  va_start (ap, format);
  vprintf (format, ap);
  va_end (ap);
}

// simply return a mask with "bits" bits set
inline uint64
m (int b)
{
  return (uint64 (1) << b) - 1;
}

// convert 9 digits to ascii, using only a single multiplication
// (depending on cpu and compiler).
// will generate a single 0 as output when v=lz=0
inline char *
i2a_9 (char *ptr, uint32 v, bool lz)
{
  // convert to 4.56 fixed-point representation
  // this should be optimal on 64 bit cpus, and rather
  // slow on 32 bit cpus. go figure :)
  const int bits = 7*8; // 7 bits per post-comma digit

  uint64 u = v * ((m (bits) + 100000000) / 100000000); // 10**8

  if (lz)
    {
      // output leading zeros
      // good compilers will compile this into only shifts, masks and adds
      *ptr++ = char (u >> (bits - 0)) + '0'; u = (u & m (bits - 0)) * 5;
      *ptr++ = char (u >> (bits - 1)) + '0'; u = (u & m (bits - 1)) * 5;
      *ptr++ = char (u >> (bits - 2)) + '0'; u = (u & m (bits - 2)) * 5;
      *ptr++ = char (u >> (bits - 3)) + '0'; u = (u & m (bits - 3)) * 5;
      *ptr++ = char (u >> (bits - 4)) + '0'; u = (u & m (bits - 4)) * 5;
      *ptr++ = char (u >> (bits - 5)) + '0'; u = (u & m (bits - 5)) * 5;
      *ptr++ = char (u >> (bits - 6)) + '0'; u = (u & m (bits - 6)) * 5;
      *ptr++ = char (u >> (bits - 7)) + '0'; u = (u & m (bits - 7)) * 5;
      *ptr++ = char (u >> (bits - 8)) + '0';
    }
  else
    {
      // do not output leading zeroes (except if v == 0)
      // good compilers will compile this into completely branchless code
      char digit, nz = 0;

      digit = (u >> (bits - 0)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 0)) * 5;
      digit = (u >> (bits - 1)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 1)) * 5;
      digit = (u >> (bits - 2)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 2)) * 5;
      digit = (u >> (bits - 3)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 3)) * 5;
      digit = (u >> (bits - 4)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 4)) * 5;
      digit = (u >> (bits - 5)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 5)) * 5;
      digit = (u >> (bits - 6)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 6)) * 5;
      digit = (u >> (bits - 7)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 7)) * 5;
      digit = (u >> (bits - 8)); *ptr = digit + '0'; nz |= digit; ptr += 1;
    }

  return ptr;
}

void
dynbuf_text::add (sint32 i)
{
  force (sint32_digits);

  *ptr = '-'; ptr += i < 0 ? 1 : 0;
  uint32 u = i < 0 ? -i : i;

  if (expect_true (u < 10)) // we have a lot of single-digit numbers, so optimise
    fadd (char (u + '0'));
  else if (expect_true (u < 1000000000)) // 9 0's
    ptr = i2a_9 (ptr, u, false);
  else
    {
      sint32 div = u / 1000000000;
      uint32 rem = u % 1000000000;

      ptr = i2a_9 (ptr, div, false);
      ptr = i2a_9 (ptr, rem, true);
    }
}

void
dynbuf_text::add (sint64 i)
{
  force (sint64_digits);

  *ptr = '-'; ptr += i < 0 ? 1 : 0;
  uint64 u = i < 0 ? -i : i;

  // split the number into a 1-digit part
  // (#19) and two 9 digit parts (9..18 and 0..8)

  // good compilers will only use multiplications here

  if (u < 10) // we have a lot of single-digit numbers, so optimise
    fadd (char (u + '0'));
  else if (expect_true (u < 1000000000)) // 9 0's
    ptr = i2a_9 (ptr, u, false);
  else if (expect_true (u < UINT64_C (1000000000000000000))) // 18 0's
    {
      sint32 div = u / 1000000000;
      uint32 rem = u % 1000000000;

      ptr = i2a_9 (ptr, div, false);
      ptr = i2a_9 (ptr, rem, true);
    }
  else
    {
      // a biggy
      sint32 div = u / UINT64_C (1000000000000000000);
      uint64 rem = u % UINT64_C (1000000000000000000);

      fadd (char (div + '0'));
      u = rem;

      {
        sint32 div = u / 1000000000;
        uint32 rem = u % 1000000000;

        ptr = i2a_9 (ptr, div, true);
        ptr = i2a_9 (ptr, rem, true);
      }
    }
}

dynbuf_text::operator const char *()
{
  *this << '\0';
  linearise ();
  --ptr;
  return first->data;
}

void
dynbuf_text::add_abilities (const char *name, uint32 abilities)
{
  if (!abilities)
    return;

  *this << '(' << name;

  const char *sep = ": ";
  for (int i = 0; i < NROFATTACKS; ++i)
    if (abilities & (1 << i))
      {
        *this << sep; sep = ", ";
        *this << attacks [i];
      }

  *this << ')';
}

void
dynbuf_text::add_paths (const char *name, uint32 paths)
{
  if (!paths)
    return;

  *this << '(' << name;

  const char *sep = ": ";
  for (int i = 0; i < NRSPELLPATHS; ++i)
    if (paths & (1 << i))
      {
        *this << sep; sep = ", ";
        *this << spellpathnames [i];
      }

  *this << ')';
}

#if 0
struct dynbuf_test_class {
  dynbuf_test_class ()
  {
    sint64 s = 0;
    for (int i = 0; i < 10000000; ++i)
      {
        char b1[256], b2[256];

        dynbuf_text db;
        db.add (s);
        db.add (char (0));

        db.linearise (b1);
        sprintf (b2, "%ld", s);

        if (strcmp (b1, b2))
          printf ("<%s,%s>\n", b1, b2);

        if (i < 20)
          s = (sint64) pow (10., i);
        else
          s = (sint64) exp (random () * (43.6682723752766 / RAND_MAX));
      }

    exit (0);
  }
} dynbuf_test;
#endif

Revision:	1.18
Committed:	Thu Aug 16 06:36:56 2007 UTC (16 years, 9 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_2
Changes since 1.17:	+13 -7 lines
Log Message:	first, untested, try at spicing up the message system
#	User	Rev	Content
1	root	1.15	/*
2			* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3			*
4			* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5			*
6	root	1.16	* Crossfire TRT is free software: you can redistribute it and/or modify
7			* it under the terms of the GNU General Public License as published by
8			* the Free Software Foundation, either version 3 of the License, or
9			* (at your option) any later version.
10	root	1.15	*
11	root	1.16	* This program is distributed in the hope that it will be useful,
12			* but WITHOUT ANY WARRANTY; without even the implied warranty of
13			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14			* GNU General Public License for more details.
15	root	1.15	*
16	root	1.16	* You should have received a copy of the GNU General Public License
17			* along with this program. If not, see <http://www.gnu.org/licenses/>.
18	root	1.15	*
19			* The authors can be reached via e-mail to <crossfire@schmorp.de>
20			*/
21
22	root	1.1	#include "global.h"
23
24			#include <cstdio>
25
26	root	1.17	void
27			dynbuf::init (int initial)
28	root	1.1	{
29			_size = 0;
30	root	1.5
31	root	1.8	first = last = (chunk *)salloc<char> (sizeof (chunk) + initial);
32			first->alloc = sizeof (chunk) + initial;
33	root	1.1	first->next = 0;
34	root	1.8
35	root	1.5	ptr = first->data;
36	root	1.9	end = ptr + initial;
37	root	1.1	}
38
39	root	1.5	void
40	root	1.17	dynbuf::free (chunk *&chain)
41	root	1.1	{
42	root	1.17	while (chain)
43	root	1.1	{
44	root	1.17	chunk *next = chain->next;
45	root	1.5
46	root	1.17	sfree<char> ((char *)chain, chain->alloc);
47			chain = next;
48	root	1.1	}
49	root	1.5	}
50	root	1.1
51	root	1.5	void
52	root	1.10	dynbuf::clear ()
53			{
54	root	1.17	free (first->next);
55
56	root	1.10	_size = 0;
57			ptr = first->data;
58	root	1.17	end = ptr + first->alloc - sizeof (chunk);
59	root	1.10	}
60
61			void
62	root	1.17	dynbuf::finalise ()
63	root	1.1	{
64			// finalise current chunk
65			_size += last->size = ptr - last->data;
66			}
67
68	root	1.5	void
69	root	1.17	dynbuf::reserve (int size)
70	root	1.1	{
71	root	1.17	finalise ();
72	root	1.1
73			do
74			{
75	root	1.17	extend += extend >> 1;
76			extend = (extend + 15) & ~15;
77	root	1.1	}
78	root	1.17	while (extend < size);
79	root	1.1
80	root	1.17	chunk add = (chunk ) salloc<char> (sizeof (chunk) + extend);
81			add->alloc = sizeof (chunk) + extend;
82	root	1.1	add->next = 0;
83
84			last->next = add;
85			last = add;
86
87	root	1.5	ptr = last->data;
88	root	1.17	end = ptr + extend;
89	root	1.1	}
90
91	root	1.5	void
92			dynbuf::linearise (void *data)
93	root	1.1	{
94			last->size = ptr - last->data;
95
96	root	1.10	for (chunk *c = first; c; c = c->next)
97	root	1.1	{
98	root	1.10	memcpy (data, c->data, c->size);
99			data = (void )(((char )data) + c->size);
100	root	1.1	}
101			}
102
103	root	1.5	char *
104	root	1.17	dynbuf::_linearise ()
105	root	1.1	{
106	root	1.17	finalise ();
107
108			chunk add = (chunk ) salloc<char> (sizeof (chunk) + _size);
109			add->alloc = sizeof (chunk) + _size;
110			add->next = 0;
111
112			linearise ((void *)add->data);
113			free (first);
114	root	1.1
115	root	1.17	first = last = add;
116			ptr = last->data + _size;
117			end = ptr;
118			_size = 0;
119	root	1.1
120			return first->data;
121			}
122
123	root	1.7	dynbuf::operator std::string ()
124			{
125			// could optimise
126			return std::string (linearise (), size ());
127			}
128
129			void
130	root	1.18	dynbuf_text::vprintf (const char *format, va_list ap)
131	root	1.7	{
132			int len;
133
134			{
135			force (128);
136
137	root	1.18	va_list apc;
138			va_copy (apc, ap);
139	root	1.9	len = vsnprintf (ptr, end - ptr, format, ap);
140	root	1.18	va_end (apc);
141	root	1.7
142			assert (len >= 0); // shield against broken vsnprintf's
143
144			// was enough room available
145	root	1.9	if (ptr + len < end)
146	root	1.7	{
147	root	1.13	ptr += len;
148	root	1.7	return;
149			}
150			}
151
152			// longer, try harder
153	root	1.18	vsnprintf (force (len + 1), len + 1, format, ap);
154
155			ptr += len;
156			}
157
158			void
159			dynbuf_text::printf (const char *format, ...)
160			{
161	root	1.7	va_list ap;
162			va_start (ap, format);
163	root	1.18	vprintf (format, ap);
164	root	1.7	va_end (ap);
165			}
166
167	root	1.11	// simply return a mask with "bits" bits set
168			inline uint64
169			m (int b)
170	root	1.1	{
171	root	1.11	return (uint64 (1) << b) - 1;
172			}
173	root	1.1
174	root	1.11	// convert 9 digits to ascii, using only a single multiplication
175			// (depending on cpu and compiler).
176			// will generate a single 0 as output when v=lz=0
177			inline char *
178			i2a_9 (char *ptr, uint32 v, bool lz)
179			{
180			// convert to 4.56 fixed-point representation
181			// this should be optimal on 64 bit cpus, and rather
182			// slow on 32 bit cpus. go figure :)
183	root	1.12	const int bits = 7*8; // 7 bits per post-comma digit
184	root	1.11
185			uint64 u = v * ((m (bits) + 100000000) / 100000000); // 10**8
186
187			if (lz)
188			{
189			// output leading zeros
190			// good compilers will compile this into only shifts, masks and adds
191			ptr++ = char (u >> (bits - 0)) + '0'; u = (u & m (bits - 0)) 5;
192			ptr++ = char (u >> (bits - 1)) + '0'; u = (u & m (bits - 1)) 5;
193			ptr++ = char (u >> (bits - 2)) + '0'; u = (u & m (bits - 2)) 5;
194			ptr++ = char (u >> (bits - 3)) + '0'; u = (u & m (bits - 3)) 5;
195			ptr++ = char (u >> (bits - 4)) + '0'; u = (u & m (bits - 4)) 5;
196			ptr++ = char (u >> (bits - 5)) + '0'; u = (u & m (bits - 5)) 5;
197			ptr++ = char (u >> (bits - 6)) + '0'; u = (u & m (bits - 6)) 5;
198			ptr++ = char (u >> (bits - 7)) + '0'; u = (u & m (bits - 7)) 5;
199			*ptr++ = char (u >> (bits - 8)) + '0';
200	root	1.1	}
201			else
202	root	1.4	{
203	root	1.11	// do not output leading zeroes (except if v == 0)
204			// good compilers will compile this into completely branchless code
205			char digit, nz = 0;
206
207			digit = (u >> (bits - 0)); ptr = digit + '0'; nz \|= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 0)) 5;
208			digit = (u >> (bits - 1)); ptr = digit + '0'; nz \|= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 1)) 5;
209			digit = (u >> (bits - 2)); ptr = digit + '0'; nz \|= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 2)) 5;
210			digit = (u >> (bits - 3)); ptr = digit + '0'; nz \|= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 3)) 5;
211			digit = (u >> (bits - 4)); ptr = digit + '0'; nz \|= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 4)) 5;
212			digit = (u >> (bits - 5)); ptr = digit + '0'; nz \|= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 5)) 5;
213			digit = (u >> (bits - 6)); ptr = digit + '0'; nz \|= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 6)) 5;
214			digit = (u >> (bits - 7)); ptr = digit + '0'; nz \|= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 7)) 5;
215			digit = (u >> (bits - 8)); *ptr = digit + '0'; nz \|= digit; ptr += 1;
216	root	1.4	}
217	root	1.1
218	root	1.11	return ptr;
219			}
220
221			void
222			dynbuf_text::add (sint32 i)
223			{
224	root	1.14	force (sint32_digits);
225	root	1.11
226			*ptr = '-'; ptr += i < 0 ? 1 : 0;
227			uint32 u = i < 0 ? -i : i;
228
229			if (expect_true (u < 10)) // we have a lot of single-digit numbers, so optimise
230			fadd (char (u + '0'));
231			else if (expect_true (u < 1000000000)) // 9 0's
232			ptr = i2a_9 (ptr, u, false);
233			else
234	root	1.1	{
235	root	1.11	sint32 div = u / 1000000000;
236			uint32 rem = u % 1000000000;
237	root	1.5
238	root	1.11	ptr = i2a_9 (ptr, div, false);
239			ptr = i2a_9 (ptr, rem, true);
240	root	1.1	}
241			}
242
243	root	1.5	void
244	root	1.7	dynbuf_text::add (sint64 i)
245	root	1.1	{
246	root	1.14	force (sint64_digits);
247	root	1.11
248			*ptr = '-'; ptr += i < 0 ? 1 : 0;
249			uint64 u = i < 0 ? -i : i;
250
251			// split the number into a 1-digit part
252			// (#19) and two 9 digit parts (9..18 and 0..8)
253	root	1.4
254	root	1.11	// good compilers will only use multiplications here
255	root	1.2
256	root	1.11	if (u < 10) // we have a lot of single-digit numbers, so optimise
257			fadd (char (u + '0'));
258			else if (expect_true (u < 1000000000)) // 9 0's
259			ptr = i2a_9 (ptr, u, false);
260			else if (expect_true (u < UINT64_C (1000000000000000000))) // 18 0's
261	root	1.1	{
262	root	1.11	sint32 div = u / 1000000000;
263			uint32 rem = u % 1000000000;
264
265			ptr = i2a_9 (ptr, div, false);
266			ptr = i2a_9 (ptr, rem, true);
267	root	1.1	}
268	root	1.2	else
269	root	1.1	{
270	root	1.11	// a biggy
271			sint32 div = u / UINT64_C (1000000000000000000);
272			uint64 rem = u % UINT64_C (1000000000000000000);
273
274			fadd (char (div + '0'));
275			u = rem;
276
277			{
278			sint32 div = u / 1000000000;
279			uint32 rem = u % 1000000000;
280
281			ptr = i2a_9 (ptr, div, true);
282			ptr = i2a_9 (ptr, rem, true);
283			}
284	root	1.1	}
285	root	1.11	}
286	root	1.1
287	root	1.17	dynbuf_text::operator const char *()
288			{
289			*this << '\0';
290			linearise ();
291			--ptr;
292			return first->data;
293			}
294
295			void
296			dynbuf_text::add_abilities (const char *name, uint32 abilities)
297			{
298			if (!abilities)
299			return;
300
301			*this << '(' << name;
302
303			const char *sep = ": ";
304			for (int i = 0; i < NROFATTACKS; ++i)
305			if (abilities & (1 << i))
306			{
307			*this << sep; sep = ", ";
308			*this << attacks [i];
309			}
310
311			*this << ')';
312			}
313
314			void
315			dynbuf_text::add_paths (const char *name, uint32 paths)
316			{
317			if (!paths)
318			return;
319
320			*this << '(' << name;
321
322			const char *sep = ": ";
323			for (int i = 0; i < NRSPELLPATHS; ++i)
324			if (paths & (1 << i))
325			{
326			*this << sep; sep = ", ";
327			*this << spellpathnames [i];
328			}
329
330			*this << ')';
331			}
332
333	root	1.11	#if 0
334			struct dynbuf_test_class {
335			dynbuf_test_class ()
336			{
337			sint64 s = 0;
338			for (int i = 0; i < 10000000; ++i)
339			{
340			char b1[256], b2[256];
341
342			dynbuf_text db;
343			db.add (s);
344			db.add (char (0));
345
346			db.linearise (b1);
347			sprintf (b2, "%ld", s);
348
349			if (strcmp (b1, b2))
350			printf ("<%s,%s>\n", b1, b2);
351
352			if (i < 20)
353			s = (sint64) pow (10., i);
354			else
355			s = (sint64) exp (random () * (43.6682723752766 / RAND_MAX));
356			}
357
358			exit (0);
359			}
360			} dynbuf_test;
361			#endif
362	root	1.17