ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/loop.C
(Generate patch)

Comparing deliantra/server/socket/loop.C (file contents):
Revision 1.18 by root, Fri Dec 15 04:21:29 2006 UTC vs.
Revision 1.68 by root, Thu Aug 9 04:11:24 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines