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.18 by root, Sat Aug 30 05:19:03 2008 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
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your 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 GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 *
21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */
23
1#ifndef DYNBUF_H__ 24#ifndef DYNBUF_H__
2#define DYNBUF_H__ 25#define DYNBUF_H__
3 26
4#include <cstring> 27#include <cstring>
5#include <cassert> 28#include <cassert>
… …
23 int size; 46 int size;
24 char data[0]; 47 char data[0];
25 }; 48 };
26 49
27 char *ptr, *end; 50 char *ptr, *end;
28 int ext;
29 int _size; 51 int _size;
30 52
53 int extend;
31 chunk *first, *last; 54 chunk *first, *last;
32 55
33 void _reserve (int size); 56 void reserve (int size);
34 void _clear (); 57 void init (int initial); // allocate sinitial chunk
35 void clear (); 58 void free (chunk *&chain); // free chain of chunks
59 char *_linearise ();
36 void finish (); 60 void finalise ();
37 61
38public: 62public:
39 63
64 // initial - the size of the initial chunk to be allocated
65 // extend - first incremental step when buffer size exceeded
40 dynbuf (int initial = 4096, int extend = 16384); 66 dynbuf (int initial = 4096, int extend = 16384)
67 : extend (extend)
68 {
69 init (initial);
70 }
71
41 ~dynbuf (); 72 ~dynbuf ()
73 {
74 free (first);
75 }
76
77 // resets the dynbuf, but does not free the first chunk
78 // which is either of size "initial" or the size of the last
79 // linearise
80 void clear ();
42 81
43 int size () const { return _size + (ptr - last->data); } 82 int size () const { return _size + (ptr - last->data); }
44 bool empty () const { return !size (); } 83 bool empty () const { return !size (); }
45 84
46 void linearise (void *data); 85 void linearise (void *data);
47 char *linearise (); // does not 0-terminate(!) 86 char *linearise () // does not 0-terminate(!)
87 {
88 return first->next ? _linearise () : first->data;
89 }
48 90
49 int room () const { return end - ptr; } 91 int room () const { return end - ptr; }
50 92
51 char *force (int size) 93 char *force (int size)
52 { 94 {
53 if (expect_false (ptr + size >= end)) 95 if (expect_false (ptr + size >= end))
54 _reserve (size); 96 reserve (size);
55 97
56 return ptr; 98 return ptr;
57 } 99 }
58 100
59 char *alloc (int size) 101 char *falloc (int size)
60 { 102 {
61 char *res = force (size); 103 char *res = ptr;
62 ptr += size; 104 ptr += size;
63 return res; 105 return res;
64 } 106 }
65 107
108 char *alloc (int size)
109 {
110 force (size);
111 return falloc (size);
112 }
113
66 void fadd (char c) { *ptr++ = c; } 114 void fadd (char c) { *ptr++ = c; }
67 void fadd (unsigned char c) { fadd (char (c)); } 115 void fadd (unsigned char c) { fadd (char (c)); }
116 void fadd (const void *p, int len)
117 {
118 memcpy (falloc (len), p, len);
119 }
68 120
69 void add (const void *p, int len) 121 void add (const void *p, int len)
70 { 122 {
71 memcpy (alloc (len), p, len); 123 force (len);
124 fadd (p, len);
72 } 125 }
73 126
74 void add (char c) 127 void add (char c)
75 { 128 {
76 alloc (1)[0] = c; 129 alloc (1)[0] = c;
… …
103 dynbuf_text (int initial = 4096, int extend = 16384) 156 dynbuf_text (int initial = 4096, int extend = 16384)
104 : dynbuf (initial, extend) 157 : dynbuf (initial, extend)
105 { } 158 { }
106 159
107 using dynbuf::add; 160 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); 161 void add (sint32 i);
113 void add (sint64 i); 162 void add (sint64 i);
114 163
164 //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often
165
166 //using dynbuf::operator <<; // doesn't work, sometiems C++ just suxx
167 // instead we use an ugly template function
168 template<typename T>
169 dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; }
170
171 dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; }
172 dynbuf_text &operator << (uint16 i) { add (sint32 (i)); return *this; }
173 dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; }
174 dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; }
175 dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; }
176 dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; }
177
115 void printf (const char *format, ...); 178 void printf (const char *format, ...);
179 void vprintf (const char *format, va_list ap);
180
181 void add_abilities (const char *name, uint32 abilities);
182 void add_paths (const char *name, uint32 paths);
183
184 // returns the string, linearised and with trailing \0
185 operator const char * ();
116}; 186};
117 187
118#endif 188#endif
119 189

Diff Legend

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