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.48 by root, Tue Apr 24 00:42:02 2007 UTC vs.
Revision 1.53 by root, Sat Jun 9 22:54:03 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for the X Window System 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 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) 1992 Frank Tore Johansen 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 it
9 * it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
10 * the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
11 * (at your option) any later version. 11 * 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, but
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * GNU General Public License for more details. 16 * 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 along
19 * along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 21 *
22 * The author can be reached via e-mail to crossfire@schmorp.de 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 23 */
24 24
25#ifndef CLIENT_H 25#ifndef CLIENT_H
26#define CLIENT_H 26#define CLIENT_H
27 27
… …
68 * instead of having a bunch of different fields that needed to 68 * instead of having a bunch of different fields that needed to
69 * get toggled. 69 * get toggled.
70 */ 70 */
71enum { Map0Cmd = 0, Map1Cmd = 1, Map1aCmd = 2 }; 71enum { Map0Cmd = 0, Map1Cmd = 1, Map1aCmd = 2 };
72 72
73/* The following is the setup for a ring buffer for storing output
74 * data that the OS can't handle right away.
75 */
76struct Buffer
77{
78 char data[SOCKETBUFSIZE];
79 int start;
80 int len;
81};
82
83// states the socket can be in 73// states the socket can be in
84enum { 74enum {
85 ST_DEAD, // socket is dead 75 ST_DEAD, // socket is dead
86 ST_SETUP, // initial handshake / setup / login 76 ST_SETUP, // initial handshake / setup / login
87 ST_PLAYING, // logged in an playing 77 ST_PLAYING, // logged in an playing
… …
116 { 106 {
117 sfree<char> (data, datalen + 1); 107 sfree<char> (data, datalen + 1);
118 } 108 }
119}; 109};
120 110
121struct refitem
122{
123 object_ptr op;
124};
125
126// this represents a container on the client side.
127// right now, there are only ever two of them:
128// the inventory and the floor/open container
129//TODO: unused as of yet
130struct client_container : vector< refitem, slice_allocator<refitem> >
131{
132 client *ns;
133 enum { CC_NONE, CC_INVENTORY, CC_MAPSPACE, CC_CONTAINER } type;
134
135 bool item_changed; // one of the items in here possibly changed
136
137 // for mapspace and container
138 int x, y;
139 maptile *map;
140
141 // for container
142 object *env;
143
144 client_container (client *ns)
145 : ns (ns), type (CC_NONE) { }
146
147 tag_t tag () const;
148
149 inline iterator merge_item (iterator i, object *op);
150
151 void clear ();
152 void update ();
153
154 void set_mapspace (maptile *map, int x, int y);
155 void set_container (object *env);
156};
157
158/* how many times we are allowed to give the wrong password before being kicked. */ 111/* how many times we are allowed to give the wrong password before being kicked. */
159#define MAX_PASSWORD_FAILURES 5 112#define MAX_PASSWORD_FAILURES 5
160 113
161INTERFACE_CLASS (client) // should become player when newsocket is a baseclass of player 114INTERFACE_CLASS (client) // should become player when newsocket is a baseclass of player
162struct client : zero_initialised, attachable 115struct client : zero_initialised, attachable
163{ 116{
164 int ACC (RW, fd); 117 int ACC (RW, fd);
165 unsigned int inbuf_len; // number of bytes valid in inbuf 118 unsigned int inbuf_len; // number of bytes valid in inbuf
166 statsinfo stats; 119 statsinfo stats;
167 int ACC (RO, active); 120 int ACC (RO, active);
121 player_ptr ACC (RO, pl);
168 122
169 Buffer outputbuffer; 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;
170 132
171 char *ACC (RW, host); /* Which host it is connected from (ip address) */ 133 char *ACC (RW, host); /* Which host it is connected from (ip address) */
172 uint8 ACC (RW, state); /* Input state of the player (name, password, etc */ 134 uint8 ACC (RW, state); /* Input state of the player (name, password, etc */
173 135
174 sint8 ACC (RW, last_level); /* Last level we sent to client */ 136 sint8 ACC (RW, last_level); /* Last level we sent to client */
… …
223 uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */ 185 uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */
224 186
225 maptile *ACC (RW, current_map); // CF+ last/current player map 187 maptile *ACC (RW, current_map); // CF+ last/current player map
226 region *ACC (RW, current_region); // CF+ last/current player region 188 region *ACC (RW, current_region); // CF+ last/current player region
227 int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position 189 int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position
228 char ACC (RW, version)[64]; // CF+ client name/version 190 shstr ACC (RW, version); // CF+ client name/version
229 uint8 ACC (RW, faceset); // CF+ selected faceset 191 uint8 ACC (RW, faceset); // CF+ selected faceset
230 192
231 player_ptr ACC (RO, pl); 193 tstamp ACC (RW, last_send); // last data send on socket.
232 194
233 int ACC (RW, rtt), ACC (RW, rttvar); /* round-trip time and -variance, if known */ 195 int ACC (RW, rtt), ACC (RW, rttvar); /* round-trip time and -variance, if known */
234 196
235 int ACC (RW, rate_avail); // current rate balance 197 int ACC (RW, rate_avail); // current rate balance
236 int ACC (RW, max_rate); // max. # of bytes to send per tick 198 int ACC (RW, max_rate); // max. # of bytes to send per tick
… …
247 void do_destroy (); 209 void do_destroy ();
248 void gather_callbacks (AV *&callbacks, event_type event) const; 210 void gather_callbacks (AV *&callbacks, event_type event) const;
249 211
250 iow socket_ev; void socket_cb (iow &w, int got); 212 iow socket_ev; void socket_cb (iow &w, int got);
251 iw cmd_ev; void cmd_cb (iw &w); 213 iw cmd_ev; void cmd_cb (iw &w);
252 client_container cc_inv, cc_other;
253 214
254 std::deque< command, slice_allocator<command> > cmd_queue; 215 std::deque< command, slice_allocator<command> > cmd_queue;
255 216
256 // large structures at the end please 217 // large structures at the end please
257 struct Map lastmap; 218 struct Map lastmap;
… …
259 std::bitset<MAX_FACES> faces_sent; 220 std::bitset<MAX_FACES> faces_sent;
260 221
261 // if we get an incomplete packet, this is used to hold the data. 222 // if we get an incomplete packet, this is used to hold the data.
262 // we add 2 byte for the header, one for the trailing 0 byte 223 // we add 2 byte for the header, one for the trailing 0 byte
263 uint8 inbuf[MAXSOCKBUF + 2 + 1]; 224 uint8 inbuf[MAXSOCKBUF + 2 + 1];
225
226 enum { MSG_BUF_SIZE = 80, MSG_BUF_COUNT = 10 };
227 struct msg_buf
228 {
229 tick_t expire;
230 int len;
231 int count;
232 char msg[MSG_BUF_SIZE];
233 } msgbuf[MSG_BUF_COUNT];
234
235 MTH bool msg_suppressed (const char *msg);
264 236
265 bool may_execute (const packet_type *pkt) const; 237 bool may_execute (const packet_type *pkt) const;
266 void execute (const packet_type *pkt, char *data, int datalen); 238 void execute (const packet_type *pkt, char *data, int datalen);
267 239
268 void queue_command (packet_type *handler, char *data, int datalen); 240 void queue_command (packet_type *handler, char *data, int datalen);
… …
350 322
351extern sockvec clients; 323extern sockvec clients;
352 324
353#define for_all_clients(var) \ 325#define for_all_clients(var) \
354 for (int _i = 0; _i < clients.size (); ++_i) \ 326 for (int _i = 0; _i < clients.size (); ++_i) \
355 declvar (client *, var, clients [_i]) 327 statementvar (client *, var, clients [_i])
356 328
357#endif 329#endif
358 330

Diff Legend

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