1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for the X Window System |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your option) 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License 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 |
19 | * along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The author can be reached via e-mail to crossfire@schmorp.de |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | #ifndef CLIENT_H |
24 | #ifndef CLIENT_H |
26 | #define CLIENT_H |
25 | #define CLIENT_H |
27 | |
26 | |
28 | #include <deque> |
27 | #include <deque> |
29 | #include <bitset> |
28 | #include <bitset> |
30 | #include <tr1/unordered_set> |
29 | #include <tr1/unordered_set> |
31 | |
30 | |
|
|
31 | #if HAVE_TCP_INFO |
|
|
32 | # include <netinet/tcp.h> |
|
|
33 | #else |
|
|
34 | struct tcp_info { |
|
|
35 | // dummy |
|
|
36 | int tcpi_state; |
|
|
37 | int tcpi_ca_state; |
|
|
38 | int tcpi_retransmits; |
|
|
39 | int tcpi_probes; |
|
|
40 | int tcpi_backoff; |
|
|
41 | int tcpi_options; |
|
|
42 | int tcpi_snd_wscale; |
|
|
43 | int tcpi_rcv_wscale; |
|
|
44 | int tcpi_rto; |
|
|
45 | int tcpi_ato; |
|
|
46 | int tcpi_snd_mss; |
|
|
47 | int tcpi_rcv_mss; |
|
|
48 | int tcpi_unacked; |
|
|
49 | int tcpi_sacked; |
|
|
50 | int tcpi_lost; |
|
|
51 | int tcpi_retrans; |
|
|
52 | int tcpi_fackets; |
|
|
53 | int tcpi_last_data_sent; |
|
|
54 | int tcpi_last_ack_sent; |
|
|
55 | int tcpi_last_data_recv; |
|
|
56 | int tcpi_last_ack_recv; |
|
|
57 | int tcpi_pmtu; |
|
|
58 | int tcpi_rcv_ssthresh; |
|
|
59 | int tcpi_rtt; |
|
|
60 | int tcpi_rttvar; |
|
|
61 | int tcpi_snd_ssthresh; |
|
|
62 | int tcpi_snd_cwnd; |
|
|
63 | int tcpi_advmss; |
|
|
64 | int tcpi_reordering; |
|
|
65 | }; |
|
|
66 | #endif |
|
|
67 | |
32 | // (possibly) max. number of objects "per page" in the ground container |
68 | // (possibly) max. number of objects "per page" in the ground container |
33 | #define FLOORBOX_PAGESIZE 50 |
69 | #define FLOORBOX_PAGESIZE 50 |
34 | |
70 | |
35 | struct MapCell |
71 | struct MapCell |
36 | { |
72 | { |
37 | UUID player; // this is, unfortunately, very wasteful of memory space, but pretty bandwidth-efficient |
73 | tag_t player; // this is, unfortunately, very wasteful of memory space, but pretty bandwidth-efficient |
|
|
74 | int count; /* This is really darkness in the map1 command */ |
38 | faceidx faces[MAP_LAYERS]; |
75 | faceidx faces[MAP_LAYERS]; |
39 | faceidx smooth[MAP_LAYERS]; |
|
|
40 | int count; /* This is really darkness in the map1 command */ |
|
|
41 | unsigned char stat_hp; // health of something in this space, or 0 |
76 | unsigned char stat_hp; // health of something in this space, or 0 |
42 | unsigned char flags; |
77 | unsigned char flags; |
|
|
78 | uint8_t smooth[MAP_LAYERS]; |
43 | }; |
79 | }; |
44 | |
80 | |
45 | #define MAX_CLIENT_X MAP_CLIENT_X |
81 | #define MAX_CLIENT_X MAP_CLIENT_X |
46 | #define MAX_CLIENT_Y MAP_CLIENT_Y |
82 | #define MAX_CLIENT_Y MAP_CLIENT_Y |
47 | |
83 | |
… | |
… | |
66 | |
102 | |
67 | /* Only one map mode can actually be used, so lets make it a switch |
103 | /* 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 |
104 | * instead of having a bunch of different fields that needed to |
69 | * get toggled. |
105 | * get toggled. |
70 | */ |
106 | */ |
71 | enum MapMode { Map0Cmd = 0, Map1Cmd = 1, Map1aCmd = 2 }; |
107 | enum { Map0Cmd = 0, Map1Cmd = 1, Map1aCmd = 2 }; |
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 | */ |
|
|
76 | struct Buffer |
|
|
77 | { |
|
|
78 | char data[SOCKETBUFSIZE]; |
|
|
79 | int start; |
|
|
80 | int len; |
|
|
81 | }; |
|
|
82 | |
108 | |
83 | // states the socket can be in |
109 | // states the socket can be in |
84 | enum { |
110 | enum { |
85 | ST_DEAD, // socket is dead |
111 | ST_DEAD, // socket is dead |
86 | ST_SETUP, // initial handshake / setup / login |
112 | ST_SETUP, // initial handshake / setup / login |
87 | ST_PLAYING, // logged in an playing |
113 | ST_PLAYING, // logged in an playing |
88 | ST_CUSTOM, // waiting for custom reply |
114 | ST_CUSTOM, // waiting for custom reply |
89 | |
115 | |
90 | ST_CHANGE_CLASS, |
|
|
91 | ST_GET_PARTY_PASSWORD, |
116 | ST_GET_PARTY_PASSWORD, |
92 | }; |
117 | }; |
93 | |
118 | |
94 | // a handler for a specific type of packet |
119 | // a handler for a specific type of packet |
95 | enum { |
120 | enum { |
… | |
… | |
97 | PF_PLAYING = 0x02, // must be in playing state |
122 | PF_PLAYING = 0x02, // must be in playing state |
98 | PF_COMMAND0 = 0x04, // command starts at offset 0 |
123 | PF_COMMAND0 = 0x04, // command starts at offset 0 |
99 | PF_COMMAND6 = 0x08, // command starts at offset 6 |
124 | PF_COMMAND6 = 0x08, // command starts at offset 6 |
100 | }; |
125 | }; |
101 | |
126 | |
|
|
127 | // face type.s bit 0 means "has meta info prepended" |
|
|
128 | enum { |
|
|
129 | FT_FACE = 0 * 2 + 0, // faces (images) |
|
|
130 | FT_MUSIC = 1 * 2 + 1, // background music |
|
|
131 | FT_SOUND = 2 * 2 + 1, // effects |
|
|
132 | FT_RSRC = 3 * 2 + 0, // generic data files |
|
|
133 | FT_NUM, |
|
|
134 | }; |
|
|
135 | |
102 | struct packet_type |
136 | struct packet_type |
103 | { |
137 | { |
104 | const char *name; |
138 | const char *name; |
105 | void *cb; |
139 | void *cb; |
106 | int flags; |
140 | int flags; |
… | |
… | |
110 | { |
144 | { |
111 | tstamp stamp; |
145 | tstamp stamp; |
112 | const packet_type *handler; |
146 | const packet_type *handler; |
113 | char *data; |
147 | char *data; |
114 | int datalen; |
148 | int datalen; |
115 | |
|
|
116 | ~command () |
|
|
117 | { |
|
|
118 | sfree<char> (data, datalen + 1); |
|
|
119 | } |
|
|
120 | }; |
|
|
121 | |
|
|
122 | struct refitem |
|
|
123 | { |
|
|
124 | object_ptr op; |
|
|
125 | }; |
|
|
126 | |
|
|
127 | // this represents a container on the client side. |
|
|
128 | // right now, there are only ever two of them: |
|
|
129 | // the inventory and the floor/open container |
|
|
130 | //TODO: unused as of yet |
|
|
131 | struct client_container : vector< refitem, slice_allocator<refitem> > |
|
|
132 | { |
|
|
133 | client *ns; |
|
|
134 | enum { CC_NONE, CC_INVENTORY, CC_MAPSPACE, CC_CONTAINER } type; |
|
|
135 | |
|
|
136 | bool item_changed; // one of the items in here possibly changed |
|
|
137 | |
|
|
138 | // for mapspace and container |
|
|
139 | int x, y; |
|
|
140 | maptile *map; |
|
|
141 | |
|
|
142 | // for container |
|
|
143 | object *env; |
|
|
144 | |
|
|
145 | client_container (client *ns) |
|
|
146 | : ns (ns), type (CC_NONE) { } |
|
|
147 | |
|
|
148 | tag_t tag () const; |
|
|
149 | |
|
|
150 | inline iterator merge_item (iterator i, object *op); |
|
|
151 | |
|
|
152 | void clear (); |
|
|
153 | void update (); |
|
|
154 | |
|
|
155 | void set_mapspace (maptile *map, int x, int y); |
|
|
156 | void set_container (object *env); |
|
|
157 | }; |
149 | }; |
158 | |
150 | |
159 | /* how many times we are allowed to give the wrong password before being kicked. */ |
151 | /* how many times we are allowed to give the wrong password before being kicked. */ |
160 | #define MAX_PASSWORD_FAILURES 5 |
152 | #define MAX_PASSWORD_FAILURES 5 |
161 | |
153 | |
… | |
… | |
163 | struct client : zero_initialised, attachable |
155 | struct client : zero_initialised, attachable |
164 | { |
156 | { |
165 | int ACC (RW, fd); |
157 | int ACC (RW, fd); |
166 | unsigned int inbuf_len; // number of bytes valid in inbuf |
158 | unsigned int inbuf_len; // number of bytes valid in inbuf |
167 | statsinfo stats; |
159 | statsinfo stats; |
168 | int ACC (RO, active); |
160 | object_vector_index ACC (RO, active); |
169 | |
161 | player_ptr ACC (RO, pl); |
170 | Buffer outputbuffer; |
|
|
171 | |
162 | |
172 | char *ACC (RW, host); /* Which host it is connected from (ip address) */ |
163 | char *ACC (RW, host); /* Which host it is connected from (ip address) */ |
173 | uint8 ACC (RW, state); /* Input state of the player (name, password, etc */ |
164 | uint8 ACC (RW, state); /* Input state of the player (name, password, etc */ |
174 | |
165 | |
175 | sint8 ACC (RW, last_level); /* Last level we sent to client */ |
166 | sint8 ACC (RW, last_level); /* Last level we sent to client */ |
… | |
… | |
184 | float ACC (RW, last_speed); /* Last speed as sent to client */ |
175 | float ACC (RW, last_speed); /* Last speed as sent to client */ |
185 | sint16 ACC (RW, last_resist[NROFATTACKS]);/* last resist values sent to client */ |
176 | sint16 ACC (RW, last_resist[NROFATTACKS]);/* last resist values sent to client */ |
186 | sint64 ACC (RW, last_skill_exp[NUM_SKILLS]);/* shadow register. if != exp. obj update client */ |
177 | sint64 ACC (RW, last_skill_exp[NUM_SKILLS]);/* shadow register. if != exp. obj update client */ |
187 | |
178 | |
188 | bool ACC (RW, afk); /* player is afk */ |
179 | bool ACC (RW, afk); /* player is afk */ |
189 | bool ACC (RW, facecache); /* If true, client is caching images */ |
|
|
190 | bool ACC (RW, sent_scroll); |
180 | bool ACC (RW, sent_scroll); |
191 | bool ACC (RW, sound); /* does the client want sound */ |
181 | bool ACC (RW, sound); /* does the client want sound */ |
192 | bool ACC (RW, newmapcmd); /* Send newmap command when entering new map SMACFIGGEN */ |
182 | bool ACC (RW, newmapcmd); /* Send newmap command when entering new map SMACFIGGEN */ |
193 | bool ACC (RW, plugincmd); /* CF+ extend the protocol through a plug-in */ |
183 | bool ACC (RW, plugincmd); // extend the protocol through a plug-in */ |
194 | bool ACC (RW, mapinfocmd); /* CF+ return map info and send map change info */ |
184 | bool ACC (RW, mapinfocmd); // return map info and send map change info |
195 | bool ACC (RW, extcmd); /* CF+ call into extensions/plugins */ |
185 | uint8_t ACC (RW, extcmd); // call into extensions/plugins |
196 | bool ACC (RW, extmap); /* CF+ extend map comamnd with extra data */ |
186 | bool ACC (RW, extmap); // extend map command with extra data |
197 | bool ACC (RW, buggy_mapscroll); /* CF+ client crashes on large mapscrolls */ |
|
|
198 | bool ACC (RW, force_face0); /* CF+ client workaround for buggy checksum calculation in gcfclient */ |
|
|
199 | bool ACC (RW, force_bad_checksum); /* CF+ client workaround for buggy checksum calculation in gcfclient */ |
|
|
200 | bool ACC (RW, darkness); /* True if client wants darkness information */ |
|
|
201 | bool ACC (RW, image2); /* Client wants image2/face2 commands */ |
|
|
202 | bool ACC (RW, update_look); /* If true, we need to send the look window */ |
187 | bool ACC (RW, update_look); /* If true, we need to send the look window */ |
203 | bool ACC (RW, has_readable_type); /* If true client accept additional text information */ |
188 | bool ACC (RW, has_readable_type); /* If true client accept additional text information */ |
204 | /* used to arrange text in books, scrolls, or scripted dialogs */ |
189 | /* used to arrange text in books, scrolls, or scripted dialogs */ |
205 | bool ACC (RW, monitor_spells); /* Client wishes to be informed when their spell list changes */ |
190 | bool ACC (RW, monitor_spells); /* Client wishes to be informed when their spell list changes */ |
206 | bool ACC (RW, ext_mapinfos); /* If true client accepts additional info on maps */ |
191 | bool ACC (RW, smoothing); // deliantra-style smoothing |
207 | /* Below are flags for extedend infos to pass to client |
192 | bool ACC (RW, can_msg); // deliantra-style text messages |
208 | * with S->C mapextended command */ |
|
|
209 | bool ACC (RW, EMI_smooth); /* Send smooth in extendmapinfos */ |
|
|
210 | |
193 | |
|
|
194 | bool ACC (RW, force_newmap); // force a newmap before next map update |
211 | uint32 ACC (RW, supported_readables); /* each bit is a readable supported by client */ |
195 | uint32 ACC (RW, supported_readables); /* each bit is a readable supported by client */ |
212 | uint32 ACC (RW, cs_version), ACC (RW, sc_version); /* versions of the client */ |
196 | uint32 ACC (RW, cs_version), ACC (RW, sc_version); /* versions of the client */ |
213 | enum MapMode mapmode; /* Type of map commands the client wants. */ |
|
|
214 | uint16 ACC (RW, look_position); /* start of drawing of look window */ |
197 | uint16 ACC (RW, look_position); /* start of drawing of look window */ |
|
|
198 | uint16 ACC (RW, mss); // likely tcp maximum segment size |
|
|
199 | uint8 ACC (RW, mapmode); /* Type of map commands the client wants. */ |
215 | uint8 ACC (RW, mapx), ACC (RW, mapy); /* How large a map the client wants */ |
200 | uint8 ACC (RW, mapx), ACC (RW, mapy); /* How large a map the client wants */ |
216 | uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */ |
201 | uint8 ACC (RW, itemcmd); /* What version of the 'item' protocol command to use */ |
217 | |
202 | |
218 | maptile *ACC (RW, current_map); // CF+ last/current player map |
203 | maptile_ptr ACC (RW, current_map); // CF+ last/current player map |
219 | region *ACC (RW, current_region); // CF+ last/current player region |
204 | region_ptr ACC (RW, current_region); // CF+ last/current player region |
220 | int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position |
205 | int ACC (RW, current_x), ACC (RW, current_y); // CF+ last/current map position |
221 | char ACC (RW, version)[64]; // CF+ client name/version |
206 | shstr ACC (RW, version); // CF+ client name/version |
222 | uint8 ACC (RW, faceset); // CF+ selected faceset |
207 | uint8 ACC (RW, faceset); // CF+ selected faceset |
223 | |
208 | |
224 | player_ptr ACC (RO, pl); |
209 | tstamp ACC (RW, last_send); // last data send on socket. |
225 | |
210 | |
226 | int ACC (RW, rtt), ACC (RW, rttvar); /* round-trip time and -variance, if known */ |
211 | int ACC (RW, rate_avail); // current rate balance |
|
|
212 | int ACC (RW, max_rate); // max. # of bytes to send per tick |
|
|
213 | faceidx ACC (RW, scrub_idx); // which face to send next |
|
|
214 | int ACC (RW, bg_scrub); // how many ticks till the next background face send |
|
|
215 | |
|
|
216 | struct tcp_info tcpi; |
|
|
217 | tstamp next_rate_adjust; |
|
|
218 | |
|
|
219 | unordered_vector<char *> mapinfo_queue; |
|
|
220 | void mapinfo_queue_clear (); |
|
|
221 | void mapinfo_queue_run (); |
|
|
222 | bool mapinfo_try (char *buf); |
|
|
223 | |
|
|
224 | struct ixsend { |
|
|
225 | int16_t pri; // unused |
|
|
226 | faceidx idx; |
|
|
227 | uint32_t ofs; // if != 0, need to send remaining bytes of partial_face |
|
|
228 | }; |
|
|
229 | std::vector<ixsend, slice_allocator<ixsend> > ixface; // which faces to send to the client using ix |
|
|
230 | |
|
|
231 | std::vector<faceidx, slice_allocator<faceidx> > fxface; // which faces to send using fx |
|
|
232 | MTH void flush_fx (); // send fx if required |
227 | |
233 | |
228 | void do_destroy (); |
234 | void do_destroy (); |
229 | void gather_callbacks (AV *&callbacks, event_type event) const; |
235 | void gather_callbacks (AV *&callbacks, event_type event) const; |
230 | |
236 | |
231 | iow socket_ev; void socket_cb (iow &w, int got); |
237 | iow socket_ev; void socket_cb (iow &w, int revents); |
232 | iw cmd_ev; void cmd_cb (iw &w); |
|
|
233 | client_container cc_inv, cc_other; |
|
|
234 | |
238 | |
235 | std::deque< command, slice_allocator<command> > cmd_queue; |
239 | std::deque< command, slice_allocator<command> > cmd_queue; |
236 | |
240 | |
237 | // large structures at the end please |
241 | // large structures at the end please |
238 | struct Map lastmap; |
242 | struct Map lastmap; |
239 | std::bitset<MAXANIMNUM> anims_sent; |
243 | std::bitset<MAXANIMNUM> anims_sent; |
240 | std::bitset<MAX_FACES> faces_sent; |
244 | std::bitset<MAX_FACES> faces_sent; |
|
|
245 | std::bitset<FT_NUM> fx_want; |
241 | |
246 | |
242 | // if we get an incomplete packet, this is used to hold the data. |
247 | // if we get an incomplete packet, this is used to hold the data. |
243 | // we add 2 byte for the header, one for the trailing 0 byte |
248 | // we add 2 byte for the header, one for the trailing 0 byte |
244 | uint8 inbuf[MAXSOCKBUF + 2 + 1]; |
249 | uint8 inbuf[MAXSOCKBUF + 2 + 1]; |
|
|
250 | |
|
|
251 | enum { MSG_BUF_SIZE = 80, MSG_BUF_COUNT = 10 }; |
|
|
252 | struct msg_buf |
|
|
253 | { |
|
|
254 | tick_t expire; |
|
|
255 | int len; |
|
|
256 | int count; |
|
|
257 | char msg[MSG_BUF_SIZE]; |
|
|
258 | } msgbuf[MSG_BUF_COUNT]; |
|
|
259 | |
|
|
260 | MTH bool msg_suppressed (const char *msg); |
|
|
261 | |
|
|
262 | /* The following is the setup for a ring buffer for storing output |
|
|
263 | * data that the OS can't handle right away. |
|
|
264 | * TODO: this member is enourmously large - optimise? |
|
|
265 | */ |
|
|
266 | struct |
|
|
267 | { |
|
|
268 | char data[SOCKETBUFSIZE]; |
|
|
269 | int start; |
|
|
270 | int len; |
|
|
271 | } outputbuffer; |
245 | |
272 | |
246 | bool may_execute (const packet_type *pkt) const; |
273 | bool may_execute (const packet_type *pkt) const; |
247 | void execute (const packet_type *pkt, char *data, int datalen); |
274 | void execute (const packet_type *pkt, char *data, int datalen); |
248 | |
275 | |
249 | void queue_command (packet_type *handler, char *data, int datalen); |
276 | void queue_command (packet_type *handler, char *data, int datalen); |
… | |
… | |
257 | int next_packet (); // returns length of packet or 0 |
284 | int next_packet (); // returns length of packet or 0 |
258 | void skip_packet (int len); // we have processed the packet, skip it |
285 | void skip_packet (int len); // we have processed the packet, skip it |
259 | |
286 | |
260 | MTH void flush (); |
287 | MTH void flush (); |
261 | MTH void write_outputbuffer (); |
288 | MTH void write_outputbuffer (); |
|
|
289 | MTH int outputbuffer_len () const { return outputbuffer.len; } |
262 | void send (void *buf_, int len); |
290 | void send (void *buf_, int len); |
263 | |
291 | |
264 | void send_packet (const char *buf); |
292 | void send_packet (const char *buf); |
265 | void send_packet (const char *buf, int len); |
293 | void send_packet (const char *buf, int len); |
266 | void send_packet_printf (const char *format, ...); |
294 | void send_packet_printf (const char *format, ...); |
267 | void send_packet (packet &sl); |
295 | void send_packet (packet &sl); |
268 | |
296 | |
269 | void send_drawinfo (const char *msg, int flags = NDI_BLACK); |
297 | void send_drawinfo (const char *msg, int flags = NDI_BLACK); |
|
|
298 | |
270 | MTH void send_face (faceidx facenum, bool nocache = false); |
299 | MTH void send_face (faceidx facenum, int pri = 0); |
271 | MTH void send_faces (object *ob); |
300 | MTH void send_faces (object *ob); |
272 | MTH void send_animation (short anim_num); |
301 | MTH void send_animation (short anim_num); |
|
|
302 | void send_msg (int color, const char *type, const char *msg); |
273 | |
303 | |
|
|
304 | MTH void play_sound (faceidx sound, int dx = 0, int dy = 0); |
274 | // called when something under the player changes |
305 | // called when something under the player changes |
275 | MTH void floorbox_update () { update_look = 1; } |
306 | MTH void floorbox_update () { update_look = 1; } |
276 | // called when the player has been moved |
307 | // called when the player has been moved |
277 | MTH void floorbox_reset () { look_position = 0; floorbox_update (); } |
308 | MTH void floorbox_reset () { look_position = 0; floorbox_update (); } |
278 | |
309 | |
|
|
310 | MTH void tick (); // called every server tick to do housekeeping etc. |
|
|
311 | |
279 | MTH static client *create (int fd, const char *peername); |
312 | MTH static client *create (int fd, const char *peername); |
|
|
313 | MTH static void clock (); |
|
|
314 | MTH static void flush_sockets (); |
280 | |
315 | |
281 | protected: |
316 | protected: |
282 | client (int fd, const char *from_ip); |
317 | client (int fd, const char *from_ip); |
283 | ~client (); |
318 | ~client (); |
284 | }; |
319 | }; |
|
|
320 | |
|
|
321 | #if FOR_PERL |
|
|
322 | ACC (RW, tcpi.tcpi_state); |
|
|
323 | ACC (RW, tcpi.tcpi_ca_state); |
|
|
324 | ACC (RW, tcpi.tcpi_retransmits); |
|
|
325 | ACC (RW, tcpi.tcpi_probes); |
|
|
326 | ACC (RW, tcpi.tcpi_backoff); |
|
|
327 | ACC (RW, tcpi.tcpi_options); |
|
|
328 | ACC (RO, tcpi.tcpi_snd_wscale); |
|
|
329 | ACC (RO, tcpi.tcpi_rcv_wscale); |
|
|
330 | ACC (RW, tcpi.tcpi_rto); |
|
|
331 | ACC (RW, tcpi.tcpi_ato); |
|
|
332 | ACC (RW, tcpi.tcpi_snd_mss); |
|
|
333 | ACC (RW, tcpi.tcpi_rcv_mss); |
|
|
334 | ACC (RW, tcpi.tcpi_unacked); |
|
|
335 | ACC (RW, tcpi.tcpi_sacked); |
|
|
336 | ACC (RW, tcpi.tcpi_lost); |
|
|
337 | ACC (RW, tcpi.tcpi_retrans); |
|
|
338 | ACC (RW, tcpi.tcpi_fackets); |
|
|
339 | ACC (RW, tcpi.tcpi_last_data_sent); |
|
|
340 | ACC (RW, tcpi.tcpi_last_ack_sent); |
|
|
341 | ACC (RW, tcpi.tcpi_last_data_recv); |
|
|
342 | ACC (RW, tcpi.tcpi_last_ack_recv); |
|
|
343 | ACC (RW, tcpi.tcpi_pmtu); |
|
|
344 | ACC (RW, tcpi.tcpi_rcv_ssthresh); |
|
|
345 | ACC (RW, tcpi.tcpi_rtt); |
|
|
346 | ACC (RW, tcpi.tcpi_rttvar); |
|
|
347 | ACC (RW, tcpi.tcpi_snd_ssthresh); |
|
|
348 | ACC (RW, tcpi.tcpi_snd_cwnd); |
|
|
349 | ACC (RW, tcpi.tcpi_advmss); |
|
|
350 | ACC (RW, tcpi.tcpi_reordering); |
|
|
351 | #endif |
285 | |
352 | |
286 | #define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\ |
353 | #define CLIENT_SUPPORT_READABLES(__sockPtr,__type)\ |
287 | ( ((__type)>0) &&\ |
354 | ( ((__type)>0) &&\ |
288 | ((__sockPtr)->has_readable_type) && \ |
355 | ((__sockPtr)->has_readable_type) && \ |
289 | ((__sockPtr)->supported_readables & (1<<(__type))) ) |
356 | ((__sockPtr)->supported_readables & (1<<(__type))) ) |
290 | |
357 | |
291 | /* Constants in the form EMI_ is for extended map infos. |
|
|
292 | * Even if the client select the additionnal infos it wants |
|
|
293 | * on the map, there may exist cases where this whole info |
|
|
294 | * is not given in one buch but in separate bunches. This |
|
|
295 | * is done performance reasons (imagine some info related to |
|
|
296 | * a visible object and another info related to a 4 square |
|
|
297 | * width and height area). At the begin of an extended info packet |
|
|
298 | * is a bit field. A bit is activated for each extended info |
|
|
299 | * present in the data |
|
|
300 | */ |
|
|
301 | |
|
|
302 | /* Meanings: |
|
|
303 | * EMI_NOREDRAW Take extended infos into account but don't redraw, |
|
|
304 | * some additionnal datas will follow in a new packet |
|
|
305 | * EMI_SMOOTH Datas about smoothing |
|
|
306 | */ |
|
|
307 | #define EMI_NOREDRAW 0x01 |
|
|
308 | #define EMI_SMOOTH 0x02 |
|
|
309 | |
|
|
310 | /* this last one says the bitfield continue un next byte |
|
|
311 | * There may be several on contiguous bytes. So there is 7 |
|
|
312 | * actual bits used per byte, and the number of bytes |
|
|
313 | * is not fixed in protocol |
|
|
314 | */ |
|
|
315 | #define EMI_HASMOREBITS 0x80 |
|
|
316 | |
|
|
317 | #define FACE_TYPES 1 |
358 | #define FACE_TYPES 1 |
318 | #define PNG_FACE_INDEX 0 |
359 | #define PNG_FACE_INDEX 0 |
319 | |
360 | |
320 | #define VERSION_CS 1023 /* version >= 1023 understand setup cmd */ |
361 | #define VERSION_CS 1023 /* version >= 1023 understand setup cmd */ |
321 | #define VERSION_SC 1026 |
362 | #define VERSION_SC 1026 |
322 | //#define VERSION_SC 1027 // requestinfo image_info and image_sums, makes extending faces on the fly impossible |
363 | //#define VERSION_SC 1027 // requestinfo image_info and image_sums, makes extending faces on the fly impossible |
323 | #define VERSION_INFO "Crossfire+ Server" |
364 | #define VERSION_INFO "Deliantra Server" |
324 | |
365 | |
325 | typedef object_vector<client, &client::active> sockvec; |
366 | typedef object_vector<client, &client::active> sockvec; |
326 | |
367 | |
327 | extern sockvec clients; |
368 | extern sockvec clients; |
328 | |
369 | |
329 | #define for_all_clients(var) \ |
370 | #define for_all_clients(var) \ |
330 | for (int _i = 0; _i < clients.size (); ++_i) \ |
371 | for (int _i = 0; _i < clients.size (); ++_i) \ |
331 | declvar (client *, var, clients [_i]) |
372 | statementvar (client *, var, clients [_i]) |
|
|
373 | |
|
|
374 | // returns true when the message needs special (read: perl) treatment |
|
|
375 | static inline bool |
|
|
376 | msg_is_special (const char *msg, bool nl_special = true) |
|
|
377 | { |
|
|
378 | return msg [strcspn (msg, nl_special ? "<&\n" : "<&")]; |
|
|
379 | } |
332 | |
380 | |
333 | #endif |
381 | #endif |
334 | |
382 | |