1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra 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 3 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, |
… | |
… | |
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, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | #ifndef CLIENT_H |
24 | #ifndef CLIENT_H |
25 | #define CLIENT_H |
25 | #define CLIENT_H |
26 | |
26 | |
… | |
… | |
29 | #include <tr1/unordered_set> |
29 | #include <tr1/unordered_set> |
30 | |
30 | |
31 | #if HAVE_TCP_INFO |
31 | #if HAVE_TCP_INFO |
32 | # include <netinet/tcp.h> |
32 | # include <netinet/tcp.h> |
33 | #else |
33 | #else |
34 | struct tcpi_info { |
34 | struct tcp_info { |
35 | // dummy |
35 | // dummy |
36 | char tcpi_state; |
36 | int tcpi_state; |
37 | char tcpi_ca_state; |
37 | int tcpi_ca_state; |
38 | char tcpi_retransmits; |
38 | int tcpi_retransmits; |
39 | char tcpi_probes; |
39 | int tcpi_probes; |
40 | char tcpi_backoff; |
40 | int tcpi_backoff; |
41 | char tcpi_options; |
41 | int tcpi_options; |
42 | char tcpi_snd_wscale; |
42 | int tcpi_snd_wscale; |
43 | char tcpi_rcv_wscale; |
43 | int tcpi_rcv_wscale; |
44 | char tcpi_rto; |
44 | int tcpi_rto; |
45 | char tcpi_ato; |
45 | int tcpi_ato; |
46 | char tcpi_snd_mss; |
46 | int tcpi_snd_mss; |
47 | char tcpi_rcv_mss; |
47 | int tcpi_rcv_mss; |
48 | char tcpi_unacked; |
48 | int tcpi_unacked; |
49 | char tcpi_sacked; |
49 | int tcpi_sacked; |
50 | char tcpi_lost; |
50 | int tcpi_lost; |
51 | char tcpi_retrans; |
51 | int tcpi_retrans; |
52 | char tcpi_fackets; |
52 | int tcpi_fackets; |
53 | char tcpi_last_data_sent; |
53 | int tcpi_last_data_sent; |
54 | char tcpi_last_ack_sent; |
54 | int tcpi_last_ack_sent; |
55 | char tcpi_last_data_recv; |
55 | int tcpi_last_data_recv; |
56 | char tcpi_last_ack_recv; |
56 | int tcpi_last_ack_recv; |
57 | char tcpi_pmtu; |
57 | int tcpi_pmtu; |
58 | char tcpi_rcv_ssthresh; |
58 | int tcpi_rcv_ssthresh; |
59 | char tcpi_rtt; |
59 | int tcpi_rtt; |
60 | char tcpi_rttvar; |
60 | int tcpi_rttvar; |
61 | char tcpi_snd_ssthresh; |
61 | int tcpi_snd_ssthresh; |
62 | char tcpi_snd_cwnd; |
62 | int tcpi_snd_cwnd; |
63 | char tcpi_advmss; |
63 | int tcpi_advmss; |
64 | char tcpi_reordering; |
64 | int tcpi_reordering; |
65 | }; |
65 | }; |
66 | #endif |
66 | #endif |
67 | |
67 | |
68 | // (possibly) max. number of objects "per page" in the ground container |
68 | // (possibly) max. number of objects "per page" in the ground container |
69 | #define FLOORBOX_PAGESIZE 50 |
69 | #define FLOORBOX_PAGESIZE 50 |
70 | |
70 | |
71 | struct MapCell |
71 | struct MapCell |
72 | { |
72 | { |
73 | tag_t player; // this is, unfortunately, very wasteful of memory space, but pretty bandwidth-efficient |
73 | tag_t player; // this is, unfortunately, very wasteful of memory space, but pretty bandwidth-efficient |
74 | int count; /* This is really darkness in the map1 command */ |
74 | int count; /* This is really darkness in the map1 command */ |
75 | faceidx faces[MAP_LAYERS]; |
75 | faceidx faces[MAP_LAYERS]; |
76 | unsigned char stat_hp; // health of something in this space, or 0 |
76 | unsigned char stat_hp; // health of something in this space, or 0 |
77 | unsigned char flags; |
77 | unsigned char flags; |
78 | uint8_t smooth[MAP_LAYERS]; |
78 | uint8_t smooth[MAP_LAYERS]; |
… | |
… | |
144 | { |
144 | { |
145 | tstamp stamp; |
145 | tstamp stamp; |
146 | const packet_type *handler; |
146 | const packet_type *handler; |
147 | char *data; |
147 | char *data; |
148 | int datalen; |
148 | int datalen; |
149 | |
|
|
150 | ~command () |
|
|
151 | { |
|
|
152 | sfree<char> (data, datalen + 1); |
|
|
153 | } |
|
|
154 | }; |
149 | }; |
155 | |
150 | |
156 | /* how many times we are allowed to give the wrong password before being kicked. */ |
151 | /* how many times we are allowed to give the wrong password before being kicked. */ |
157 | #define MAX_PASSWORD_FAILURES 5 |
152 | #define MAX_PASSWORD_FAILURES 5 |
158 | |
153 | |
… | |
… | |
162 | int ACC (RW, fd); |
157 | int ACC (RW, fd); |
163 | unsigned int inbuf_len; // number of bytes valid in inbuf |
158 | unsigned int inbuf_len; // number of bytes valid in inbuf |
164 | statsinfo stats; |
159 | statsinfo stats; |
165 | object_vector_index ACC (RO, active); |
160 | object_vector_index ACC (RO, active); |
166 | player_ptr ACC (RO, pl); |
161 | player_ptr ACC (RO, pl); |
167 | |
|
|
168 | /* The following is the setup for a ring buffer for storing output |
|
|
169 | * data that the OS can't handle right away. |
|
|
170 | */ |
|
|
171 | struct |
|
|
172 | { |
|
|
173 | char data[SOCKETBUFSIZE]; |
|
|
174 | int start; |
|
|
175 | int len; |
|
|
176 | } outputbuffer; |
|
|
177 | |
162 | |
178 | char *ACC (RW, host); /* Which host it is connected from (ip address) */ |
163 | char *ACC (RW, host); /* Which host it is connected from (ip address) */ |
179 | uint8 ACC (RW, state); /* Input state of the player (name, password, etc */ |
164 | uint8 ACC (RW, state); /* Input state of the player (name, password, etc */ |
180 | |
165 | |
181 | sint8 ACC (RW, last_level); /* Last level we sent to client */ |
166 | sint8 ACC (RW, last_level); /* Last level we sent to client */ |
… | |
… | |
227 | uint16 ACC (RW, mss); // likely tcp maximum segment size |
212 | uint16 ACC (RW, mss); // likely tcp maximum segment size |
228 | uint8 ACC (RW, mapmode); /* Type of map commands the client wants. */ |
213 | uint8 ACC (RW, mapmode); /* Type of map commands the client wants. */ |
229 | uint8 ACC (RW, mapx), ACC (RW, mapy); /* How large a map the client wants */ |
214 | uint8 ACC (RW, mapx), ACC (RW, mapy); /* How large a map the client wants */ |
230 | uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */ |
215 | uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */ |
231 | |
216 | |
232 | maptile *ACC (RW, current_map); // CF+ last/current player map |
217 | maptile_ptr ACC (RW, current_map); // CF+ last/current player map |
233 | region *ACC (RW, current_region); // CF+ last/current player region |
218 | region_ptr ACC (RW, current_region); // CF+ last/current player region |
234 | int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position |
219 | int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position |
235 | shstr ACC (RW, version); // CF+ client name/version |
220 | shstr ACC (RW, version); // CF+ client name/version |
236 | uint8 ACC (RW, faceset); // CF+ selected faceset |
221 | uint8 ACC (RW, faceset); // CF+ selected faceset |
237 | |
222 | |
238 | tstamp ACC (RW, last_send); // last data send on socket. |
223 | tstamp ACC (RW, last_send); // last data send on socket. |
… | |
… | |
261 | MTH void flush_fx (); // send fx if required |
246 | MTH void flush_fx (); // send fx if required |
262 | |
247 | |
263 | void do_destroy (); |
248 | void do_destroy (); |
264 | void gather_callbacks (AV *&callbacks, event_type event) const; |
249 | void gather_callbacks (AV *&callbacks, event_type event) const; |
265 | |
250 | |
266 | iow socket_ev; void socket_cb (iow &w, int got); |
251 | iow socket_ev; void socket_cb (iow &w, int revents); |
267 | iw cmd_ev; void cmd_cb (iw &w); |
|
|
268 | |
252 | |
269 | std::deque< command, slice_allocator<command> > cmd_queue; |
253 | std::deque< command, slice_allocator<command> > cmd_queue; |
270 | |
254 | |
271 | // large structures at the end please |
255 | // large structures at the end please |
272 | struct Map lastmap; |
256 | struct Map lastmap; |
… | |
… | |
286 | int count; |
270 | int count; |
287 | char msg[MSG_BUF_SIZE]; |
271 | char msg[MSG_BUF_SIZE]; |
288 | } msgbuf[MSG_BUF_COUNT]; |
272 | } msgbuf[MSG_BUF_COUNT]; |
289 | |
273 | |
290 | MTH bool msg_suppressed (const char *msg); |
274 | MTH bool msg_suppressed (const char *msg); |
|
|
275 | |
|
|
276 | /* The following is the setup for a ring buffer for storing output |
|
|
277 | * data that the OS can't handle right away. |
|
|
278 | * TODO: this member is enourmously large - optimise? |
|
|
279 | */ |
|
|
280 | struct |
|
|
281 | { |
|
|
282 | char data[SOCKETBUFSIZE]; |
|
|
283 | int start; |
|
|
284 | int len; |
|
|
285 | } outputbuffer; |
291 | |
286 | |
292 | bool may_execute (const packet_type *pkt) const; |
287 | bool may_execute (const packet_type *pkt) const; |
293 | void execute (const packet_type *pkt, char *data, int datalen); |
288 | void execute (const packet_type *pkt, char *data, int datalen); |
294 | |
289 | |
295 | void queue_command (packet_type *handler, char *data, int datalen); |
290 | void queue_command (packet_type *handler, char *data, int datalen); |
… | |
… | |
405 | #define PNG_FACE_INDEX 0 |
400 | #define PNG_FACE_INDEX 0 |
406 | |
401 | |
407 | #define VERSION_CS 1023 /* version >= 1023 understand setup cmd */ |
402 | #define VERSION_CS 1023 /* version >= 1023 understand setup cmd */ |
408 | #define VERSION_SC 1026 |
403 | #define VERSION_SC 1026 |
409 | //#define VERSION_SC 1027 // requestinfo image_info and image_sums, makes extending faces on the fly impossible |
404 | //#define VERSION_SC 1027 // requestinfo image_info and image_sums, makes extending faces on the fly impossible |
410 | #define VERSION_INFO "Crossfire TRT Server" |
405 | #define VERSION_INFO "Deliantra Server" |
411 | |
406 | |
412 | typedef object_vector<client, &client::active> sockvec; |
407 | typedef object_vector<client, &client::active> sockvec; |
413 | |
408 | |
414 | extern sockvec clients; |
409 | extern sockvec clients; |
415 | |
410 | |
416 | #define for_all_clients(var) \ |
411 | #define for_all_clients(var) \ |
417 | for (int _i = 0; _i < clients.size (); ++_i) \ |
412 | for (int _i = 0; _i < clients.size (); ++_i) \ |
418 | statementvar (client *, var, clients [_i]) |
413 | statementvar (client *, var, clients [_i]) |
419 | |
414 | |
|
|
415 | // returns true when the message needs special (read: perl) treatment |
|
|
416 | static inline bool |
|
|
417 | msg_is_special (const char *msg, bool nl_special = true) |
|
|
418 | { |
|
|
419 | return msg [strcspn (msg, nl_special ? "<&\n" : "<&")]; |
|
|
420 | } |
|
|
421 | |
420 | #endif |
422 | #endif |
421 | |
423 | |