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

Diff Legend

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