server/include/dynbuf.h

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Deliantra is free software: you can redistribute it and/or modify it under
 * the terms of the Affero 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 Affero GNU General Public License
 * and 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 <support@deliantra.net>
 */

#ifndef DYNBUF_H__
#define DYNBUF_H__

#include <cstring>
#include <cassert>

#include "util.h"
#include "shstr.h"

// this is a "buffer" that can grow fast
// and is still somewhat space-efficient.
// unlike obstacks or other data structures,
// it never moves data around. basically,
// this is a fast strstream without the overhead.

struct dynbuf
{
protected:
  struct chunk
  {
    chunk *next;
    int alloc;
    int size;
    char data[0];
  };

  char *ptr, *end;
  int _size;

  int extend, cextend;
  chunk *first, *last;

  void reserve (int size);
  void init (int initial);  // allocate sinitial chunk
  void free (chunk *&chain); // free chain of chunks
  char *_linearise ();
  void finalise ();

public:
  
  // initial - the size of the initial chunk to be allocated
  // extend  - first incremental step when buffer size exceeded
  dynbuf (int initial = 4096, int extend = 16384)
  : extend (extend)
  {
    init (initial);
  }

  ~dynbuf ()
  {
    free (first);
  }

  // resets the dynbuf, but does not free the first chunk
  // which is either of size "initial" or the size of the last
  // linearise
  void clear ();

  int  size  () const { return _size + (ptr - last->data); }
  bool empty () const { return !size (); }

  void linearise (void *data);
  char *linearise () // does not 0-terminate(!)
  { 
    return first->next ? _linearise () : first->data;
  }

  int room () const { return end - ptr; }

  char *force (int size)
  {
    if (expect_false (ptr + size >= end))
      reserve (size);

    return ptr;
  }

  char *falloc (int size)
  {
    char *res = ptr;
    ptr += size;
    return res;
  }

  char *alloc (int size)
  {
    force (size);
    return falloc (size);
  }

  void fadd (char c) { *ptr++ = c; }
  void fadd (unsigned char c) { fadd (char (c)); }
  void fadd (const void *p, int len)
  {
    memcpy (falloc (len), p, len);
  }

  void add (const void *p, int len)
  {
    force (len);
    fadd (p, len);
  }

  void add (char c)
  {
    alloc (1)[0] = c;
  }

  void add (const char *s)
  {
     add (s, strlen (s));
  }

  void add (shstr_tmp s)
  {
    add (s.s, s.length ());
  }

  //TODO
  //void add_destructive (dynbuf &buf);

  dynbuf &operator << (char c) { add (c); return *this; }
  dynbuf &operator << (unsigned char c) { return *this << char (c); }
  dynbuf &operator << (const char *s) { add (s); return *this; }
  dynbuf &operator << (shstr_tmp s) { add (s); return *this; }
  dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; }

  operator std::string ();
};

struct dynbuf_text : dynbuf
{
  dynbuf_text (int initial = 4096, int extend = 16384)
  : dynbuf (initial, extend)
  { }

  using dynbuf::add;
  void add (sint32 i);
  void add (sint64 i);

  //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often

  //using dynbuf::operator <<; // doesn't work, sometimes C++ just suxx
  // instead we use an ugly template function
  template<typename T>
  dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; }

  dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; }
  dynbuf_text &operator << (uint16 i) { add (sint32 (i)); return *this; }
  dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; }
  dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; }
  dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; }
  dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; }

  void printf (const char *format, ...);
  void vprintf (const char *format, va_list ap);

  void add_abilities (const char *name, uint32 abilities);
  void add_paths     (const char *name, uint32 paths);

  // returns the string, linearised and with trailing \0
  operator const char * ();
};

#endif

