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.67 by root, Tue Jul 31 20:10:31 2007 UTC

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 8.
53 56
54void 57void
55client::reset_state () 58client::reset_state ()
56{ 59{
57 if (!pl) 60 if (!pl)
106 else 109 else
107 return false; 110 return false;
108} 111}
109 112
110void 113void
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 () 114client::tick ()
139{ 115{
140 if (!pl || destroyed ()) 116 if (!pl || destroyed ())
141 return; 117 return;
142 118
155 131
156 draw_client_map (pl); 132 draw_client_map (pl);
157 133
158 if (update_look) 134 if (update_look)
159 esrv_draw_look (pl); 135 esrv_draw_look (pl);
136
137#if HAVE_TCP_INFO
138 // check time of last ack, and, if too old, kill connection
139 socklen_t len = sizeof (tcpi);
140
141 if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
142 {
143 if (tcpi.tcpi_snd_mss)
144 mss = tcpi.tcpi_snd_mss;
145
146#if 0
147 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",
148 tcpi.tcpi_unacked,
149 tcpi.tcpi_sacked,
150 tcpi.tcpi_lost,
151 tcpi.tcpi_retrans,
152 tcpi.tcpi_fackets,
153 tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
154
155 tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
156#endif
157
158 // do this only when player is active
159 if (pl && pl->active
160 && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000))
161 {
162 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
163 write_outputbuffer ();
164
165 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
166 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
167 destroy ();
168 }
169 }
170#endif
171
172 rate_avail = min (max_rate + mss, rate_avail + max_rate);
173
174 int max_send = rate_avail;
175
176#if HAVE_TCP_INFO
177 // further restrict the available bandwidth by the excess bandwidth available
178 max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
179#endif
180
181 // if we can split images, round to next-lowest mss
182 if (fxix) max_send -= max_send % mss;
160 183
161 if (ixface.empty ()) 184 if (ixface.empty ())
162 { 185 {
163 // regularly send a new face when queue is empty 186 // regularly send a new face when queue is empty
164 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 187 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
165 while (scrub_idx < faces.size () - 1) 188 while (scrub_idx < faces.size () - 1)
166 { 189 {
167 ++scrub_idx; 190 ++scrub_idx;
168 191
169 if (!faces_sent [scrub_idx]) 192 if (!faces_sent [scrub_idx])
193 if (faceinfo *f = face_info (scrub_idx))
194 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
170 { 195 {
171 send_face (scrub_idx); 196 send_face (scrub_idx, -120);
172 flush_fx (); 197 flush_fx ();
173 198
174 bg_scrub = 1; // send up to one face per tick, unless an image was requested 199 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
175 break; 200 break;
176 } 201 }
177 } 202 }
178
179 rate_avail = max_rate - outputbuffer_len ();
180 } 203 }
181 else 204 else
182 { 205 {
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; 206 bg_scrub = BG_SCRUB_RATE;
195 207
196 while (avail > 0) 208 for (;;)
197 { 209 {
210 int avail = max_send - outputbuffer_len ();
211
212 if (avail <= 0)
213 break;
214
198 ixsend &ix = ixface.back (); 215 ixsend &ix = ixface.back ();
199 216
200 if (facedata *d = face_data (ix.idx, faceset)) 217 if (facedata *d = face_data (ix.idx, faceset))
201 { 218 {
202 if (fxix) 219 if (fxix)
203 { 220 {
204 // 9 bytes is enough for fx_FFFOOO, 40 leaves some room for image data 221 // estimate the packet header overhead "ix " + idx + (new)ofs
222 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
205 int chunk = min (min (avail - 40, MAXSOCKBUF - 9), ix.ofs); 223 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
206 224
225 // only transfer something if the amount of data transferred
226 // has a healthy relation to the header overhead
207 if (chunk <= 0) 227 if (chunk < 64)
208 break; 228 break;
209 229
230 chunk = min (chunk, (int)ix.ofs);
231
210 ix.ofs -= chunk; 232 ix.ofs -= chunk;
233
234 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
211 235
212 packet sl ("ix"); 236 packet sl ("ix");
213 237
214 sl << ber32 (ix.idx) 238 sl << ber32 (ix.idx)
215 << ber32 (ix.ofs) 239 << ber32 (ix.ofs)
224 } 248 }
225 } 249 }
226 else 250 else
227 ix.ofs = 0; 251 ix.ofs = 0;
228 252
229 int consumed = ol - outputbuffer_len ();
230
231 avail -= consumed;
232 rate_avail -= consumed;
233
234 ol = outputbuffer_len ();
235
236 if (!ix.ofs) 253 if (!ix.ofs)
237 { 254 {
238 ixface.pop_back (); 255 ixface.pop_back ();
256
239 if (ixface.empty ()) 257 if (ixface.empty ())
240 break; 258 break;
241 } 259 }
242 } 260 }
243 } 261 }
244}
245 262
263 rate_avail -= outputbuffer_len ();
264}
265
266void
267client::flush_sockets (void)
268{
269 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
270 (*i)->flush ();
271}
272
273void
274client::clock (void)
275{
276 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
277 (*i)->tick ();
278
279 // give them all the same chances
280 flush_sockets ();
281
282 //TODO: should not be done here, either
283 for (unsigned i = 0; i < clients.size (); ++i)
284 clients[i]->refcnt_chk ();
285}
286

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines