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

Diff Legend

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