ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/dynbuf.h
(Generate patch)

Comparing deliantra/server/include/dynbuf.h (file contents):
Revision 1.3 by root, Tue Sep 19 22:05:55 2006 UTC vs.
Revision 1.22 by root, Mon Oct 12 14:00:58 2009 UTC

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
1#ifndef DYNBUF_H__ 25#ifndef DYNBUF_H__
2#define DYNBUF_H__ 26#define DYNBUF_H__
3 27
4#include <cstring> 28#include <cstring>
5#include <cassert> 29#include <cassert>
30
31#include "util.h"
32#include "shstr.h"
6 33
7// this is a "buffer" that can grow fast 34// this is a "buffer" that can grow fast
8// and is still somewhat space-efficient. 35// and is still somewhat space-efficient.
9// unlike obstacks or other data structures, 36// unlike obstacks or other data structures,
10// it never moves data around. basically, 37// it never moves data around. basically,
11// this is a fast strstream without the overhead. 38// this is a fast strstream without the overhead.
12 39
13class dynbuf 40struct dynbuf
14{ 41{
42protected:
15 struct chunk 43 struct chunk
16 { 44 {
17 chunk *next; 45 chunk *next;
46 int alloc;
18 int size; 47 int size;
19 char data[0]; 48 char data[0];
20 }; 49 };
21 50
22 char *ptr; 51 char *ptr, *end;
23 int room;
24 int ext;
25 int _size; 52 int _size;
26 53
54 int extend, cextend;
27 chunk *first, *last; 55 chunk *first, *last;
28 56
29 void _reserve (int size); 57 void reserve (int size);
30 void clear (); 58 void init (int initial); // allocate sinitial chunk
59 void free (chunk *&chain); // free chain of chunks
60 char *_linearise ();
31 void finish (); 61 void finalise ();
32 62
33public: 63public:
34 64
65 // initial - the size of the initial chunk to be allocated
66 // extend - first incremental step when buffer size exceeded
35 dynbuf (int initial = 4096, int extend = 16384); 67 dynbuf (int initial = 4096, int extend = 16384)
36 ~dynbuf (); 68 : extend (extend)
69 {
70 init (initial);
71 }
37 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
38 int size () { return _size + (ptr - last->data); } 83 int size () const { return _size + (ptr - last->data); }
84 bool empty () const { return !size (); }
39 85
40 void linearise (void *data); 86 void linearise (void *data);
41 char *linearise (); 87 char *linearise () // does not 0-terminate(!)
88 {
89 return first->next ? _linearise () : first->data;
90 }
91
92 int room () const { return end - ptr; }
42 93
43 char *force (int size) 94 char *force (int size)
44 { 95 {
45 if (room < size) 96 if (expect_false (ptr + size >= end))
46 _reserve (size); 97 reserve (size);
47 98
48 return ptr; 99 return ptr;
49 } 100 }
50 101
51 char *alloc (int size) 102 char *falloc (int size)
52 { 103 {
53 char *res = force (size); 104 char *res = ptr;
54
55 room -= size;
56 ptr += size; 105 ptr += size;
57
58 return res; 106 return res;
59 } 107 }
60 108
109 char *alloc (int size)
110 {
111 force (size);
112 return falloc (size);
113 }
114
61 void fadd (char c) { --room; *ptr++ = c; } 115 void fadd (char c) { *ptr++ = c; }
62 void fadd (unsigned char c) { fadd (char (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 }
63 121
64 void add (const void *p, int len) 122 void add (const void *p, int len)
65 { 123 {
66 memcpy (alloc (len), p, len); 124 force (len);
125 fadd (p, len);
67 } 126 }
68 127
69 void add (char c) 128 void add (char c)
70 { 129 {
71 alloc (1)[0] = c; 130 alloc (1)[0] = c;
… …
74 void add (const char *s) 133 void add (const char *s)
75 { 134 {
76 add (s, strlen (s)); 135 add (s, strlen (s));
77 } 136 }
78 137
79 static const int max_sint32_size = 11; 138 void add (shstr_tmp s)
80 static const int max_sint64_size = 20; 139 {
81 140 add (s.s, s.length ());
82 void add (sint32 i); 141 }
83 void add (sint64 i);
84 142
85 //TODO 143 //TODO
86 //void add_destructive (dynbuf &buf); 144 //void add_destructive (dynbuf &buf);
87 145
88 dynbuf &operator << (char c) { add (c); return *this; } 146 dynbuf &operator << (char c) { add (c); return *this; }
89 dynbuf &operator << (unsigned char c) { return *this << char (c); } 147 dynbuf &operator << (unsigned char c) { return *this << char (c); }
90 dynbuf &operator << (const char *s) { add (s); return *this; } 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
155struct 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 * ();
91}; 187};
92 188
93#endif 189#endif
190

Diff Legend

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