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

Diff Legend

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