1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra 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 <support@deliantra.net> |
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 | |
27 | #include <cstring> |
28 | #include <cstring> |
28 | #include <cassert> |
29 | #include <cassert> |
29 | |
30 | |
|
|
31 | #include "compiler.h" |
30 | #include "util.h" |
32 | #include "util.h" |
31 | #include "shstr.h" |
33 | #include "shstr.h" |
32 | |
34 | |
33 | // this is a "buffer" that can grow fast |
35 | // this is a "buffer" that can grow fast |
34 | // and is still somewhat space-efficient. |
36 | // and is still somewhat space-efficient. |
… | |
… | |
48 | }; |
50 | }; |
49 | |
51 | |
50 | char *ptr, *end; |
52 | char *ptr, *end; |
51 | int _size; |
53 | int _size; |
52 | |
54 | |
53 | int extend; |
55 | int extend, cextend; |
54 | chunk *first, *last; |
56 | chunk *first, *last; |
55 | |
57 | |
56 | void reserve (int size); |
58 | void reserve (int size); |
57 | void init (int initial); // allocate sinitial chunk |
59 | void init (int initial); // allocate sinitial chunk |
58 | void free (chunk *&chain); // free chain of chunks |
60 | void free (chunk *&chain); // free chain of chunks |
59 | char *_linearise (); |
61 | char *_linearise (int extra = 0); |
60 | void finalise (); |
62 | void finalise (); |
61 | |
63 | |
62 | public: |
64 | public: |
63 | |
65 | |
64 | // initial - the size of the initial chunk to be allocated |
66 | // initial - the size of the initial chunk to be allocated |
… | |
… | |
82 | int size () const { return _size + (ptr - last->data); } |
84 | int size () const { return _size + (ptr - last->data); } |
83 | bool empty () const { return !size (); } |
85 | bool empty () const { return !size (); } |
84 | |
86 | |
85 | void linearise (void *data); |
87 | void linearise (void *data); |
86 | char *linearise () // does not 0-terminate(!) |
88 | char *linearise () // does not 0-terminate(!) |
87 | { |
89 | { |
88 | return first->next ? _linearise () : first->data; |
90 | return first->next ? _linearise () : first->data; |
89 | } |
91 | } |
90 | |
92 | |
91 | int room () const { return end - ptr; } |
93 | int room () const { return end - ptr; } |
92 | |
94 | |
|
|
95 | // make sure we have "size" extra room |
93 | char *force (int size) |
96 | char *force (int size) |
94 | { |
97 | { |
95 | if (expect_false (ptr + size >= end)) |
98 | if (expect_false (ptr + size > end)) |
96 | reserve (size); |
99 | reserve (size); |
97 | |
100 | |
|
|
101 | assume (ptr + size <= end); |
|
|
102 | |
98 | return ptr; |
103 | return ptr; |
99 | } |
104 | } |
100 | |
105 | |
|
|
106 | // used for force + alloc combo |
|
|
107 | void alloc (char *p) |
|
|
108 | { |
|
|
109 | ptr = p; |
|
|
110 | } |
|
|
111 | |
|
|
112 | // allocate size bytes and return pointer to them (caller must force()) |
101 | char *falloc (int size) |
113 | char *falloc (int size) |
102 | { |
114 | { |
103 | char *res = ptr; |
115 | char *res = ptr; |
104 | ptr += size; |
116 | ptr += size; |
105 | return res; |
117 | return res; |
106 | } |
118 | } |
107 | |
119 | |
|
|
120 | // allocate size bytes and return pointer to them |
108 | char *alloc (int size) |
121 | char *alloc (int size) |
109 | { |
122 | { |
110 | force (size); |
123 | force (size); |
111 | return falloc (size); |
124 | return falloc (size); |
112 | } |
125 | } |
… | |
… | |
132 | void add (const char *s) |
145 | void add (const char *s) |
133 | { |
146 | { |
134 | add (s, strlen (s)); |
147 | add (s, strlen (s)); |
135 | } |
148 | } |
136 | |
149 | |
137 | void add (const shstr &s) |
150 | void add (shstr_tmp s) |
138 | { |
151 | { |
139 | add (s.s, s.length ()); |
152 | add (s.s, s.length ()); |
140 | } |
153 | } |
|
|
154 | |
|
|
155 | // rather inefficient |
|
|
156 | void splice (int offset, int olen, const char *s, int slen); |
|
|
157 | void splice (int offset, int olen) { splice (offset, olen, "", 0); } |
141 | |
158 | |
142 | //TODO |
159 | //TODO |
143 | //void add_destructive (dynbuf &buf); |
160 | //void add_destructive (dynbuf &buf); |
144 | |
161 | |
145 | dynbuf &operator << (char c) { add (c); return *this; } |
162 | dynbuf &operator << (char c) { add (c); return *this; } |
146 | dynbuf &operator << (unsigned char c) { return *this << char (c); } |
163 | dynbuf &operator << (unsigned char c) { return *this << char (c); } |
147 | dynbuf &operator << (const char *s) { add (s); return *this; } |
164 | dynbuf &operator << (const char *s) { add (s); return *this; } |
148 | dynbuf &operator << (const shstr &s) { add (s); return *this; } |
165 | dynbuf &operator << (shstr_tmp s) { add (s); return *this; } |
149 | dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
166 | dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
150 | |
167 | |
151 | operator std::string (); |
168 | operator std::string (); |
152 | }; |
169 | }; |
153 | |
170 | |
… | |
… | |
161 | void add (sint32 i); |
178 | void add (sint32 i); |
162 | void add (sint64 i); |
179 | void add (sint64 i); |
163 | |
180 | |
164 | //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often |
181 | //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often |
165 | |
182 | |
166 | //using dynbuf::operator <<; // doesn't work, sometiems C++ just suxx |
183 | //using dynbuf::operator <<; // doesn't work, sometimes C++ just suxx |
167 | // instead we use an ugly template function |
184 | // instead we use an ugly template function |
168 | template<typename T> |
185 | template<typename T> |
169 | dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; } |
186 | dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; } |
170 | |
187 | |
171 | dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; } |
188 | dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; } |
… | |
… | |
173 | dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; } |
190 | dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; } |
174 | dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; } |
191 | dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; } |
175 | dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; } |
192 | dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; } |
176 | dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; } |
193 | dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; } |
177 | |
194 | |
178 | void printf (const char *format, ...); |
195 | void printf (const char *format, ...) attribute ((format (printf, 2, 3))); |
179 | void vprintf (const char *format, va_list ap); |
196 | void vprintf (const char *format, va_list ap); |
180 | |
197 | |
181 | void add_abilities (const char *name, uint32 abilities); |
198 | void add_abilities (const char *name, uint32 abilities); |
182 | void add_paths (const char *name, uint32 paths); |
199 | void add_paths (const char *name, uint32 paths); |
183 | |
200 | |
|
|
201 | // we need to redefine, to keep the API :/ |
|
|
202 | using dynbuf::splice; |
|
|
203 | void splice (int offset, int olen, const char *s) |
|
|
204 | { |
|
|
205 | dynbuf::splice (offset, olen, s, strlen (s)); |
|
|
206 | } |
|
|
207 | |
184 | // returns the string, linearised and with trailing \0 |
208 | // returns the string, linearised and with trailing \0 |
185 | operator const char * (); |
209 | operator char *(); |
186 | }; |
210 | }; |
187 | |
211 | |
188 | #endif |
212 | #endif |
189 | |
213 | |