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.12 by root, Wed Dec 20 01:19:11 2006 UTC vs.
Revision 1.18 by root, Sat Dec 23 06:21:02 2006 UTC

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 <list> 29#include <tr1/unordered_set>
30 30
31// (possibly) max. number of objects "per page" in the ground container 31// (possibly) max. number of objects "per page" in the ground container
32#define FLOORBOX_PAGESIZE 50 32#define FLOORBOX_PAGESIZE 50
33 33
34struct MapCell 34struct MapCell
68 * current state. we set up our on buffers for sending/receiving, so we can 68 * current state. we set up our on buffers for sending/receiving, so we can
69 * handle some higher level functions. fd is the actual file descriptor we 69 * handle some higher level functions. fd is the actual file descriptor we
70 * are using. 70 * are using.
71 */ 71 */
72 72
73enum Sock_Status { Ns_Add, Ns_Dead };
74
75/* Only one map mode can actually be used, so lets make it a switch 73/* Only one map mode can actually be used, so lets make it a switch
76 * instead of having a bunch of different fields that needed to 74 * instead of having a bunch of different fields that needed to
77 * get toggled. 75 * get toggled.
78 */ 76 */
79enum MapMode { Map0Cmd = 0, Map1Cmd = 1, Map1aCmd = 2 }; 77enum MapMode { Map0Cmd = 0, Map1Cmd = 1, Map1aCmd = 2 };
80 78
81/* The following is the setup for a ring buffer for storing outbut 79/* The following is the setup for a ring buffer for storing output
82 * data that the OS can't handle right away. 80 * data that the OS can't handle right away.
83 */ 81 */
84
85struct Buffer 82struct Buffer
86{ 83{
87 char data[SOCKETBUFSIZE]; 84 char data[SOCKETBUFSIZE];
88 int start; 85 int start;
89 int len; 86 int len;
87};
88
89// states the socket can be in
90enum {
91 ST_DEAD, // socket is dead
92 ST_SETUP, // initial handshake / setup / login
93 ST_PLAYING, // logged in an playing
94 ST_CUSTOM, // waiting for custom reply
95
96 ST_CONFIRM_QUIT,
97 ST_CHANGE_CLASS,
98 ST_GET_PARTY_PASSWORD,
90}; 99};
91 100
92// a handler for a specific type of packet 101// a handler for a specific type of packet
93enum { 102enum {
94 PF_PLAYER = 0x01, // must have valid player / will by synchronised 103 PF_PLAYER = 0x01, // must have valid player / will by synchronised
113 { 122 {
114 sfree<char> (data, datalen + 1); 123 sfree<char> (data, datalen + 1);
115 } 124 }
116}; 125};
117 126
127struct refitem
128{
129 object_ptr op;
130};
131
118// this represents a container on the client side. 132// this represents a container on the client side.
119// right now, there are only ever two of them: 133// right now, there are only ever two of them:
120// the inventory and the floor/open container 134// the inventory and the floor/open container
121//TODO: unused as of yet 135//TODO: unused as of yet
122struct client_container 136struct client_container : vector< refitem, slice_allocator<refitem> >
123{ 137{
138 client *ns;
124 enum { CC_NONE, CC_INVENTORY, CC_MAPSPACE, CC_CONTAINER } type; 139 enum { CC_NONE, CC_INVENTORY, CC_MAPSPACE, CC_CONTAINER } type;
125 140
141 bool item_changed; // one of the items in here possibly changed
142
126 // for mapspace and container 143 // for mapspace and container
127 sint16 x, y; 144 int x, y;
128 maptile *map; 145 maptile *map;
129 146
130 // for container 147 // for container
131 object *env; 148 object *env;
149
150 client_container (client *ns)
151 : ns (ns), type (CC_NONE) { }
152
153 tag_t tag () const;
154
155 inline iterator merge_item (iterator i, object *op);
156
157 void clear ();
158 void update ();
159
160 void set_mapspace (maptile *map, int x, int y);
161 void set_container (object *env);
132}; 162};
133 163
134/* how many times we are allowed to give the wrong password before being kicked. */ 164/* how many times we are allowed to give the wrong password before being kicked. */
135#define MAX_PASSWORD_FAILURES 5 165#define MAX_PASSWORD_FAILURES 5
136 166
137ACC_CLASS (client) // should become player when newsocket is a baseclass of player 167ACC_CLASS (client) // should become player when newsocket is a baseclass of player
138struct client : zero_initialised, attachable_base 168struct client : zero_initialised, attachable<client>
139{ 169{
140 enum Sock_Status status;
141 int ACC (RW, fd); 170 int ACC (RW, fd);
142 unsigned int inbuf_len; // number of bytes valid in inbuf 171 unsigned int inbuf_len; // number of bytes valid in inbuf
143 uint8 *faces_sent; // This is a bitmap on sent face status 172 uint8 *faces_sent; // This is a bitmap on sent face status
144 statsinfo stats; 173 statsinfo stats;
145 174
146 client_container cc_inv, cc_other; 175 client_container cc_inv, cc_other;
176 Buffer outputbuffer;
147 177
148 char *ACC (RW, host); /* Which host it is connected from (ip address) */ 178 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 */
149 uint8 ACC (RW, password_fails); /* how many times the player has failed to give the right password */ 180 uint8 ACC (RW, password_fails); /* how many times the player has failed to give the right password */
150 Buffer outputbuffer;
151 181
152 bool ACC (RW, facecache); /* If true, client is caching images */ 182 bool ACC (RW, facecache); /* If true, client is caching images */
153 bool ACC (RW, sent_scroll); 183 bool ACC (RW, sent_scroll);
154 bool ACC (RW, sound); /* does the client want sound */ 184 bool ACC (RW, sound); /* does the client want sound */
155 bool ACC (RW, exp64); /* Client wants 64 bit exp data, as well as skill data */ 185 bool ACC (RW, exp64); /* Client wants 64 bit exp data, as well as skill data */
180 210
181 maptile *ACC (RW, current_map); // CF+ last/current player map 211 maptile *ACC (RW, current_map); // CF+ last/current player map
182 int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position 212 int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position
183 char ACC (RW, version)[64]; // CF+ client name/version 213 char ACC (RW, version)[64]; // CF+ client name/version
184 214
185 player *ACC (RO, pl);//TODO should not be here, preferably 215 player_ptr ACC (RO, pl);
186 216
187 int ACC (RW, rtt), ACC (RW, rttvar); /* round-trip time and -variance, if known */ 217 int ACC (RW, rtt), ACC (RW, rttvar); /* round-trip time and -variance, if known */
188 218
189 client (int fd, const char *from_ip); 219 client (int fd, const char *from_ip);
190 ~client (); 220 ~client ();
191 void destroy (); 221 void destroy ();
222 bool destroyed () const { return state == ST_DEAD; }
192 223
193 iw cmd_ev; void cmd_cb (iw &w); 224 iw cmd_ev; void cmd_cb (iw &w);
194 iow socket_ev; void socket_cb (iow &w, int got); 225 iow socket_ev; void socket_cb (iow &w, int got);
195 226
196 std::deque< command, slice_allocator<command> > cmd_queue; 227 std::deque< command, slice_allocator<command> > cmd_queue;
197
198 // resets movement state
199 bool may_execute (const packet_type *pkt) const;
200 void execute (const packet_type *pkt, char *data, int datalen);
201
202 void queue_command (packet_type *handler, char *data, int datalen);
203 bool handle_command ();
204 void reset_state ();
205
206 bool handle_packet ();
207 int next_packet (); // returns length of packet or 0
208 void skip_packet (int len); // we have processed the packet, skip it
209
210 void flush ();
211 void write_outputbuffer ();
212 void send (void *buf_, int len);
213
214 void send_packet (const char *buf);
215 void send_packet (const char *buf, int len);
216 void send_packet_printf (const char *format, ...);
217 void send_packet (packet &sl);
218
219 // called when something under the player changes
220 void floorbox_update () { update_look = 1; }
221 // called when the player has been moved
222 void floorbox_reset () { look_position = 0; floorbox_update (); }
223 228
224 // large structures at the end please 229 // large structures at the end please
225 struct Map lastmap; 230 struct Map lastmap;
226 std::bitset<MAXANIMNUM> anims_sent; 231 std::bitset<MAXANIMNUM> anims_sent;
227 // if we get an incomplete packet, this is used to hold the data. 232 // if we get an incomplete packet, this is used to hold the data.
228 // we add 2 byte for the header, one for the trailing 0 byte 233 // we add 2 byte for the header, one for the trailing 0 byte
229 uint8 inbuf[MAXSOCKBUF + 2 + 1]; 234 uint8 inbuf[MAXSOCKBUF + 2 + 1];
235
236 bool may_execute (const packet_type *pkt) const;
237 void execute (const packet_type *pkt, char *data, int datalen);
238
239 void queue_command (packet_type *handler, char *data, int datalen);
240 bool handle_command ();
241 // resets movement state
242 void reset_state ();
243
244 bool handle_packet ();
245 int next_packet (); // returns length of packet or 0
246 void skip_packet (int len); // we have processed the packet, skip it
247
248 void flush ();
249 void write_outputbuffer ();
250 void send (void *buf_, int len);
251
252 void send_packet (const char *buf);
253 void send_packet (const char *buf, int len);
254 void send_packet_printf (const char *format, ...);
255 void send_packet (packet &sl);
256
257 // called when something under the player changes
258 void floorbox_update () { update_look = 1; }
259 // called when the player has been moved
260 void floorbox_reset () { look_position = 0; floorbox_update (); }
261
262 static client *create (int fd, const char *peername);
230}; 263};
231 264
232#define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\ 265#define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\
233 ( ((__type)>0) &&\ 266 ( ((__type)>0) &&\
234 ((__sockPtr)->has_readable_type) && \ 267 ((__sockPtr)->has_readable_type) && \

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines