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.34 by root, Wed Dec 27 15:04:39 2006 UTC vs.
Revision 1.70 by root, Thu Nov 8 19:43:30 2007 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 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 *
… …
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 * maintanance (checking for lost connections and if data has arrived.) 31 * maintanance (checking for lost connections and if data has arrived.)
32 */ 32 */
33 33
34
35#include <global.h> 34#include <global.h>
36#include <sproto.h> 35#include <sproto.h>
37#include <sockproto.h> 36#include <sockproto.h>
38 37
39#include <sys/types.h> 38#include <sys/types.h>
… …
45#include <unistd.h> 44#include <unistd.h>
46#include <arpa/inet.h> 45#include <arpa/inet.h>
47 46
48#include <loader.h> 47#include <loader.h>
49 48
49#define BG_SCRUB_RATE 4 // how often to send a face in the background
50
50#define MAX_QUEUE_DEPTH 500 //TODO 51#define MAX_QUEUE_DEPTH 50
51#define MAX_QUEUE_BACKLOG 3. //TODO 52#define MAX_QUEUE_BACKLOG 3.
53
54// disconnect a socket after this many seconds without an ack
55#define SOCKET_TIMEOUT 8.
52 56
53void 57void
54client::reset_state () 58client::reset_state ()
55{ 59{
56 if (!pl) 60 if (!pl)
… …
61} 65}
62 66
63void 67void
64client::queue_command (packet_type *handler, char *data, int datalen) 68client::queue_command (packet_type *handler, char *data, int datalen)
65{ 69{
66 tstamp stamp = now (); 70 tstamp stamp = NOW;
67 71
68 if (cmd_queue.size () >= MAX_QUEUE_DEPTH) 72 if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
69 { 73 {
70 //TODO: just disconnect here? 74 //TODO: just disconnect here?
71 reset_state (); 75 reset_state ();
… …
83} 87}
84 88
85bool 89bool
86client::handle_command () 90client::handle_command ()
87{ 91{
88 bool skipping = false;
89
90 while (!cmd_queue.empty () 92 if (!cmd_queue.empty ()
91 && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0)) 93 && state == ST_PLAYING
94 && pl->ob->speed_left > 0.f)
92 { 95 {
93 command &cmd = cmd_queue.front (); 96 command &cmd = cmd_queue.front ();
94 97
95 if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) 98 if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
96 { 99 {
97 if (!skipping)
98 {
99 skipping = true;
100 reset_state (); 100 reset_state ();
101 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); 101 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
102 }
103
104 cmd_queue.pop_front ();
105 } 102 }
106 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 mapinfo_queue_run ();
138
139#if HAVE_TCP_INFO
140 // check time of last ack, and, if too old, kill connection
141 socklen_t len = sizeof (tcpi);
142
143 if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
144 {
145 if (tcpi.tcpi_snd_mss)
146 mss = tcpi.tcpi_snd_mss;
147
148#if 0
149 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",
150 tcpi.tcpi_unacked,
151 tcpi.tcpi_sacked,
152 tcpi.tcpi_lost,
153 tcpi.tcpi_retrans,
154 tcpi.tcpi_fackets,
155 tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
156
157 tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
158#endif
159
160 // fast-time-out a player by checking for missign acks
161 // do this only when player is active
162 if (pl && pl->active
163 && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000))
107 { 164 {
108 execute (cmd.handler, cmd.data, cmd.datalen); 165 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
109 cmd_queue.pop_front (); 166 write_outputbuffer ();
110 return true; 167
168 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
169 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
170 destroy ();
111 } 171 }
112 } 172 }
173#endif
113 174
114 return false; 175 rate_avail = min (max_rate + mss, rate_avail + max_rate);
115}
116 176
177 int max_send = rate_avail;
178
179#if HAVE_TCP_INFO
180 // further restrict the available bandwidth by the excess bandwidth available
181 max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
182#endif
183
184 // if we can split images, round to next-lowest mss
185 if (fxix) max_send -= max_send % mss;
186
187 if (ixface.empty ())
188 {
189 // regularly send a new face when queue is empty
190 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
191 while (scrub_idx < faces.size () - 1)
192 {
193 ++scrub_idx;
194
195 if (!faces_sent [scrub_idx])
196 if (faceinfo *f = face_info (scrub_idx))
197 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
198 {
199 send_face (scrub_idx, -120);
200 flush_fx ();
201
202 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
203 break;
204 }
205 }
206 }
207 else
208 {
209 bg_scrub = BG_SCRUB_RATE;
210
211 for (;;)
212 {
213 int avail = max_send - outputbuffer_len ();
214
215 if (avail <= 0)
216 break;
217
218 ixsend &ix = ixface.back ();
219
220 if (facedata *d = face_data (ix.idx, faceset))
221 {
222 if (fxix)
223 {
224 // estimate the packet header overhead "ix " + idx + (new)ofs
225 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
226 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
227
228 // only transfer something if the amount of data transferred
229 // has a healthy relation to the header overhead
230 if (chunk < 64)
231 break;
232
233 chunk = min (chunk, (int)ix.ofs);
234
235 ix.ofs -= chunk;
236
237 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
238
239 packet sl ("ix");
240
241 sl << ber32 (ix.idx)
242 << ber32 (ix.ofs)
243 << data (d->data.data () + ix.ofs, chunk);
244
245 send_packet (sl);
246 }
247 else
248 {
249 send_image (ix.idx);
250 ix.ofs = 0;
251 }
252 }
253 else
254 ix.ofs = 0;
255
256 if (!ix.ofs)
257 {
258 ixface.pop_back ();
259
260 if (ixface.empty ())
261 break;
262 }
263 }
264 }
265
266 rate_avail -= outputbuffer_len ();
267}
268
117void 269void
118flush_sockets (void) 270client::flush_sockets (void)
119{ 271{
120 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) 272 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
121 (*i)->flush (); 273 (*i)->flush ();
122} 274}
123 275
124/**
125 * This checks the sockets for input, does the right thing.
126 *
127 * A bit of this code is grabbed out of socket.c
128 * There are 2 lists we need to look through - init_sockets is a list
129 *
130 */
131void 276void
132doeric_server (void) 277client::clock (void)
133{ 278{
134#ifdef CS_LOGSTATS 279 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
135 if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) 280 (*i)->tick ();
136 write_cs_stats (); 281
137#endif 282 // give them all the same chances
283 flush_sockets ();
138 284
139 //TODO: should not be done here, either 285 //TODO: should not be done here, either
140 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) 286 for (unsigned i = 0; i < clients.size (); ++i)
141 {
142 client *s = *i;
143
144 if (player *pl = s->pl)
145 {
146 /* Update the players stats once per tick. More efficient than
147 * sending them whenever they change, and probably just as useful
148 */
149 esrv_update_stats (pl);
150
151 if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob))
152 {
153 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
154 if (pl->last_weight != WEIGHT (pl->ob))
155 LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
156 (unsigned long) pl->last_weight, WEIGHT (pl->ob));
157 }
158
159 draw_client_map (pl->ob);
160
161 if (s->update_look)
162 esrv_draw_look (pl->ob);
163 }
164
165 s->refcnt_chk (); 287 clients[i]->refcnt_chk ();
166 }
167} 288}
168 289

Diff Legend

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