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.55 by root, Sun Jul 1 05:00:20 2007 UTC vs.
Revision 1.80 by root, Thu Jul 16 23:17:44 2009 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,2008 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;
… …
92 { 95 {
93 command &cmd = cmd_queue.front (); 96 command &cmd = cmd_queue.front ();
94 97
95 if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) 98 if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
96 { 99 {
97 reset_state (); 100 reset_state (); // the command might actually reset some movement state etc.
98 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); 101
102 if (pl)
103 pl->failmsg (
104 "Cannot keep up with your commands, ignoring them! "
105 "H<Your character cannot keep up with the instructions you give G<him|her>. "
106 "Try issuing commands slower, or, if G<he|she> is incapacitated (paralyzed and so on), "
107 "wait till your character can act again.\n\nIf G<he|she> is permanently stuck, then "
108 "try the B<suicide> command (or use B<chat> to ask somebody to B<invite> you out).>"
109 );
99 } 110 }
100 else 111 else
101 execute (cmd.handler, cmd.data, cmd.datalen); 112 execute (cmd.handler, cmd.data, cmd.datalen);
102 113
114 sfree<char> (cmd.data, cmd.datalen + 1);
103 cmd_queue.pop_front (); 115 cmd_queue.pop_front ();
104 return true; 116 return true;
105 } 117 }
106 else 118 else
107 return false; 119 return false;
108} 120}
109 121
110void 122void
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}
136
137void
138client::tick () 123client::tick ()
139{ 124{
140 if (!pl || destroyed ()) 125 if (!pl || destroyed ())
141 return; 126 return;
127
128 pl->dirty = true;
142 129
143 /* Update the players stats once per tick. More efficient than 130 /* Update the players stats once per tick. More efficient than
144 * sending them whenever they change, and probably just as useful 131 * sending them whenever they change, and probably just as useful
145 */ 132 */
146 esrv_update_stats (pl); 133 esrv_update_stats (pl);
147 134
148 if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) 135 sint32 weight = pl->ob->client_weight ();
136
137 if (last_weight != weight)
149 { 138 {
139 pl->ob->update_stats ();
150 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); 140 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
151 if (last_weight != WEIGHT (pl->ob))
152 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));
154 } 141 }
155 142
156 draw_client_map (pl); 143 draw_client_map (pl);
157 144
158 if (update_look) 145 if (update_look)
159 esrv_draw_look (pl); 146 esrv_draw_look (pl);
160 147
148 mapinfo_queue_run ();
149
150#if HAVE_TCP_INFO
151 // check time of last ack, and, if too old, kill connection
152 socklen_t len = sizeof (tcpi);
153
154 if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
155 {
156 if (tcpi.tcpi_snd_mss)
157 mss = tcpi.tcpi_snd_mss;
158
159#if 0
160 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",
161 tcpi.tcpi_unacked,
162 tcpi.tcpi_sacked,
163 tcpi.tcpi_lost,
164 tcpi.tcpi_retrans,
165 tcpi.tcpi_fackets,
166 tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
167
168 tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
169#endif
170
171 // fast-time-out a player by checking for missing acks
172 // do this only when player is active
173 if (pl && pl->active
174 && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000))
175 {
176 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
177 write_outputbuffer ();
178
179 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
180 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
181 destroy ();
182 }
183 }
184#endif
185
186 rate_avail = min (max_rate + mss, rate_avail + max_rate);
187
188 int max_send = rate_avail;
189
190#if HAVE_TCP_INFO
191 // further restrict the available bandwidth by the excess bandwidth available
192 max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
193#endif
194
195 // round to next-lowest mss
196 max_send -= max_send % mss;
197
161 if (ixface.empty ()) 198 if (ixface.empty ())
162 { 199 {
163 // regularly send a new face when queue is empty 200 // regularly send a new face when queue is empty
164 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 201 if (bg_scrub && !--bg_scrub)
165 while (scrub_idx < faces.size () - 1) 202 while (scrub_idx < faces.size () - 1)
166 { 203 {
167 ++scrub_idx; 204 ++scrub_idx;
168 205
169 if (!faces_sent [scrub_idx]) 206 if (!faces_sent [scrub_idx])
207 if (faceinfo *f = face_info (scrub_idx))
208 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
170 { 209 {
171 send_face (scrub_idx); 210 send_face (scrub_idx, -120);
172 flush_fx (); 211 flush_fx ();
173 212
174 bg_scrub = 1; // send up to one face per tick, unless an image was requested 213 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
175 break; 214 break;
176 } 215 }
177 } 216 }
178
179 rate_avail = max_rate - outputbuffer_len ();
180 } 217 }
181 else 218 else
182 { 219 {
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-sized packets if possible
191 // but never 768 bytes more.
192 if (fxix) avail += min (768, mss - (ol % mss));
193
194 bg_scrub = BG_SCRUB_RATE; 220 bg_scrub = BG_SCRUB_RATE;
195 221
196 while (avail > 0) 222 for (;;)
197 { 223 {
224 int avail = max_send - outputbuffer_len ();
225
226 if (avail <= 0)
227 break;
228
198 ixsend &ix = ixface.back (); 229 ixsend &ix = ixface.back ();
199 230
200 if (facedata *d = face_data (ix.idx, faceset)) 231 if (facedata *d = face_data (ix.idx, faceset))
201 { 232 {
202 if (fxix) 233 // estimate the packet header overhead "ix " + idx + (new)ofs
203 { 234 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
204 // 9 bytes is enough for fx_FFFOOO, 40 leaves some room for image data 235 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
205 int chunk = min (min (avail - 40, MAXSOCKBUF - 9), ix.ofs);
206 236
237 // only transfer something if the amount of data transferred
238 // has a healthy relation to the header overhead
207 if (chunk <= 0) 239 if (chunk < 64)
208 break; 240 break;
209 241
242 chunk = min (chunk, (int)ix.ofs);
243
210 ix.ofs -= chunk; 244 ix.ofs -= chunk;
211 245
246 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
247
212 packet sl ("ix"); 248 packet sl ("ix");
213 249
214 sl << ber32 (ix.idx) 250 sl << ber32 (ix.idx)
215 << ber32 (ix.ofs) 251 << ber32 (ix.ofs)
216 << data (d->data.data () + ix.ofs, chunk); 252 << data (d->data.data () + ix.ofs, chunk);
217 253
218 send_packet (sl); 254 send_packet (sl);
219 }
220 else
221 {
222 send_image (ix.idx);
223 ix.ofs = 0;
224 }
225 } 255 }
226 else 256 else
227 ix.ofs = 0; 257 ix.ofs = 0;
228 258
229 int consumed = ol - outputbuffer_len ();
230
231 avail -= consumed;
232 rate_avail -= consumed;
233
234 ol = outputbuffer_len ();
235
236 if (!ix.ofs) 259 if (!ix.ofs)
237 { 260 {
238 ixface.pop_back (); 261 ixface.pop_back ();
262
239 if (ixface.empty ()) 263 if (ixface.empty ())
240 break; 264 break;
241 } 265 }
242 } 266 }
243 } 267 }
244}
245 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