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