|
|
1 | /* |
|
|
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
|
|
5 | * |
|
|
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
|
|
7 | * the terms of the Affero GNU General Public License as published by the |
|
|
8 | * Free Software Foundation, either version 3 of the License, or (at your |
|
|
9 | * option) any later version. |
|
|
10 | * |
|
|
11 | * This program is distributed in the hope that it will be useful, |
|
|
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
14 | * GNU General Public License for more details. |
|
|
15 | * |
|
|
16 | * You should have received a copy of the Affero GNU General Public License |
|
|
17 | * and the GNU General Public License along with this program. If not, see |
|
|
18 | * <http://www.gnu.org/licenses/>. |
|
|
19 | * |
|
|
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
|
|
21 | */ |
|
|
22 | |
| 1 | #include "global.h" |
23 | #include "global.h" |
| 2 | |
24 | |
| 3 | #include <cstdio> |
25 | #include <cstdio> |
| 4 | |
26 | |
| 5 | dynbuf::dynbuf (int initial, int extend) |
27 | void |
|
|
28 | dynbuf::init (int initial) |
| 6 | { |
29 | { |
|
|
30 | cextend = extend; |
| 7 | _size = 0; |
31 | _size = 0; |
| 8 | ext = extend; |
32 | |
| 9 | first = last = (chunk *) new char[sizeof (chunk) + initial]; |
33 | first = last = (chunk *)salloc<char> (sizeof (chunk) + initial); |
| 10 | |
34 | first->alloc = sizeof (chunk) + initial; |
| 11 | first->next = 0; |
35 | first->next = 0; |
| 12 | room = initial; |
36 | |
| 13 | ptr = first->data; |
37 | ptr = first->data; |
|
|
38 | end = ptr + initial; |
| 14 | } |
39 | } |
| 15 | |
40 | |
| 16 | dynbuf::~dynbuf () |
41 | // frees a full chain and sets the pointer to zero |
|
|
42 | void |
|
|
43 | dynbuf::free (chunk *&chain) |
| 17 | { |
44 | { |
| 18 | clear (); |
45 | while (chain) |
|
|
46 | { |
|
|
47 | chunk *next = chain->next; |
|
|
48 | |
|
|
49 | sfree<char> ((char *)chain, chain->alloc); |
|
|
50 | chain = next; |
|
|
51 | } |
| 19 | } |
52 | } |
| 20 | |
53 | |
| 21 | void |
54 | void |
| 22 | dynbuf::clear () |
55 | dynbuf::clear () |
| 23 | { |
56 | { |
| 24 | while (first) |
57 | cextend = extend; |
| 25 | { |
58 | free (first->next); |
| 26 | chunk *next = first->next; |
|
|
| 27 | |
59 | |
| 28 | delete[](char *) first; |
60 | _size = 0; |
| 29 | first = next; |
61 | ptr = first->data; |
| 30 | } |
62 | end = ptr + first->alloc - sizeof (chunk); |
|
|
63 | last = first; |
| 31 | } |
64 | } |
| 32 | |
65 | |
| 33 | void |
66 | void |
| 34 | dynbuf::finish () |
67 | dynbuf::finalise () |
| 35 | { |
68 | { |
| 36 | // finalise current chunk |
69 | // finalise current chunk |
| 37 | _size += last->size = ptr - last->data; |
70 | _size += last->size = ptr - last->data; |
| 38 | } |
71 | } |
| 39 | |
72 | |
| 40 | void |
73 | void |
| 41 | dynbuf::_reserve (int size) |
74 | dynbuf::reserve (int size) |
| 42 | { |
75 | { |
| 43 | finish (); |
76 | finalise (); |
| 44 | |
77 | |
| 45 | do |
78 | do |
| 46 | { |
79 | { |
| 47 | ext += ext >> 1; |
80 | cextend += cextend >> 1; |
| 48 | ext = (ext + 15) & ~15; |
81 | cextend = (cextend + 15) & ~15; |
| 49 | } |
82 | } |
| 50 | while (ext < size); |
83 | while (cextend < size); |
| 51 | |
84 | |
| 52 | chunk *add = (chunk *) new char[sizeof (chunk) + ext]; |
85 | chunk *add = (chunk *) salloc<char> (sizeof (chunk) + cextend); |
| 53 | |
86 | add->alloc = sizeof (chunk) + cextend; |
| 54 | add->next = 0; |
87 | add->next = 0; |
| 55 | |
88 | |
| 56 | last->next = add; |
89 | last->next = add; |
| 57 | last = add; |
90 | last = add; |
| 58 | |
91 | |
| 59 | room = ext; |
|
|
| 60 | ptr = last->data; |
92 | ptr = last->data; |
|
|
93 | end = ptr + cextend; |
| 61 | } |
94 | } |
| 62 | |
95 | |
| 63 | void |
96 | void |
| 64 | dynbuf::linearise (void *data) |
97 | dynbuf::linearise (void *data) |
| 65 | { |
98 | { |
| 66 | char *p = (char *) data; |
|
|
| 67 | |
|
|
| 68 | last->size = ptr - last->data; |
99 | last->size = ptr - last->data; |
| 69 | |
100 | |
| 70 | for (chunk * c = first; c; c = c->next) |
101 | for (chunk *c = first; c; c = c->next) |
| 71 | { |
102 | { |
| 72 | memcpy (p, c->data, c->size); |
103 | memcpy (data, c->data, c->size); |
| 73 | p += c->size; |
104 | data = (void *)(((char *)data) + c->size); |
| 74 | } |
105 | } |
| 75 | } |
106 | } |
| 76 | |
107 | |
| 77 | char * |
108 | char * |
| 78 | dynbuf::linearise () |
109 | dynbuf::_linearise (int extra) |
| 79 | { |
110 | { |
| 80 | if (first->next) |
111 | finalise (); |
| 81 | { |
|
|
| 82 | finish (); |
|
|
| 83 | |
112 | |
| 84 | chunk *add = (chunk *) new char[sizeof (chunk) + _size]; |
113 | chunk *add = (chunk *) salloc<char> (sizeof (chunk) + _size + extra); |
| 85 | |
114 | add->alloc = sizeof (chunk) + _size; |
| 86 | add->next = 0; |
115 | add->next = 0; |
|
|
116 | |
| 87 | linearise ((void *) add->data); |
117 | linearise ((void *)add->data); |
| 88 | clear (); |
118 | free (first); |
| 89 | |
119 | |
| 90 | first = last = add; |
120 | first = last = add; |
| 91 | ptr = last->data + _size; |
121 | ptr = last->data + _size; |
|
|
122 | end = ptr + extra; |
| 92 | _size = 0; |
123 | _size = 0; |
| 93 | room = 0; |
|
|
| 94 | } |
|
|
| 95 | |
124 | |
| 96 | return first->data; |
125 | return first->data; |
| 97 | } |
126 | } |
| 98 | |
127 | |
| 99 | void |
128 | dynbuf::operator std::string () |
| 100 | dynbuf::add (sint32 i) |
|
|
| 101 | { |
129 | { |
| 102 | char buf[max_sint32_size]; |
130 | // could optimise |
| 103 | char *p = buf + sizeof (buf); |
131 | return std::string (linearise (), size ()); |
| 104 | char neg; |
132 | } |
| 105 | |
133 | |
| 106 | uint32 val; |
134 | void |
|
|
135 | dynbuf::splice (int offset, int olen, const char *s, int slen) |
|
|
136 | { |
|
|
137 | // how much bytes to extend (negative if shrinking) |
|
|
138 | int adjust = slen - olen; |
| 107 | |
139 | |
| 108 | if (i < 0) |
140 | // linearise, unless everything fits in the last chunk |
|
|
141 | if (offset < _size || room () < adjust) |
|
|
142 | _linearise (max (adjust, 0)); |
|
|
143 | |
|
|
144 | offset -= _size; // offset into chunk |
|
|
145 | |
|
|
146 | // now move tail to final position |
|
|
147 | char *pos = last->data + offset; |
|
|
148 | char *src = pos + olen; |
|
|
149 | char *dst = pos + slen; |
|
|
150 | memmove (dst, src, ptr - src); |
|
|
151 | |
|
|
152 | // now copy new content |
|
|
153 | memcpy (pos, s, slen); |
|
|
154 | |
|
|
155 | // finally adjust length |
|
|
156 | ptr += adjust; |
|
|
157 | } |
|
|
158 | |
|
|
159 | void |
|
|
160 | dynbuf_text::vprintf (const char *format, va_list ap) |
|
|
161 | { |
|
|
162 | int len; |
|
|
163 | |
|
|
164 | { |
|
|
165 | force (128); |
|
|
166 | |
|
|
167 | va_list apc; |
|
|
168 | va_copy (apc, ap); |
|
|
169 | len = vsnprintf (ptr, end - ptr, format, apc); |
|
|
170 | va_end (apc); |
|
|
171 | |
|
|
172 | assert (len >= 0); // shield against broken vsnprintf's |
|
|
173 | |
|
|
174 | // was enough room available |
|
|
175 | if (ptr + len < end) |
| 109 | { |
176 | { |
| 110 | neg = '-'; |
177 | ptr += len; |
| 111 | val = -i; |
178 | return; |
|
|
179 | } |
|
|
180 | } |
|
|
181 | |
|
|
182 | // longer, try harder |
|
|
183 | vsnprintf (force (len + 1), len + 1, format, ap); |
|
|
184 | |
|
|
185 | ptr += len; |
|
|
186 | } |
|
|
187 | |
|
|
188 | void |
|
|
189 | dynbuf_text::printf (const char *format, ...) |
|
|
190 | { |
|
|
191 | va_list ap; |
|
|
192 | va_start (ap, format); |
|
|
193 | vprintf (format, ap); |
|
|
194 | va_end (ap); |
|
|
195 | } |
|
|
196 | |
|
|
197 | // simply return a mask with "bits" bits set |
|
|
198 | static inline uint64 |
|
|
199 | m (int b) |
|
|
200 | { |
|
|
201 | return (uint64 (1) << b) - 1; |
|
|
202 | } |
|
|
203 | |
|
|
204 | // convert 9 digits to ascii, using only a single multiplication |
|
|
205 | // (depending on cpu and compiler). |
|
|
206 | // will generate a single 0 as output when v=lz=0 |
|
|
207 | static inline char * |
|
|
208 | i2a_9 (char *ptr, uint32 v, bool lz) |
|
|
209 | { |
|
|
210 | // convert to 4.56 fixed-point representation |
|
|
211 | // this should be optimal on 64 bit cpus, and rather |
|
|
212 | // slow on 32 bit cpus. go figure :) |
|
|
213 | const int bits = 7*8; // 7 bits per post-comma digit |
|
|
214 | |
|
|
215 | uint64 u = v * ((m (bits) + 100000000) / 100000000); // 10**8 |
|
|
216 | |
|
|
217 | if (lz) |
|
|
218 | { |
|
|
219 | // output leading zeros |
|
|
220 | // good compilers will compile this into only shifts, masks and adds |
|
|
221 | *ptr++ = char (u >> (bits - 1)) + '0'; u = (u & m (bits - 1)) * 5; |
|
|
222 | *ptr++ = char (u >> (bits - 2)) + '0'; u = (u & m (bits - 2)) * 5; |
|
|
223 | *ptr++ = char (u >> (bits - 3)) + '0'; u = (u & m (bits - 3)) * 5; |
|
|
224 | *ptr++ = char (u >> (bits - 4)) + '0'; u = (u & m (bits - 4)) * 5; |
|
|
225 | *ptr++ = char (u >> (bits - 5)) + '0'; u = (u & m (bits - 5)) * 5; |
|
|
226 | *ptr++ = char (u >> (bits - 6)) + '0'; u = (u & m (bits - 6)) * 5; |
|
|
227 | *ptr++ = char (u >> (bits - 7)) + '0'; u = (u & m (bits - 7)) * 5; |
|
|
228 | *ptr++ = char (u >> (bits - 8)) + '0'; |
| 112 | } |
229 | } |
| 113 | else |
230 | else |
| 114 | { |
231 | { |
| 115 | neg = 0; |
232 | // do not output leading zeroes (except if v == 0) |
| 116 | val = i; |
233 | // good compilers will compile this into completely branchless code |
| 117 | } |
234 | char digit, nz = 0; |
| 118 | |
235 | |
| 119 | do |
236 | digit = (u >> (bits - 0)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 0)) * 5; |
|
|
237 | digit = (u >> (bits - 1)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 1)) * 5; |
|
|
238 | digit = (u >> (bits - 2)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 2)) * 5; |
|
|
239 | digit = (u >> (bits - 3)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 3)) * 5; |
|
|
240 | digit = (u >> (bits - 4)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 4)) * 5; |
|
|
241 | digit = (u >> (bits - 5)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 5)) * 5; |
|
|
242 | digit = (u >> (bits - 6)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 6)) * 5; |
|
|
243 | digit = (u >> (bits - 7)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 7)) * 5; |
|
|
244 | digit = (u >> (bits - 8)); *ptr = digit + '0'; nz |= digit; ptr += 1; |
| 120 | { |
245 | } |
| 121 | uint32 div = val / 10; |
|
|
| 122 | *--p = '0' + char (val - div * 10); |
|
|
| 123 | |
246 | |
| 124 | val = div; |
247 | return ptr; |
| 125 | } |
|
|
| 126 | while (val); |
|
|
| 127 | |
|
|
| 128 | if (neg) |
|
|
| 129 | *--p = neg; |
|
|
| 130 | |
|
|
| 131 | add ((void *) p, buf + sizeof (buf) - p); |
|
|
| 132 | } |
248 | } |
| 133 | |
249 | |
| 134 | void |
250 | void |
| 135 | dynbuf::add (sint64 i) |
251 | dynbuf_text::add (sint32 i) |
| 136 | { |
252 | { |
| 137 | if (i > -10000000 && i < 10000000) |
253 | force (sint32_digits); |
| 138 | { |
254 | |
| 139 | add (sint32 (i)); |
255 | *ptr = '-'; ptr += i < 0 ? 1 : 0; |
| 140 | return; |
256 | uint32 u = i < 0 ? -i : i; |
|
|
257 | |
|
|
258 | if (expect_true (u < 10)) // we have a lot of single-digit numbers, so optimise |
|
|
259 | *ptr++ = u + '0'; |
|
|
260 | else if (expect_true (u < 100)) // we have a lot of double-digit numbers, too :) |
| 141 | } |
261 | { |
| 142 | |
262 | // let the compiler figure out sth. efficient here |
| 143 | char buf[max_sint64_size]; |
263 | *ptr++ = u / 10 + '0'; |
| 144 | char *p = buf + sizeof (buf); |
264 | *ptr++ = u % 10 + '0'; |
| 145 | char neg; |
|
|
| 146 | |
|
|
| 147 | uint64 val; |
|
|
| 148 | |
|
|
| 149 | if (i < 0) |
|
|
| 150 | { |
265 | } |
| 151 | neg = '-'; |
266 | else if (expect_true (u < 1000000000)) // 9 0's |
| 152 | val = -i; |
267 | ptr = i2a_9 (ptr, u, false); |
| 153 | } |
|
|
| 154 | else |
268 | else |
| 155 | { |
269 | { |
| 156 | neg = 0; |
270 | uint32 div = u / 1000000000; |
| 157 | val = i; |
271 | uint32 rem = u % 1000000000; |
|
|
272 | |
|
|
273 | ptr = i2a_9 (ptr, div, false); |
|
|
274 | ptr = i2a_9 (ptr, rem, true); |
|
|
275 | } |
|
|
276 | } |
|
|
277 | |
|
|
278 | void |
|
|
279 | dynbuf_text::add (sint64 i) |
|
|
280 | { |
|
|
281 | force (sint64_digits); |
|
|
282 | |
|
|
283 | *ptr = '-'; ptr += i < 0 ? 1 : 0; |
|
|
284 | uint64 u = i < 0 ? -i : i; |
|
|
285 | |
|
|
286 | // split the number into a 1-digit part |
|
|
287 | // (#19) and two 9 digit parts (9..18 and 0..8) |
|
|
288 | |
|
|
289 | // good compilers will only use multiplications here |
|
|
290 | |
|
|
291 | if (u < 10) // we have a lot of single-digit numbers, so optimise |
|
|
292 | *ptr++ = u + '0'; |
|
|
293 | else if (expect_true (u < 1000000000)) // 9 0's |
|
|
294 | ptr = i2a_9 (ptr, u, false); |
|
|
295 | else if (expect_true (u < UINT64_C (1000000000000000000))) // 18 0's |
| 158 | } |
296 | { |
|
|
297 | uint32 div = u / 1000000000; |
|
|
298 | uint32 rem = u % 1000000000; |
| 159 | |
299 | |
| 160 | do |
300 | ptr = i2a_9 (ptr, div, false); |
|
|
301 | ptr = i2a_9 (ptr, rem, true); |
|
|
302 | } |
|
|
303 | else |
|
|
304 | { |
|
|
305 | // a biggy, split off the topmost digit |
|
|
306 | uint32 div = u / UINT64_C (1000000000000000000); |
|
|
307 | uint64 rem = u % UINT64_C (1000000000000000000); |
|
|
308 | |
|
|
309 | *ptr++ = div + '0'; |
|
|
310 | |
|
|
311 | u = rem; |
|
|
312 | |
| 161 | { |
313 | { |
| 162 | uint64 div = val / 10; |
314 | uint32 div = u / 1000000000; |
| 163 | *--p = '0' + char (val - div * 10); |
315 | uint32 rem = u % 1000000000; |
| 164 | |
316 | |
| 165 | val = div; |
317 | ptr = i2a_9 (ptr, div, true); |
|
|
318 | ptr = i2a_9 (ptr, rem, true); |
| 166 | } |
319 | } |
| 167 | while (val); |
320 | } |
| 168 | |
|
|
| 169 | if (neg) |
|
|
| 170 | *--p = neg; |
|
|
| 171 | |
|
|
| 172 | add ((void *) p, buf + sizeof (buf) - p); |
|
|
| 173 | } |
321 | } |
|
|
322 | |
|
|
323 | dynbuf_text::operator char *() |
|
|
324 | { |
|
|
325 | *this << '\0'; |
|
|
326 | linearise (); |
|
|
327 | --ptr; |
|
|
328 | return first->data; |
|
|
329 | } |
|
|
330 | |
|
|
331 | void |
|
|
332 | dynbuf_text::add_abilities (const char *name, uint32 abilities) |
|
|
333 | { |
|
|
334 | if (!abilities) |
|
|
335 | return; |
|
|
336 | |
|
|
337 | *this << '(' << name; |
|
|
338 | |
|
|
339 | const char *sep = ": "; |
|
|
340 | for_all_bits_sparse_32 (abilities, i) |
|
|
341 | { |
|
|
342 | *this << sep; sep = ", "; |
|
|
343 | *this << attacks [i]; |
|
|
344 | } |
|
|
345 | |
|
|
346 | *this << ')'; |
|
|
347 | } |
|
|
348 | |
|
|
349 | void |
|
|
350 | dynbuf_text::add_paths (const char *name, uint32 paths) |
|
|
351 | { |
|
|
352 | if (!paths) |
|
|
353 | return; |
|
|
354 | |
|
|
355 | *this << '(' << name; |
|
|
356 | |
|
|
357 | const char *sep = ": "; |
|
|
358 | for (int i = 0; i < NRSPELLPATHS; ++i) |
|
|
359 | if (paths & (1 << i)) |
|
|
360 | { |
|
|
361 | *this << sep; sep = ", "; |
|
|
362 | *this << spellpathnames [i]; |
|
|
363 | } |
|
|
364 | |
|
|
365 | *this << ')'; |
|
|
366 | } |
|
|
367 | |
|
|
368 | #if 0 |
|
|
369 | struct dynbuf_test_class { |
|
|
370 | dynbuf_test_class () |
|
|
371 | { |
|
|
372 | sint64 s = 0; |
|
|
373 | for (int i = 0; i < 10000000; ++i) |
|
|
374 | { |
|
|
375 | char b1[256], b2[256]; |
|
|
376 | |
|
|
377 | dynbuf_text db; |
|
|
378 | db.add (s); |
|
|
379 | db.add (char (0)); |
|
|
380 | |
|
|
381 | db.linearise (b1); |
|
|
382 | sprintf (b2, "%ld", s); |
|
|
383 | |
|
|
384 | if (strcmp (b1, b2)) |
|
|
385 | printf ("<%s,%s>\n", b1, b2); |
|
|
386 | |
|
|
387 | if (i < 20) |
|
|
388 | s = (sint64) pow (10., i); |
|
|
389 | else |
|
|
390 | s = (sint64) exp (random () * (43.6682723752766 / RAND_MAX)); |
|
|
391 | } |
|
|
392 | |
|
|
393 | exit (0); |
|
|
394 | } |
|
|
395 | } dynbuf_test; |
|
|
396 | #endif |
|
|
397 | |
