ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/client.h
Revision: 1.7
Committed: Sat Dec 16 21:40:26 2006 UTC (17 years, 5 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.6: +14 -11 lines
Log Message:
- clean up some code
- fix some possible (minor) bugs
- use a bitset for anims_sent
- fix a memory leak
- removed dead code

File Contents

# User Rev Content
1 root 1.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 root 1.3 The author can be reached via e-mail to crossfire@schmorp.de
22 root 1.1 */
23    
24     #ifndef CLIENT_H
25     #define CLIENT_H
26    
27 root 1.4 #include <deque>
28 root 1.7 #include <bitset>
29 root 1.1
30 root 1.4 // (possibly) max. number of objects "per page" in the ground container
31 root 1.1 #define NUM_LOOK_OBJECTS 50
32    
33     struct MapCell
34     {
35     UUID player; // this is, unfortunately, very wasteful of memory space, but pretty bandwidth-efficient
36     int count; /* This is really darkness in the map1 command */
37     uint16 faces[MAP_LAYERS];
38     uint16 smooth[MAP_LAYERS];
39     unsigned char stat_hp; // health of something in this space, or 0
40     unsigned char flags;
41     };
42    
43     /* This basically defines the largest size an
44     * archetype may be - it is used for allocation of
45     * some structures, as well as determining how far
46     * we should look for the heads of big images.
47     */
48     #define MAX_HEAD_OFFSET 8
49    
50     #define MAX_CLIENT_X (MAP_CLIENT_X + MAX_HEAD_OFFSET)
51     #define MAX_CLIENT_Y (MAP_CLIENT_Y + MAX_HEAD_OFFSET)
52    
53     struct Map
54     {
55     struct MapCell cells[MAX_CLIENT_X][MAX_CLIENT_Y];
56     };
57    
58     /* True max is 16383 given current map compaction method */
59     # define MAXANIMNUM 2000
60    
61     struct statsinfo
62     {
63     char *range, *title;
64     };
65    
66     /* This contains basic information on the socket structure. status is its
67     * current state. we set up our on buffers for sending/receiving, so we can
68     * handle some higher level functions. fd is the actual file descriptor we
69     * are using.
70     */
71    
72     enum Sock_Status { Ns_Add, Ns_Dead };
73    
74     /* Only one map mode can actually be used, so lets make it a switch
75     * instead of having a bunch of different fields that needed to
76     * get toggled.
77     */
78     enum MapMode { Map0Cmd = 0, Map1Cmd = 1, Map1aCmd = 2 };
79    
80     /* The following is the setup for a ring buffer for storing outbut
81     * data that the OS can't handle right away.
82     */
83    
84     struct Buffer
85     {
86     char data[SOCKETBUFSIZE];
87     int start;
88     int len;
89     };
90    
91 root 1.4 // a handler for a specific type of packet
92     enum {
93     PF_PLAYER = 0x01, // must have valid player
94     PF_IMMEDIATE = 0x02, // TODO: hack, can be executed immediately
95     PF_PLAYING = 0x04, // 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 root 1.6 ~command ()
113 root 1.4 {
114 root 1.6 sfree (data, datalen);
115 root 1.4 }
116     };
117    
118 root 1.1 /* how many times we are allowed to give the wrong password before being kicked. */
119     #define MAX_PASSWORD_FAILURES 5
120    
121     ACC_CLASS (client) // should become player when newsocket is a baseclass of player
122     struct client : zero_initialised, attachable_base
123     {
124     enum Sock_Status status;
125     int ACC (RW, fd);
126 root 1.7 unsigned int inbuf_len; // number of bytes valid in inbuf
127     uint8 *faces_sent; // This is a bitmap on sent face status
128 root 1.1 struct statsinfo stats;
129    
130 root 1.7 char *ACC (RW, host); /* Which host it is connected from (ip address) */
131     uint8 ACC (RW, password_fails); /* how many times the player has failed to give the right password */
132     Buffer outputbuffer;
133 root 1.1
134     bool ACC (RW, facecache); /* If true, client is caching images */
135     bool ACC (RW, sent_scroll);
136     bool ACC (RW, sound); /* does the client want sound */
137     bool ACC (RW, exp64); /* Client wants 64 bit exp data, as well as skill data */
138     bool ACC (RW, newmapcmd); /* Send newmap command when entering new map SMACFIGGEN */
139     bool ACC (RW, plugincmd); /* CF+ extend the protocol through a plug-in */
140     bool ACC (RW, mapinfocmd); /* CF+ return map info and send map change info */
141     bool ACC (RW, extcmd); /* CF+ call into extensions/plugins */
142     bool ACC (RW, extmap); /* CF+ extend map comamnd with extra data */
143     bool ACC (RW, buggy_mapscroll); /* CF+ client crashes on large mapscrolls */
144     bool ACC (RW, darkness); /* True if client wants darkness information */
145     bool ACC (RW, image2); /* Client wants image2/face2 commands */
146     bool ACC (RW, update_look); /* If true, we need to send the look window */
147     bool ACC (RW, has_readable_type); /* If true client accept additional text information */
148     /* used to arrange text in books, scrolls, or scripted dialogs */
149     bool ACC (RW, monitor_spells); /* Client wishes to be informed when their spell list changes */
150     bool ACC (RW, ext_mapinfos); /* If true client accept additionnal info on maps */
151     /* Below are flags for extedend infos to pass to client
152     * with S->C mapextended command */
153     bool ACC (RW, EMI_smooth); /* Send smooth in extendmapinfos */
154    
155     uint32 ACC (RW, supported_readables); /* each bit is a readable supported by client */
156     uint32 ACC (RW, cs_version), ACC (RW, sc_version); /* versions of the client */
157     enum MapMode mapmode; /* Type of map commands the client wants. */
158     uint16 ACC (RW, look_position); /* start of drawing of look window */
159     uint8 ACC (RW, mapx), ACC (RW, mapy); /* How large a map the client wants */
160     uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */
161     uint8 ACC (RW, faceset); /* Set the client is using, default 0 */
162    
163     maptile *ACC (RW, current_map); // CF+ last/current player map
164     int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position
165     char ACC (RW, version)[64]; // CF+ client name/version
166    
167     player *ACC (RO, pl);//TODO should not be here, preferably
168    
169     int ACC (RW, rtt), ACC (RW, rttvar); /* round-trip time and -variance, if known */
170    
171 root 1.4 client (int fd, const char *from_ip);
172     ~client ();
173     void destroy ();
174    
175     iw cmd_ev; void cmd_cb (iw &w);
176 root 1.1 iow socket_ev; void socket_cb (iow &w, int got);
177    
178 root 1.4 std::deque< command, slice_allocator<command> > cmd_queue;
179    
180 root 1.5 // resets movement state
181 root 1.4 bool may_execute (const packet_type *pkt) const;
182     void execute (const packet_type *pkt, char *data, int datalen);
183    
184     void queue_command (packet_type *handler, char *data, int datalen);
185     bool handle_command ();
186 root 1.5 void reset_state ();
187 root 1.1
188 root 1.4 bool handle_packet ();
189     int next_packet (); // returns length of packet or 0
190 root 1.1 void skip_packet (int len); // we have processed the packet, skip it
191    
192     void flush ();
193     void write_outputbuffer ();
194     void send (void *buf_, int len);
195    
196     void send_packet (const char *buf);
197     void send_packet (const char *buf, int len);
198 root 1.4 void send_packet_printf (const char *format, ...);
199 root 1.1 void send_packet (packet &sl);
200 root 1.7
201     // large structures at the end please
202     struct Map lastmap;
203     std::bitset<MAXANIMNUM> anims_sent;
204     // if we get an incomplete packet, this is used to hold the data.
205     // we add 2 byte for the header, one for the trailing 0 byte
206     uint8 inbuf[MAXSOCKBUF + 2 + 1];
207    
208 root 1.1 };
209    
210     #define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\
211     ( ((__type)>0) &&\
212     ((__sockPtr)->has_readable_type) && \
213     ((__sockPtr)->supported_readables & (1<<(__type))) )
214    
215     /* Bitmask for the faces_sent[] array - what
216     * portion of the face have we sent?
217     */
218     #define NS_FACESENT_FACE 0x1
219     #define NS_FACESENT_SMOOTH 0x2
220    
221     /* Constants in the form EMI_ is for extended map infos.
222     * Even if the client select the additionnal infos it wants
223     * on the map, there may exist cases where this whole info
224     * is not given in one buch but in separate bunches. This
225     * is done performance reasons (imagine some info related to
226     * a visible object and another info related to a 4 square
227     * width and height area). At the begin of an extended info packet
228     * is a bit field. A bit is activated for each extended info
229     * present in the data
230     */
231    
232     /* Meanings:
233     * EMI_NOREDRAW Take extended infos into account but don't redraw,
234     * some additionnal datas will follow in a new packet
235     * EMI_SMOOTH Datas about smoothing
236     */
237     #define EMI_NOREDRAW 0x01
238     #define EMI_SMOOTH 0x02
239    
240     /* this last one says the bitfield continue un next byte
241     * There may be several on contiguous bytes. So there is 7
242     * actual bits used per byte, and the number of bytes
243     * is not fixed in protocol
244     */
245     #define EMI_HASMOREBITS 0x80
246    
247     #define FACE_TYPES 1
248     #define PNG_FACE_INDEX 0
249    
250     #define VERSION_CS 1023 /* version >= 1023 understand setup cmd */
251     #define VERSION_SC 1027
252     #define VERSION_INFO "Crossfire+ Server"
253    
254     typedef unordered_vector<client *> sockvec;
255    
256     extern sockvec clients;
257     extern int nrofpixmaps; //TODO: hrmpf, should go
258    
259     #endif
260