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.54 by root, Sun Jul 1 04:08:14 2007 UTC vs.
Revision 1.71 by root, Sun Jan 13 12:39:29 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team 5 * Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software; you can redistribute it and/or modify it 8 * Deliantra is free software: you can redistribute it and/or modify
9 * under the terms of the GNU General Public License as published by the Free 9 * it under the terms of the GNU General Public License as published by
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * the Free Software Foundation, either version 3 of the License, or
11 * 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, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * 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 along 18 * You should have received a copy of the GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 20 *
22 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25/** 24/**
26 * \file 25 * \file
27 * Main client/server loops. 26 * Main client/server loops.
47 46
48#include <loader.h> 47#include <loader.h>
49 48
50#define BG_SCRUB_RATE 4 // how often to send a face in the background 49#define BG_SCRUB_RATE 4 // how often to send a face in the background
51 50
52#define MAX_QUEUE_DEPTH 500 51#define MAX_QUEUE_DEPTH 50
53#define MAX_QUEUE_BACKLOG 3. 52#define MAX_QUEUE_BACKLOG 3.
53
54// disconnect a socket after this many seconds without an ack
55#define SOCKET_TIMEOUT 8.
54 56
55void 57void
56client::reset_state () 58client::reset_state ()
57{ 59{
58 if (!pl) 60 if (!pl)
73 reset_state (); 75 reset_state ();
74 send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); 76 send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
75 } 77 }
76 else 78 else
77 { 79 {
78 cmd_queue.push_back (command ()); 80 cmd_queue.resize (cmd_queue.size () + 1);
79 command &cmd = cmd_queue.back (); 81 command &cmd = cmd_queue.back ();
80 cmd.stamp = stamp; 82 cmd.stamp = stamp;
81 cmd.handler = handler; 83 cmd.handler = handler;
82 cmd.data = salloc<char> (datalen + 1, data); 84 cmd.data = salloc<char> (datalen + 1, data);
83 cmd.datalen = datalen; 85 cmd.datalen = datalen;
99 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); 101 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
100 } 102 }
101 else 103 else
102 execute (cmd.handler, cmd.data, cmd.datalen); 104 execute (cmd.handler, cmd.data, cmd.datalen);
103 105
106 sfree<char> (cmd.data, cmd.datalen + 1);
104 cmd_queue.pop_front (); 107 cmd_queue.pop_front ();
105 return true; 108 return true;
106 } 109 }
107 else 110 else
108 return false; 111 return false;
109}
110
111void
112flush_sockets (void)
113{
114 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
115 (*i)->flush ();
116}
117
118/**
119 * This checks the sockets for input, does the right thing.
120 *
121 * A bit of this code is grabbed out of socket.c
122 * There are 2 lists we need to look through - init_sockets is a list
123 *
124 */
125void
126doeric_server (void)
127{
128 //TODO: should not be done here, either
129 for (unsigned i = 0; i < clients.size (); ++i)
130 {
131 client *ns = clients [i];
132
133 ns->tick ();
134 ns->refcnt_chk ();
135 }
136} 112}
137 113
138void 114void
139client::tick () 115client::tick ()
140{ 116{
156 132
157 draw_client_map (pl); 133 draw_client_map (pl);
158 134
159 if (update_look) 135 if (update_look)
160 esrv_draw_look (pl); 136 esrv_draw_look (pl);
137
138 mapinfo_queue_run ();
139
140#if HAVE_TCP_INFO
141 // check time of last ack, and, if too old, kill connection
142 socklen_t len = sizeof (tcpi);
143
144 if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
145 {
146 if (tcpi.tcpi_snd_mss)
147 mss = tcpi.tcpi_snd_mss;
148
149#if 0
150 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",
151 tcpi.tcpi_unacked,
152 tcpi.tcpi_sacked,
153 tcpi.tcpi_lost,
154 tcpi.tcpi_retrans,
155 tcpi.tcpi_fackets,
156 tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
157
158 tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
159#endif
160
161 // fast-time-out a player by checking for missign acks
162 // do this only when player is active
163 if (pl && pl->active
164 && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000))
165 {
166 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
167 write_outputbuffer ();
168
169 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
170 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
171 destroy ();
172 }
173 }
174#endif
175
176 rate_avail = min (max_rate + mss, rate_avail + max_rate);
177
178 int max_send = rate_avail;
179
180#if HAVE_TCP_INFO
181 // further restrict the available bandwidth by the excess bandwidth available
182 max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
183#endif
184
185 // if we can split images, round to next-lowest mss
186 if (fxix) max_send -= max_send % mss;
161 187
162 if (ixface.empty ()) 188 if (ixface.empty ())
163 { 189 {
164 // regularly send a new face when queue is empty 190 // regularly send a new face when queue is empty
165 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 191 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
166 while (scrub_idx < faces.size () - 1) 192 while (scrub_idx < faces.size () - 1)
167 { 193 {
168 ++scrub_idx; 194 ++scrub_idx;
169 195
170 if (!faces_sent [scrub_idx]) 196 if (!faces_sent [scrub_idx])
197 if (faceinfo *f = face_info (scrub_idx))
198 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
171 { 199 {
172 send_face (scrub_idx); 200 send_face (scrub_idx, -120);
173 flush_fx (); 201 flush_fx ();
174 202
175 bg_scrub = 1; // send up to one face per tick, unless an image was requested 203 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
176 break; 204 break;
177 } 205 }
178 } 206 }
179
180 rate_avail = max_rate - outputbuffer_len ();
181 } 207 }
182 else 208 else
183 { 209 {
184 int ol = outputbuffer_len ();
185
186 rate_avail = min (max_rate, rate_avail + max_rate);
187 rate_avail -= ol;
188
189 int avail = rate_avail;
190
191 // if we can split images, transfer up to mss-sized packets if possible
192 // but never 768 bytes more.
193 if (fxix) avail += min (768, mss - (ol % mss));
194
195 bg_scrub = BG_SCRUB_RATE; 210 bg_scrub = BG_SCRUB_RATE;
196 211
197 while (avail > 0) 212 for (;;)
198 { 213 {
214 int avail = max_send - outputbuffer_len ();
215
216 if (avail <= 0)
217 break;
218
199 ixsend &ix = ixface.back (); 219 ixsend &ix = ixface.back ();
200 220
201 if (facedata *d = face_data (ix.idx, faceset)) 221 if (facedata *d = face_data (ix.idx, faceset))
202 { 222 {
203 if (fxix) 223 if (fxix)
204 { 224 {
205 // 9 bytes is enough for fx_FFFOOO, 40 leaves some room for image data 225 // estimate the packet header overhead "ix " + idx + (new)ofs
226 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
206 int chunk = min (min (avail - 40, MAXSOCKBUF - 9), ix.ofs); 227 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
207 228
229 // only transfer something if the amount of data transferred
230 // has a healthy relation to the header overhead
208 if (chunk <= 0) 231 if (chunk < 64)
209 break; 232 break;
210 233
234 chunk = min (chunk, (int)ix.ofs);
235
211 ix.ofs -= chunk; 236 ix.ofs -= chunk;
237
238 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
212 239
213 packet sl ("ix"); 240 packet sl ("ix");
214 241
215 sl << ber32 (ix.idx) 242 sl << ber32 (ix.idx)
216 << ber32 (ix.ofs) 243 << ber32 (ix.ofs)
225 } 252 }
226 } 253 }
227 else 254 else
228 ix.ofs = 0; 255 ix.ofs = 0;
229 256
230 int consumed = ol - outputbuffer_len ();
231
232 avail -= consumed;
233 rate_avail -= consumed;
234
235 ol = outputbuffer_len ();
236
237 if (!ix.ofs) 257 if (!ix.ofs)
238 { 258 {
239 ixface.pop_back (); 259 ixface.pop_back ();
260
240 if (ixface.empty ()) 261 if (ixface.empty ())
241 break; 262 break;
242 } 263 }
243 } 264 }
244 } 265 }
245}
246 266
267 rate_avail -= outputbuffer_len ();
268}
269
270void
271client::flush_sockets (void)
272{
273 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
274 (*i)->flush ();
275}
276
277void
278client::clock (void)
279{
280 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
281 (*i)->tick ();
282
283 // give them all the same chances
284 flush_sockets ();
285
286 //TODO: should not be done here, either
287 for (unsigned i = 0; i < clients.size (); ++i)
288 clients[i]->refcnt_chk ();
289}
290

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines