|
|
1 | /* |
|
|
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
|
|
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
|
|
9 | * it under the terms of the GNU General Public License as published by |
|
|
10 | * the Free Software Foundation, either version 3 of the License, or |
|
|
11 | * (at your 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 GNU General Public License |
|
|
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
|
|
20 | * |
|
|
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
|
|
22 | */ |
|
|
23 | |
1 | #ifndef DYNBUF_H__ |
24 | #ifndef DYNBUF_H__ |
2 | #define DYNBUF_H__ |
25 | #define DYNBUF_H__ |
3 | |
26 | |
4 | #include <cstring> |
27 | #include <cstring> |
5 | #include <cassert> |
28 | #include <cassert> |
6 | |
29 | |
|
|
30 | #include "util.h" |
7 | #include "shstr.h" |
31 | #include "shstr.h" |
8 | |
32 | |
9 | // this is a "buffer" that can grow fast |
33 | // this is a "buffer" that can grow fast |
10 | // and is still somewhat space-efficient. |
34 | // and is still somewhat space-efficient. |
11 | // unlike obstacks or other data structures, |
35 | // unlike obstacks or other data structures, |
… | |
… | |
16 | { |
40 | { |
17 | protected: |
41 | protected: |
18 | struct chunk |
42 | struct chunk |
19 | { |
43 | { |
20 | chunk *next; |
44 | chunk *next; |
|
|
45 | int alloc; |
21 | int size; |
46 | int size; |
22 | char data[0]; |
47 | char data[0]; |
23 | }; |
48 | }; |
24 | |
49 | |
25 | char *ptr; |
50 | char *ptr, *end; |
26 | int room; |
|
|
27 | int ext; |
|
|
28 | int _size; |
51 | int _size; |
29 | |
52 | |
|
|
53 | int extend; |
30 | chunk *first, *last; |
54 | chunk *first, *last; |
31 | |
55 | |
32 | void _reserve (int size); |
56 | void reserve (int size); |
33 | void clear (); |
57 | void init (int initial); // allocate sinitial chunk |
|
|
58 | void free (chunk *&chain); // free chain of chunks |
|
|
59 | char *_linearise (); |
34 | void finish (); |
60 | void finalise (); |
35 | |
61 | |
36 | public: |
62 | public: |
37 | |
63 | |
|
|
64 | // initial - the size of the initial chunk to be allocated |
|
|
65 | // extend - first incremental step when buffer size exceeded |
38 | dynbuf (int initial = 4096, int extend = 16384); |
66 | dynbuf (int initial = 4096, int extend = 16384) |
39 | ~dynbuf (); |
67 | : extend (extend) |
|
|
68 | { |
|
|
69 | init (initial); |
|
|
70 | } |
40 | |
71 | |
|
|
72 | ~dynbuf () |
|
|
73 | { |
|
|
74 | free (first); |
|
|
75 | } |
|
|
76 | |
|
|
77 | // resets the dynbuf, but does not free the first chunk |
|
|
78 | // which is either of size "initial" or the size of the last |
|
|
79 | // linearise |
|
|
80 | void clear (); |
|
|
81 | |
41 | int size () { return _size + (ptr - last->data); } |
82 | int size () const { return _size + (ptr - last->data); } |
|
|
83 | bool empty () const { return !size (); } |
42 | |
84 | |
43 | void linearise (void *data); |
85 | void linearise (void *data); |
44 | char *linearise (); |
86 | char *linearise () // does not 0-terminate(!) |
|
|
87 | { |
|
|
88 | return first->next ? _linearise () : first->data; |
|
|
89 | } |
|
|
90 | |
|
|
91 | int room () const { return end - ptr; } |
45 | |
92 | |
46 | char *force (int size) |
93 | char *force (int size) |
47 | { |
94 | { |
48 | if (room < size) |
95 | if (expect_false (ptr + size >= end)) |
49 | _reserve (size); |
96 | reserve (size); |
50 | |
97 | |
51 | return ptr; |
98 | return ptr; |
52 | } |
99 | } |
53 | |
100 | |
54 | char *alloc (int size) |
101 | char *falloc (int size) |
55 | { |
102 | { |
56 | char *res = force (size); |
103 | char *res = ptr; |
57 | |
|
|
58 | room -= size; |
|
|
59 | ptr += size; |
104 | ptr += size; |
60 | |
|
|
61 | return res; |
105 | return res; |
62 | } |
106 | } |
63 | |
107 | |
|
|
108 | char *alloc (int size) |
|
|
109 | { |
|
|
110 | force (size); |
|
|
111 | return falloc (size); |
|
|
112 | } |
|
|
113 | |
64 | void fadd (char c) { --room; *ptr++ = c; } |
114 | void fadd (char c) { *ptr++ = c; } |
65 | void fadd (unsigned char c) { fadd (char (c)); } |
115 | void fadd (unsigned char c) { fadd (char (c)); } |
|
|
116 | void fadd (const void *p, int len) |
|
|
117 | { |
|
|
118 | memcpy (falloc (len), p, len); |
|
|
119 | } |
66 | |
120 | |
67 | void add (const void *p, int len) |
121 | void add (const void *p, int len) |
68 | { |
122 | { |
69 | memcpy (alloc (len), p, len); |
123 | force (len); |
|
|
124 | fadd (p, len); |
70 | } |
125 | } |
71 | |
126 | |
72 | void add (char c) |
127 | void add (char c) |
73 | { |
128 | { |
74 | alloc (1)[0] = c; |
129 | alloc (1)[0] = c; |
… | |
… | |
88 | //void add_destructive (dynbuf &buf); |
143 | //void add_destructive (dynbuf &buf); |
89 | |
144 | |
90 | dynbuf &operator << (char c) { add (c); return *this; } |
145 | dynbuf &operator << (char c) { add (c); return *this; } |
91 | dynbuf &operator << (unsigned char c) { return *this << char (c); } |
146 | dynbuf &operator << (unsigned char c) { return *this << char (c); } |
92 | dynbuf &operator << (const char *s) { add (s); return *this; } |
147 | dynbuf &operator << (const char *s) { add (s); return *this; } |
|
|
148 | dynbuf &operator << (const shstr &s) { add (s); return *this; } |
93 | dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
149 | dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
94 | |
150 | |
95 | operator std::string (); |
151 | operator std::string (); |
96 | }; |
152 | }; |
97 | |
153 | |
… | |
… | |
100 | dynbuf_text (int initial = 4096, int extend = 16384) |
156 | dynbuf_text (int initial = 4096, int extend = 16384) |
101 | : dynbuf (initial, extend) |
157 | : dynbuf (initial, extend) |
102 | { } |
158 | { } |
103 | |
159 | |
104 | using dynbuf::add; |
160 | using dynbuf::add; |
105 | |
|
|
106 | static const int max_sint32_size = 11; |
|
|
107 | static const int max_sint64_size = 20; |
|
|
108 | |
|
|
109 | void add (sint32 i); |
161 | void add (sint32 i); |
110 | void add (sint64 i); |
162 | void add (sint64 i); |
111 | |
163 | |
|
|
164 | //TODO: should optimise the case printf "(name %+d)" as it comes up extreemly often |
|
|
165 | |
|
|
166 | using dynbuf::operator <<; |
|
|
167 | dynbuf &operator << (sint16 i) { add (sint32 (i)); return *this; } |
|
|
168 | dynbuf &operator << (uint16 i) { add (sint32 (i)); return *this; } |
|
|
169 | dynbuf &operator << (sint32 i) { add (sint32 (i)); return *this; } |
|
|
170 | dynbuf &operator << (sint64 i) { add (sint64 (i)); return *this; } |
|
|
171 | dynbuf &operator << (uint32 i) { add (sint64 (i)); return *this; } |
|
|
172 | dynbuf &operator << (uint64 i) { add (sint64 (i)); return *this; } |
|
|
173 | |
112 | void printf (const char *format, ...); |
174 | void printf (const char *format, ...); |
|
|
175 | |
|
|
176 | void add_abilities (const char *name, uint32 abilities); |
|
|
177 | void add_paths (const char *name, uint32 paths); |
|
|
178 | |
|
|
179 | // returns the string, linearised and with trailing \0 |
|
|
180 | operator const char * (); |
113 | }; |
181 | }; |
114 | |
182 | |
115 | #endif |
183 | #endif |
|
|
184 | |