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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * 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 |
6 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * 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 | * 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 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
18 | * |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * 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 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
21 | * <http://www.gnu.org/licenses/>. |
21 | * |
22 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
24 | */ |
24 | |
25 | |
25 | #ifndef DYNBUF_H__ |
26 | #ifndef DYNBUF_H__ |
26 | #define DYNBUF_H__ |
27 | #define DYNBUF_H__ |
27 | |
28 | |
28 | #include <cstring> |
29 | #include <cstring> |
29 | #include <cassert> |
30 | #include <cassert> |
30 | |
31 | |
|
|
32 | #include "compiler.h" |
31 | #include "util.h" |
33 | #include "util.h" |
32 | #include "shstr.h" |
34 | #include "shstr.h" |
33 | |
35 | |
34 | // this is a "buffer" that can grow fast |
36 | // this is a "buffer" that can grow fast |
35 | // and is still somewhat space-efficient. |
37 | // and is still somewhat space-efficient. |
… | |
… | |
55 | chunk *first, *last; |
57 | chunk *first, *last; |
56 | |
58 | |
57 | void reserve (int size); |
59 | void reserve (int size); |
58 | void init (int initial); // allocate sinitial chunk |
60 | void init (int initial); // allocate sinitial chunk |
59 | void free (chunk *&chain); // free chain of chunks |
61 | void free (chunk *&chain); // free chain of chunks |
60 | char *_linearise (); |
62 | char *_linearise (int extra = 0); |
61 | void finalise (); |
63 | void finalise (); |
62 | |
64 | |
63 | public: |
65 | public: |
64 | |
66 | |
65 | // initial - the size of the initial chunk to be allocated |
67 | // initial - the size of the initial chunk to be allocated |
… | |
… | |
83 | int size () const { return _size + (ptr - last->data); } |
85 | int size () const { return _size + (ptr - last->data); } |
84 | bool empty () const { return !size (); } |
86 | bool empty () const { return !size (); } |
85 | |
87 | |
86 | void linearise (void *data); |
88 | void linearise (void *data); |
87 | char *linearise () // does not 0-terminate(!) |
89 | char *linearise () // does not 0-terminate(!) |
88 | { |
90 | { |
89 | return first->next ? _linearise () : first->data; |
91 | return first->next ? _linearise () : first->data; |
90 | } |
92 | } |
91 | |
93 | |
92 | int room () const { return end - ptr; } |
94 | int room () const { return end - ptr; } |
93 | |
95 | |
|
|
96 | // make sure we have "size" extra room |
94 | char *force (int size) |
97 | char *force (int size) |
95 | { |
98 | { |
96 | if (expect_false (ptr + size >= end)) |
99 | if (ecb_expect_false (ptr + size > end)) |
97 | reserve (size); |
100 | reserve (size); |
98 | |
101 | |
|
|
102 | ecb_assume (ptr + size <= end); |
|
|
103 | |
99 | return ptr; |
104 | return ptr; |
100 | } |
105 | } |
101 | |
106 | |
|
|
107 | // used for force + alloc combo |
|
|
108 | void alloc (char *p) |
|
|
109 | { |
|
|
110 | ptr = p; |
|
|
111 | } |
|
|
112 | |
|
|
113 | // allocate size bytes and return pointer to them (caller must force()) |
102 | char *falloc (int size) |
114 | char *falloc (int size) |
103 | { |
115 | { |
104 | char *res = ptr; |
116 | char *res = ptr; |
105 | ptr += size; |
117 | ptr += size; |
106 | return res; |
118 | return res; |
107 | } |
119 | } |
108 | |
120 | |
|
|
121 | // allocate size bytes and return pointer to them |
109 | char *alloc (int size) |
122 | char *alloc (int size) |
110 | { |
123 | { |
111 | force (size); |
124 | force (size); |
112 | return falloc (size); |
125 | return falloc (size); |
113 | } |
126 | } |
… | |
… | |
137 | |
150 | |
138 | void add (shstr_tmp s) |
151 | void add (shstr_tmp s) |
139 | { |
152 | { |
140 | add (s.s, s.length ()); |
153 | add (s.s, s.length ()); |
141 | } |
154 | } |
|
|
155 | |
|
|
156 | // rather inefficient |
|
|
157 | void splice (int offset, int olen, const char *s, int slen); |
|
|
158 | void splice (int offset, int olen) { splice (offset, olen, "", 0); } |
142 | |
159 | |
143 | //TODO |
160 | //TODO |
144 | //void add_destructive (dynbuf &buf); |
161 | //void add_destructive (dynbuf &buf); |
145 | |
162 | |
146 | dynbuf &operator << (char c) { add (c); return *this; } |
163 | dynbuf &operator << (char c) { add (c); return *this; } |
… | |
… | |
174 | dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; } |
191 | dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; } |
175 | dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; } |
192 | dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; } |
176 | dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; } |
193 | dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; } |
177 | dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; } |
194 | dynbuf_text &operator << (uint64 i) { add (sint64 (i)); return *this; } |
178 | |
195 | |
179 | void printf (const char *format, ...); |
196 | void printf (const char *format, ...) ecb_attribute ((format (printf, 2, 3))); |
180 | void vprintf (const char *format, va_list ap); |
197 | void vprintf (const char *format, va_list ap); |
181 | |
198 | |
182 | void add_abilities (const char *name, uint32 abilities); |
199 | void add_abilities (const char *name, uint32 abilities); |
183 | void add_paths (const char *name, uint32 paths); |
200 | void add_paths (const char *name, uint32 paths); |
|
|
201 | |
|
|
202 | // we need to redefine, to keep the API :/ |
|
|
203 | using dynbuf::splice; |
|
|
204 | void splice (int offset, int olen, const char *s) |
|
|
205 | { |
|
|
206 | dynbuf::splice (offset, olen, s, strlen (s)); |
|
|
207 | } |
184 | |
208 | |
185 | // returns the string, linearised and with trailing \0 |
209 | // returns the string, linearised and with trailing \0 |
186 | operator char *(); |
210 | operator char *(); |
187 | }; |
211 | }; |
188 | |
212 | |