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