| 1 | /* |
1 | /* |
| 2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
| 3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
| 4 | Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team |
5 | * Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team |
| 5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
| 6 | |
7 | * |
| 7 | This program is free software; you can redistribute it and/or modify |
8 | * 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 | * 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 | * the Free Software Foundation; either version 2 of the License, or |
| 10 | (at your option) any later version. |
11 | * (at your option) any later version. |
| 11 | |
12 | * |
| 12 | 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, |
| 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
| 16 | |
17 | * |
| 17 | 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 |
| 18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
| 19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 20 | |
21 | * |
| 21 | The author can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
| 22 | */ |
23 | */ |
| 23 | |
24 | |
| 24 | /** |
25 | /** |
| 25 | * \file |
26 | * \file |
| 26 | * Main client/server loops. |
27 | * Main client/server loops. |
| 27 | * |
28 | * |
| 28 | * \date 2003-12-02 |
29 | * \date 2003-12-02 |
| 29 | * |
30 | * |
| 30 | * loop.c mainly deals with initialization and higher level socket |
31 | * loop.c mainly deals with initialization and higher level socket |
| 31 | * maintenance (checking for lost connections and if data has arrived.) |
32 | * maintanance (checking for lost connections and if data has arrived.) |
| 32 | * The reading of data is handled in ericserver.c |
|
|
| 33 | */ |
33 | */ |
| 34 | |
34 | |
|
|
35 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
| 35 | |
36 | |
| 36 | #include <global.h> |
37 | #include <global.h> |
| 37 | #include <sproto.h> |
38 | #include <sproto.h> |
| 38 | #include <sockproto.h> |
39 | #include <sockproto.h> |
| 39 | |
40 | |
| … | |
… | |
| 46 | #include <unistd.h> |
47 | #include <unistd.h> |
| 47 | #include <arpa/inet.h> |
48 | #include <arpa/inet.h> |
| 48 | |
49 | |
| 49 | #include <loader.h> |
50 | #include <loader.h> |
| 50 | |
51 | |
| 51 | /***************************************************************************** |
52 | #define MAX_QUEUE_DEPTH 500 //TODO |
| 52 | * Start of command dispatch area. |
53 | #define MAX_QUEUE_BACKLOG 3. //TODO |
| 53 | * The commands here are protocol commands. |
|
|
| 54 | ****************************************************************************/ |
|
|
| 55 | |
54 | |
| 56 | /* Either keep this near the start or end of the file so it is |
55 | void |
| 57 | * at least reasonablye easy to find. |
56 | client::reset_state () |
| 58 | * There are really 2 commands - those which are sent/received |
|
|
| 59 | * before player joins, and those happen after the player has joined. |
|
|
| 60 | * As such, we have function types that might be called, so |
|
|
| 61 | * we end up having 2 tables. |
|
|
| 62 | */ |
|
|
| 63 | |
|
|
| 64 | enum { |
|
|
| 65 | PF_PLAYER = 0x01, // must have valid player |
|
|
| 66 | PF_IMMEDIATE = 0x02, // TODO: hack, can be executed immediately |
|
|
| 67 | PF_PLAYING = 0x04, // must be in playing state |
|
|
| 68 | }; |
|
|
| 69 | |
|
|
| 70 | struct pkt_type |
|
|
| 71 | { |
57 | { |
| 72 | const char *name; |
58 | if (!pl) |
| 73 | void *cb; |
59 | return; |
| 74 | int flags; |
|
|
| 75 | |
60 | |
| 76 | bool may_execute (client *ns) |
61 | pl->run_on = 0; |
|
|
62 | pl->fire_on = 0; |
|
|
63 | } |
|
|
64 | |
|
|
65 | void |
|
|
66 | client::queue_command (packet_type *handler, char *data, int datalen) |
|
|
67 | { |
|
|
68 | tstamp stamp = now (); |
|
|
69 | |
|
|
70 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
| 77 | { |
71 | { |
| 78 | return (!(flags & PF_PLAYER) || ns->pl) |
72 | //TODO: just disconnect here? |
| 79 | && (!(flags & PF_PLAYING) || (ns->pl && ns->pl->state == ST_PLAYING)); |
73 | reset_state (); |
|
|
74 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
| 80 | } |
75 | } |
| 81 | |
|
|
| 82 | void execute (client *ns, char *data, int datalen) |
|
|
| 83 | { |
|
|
| 84 | //TODO: only one format |
|
|
| 85 | if (flags & PF_PLAYER) |
|
|
| 86 | ((void (*)(char *, int, player * ))cb)((char *)data, datalen, ns->pl); |
|
|
| 87 | else |
76 | else |
| 88 | ((void (*)(char *, int, client *))cb)((char *)data, datalen, ns); |
77 | { |
| 89 | } |
78 | cmd_queue.push_back (command ()); |
| 90 | }; |
79 | command &cmd = cmd_queue.back (); |
| 91 | |
80 | cmd.stamp = stamp; |
| 92 | // SocketCommand, PlayingCommand, should not exist with those ugly casts |
81 | cmd.handler = handler; |
| 93 | #define SC(cb) (void *)static_cast<void (*)(char *, int, client *)>(cb), |
82 | cmd.data = salloc<char> (datalen + 1, data); |
| 94 | #define PC(cb) (void *)static_cast<void (*)(char *, int, player *)>(cb), PF_PLAYER | |
83 | cmd.datalen = datalen; |
| 95 | |
|
|
| 96 | /** |
|
|
| 97 | * Dispatch table for the server. |
|
|
| 98 | */ |
|
|
| 99 | static struct pkt_type packets[] = { |
|
|
| 100 | {"ncom", PC(NewPlayerCmd) PF_PLAYING }, |
|
|
| 101 | {"command", PC(PlayerCmd) PF_PLAYING }, |
|
|
| 102 | |
|
|
| 103 | {"examine", PC(ExamineCmd) PF_PLAYING | PF_IMMEDIATE }, |
|
|
| 104 | {"apply", PC(ApplyCmd) PF_PLAYING | PF_IMMEDIATE }, |
|
|
| 105 | {"reply", PC(ReplyCmd) PF_IMMEDIATE }, |
|
|
| 106 | {"lookat", PC(LookAt) PF_PLAYING | PF_IMMEDIATE }, |
|
|
| 107 | {"lock", PC(LockItem) PF_PLAYING | PF_IMMEDIATE }, |
|
|
| 108 | {"mark", PC(MarkItem) PF_PLAYING | PF_IMMEDIATE }, |
|
|
| 109 | {"move", PC(MoveCmd) PF_PLAYING | PF_IMMEDIATE }, |
|
|
| 110 | {"ext", PC(ExtCmd) PF_IMMEDIATE }, /* CF+ */ |
|
|
| 111 | {"mapredraw", PC(MapRedrawCmd) PF_IMMEDIATE }, /* Added: phil */ |
|
|
| 112 | {"mapinfo", PC(MapInfoCmd) PF_IMMEDIATE }, /* CF+ */ |
|
|
| 113 | |
|
|
| 114 | {"addme", SC(AddMeCmd) PF_IMMEDIATE }, |
|
|
| 115 | {"askface", SC(SendFaceCmd) 0 }, /* Added: phil */ |
|
|
| 116 | {"requestinfo", SC(RequestInfo) 0 }, |
|
|
| 117 | {"setfacemode", SC(SetFaceMode) PF_IMMEDIATE }, |
|
|
| 118 | {"setsound", SC(SetSound) PF_IMMEDIATE }, |
|
|
| 119 | {"setup", SC(SetUp) PF_IMMEDIATE }, |
|
|
| 120 | {"version", SC(VersionCmd) PF_IMMEDIATE }, |
|
|
| 121 | {"toggleextendedinfos", SC(ToggleExtendedInfos) PF_IMMEDIATE }, /*Added: tchize */ |
|
|
| 122 | {"toggleextendedtext", SC(ToggleExtendedText) PF_IMMEDIATE }, /*Added: tchize */ |
|
|
| 123 | {"asksmooth", SC(AskSmooth) 0 }, /*Added: tchize (smoothing technologies) */ |
|
|
| 124 | }; |
|
|
| 125 | |
|
|
| 126 | /** |
|
|
| 127 | * Handle client input. |
|
|
| 128 | * |
|
|
| 129 | * HandleClient is actually not named really well - we only get here once |
|
|
| 130 | * there is input, so we don't do exception or other stuff here. |
|
|
| 131 | * sock is the output socket information. pl is the player associated |
|
|
| 132 | * with this socket, null if no player (one of the init_sockets for just |
|
|
| 133 | * starting a connection) |
|
|
| 134 | */ |
|
|
| 135 | void |
|
|
| 136 | HandleClient (client *ns, player *pl) |
|
|
| 137 | { |
|
|
| 138 | /* Loop through this - maybe we have several complete packets here. */ |
|
|
| 139 | // limit to a few commands only, though, as to not monopolise the server |
|
|
| 140 | for (int repeat = 16; repeat--;) |
|
|
| 141 | { |
84 | } |
| 142 | /* If it is a player, and they don't have any speed left, we |
85 | } |
| 143 | * return, and will read in the data when they do have time. |
86 | |
| 144 | */ |
87 | bool |
|
|
88 | client::handle_command () |
|
|
89 | { |
|
|
90 | bool skipping = false; |
|
|
91 | |
|
|
92 | while (!cmd_queue.empty () |
| 145 | if (pl && pl->state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0) |
93 | && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0)) |
| 146 | return; |
94 | { |
|
|
95 | command &cmd = cmd_queue.front (); |
| 147 | |
96 | |
| 148 | int pkt_len = ns->read_packet (); |
97 | if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) |
| 149 | |
|
|
| 150 | if (pkt_len < 0) |
|
|
| 151 | { |
98 | { |
| 152 | LOG (llevError, "read error on player %s\n", &pl->ob->name); |
99 | if (!skipping) |
| 153 | /* Caller will take care of cleaning this up */ |
|
|
| 154 | ns->status = Ns_Dead; |
|
|
| 155 | return; |
|
|
| 156 | } |
|
|
| 157 | else if (pkt_len == 0) |
|
|
| 158 | /* Still dont have a full packet */ |
|
|
| 159 | return; |
|
|
| 160 | |
|
|
| 161 | /* First, break out beginning word. There are at least |
|
|
| 162 | * a few commands that do not have any paremeters. If |
|
|
| 163 | * we get such a command, don't worry about trying |
|
|
| 164 | * to break it up. |
|
|
| 165 | */ |
|
|
| 166 | int datalen; |
|
|
| 167 | char *data = strchr ((char *)ns->inbuf + 2, ' '); |
|
|
| 168 | |
|
|
| 169 | if (data) |
|
|
| 170 | { |
100 | { |
| 171 | *data++ = 0; |
101 | skipping = true; |
| 172 | datalen = pkt_len - (data - (char *)ns->inbuf); |
102 | reset_state (); |
|
|
103 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
|
|
104 | } |
|
|
105 | |
|
|
106 | cmd_queue.pop_front (); |
| 173 | } |
107 | } |
| 174 | else |
108 | else |
| 175 | { |
109 | { |
| 176 | data = (char *)ns->inbuf + 2; // better read garbage than segfault |
110 | execute (cmd.handler, cmd.data, cmd.datalen); |
| 177 | datalen = 0; |
111 | cmd_queue.pop_front (); |
|
|
112 | return true; |
| 178 | } |
113 | } |
| 179 | |
|
|
| 180 | ns->inbuf [pkt_len] = 0; /* Terminate buffer - useful for string data */ |
|
|
| 181 | |
|
|
| 182 | for (pkt_type *pkt = packets; pkt < packets + (sizeof (packets) / sizeof (packets[0])); ++pkt) |
|
|
| 183 | if (!strcmp ((char *)ns->inbuf + 2, pkt->name)) |
|
|
| 184 | { |
|
|
| 185 | if (pkt->may_execute (ns)) |
|
|
| 186 | { |
|
|
| 187 | pkt->execute (ns, data, datalen); |
|
|
| 188 | ns->skip_packet (pkt_len); |
|
|
| 189 | //D//TODO not doing this causes random memory corruption |
|
|
| 190 | if (pkt->flags & PF_IMMEDIATE) |
|
|
| 191 | goto next_packet; |
|
|
| 192 | return; |
|
|
| 193 | } |
|
|
| 194 | } |
|
|
| 195 | |
|
|
| 196 | /* If we get here, we didn't find a valid command. Logging |
|
|
| 197 | * this might be questionable, because a broken client/malicious |
|
|
| 198 | * user could certainly send a whole bunch of invalid commands. |
|
|
| 199 | */ |
|
|
| 200 | LOG (llevDebug, "Bad command from client (%s)\n", ns->inbuf + 2); |
|
|
| 201 | ns->skip_packet (pkt_len); |
|
|
| 202 | next_packet: |
|
|
| 203 | ; |
|
|
| 204 | } |
114 | } |
|
|
115 | |
|
|
116 | return false; |
| 205 | } |
117 | } |
| 206 | |
118 | |
| 207 | void |
119 | void |
| 208 | flush_sockets (void) |
120 | flush_sockets (void) |
| 209 | { |
121 | { |
| 210 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
122 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
| 211 | if ((*i)->status != Ns_Dead) |
|
|
| 212 | (*i)->flush (); |
123 | (*i)->flush (); |
| 213 | } |
124 | } |
| 214 | |
125 | |
| 215 | /** |
126 | /** |
| 216 | * This checks the sockets for input, does the right thing. |
127 | * This checks the sockets for input, does the right thing. |
| 217 | * |
128 | * |
| … | |
… | |
| 220 | * |
131 | * |
| 221 | */ |
132 | */ |
| 222 | void |
133 | void |
| 223 | doeric_server (void) |
134 | doeric_server (void) |
| 224 | { |
135 | { |
| 225 | int i, pollret; |
|
|
| 226 | fd_set tmp_read; |
|
|
| 227 | struct sockaddr_in addr; |
|
|
| 228 | socklen_t addrlen = sizeof (struct sockaddr); |
|
|
| 229 | player *pl, *next; |
|
|
| 230 | int maxfd = 0; |
|
|
| 231 | |
|
|
| 232 | #ifdef CS_LOGSTATS |
136 | #ifdef CS_LOGSTATS |
| 233 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
137 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
| 234 | write_cs_stats (); |
138 | write_cs_stats (); |
| 235 | #endif |
139 | #endif |
| 236 | |
140 | |
| 237 | /* Go through the players. Let the loop set the next pl value, |
141 | //TODO: should not be done here, either |
| 238 | * since we may remove some |
142 | for (unsigned i = 0; i < clients.size (); ++i) |
|
|
143 | { |
|
|
144 | client *ns = clients [i]; |
|
|
145 | |
|
|
146 | ns->tick (); |
|
|
147 | ns->refcnt_chk (); |
|
|
148 | } |
|
|
149 | } |
|
|
150 | |
|
|
151 | void |
|
|
152 | client::tick () |
|
|
153 | { |
|
|
154 | if (!pl || destroyed ()) |
|
|
155 | return; |
|
|
156 | |
|
|
157 | /* Update the players stats once per tick. More efficient than |
|
|
158 | * sending them whenever they change, and probably just as useful |
| 239 | */ |
159 | */ |
| 240 | //TODO: must be handled cleanly elsewhere |
|
|
| 241 | for (pl = first_player; pl; ) |
|
|
| 242 | { |
|
|
| 243 | player *npl = pl->next; |
|
|
| 244 | |
|
|
| 245 | //TODO: must be handled cleanly elsewhere |
|
|
| 246 | if (pl->socket->status == Ns_Dead) |
|
|
| 247 | { |
|
|
| 248 | save_player (pl->ob, 0); |
|
|
| 249 | |
|
|
| 250 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
| 251 | { |
|
|
| 252 | terminate_all_pets (pl->ob); |
|
|
| 253 | pl->ob->remove (); |
|
|
| 254 | } |
|
|
| 255 | |
|
|
| 256 | leave (pl, 1); |
|
|
| 257 | final_free_player (pl); |
|
|
| 258 | } |
|
|
| 259 | |
|
|
| 260 | pl = npl; |
|
|
| 261 | } |
|
|
| 262 | |
|
|
| 263 | FD_ZERO (&tmp_read); |
|
|
| 264 | |
|
|
| 265 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ) |
|
|
| 266 | { |
|
|
| 267 | client *s = *i; |
|
|
| 268 | |
|
|
| 269 | if (s->status == Ns_Dead) |
|
|
| 270 | { |
|
|
| 271 | clients.erase (i); |
|
|
| 272 | delete s; |
|
|
| 273 | } |
|
|
| 274 | else |
|
|
| 275 | { |
|
|
| 276 | if (s->fd > maxfd) maxfd = s->fd; |
|
|
| 277 | |
|
|
| 278 | FD_SET (s->fd, &tmp_read); |
|
|
| 279 | |
|
|
| 280 | ++i; |
|
|
| 281 | } |
|
|
| 282 | } |
|
|
| 283 | |
|
|
| 284 | struct timeval timeout; |
|
|
| 285 | |
|
|
| 286 | timeout.tv_sec = 0; |
|
|
| 287 | timeout.tv_usec = 0; |
|
|
| 288 | |
|
|
| 289 | pollret = select (maxfd + 1, |
|
|
| 290 | &tmp_read, 0, 0, |
|
|
| 291 | &timeout); |
|
|
| 292 | |
|
|
| 293 | if (pollret == -1) |
|
|
| 294 | { |
|
|
| 295 | LOG (llevError, "select failed: %s\n", strerror (errno)); |
|
|
| 296 | return; |
|
|
| 297 | } |
|
|
| 298 | |
|
|
| 299 | /* We need to do some of the processing below regardless */ |
|
|
| 300 | |
|
|
| 301 | /* Check for any input on the sockets */ |
|
|
| 302 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
| 303 | { |
|
|
| 304 | client *s = *i; |
|
|
| 305 | player *pl = s->pl; |
|
|
| 306 | |
|
|
| 307 | //TODO: disassociate handleclient from socket readin |
|
|
| 308 | if (s->inbuf_len || FD_ISSET (s->fd, &tmp_read)) |
|
|
| 309 | HandleClient (s, pl); |
|
|
| 310 | |
|
|
| 311 | //TODO: should not be done here, either |
|
|
| 312 | if (s->status != Ns_Dead && pl) |
|
|
| 313 | { |
|
|
| 314 | /* Update the players stats once per tick. More efficient than |
|
|
| 315 | * sending them whenever they change, and probably just as useful |
|
|
| 316 | */ |
|
|
| 317 | esrv_update_stats (pl); |
160 | esrv_update_stats (pl); |
|
|
161 | |
| 318 | if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob)) |
162 | if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) |
| 319 | { |
163 | { |
| 320 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
164 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
| 321 | if (pl->last_weight != WEIGHT (pl->ob)) |
165 | if (last_weight != WEIGHT (pl->ob)) |
| 322 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
166 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
| 323 | (unsigned long) pl->last_weight, WEIGHT (pl->ob)); |
167 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
|
|
168 | } |
|
|
169 | |
|
|
170 | draw_client_map (pl->ob); |
|
|
171 | |
|
|
172 | if (update_look) |
|
|
173 | esrv_draw_look (pl->ob); |
|
|
174 | |
|
|
175 | if (askface.empty ()) |
|
|
176 | { |
|
|
177 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
|
|
178 | while (scrub_idx < faces.size () - 1) |
|
|
179 | { |
|
|
180 | ++scrub_idx; |
|
|
181 | if (!faces_sent [scrub_idx]) |
|
|
182 | { |
|
|
183 | send_face (scrub_idx); |
|
|
184 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
|
|
185 | break; |
| 324 | } |
186 | } |
| 325 | |
|
|
| 326 | /* draw_client_map does sanity checking that map is |
|
|
| 327 | * valid, so don't do it here. |
|
|
| 328 | */ |
|
|
| 329 | draw_client_map (pl->ob); |
|
|
| 330 | if (s->update_look) |
|
|
| 331 | esrv_draw_look (pl->ob); |
|
|
| 332 | } |
187 | } |
|
|
188 | } |
|
|
189 | else |
|
|
190 | while (!askface.empty () && outputbuffer_len () < max_rate) |
|
|
191 | { |
|
|
192 | // use a lifo to send most recently requested images |
|
|
193 | faceidx face = askface.back (); |
|
|
194 | askface.pop_back (); |
|
|
195 | |
|
|
196 | send_image (face); |
|
|
197 | |
|
|
198 | bg_scrub = BG_SCRUB_RATE; |
| 333 | } |
199 | } |
| 334 | } |
200 | } |
| 335 | |
201 | |
