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