Thu, 11 Dec 2014 16:17:35 +0200
- now with more license headers
9
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
1 | /* |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
2 | Copyright 2014 Teemu Piippo |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
3 | All rights reserved. |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
4 | |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
5 | Redistribution and use in source and binary forms, with or without |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
6 | modification, are permitted provided that the following conditions |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
7 | are met: |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
8 | |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
9 | 1. Redistributions of source code must retain the above copyright |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
10 | notice, this list of conditions and the following disclaimer. |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
11 | 2. Redistributions in binary form must reproduce the above copyright |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
12 | notice, this list of conditions and the following disclaimer in the |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
13 | documentation and/or other materials provided with the distribution. |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
14 | 3. Neither the name of the copyright holder nor the names of its |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
15 | contributors may be used to endorse or promote products derived from |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
16 | this software without specific prior written permission. |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
17 | |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
18 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
19 | "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
20 | TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
21 | PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
22 | OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
23 | EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
24 | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
25 | PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
26 | LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
27 | NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
28 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
29 | */ |
e7a09ceb4505
- now with more license headers
Teemu Piippo <crimsondusk64@gmail.com>
parents:
5
diff
changeset
|
30 | |
5 | 31 | #include "bytestream.h" |
32 | #include <string.h> | |
33 | ||
34 | bool Bytestream::sink; | |
35 | ||
36 | // ------------------------------------------------------------------------------------------------- | |
37 | // | |
38 | Bytestream::Bytestream (unsigned long length) : | |
39 | m_data (nullptr) | |
40 | { | |
41 | resize (length); | |
42 | clear(); | |
43 | } | |
44 | ||
45 | // ------------------------------------------------------------------------------------------------- | |
46 | // | |
47 | Bytestream::Bytestream (const unsigned char* data, unsigned long length) : | |
48 | m_data (nullptr) | |
49 | { | |
50 | m_data = nullptr; | |
51 | init (data, length); | |
52 | } | |
53 | ||
54 | // ------------------------------------------------------------------------------------------------- | |
55 | // | |
56 | Bytestream::Bytestream (const Vector<unsigned char>& bytes) : | |
57 | m_data (nullptr) | |
58 | { | |
59 | init (bytes.data(), bytes.size()); | |
60 | } | |
61 | ||
62 | // ------------------------------------------------------------------------------------------------- | |
63 | // | |
64 | Bytestream::~Bytestream() | |
65 | { | |
66 | delete m_data; | |
67 | } | |
68 | ||
69 | // ------------------------------------------------------------------------------------------------- | |
70 | // | |
71 | void Bytestream::resize (unsigned long newsize) | |
72 | { | |
73 | Vector<unsigned char> olddata; | |
74 | unsigned long oldsize = 0L; | |
75 | ||
76 | if (m_data != nullptr) | |
77 | { | |
78 | oldsize = allocated_size(); | |
79 | olddata.resize (oldsize); | |
80 | memcpy (olddata.data(), m_data, oldsize); | |
81 | } | |
82 | ||
83 | delete[] m_data; | |
84 | m_allocatedSize = newsize; | |
85 | m_data = new unsigned char[newsize]; | |
86 | ||
87 | if (olddata > 0L) | |
88 | memcpy (m_data, olddata, min (oldsize, newsize)); | |
89 | } | |
90 | ||
91 | // ------------------------------------------------------------------------------------------------- | |
92 | // | |
93 | void Bytestream::init (const unsigned char* data, unsigned long length) | |
94 | { | |
95 | resize (length); | |
96 | memcpy (m_data, data, length); | |
97 | m_cursor = &m_data[0]; | |
98 | m_writtenLength = length; | |
99 | } | |
100 | ||
101 | // ------------------------------------------------------------------------------------------------- | |
102 | // | |
103 | void Bytestream::clear() | |
104 | { | |
105 | m_cursor = &m_data[0]; | |
106 | m_writtenLength = 0; | |
107 | } | |
108 | ||
109 | // ------------------------------------------------------------------------------------------------- | |
110 | // | |
111 | char Bytestream::read_byte (bool* ok) | |
112 | { | |
113 | *ok = bytes_left() > 0; | |
114 | return *ok ? *m_cursor++ : -1; | |
115 | } | |
116 | ||
117 | // ------------------------------------------------------------------------------------------------- | |
118 | // | |
119 | short int Bytestream::read_short (bool* ok) | |
120 | { | |
121 | if (bytes_left() < 2) | |
122 | { | |
123 | *ok = false; | |
124 | return false; | |
125 | } | |
126 | ||
127 | short int val = 0; | |
128 | ||
129 | for (int i = 0; i < 2; ++i) | |
130 | val |= *m_cursor++ << (i * 8); | |
131 | ||
132 | *ok = true; | |
133 | return true; | |
134 | } | |
135 | ||
136 | // ------------------------------------------------------------------------------------------------- | |
137 | // | |
138 | long int Bytestream::read_long (bool* ok) | |
139 | { | |
140 | if (bytes_left() < 4) | |
141 | { | |
142 | *ok = false; | |
143 | return -1; | |
144 | } | |
145 | ||
146 | long int val = 0; | |
147 | ||
148 | for (int i = 0; i < 4; ++i) | |
149 | val |= *m_cursor++ << (i * 8); | |
150 | ||
151 | *ok = true; | |
152 | return val; | |
153 | } | |
154 | ||
155 | // ------------------------------------------------------------------------------------------------- | |
156 | // | |
157 | float Bytestream::read_float (bool* ok) | |
158 | { | |
159 | int value = read_long (ok); | |
160 | ||
161 | if (*ok == false) | |
162 | return -1.0f; | |
163 | ||
164 | return reinterpret_cast<float&> (value); | |
165 | } | |
166 | ||
167 | // ------------------------------------------------------------------------------------------------- | |
168 | // | |
169 | String Bytestream::read_string (bool* ok) | |
170 | { | |
171 | // Zandronum sends strings of maximum 2048 characters, though it only | |
172 | // reads 2047-character long ones so I guess we can follow up and do | |
173 | // the same :-) | |
174 | static char buffer[MAX_NETWORK_STRING]; | |
175 | unsigned char* stringEnd; | |
176 | unsigned char* stringBegin = m_cursor; | |
177 | unsigned char* end = m_data + allocated_size(); | |
178 | ||
179 | // where's the end of the string? | |
180 | for (stringEnd = m_cursor; *stringEnd != '\0'; ++stringEnd) | |
181 | { | |
182 | if (stringEnd == end) | |
183 | { | |
184 | // past the end of the buffer! Argh! | |
185 | *ok = false; | |
186 | return ""; | |
187 | } | |
188 | } | |
189 | ||
190 | m_cursor = stringEnd + 1; | |
191 | *ok = true; | |
192 | unsigned int length = stringEnd - m_cursor; | |
193 | ||
194 | // ensure we won't write past the buffer (note: we still moved | |
195 | // past the excess bytes in the above statement, those are ignored) | |
196 | if (length >= MAX_NETWORK_STRING) | |
197 | length = MAX_NETWORK_STRING - 1; | |
198 | ||
199 | memcpy (buffer, stringBegin, length); | |
200 | buffer[length] = '\0'; | |
201 | return String (buffer); | |
202 | } | |
203 | ||
204 | // ------------------------------------------------------------------------------------------------- | |
205 | // | |
206 | METHOD | |
207 | Bytestream::read (unsigned char* buffer, unsigned long length, bool* ok) -> void | |
208 | { | |
209 | if (bytes_left() < length) | |
210 | { | |
211 | *ok = false; | |
212 | return; | |
213 | } | |
214 | ||
215 | memcpy (buffer, m_cursor, length); | |
216 | m_cursor += length; | |
217 | *ok = true; | |
218 | } | |
219 | ||
220 | // ------------------------------------------------------------------------------------------------- | |
221 | // | |
222 | void Bytestream::write (unsigned char val) | |
223 | { | |
224 | *m_cursor++ = val; | |
225 | m_writtenLength++; | |
226 | } | |
227 | ||
228 | // ------------------------------------------------------------------------------------------------- | |
229 | // | |
230 | void Bytestream::write (const unsigned char* val, unsigned int length) | |
231 | { | |
232 | grow_to_fit (length); | |
233 | memcpy (m_cursor, val, length); | |
234 | m_cursor += length; | |
235 | m_writtenLength += length; | |
236 | } | |
237 | ||
238 | // ------------------------------------------------------------------------------------------------- | |
239 | // | |
240 | void Bytestream::grow_to_fit (unsigned long bytes) | |
241 | { | |
242 | if (space_left() < bytes) | |
243 | resize (allocated_size() + bytes + 128); | |
244 | } | |
245 | ||
246 | // ------------------------------------------------------------------------------------------------- | |
247 | // | |
248 | void Bytestream::write_byte (char val) | |
249 | { | |
250 | grow_to_fit (1); | |
251 | write (val); | |
252 | } | |
253 | ||
254 | // ------------------------------------------------------------------------------------------------- | |
255 | // | |
256 | void Bytestream::write_short (short int val) | |
257 | { | |
258 | grow_to_fit (2); | |
259 | ||
260 | for (int i = 0; i < 2; ++i) | |
261 | write ((val >> (i * 8)) & 0xFF); | |
262 | } | |
263 | ||
264 | // ------------------------------------------------------------------------------------------------- | |
265 | // | |
266 | void Bytestream::write_long (long int val) | |
267 | { | |
268 | grow_to_fit (4); | |
269 | ||
270 | for (int i = 0; i < 4; ++i) | |
271 | write ((val >> (i * 8)) & 0xFF); | |
272 | } | |
273 | ||
274 | // ------------------------------------------------------------------------------------------------- | |
275 | // | |
276 | void Bytestream::write_float (float val) | |
277 | { | |
278 | // I know this is probably dangerous but this is what Zandronum does so yeah | |
279 | write_long (reinterpret_cast<int&> (val)); | |
280 | } | |
281 | ||
282 | // ------------------------------------------------------------------------------------------------- | |
283 | // | |
284 | void Bytestream::write_string (const String& val) | |
285 | { | |
286 | grow_to_fit (val.length() + 1); | |
287 | write (reinterpret_cast<const unsigned char*> (val.chars()), val.length()); | |
288 | write (0); | |
289 | } | |
290 | ||
291 | // ------------------------------------------------------------------------------------------------- | |
292 | // | |
293 | void Bytestream::write_buffer (const Bytestream& other) | |
294 | { | |
295 | write (other.data(), other.written_length()); | |
296 | } |