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.19 by root, Thu Sep 11 21:36:07 2008 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
9 * it under the terms of the GNU General Public License as published by 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 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your 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,
… …
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 GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24#ifndef DYNBUF_H__ 24#ifndef DYNBUF_H__
25#define DYNBUF_H__ 25#define DYNBUF_H__
26 26
… …
46 int size; 46 int size;
47 char data[0]; 47 char data[0];
48 }; 48 };
49 49
50 char *ptr, *end; 50 char *ptr, *end;
51 int ext;
52 int _size; 51 int _size;
53 52
53 int extend, cextend;
54 chunk *first, *last; 54 chunk *first, *last;
55 55
56 void _reserve (int size); 56 void reserve (int size);
57 void _clear (); 57 void init (int initial); // allocate sinitial chunk
58 void clear (); 58 void free (chunk *&chain); // free chain of chunks
59 char *_linearise ();
59 void finish (); 60 void finalise ();
60 61
61public: 62public:
62 63
64 // initial - the size of the initial chunk to be allocated
65 // extend - first incremental step when buffer size exceeded
63 dynbuf (int initial = 4096, int extend = 16384); 66 dynbuf (int initial = 4096, int extend = 16384)
67 : extend (extend)
68 {
69 init (initial);
70 }
71
64 ~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 ();
65 81
66 int size () const { return _size + (ptr - last->data); } 82 int size () const { return _size + (ptr - last->data); }
67 bool empty () const { return !size (); } 83 bool empty () const { return !size (); }
68 84
69 void linearise (void *data); 85 void linearise (void *data);
70 char *linearise (); // does not 0-terminate(!) 86 char *linearise () // does not 0-terminate(!)
87 {
88 return first->next ? _linearise () : first->data;
89 }
71 90
72 int room () const { return end - ptr; } 91 int room () const { return end - ptr; }
73 92
74 char *force (int size) 93 char *force (int size)
75 { 94 {
76 if (expect_false (ptr + size >= end)) 95 if (expect_false (ptr + size >= end))
77 _reserve (size); 96 reserve (size);
78 97
79 return ptr; 98 return ptr;
80 } 99 }
81 100
82 char *falloc (int size) 101 char *falloc (int size)
… …
137 dynbuf_text (int initial = 4096, int extend = 16384) 156 dynbuf_text (int initial = 4096, int extend = 16384)
138 : dynbuf (initial, extend) 157 : dynbuf (initial, extend)
139 { } 158 { }
140 159
141 using dynbuf::add; 160 using dynbuf::add;
142
143 void add (sint32 i); 161 void add (sint32 i);
144 void add (sint64 i); 162 void add (sint64 i);
145 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
146 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 * ();
147}; 186};
148 187
149#endif 188#endif
150 189

Diff Legend

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