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.63 by root, Sat Jul 28 00:15:03 2007 UTC vs.
Revision 1.73 by root, Tue Apr 22 07:01:47 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 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 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 3 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,
… …
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, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * 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>
22 */ 22 */
23 23
24/** 24/**
25 * \file 25 * \file
26 * Main client/server loops. 26 * Main client/server loops.
… …
46 46
47#include <loader.h> 47#include <loader.h>
48 48
49#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
50 50
51#define MAX_QUEUE_DEPTH 500 51#define MAX_QUEUE_DEPTH 50
52#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 16.
53 56
54void 57void
55client::reset_state () 58client::reset_state ()
56{ 59{
57 if (!pl) 60 if (!pl)
… …
72 reset_state (); 75 reset_state ();
73 send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); 76 send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
74 } 77 }
75 else 78 else
76 { 79 {
77 cmd_queue.push_back (command ()); 80 cmd_queue.resize (cmd_queue.size () + 1);
78 command &cmd = cmd_queue.back (); 81 command &cmd = cmd_queue.back ();
79 cmd.stamp = stamp; 82 cmd.stamp = stamp;
80 cmd.handler = handler; 83 cmd.handler = handler;
81 cmd.data = salloc<char> (datalen + 1, data); 84 cmd.data = salloc<char> (datalen + 1, data);
82 cmd.datalen = datalen; 85 cmd.datalen = datalen;
… …
98 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); 101 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
99 } 102 }
100 else 103 else
101 execute (cmd.handler, cmd.data, cmd.datalen); 104 execute (cmd.handler, cmd.data, cmd.datalen);
102 105
106 sfree<char> (cmd.data, cmd.datalen + 1);
103 cmd_queue.pop_front (); 107 cmd_queue.pop_front ();
104 return true; 108 return true;
105 } 109 }
106 else 110 else
107 return false; 111 return false;
108}
109
110void
111flush_sockets (void)
112{
113 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
114 (*i)->flush ();
115}
116
117/**
118 * This checks the sockets for input, does the right thing.
119 *
120 * A bit of this code is grabbed out of socket.c
121 * There are 2 lists we need to look through - init_sockets is a list
122 *
123 */
124void
125doeric_server (void)
126{
127 //TODO: should not be done here, either
128 for (unsigned i = 0; i < clients.size (); ++i)
129 {
130 client *ns = clients [i];
131
132 ns->tick ();
133 ns->refcnt_chk ();
134 }
135} 112}
136 113
137void 114void
138client::tick () 115client::tick ()
139{ 116{
… …
143 /* Update the players stats once per tick. More efficient than 120 /* Update the players stats once per tick. More efficient than
144 * sending them whenever they change, and probably just as useful 121 * sending them whenever they change, and probably just as useful
145 */ 122 */
146 esrv_update_stats (pl); 123 esrv_update_stats (pl);
147 124
125#if 0
148 if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) 126 if (last_weight != -1 && last_weight != pl->ob->client_weight ())
149 { 127 {
150 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); 128 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
151 if (last_weight != WEIGHT (pl->ob)) 129 if (last_weight != pl->ob->client_weight ())
152 LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", 130 LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
153 (unsigned long) last_weight, WEIGHT (pl->ob)); 131 (unsigned long) last_weight, pl->ob->client_weight ());
154 } 132 }
133#endif
155 134
156 draw_client_map (pl); 135 draw_client_map (pl);
157 136
158 if (update_look) 137 if (update_look)
159 esrv_draw_look (pl); 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))
167 {
168 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
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 ();
174 }
175 }
176#endif
177
178 rate_avail = min (max_rate + mss, rate_avail + max_rate);
179
180 int max_send = rate_avail;
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;
160 189
161 if (ixface.empty ()) 190 if (ixface.empty ())
162 { 191 {
163 // regularly send a new face when queue is empty 192 // regularly send a new face when queue is empty
164 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 193 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
165 while (scrub_idx < faces.size () - 1) 194 while (scrub_idx < faces.size () - 1)
166 { 195 {
167 ++scrub_idx; 196 ++scrub_idx;
168 197
169 if (!faces_sent [scrub_idx]) 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
170 { 201 {
171 send_face (scrub_idx, -120); 202 send_face (scrub_idx, -120);
172 flush_fx (); 203 flush_fx ();
173 204
174 bg_scrub = 1; // send up to one face per tick, unless an image was requested 205 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
206 break;
207 }
208 }
209 }
210 else
211 {
212 bg_scrub = BG_SCRUB_RATE;
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 ())
175 break; 264 break;
176 }
177 }
178
179 rate_avail = max_rate - outputbuffer_len ();
180 }
181 else
182 {
183 bool overload = false;
184
185#if HAVE_TCP_INFO
186 // do bandwidth checking
187 if (tcpi.tcpi_unacked + 1 > max (4, tcpi.tcpi_snd_cwnd))
188 {
189 overload = true;
190 if (next_rate_adjust <= NOW)
191 {
192 next_rate_adjust = NOW + 2;
193 max_rate = max (max_rate >> 1, int (5000 * TICK));
194 LOG (llevDebug, "tcp %s overloaded (%d + 1 > 4 | %d), rate now %d\n",
195 host, (int)tcpi.tcpi_unacked, (int)tcpi.tcpi_snd_cwnd, int (max_rate / TICK));//D
196 send_packet_printf ("drawinfo %d Due to possible network congestion, your output-rate has been reduced to %dbps.",
197 NDI_RED, int (max_rate / TICK));
198 } 265 }
199 } 266 }
200#endif
201
202 if (!overload)
203 {
204 int ol = outputbuffer_len ();
205
206 rate_avail = min (max_rate, rate_avail + max_rate);
207 rate_avail -= ol;
208
209 int avail = rate_avail;
210
211 // if we can split images, transfer up to mss-sized packets if possible
212 // but never 768 bytes more.
213 if (fxix) avail += min (768, mss - (ol % mss));
214
215 bg_scrub = BG_SCRUB_RATE;
216
217 while (avail > 0)
218 {
219 ixsend &ix = ixface.back ();
220
221 if (facedata *d = face_data (ix.idx, faceset))
222 {
223 if (fxix)
224 {
225 // only transfer something if the amount of data transferred
226 // has a healthy relation to the header overhead
227 if (avail <= 40)
228 break;
229
230 // 9 bytes is enough for fx_FFFOOO
231 int chunk = min (min (avail, MAXSOCKBUF - 9), (int)ix.ofs);
232
233 if (chunk <= 0)
234 break;
235
236 ix.ofs -= chunk;
237
238 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
239
240 packet sl ("ix");
241
242 sl << ber32 (ix.idx)
243 << ber32 (ix.ofs)
244 << data (d->data.data () + ix.ofs, chunk);
245
246 send_packet (sl);
247 }
248 else
249 {
250 send_image (ix.idx);
251 ix.ofs = 0;
252 }
253 }
254 else
255 ix.ofs = 0;
256
257 int consumed = outputbuffer_len () - ol;
258
259 avail -= consumed;
260 rate_avail -= consumed;
261
262 ol = outputbuffer_len ();
263
264 if (!ix.ofs)
265 {
266 ixface.pop_back ();
267
268 if (ixface.empty ())
269 break;
270 }
271 }
272 }
273 } 267 }
274}
275 268
269 rate_avail -= outputbuffer_len ();
270}
271
272void
273client::flush_sockets (void)
274{
275 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
276 (*i)->flush ();
277}
278
279void
280client::clock (void)
281{
282 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
283 (*i)->tick ();
284
285 // give them all the same chances
286 flush_sockets ();
287
288 //TODO: should not be done here, either
289 for (unsigned i = 0; i < clients.size (); ++i)
290 clients[i]->refcnt_chk ();
291}
292

Diff Legend

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