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.9 by root, Sun May 27 23:22:29 2007 UTC vs.
Revision 1.30 by root, Fri Mar 26 00:59:21 2010 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 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992 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>
6 30
31#include "compiler.h"
7#include "util.h" 32#include "util.h"
8#include "shstr.h" 33#include "shstr.h"
9 34
10// this is a "buffer" that can grow fast 35// this is a "buffer" that can grow fast
11// and is still somewhat space-efficient. 36// and is still somewhat space-efficient.
… …
23 int size; 48 int size;
24 char data[0]; 49 char data[0];
25 }; 50 };
26 51
27 char *ptr, *end; 52 char *ptr, *end;
28 int ext;
29 int _size; 53 int _size;
30 54
55 int extend, cextend;
31 chunk *first, *last; 56 chunk *first, *last;
32 57
33 void _reserve (int size); 58 void reserve (int size);
34 void _clear (); 59 void init (int initial); // allocate sinitial chunk
35 void clear (); 60 void free (chunk *&chain); // free chain of chunks
61 char *_linearise (int extra = 0);
36 void finish (); 62 void finalise ();
37 63
38public: 64public:
39 65
66 // initial - the size of the initial chunk to be allocated
67 // extend - first incremental step when buffer size exceeded
40 dynbuf (int initial = 4096, int extend = 16384); 68 dynbuf (int initial = 4096, int extend = 16384)
69 : extend (extend)
70 {
71 init (initial);
72 }
73
41 ~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 ();
42 83
43 int size () const { return _size + (ptr - last->data); } 84 int size () const { return _size + (ptr - last->data); }
44 bool empty () const { return !size (); } 85 bool empty () const { return !size (); }
45 86
46 void linearise (void *data); 87 void linearise (void *data);
47 char *linearise (); // does not 0-terminate(!) 88 char *linearise () // does not 0-terminate(!)
89 {
90 return first->next ? _linearise () : first->data;
91 }
48 92
49 int room () const { return end - ptr; } 93 int room () const { return end - ptr; }
50 94
95 // make sure we have "size" extra room
51 char *force (int size) 96 char *force (int size)
52 { 97 {
53 if (expect_false (ptr + size >= end)) 98 if (expect_false (ptr + size > end))
54 _reserve (size); 99 reserve (size);
100
101 assume (ptr + size <= end);
55 102
56 return ptr; 103 return ptr;
57 } 104 }
58 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())
59 char *alloc (int size) 113 char *falloc (int size)
60 { 114 {
61 char *res = force (size); 115 char *res = ptr;
62 ptr += size; 116 ptr += size;
63 return res; 117 return res;
64 } 118 }
65 119
120 // allocate size bytes and return pointer to them
121 char *alloc (int size)
122 {
123 force (size);
124 return falloc (size);
125 }
126
66 void fadd (char c) { *ptr++ = c; } 127 void fadd (char c) { *ptr++ = c; }
67 void fadd (unsigned char c) { fadd (char (c)); } 128 void fadd (unsigned char c) { fadd (char (c)); }
129 void fadd (const void *p, int len)
130 {
131 memcpy (falloc (len), p, len);
132 }
68 133
69 void add (const void *p, int len) 134 void add (const void *p, int len)
70 { 135 {
71 memcpy (alloc (len), p, len); 136 force (len);
137 fadd (p, len);
72 } 138 }
73 139
74 void add (char c) 140 void add (char c)
75 { 141 {
76 alloc (1)[0] = c; 142 alloc (1)[0] = c;
… …
79 void add (const char *s) 145 void add (const char *s)
80 { 146 {
81 add (s, strlen (s)); 147 add (s, strlen (s));
82 } 148 }
83 149
84 void add (const shstr &s) 150 void add (shstr_tmp s)
85 { 151 {
86 add (s.s, s.length ()); 152 add (s.s, s.length ());
87 } 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); }
88 158
89 //TODO 159 //TODO
90 //void add_destructive (dynbuf &buf); 160 //void add_destructive (dynbuf &buf);
91 161
92 dynbuf &operator << (char c) { add (c); return *this; } 162 dynbuf &operator << (char c) { add (c); return *this; }
93 dynbuf &operator << (unsigned char c) { return *this << char (c); } 163 dynbuf &operator << (unsigned char c) { return *this << char (c); }
94 dynbuf &operator << (const char *s) { add (s); return *this; } 164 dynbuf &operator << (const char *s) { add (s); return *this; }
95 dynbuf &operator << (const shstr &s) { add (s); return *this; } 165 dynbuf &operator << (shstr_tmp s) { add (s); return *this; }
96 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; }
97 167
98 operator std::string (); 168 operator std::string ();
99}; 169};
100 170
… …
103 dynbuf_text (int initial = 4096, int extend = 16384) 173 dynbuf_text (int initial = 4096, int extend = 16384)
104 : dynbuf (initial, extend) 174 : dynbuf (initial, extend)
105 { } 175 { }
106 176
107 using dynbuf::add; 177 using dynbuf::add;
108
109 static const int max_sint32_size = 11;
110 static const int max_sint64_size = 20;
111
112 void add (sint32 i); 178 void add (sint32 i);
113 void add (sint64 i); 179 void add (sint64 i);
114 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)));
115 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 *();
116}; 210};
117 211
118#endif 212#endif
119 213

Diff Legend

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