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.2 by root, Tue Sep 19 10:35:21 2006 UTC vs.
Revision 1.28 by root, Mon Nov 9 03:08:24 2009 UTC

1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 *
4 * Copyright (©) 2005,2006,2007,2008,2009 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 "compiler.h"
32#include "util.h"
33#include "shstr.h"
6 34
7// this is a "buffer" that can grow fast 35// this is a "buffer" that can grow fast
8// and is still somewhat space-efficient. 36// and is still somewhat space-efficient.
9// unlike obstacks or other data structures, 37// unlike obstacks or other data structures,
10// it never moves data around. basically, 38// it never moves data around. basically,
11// this is a fast strstream without the overhead. 39// this is a fast strstream without the overhead.
12 40
13class dynbuf 41struct dynbuf
14{ 42{
43protected:
15 struct chunk 44 struct chunk
16 { 45 {
17 chunk *next; 46 chunk *next;
47 int alloc;
18 int size; 48 int size;
19 char data[0]; 49 char data[0];
20 }; 50 };
21 51
22 char *ptr; 52 char *ptr, *end;
23 int room;
24 int ext;
25 int _size; 53 int _size;
26 54
55 int extend, cextend;
27 chunk *first, *last; 56 chunk *first, *last;
28 57
29 void _reserve (int size); 58 void reserve (int size);
30 void clear (); 59 void init (int initial); // allocate sinitial chunk
60 void free (chunk *&chain); // free chain of chunks
61 char *_linearise (int extra = 0);
31 void finish (); 62 void finalise ();
32 63
33public: 64public:
34 65
66 // initial - the size of the initial chunk to be allocated
67 // extend - first incremental step when buffer size exceeded
35 dynbuf (int initial = 4096, int extend = 16384); 68 dynbuf (int initial = 4096, int extend = 16384)
69 : extend (extend)
70 {
71 init (initial);
72 }
73
36 ~dynbuf (); 74 ~dynbuf ()
75 {
76 free (first);
77 }
37 78
79 // resets the dynbuf, but does not free the first chunk
80 // which is either of size "initial" or the size of the last
81 // linearise
82 void clear ();
83
38 int size () { return _size + (ptr - last->data); } 84 int size () const { return _size + (ptr - last->data); }
85 bool empty () const { return !size (); }
39 86
40 void linearise (void *data); 87 void linearise (void *data);
41 char *linearise (); 88 char *linearise () // does not 0-terminate(!)
89 {
90 return first->next ? _linearise () : first->data;
91 }
42 92
93 int room () const { return end - ptr; }
94
95 // make sure we have "size" extra room
43 char *force (int size) 96 char *force (int size)
44 { 97 {
45 if (room < size) 98 if (expect_false (ptr + size > end))
46 _reserve (size); 99 reserve (size);
100
101 assume (ptr + size <= end);
47 102
48 return ptr; 103 return ptr;
49 } 104 }
50 105
106 // allocate size bytes and return pointer to them (caller must force())
107 char *falloc (int size)
108 {
109 char *res = ptr;
110 ptr += size;
111 return res;
112 }
113
114 // allocate size bytes and return pointer to them
51 char *alloc (int size) 115 char *alloc (int size)
52 { 116 {
53 char *res = force (size); 117 force (size);
54 118 return falloc (size);
55 room -= size;
56 ptr += size;
57
58 return res;
59 } 119 }
60 120
61 void fadd (char c) { --room; *ptr++ = c; } 121 void fadd (char c) { *ptr++ = c; }
62 void fadd (unsigned char c) { fadd (char (c)); } 122 void fadd (unsigned char c) { fadd (char (c)); }
123 void fadd (const void *p, int len)
124 {
125 memcpy (falloc (len), p, len);
126 }
63 127
64 void add (const void *p, int len) 128 void add (const void *p, int len)
65 { 129 {
66 memcpy (alloc (len), p, len); 130 force (len);
131 fadd (p, len);
67 } 132 }
68 133
69 void add (char c) 134 void add (char c)
70 { 135 {
71 if (room < 1) 136 alloc (1)[0] = c;
72 _reserve (1);
73
74 room--;
75 *ptr++ = c;
76 } 137 }
77 138
78 void add (const char *s) 139 void add (const char *s)
79 { 140 {
80 add (s, strlen (s)); 141 add (s, strlen (s));
81 } 142 }
82 143
83 static const int max_sint32_size = 11; 144 void add (shstr_tmp s)
84 static const int max_sint64_size = 20; 145 {
146 add (s.s, s.length ());
147 }
85 148
86 void add (sint32 i); 149 // rather inefficient
87 void add (sint64 i); 150 void splice (int offset, int olen, const char *s, int slen);
151 void splice (int offset, int olen) { splice (offset, olen, "", 0); }
88 152
89 //TODO 153 //TODO
90 //void add_destructive (dynbuf &buf); 154 //void add_destructive (dynbuf &buf);
91 155
92 dynbuf &operator << (char c) { add (c); return *this; } 156 dynbuf &operator << (char c) { add (c); return *this; }
93 dynbuf &operator << (unsigned char c) { return *this << char (c); } 157 dynbuf &operator << (unsigned char c) { return *this << char (c); }
94 dynbuf &operator << (const char *s) { add (s); return *this; } 158 dynbuf &operator << (const char *s) { add (s); return *this; }
159 dynbuf &operator << (shstr_tmp s) { add (s); return *this; }
160 dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; }
161
162 operator std::string ();
95}; 163};
96 164
165struct dynbuf_text : dynbuf
166{
167 dynbuf_text (int initial = 4096, int extend = 16384)
168 : dynbuf (initial, extend)
169 { }
170
171 using dynbuf::add;
172 void add (sint32 i);
173 void add (sint64 i);
174
175 //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often
176
177 //using dynbuf::operator <<; // doesn't work, sometimes C++ just suxx
178 // instead we use an ugly template function
179 template<typename T>
180 dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; }
181
182 dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; }
183 dynbuf_text &operator << (uint16 i) { add (sint32 (i)); return *this; }
184 dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; }
185 dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; }
186 dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; }
187 dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; }
188
189 void printf (const char *format, ...) attribute ((format (printf, 2, 3)));
190 void vprintf (const char *format, va_list ap);
191
192 void add_abilities (const char *name, uint32 abilities);
193 void add_paths (const char *name, uint32 paths);
194
195 // we need to redefine, to keep the API :/
196 using dynbuf::splice;
197 void splice (int offset, int olen, const char *s)
198 {
199 dynbuf::splice (offset, olen, s, strlen (s));
200 }
201
202 // returns the string, linearised and with trailing \0
203 operator char *();
204};
205
97#endif 206#endif
207

Diff Legend

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