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

Diff Legend

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