| 1 |
/* |
| 2 |
CrossFire, A Multiplayer game for the X Window System |
| 3 |
|
| 4 |
Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
| 5 |
Copyright (C) 1992 Frank Tore Johansen |
| 6 |
|
| 7 |
This program is free software; you can redistribute it and/or modify |
| 8 |
it under the terms of the GNU General Public License as published by |
| 9 |
the Free Software Foundation; either version 2 of the License, or |
| 10 |
(at your option) any later version. |
| 11 |
|
| 12 |
This program is distributed in the hope that it will be useful, |
| 13 |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 |
GNU General Public License for more details. |
| 16 |
|
| 17 |
You should have received a copy of the GNU General Public License |
| 18 |
along with this program; if not, write to the Free Software |
| 19 |
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 20 |
|
| 21 |
The author can be reached via e-mail to crossfire@schmorp.de |
| 22 |
*/ |
| 23 |
|
| 24 |
#ifndef CLIENT_H |
| 25 |
#define CLIENT_H |
| 26 |
|
| 27 |
#include <deque> |
| 28 |
#include <bitset> |
| 29 |
#include <list> |
| 30 |
|
| 31 |
// (possibly) max. number of objects "per page" in the ground container |
| 32 |
#define FLOORBOX_PAGESIZE 50 |
| 33 |
|
| 34 |
struct MapCell |
| 35 |
{ |
| 36 |
UUID player; // this is, unfortunately, very wasteful of memory space, but pretty bandwidth-efficient |
| 37 |
int count; /* This is really darkness in the map1 command */ |
| 38 |
uint16 faces[MAP_LAYERS]; |
| 39 |
uint16 smooth[MAP_LAYERS]; |
| 40 |
unsigned char stat_hp; // health of something in this space, or 0 |
| 41 |
unsigned char flags; |
| 42 |
}; |
| 43 |
|
| 44 |
/* This basically defines the largest size an |
| 45 |
* archetype may be - it is used for allocation of |
| 46 |
* some structures, as well as determining how far |
| 47 |
* we should look for the heads of big images. |
| 48 |
*/ |
| 49 |
#define MAX_HEAD_OFFSET 8 |
| 50 |
|
| 51 |
#define MAX_CLIENT_X (MAP_CLIENT_X + MAX_HEAD_OFFSET) |
| 52 |
#define MAX_CLIENT_Y (MAP_CLIENT_Y + MAX_HEAD_OFFSET) |
| 53 |
|
| 54 |
struct Map |
| 55 |
{ |
| 56 |
struct MapCell cells[MAX_CLIENT_X][MAX_CLIENT_Y]; |
| 57 |
}; |
| 58 |
|
| 59 |
/* True max is 16383 given current map compaction method */ |
| 60 |
# define MAXANIMNUM 2000 |
| 61 |
|
| 62 |
struct statsinfo |
| 63 |
{ |
| 64 |
char *range, *title; |
| 65 |
}; |
| 66 |
|
| 67 |
/* This contains basic information on the socket structure. status is its |
| 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 |
| 70 |
* are using. |
| 71 |
*/ |
| 72 |
|
| 73 |
enum Sock_Status { Ns_Add, Ns_Dead }; |
| 74 |
|
| 75 |
/* 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 |
| 77 |
* get toggled. |
| 78 |
*/ |
| 79 |
enum MapMode { Map0Cmd = 0, Map1Cmd = 1, Map1aCmd = 2 }; |
| 80 |
|
| 81 |
/* The following is the setup for a ring buffer for storing outbut |
| 82 |
* data that the OS can't handle right away. |
| 83 |
*/ |
| 84 |
|
| 85 |
struct Buffer |
| 86 |
{ |
| 87 |
char data[SOCKETBUFSIZE]; |
| 88 |
int start; |
| 89 |
int len; |
| 90 |
}; |
| 91 |
|
| 92 |
// a handler for a specific type of packet |
| 93 |
enum { |
| 94 |
PF_PLAYER = 0x01, // must have valid player / will by synchronised |
| 95 |
PF_PLAYING = 0x02, // must be in playing state |
| 96 |
}; |
| 97 |
|
| 98 |
struct packet_type |
| 99 |
{ |
| 100 |
const char *name; |
| 101 |
void *cb; |
| 102 |
int flags; |
| 103 |
}; |
| 104 |
|
| 105 |
struct command |
| 106 |
{ |
| 107 |
tstamp stamp; |
| 108 |
const packet_type *handler; |
| 109 |
char *data; |
| 110 |
int datalen; |
| 111 |
|
| 112 |
~command () |
| 113 |
{ |
| 114 |
sfree<char> (data, datalen + 1); |
| 115 |
} |
| 116 |
}; |
| 117 |
|
| 118 |
// this represents a container on the client side. |
| 119 |
// right now, there are only ever two of them: |
| 120 |
// the inventory and the floor/open container |
| 121 |
//TODO: unused as of yet |
| 122 |
struct client_container |
| 123 |
{ |
| 124 |
enum { CC_NONE, CC_INVENTORY, CC_MAPSPACE, CC_CONTAINER } type; |
| 125 |
|
| 126 |
// for mapspace and container |
| 127 |
sint16 x, y; |
| 128 |
maptile *map; |
| 129 |
|
| 130 |
// for container |
| 131 |
object *env; |
| 132 |
}; |
| 133 |
|
| 134 |
/* how many times we are allowed to give the wrong password before being kicked. */ |
| 135 |
#define MAX_PASSWORD_FAILURES 5 |
| 136 |
|
| 137 |
ACC_CLASS (client) // should become player when newsocket is a baseclass of player |
| 138 |
struct client : zero_initialised, attachable_base |
| 139 |
{ |
| 140 |
enum Sock_Status status; |
| 141 |
int ACC (RW, fd); |
| 142 |
unsigned int inbuf_len; // number of bytes valid in inbuf |
| 143 |
uint8 *faces_sent; // This is a bitmap on sent face status |
| 144 |
statsinfo stats; |
| 145 |
|
| 146 |
client_container cc_inv, cc_other; |
| 147 |
|
| 148 |
char *ACC (RW, host); /* Which host it is connected from (ip address) */ |
| 149 |
uint8 ACC (RW, password_fails); /* how many times the player has failed to give the right password */ |
| 150 |
Buffer outputbuffer; |
| 151 |
|
| 152 |
bool ACC (RW, facecache); /* If true, client is caching images */ |
| 153 |
bool ACC (RW, sent_scroll); |
| 154 |
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 */ |
| 156 |
bool ACC (RW, newmapcmd); /* Send newmap command when entering new map SMACFIGGEN */ |
| 157 |
bool ACC (RW, plugincmd); /* CF+ extend the protocol through a plug-in */ |
| 158 |
bool ACC (RW, mapinfocmd); /* CF+ return map info and send map change info */ |
| 159 |
bool ACC (RW, extcmd); /* CF+ call into extensions/plugins */ |
| 160 |
bool ACC (RW, extmap); /* CF+ extend map comamnd with extra data */ |
| 161 |
bool ACC (RW, buggy_mapscroll); /* CF+ client crashes on large mapscrolls */ |
| 162 |
bool ACC (RW, darkness); /* True if client wants darkness information */ |
| 163 |
bool ACC (RW, image2); /* Client wants image2/face2 commands */ |
| 164 |
bool ACC (RW, update_look); /* If true, we need to send the look window */ |
| 165 |
bool ACC (RW, has_readable_type); /* If true client accept additional text information */ |
| 166 |
/* used to arrange text in books, scrolls, or scripted dialogs */ |
| 167 |
bool ACC (RW, monitor_spells); /* Client wishes to be informed when their spell list changes */ |
| 168 |
bool ACC (RW, ext_mapinfos); /* If true client accepts additional info on maps */ |
| 169 |
/* Below are flags for extedend infos to pass to client |
| 170 |
* with S->C mapextended command */ |
| 171 |
bool ACC (RW, EMI_smooth); /* Send smooth in extendmapinfos */ |
| 172 |
|
| 173 |
uint32 ACC (RW, supported_readables); /* each bit is a readable supported by client */ |
| 174 |
uint32 ACC (RW, cs_version), ACC (RW, sc_version); /* versions of the client */ |
| 175 |
enum MapMode mapmode; /* Type of map commands the client wants. */ |
| 176 |
uint16 ACC (RW, look_position); /* start of drawing of look window */ |
| 177 |
uint8 ACC (RW, mapx), ACC (RW, mapy); /* How large a map the client wants */ |
| 178 |
uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */ |
| 179 |
uint8 ACC (RW, faceset); /* Set the client is using, default 0 */ |
| 180 |
|
| 181 |
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 |
| 183 |
char ACC (RW, version)[64]; // CF+ client name/version |
| 184 |
|
| 185 |
player *ACC (RO, pl);//TODO should not be here, preferably |
| 186 |
|
| 187 |
int ACC (RW, rtt), ACC (RW, rttvar); /* round-trip time and -variance, if known */ |
| 188 |
|
| 189 |
client (int fd, const char *from_ip); |
| 190 |
~client (); |
| 191 |
void destroy (); |
| 192 |
|
| 193 |
iw cmd_ev; void cmd_cb (iw &w); |
| 194 |
iow socket_ev; void socket_cb (iow &w, int got); |
| 195 |
|
| 196 |
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 |
|
| 224 |
// large structures at the end please |
| 225 |
struct Map lastmap; |
| 226 |
std::bitset<MAXANIMNUM> anims_sent; |
| 227 |
// 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 |
| 229 |
uint8 inbuf[MAXSOCKBUF + 2 + 1]; |
| 230 |
}; |
| 231 |
|
| 232 |
#define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\ |
| 233 |
( ((__type)>0) &&\ |
| 234 |
((__sockPtr)->has_readable_type) && \ |
| 235 |
((__sockPtr)->supported_readables & (1<<(__type))) ) |
| 236 |
|
| 237 |
/* Bitmask for the faces_sent[] array - what |
| 238 |
* portion of the face have we sent? |
| 239 |
*/ |
| 240 |
#define NS_FACESENT_FACE 0x1 |
| 241 |
#define NS_FACESENT_SMOOTH 0x2 |
| 242 |
|
| 243 |
/* Constants in the form EMI_ is for extended map infos. |
| 244 |
* Even if the client select the additionnal infos it wants |
| 245 |
* on the map, there may exist cases where this whole info |
| 246 |
* is not given in one buch but in separate bunches. This |
| 247 |
* is done performance reasons (imagine some info related to |
| 248 |
* a visible object and another info related to a 4 square |
| 249 |
* width and height area). At the begin of an extended info packet |
| 250 |
* is a bit field. A bit is activated for each extended info |
| 251 |
* present in the data |
| 252 |
*/ |
| 253 |
|
| 254 |
/* Meanings: |
| 255 |
* EMI_NOREDRAW Take extended infos into account but don't redraw, |
| 256 |
* some additionnal datas will follow in a new packet |
| 257 |
* EMI_SMOOTH Datas about smoothing |
| 258 |
*/ |
| 259 |
#define EMI_NOREDRAW 0x01 |
| 260 |
#define EMI_SMOOTH 0x02 |
| 261 |
|
| 262 |
/* this last one says the bitfield continue un next byte |
| 263 |
* There may be several on contiguous bytes. So there is 7 |
| 264 |
* actual bits used per byte, and the number of bytes |
| 265 |
* is not fixed in protocol |
| 266 |
*/ |
| 267 |
#define EMI_HASMOREBITS 0x80 |
| 268 |
|
| 269 |
#define FACE_TYPES 1 |
| 270 |
#define PNG_FACE_INDEX 0 |
| 271 |
|
| 272 |
#define VERSION_CS 1023 /* version >= 1023 understand setup cmd */ |
| 273 |
#define VERSION_SC 1027 |
| 274 |
#define VERSION_INFO "Crossfire+ Server" |
| 275 |
|
| 276 |
typedef unordered_vector<client *> sockvec; |
| 277 |
|
| 278 |
extern sockvec clients; |
| 279 |
extern int nrofpixmaps; //TODO: hrmpf, should go |
| 280 |
|
| 281 |
#endif |
| 282 |
|