Revision:	1.22
Committed:	Mon Oct 12 14:00:58 2009 UTC (14 years, 7 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_81
Changes since 1.21:	+7 -6 lines
Log Message:	clarify license
#	Content
1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*
8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* the terms of the Affero GNU General Public License as published by the
10	* Free Software Foundation, either version 3 of the License, or (at your
11	* option) any later version.
12	*
13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.
17	*
18	* You should have received a copy of the Affero GNU General Public License
19	* and the GNU General Public License along with this program. If not, see
20	* <http://www.gnu.org/licenses/>.
21	*
22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/
24
25	#ifndef DYNBUF_H__
26	#define DYNBUF_H__
27
28	#include <cstring>
29	#include <cassert>
30
31	#include "util.h"
32	#include "shstr.h"
33
34	// this is a "buffer" that can grow fast
35	// and is still somewhat space-efficient.
36	// unlike obstacks or other data structures,
37	// it never moves data around. basically,
38	// this is a fast strstream without the overhead.
39
40	struct dynbuf
41	{
42	protected:
43	struct chunk
44	{
45	chunk *next;
46	int alloc;
47	int size;
48	char data[0];
49	};
50
51	char ptr, end;
52	int _size;
53
54	int extend, cextend;
55	chunk first, last;
56
57	void reserve (int size);
58	void init (int initial); // allocate sinitial chunk
59	void free (chunk *&chain); // free chain of chunks
60	char *_linearise ();
61	void finalise ();
62
63	public:
64
65	// initial - the size of the initial chunk to be allocated
66	// extend - first incremental step when buffer size exceeded
67	dynbuf (int initial = 4096, int extend = 16384)
68	: extend (extend)
69	{
70	init (initial);
71	}
72
73	~dynbuf ()
74	{
75	free (first);
76	}
77
78	// resets the dynbuf, but does not free the first chunk
79	// which is either of size "initial" or the size of the last
80	// linearise
81	void clear ();
82
83	int size () const { return _size + (ptr - last->data); }
84	bool empty () const { return !size (); }
85
86	void linearise (void *data);
87	char *linearise () // does not 0-terminate(!)
88	{
89	return first->next ? _linearise () : first->data;
90	}
91
92	int room () const { return end - ptr; }
93
94	char *force (int size)
95	{
96	if (expect_false (ptr + size >= end))
97	reserve (size);
98
99	return ptr;
100	}
101
102	char *falloc (int size)
103	{
104	char *res = ptr;
105	ptr += size;
106	return res;
107	}
108
109	char *alloc (int size)
110	{
111	force (size);
112	return falloc (size);
113	}
114
115	void fadd (char c) { *ptr++ = c; }
116	void fadd (unsigned char c) { fadd (char (c)); }
117	void fadd (const void *p, int len)
118	{
119	memcpy (falloc (len), p, len);
120	}
121
122	void add (const void *p, int len)
123	{
124	force (len);
125	fadd (p, len);
126	}
127
128	void add (char c)
129	{
130	alloc (1)[0] = c;
131	}
132
133	void add (const char *s)
134	{
135	add (s, strlen (s));
136	}
137
138	void add (shstr_tmp s)
139	{
140	add (s.s, s.length ());
141	}
142
143	//TODO
144	//void add_destructive (dynbuf &buf);
145
146	dynbuf &operator << (char c) { add (c); return *this; }
147	dynbuf &operator << (unsigned char c) { return *this << char (c); }
148	dynbuf &operator << (const char s) { add (s); return this; }
149	dynbuf &operator << (shstr_tmp s) { add (s); return *this; }
150	dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; }
151
152	operator std::string ();
153	};
154
155	struct dynbuf_text : dynbuf
156	{
157	dynbuf_text (int initial = 4096, int extend = 16384)
158	: dynbuf (initial, extend)
159	{ }
160
161	using dynbuf::add;
162	void add (sint32 i);
163	void add (sint64 i);
164
165	//TODO: should optimise the case printf "(name %+d)" as it comes up extremely often
166
167	//using dynbuf::operator <<; // doesn't work, sometimes C++ just suxx
168	// instead we use an ugly template function
169	template<typename T>
170	dynbuf_text &operator << (T c) { (dynbuf )this << c; return *this; }
171
172	dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; }
173	dynbuf_text &operator << (uint16 i) { add (sint32 (i)); return *this; }
174	dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; }
175	dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; }
176	dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; }
177	dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; }
178
179	void printf (const char *format, ...);
180	void vprintf (const char *format, va_list ap);
181
182	void add_abilities (const char *name, uint32 abilities);
183	void add_paths (const char *name, uint32 paths);
184
185	// returns the string, linearised and with trailing \0
186	operator const char * ();
187	};
188
189	#endif
190