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.13 by root, Tue Jul 10 05:51:38 2007 UTC vs.
Revision 1.27 by root, Sat Nov 7 18:30:05 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,2009 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
… …
48 }; 49 };
49 50
50 char *ptr, *end; 51 char *ptr, *end;
51 int _size; 52 int _size;
52 53
53 int extend; 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 init (int initial); // allocate sinitial chunk 58 void init (int initial); // allocate sinitial chunk
58 void free (chunk *&chain); // free chain of chunks 59 void free (chunk *&chain); // free chain of chunks
59 char *_linearise (); 60 char *_linearise (int extra = 0);
60 void finalise (); 61 void finalise ();
61 62
62public: 63public:
63 64
64 // initial - the size of the initial chunk to be allocated 65 // initial - the size of the initial chunk to be allocated
… …
88 return first->next ? _linearise () : first->data; 89 return first->next ? _linearise () : first->data;
89 } 90 }
90 91
91 int room () const { return end - ptr; } 92 int room () const { return end - ptr; }
92 93
94 // make sure we have "size" extra room
93 char *force (int size) 95 char *force (int size)
94 { 96 {
95 if (expect_false (ptr + size >= end)) 97 if (expect_false (ptr + size >= end))
96 reserve (size); 98 reserve (size);
97 99
98 return ptr; 100 return ptr;
99 } 101 }
100 102
103 // allocate size bytes and return pointer to them (caller must force())
101 char *falloc (int size) 104 char *falloc (int size)
102 { 105 {
103 char *res = ptr; 106 char *res = ptr;
104 ptr += size; 107 ptr += size;
105 return res; 108 return res;
106 } 109 }
107 110
111 // allocate size bytes and return pointer to them
108 char *alloc (int size) 112 char *alloc (int size)
109 { 113 {
110 force (size); 114 force (size);
111 return falloc (size); 115 return falloc (size);
112 } 116 }
… …
132 void add (const char *s) 136 void add (const char *s)
133 { 137 {
134 add (s, strlen (s)); 138 add (s, strlen (s));
135 } 139 }
136 140
137 void add (const shstr &s) 141 void add (shstr_tmp s)
138 { 142 {
139 add (s.s, s.length ()); 143 add (s.s, s.length ());
140 } 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); }
141 149
142 //TODO 150 //TODO
143 //void add_destructive (dynbuf &buf); 151 //void add_destructive (dynbuf &buf);
144 152
145 dynbuf &operator << (char c) { add (c); return *this; } 153 dynbuf &operator << (char c) { add (c); return *this; }
146 dynbuf &operator << (unsigned char c) { return *this << char (c); } 154 dynbuf &operator << (unsigned char c) { return *this << char (c); }
147 dynbuf &operator << (const char *s) { add (s); return *this; } 155 dynbuf &operator << (const char *s) { add (s); return *this; }
148 dynbuf &operator << (const shstr &s) { add (s); return *this; } 156 dynbuf &operator << (shstr_tmp s) { add (s); return *this; }
149 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; }
150 158
151 operator std::string (); 159 operator std::string ();
152}; 160};
153 161
… …
159 167
160 using dynbuf::add; 168 using dynbuf::add;
161 void add (sint32 i); 169 void add (sint32 i);
162 void add (sint64 i); 170 void add (sint64 i);
163 171
164 //TODO: should optimise the case printf "(name %+d)" as it comes up extreemly often 172 //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often
165 173
166 using dynbuf::operator <<; 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
167 dynbuf &operator << (sint16 i) { add (sint32 (i)); return *this; } 179 dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; }
168 dynbuf &operator << (uint16 i) { add (sint32 (i)); return *this; } 180 dynbuf_text &operator << (uint16 i) { add (sint32 (i)); return *this; }
169 dynbuf &operator << (sint32 i) { add (sint32 (i)); return *this; } 181 dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; }
170 dynbuf &operator << (sint64 i) { add (sint64 (i)); return *this; } 182 dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; }
171 dynbuf &operator << (uint32 i) { add (sint64 (i)); return *this; } 183 dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; }
172 dynbuf &operator << (uint64 i) { add (sint64 (i)); return *this; } 184 dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; }
173 185
186 void printf (const char *format, ...) attribute ((format (printf, 2, 3)));
174 void printf (const char *format, ...); 187 void vprintf (const char *format, va_list ap);
175 188
176 void add_abilities (const char *name, uint32 abilities); 189 void add_abilities (const char *name, uint32 abilities);
177 void add_paths (const char *name, uint32 paths); 190 void add_paths (const char *name, uint32 paths);
178 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
179 // returns the string, linearised and with trailing \0 199 // returns the string, linearised and with trailing \0
180 operator const char * (); 200 operator char *();
181}; 201};
182 202
183#endif 203#endif
184 204

Diff Legend

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