… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* This file defines various flags that both the new client and |
25 | /* This file defines various flags that both the new client and |
… | |
… | |
40 | */ |
41 | */ |
41 | |
42 | |
42 | |
43 | |
43 | #ifndef NETWORK_H |
44 | #ifndef NETWORK_H |
44 | #define NETWORK_H |
45 | #define NETWORK_H |
|
|
46 | |
|
|
47 | //+GPL |
45 | |
48 | |
46 | #include <cstdarg> |
49 | #include <cstdarg> |
47 | |
50 | |
48 | /* Maximum size of any packet we expect. |
51 | /* Maximum size of any packet we expect. |
49 | * |
52 | * |
… | |
… | |
149 | #define SF_FIREON 0x01 |
152 | #define SF_FIREON 0x01 |
150 | #define SF_RUNON 0x02 |
153 | #define SF_RUNON 0x02 |
151 | |
154 | |
152 | /* Flags for the item command */ |
155 | /* Flags for the item command */ |
153 | enum {a_none, a_readied, a_wielded, a_worn, a_active, a_applied}; |
156 | enum {a_none, a_readied, a_wielded, a_worn, a_active, a_applied}; |
|
|
157 | |
154 | #define F_APPLIED 0x000F |
158 | #define F_APPLIED 0x000F |
155 | #define F_LOCATION 0x00F0 |
159 | #define F_LOCATION 0x00F0 |
156 | #define F_UNPAID 0x0200 |
160 | #define F_UNPAID 0x0200 |
157 | #define F_MAGIC 0x0400 |
161 | #define F_MAGIC 0x0400 |
158 | #define F_CURSED 0x0800 |
162 | #define F_CURSED 0x0800 |
… | |
… | |
192 | #define UPD_SP_DAMAGE 0x04 |
196 | #define UPD_SP_DAMAGE 0x04 |
193 | |
197 | |
194 | #define SOUND_NORMAL 0 |
198 | #define SOUND_NORMAL 0 |
195 | #define SOUND_SPELL 1 |
199 | #define SOUND_SPELL 1 |
196 | |
200 | |
|
|
201 | //-GPL |
|
|
202 | |
197 | struct data |
203 | struct data |
198 | { |
204 | { |
199 | unsigned int len; |
205 | unsigned int len; |
200 | const void *ptr; |
206 | const void *ptr; |
201 | |
207 | |
202 | data (const void *ptr, int len) : len (len), ptr (ptr) { } |
208 | data (const void *ptr, int len) : len (len), ptr (ptr) { } |
203 | data (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } |
209 | data (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } |
204 | data (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { } |
210 | data (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { } |
|
|
211 | data (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { } |
205 | }; |
212 | }; |
206 | |
213 | |
207 | struct data8 |
214 | struct data8 |
208 | { |
215 | { |
209 | unsigned int len; |
216 | unsigned int len; |
210 | const void *ptr; |
217 | const void *ptr; |
211 | |
218 | |
212 | data8 (const void *ptr, int len) : len (len), ptr (ptr) { } |
219 | data8 (const void *ptr, int len) : len (len), ptr (ptr) { } |
213 | data8 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } |
220 | data8 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } |
214 | data8 (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { } |
221 | data8 (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { } |
|
|
222 | data8 (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { } |
215 | }; |
223 | }; |
216 | |
224 | |
217 | struct data16 |
225 | struct data16 |
218 | { |
226 | { |
219 | unsigned int len; |
227 | unsigned int len; |
220 | const void *ptr; |
228 | const void *ptr; |
221 | |
229 | |
222 | data16 (const void *ptr, int len) : len (len), ptr (ptr) { } |
230 | data16 (const void *ptr, int len) : len (len), ptr (ptr) { } |
223 | data16 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } |
231 | data16 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } |
224 | data16 (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { } |
232 | data16 (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { } |
|
|
233 | data16 (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { } |
225 | }; |
234 | }; |
226 | |
235 | |
227 | struct ber32 |
236 | struct ber32 |
228 | { |
237 | { |
229 | enum { size = 5 }; // maximum length of an encoded ber32 |
238 | enum { size = 5 }; // maximum length of an encoded ber32 |
… | |
… | |
287 | packet &operator <<(const data &v); |
296 | packet &operator <<(const data &v); |
288 | packet &operator <<(const data8 &v); |
297 | packet &operator <<(const data8 &v); |
289 | packet &operator <<(const data16 &v); |
298 | packet &operator <<(const data16 &v); |
290 | |
299 | |
291 | packet &operator <<(const char *v); |
300 | packet &operator <<(const char *v); |
292 | packet &operator <<(const shstr &sh) { return *this << data (&sh, sh.length ()); } |
301 | packet &operator <<(shstr_tmp sh) { return *this << data (sh); } |
293 | packet &operator <<(const std::string &s) { return *this << data (s.data (), s.size ()); } |
302 | packet &operator <<(const std::string &s) { return *this << data (s.data (), s.size ()); } |
294 | |
303 | |
295 | void vprintf (const char *format, va_list ap); |
304 | void vprintf (const char *format, va_list ap); |
296 | |
305 | |
297 | void printf (const char *format, ...) |
306 | void printf (const char *format, ...) |