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.35 by root, Tue Jan 2 11:08:36 2007 UTC vs.
Revision 1.82 by root, Mon Oct 12 14:00:59 2009 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 it under
8 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
9 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 11 * 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 Affero GNU General Public License
18 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 21 *
21 The author can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22*/ 23 */
23 24
24/** 25/**
25 * \file 26 * \file
26 * Main client/server loops. 27 * Main client/server loops.
27 * 28 *
… …
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 * maintanance (checking for lost connections and if data has arrived.) 32 * maintanance (checking for lost connections and if data has arrived.)
32 */ 33 */
33 34
34
35#include <global.h> 35#include <global.h>
36#include <sproto.h> 36#include <sproto.h>
37#include <sockproto.h> 37#include <sockproto.h>
38 38
39#include <sys/types.h> 39#include <sys/types.h>
… …
45#include <unistd.h> 45#include <unistd.h>
46#include <arpa/inet.h> 46#include <arpa/inet.h>
47 47
48#include <loader.h> 48#include <loader.h>
49 49
50#define BG_SCRUB_RATE 4 // how often to send a face in the background
51
50#define MAX_QUEUE_DEPTH 500 //TODO 52#define MAX_QUEUE_DEPTH 50
51#define MAX_QUEUE_BACKLOG 3. //TODO 53#define MAX_QUEUE_BACKLOG 3.
52 54
53void 55void
54client::reset_state () 56client::reset_state ()
55{ 57{
56 if (!pl) 58 if (!pl)
… …
61} 63}
62 64
63void 65void
64client::queue_command (packet_type *handler, char *data, int datalen) 66client::queue_command (packet_type *handler, char *data, int datalen)
65{ 67{
66 tstamp stamp = now (); 68 tstamp stamp = NOW;
67 69
68 if (cmd_queue.size () >= MAX_QUEUE_DEPTH) 70 if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
69 { 71 {
70 //TODO: just disconnect here? 72 //TODO: just disconnect here?
71 reset_state (); 73 reset_state ();
72 send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); 74 send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
73 } 75 }
74 else 76 else
75 { 77 {
76 cmd_queue.push_back (command ()); 78 cmd_queue.resize (cmd_queue.size () + 1);
77 command &cmd = cmd_queue.back (); 79 command &cmd = cmd_queue.back ();
78 cmd.stamp = stamp; 80 cmd.stamp = stamp;
79 cmd.handler = handler; 81 cmd.handler = handler;
80 cmd.data = salloc<char> (datalen + 1, data); 82 cmd.data = salloc<char> (datalen + 1, data);
81 cmd.datalen = datalen; 83 cmd.datalen = datalen;
… …
83} 85}
84 86
85bool 87bool
86client::handle_command () 88client::handle_command ()
87{ 89{
88 bool skipping = false;
89
90 while (!cmd_queue.empty () 90 if (!cmd_queue.empty ()
91 && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0)) 91 && state == ST_PLAYING
92 && pl->ob->speed_left > 0.f)
92 { 93 {
93 command &cmd = cmd_queue.front (); 94 command &cmd = cmd_queue.front ();
94 95
95 if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) 96 if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
96 { 97 {
98 reset_state (); // the command might actually reset some movement state etc.
99
97 if (!skipping) 100 if (pl)
101 pl->failmsg (
102 "Cannot keep up with your commands, ignoring them! "
103 "H<Your character cannot keep up with the instructions you give G<him|her>. "
104 "Try issuing commands slower, or, if G<he|she> is incapacitated (paralyzed and so on), "
105 "wait till your character can act again.\n\nIf G<he|she> is permanently stuck, then "
106 "try the B<suicide> command (or use B<chat> to ask somebody to B<invite> you out).>"
98 { 107 );
99 skipping = true;
100 reset_state ();
101 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
102 }
103
104 cmd_queue.pop_front ();
105 } 108 }
106 else 109 else
110 execute (cmd.handler, cmd.data, cmd.datalen);
111
112 sfree<char> (cmd.data, cmd.datalen + 1);
113 cmd_queue.pop_front ();
114 return true;
115 }
116 else
117 return false;
118}
119
120void
121client::tick ()
122{
123 if (!pl || destroyed ())
124 return;
125
126 pl->dirty = true;
127
128 /* Update the players stats once per tick. More efficient than
129 * sending them whenever they change, and probably just as useful
130 */
131 esrv_update_stats (pl);
132
133 sint32 weight = pl->ob->client_weight ();
134
135 if (last_weight != weight)
136 {
137 pl->ob->update_stats ();
138 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
139 }
140
141 draw_client_map (pl);
142
143 if (update_look)
144 esrv_draw_look (pl);
145
146 mapinfo_queue_run ();
147
148#if HAVE_TCP_INFO
149 // check time of last ack, and, if too old, kill connection
150 socklen_t len = sizeof (tcpi);
151
152 if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
153 {
154 if (tcpi.tcpi_snd_mss)
155 mss = tcpi.tcpi_snd_mss;
156
157#if 0
158 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",
159 tcpi.tcpi_unacked,
160 tcpi.tcpi_sacked,
161 tcpi.tcpi_lost,
162 tcpi.tcpi_retrans,
163 tcpi.tcpi_fackets,
164 tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
165
166 tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
167#endif
168
169 // fast-time-out a player by checking for missing acks
170 // do this only when player is active
171 if (pl && pl->active
172 && tcpi.tcpi_last_ack_recv > int (socket_timeout * 1000))
107 { 173 {
108 execute (cmd.handler, cmd.data, cmd.datalen); 174 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
109 cmd_queue.pop_front (); 175 write_outputbuffer ();
110 return true; 176
177 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
178 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
179 destroy ();
111 } 180 }
112 } 181 }
182#endif
113 183
114 return false; 184 rate_avail = min (max_rate + mss, rate_avail + max_rate);
115}
116 185
186 int max_send = rate_avail;
187
188#if HAVE_TCP_INFO
189 // further restrict the available bandwidth by the excess bandwidth available
190 max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
191#endif
192
193 // round to next-lowest mss
194 max_send -= max_send % mss;
195
196 if (ixface.empty ())
197 {
198 // regularly send a new face when queue is empty
199 if (bg_scrub && !--bg_scrub)
200 while (scrub_idx < faces.size () - 1)
201 {
202 ++scrub_idx;
203
204 if (!faces_sent [scrub_idx])
205 if (faceinfo *f = face_info (scrub_idx))
206 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
207 {
208 send_face (scrub_idx, -120);
209 flush_fx ();
210
211 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
212 break;
213 }
214 }
215 }
216 else
217 {
218 bg_scrub = BG_SCRUB_RATE;
219
220 for (;;)
221 {
222 int avail = max_send - outputbuffer_len ();
223
224 if (avail <= 0)
225 break;
226
227 ixsend &ix = ixface.back ();
228
229 if (facedata *d = face_data (ix.idx, faceset))
230 {
231 // estimate the packet header overhead "ix " + idx + (new)ofs
232 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
233 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
234
235 // only transfer something if the amount of data transferred
236 // has a healthy relation to the header overhead
237 if (chunk < 64)
238 break;
239
240 chunk = min (chunk, (int)ix.ofs);
241
242 ix.ofs -= chunk;
243
244 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
245
246 packet sl ("ix");
247
248 sl << ber32 (ix.idx)
249 << ber32 (ix.ofs)
250 << data (d->data.data () + ix.ofs, chunk);
251
252 send_packet (sl);
253 }
254 else
255 ix.ofs = 0;
256
257 if (!ix.ofs)
258 {
259 ixface.pop_back ();
260
261 if (ixface.empty ())
262 break;
263 }
264 }
265 }
266
267 rate_avail -= outputbuffer_len ();
268}
269
117void 270void
118flush_sockets (void) 271client::flush_sockets (void)
119{ 272{
120 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) 273 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
121 (*i)->flush (); 274 (*i)->flush ();
122} 275}
123 276
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 277void
132doeric_server (void) 278client::clock (void)
133{ 279{
134#ifdef CS_LOGSTATS 280 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
135 if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) 281 (*i)->tick ();
136 write_cs_stats (); 282
137#endif 283 // give them all the same chances
284 flush_sockets ();
138 285
139 //TODO: should not be done here, either 286 //TODO: should not be done here, either
140 for (int i = 0; i < clients.size (); ++i) 287 for (unsigned i = 0; i < clients.size (); ++i)
141 {
142 client *s = clients [i];
143 player *pl = s->pl;
144
145 if (pl && pl->ns && !pl->ns->destroyed ())
146 {
147 /* Update the players stats once per tick. More efficient than
148 * sending them whenever they change, and probably just as useful
149 */
150 esrv_update_stats (pl);
151
152 if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob))
153 {
154 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
155 if (pl->last_weight != WEIGHT (pl->ob))
156 LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
157 (unsigned long) pl->last_weight, WEIGHT (pl->ob));
158 }
159
160 draw_client_map (pl->ob);
161
162 if (s->update_look)
163 esrv_draw_look (pl->ob);
164 }
165
166 s->refcnt_chk (); 288 clients[i]->refcnt_chk ();
167 }
168} 289}
169 290

Diff Legend

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