ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/client.h
(Generate patch)

Comparing deliantra/server/include/client.h (file contents):
Revision 1.62 by root, Mon Jul 23 21:02:50 2007 UTC vs.
Revision 1.83 by root, Fri Dec 26 10:44:17 2008 UTC

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
27#include <deque> 27#include <deque>
28#include <bitset> 28#include <bitset>
29#include <tr1/unordered_set> 29#include <tr1/unordered_set>
30 30
31#if HAVE_TCP_INFO
32# include <netinet/tcp.h>
33#else
34 struct tcp_info {
35 // dummy
36 int tcpi_state;
37 int tcpi_ca_state;
38 int tcpi_retransmits;
39 int tcpi_probes;
40 int tcpi_backoff;
41 int tcpi_options;
42 int tcpi_snd_wscale;
43 int tcpi_rcv_wscale;
44 int tcpi_rto;
45 int tcpi_ato;
46 int tcpi_snd_mss;
47 int tcpi_rcv_mss;
48 int tcpi_unacked;
49 int tcpi_sacked;
50 int tcpi_lost;
51 int tcpi_retrans;
52 int tcpi_fackets;
53 int tcpi_last_data_sent;
54 int tcpi_last_ack_sent;
55 int tcpi_last_data_recv;
56 int tcpi_last_ack_recv;
57 int tcpi_pmtu;
58 int tcpi_rcv_ssthresh;
59 int tcpi_rtt;
60 int tcpi_rttvar;
61 int tcpi_snd_ssthresh;
62 int tcpi_snd_cwnd;
63 int tcpi_advmss;
64 int tcpi_reordering;
65 };
66#endif
67
31// (possibly) max. number of objects "per page" in the ground container 68// (possibly) max. number of objects "per page" in the ground container
32#define FLOORBOX_PAGESIZE 50 69#define FLOORBOX_PAGESIZE 50
33 70
34struct MapCell 71struct MapCell
35{ 72{
36 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
37 int count; /* This is really darkness in the map1 command */ 74 int count; /* This is really darkness in the map1 command */
38 faceidx faces[MAP_LAYERS]; 75 faceidx faces[MAP_LAYERS];
39 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
40 unsigned char flags; 77 unsigned char flags;
41 uint8_t smooth[MAP_LAYERS]; 78 uint8_t smooth[MAP_LAYERS];
… …
85 PF_PLAYING = 0x02, // must be in playing state 122 PF_PLAYING = 0x02, // must be in playing state
86 PF_COMMAND0 = 0x04, // command starts at offset 0 123 PF_COMMAND0 = 0x04, // command starts at offset 0
87 PF_COMMAND6 = 0x08, // command starts at offset 6 124 PF_COMMAND6 = 0x08, // command starts at offset 6
88}; 125};
89 126
127// face type.s bit 0 means "has meta info prepended"
128enum {
129 FT_FACE = 0 * 2 + 0, // faces (images)
130 FT_MUSIC = 1 * 2 + 1, // background music
131 FT_SOUND = 2 * 2 + 1, // effects
132 FT_RSRC = 3 * 2 + 0, // generic data files
133 FT_NUM,
134};
135
90struct packet_type 136struct packet_type
91{ 137{
92 const char *name; 138 const char *name;
93 void *cb; 139 void *cb;
94 int flags; 140 int flags;
… …
98{ 144{
99 tstamp stamp; 145 tstamp stamp;
100 const packet_type *handler; 146 const packet_type *handler;
101 char *data; 147 char *data;
102 int datalen; 148 int datalen;
103
104 ~command ()
105 {
106 sfree<char> (data, datalen + 1);
107 }
108}; 149};
109 150
110/* 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. */
111#define MAX_PASSWORD_FAILURES 5 152#define MAX_PASSWORD_FAILURES 5
112 153
… …
116 int ACC (RW, fd); 157 int ACC (RW, fd);
117 unsigned int inbuf_len; // number of bytes valid in inbuf 158 unsigned int inbuf_len; // number of bytes valid in inbuf
118 statsinfo stats; 159 statsinfo stats;
119 object_vector_index ACC (RO, active); 160 object_vector_index ACC (RO, active);
120 player_ptr ACC (RO, pl); 161 player_ptr ACC (RO, pl);
121
122 /* The following is the setup for a ring buffer for storing output
123 * data that the OS can't handle right away.
124 */
125 struct
126 {
127 char data[SOCKETBUFSIZE];
128 int start;
129 int len;
130 } outputbuffer;
131 162
132 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) */
133 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 */
134 165
135 sint8 ACC (RW, last_level); /* Last level we sent to client */ 166 sint8 ACC (RW, last_level); /* Last level we sent to client */
… …
165 uint8_t ACC (RW, fxix); // client implements fx and ix (face|image extended) commands 196 uint8_t ACC (RW, fxix); // client implements fx and ix (face|image extended) commands
166 bool ACC (RW, update_look); /* If true, we need to send the look window */ 197 bool ACC (RW, update_look); /* If true, we need to send the look window */
167 bool ACC (RW, has_readable_type); /* If true client accept additional text information */ 198 bool ACC (RW, has_readable_type); /* If true client accept additional text information */
168 /* used to arrange text in books, scrolls, or scripted dialogs */ 199 /* used to arrange text in books, scrolls, or scripted dialogs */
169 bool ACC (RW, monitor_spells); /* Client wishes to be informed when their spell list changes */ 200 bool ACC (RW, monitor_spells); /* Client wishes to be informed when their spell list changes */
170 bool ACC (RW, ext_mapinfos); /* If true client accepts additional info on maps */
171 /* Below are flags for extedend infos to pass to client
172 * with S->C mapextended command */
173 bool ACC (RW, EMI_smooth); /* Send smooth in extendmapinfos */
174 bool ACC (RW, smoothing); // trt-style smoothing 201 bool ACC (RW, smoothing); // trt-style smoothing
175 bool ACC (RW, can_msg); // trt-style text messages 202 bool ACC (RW, can_msg); // trt-style text messages
176 203
177 bool ACC (RW, force_newmap); // force a newmap before next map update 204 bool ACC (RW, force_newmap); // force a newmap before next map update
178 uint32 ACC (RW, supported_readables); /* each bit is a readable supported by client */ 205 uint32 ACC (RW, supported_readables); /* each bit is a readable supported by client */
… …
181 uint16 ACC (RW, mss); // likely tcp maximum segment size 208 uint16 ACC (RW, mss); // likely tcp maximum segment size
182 uint8 ACC (RW, mapmode); /* Type of map commands the client wants. */ 209 uint8 ACC (RW, mapmode); /* Type of map commands the client wants. */
183 uint8 ACC (RW, mapx), ACC (RW, mapy); /* How large a map the client wants */ 210 uint8 ACC (RW, mapx), ACC (RW, mapy); /* How large a map the client wants */
184 uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */ 211 uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */
185 212
186 maptile *ACC (RW, current_map); // CF+ last/current player map 213 maptile_ptr ACC (RW, current_map); // CF+ last/current player map
187 region *ACC (RW, current_region); // CF+ last/current player region 214 region_ptr ACC (RW, current_region); // CF+ last/current player region
188 int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position 215 int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position
189 shstr ACC (RW, version); // CF+ client name/version 216 shstr ACC (RW, version); // CF+ client name/version
190 uint8 ACC (RW, faceset); // CF+ selected faceset 217 uint8 ACC (RW, faceset); // CF+ selected faceset
191 218
192 tstamp ACC (RW, last_send); // last data send on socket. 219 tstamp ACC (RW, last_send); // last data send on socket.
193
194 int ACC (RW, rtt), ACC (RW, rttvar); /* round-trip time and -variance, if known */
195 int ACC (RW, outq); // current socket outq length, or 0 if indeterminable
196 220
197 int ACC (RW, rate_avail); // current rate balance 221 int ACC (RW, rate_avail); // current rate balance
198 int ACC (RW, max_rate); // max. # of bytes to send per tick 222 int ACC (RW, max_rate); // max. # of bytes to send per tick
199 faceidx ACC (RW, scrub_idx); // which face to send next 223 faceidx ACC (RW, scrub_idx); // which face to send next
200 int ACC (RW, bg_scrub); // how many ticks till the next background face send 224 int ACC (RW, bg_scrub); // how many ticks till the next background face send
225
226 struct tcp_info tcpi;
227 tstamp next_rate_adjust;
228
229 unordered_vector<char *> mapinfo_queue;
230 void mapinfo_queue_clear ();
231 void mapinfo_queue_run ();
232 bool mapinfo_try (char *buf);
201 233
202 struct ixsend { 234 struct ixsend {
203 int16_t pri; // unused 235 int16_t pri; // unused
204 faceidx idx; 236 faceidx idx;
205 uint32_t ofs; // if != 0, need to send remaining bytes of partial_face 237 uint32_t ofs; // if != 0, need to send remaining bytes of partial_face
… …
210 MTH void flush_fx (); // send fx if required 242 MTH void flush_fx (); // send fx if required
211 243
212 void do_destroy (); 244 void do_destroy ();
213 void gather_callbacks (AV *&callbacks, event_type event) const; 245 void gather_callbacks (AV *&callbacks, event_type event) const;
214 246
215 iow socket_ev; void socket_cb (iow &w, int got); 247 iow socket_ev; void socket_cb (iow &w, int revents);
216 iw cmd_ev; void cmd_cb (iw &w);
217 248
218 std::deque< command, slice_allocator<command> > cmd_queue; 249 std::deque< command, slice_allocator<command> > cmd_queue;
219 250
220 // large structures at the end please 251 // large structures at the end please
221 struct Map lastmap; 252 struct Map lastmap;
222 std::bitset<MAXANIMNUM> anims_sent; 253 std::bitset<MAXANIMNUM> anims_sent;
223 std::bitset<MAX_FACES> faces_sent; 254 std::bitset<MAX_FACES> faces_sent;
255 std::bitset<FT_NUM> fx_want;
224 256
225 // if we get an incomplete packet, this is used to hold the data. 257 // if we get an incomplete packet, this is used to hold the data.
226 // we add 2 byte for the header, one for the trailing 0 byte 258 // we add 2 byte for the header, one for the trailing 0 byte
227 uint8 inbuf[MAXSOCKBUF + 2 + 1]; 259 uint8 inbuf[MAXSOCKBUF + 2 + 1];
228 260
… …
235 char msg[MSG_BUF_SIZE]; 267 char msg[MSG_BUF_SIZE];
236 } msgbuf[MSG_BUF_COUNT]; 268 } msgbuf[MSG_BUF_COUNT];
237 269
238 MTH bool msg_suppressed (const char *msg); 270 MTH bool msg_suppressed (const char *msg);
239 271
272 /* The following is the setup for a ring buffer for storing output
273 * data that the OS can't handle right away.
274 * TODO: this member is enourmously large - optimise?
275 */
276 struct
277 {
278 char data[SOCKETBUFSIZE];
279 int start;
280 int len;
281 } outputbuffer;
282
240 bool may_execute (const packet_type *pkt) const; 283 bool may_execute (const packet_type *pkt) const;
241 void execute (const packet_type *pkt, char *data, int datalen); 284 void execute (const packet_type *pkt, char *data, int datalen);
242 285
243 void queue_command (packet_type *handler, char *data, int datalen); 286 void queue_command (packet_type *handler, char *data, int datalen);
244 MTH bool handle_command (); 287 MTH bool handle_command ();
… …
261 void send_packet_printf (const char *format, ...); 304 void send_packet_printf (const char *format, ...);
262 void send_packet (packet &sl); 305 void send_packet (packet &sl);
263 306
264 void send_drawinfo (const char *msg, int flags = NDI_BLACK); 307 void send_drawinfo (const char *msg, int flags = NDI_BLACK);
265 308
266 MTH bool must_send_face (faceidx facenum)
267 {
268 if (faces_sent[facenum])
269 return false;
270
271 faces_sent[facenum] = true;
272 return true;
273 }
274
275 MTH void send_face (faceidx facenum); 309 MTH void send_face (faceidx facenum, int pri = 0);
276 MTH void send_image (faceidx facenum); 310 MTH void send_image (faceidx facenum);
277 MTH void send_faces (object *ob); 311 MTH void send_faces (object *ob);
278 MTH void send_animation (short anim_num); 312 MTH void send_animation (short anim_num);
279 void send_msg (int color, const char *type, const char *msg); 313 void send_msg (int color, const char *type, const char *msg);
280 314
315 MTH void play_sound (faceidx sound, int dx = 0, int dy = 0);
281 // called when something under the player changes 316 // called when something under the player changes
282 MTH void floorbox_update () { update_look = 1; } 317 MTH void floorbox_update () { update_look = 1; }
283 // called when the player has been moved 318 // called when the player has been moved
284 MTH void floorbox_reset () { look_position = 0; floorbox_update (); } 319 MTH void floorbox_reset () { look_position = 0; floorbox_update (); }
285 320
286 MTH void tick (); // called every server tick to do housekeeping etc. 321 MTH void tick (); // called every server tick to do housekeeping etc.
287 322
288 MTH static client *create (int fd, const char *peername); 323 MTH static client *create (int fd, const char *peername);
324 MTH static void clock ();
325 MTH static void flush_sockets ();
289 326
290protected: 327protected:
291 client (int fd, const char *from_ip); 328 client (int fd, const char *from_ip);
292 ~client (); 329 ~client ();
293}; 330};
331
332#if FOR_PERL
333 ACC (RW, tcpi.tcpi_state);
334 ACC (RW, tcpi.tcpi_ca_state);
335 ACC (RW, tcpi.tcpi_retransmits);
336 ACC (RW, tcpi.tcpi_probes);
337 ACC (RW, tcpi.tcpi_backoff);
338 ACC (RW, tcpi.tcpi_options);
339 ACC (RO, tcpi.tcpi_snd_wscale);
340 ACC (RO, tcpi.tcpi_rcv_wscale);
341 ACC (RW, tcpi.tcpi_rto);
342 ACC (RW, tcpi.tcpi_ato);
343 ACC (RW, tcpi.tcpi_snd_mss);
344 ACC (RW, tcpi.tcpi_rcv_mss);
345 ACC (RW, tcpi.tcpi_unacked);
346 ACC (RW, tcpi.tcpi_sacked);
347 ACC (RW, tcpi.tcpi_lost);
348 ACC (RW, tcpi.tcpi_retrans);
349 ACC (RW, tcpi.tcpi_fackets);
350 ACC (RW, tcpi.tcpi_last_data_sent);
351 ACC (RW, tcpi.tcpi_last_ack_sent);
352 ACC (RW, tcpi.tcpi_last_data_recv);
353 ACC (RW, tcpi.tcpi_last_ack_recv);
354 ACC (RW, tcpi.tcpi_pmtu);
355 ACC (RW, tcpi.tcpi_rcv_ssthresh);
356 ACC (RW, tcpi.tcpi_rtt);
357 ACC (RW, tcpi.tcpi_rttvar);
358 ACC (RW, tcpi.tcpi_snd_ssthresh);
359 ACC (RW, tcpi.tcpi_snd_cwnd);
360 ACC (RW, tcpi.tcpi_advmss);
361 ACC (RW, tcpi.tcpi_reordering);
362#endif
294 363
295#define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\ 364#define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\
296 ( ((__type)>0) &&\ 365 ( ((__type)>0) &&\
297 ((__sockPtr)->has_readable_type) && \ 366 ((__sockPtr)->has_readable_type) && \
298 ((__sockPtr)->supported_readables & (1<<(__type))) ) 367 ((__sockPtr)->supported_readables & (1<<(__type))) )
299 368
300/* Constants in the form EMI_ is for extended map infos.
301 * Even if the client select the additionnal infos it wants
302 * on the map, there may exist cases where this whole info
303 * is not given in one buch but in separate bunches. This
304 * is done performance reasons (imagine some info related to
305 * a visible object and another info related to a 4 square
306 * width and height area). At the begin of an extended info packet
307 * is a bit field. A bit is activated for each extended info
308 * present in the data
309 */
310
311/* Meanings:
312 * EMI_NOREDRAW Take extended infos into account but don't redraw,
313 * some additionnal datas will follow in a new packet
314 * EMI_SMOOTH Datas about smoothing
315 */
316#define EMI_NOREDRAW 0x01
317#define EMI_SMOOTH 0x02
318
319/* this last one says the bitfield continue un next byte
320 * There may be several on contiguous bytes. So there is 7
321 * actual bits used per byte, and the number of bytes
322 * is not fixed in protocol
323 */
324#define EMI_HASMOREBITS 0x80
325
326#define FACE_TYPES 1 369#define FACE_TYPES 1
327#define PNG_FACE_INDEX 0 370#define PNG_FACE_INDEX 0
328 371
329#define VERSION_CS 1023 /* version >= 1023 understand setup cmd */ 372#define VERSION_CS 1023 /* version >= 1023 understand setup cmd */
330#define VERSION_SC 1026 373#define VERSION_SC 1026
331//#define VERSION_SC 1027 // requestinfo image_info and image_sums, makes extending faces on the fly impossible 374//#define VERSION_SC 1027 // requestinfo image_info and image_sums, makes extending faces on the fly impossible
332#define VERSION_INFO "Crossfire TRT Server" 375#define VERSION_INFO "Deliantra Server"
333 376
334typedef object_vector<client, &client::active> sockvec; 377typedef object_vector<client, &client::active> sockvec;
335 378
336extern sockvec clients; 379extern sockvec clients;
337 380
338#define for_all_clients(var) \ 381#define for_all_clients(var) \
339 for (int _i = 0; _i < clients.size (); ++_i) \ 382 for (int _i = 0; _i < clients.size (); ++_i) \
340 statementvar (client *, var, clients [_i]) 383 statementvar (client *, var, clients [_i])
341 384
385// returns true when the message needs special (read: perl) treatment
386static inline bool
387msg_is_special (const char *msg, bool nl_special = true)
388{
389 return msg [strcspn (msg, nl_special ? "<&\n" : "<&")];
390}
391
342#endif 392#endif
343 393

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines