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.19 by root, Fri Dec 15 19:59:20 2006 UTC vs.
Revision 1.77 by root, Tue May 6 16:55:26 2008 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 * Deliantra 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 authors can be reached via e-mail to <support@deliantra.net>
21 The author 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
… …
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 48
51/***************************************************************************** 49#define BG_SCRUB_RATE 4 // how often to send a face in the background
52 * Start of command dispatch area.
53 * The commands here are protocol commands.
54 ****************************************************************************/
55 50
56/* Either keep this near the start or end of the file so it is 51#define MAX_QUEUE_DEPTH 50
57 * at least reasonablye easy to find. 52#define MAX_QUEUE_BACKLOG 3.
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 53
64enum { 54// disconnect a socket after this many seconds without an ack
65 PF_PLAYER = 0x01, // must have valid player 55#define SOCKET_TIMEOUT 16.
66 PF_IMMEDIATE = 0x02, // TODO: hack, can be executed immediately
67 PF_PLAYING = 0x04, // must be in playing state
68};
69 56
70struct pkt_type 57void
58client::reset_state ()
71{ 59{
72 const char *name; 60 if (!pl)
73 void *cb; 61 return;
74 int flags;
75 62
76 bool may_execute (client *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)
77 { 73 {
78 return (!(flags & PF_PLAYER) || ns->pl) 74 //TODO: just disconnect here?
79 && (!(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);
80 } 77 }
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 78 else
88 ((void (*)(char *, int, client *))cb)((char *)data, datalen, ns); 79 {
89 } 80 cmd_queue.resize (cmd_queue.size () + 1);
90}; 81 command &cmd = cmd_queue.back ();
91 82 cmd.stamp = stamp;
92// SocketCommand, PlayingCommand, should not exist with those ugly casts 83 cmd.handler = handler;
93#define SC(cb) (void *)static_cast<void (*)(char *, int, client *)>(cb), 84 cmd.data = salloc<char> (datalen + 1, data);
94#define PC(cb) (void *)static_cast<void (*)(char *, int, player *)>(cb), PF_PLAYER | 85 cmd.datalen = datalen;
95
96/**
97 * Dispatch table for the server.
98 */
99static 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 */
135void
136HandleClient (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 { 86 }
142 /* If it is a player, and they don't have any speed left, we 87}
143 * return, and will read in the data when they do have time.
144 */
145 if (pl && pl->state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0)
146 return;
147 88
148 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 ();
149 97
150 if (pkt_len < 0) 98 if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
151 { 99 {
152 LOG (llevError, "read error on player %s\n", &pl->ob->name); 100 reset_state ();
153 /* Caller will take care of cleaning this up */ 101 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
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 {
171 *data++ = 0;
172 datalen = pkt_len - (data - (char *)ns->inbuf);
173 } 102 }
174 else 103 else
104 execute (cmd.handler, cmd.data, cmd.datalen);
105
106 sfree<char> (cmd.data, cmd.datalen + 1);
107 cmd_queue.pop_front ();
108 return true;
109 }
110 else
111 return false;
112}
113
114void
115client::tick ()
116{
117 if (!pl || destroyed ())
118 return;
119
120 pl->dirty = true;
121
122 /* Update the players stats once per tick. More efficient than
123 * sending them whenever they change, and probably just as useful
124 */
125 esrv_update_stats (pl);
126
127 sint32 weight = pl->ob->client_weight ();
128
129 if (last_weight != weight)
130 {
131 pl->ob->update_stats ();
132 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
133 }
134
135 draw_client_map (pl);
136
137 if (update_look)
138 esrv_draw_look (pl);
139
140 mapinfo_queue_run ();
141
142#if HAVE_TCP_INFO
143 // check time of last ack, and, if too old, kill connection
144 socklen_t len = sizeof (tcpi);
145
146 if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
147 {
148 if (tcpi.tcpi_snd_mss)
149 mss = tcpi.tcpi_snd_mss;
150
151#if 0
152 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",
153 tcpi.tcpi_unacked,
154 tcpi.tcpi_sacked,
155 tcpi.tcpi_lost,
156 tcpi.tcpi_retrans,
157 tcpi.tcpi_fackets,
158 tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
159
160 tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
161#endif
162
163 // fast-time-out a player by checking for missign acks
164 // do this only when player is active
165 if (pl && pl->active
166 && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000))
175 { 167 {
176 data = (char *)ns->inbuf + 2; // better read garbage than segfault 168 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
177 datalen = 0; 169 write_outputbuffer ();
170
171 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
172 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
173 destroy ();
178 } 174 }
175 }
176#endif
179 177
180 ns->inbuf [pkt_len] = 0; /* Terminate buffer - useful for string data */ 178 rate_avail = min (max_rate + mss, rate_avail + max_rate);
181 179
182 for (pkt_type *pkt = packets; pkt < packets + (sizeof (packets) / sizeof (packets[0])); ++pkt) 180 int max_send = rate_avail;
183 if (!strcmp ((char *)ns->inbuf + 2, pkt->name)) 181
182#if HAVE_TCP_INFO
183 // further restrict the available bandwidth by the excess bandwidth available
184 max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
185#endif
186
187 // if we can split images, round to next-lowest mss
188 if (fxix) max_send -= max_send % mss;
189
190 if (ixface.empty ())
191 {
192 // regularly send a new face when queue is empty
193 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
194 while (scrub_idx < faces.size () - 1)
184 { 195 {
185 if (pkt->may_execute (ns)) 196 ++scrub_idx;
197
198 if (!faces_sent [scrub_idx])
199 if (faceinfo *f = face_info (scrub_idx))
200 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
186 { 201 {
187 pkt->execute (ns, data, datalen); 202 send_face (scrub_idx, -120);
188 ns->skip_packet (pkt_len); 203 flush_fx ();
189 //D//TODO not doing this causes random memory corruption 204
190 if (pkt->flags & PF_IMMEDIATE) 205 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
191 goto next_packet;
192 return; 206 break;
193 } 207 }
194 } 208 }
195 209 }
196 /* If we get here, we didn't find a valid command. Logging 210 else
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 } 211 {
205} 212 bg_scrub = BG_SCRUB_RATE;
206 213
214 for (;;)
215 {
216 int avail = max_send - outputbuffer_len ();
217
218 if (avail <= 0)
219 break;
220
221 ixsend &ix = ixface.back ();
222
223 if (facedata *d = face_data (ix.idx, faceset))
224 {
225 if (fxix)
226 {
227 // estimate the packet header overhead "ix " + idx + (new)ofs
228 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
229 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
230
231 // only transfer something if the amount of data transferred
232 // has a healthy relation to the header overhead
233 if (chunk < 64)
234 break;
235
236 chunk = min (chunk, (int)ix.ofs);
237
238 ix.ofs -= chunk;
239
240 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
241
242 packet sl ("ix");
243
244 sl << ber32 (ix.idx)
245 << ber32 (ix.ofs)
246 << data (d->data.data () + ix.ofs, chunk);
247
248 send_packet (sl);
249 }
250 else
251 {
252 send_image (ix.idx);
253 ix.ofs = 0;
254 }
255 }
256 else
257 ix.ofs = 0;
258
259 if (!ix.ofs)
260 {
261 ixface.pop_back ();
262
263 if (ixface.empty ())
264 break;
265 }
266 }
267 }
268
269 rate_avail -= outputbuffer_len ();
270}
271
207void 272void
208flush_sockets (void) 273client::flush_sockets (void)
209{ 274{
210 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) 275 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
211 if ((*i)->status != Ns_Dead)
212 (*i)->flush (); 276 (*i)->flush ();
213} 277}
214 278
215/**
216 * This checks the sockets for input, does the right thing.
217 *
218 * A bit of this code is grabbed out of socket.c
219 * There are 2 lists we need to look through - init_sockets is a list
220 *
221 */
222void 279void
223doeric_server (void) 280client::clock (void)
224{ 281{
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
233 if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME)
234 write_cs_stats ();
235#endif
236
237 /* Go through the players. Let the loop set the next pl value,
238 * since we may remove some
239 */
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) 282 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
303 { 283 (*i)->tick ();
304 client *s = *i;
305 player *pl = s->pl;
306 284
307 //TODO: disassociate handleclient from socket readin 285 // give them all the same chances
308 if (s->inbuf_len || FD_ISSET (s->fd, &tmp_read)) 286 flush_sockets ();
309 HandleClient (s, pl);
310 287
311 //TODO: should not be done here, either 288 //TODO: should not be done here, either
312 if (s->status != Ns_Dead && pl) 289 for (unsigned i = 0; i < clients.size (); ++i)
313 { 290 clients[i]->refcnt_chk ();
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);
318 if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob))
319 {
320 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
321 if (pl->last_weight != WEIGHT (pl->ob))
322 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));
324 }
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 }
333 }
334} 291}
335 292

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines