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.51 by root, Sat Jun 9 22:54:04 2007 UTC vs.
Revision 1.68 by root, Thu Aug 9 04:11:24 2007 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
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 Crossfire TRT 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 * Crossfire TRT 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 <crossfire@schmorp.de>
23 */ 22 */
24 23
25/** 24/**
… …
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)
… …
107 else 109 else
108 return false; 110 return false;
109} 111}
110 112
111void 113void
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}
137
138void
139client::tick () 114client::tick ()
140{ 115{
141 if (!pl || destroyed ()) 116 if (!pl || destroyed ())
142 return; 117 return;
143 118
… …
157 draw_client_map (pl); 132 draw_client_map (pl);
158 133
159 if (update_look) 134 if (update_look)
160 esrv_draw_look (pl); 135 esrv_draw_look (pl);
161 136
162 if (askface.empty () && !partial_face_ofs) 137#if HAVE_TCP_INFO
138 // check time of last ack, and, if too old, kill connection
139 socklen_t len = sizeof (tcpi);
140
141 if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
142 {
143 if (tcpi.tcpi_snd_mss)
144 mss = tcpi.tcpi_snd_mss;
145
146#if 0
147 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",
148 tcpi.tcpi_unacked,
149 tcpi.tcpi_sacked,
150 tcpi.tcpi_lost,
151 tcpi.tcpi_retrans,
152 tcpi.tcpi_fackets,
153 tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
154
155 tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
156#endif
157
158 // fast-time-out a player by checking for missign acks
159 // do this only when player is active
160 if (pl && pl->active
161 && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000))
162 {
163 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
164 write_outputbuffer ();
165
166 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
167 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
168 destroy ();
169 }
170 }
171#endif
172
173 rate_avail = min (max_rate + mss, rate_avail + max_rate);
174
175 int max_send = rate_avail;
176
177#if HAVE_TCP_INFO
178 // further restrict the available bandwidth by the excess bandwidth available
179 max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
180#endif
181
182 // if we can split images, round to next-lowest mss
183 if (fxix) max_send -= max_send % mss;
184
185 if (ixface.empty ())
163 { 186 {
164 // regularly send a new face when queue is empty 187 // regularly send a new face when queue is empty
165 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 188 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
166 while (scrub_idx < faces.size () - 1) 189 while (scrub_idx < faces.size () - 1)
167 { 190 {
168 ++scrub_idx; 191 ++scrub_idx;
192
169 if (!faces_sent [scrub_idx]) 193 if (!faces_sent [scrub_idx])
194 if (faceinfo *f = face_info (scrub_idx))
195 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
170 { 196 {
171 send_face (scrub_idx); 197 send_face (scrub_idx, -120);
172 flush_fx (); 198 flush_fx ();
173 199
174 bg_scrub = 1; // send up to one face per tick, unless an image was requested 200 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
175 break; 201 break;
176 } 202 }
177 } 203 }
178
179 rate_avail = max_rate - outputbuffer_len ();
180 } 204 }
181 else 205 else
182 { 206 {
183 int ol = outputbuffer_len ();
184
185 rate_avail = min (max_rate, rate_avail + max_rate);
186 rate_avail -= ol;
187
188 int avail = rate_avail;
189
190 // if we can split images, transfer up to mss packets if possible
191 // but never more 768 bytes more.
192 if (fxix) avail += min (768, mss - (ol % mss));
193
194 bg_scrub = BG_SCRUB_RATE; 207 bg_scrub = BG_SCRUB_RATE;
195 208
196 while (avail > 0) 209 for (;;)
197 { 210 {
198 if (partial_face_ofs) 211 int avail = max_send - outputbuffer_len ();
212
213 if (avail <= 0)
214 break;
215
216 ixsend &ix = ixface.back ();
217
218 if (facedata *d = face_data (ix.idx, faceset))
199 { 219 {
200 if (facedata *d = face_data (partial_face, faceset)) 220 if (fxix)
201 { 221 {
202 // 9 bytes is enough for fx_FFFOOO, 40 leaves some room 222 // estimate the packet header overhead "ix " + idx + (new)ofs
223 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
203 int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs); 224 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
204 225
226 // only transfer something if the amount of data transferred
227 // has a healthy relation to the header overhead
205 if (chunk <= 0) 228 if (chunk < 64)
206 break; 229 break;
207 230
231 chunk = min (chunk, (int)ix.ofs);
232
208 partial_face_ofs -= chunk; 233 ix.ofs -= chunk;
234
235 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
209 236
210 packet sl ("ix"); 237 packet sl ("ix");
211 238
212 sl << ber32 (partial_face) 239 sl << ber32 (ix.idx)
213 << ber32 (partial_face_ofs) 240 << ber32 (ix.ofs)
214 << data (d->data.data () + partial_face_ofs, chunk); 241 << data (d->data.data () + ix.ofs, chunk);
215 242
216 send_packet (sl); 243 send_packet (sl);
217 } 244 }
218 else 245 else
219 partial_face_ofs = 0;
220 }
221 else if (!askface.empty ())
222 {
223 // use a lifo to send most recently requested images
224 faceidx facenum = askface.back ();
225 askface.pop_back ();
226
227 if (fxix)
228 { 246 {
229 if (facedata *d = face_data (facenum, faceset)) 247 send_image (ix.idx);
230 { 248 ix.ofs = 0;
231 partial_face = facenum;
232 partial_face_ofs = d->data.size ();
233 }
234 } 249 }
235 else
236 send_image (facenum);
237 } 250 }
238 else 251 else
252 ix.ofs = 0;
253
254 if (!ix.ofs)
255 {
256 ixface.pop_back ();
257
258 if (ixface.empty ())
239 break; 259 break;
240 260 }
241 int consumed = ol - outputbuffer_len ();
242 avail -= consumed;
243 rate_avail -= consumed;
244 } 261 }
245 } 262 }
246}
247 263
264 rate_avail -= outputbuffer_len ();
265}
266
267void
268client::flush_sockets (void)
269{
270 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
271 (*i)->flush ();
272}
273
274void
275client::clock (void)
276{
277 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
278 (*i)->tick ();
279
280 // give them all the same chances
281 flush_sockets ();
282
283 //TODO: should not be done here, either
284 for (unsigned i = 0; i < clients.size (); ++i)
285 clients[i]->refcnt_chk ();
286}
287

Diff Legend

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