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.60 by root, Thu Jul 12 19:36:58 2007 UTC vs.
Revision 1.82 by root, Mon Oct 12 14:00:59 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 it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * 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 Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24/** 25/**
25 * \file 26 * \file
26 * Main client/server loops. 27 * Main client/server loops.
… …
46 47
47#include <loader.h> 48#include <loader.h>
48 49
49#define BG_SCRUB_RATE 4 // how often to send a face in the background 50#define BG_SCRUB_RATE 4 // how often to send a face in the background
50 51
51#define MAX_QUEUE_DEPTH 500 52#define MAX_QUEUE_DEPTH 50
52#define MAX_QUEUE_BACKLOG 3. 53#define MAX_QUEUE_BACKLOG 3.
53 54
54void 55void
55client::reset_state () 56client::reset_state ()
56{ 57{
… …
72 reset_state (); 73 reset_state ();
73 send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); 74 send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED);
74 } 75 }
75 else 76 else
76 { 77 {
77 cmd_queue.push_back (command ()); 78 cmd_queue.resize (cmd_queue.size () + 1);
78 command &cmd = cmd_queue.back (); 79 command &cmd = cmd_queue.back ();
79 cmd.stamp = stamp; 80 cmd.stamp = stamp;
80 cmd.handler = handler; 81 cmd.handler = handler;
81 cmd.data = salloc<char> (datalen + 1, data); 82 cmd.data = salloc<char> (datalen + 1, data);
82 cmd.datalen = datalen; 83 cmd.datalen = datalen;
… …
92 { 93 {
93 command &cmd = cmd_queue.front (); 94 command &cmd = cmd_queue.front ();
94 95
95 if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) 96 if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW)
96 { 97 {
97 reset_state (); 98 reset_state (); // the command might actually reset some movement state etc.
98 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); 99
100 if (pl)
101 pl->failmsg (
102 "Cannot keep up with your commands, ignoring them! "
103 "H<Your character cannot keep up with the instructions you give G<him|her>. "
104 "Try issuing commands slower, or, if G<he|she> is incapacitated (paralyzed and so on), "
105 "wait till your character can act again.\n\nIf G<he|she> is permanently stuck, then "
106 "try the B<suicide> command (or use B<chat> to ask somebody to B<invite> you out).>"
107 );
99 } 108 }
100 else 109 else
101 execute (cmd.handler, cmd.data, cmd.datalen); 110 execute (cmd.handler, cmd.data, cmd.datalen);
102 111
112 sfree<char> (cmd.data, cmd.datalen + 1);
103 cmd_queue.pop_front (); 113 cmd_queue.pop_front ();
104 return true; 114 return true;
105 } 115 }
106 else 116 else
107 return false; 117 return false;
108} 118}
109 119
110void 120void
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 () 121client::tick ()
139{ 122{
140 if (!pl || destroyed ()) 123 if (!pl || destroyed ())
141 return; 124 return;
125
126 pl->dirty = true;
142 127
143 /* Update the players stats once per tick. More efficient than 128 /* Update the players stats once per tick. More efficient than
144 * sending them whenever they change, and probably just as useful 129 * sending them whenever they change, and probably just as useful
145 */ 130 */
146 esrv_update_stats (pl); 131 esrv_update_stats (pl);
147 132
148 if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) 133 sint32 weight = pl->ob->client_weight ();
134
135 if (last_weight != weight)
149 { 136 {
137 pl->ob->update_stats ();
150 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); 138 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 } 139 }
155 140
156 draw_client_map (pl); 141 draw_client_map (pl);
157 142
158 if (update_look) 143 if (update_look)
159 esrv_draw_look (pl); 144 esrv_draw_look (pl);
160 145
146 mapinfo_queue_run ();
147
148#if HAVE_TCP_INFO
149 // check time of last ack, and, if too old, kill connection
150 socklen_t len = sizeof (tcpi);
151
152 if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
153 {
154 if (tcpi.tcpi_snd_mss)
155 mss = tcpi.tcpi_snd_mss;
156
157#if 0
158 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",
159 tcpi.tcpi_unacked,
160 tcpi.tcpi_sacked,
161 tcpi.tcpi_lost,
162 tcpi.tcpi_retrans,
163 tcpi.tcpi_fackets,
164 tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
165
166 tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
167#endif
168
169 // fast-time-out a player by checking for missing acks
170 // do this only when player is active
171 if (pl && pl->active
172 && tcpi.tcpi_last_ack_recv > int (socket_timeout * 1000))
173 {
174 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
175 write_outputbuffer ();
176
177 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
178 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
179 destroy ();
180 }
181 }
182#endif
183
184 rate_avail = min (max_rate + mss, rate_avail + max_rate);
185
186 int max_send = rate_avail;
187
188#if HAVE_TCP_INFO
189 // further restrict the available bandwidth by the excess bandwidth available
190 max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
191#endif
192
193 // round to next-lowest mss
194 max_send -= max_send % mss;
195
161 if (ixface.empty ()) 196 if (ixface.empty ())
162 { 197 {
163 // regularly send a new face when queue is empty 198 // regularly send a new face when queue is empty
164 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 199 if (bg_scrub && !--bg_scrub)
165 while (scrub_idx < faces.size () - 1) 200 while (scrub_idx < faces.size () - 1)
166 { 201 {
167 ++scrub_idx; 202 ++scrub_idx;
168 203
169 if (!faces_sent [scrub_idx]) 204 if (!faces_sent [scrub_idx])
205 if (faceinfo *f = face_info (scrub_idx))
206 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
170 { 207 {
171 send_face (scrub_idx); 208 send_face (scrub_idx, -120);
172 flush_fx (); 209 flush_fx ();
173 210
174 bg_scrub = 1; // send up to one face per tick, unless an image was requested 211 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
175 break; 212 break;
176 } 213 }
177 } 214 }
178
179 rate_avail = max_rate - outputbuffer_len ();
180 }
181 else if (!outq) // only send when bandwidht allows it
182 { 215 }
183 int ol = outputbuffer_len (); 216 else
184 217 {
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; 218 bg_scrub = BG_SCRUB_RATE;
195 219
196 while (avail > 0) 220 for (;;)
197 { 221 {
222 int avail = max_send - outputbuffer_len ();
223
224 if (avail <= 0)
225 break;
226
198 ixsend &ix = ixface.back (); 227 ixsend &ix = ixface.back ();
199 228
200 if (facedata *d = face_data (ix.idx, faceset)) 229 if (facedata *d = face_data (ix.idx, faceset))
201 { 230 {
202 if (fxix) 231 // estimate the packet header overhead "ix " + idx + (new)ofs
203 { 232 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
233 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
234
204 // only transfer something if the amount of data transferred 235 // only transfer something if the amount of data transferred
205 // has a healthy relation to the header overhead 236 // has a healthy relation to the header overhead
206 if (avail <= 40) 237 if (chunk < 64)
207 break; 238 break;
208 239
209 // 9 bytes is enough for fx_FFFOOO 240 chunk = min (chunk, (int)ix.ofs);
210 int chunk = min (min (avail, MAXSOCKBUF - 9), (int)ix.ofs);
211 241
212 if (chunk <= 0)
213 break;
214
215 ix.ofs -= chunk; 242 ix.ofs -= chunk;
216 243
217 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D 244 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
218 245
219 packet sl ("ix"); 246 packet sl ("ix");
220 247
221 sl << ber32 (ix.idx) 248 sl << ber32 (ix.idx)
222 << ber32 (ix.ofs) 249 << ber32 (ix.ofs)
223 << data (d->data.data () + ix.ofs, chunk); 250 << data (d->data.data () + ix.ofs, chunk);
224 251
225 send_packet (sl); 252 send_packet (sl);
226 }
227 else
228 {
229 send_image (ix.idx);
230 ix.ofs = 0;
231 }
232 } 253 }
233 else 254 else
234 ix.ofs = 0; 255 ix.ofs = 0;
235
236 int consumed = outputbuffer_len () - ol;
237
238 avail -= consumed;
239 rate_avail -= consumed;
240
241 ol = outputbuffer_len ();
242 256
243 if (!ix.ofs) 257 if (!ix.ofs)
244 { 258 {
245 ixface.pop_back (); 259 ixface.pop_back ();
246 260
247 if (ixface.empty ()) 261 if (ixface.empty ())
248 break; 262 break;
249 } 263 }
250 } 264 }
251 } 265 }
252}
253 266
267 rate_avail -= outputbuffer_len ();
268}
269
270void
271client::flush_sockets (void)
272{
273 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
274 (*i)->flush ();
275}
276
277void
278client::clock (void)
279{
280 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
281 (*i)->tick ();
282
283 // give them all the same chances
284 flush_sockets ();
285
286 //TODO: should not be done here, either
287 for (unsigned i = 0; i < clients.size (); ++i)
288 clients[i]->refcnt_chk ();
289}
290

Diff Legend

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