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.47 by root, Sat May 12 22:04:20 2007 UTC vs.
Revision 1.67 by root, Tue Jul 31 20:10:31 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 * Crossfire TRT 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.
21 * 20 *
22 * The author 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/**
26 * \file 25 * \file
27 * Main client/server loops. 26 * Main client/server loops.
… …
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 50
53#define MAX_QUEUE_BACKLOG 3. //TODO 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)
… …
63} 65}
64 66
65void 67void
66client::queue_command (packet_type *handler, char *data, int datalen) 68client::queue_command (packet_type *handler, char *data, int datalen)
67{ 69{
68 tstamp stamp = now (); 70 tstamp stamp = NOW;
69 71
70 if (cmd_queue.size () >= MAX_QUEUE_DEPTH) 72 if (cmd_queue.size () >= MAX_QUEUE_DEPTH)
71 { 73 {
72 //TODO: just disconnect here? 74 //TODO: just disconnect here?
73 reset_state (); 75 reset_state ();
… …
85} 87}
86 88
87bool 89bool
88client::handle_command () 90client::handle_command ()
89{ 91{
90 bool skipping = false;
91
92 while (!cmd_queue.empty () 92 if (!cmd_queue.empty ()
93 && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0.f)) 93 && state == ST_PLAYING
94 && pl->ob->speed_left > 0.f)
94 { 95 {
95 command &cmd = cmd_queue.front (); 96 command &cmd = cmd_queue.front ();
96 97
97 if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) 98 if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
98 { 99 {
99 if (!skipping)
100 {
101 skipping = true;
102 reset_state (); 100 reset_state ();
103 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); 101 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
104 }
105
106 cmd_queue.pop_front ();
107 } 102 }
108 else 103 else
109 {
110 execute (cmd.handler, cmd.data, cmd.datalen); 104 execute (cmd.handler, cmd.data, cmd.datalen);
105
111 cmd_queue.pop_front (); 106 cmd_queue.pop_front ();
112 return true; 107 return true;
113 }
114 } 108 }
115 109 else
116 return false; 110 return false;
117}
118
119void
120flush_sockets (void)
121{
122 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
123 (*i)->flush ();
124}
125
126/**
127 * This checks the sockets for input, does the right thing.
128 *
129 * A bit of this code is grabbed out of socket.c
130 * There are 2 lists we need to look through - init_sockets is a list
131 *
132 */
133void
134doeric_server (void)
135{
136#ifdef CS_LOGSTATS
137 if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME)
138 write_cs_stats ();
139#endif
140
141 //TODO: should not be done here, either
142 for (unsigned i = 0; i < clients.size (); ++i)
143 {
144 client *ns = clients [i];
145
146 ns->tick ();
147 ns->refcnt_chk ();
148 }
149} 111}
150 112
151void 113void
152client::tick () 114client::tick ()
153{ 115{
… …
165 if (last_weight != WEIGHT (pl->ob)) 127 if (last_weight != WEIGHT (pl->ob))
166 LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", 128 LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
167 (unsigned long) last_weight, WEIGHT (pl->ob)); 129 (unsigned long) last_weight, WEIGHT (pl->ob));
168 } 130 }
169 131
170 draw_client_map (pl->ob); 132 draw_client_map (pl);
171 133
172 if (update_look) 134 if (update_look)
173 esrv_draw_look (pl->ob); 135 esrv_draw_look (pl);
174 136
175 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 // do this only when player is active
159 if (pl && pl->active
160 && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000))
161 {
162 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
163 write_outputbuffer ();
164
165 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
166 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
167 destroy ();
168 }
169 }
170#endif
171
172 rate_avail = min (max_rate + mss, rate_avail + max_rate);
173
174 int max_send = rate_avail;
175
176#if HAVE_TCP_INFO
177 // further restrict the available bandwidth by the excess bandwidth available
178 max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
179#endif
180
181 // if we can split images, round to next-lowest mss
182 if (fxix) max_send -= max_send % mss;
183
184 if (ixface.empty ())
176 { 185 {
177 // regularly send a new face when queue is empty 186 // regularly send a new face when queue is empty
178 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 187 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
179 while (scrub_idx < faces.size () - 1) 188 while (scrub_idx < faces.size () - 1)
180 { 189 {
181 ++scrub_idx; 190 ++scrub_idx;
191
182 if (!faces_sent [scrub_idx]) 192 if (!faces_sent [scrub_idx])
193 if (faceinfo *f = face_info (scrub_idx))
194 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
183 { 195 {
184 send_face (scrub_idx); 196 send_face (scrub_idx, -120);
185 flush_fx (); 197 flush_fx ();
186 198
187 bg_scrub = 1; // send up to one face per tick, unless an image was requested 199 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
188 break; 200 break;
189 } 201 }
190 } 202 }
191
192 rate_avail = max_rate - outputbuffer_len ();
193 } 203 }
194 else 204 else
195 { 205 {
196 int ol = outputbuffer_len ();
197
198 rate_avail = min (max_rate, rate_avail + max_rate);
199 rate_avail -= ol;
200
201 int avail = rate_avail;
202
203 // if we can split images, transfer up to mss packets if possible
204 // but never more 768 bytes more.
205 if (fxix) avail += min (768, mss - (ol % mss));
206
207 bg_scrub = BG_SCRUB_RATE; 206 bg_scrub = BG_SCRUB_RATE;
208 207
209 while (avail > 0) 208 for (;;)
210 { 209 {
211 if (partial_face_ofs) 210 int avail = max_send - outputbuffer_len ();
211
212 if (avail <= 0)
213 break;
214
215 ixsend &ix = ixface.back ();
216
217 if (facedata *d = face_data (ix.idx, faceset))
212 { 218 {
213 if (facedata *d = face_data (partial_face, faceset)) 219 if (fxix)
214 { 220 {
215 // 9 bytes is enough for fx_FFFOOO, 40 leaves some room 221 // estimate the packet header overhead "ix " + idx + (new)ofs
222 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
216 int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs); 223 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
217 224
225 // only transfer something if the amount of data transferred
226 // has a healthy relation to the header overhead
218 if (chunk <= 0) 227 if (chunk < 64)
219 break; 228 break;
220 229
230 chunk = min (chunk, (int)ix.ofs);
231
221 partial_face_ofs -= chunk; 232 ix.ofs -= chunk;
233
234 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
222 235
223 packet sl ("ix"); 236 packet sl ("ix");
224 237
225 sl << ber32 (partial_face) 238 sl << ber32 (ix.idx)
226 << ber32 (partial_face_ofs) 239 << ber32 (ix.ofs)
227 << data (d->data.data () + partial_face_ofs, chunk); 240 << data (d->data.data () + ix.ofs, chunk);
228 241
229 send_packet (sl); 242 send_packet (sl);
230 } 243 }
231 else 244 else
232 partial_face_ofs = 0;
233 }
234 else if (!askface.empty ())
235 {
236 // use a lifo to send most recently requested images
237 faceidx facenum = askface.back ();
238 askface.pop_back ();
239
240 if (fxix)
241 { 245 {
242 if (facedata *d = face_data (facenum, faceset)) 246 send_image (ix.idx);
243 { 247 ix.ofs = 0;
244 partial_face = facenum;
245 partial_face_ofs = d->data.size ();
246 }
247 } 248 }
248 else
249 send_image (facenum);
250 } 249 }
251 else 250 else
251 ix.ofs = 0;
252
253 if (!ix.ofs)
254 {
255 ixface.pop_back ();
256
257 if (ixface.empty ())
252 break; 258 break;
253 259 }
254 int consumed = ol - outputbuffer_len ();
255 avail -= consumed;
256 rate_avail -= consumed;
257 } 260 }
258 } 261 }
259}
260 262
263 rate_avail -= outputbuffer_len ();
264}
265
266void
267client::flush_sockets (void)
268{
269 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
270 (*i)->flush ();
271}
272
273void
274client::clock (void)
275{
276 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
277 (*i)->tick ();
278
279 // give them all the same chances
280 flush_sockets ();
281
282 //TODO: should not be done here, either
283 for (unsigned i = 0; i < clients.size (); ++i)
284 clients[i]->refcnt_chk ();
285}
286

Diff Legend

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