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.50 by root, Sun Jun 3 17:05:36 2007 UTC vs.
Revision 1.64 by root, Sat Jul 28 00:45:05 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/**
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#define BG_SCRUB_RATE 4 // how often to send a face in the background
36
37#include <global.h> 34#include <global.h>
38#include <sproto.h> 35#include <sproto.h>
39#include <sockproto.h> 36#include <sockproto.h>
40 37
41#include <sys/types.h> 38#include <sys/types.h>
47#include <unistd.h> 44#include <unistd.h>
48#include <arpa/inet.h> 45#include <arpa/inet.h>
49 46
50#include <loader.h> 47#include <loader.h>
51 48
49#define BG_SCRUB_RATE 4 // how often to send a face in the background
50
52#define MAX_QUEUE_DEPTH 500 //TODO 51#define MAX_QUEUE_DEPTH 500
53#define MAX_QUEUE_BACKLOG 3. //TODO 52#define MAX_QUEUE_BACKLOG 3.
54 53
55void 54void
56client::reset_state () 55client::reset_state ()
57{ 56{
58 if (!pl) 57 if (!pl)
63} 62}
64 63
65void 64void
66client::queue_command (packet_type *handler, char *data, int datalen) 65client::queue_command (packet_type *handler, char *data, int datalen)
67{ 66{
68 tstamp stamp = now (); 67 tstamp stamp = NOW;
69 68
70 if (cmd_queue.size () >= MAX_QUEUE_DEPTH) 69 if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
71 { 70 {
72 //TODO: just disconnect here? 71 //TODO: just disconnect here?
73 reset_state (); 72 reset_state ();
91 && state == ST_PLAYING 90 && state == ST_PLAYING
92 && pl->ob->speed_left > 0.f) 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 {
98 reset_state (); 97 reset_state ();
99 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); 98 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
100 } 99 }
101 else 100 else
123 * 122 *
124 */ 123 */
125void 124void
126doeric_server (void) 125doeric_server (void)
127{ 126{
128#ifdef CS_LOGSTATS
129 if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME)
130 write_cs_stats ();
131#endif
132
133 //TODO: should not be done here, either 127 //TODO: should not be done here, either
134 for (unsigned i = 0; i < clients.size (); ++i) 128 for (unsigned i = 0; i < clients.size (); ++i)
135 { 129 {
136 client *ns = clients [i]; 130 client *ns = clients [i];
137 131
162 draw_client_map (pl); 156 draw_client_map (pl);
163 157
164 if (update_look) 158 if (update_look)
165 esrv_draw_look (pl); 159 esrv_draw_look (pl);
166 160
167 if (askface.empty () && !partial_face_ofs) 161 bool overload = false;
162
163#if HAVE_TCP_INFO
164 // do bandwidth checking
165 if (tcpi.tcpi_unacked + 1 > max (4, tcpi.tcpi_snd_cwnd))
166 {
167 overload = true;
168 if (next_rate_adjust <= NOW)
169 {
170 next_rate_adjust = NOW + 2;
171 max_rate = max (max_rate >> 1, int (5000 * TICK));
172 LOG (llevDebug, "tcp %s overloaded (%d + 1 > 4 | %d), rate now %d\n",
173 host, (int)tcpi.tcpi_unacked, (int)tcpi.tcpi_snd_cwnd, int (max_rate / TICK));//D
174 send_packet_printf ("drawinfo %d Due to possible network congestion, your output-rate has been reduced to %dbps.",
175 NDI_RED, int (max_rate / TICK));
176 }
168 { 177 }
178#endif
179
180 if (!overload)
181 {
182 if (ixface.empty ())
183 {
169 // regularly send a new face when queue is empty 184 // regularly send a new face when queue is empty
170 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 185 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
171 while (scrub_idx < faces.size () - 1) 186 while (scrub_idx < faces.size () - 1)
172 {
173 ++scrub_idx;
174 if (!faces_sent [scrub_idx])
175 { 187 {
188 ++scrub_idx;
189
190 if (!faces_sent [scrub_idx])
191 if (faceinfo *f = face_info (scrub_idx))
192 if (f->type == FT_FACE) // only scrub faces for now
193 {
176 send_face (scrub_idx); 194 send_face (scrub_idx, -120);
177 flush_fx (); 195 flush_fx ();
178 196
179 bg_scrub = 1; // send up to one face per tick, unless an image was requested 197 bg_scrub = 1; // send up to one face per tick, unless an image was requested
180 break; 198 break;
199 }
181 } 200 }
182 }
183 201
184 rate_avail = max_rate - outputbuffer_len (); 202 rate_avail = max_rate - outputbuffer_len ();
185 } 203 }
186 else 204 else
187 { 205 {
188 int ol = outputbuffer_len (); 206 int ol = outputbuffer_len ();
189 207
190 rate_avail = min (max_rate, rate_avail + max_rate); 208 rate_avail = min (max_rate, rate_avail + max_rate);
191 rate_avail -= ol; 209 rate_avail -= ol;
192 210
193 int avail = rate_avail; 211 int avail = rate_avail;
194 212
195 // if we can split images, transfer up to mss packets if possible 213 // if we can split images, transfer up to mss-sized packets if possible
196 // but never more 768 bytes more. 214 // but never 768 bytes more.
197 if (fxix) avail += min (768, mss - (ol % mss)); 215 if (fxix) avail += min (768, mss - (ol % mss));
198 216
199 bg_scrub = BG_SCRUB_RATE; 217 bg_scrub = BG_SCRUB_RATE;
200 218
201 while (avail > 0) 219 while (avail > 0)
202 {
203 if (partial_face_ofs)
204 { 220 {
221 ixsend &ix = ixface.back ();
222
205 if (facedata *d = face_data (partial_face, faceset)) 223 if (facedata *d = face_data (ix.idx, faceset))
206 { 224 {
207 // 9 bytes is enough for fx_FFFOOO, 40 leaves some room
208 int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs);
209
210 if (chunk <= 0)
211 break;
212
213 partial_face_ofs -= chunk;
214
215 packet sl ("ix");
216
217 sl << ber32 (partial_face)
218 << ber32 (partial_face_ofs)
219 << data (d->data.data () + partial_face_ofs, chunk);
220
221 send_packet (sl);
222 }
223 else
224 partial_face_ofs = 0;
225 }
226 else if (!askface.empty ())
227 {
228 // use a lifo to send most recently requested images
229 faceidx facenum = askface.back ();
230 askface.pop_back ();
231
232 if (fxix) 225 if (fxix)
233 {
234 if (facedata *d = face_data (facenum, faceset))
235 { 226 {
236 partial_face = facenum; 227 // only transfer something if the amount of data transferred
237 partial_face_ofs = d->data.size (); 228 // has a healthy relation to the header overhead
229 if (avail <= 40)
230 break;
231
232 // 9 bytes is enough for fx_FFFOOO
233 int chunk = min (min (avail, MAXSOCKBUF - 9), (int)ix.ofs);
234
235 if (chunk <= 0)
236 break;
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;
238 } 254 }
239 } 255 }
240 else 256 else
241 send_image (facenum); 257 ix.ofs = 0;
258
259 int consumed = outputbuffer_len () - ol;
260
261 avail -= consumed;
262 rate_avail -= consumed;
263
264 ol = outputbuffer_len ();
265
266 if (!ix.ofs)
267 {
268 ixface.pop_back ();
269
270 if (ixface.empty ())
271 break;
272 }
242 } 273 }
243 else
244 break;
245
246 int consumed = ol - outputbuffer_len ();
247 avail -= consumed;
248 rate_avail -= consumed;
249 } 274 }
250 } 275 }
251} 276}
252 277

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines