1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | |
3 | * |
4 | Copyright (C) 1992 Frank Tore Johansen |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | Copyright (C) 2005, 2006 The Crossfire+ Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | |
7 | * |
8 | This program is free software; you can redistribute it and/or modify |
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 |
9 | * it under the terms of the GNU General Public License as published by |
10 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | (at your option) any later version. |
11 | * (at your 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 GNU General Public License |
19 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
21 | |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
22 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
|
|
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* This file defines various flags that both the new client and |
24 | /* This file defines various flags that both the new client and |
26 | * newserver uses. These should never be changed, only expanded. |
25 | * newserver uses. These should never be changed, only expanded. |
27 | * Changing them will likely cause all old clients to not work properly. |
26 | * Changing them will likely cause all old clients to not work properly. |
28 | * While called newclient, it is really used by both the client and |
27 | * While called newclient, it is really used by both the client and |
… | |
… | |
39 | * more reliable, as both the client and server will definately be |
38 | * more reliable, as both the client and server will definately be |
40 | * talking about the same values. |
39 | * talking about the same values. |
41 | */ |
40 | */ |
42 | |
41 | |
43 | |
42 | |
44 | #ifndef NEWCLIENT_H |
43 | #ifndef NETWORK_H |
45 | #define NEWCLIENT_H |
44 | #define NETWORK_H |
46 | |
45 | |
47 | /* Maximum size of any packet we expect. Using this makes it so we don't need to |
46 | #include <cstdarg> |
48 | * allocated and deallocated the same buffer over and over again and the price |
47 | |
49 | * of using a bit of extra memory. It also makes the code simpler. |
48 | /* Maximum size of any packet we expect. |
50 | * |
49 | * |
51 | * The size must be the same in the server and the client (stupid), and its also NOT |
50 | * The size must be the same in the server and the client (stupid), and its also NOT |
52 | * the maximum buffer size as one would expect, but the maximum buffer size + 1. |
51 | * the maximum buffer size as one would expect, but the maximum buffer size + 1. |
53 | */ |
52 | */ |
54 | #define MAXSOCKBUF 10240 |
53 | #define MAXSOCKBUF 10240 |
55 | |
54 | |
56 | |
|
|
57 | #define CS_QUERY_YESNO 0x1 /* Yes/no question */ |
55 | #define CS_QUERY_YESNO 0x1 /* Yes/no question */ |
58 | #define CS_QUERY_SINGLECHAR 0x2 /* Single character response expected */ |
56 | #define CS_QUERY_SINGLECHAR 0x2 /* Single character response expected */ |
59 | #define CS_QUERY_HIDEINPUT 0x4 /* Hide input being entered */ |
57 | #define CS_QUERY_HIDEINPUT 0x4 /* Hide input being entered */ |
60 | |
|
|
61 | #define CS_SAY_NORMAL 0x1 /* Normal say command */ |
|
|
62 | #define CS_SAY_SHOUT 0x2 /* Text is shouted. */ |
|
|
63 | #define CS_SAY_GSAY 0x4 /* Text is group say command */ |
|
|
64 | |
58 | |
65 | /* These are multiplication values that should be used when changing |
59 | /* These are multiplication values that should be used when changing |
66 | * floats to ints, and vice version. MULTI is integer representatin |
60 | * floats to ints, and vice version. MULTI is integer representatin |
67 | * (float to int), MULTF is float, for going from int to float. |
61 | * (float to int), MULTF is float, for going from int to float. |
68 | */ |
62 | */ |
… | |
… | |
180 | #define NDI_BROWN 10 /* Sienna */ |
174 | #define NDI_BROWN 10 /* Sienna */ |
181 | #define NDI_GOLD 11 |
175 | #define NDI_GOLD 11 |
182 | #define NDI_TAN 12 /* Khaki */ |
176 | #define NDI_TAN 12 /* Khaki */ |
183 | |
177 | |
184 | #define NDI_MAX_COLOR 12 /* Last value in */ |
178 | #define NDI_MAX_COLOR 12 /* Last value in */ |
185 | #define NDI_COLOR_MASK 0xff /* Gives lots of room for expansion - we are */ |
179 | #define NDI_COLOR_MASK 0x1f /* Gives lots of room for expansion - we are */ |
186 | /* using an int anyways, so we have the space */ |
180 | /* using an int anyways, so we have the space */ |
187 | /* to still do all the flags */ |
181 | /* to still do all the flags */ |
188 | |
182 | |
|
|
183 | #define NDI_REPLY 0x20 // is a direct reply to a user command |
|
|
184 | #define NDI_NOCREATE 0x40 // do not create a tba if one doesn't exist |
|
|
185 | #define NDI_CLIENT_MASK 0x7f // what the client is allowed to see |
189 | |
186 | |
190 | #define NDI_UNIQUE 0x100 /* Print this out immediately, don't buffer */ |
187 | #define NDI_UNIQUE 0x1000 /* Print this out immediately, don't buffer */ |
191 | #define NDI_ALL 0x200 /* Inform all players of this message */ |
188 | #define NDI_ALL 0x2000 /* Inform all players of this message */ |
|
|
189 | #define NDI_DEF 0x4000 // ignore colour for channel protocol |
192 | |
190 | |
193 | /* Flags for the item command */ |
191 | /* Flags for the item command */ |
194 | enum {a_none, a_readied, a_wielded, a_worn, a_active, a_applied}; |
192 | enum {a_none, a_readied, a_wielded, a_worn, a_active, a_applied}; |
195 | #define F_APPLIED 0x000F |
193 | #define F_APPLIED 0x000F |
196 | #define F_LOCATION 0x00F0 |
194 | #define F_LOCATION 0x00F0 |
… | |
… | |
263 | data16 (const void *ptr, int len) : len (len), ptr (ptr) { } |
261 | data16 (const void *ptr, int len) : len (len), ptr (ptr) { } |
264 | data16 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } |
262 | data16 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } |
265 | data16 (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { } |
263 | data16 (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { } |
266 | }; |
264 | }; |
267 | |
265 | |
|
|
266 | struct ber32 |
|
|
267 | { |
|
|
268 | enum { size = 5 }; // maximum length of an encoded ber32 |
|
|
269 | uint32 val; |
|
|
270 | |
|
|
271 | ber32 (uint32 val) : val (val) { } |
|
|
272 | |
|
|
273 | static int encoded_size (uint32 val) |
|
|
274 | { |
|
|
275 | if (val >= (1 << 7*4)) return 5; |
|
|
276 | if (val >= (1 << 7*3)) return 4; |
|
|
277 | if (val >= (1 << 7*2)) return 3; |
|
|
278 | if (val >= (1 << 7*1)) return 2; |
|
|
279 | return 1; |
|
|
280 | } |
|
|
281 | }; |
|
|
282 | |
268 | /* Contains the base information we use to make up a packet we want to send. */ |
283 | /* Contains the base information we use to make up a packet we want to send. */ |
269 | struct packet |
284 | struct packet |
270 | { |
285 | { |
271 | enum { bufsize = MAXSOCKBUF }; |
286 | enum { bufsize = MAXSOCKBUF }; |
272 | enum { hdrlen = 2 }; // keep this many bytes free at the front |
287 | enum { hdrlen = 2 }; // keep this many bytes free at the front |
… | |
… | |
274 | // strategy: only check on variable-length adds |
289 | // strategy: only check on variable-length adds |
275 | // and allow 256 bytes for any headers. |
290 | // and allow 256 bytes for any headers. |
276 | uint8 *cur; |
291 | uint8 *cur; |
277 | uint8 buf_ [hdrlen + bufsize + 256]; |
292 | uint8 buf_ [hdrlen + bufsize + 256]; |
278 | |
293 | |
279 | packet () { reset (); } |
294 | packet () |
|
|
295 | { |
|
|
296 | reset (); |
|
|
297 | } |
|
|
298 | |
|
|
299 | packet (const char *name); |
280 | |
300 | |
281 | uint8 operator [](unsigned int i) const { return buf_ [i + hdrlen]; } |
301 | uint8 operator [](unsigned int i) const { return buf_ [i + hdrlen]; } |
282 | uint8 &operator [](unsigned int i) { return buf_ [i + hdrlen]; } |
302 | uint8 &operator [](unsigned int i) { return buf_ [i + hdrlen]; } |
283 | |
303 | |
284 | uint8 *buf () { return buf_ + hdrlen; } |
304 | uint8 *buf () { return buf_ + hdrlen; } |
… | |
… | |
299 | packet &operator <<(sint16 v) { return *this << (uint16)v; } |
319 | packet &operator <<(sint16 v) { return *this << (uint16)v; } |
300 | packet &operator <<(sint32 v) { return *this << (uint32)v; } |
320 | packet &operator <<(sint32 v) { return *this << (uint32)v; } |
301 | packet &operator <<(sint64 v) { return *this << (uint64)v; } |
321 | packet &operator <<(sint64 v) { return *this << (uint64)v; } |
302 | |
322 | |
303 | // checked |
323 | // checked |
|
|
324 | packet &operator <<(const ber32 v); |
|
|
325 | |
304 | packet &operator <<(const data &v); |
326 | packet &operator <<(const data &v); |
305 | packet &operator <<(const data8 &v); |
327 | packet &operator <<(const data8 &v); |
306 | packet &operator <<(const data16 &v); |
328 | packet &operator <<(const data16 &v); |
307 | |
329 | |
308 | packet &operator <<(const char *v); |
330 | packet &operator <<(const char *v); |
309 | packet &operator <<(const shstr &sh) { return *this << data (&sh, sh.length ()); } |
331 | packet &operator <<(const shstr &sh) { return *this << data (&sh, sh.length ()); } |
|
|
332 | packet &operator <<(const std::string &s) { return *this << data (s.data (), s.size ()); } |
310 | |
333 | |
|
|
334 | void vprintf (const char *format, va_list ap); |
|
|
335 | |
311 | void printf (const char *format, ...); |
336 | void printf (const char *format, ...) |
|
|
337 | { |
|
|
338 | va_list ap; |
|
|
339 | va_start (ap, format); |
|
|
340 | vprintf (format, ap); |
|
|
341 | va_end (ap); |
|
|
342 | } |
312 | }; |
343 | }; |
313 | |
344 | |
314 | inline uint16 net_uint16 (uint8 *data) { return (data [0] << 8) | data [1]; } |
345 | inline uint16 net_uint16 (uint8 *data) { return (data [0] << 8) | data [1]; } |
315 | inline uint32 net_uint32 (uint8 *data) { return (net_uint16 (data) << 16) | net_uint16 (data + 2); } |
346 | inline uint32 net_uint32 (uint8 *data) { return (net_uint16 (data) << 16) | net_uint16 (data + 2); } |
316 | inline sint16 net_sint16 (uint8 *data) { return sint16 (net_uint16 (data)); } |
347 | inline sint16 net_sint16 (uint8 *data) { return sint16 (net_uint16 (data)); } |
317 | inline sint16 net_sint32 (uint8 *data) { return sint32 (net_uint32 (data)); } |
348 | inline sint16 net_sint32 (uint8 *data) { return sint32 (net_uint32 (data)); } |
318 | |
349 | |
319 | struct CS_Stats |
|
|
320 | { |
|
|
321 | int ibytes; /* ibytes, obytes are bytes in, out */ |
|
|
322 | int obytes; |
|
|
323 | short max_conn; /* Maximum connections received */ |
|
|
324 | time_t time_start; /* When we started logging this */ |
|
|
325 | }; |
|
|
326 | |
|
|
327 | extern CS_Stats cst_tot, cst_lst; |
|
|
328 | |
|
|
329 | #endif |
350 | #endif |
330 | |
351 | |