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 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 |
|
25 |
#ifndef DYNBUF_H__ |
26 |
#define DYNBUF_H__ |
27 |
|
28 |
#include <cstdarg> |
29 |
#include <cstring> |
30 |
#include <cassert> |
31 |
|
32 |
#include "util.h" |
33 |
#include "shstr.h" |
34 |
|
35 |
// this is a "buffer" that can grow fast |
36 |
// and is still somewhat space-efficient. |
37 |
// unlike obstacks or other data structures, |
38 |
// it never moves data around. basically, |
39 |
// this is a fast strstream without the overhead. |
40 |
|
41 |
struct dynbuf |
42 |
{ |
43 |
protected: |
44 |
struct chunk |
45 |
{ |
46 |
chunk *next; |
47 |
int alloc; |
48 |
int size; |
49 |
char data[0]; |
50 |
}; |
51 |
|
52 |
char *ptr, *end; |
53 |
int _size; |
54 |
|
55 |
int extend, cextend; |
56 |
chunk *first, *last; |
57 |
|
58 |
void reserve (int size); |
59 |
void init (int initial); // allocate sinitial chunk |
60 |
void free (chunk *&chain); // free chain of chunks |
61 |
char *_linearise (); |
62 |
void finalise (); |
63 |
|
64 |
public: |
65 |
|
66 |
// initial - the size of the initial chunk to be allocated |
67 |
// extend - first incremental step when buffer size exceeded |
68 |
dynbuf (int initial = 4096, int extend = 16384) |
69 |
: extend (extend) |
70 |
{ |
71 |
init (initial); |
72 |
} |
73 |
|
74 |
~dynbuf () |
75 |
{ |
76 |
free (first); |
77 |
} |
78 |
|
79 |
// resets the dynbuf, but does not free the first chunk |
80 |
// which is either of size "initial" or the size of the last |
81 |
// linearise |
82 |
void clear (); |
83 |
|
84 |
int size () const { return _size + (ptr - last->data); } |
85 |
bool empty () const { return !size (); } |
86 |
|
87 |
void linearise (void *data); |
88 |
char *linearise () // does not 0-terminate(!) |
89 |
{ |
90 |
return first->next ? _linearise () : first->data; |
91 |
} |
92 |
|
93 |
int room () const { return end - ptr; } |
94 |
|
95 |
char *force (int size) |
96 |
{ |
97 |
if (expect_false (ptr + size >= end)) |
98 |
reserve (size); |
99 |
|
100 |
return ptr; |
101 |
} |
102 |
|
103 |
char *falloc (int size) |
104 |
{ |
105 |
char *res = ptr; |
106 |
ptr += size; |
107 |
return res; |
108 |
} |
109 |
|
110 |
char *alloc (int size) |
111 |
{ |
112 |
force (size); |
113 |
return falloc (size); |
114 |
} |
115 |
|
116 |
void fadd (char c) { *ptr++ = c; } |
117 |
void fadd (unsigned char c) { fadd (char (c)); } |
118 |
void fadd (const void *p, int len) |
119 |
{ |
120 |
memcpy (falloc (len), p, len); |
121 |
} |
122 |
|
123 |
void add (const void *p, int len) |
124 |
{ |
125 |
force (len); |
126 |
fadd (p, len); |
127 |
} |
128 |
|
129 |
void add (char c) |
130 |
{ |
131 |
alloc (1)[0] = c; |
132 |
} |
133 |
|
134 |
void add (const char *s) |
135 |
{ |
136 |
add (s, strlen (s)); |
137 |
} |
138 |
|
139 |
void add (shstr_tmp s) |
140 |
{ |
141 |
add (s.s, s.length ()); |
142 |
} |
143 |
|
144 |
//TODO |
145 |
//void add_destructive (dynbuf &buf); |
146 |
|
147 |
dynbuf &operator << (char c) { add (c); return *this; } |
148 |
dynbuf &operator << (unsigned char c) { return *this << char (c); } |
149 |
dynbuf &operator << (const char *s) { add (s); return *this; } |
150 |
dynbuf &operator << (shstr_tmp s) { add (s); return *this; } |
151 |
dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
152 |
|
153 |
operator std::string (); |
154 |
}; |
155 |
|
156 |
struct dynbuf_text : dynbuf |
157 |
{ |
158 |
dynbuf_text (int initial = 4096, int extend = 16384) |
159 |
: dynbuf (initial, extend) |
160 |
{ } |
161 |
|
162 |
using dynbuf::add; |
163 |
void add (sint32 i); |
164 |
void add (sint64 i); |
165 |
|
166 |
//TODO: should optimise the case printf "(name %+d)" as it comes up extremely often |
167 |
|
168 |
//using dynbuf::operator <<; // doesn't work, sometimes C++ just suxx |
169 |
// instead we use an ugly template function |
170 |
template<typename T> |
171 |
dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; } |
172 |
|
173 |
dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; } |
174 |
dynbuf_text &operator << (uint16 i) { add (sint32 (i)); return *this; } |
175 |
dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; } |
176 |
dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; } |
177 |
dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; } |
178 |
dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; } |
179 |
|
180 |
void printf (const char *format, ...); |
181 |
void vprintf (const char *format, va_list ap); |
182 |
|
183 |
void add_abilities (const char *name, uint32 abilities); |
184 |
void add_paths (const char *name, uint32 paths); |
185 |
|
186 |
// returns the string, linearised and with trailing \0 |
187 |
operator char *(); |
188 |
}; |
189 |
|
190 |
#endif |
191 |
|