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.11 by root, Mon May 28 21:15:56 2007 UTC vs.
Revision 1.31 by root, Fri Mar 26 01:04:44 2010 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software; you can redistribute it and/or modify it 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * under the terms of the GNU General Public License as published by the Free 9 * the terms of the Affero GNU General Public License as published by the
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License along 18 * You should have received a copy of the Affero GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * and the GNU General Public License along with this program. If not, see
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25#ifndef DYNBUF_H__ 25#ifndef DYNBUF_H__
26#define DYNBUF_H__ 26#define DYNBUF_H__
27 27
28#include <cstring> 28#include <cstring>
29#include <cassert> 29#include <cassert>
30 30
31#include "compiler.h"
31#include "util.h" 32#include "util.h"
32#include "shstr.h" 33#include "shstr.h"
33 34
34// this is a "buffer" that can grow fast 35// this is a "buffer" that can grow fast
35// and is still somewhat space-efficient. 36// and is still somewhat space-efficient.
… …
47 int size; 48 int size;
48 char data[0]; 49 char data[0];
49 }; 50 };
50 51
51 char *ptr, *end; 52 char *ptr, *end;
52 int ext;
53 int _size; 53 int _size;
54 54
55 int extend, cextend;
55 chunk *first, *last; 56 chunk *first, *last;
56 57
57 void _reserve (int size); 58 void reserve (int size);
58 void _clear (); 59 void init (int initial); // allocate sinitial chunk
59 void clear (); 60 void free (chunk *&chain); // free chain of chunks
61 char *_linearise (int extra = 0);
60 void finish (); 62 void finalise ();
61 63
62public: 64public:
63 65
66 // initial - the size of the initial chunk to be allocated
67 // extend - first incremental step when buffer size exceeded
64 dynbuf (int initial = 4096, int extend = 16384); 68 dynbuf (int initial = 4096, int extend = 16384)
69 : extend (extend)
70 {
71 init (initial);
72 }
73
65 ~dynbuf (); 74 ~dynbuf ()
75 {
76 free (first);
77 }
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 ();
66 83
67 int size () const { return _size + (ptr - last->data); } 84 int size () const { return _size + (ptr - last->data); }
68 bool empty () const { return !size (); } 85 bool empty () const { return !size (); }
69 86
70 void linearise (void *data); 87 void linearise (void *data);
71 char *linearise (); // does not 0-terminate(!) 88 char *linearise () // does not 0-terminate(!)
89 {
90 return first->next ? _linearise () : first->data;
91 }
72 92
73 int room () const { return end - ptr; } 93 int room () const { return end - ptr; }
74 94
95 // make sure we have "size" extra room
75 char *force (int size) 96 char *force (int size)
76 { 97 {
77 if (expect_false (ptr + size >= end)) 98 if (expect_false (ptr + size > end))
78 _reserve (size); 99 reserve (size);
100
101 assume (ptr + size <= end);
79 102
80 return ptr; 103 return ptr;
81 } 104 }
82 105
106 // used for force + alloc combo
107 void alloc (char *p)
108 {
109 ptr = p;
110 }
111
112 // allocate size bytes and return pointer to them (caller must force())
83 char *falloc (int size) 113 char *falloc (int size)
84 { 114 {
85 char *res = ptr; 115 char *res = ptr;
86 ptr += size; 116 ptr += size;
87 return res; 117 return res;
88 } 118 }
89 119
120 // allocate size bytes and return pointer to them
90 char *alloc (int size) 121 char *alloc (int size)
91 { 122 {
92 force (size); 123 force (size);
93 return falloc (size); 124 return falloc (size);
94 } 125 }
… …
114 void add (const char *s) 145 void add (const char *s)
115 { 146 {
116 add (s, strlen (s)); 147 add (s, strlen (s));
117 } 148 }
118 149
119 void add (const shstr &s) 150 void add (shstr_tmp s)
120 { 151 {
121 add (s.s, s.length ()); 152 add (s.s, s.length ());
122 } 153 }
154
155 // rather inefficient
156 void splice (int offset, int olen, const char *s, int slen);
157 void splice (int offset, int olen) { splice (offset, olen, "", 0); }
123 158
124 //TODO 159 //TODO
125 //void add_destructive (dynbuf &buf); 160 //void add_destructive (dynbuf &buf);
126 161
127 dynbuf &operator << (char c) { add (c); return *this; } 162 dynbuf &operator << (char c) { add (c); return *this; }
128 dynbuf &operator << (unsigned char c) { return *this << char (c); } 163 dynbuf &operator << (unsigned char c) { return *this << char (c); }
129 dynbuf &operator << (const char *s) { add (s); return *this; } 164 dynbuf &operator << (const char *s) { add (s); return *this; }
130 dynbuf &operator << (const shstr &s) { add (s); return *this; } 165 dynbuf &operator << (shstr_tmp s) { add (s); return *this; }
131 dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } 166 dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; }
132 167
133 operator std::string (); 168 operator std::string ();
134}; 169};
135 170
… …
138 dynbuf_text (int initial = 4096, int extend = 16384) 173 dynbuf_text (int initial = 4096, int extend = 16384)
139 : dynbuf (initial, extend) 174 : dynbuf (initial, extend)
140 { } 175 { }
141 176
142 using dynbuf::add; 177 using dynbuf::add;
143
144 void add (sint32 i); 178 void add (sint32 i);
145 void add (sint64 i); 179 void add (sint64 i);
146 180
181 //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often
182
183 //using dynbuf::operator <<; // doesn't work, sometimes C++ just suxx
184 // instead we use an ugly template function
185 template<typename T>
186 dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; }
187
188 dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; }
189 dynbuf_text &operator << (uint16 i) { add (sint32 (i)); return *this; }
190 dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; }
191 dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; }
192 dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; }
193 dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; }
194
195 void printf (const char *format, ...) attribute ((format (printf, 2, 3)));
147 void printf (const char *format, ...); 196 void vprintf (const char *format, va_list ap);
197
198 void add_abilities (const char *name, uint32 abilities);
199 void add_paths (const char *name, uint32 paths);
200
201 // we need to redefine, to keep the API :/
202 using dynbuf::splice;
203 void splice (int offset, int olen, const char *s)
204 {
205 dynbuf::splice (offset, olen, s, strlen (s));
206 }
207
208 // returns the string, linearised and with trailing \0
209 operator char *();
148}; 210};
149 211
150#endif 212#endif
151 213

Diff Legend

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