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.12 by root, Sun Jul 1 05:00:18 2007 UTC vs.
Revision 1.23 by root, Thu Oct 15 21:09:32 2009 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License 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 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * 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>
22 */ 23 */
23 24
24#ifndef DYNBUF_H__ 25#ifndef DYNBUF_H__
25#define DYNBUF_H__ 26#define DYNBUF_H__
26 27
… …
46 int size; 47 int size;
47 char data[0]; 48 char data[0];
48 }; 49 };
49 50
50 char *ptr, *end; 51 char *ptr, *end;
51 int ext;
52 int _size; 52 int _size;
53 53
54 int extend, cextend;
54 chunk *first, *last; 55 chunk *first, *last;
55 56
56 void _reserve (int size); 57 void reserve (int size);
57 void _clear (); 58 void init (int initial); // allocate sinitial chunk
58 void clear (); 59 void free (chunk *&chain); // free chain of chunks
60 char *_linearise ();
59 void finish (); 61 void finalise ();
60 62
61public: 63public:
62 64
65 // initial - the size of the initial chunk to be allocated
66 // extend - first incremental step when buffer size exceeded
63 dynbuf (int initial = 4096, int extend = 16384); 67 dynbuf (int initial = 4096, int extend = 16384)
68 : extend (extend)
69 {
70 init (initial);
71 }
72
64 ~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 ();
65 82
66 int size () const { return _size + (ptr - last->data); } 83 int size () const { return _size + (ptr - last->data); }
67 bool empty () const { return !size (); } 84 bool empty () const { return !size (); }
68 85
69 void linearise (void *data); 86 void linearise (void *data);
70 char *linearise (); // does not 0-terminate(!) 87 char *linearise () // does not 0-terminate(!)
88 {
89 return first->next ? _linearise () : first->data;
90 }
71 91
72 int room () const { return end - ptr; } 92 int room () const { return end - ptr; }
73 93
74 char *force (int size) 94 char *force (int size)
75 { 95 {
76 if (expect_false (ptr + size >= end)) 96 if (expect_false (ptr + size >= end))
77 _reserve (size); 97 reserve (size);
78 98
79 return ptr; 99 return ptr;
80 } 100 }
81 101
82 char *falloc (int size) 102 char *falloc (int size)
… …
113 void add (const char *s) 133 void add (const char *s)
114 { 134 {
115 add (s, strlen (s)); 135 add (s, strlen (s));
116 } 136 }
117 137
118 void add (const shstr &s) 138 void add (shstr_tmp s)
119 { 139 {
120 add (s.s, s.length ()); 140 add (s.s, s.length ());
121 } 141 }
122 142
123 //TODO 143 //TODO
124 //void add_destructive (dynbuf &buf); 144 //void add_destructive (dynbuf &buf);
125 145
126 dynbuf &operator << (char c) { add (c); return *this; } 146 dynbuf &operator << (char c) { add (c); return *this; }
127 dynbuf &operator << (unsigned char c) { return *this << char (c); } 147 dynbuf &operator << (unsigned char c) { return *this << char (c); }
128 dynbuf &operator << (const char *s) { add (s); return *this; } 148 dynbuf &operator << (const char *s) { add (s); return *this; }
129 dynbuf &operator << (const shstr &s) { add (s); return *this; } 149 dynbuf &operator << (shstr_tmp s) { add (s); return *this; }
130 dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } 150 dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; }
131 151
132 operator std::string (); 152 operator std::string ();
133}; 153};
134 154
… …
137 dynbuf_text (int initial = 4096, int extend = 16384) 157 dynbuf_text (int initial = 4096, int extend = 16384)
138 : dynbuf (initial, extend) 158 : dynbuf (initial, extend)
139 { } 159 { }
140 160
141 using dynbuf::add; 161 using dynbuf::add;
142
143 void add (sint32 i); 162 void add (sint32 i);
144 void add (sint64 i); 163 void add (sint64 i);
145 164
165 //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often
166
167 //using dynbuf::operator <<; // doesn't work, sometimes C++ just suxx
168 // instead we use an ugly template function
169 template<typename T>
170 dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; }
171
172 dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; }
173 dynbuf_text &operator << (uint16 i) { add (sint32 (i)); return *this; }
174 dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; }
175 dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; }
176 dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; }
177 dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; }
178
146 void printf (const char *format, ...); 179 void printf (const char *format, ...);
180 void vprintf (const char *format, va_list ap);
181
182 void add_abilities (const char *name, uint32 abilities);
183 void add_paths (const char *name, uint32 paths);
184
185 // returns the string, linearised and with trailing \0
186 operator char *();
147}; 187};
148 188
149#endif 189#endif
150 190

Diff Legend

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