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.65 by root, Sun Jul 29 02:24:34 2007 UTC vs.
Revision 1.72 by root, Thu Mar 13 12:20:52 2008 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 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.
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 50 51#define MAX_QUEUE_DEPTH 50
52#define MAX_QUEUE_BACKLOG 3. 52#define MAX_QUEUE_BACKLOG 3.
53 53
54// disconnect a socket after this many seconds without an ack
55#define SOCKET_TIMEOUT 16.
56
54void 57void
55client::reset_state () 58client::reset_state ()
56{ 59{
57 if (!pl) 60 if (!pl)
58 return; 61 return;
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;
98 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); 101 send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED);
99 } 102 }
100 else 103 else
101 execute (cmd.handler, cmd.data, cmd.datalen); 104 execute (cmd.handler, cmd.data, cmd.datalen);
102 105
106 sfree<char> (cmd.data, cmd.datalen + 1);
103 cmd_queue.pop_front (); 107 cmd_queue.pop_front ();
104 return true; 108 return true;
105 } 109 }
106 else 110 else
107 return false; 111 return false;
108}
109
110void
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} 112}
136 113
137void 114void
138client::tick () 115client::tick ()
139{ 116{
155 132
156 draw_client_map (pl); 133 draw_client_map (pl);
157 134
158 if (update_look) 135 if (update_look)
159 esrv_draw_look (pl); 136 esrv_draw_look (pl);
137
138 mapinfo_queue_run ();
139
140#if HAVE_TCP_INFO
141 // check time of last ack, and, if too old, kill connection
142 socklen_t len = sizeof (tcpi);
143
144 if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
145 {
146 if (tcpi.tcpi_snd_mss)
147 mss = tcpi.tcpi_snd_mss;
148
149#if 0
150 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",
151 tcpi.tcpi_unacked,
152 tcpi.tcpi_sacked,
153 tcpi.tcpi_lost,
154 tcpi.tcpi_retrans,
155 tcpi.tcpi_fackets,
156 tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
157
158 tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
159#endif
160
161 // fast-time-out a player by checking for missign acks
162 // do this only when player is active
163 if (pl && pl->active
164 && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000))
165 {
166 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
167 write_outputbuffer ();
168
169 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
170 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
171 destroy ();
172 }
173 }
174#endif
175
176 rate_avail = min (max_rate + mss, rate_avail + max_rate);
177
178 int max_send = rate_avail;
179
180#if HAVE_TCP_INFO
181 // further restrict the available bandwidth by the excess bandwidth available
182 max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
183#endif
184
185 // if we can split images, round to next-lowest mss
186 if (fxix) max_send -= max_send % mss;
160 187
161 if (ixface.empty ()) 188 if (ixface.empty ())
162 { 189 {
163 // regularly send a new face when queue is empty 190 // regularly send a new face when queue is empty
164 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 191 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
166 { 193 {
167 ++scrub_idx; 194 ++scrub_idx;
168 195
169 if (!faces_sent [scrub_idx]) 196 if (!faces_sent [scrub_idx])
170 if (faceinfo *f = face_info (scrub_idx)) 197 if (faceinfo *f = face_info (scrub_idx))
171 if (f->type == FT_FACE) // only scrub faces for now 198 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
172 { 199 {
173 send_face (scrub_idx, -120); 200 send_face (scrub_idx, -120);
174 flush_fx (); 201 flush_fx ();
175 202
176 bg_scrub = 1; // send up to one face per tick, unless an image was requested 203 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
177 break; 204 break;
178 } 205 }
179 } 206 }
180
181 rate_avail = max_rate - outputbuffer_len ();
182 } 207 }
183 else 208 else
184 { 209 {
185 int ol = outputbuffer_len ();
186
187 rate_avail = min (max_rate + mss, rate_avail + max_rate);
188
189 int avail = rate_avail;
190
191 // if we can split images, round to next-lowest mss
192 if (fxix) avail -= avail % mss;
193
194 rate_avail -= ol;
195 avail -= ol;
196
197#if HAVE_TCP_INFO
198 // further restrict the available bandwidth by the excess bandwidth available
199 avail = max (0, min (avail, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss));
200#endif
201
202 bg_scrub = BG_SCRUB_RATE; 210 bg_scrub = BG_SCRUB_RATE;
203 211
204 while (avail > 0) 212 for (;;)
205 { 213 {
214 int avail = max_send - outputbuffer_len ();
215
216 if (avail <= 0)
217 break;
218
206 ixsend &ix = ixface.back (); 219 ixsend &ix = ixface.back ();
207 220
208 if (facedata *d = face_data (ix.idx, faceset)) 221 if (facedata *d = face_data (ix.idx, faceset))
209 { 222 {
210 if (fxix) 223 if (fxix)
239 } 252 }
240 } 253 }
241 else 254 else
242 ix.ofs = 0; 255 ix.ofs = 0;
243 256
244 int consumed = outputbuffer_len () - ol;
245
246 avail -= consumed;
247 rate_avail -= consumed;
248
249 ol = outputbuffer_len ();
250
251 if (!ix.ofs) 257 if (!ix.ofs)
252 { 258 {
253 ixface.pop_back (); 259 ixface.pop_back ();
254 260
255 if (ixface.empty ()) 261 if (ixface.empty ())
256 break; 262 break;
257 } 263 }
258 } 264 }
259 } 265 }
260}
261 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