ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/client.h
Revision: 1.58
Committed: Sun Jul 1 04:08:14 2007 UTC (16 years, 10 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.57: +6 -3 lines
Log Message:
- support priority as second argument of askface
- send images of same priority in fifo order,
  but higher priorities first.

File Contents

# Content
1 /*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 *
8 * Crossfire TRT is free software; you can redistribute it and/or modify it
9 * under the terms of the GNU General Public License as published by the Free
10 * Software Foundation; either version 2 of the License, or (at your option)
11 * any later version.
12 *
13 * This program is distributed in the hope that it will be useful, but
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * for more details.
17 *
18 * You should have received a copy of the GNU General Public License along
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 *
22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */
24
25 #ifndef CLIENT_H
26 #define CLIENT_H
27
28 #include <deque>
29 #include <bitset>
30 #include <tr1/unordered_set>
31
32 // (possibly) max. number of objects "per page" in the ground container
33 #define FLOORBOX_PAGESIZE 50
34
35 struct MapCell
36 {
37 tag_t player; // this is, unfortunately, very wasteful of memory space, but pretty bandwidth-efficient
38 int count; /* This is really darkness in the map1 command */
39 faceidx faces[MAP_LAYERS];
40 unsigned char stat_hp; // health of something in this space, or 0
41 unsigned char flags;
42 uint8_t smooth[MAP_LAYERS];
43 };
44
45 #define MAX_CLIENT_X MAP_CLIENT_X
46 #define MAX_CLIENT_Y MAP_CLIENT_Y
47
48 struct Map
49 {
50 struct MapCell cells[MAX_CLIENT_X][MAX_CLIENT_Y];
51 };
52
53 /* True max is 16383 given current map compaction method */
54 #define MAXANIMNUM 10000
55
56 struct statsinfo
57 {
58 char *range, *title;
59 };
60
61 /* This contains basic information on the socket structure. status is its
62 * current state. we set up our on buffers for sending/receiving, so we can
63 * handle some higher level functions. fd is the actual file descriptor we
64 * are using.
65 */
66
67 /* Only one map mode can actually be used, so lets make it a switch
68 * instead of having a bunch of different fields that needed to
69 * get toggled.
70 */
71 enum { Map0Cmd = 0, Map1Cmd = 1, Map1aCmd = 2 };
72
73 // states the socket can be in
74 enum {
75 ST_DEAD, // socket is dead
76 ST_SETUP, // initial handshake / setup / login
77 ST_PLAYING, // logged in an playing
78 ST_CUSTOM, // waiting for custom reply
79
80 ST_GET_PARTY_PASSWORD,
81 };
82
83 // a handler for a specific type of packet
84 enum {
85 PF_PLAYER = 0x01, // must have valid player / will by synchronised
86 PF_PLAYING = 0x02, // must be in playing state
87 PF_COMMAND0 = 0x04, // command starts at offset 0
88 PF_COMMAND6 = 0x08, // command starts at offset 6
89 };
90
91 struct packet_type
92 {
93 const char *name;
94 void *cb;
95 int flags;
96 };
97
98 struct command
99 {
100 tstamp stamp;
101 const packet_type *handler;
102 char *data;
103 int datalen;
104
105 ~command ()
106 {
107 sfree<char> (data, datalen + 1);
108 }
109 };
110
111 /* how many times we are allowed to give the wrong password before being kicked. */
112 #define MAX_PASSWORD_FAILURES 5
113
114 INTERFACE_CLASS (client) // should become player when newsocket is a baseclass of player
115 struct client : zero_initialised, attachable
116 {
117 int ACC (RW, fd);
118 unsigned int inbuf_len; // number of bytes valid in inbuf
119 statsinfo stats;
120 object_vector_index ACC (RO, active);
121 player_ptr ACC (RO, pl);
122
123 /* The following is the setup for a ring buffer for storing output
124 * data that the OS can't handle right away.
125 */
126 struct
127 {
128 char data[SOCKETBUFSIZE];
129 int start;
130 int len;
131 } outputbuffer;
132
133 char *ACC (RW, host); /* Which host it is connected from (ip address) */
134 uint8 ACC (RW, state); /* Input state of the player (name, password, etc */
135
136 sint8 ACC (RW, last_level); /* Last level we sent to client */
137 uint16 ACC (RW, last_flags); /* fire/run on flags for last tick */
138 float ACC (RW, last_weapon_sp); /* if diff than weapon_sp, update client */
139 sint32 ACC (RW, last_weight); /* Last weight as sent to client; -1 means do not send weight */
140 sint32 ACC (RW, last_weight_limit); /* Last weight limit transmitted to client */
141 uint32 ACC (RW, last_path_attuned); /* Last spell attunment sent to client */
142 uint32 ACC (RW, last_path_repelled); /* Last spell repelled sent to client */
143 uint32 ACC (RW, last_path_denied); /* Last spell denied sent to client */
144 living ACC (RO, last_stats); /* Last stats as sent to client */
145 float ACC (RW, last_speed); /* Last speed as sent to client */
146 sint16 ACC (RW, last_resist[NROFATTACKS]);/* last resist values sent to client */
147 sint64 ACC (RW, last_skill_exp[NUM_SKILLS]);/* shadow register. if != exp. obj update client */
148
149 bool ACC (RW, force_face0); // client workaround for buggy checksum calculation in gcfclient
150 bool ACC (RW, force_bad_checksum); // client workaround for buggy checksum calculation in gcfclient
151 bool ACC (RW, force_image_newmap); // client workaround for client not redrawing map on image upload
152 bool ACC (RW, enable_bg_scrub); // client workaround, gcfclient becomes unusable if you send it images
153
154 bool ACC (RW, afk); /* player is afk */
155 bool ACC (RW, facecache); /* If true, client is caching images */
156 bool ACC (RW, sent_scroll);
157 bool ACC (RW, sound); /* does the client want sound */
158 bool ACC (RW, newmapcmd); /* Send newmap command when entering new map SMACFIGGEN */
159 bool ACC (RW, plugincmd); // extend the protocol through a plug-in */
160 bool ACC (RW, mapinfocmd); // return map info and send map change info
161 bool ACC (RW, extcmd); // call into extensions/plugins
162 bool ACC (RW, extmap); // extend map comamnd with extra data
163 bool ACC (RW, buggy_mapscroll); // client crashes on large mapscrolls
164 bool ACC (RW, darkness); /* True if client wants darkness information */
165 bool ACC (RW, image2); /* Client wants image2/face2 commands */
166 uint8_t ACC (RW, fxix); // client implements fx and ix (face|image extended) commands
167 bool ACC (RW, update_look); /* If true, we need to send the look window */
168 bool ACC (RW, has_readable_type); /* If true client accept additional text information */
169 /* used to arrange text in books, scrolls, or scripted dialogs */
170 bool ACC (RW, monitor_spells); /* Client wishes to be informed when their spell list changes */
171 bool ACC (RW, ext_mapinfos); /* If true client accepts additional info on maps */
172 /* Below are flags for extedend infos to pass to client
173 * with S->C mapextended command */
174 bool ACC (RW, EMI_smooth); /* Send smooth in extendmapinfos */
175 bool ACC (RW, smoothing); // trt-style smoothing
176 bool ACC (RW, can_msg); // trt-style text messages
177
178 bool ACC (RW, force_newmap); // force a newmap before next map update
179 uint32 ACC (RW, supported_readables); /* each bit is a readable supported by client */
180 uint32 ACC (RW, cs_version), ACC (RW, sc_version); /* versions of the client */
181 uint16 ACC (RW, look_position); /* start of drawing of look window */
182 uint16 ACC (RW, mss); // likely tcp maximum segment size
183 uint8 ACC (RW, mapmode); /* Type of map commands the client wants. */
184 uint8 ACC (RW, mapx), ACC (RW, mapy); /* How large a map the client wants */
185 uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */
186
187 maptile *ACC (RW, current_map); // CF+ last/current player map
188 region *ACC (RW, current_region); // CF+ last/current player region
189 int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position
190 shstr ACC (RW, version); // CF+ client name/version
191 uint8 ACC (RW, faceset); // CF+ selected faceset
192
193 tstamp ACC (RW, last_send); // last data send on socket.
194
195 int ACC (RW, rtt), ACC (RW, rttvar); /* round-trip time and -variance, if known */
196
197 int ACC (RW, rate_avail); // current rate balance
198 int ACC (RW, max_rate); // max. # of bytes to send per tick
199 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
201
202 struct ixsend {
203 int16_t pri; // unused
204 faceidx idx;
205 uint32_t ofs; // if != 0, need to send remaining bytes of partial_face
206 };
207 std::vector<ixsend, slice_allocator<ixsend> > ixface; // which faces to send to the client using ix
208
209 std::vector<faceidx, slice_allocator<faceidx> > fxface; // which faces to send using fx
210 MTH void flush_fx (); // send fx if required
211
212 void do_destroy ();
213 void gather_callbacks (AV *&callbacks, event_type event) const;
214
215 iow socket_ev; void socket_cb (iow &w, int got);
216 iw cmd_ev; void cmd_cb (iw &w);
217
218 std::deque< command, slice_allocator<command> > cmd_queue;
219
220 // large structures at the end please
221 struct Map lastmap;
222 std::bitset<MAXANIMNUM> anims_sent;
223 std::bitset<MAX_FACES> faces_sent;
224
225 // 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
227 uint8 inbuf[MAXSOCKBUF + 2 + 1];
228
229 enum { MSG_BUF_SIZE = 80, MSG_BUF_COUNT = 10 };
230 struct msg_buf
231 {
232 tick_t expire;
233 int len;
234 int count;
235 char msg[MSG_BUF_SIZE];
236 } msgbuf[MSG_BUF_COUNT];
237
238 MTH bool msg_suppressed (const char *msg);
239
240 bool may_execute (const packet_type *pkt) const;
241 void execute (const packet_type *pkt, char *data, int datalen);
242
243 void queue_command (packet_type *handler, char *data, int datalen);
244 MTH bool handle_command ();
245 // resets movement state
246 MTH void reset_state ();
247 // resets variable data used to send stat diffs
248 MTH void reset_stats ();
249
250 MTH bool handle_packet ();
251 int next_packet (); // returns length of packet or 0
252 void skip_packet (int len); // we have processed the packet, skip it
253
254 MTH void flush ();
255 MTH void write_outputbuffer ();
256 MTH int outputbuffer_len () const { return outputbuffer.len; }
257 void send (void *buf_, int len);
258
259 void send_packet (const char *buf);
260 void send_packet (const char *buf, int len);
261 void send_packet_printf (const char *format, ...);
262 void send_packet (packet &sl);
263
264 void send_drawinfo (const char *msg, int flags = NDI_BLACK);
265 MTH void send_face (faceidx facenum);
266 MTH void send_image (faceidx facenum);
267 MTH void send_faces (object *ob);
268 MTH void send_animation (short anim_num);
269 void send_msg (int color, const char *type, const char *msg);
270
271 // called when something under the player changes
272 MTH void floorbox_update () { update_look = 1; }
273 // called when the player has been moved
274 MTH void floorbox_reset () { look_position = 0; floorbox_update (); }
275
276 MTH void tick (); // called every server tick to do housekeeping etc.
277
278 MTH static client *create (int fd, const char *peername);
279
280 protected:
281 client (int fd, const char *from_ip);
282 ~client ();
283 };
284
285 #define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\
286 ( ((__type)>0) &&\
287 ((__sockPtr)->has_readable_type) && \
288 ((__sockPtr)->supported_readables & (1<<(__type))) )
289
290 /* Constants in the form EMI_ is for extended map infos.
291 * Even if the client select the additionnal infos it wants
292 * on the map, there may exist cases where this whole info
293 * is not given in one buch but in separate bunches. This
294 * is done performance reasons (imagine some info related to
295 * a visible object and another info related to a 4 square
296 * width and height area). At the begin of an extended info packet
297 * is a bit field. A bit is activated for each extended info
298 * present in the data
299 */
300
301 /* Meanings:
302 * EMI_NOREDRAW Take extended infos into account but don't redraw,
303 * some additionnal datas will follow in a new packet
304 * EMI_SMOOTH Datas about smoothing
305 */
306 #define EMI_NOREDRAW 0x01
307 #define EMI_SMOOTH 0x02
308
309 /* this last one says the bitfield continue un next byte
310 * There may be several on contiguous bytes. So there is 7
311 * actual bits used per byte, and the number of bytes
312 * is not fixed in protocol
313 */
314 #define EMI_HASMOREBITS 0x80
315
316 #define FACE_TYPES 1
317 #define PNG_FACE_INDEX 0
318
319 #define VERSION_CS 1023 /* version >= 1023 understand setup cmd */
320 #define VERSION_SC 1026
321 //#define VERSION_SC 1027 // requestinfo image_info and image_sums, makes extending faces on the fly impossible
322 #define VERSION_INFO "Crossfire TRT Server"
323
324 typedef object_vector<client, &client::active> sockvec;
325
326 extern sockvec clients;
327
328 #define for_all_clients(var) \
329 for (int _i = 0; _i < clients.size (); ++_i) \
330 statementvar (client *, var, clients [_i])
331
332 #endif
333