1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
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 Crossfire TRT 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 it |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * 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, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * 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 along |
18 | * You should have received a copy of the GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /** |
24 | /** |
… | |
… | |
47 | |
46 | |
48 | #include <loader.h> |
47 | #include <loader.h> |
49 | |
48 | |
50 | #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 |
51 | |
50 | |
52 | #define MAX_QUEUE_DEPTH 500 |
51 | #define MAX_QUEUE_DEPTH 50 |
53 | #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. |
54 | |
56 | |
55 | void |
57 | void |
56 | client::reset_state () |
58 | client::reset_state () |
57 | { |
59 | { |
58 | if (!pl) |
60 | if (!pl) |
… | |
… | |
107 | else |
109 | else |
108 | return false; |
110 | return false; |
109 | } |
111 | } |
110 | |
112 | |
111 | void |
113 | void |
112 | flush_sockets (void) |
|
|
113 | { |
|
|
114 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
115 | (*i)->flush (); |
|
|
116 | } |
|
|
117 | |
|
|
118 | /** |
|
|
119 | * This checks the sockets for input, does the right thing. |
|
|
120 | * |
|
|
121 | * A bit of this code is grabbed out of socket.c |
|
|
122 | * There are 2 lists we need to look through - init_sockets is a list |
|
|
123 | * |
|
|
124 | */ |
|
|
125 | void |
|
|
126 | doeric_server (void) |
|
|
127 | { |
|
|
128 | //TODO: should not be done here, either |
|
|
129 | for (unsigned i = 0; i < clients.size (); ++i) |
|
|
130 | { |
|
|
131 | client *ns = clients [i]; |
|
|
132 | |
|
|
133 | ns->tick (); |
|
|
134 | ns->refcnt_chk (); |
|
|
135 | } |
|
|
136 | } |
|
|
137 | |
|
|
138 | void |
|
|
139 | client::tick () |
114 | client::tick () |
140 | { |
115 | { |
141 | if (!pl || destroyed ()) |
116 | if (!pl || destroyed ()) |
142 | return; |
117 | return; |
143 | |
118 | |
… | |
… | |
156 | |
131 | |
157 | draw_client_map (pl); |
132 | draw_client_map (pl); |
158 | |
133 | |
159 | if (update_look) |
134 | if (update_look) |
160 | 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; |
161 | |
183 | |
162 | if (ixface.empty ()) |
184 | if (ixface.empty ()) |
163 | { |
185 | { |
164 | // regularly send a new face when queue is empty |
186 | // regularly send a new face when queue is empty |
165 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
187 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
166 | while (scrub_idx < faces.size () - 1) |
188 | while (scrub_idx < faces.size () - 1) |
167 | { |
189 | { |
168 | ++scrub_idx; |
190 | ++scrub_idx; |
169 | |
191 | |
170 | 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) // only scrub faces for now |
171 | { |
195 | { |
172 | send_face (scrub_idx); |
196 | send_face (scrub_idx, -120); |
173 | flush_fx (); |
197 | flush_fx (); |
174 | |
198 | |
175 | 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 |
176 | break; |
200 | break; |
177 | } |
201 | } |
178 | } |
202 | } |
179 | |
|
|
180 | rate_avail = max_rate - outputbuffer_len (); |
|
|
181 | } |
203 | } |
182 | else |
204 | else |
183 | { |
205 | { |
184 | int ol = outputbuffer_len (); |
|
|
185 | |
|
|
186 | rate_avail = min (max_rate, rate_avail + max_rate); |
|
|
187 | rate_avail -= ol; |
|
|
188 | |
|
|
189 | int avail = rate_avail; |
|
|
190 | |
|
|
191 | // if we can split images, transfer up to mss-sized packets if possible |
|
|
192 | // but never 768 bytes more. |
|
|
193 | if (fxix) avail += min (768, mss - (ol % mss)); |
|
|
194 | |
|
|
195 | bg_scrub = BG_SCRUB_RATE; |
206 | bg_scrub = BG_SCRUB_RATE; |
196 | |
207 | |
197 | while (avail > 0) |
208 | for (;;) |
198 | { |
209 | { |
|
|
210 | int avail = max_send - outputbuffer_len (); |
|
|
211 | |
|
|
212 | if (avail <= 0) |
|
|
213 | break; |
|
|
214 | |
199 | ixsend &ix = ixface.back (); |
215 | ixsend &ix = ixface.back (); |
200 | |
216 | |
201 | if (facedata *d = face_data (ix.idx, faceset)) |
217 | if (facedata *d = face_data (ix.idx, faceset)) |
202 | { |
218 | { |
203 | if (fxix) |
219 | if (fxix) |
204 | { |
220 | { |
205 | // 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); |
206 | int chunk = min (min (avail - 40, MAXSOCKBUF - 9), ix.ofs); |
223 | int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen; |
207 | |
224 | |
|
|
225 | // only transfer something if the amount of data transferred |
|
|
226 | // has a healthy relation to the header overhead |
208 | if (chunk <= 0) |
227 | if (chunk < 64) |
209 | break; |
228 | break; |
210 | |
229 | |
|
|
230 | chunk = min (chunk, (int)ix.ofs); |
|
|
231 | |
211 | 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 |
212 | |
235 | |
213 | packet sl ("ix"); |
236 | packet sl ("ix"); |
214 | |
237 | |
215 | sl << ber32 (ix.idx) |
238 | sl << ber32 (ix.idx) |
216 | << ber32 (ix.ofs) |
239 | << ber32 (ix.ofs) |
… | |
… | |
225 | } |
248 | } |
226 | } |
249 | } |
227 | else |
250 | else |
228 | ix.ofs = 0; |
251 | ix.ofs = 0; |
229 | |
252 | |
230 | int consumed = ol - outputbuffer_len (); |
|
|
231 | |
|
|
232 | avail -= consumed; |
|
|
233 | rate_avail -= consumed; |
|
|
234 | |
|
|
235 | ol = outputbuffer_len (); |
|
|
236 | |
|
|
237 | if (!ix.ofs) |
253 | if (!ix.ofs) |
238 | { |
254 | { |
239 | ixface.pop_back (); |
255 | ixface.pop_back (); |
|
|
256 | |
240 | if (ixface.empty ()) |
257 | if (ixface.empty ()) |
241 | break; |
258 | break; |
242 | } |
259 | } |
243 | } |
260 | } |
244 | } |
261 | } |
245 | } |
|
|
246 | |
262 | |
|
|
263 | rate_avail -= outputbuffer_len (); |
|
|
264 | } |
|
|
265 | |
|
|
266 | void |
|
|
267 | client::flush_sockets (void) |
|
|
268 | { |
|
|
269 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
270 | (*i)->flush (); |
|
|
271 | } |
|
|
272 | |
|
|
273 | void |
|
|
274 | client::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 | |