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.49 by root, Mon May 28 21:22:26 2007 UTC vs.
Revision 1.66 by root, Mon Jul 30 02:03:03 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 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 ();
… …
91 && state == ST_PLAYING 93 && state == ST_PLAYING
92 && pl->ob->speed_left > 0.f) 94 && pl->ob->speed_left > 0.f)
93 { 95 {
94 command &cmd = cmd_queue.front (); 96 command &cmd = cmd_queue.front ();
95 97
96 if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) 98 if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
97 { 99 {
98 reset_state (); 100 reset_state ();
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
… …
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#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
134 for (unsigned i = 0; i < clients.size (); ++i)
135 {
136 client *ns = clients [i];
137
138 ns->tick ();
139 ns->refcnt_chk ();
140 }
141}
142
143void
144client::tick () 114client::tick ()
145{ 115{
146 if (!pl || destroyed ()) 116 if (!pl || destroyed ())
147 return; 117 return;
148 118
… …
157 if (last_weight != WEIGHT (pl->ob)) 127 if (last_weight != WEIGHT (pl->ob))
158 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",
159 (unsigned long) last_weight, WEIGHT (pl->ob)); 129 (unsigned long) last_weight, WEIGHT (pl->ob));
160 } 130 }
161 131
162 draw_client_map (pl->ob); 132 draw_client_map (pl);
163 133
164 if (update_look) 134 if (update_look)
165 esrv_draw_look (pl->ob); 135 esrv_draw_look (pl);
166 136
167 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 ())
168 { 185 {
169 // regularly send a new face when queue is empty 186 // regularly send a new face when queue is empty
170 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 187 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
171 while (scrub_idx < faces.size () - 1) 188 while (scrub_idx < faces.size () - 1)
172 { 189 {
173 ++scrub_idx; 190 ++scrub_idx;
191
174 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) // only scrub faces for now
175 { 195 {
176 send_face (scrub_idx); 196 send_face (scrub_idx, -120);
177 flush_fx (); 197 flush_fx ();
178 198
179 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
180 break; 200 break;
181 } 201 }
182 } 202 }
183
184 rate_avail = max_rate - outputbuffer_len ();
185 } 203 }
186 else 204 else
187 { 205 {
188 int ol = outputbuffer_len ();
189
190 rate_avail = min (max_rate, rate_avail + max_rate);
191 rate_avail -= ol;
192
193 int avail = rate_avail;
194
195 // if we can split images, transfer up to mss packets if possible
196 // but never more 768 bytes more.
197 if (fxix) avail += min (768, mss - (ol % mss));
198
199 bg_scrub = BG_SCRUB_RATE; 206 bg_scrub = BG_SCRUB_RATE;
200 207
201 while (avail > 0) 208 for (;;)
202 { 209 {
203 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))
204 { 218 {
205 if (facedata *d = face_data (partial_face, faceset)) 219 if (fxix)
206 { 220 {
207 // 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);
208 int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs); 223 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
209 224
225 // only transfer something if the amount of data transferred
226 // has a healthy relation to the header overhead
210 if (chunk <= 0) 227 if (chunk < 64)
211 break; 228 break;
212 229
230 chunk = min (chunk, (int)ix.ofs);
231
213 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
214 235
215 packet sl ("ix"); 236 packet sl ("ix");
216 237
217 sl << ber32 (partial_face) 238 sl << ber32 (ix.idx)
218 << ber32 (partial_face_ofs) 239 << ber32 (ix.ofs)
219 << data (d->data.data () + partial_face_ofs, chunk); 240 << data (d->data.data () + ix.ofs, chunk);
220 241
221 send_packet (sl); 242 send_packet (sl);
222 } 243 }
223 else 244 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)
233 { 245 {
234 if (facedata *d = face_data (facenum, faceset)) 246 send_image (ix.idx);
235 { 247 ix.ofs = 0;
236 partial_face = facenum;
237 partial_face_ofs = d->data.size ();
238 }
239 } 248 }
240 else
241 send_image (facenum);
242 } 249 }
243 else 250 else
251 ix.ofs = 0;
252
253 if (!ix.ofs)
254 {
255 ixface.pop_back ();
256
257 if (ixface.empty ())
244 break; 258 break;
245 259 }
246 int consumed = ol - outputbuffer_len ();
247 avail -= consumed;
248 rate_avail -= consumed;
249 } 260 }
250 } 261 }
251}
252 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