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. |
54 | |
53 | |
55 | void |
54 | void |
56 | client::reset_state () |
55 | client::reset_state () |
57 | { |
56 | { |
… | |
… | |
157 | draw_client_map (pl); |
156 | draw_client_map (pl); |
158 | |
157 | |
159 | if (update_look) |
158 | if (update_look) |
160 | esrv_draw_look (pl); |
159 | esrv_draw_look (pl); |
161 | |
160 | |
162 | if (ixface.empty () && !partial_face_ofs) |
161 | if (ixface.empty ()) |
163 | { |
162 | { |
164 | // regularly send a new face when queue is empty |
163 | // regularly send a new face when queue is empty |
165 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
164 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
166 | while (scrub_idx < faces.size () - 1) |
165 | while (scrub_idx < faces.size () - 1) |
167 | { |
166 | { |
168 | ++scrub_idx; |
167 | ++scrub_idx; |
|
|
168 | |
169 | if (!faces_sent [scrub_idx]) |
169 | if (!faces_sent [scrub_idx]) |
|
|
170 | if (faceinfo *f = face_info (scrub_idx)) |
|
|
171 | if (f->type == FT_FACE) // only scrub faces for now |
170 | { |
172 | { |
171 | send_face (scrub_idx); |
173 | send_face (scrub_idx, -120); |
172 | flush_fx (); |
174 | flush_fx (); |
173 | |
175 | |
174 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
176 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
175 | break; |
177 | break; |
176 | } |
178 | } |
177 | } |
179 | } |
178 | |
180 | |
179 | rate_avail = max_rate - outputbuffer_len (); |
181 | rate_avail = max_rate - outputbuffer_len (); |
180 | } |
182 | } |
181 | else |
183 | else |
182 | { |
184 | { |
183 | int ol = outputbuffer_len (); |
185 | int ol = outputbuffer_len (); |
184 | |
186 | |
185 | rate_avail = min (max_rate, rate_avail + max_rate); |
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 | |
186 | rate_avail -= ol; |
194 | rate_avail -= ol; |
|
|
195 | avail -= ol; |
187 | |
196 | |
188 | int avail = rate_avail; |
197 | #if HAVE_TCP_INFO |
189 | |
198 | // further restrict the available bandwidth by the excess bandwidth available |
190 | // if we can split images, transfer up to mss-sized packets if possible |
199 | avail = max (0, min (avail, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss)); |
191 | // but never 768 bytes more. |
200 | #endif |
192 | if (fxix) avail += min (768, mss - (ol % mss)); |
|
|
193 | |
201 | |
194 | bg_scrub = BG_SCRUB_RATE; |
202 | bg_scrub = BG_SCRUB_RATE; |
195 | |
203 | |
196 | while (avail > 0) |
204 | while (avail > 0) |
197 | { |
205 | { |
198 | if (partial_face_ofs) |
206 | ixsend &ix = ixface.back (); |
|
|
207 | |
|
|
208 | if (facedata *d = face_data (ix.idx, faceset)) |
199 | { |
209 | { |
200 | if (facedata *d = face_data (partial_face, faceset)) |
210 | if (fxix) |
201 | { |
211 | { |
202 | // 9 bytes is enough for fx_FFFOOO, 40 leaves some room for image data |
212 | // estimate the packet header overhead "ix " + idx + (new)ofs |
|
|
213 | int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs); |
203 | int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs); |
214 | int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen; |
204 | |
215 | |
|
|
216 | // only transfer something if the amount of data transferred |
|
|
217 | // has a healthy relation to the header overhead |
205 | if (chunk <= 0) |
218 | if (chunk < 64) |
206 | break; |
219 | break; |
207 | |
220 | |
|
|
221 | chunk = min (chunk, (int)ix.ofs); |
|
|
222 | |
208 | partial_face_ofs -= chunk; |
223 | ix.ofs -= chunk; |
|
|
224 | |
|
|
225 | //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
209 | |
226 | |
210 | packet sl ("ix"); |
227 | packet sl ("ix"); |
211 | |
228 | |
212 | sl << ber32 (partial_face) |
229 | sl << ber32 (ix.idx) |
213 | << ber32 (partial_face_ofs) |
230 | << ber32 (ix.ofs) |
214 | << data (d->data.data () + partial_face_ofs, chunk); |
231 | << data (d->data.data () + ix.ofs, chunk); |
215 | |
232 | |
216 | send_packet (sl); |
233 | send_packet (sl); |
217 | } |
234 | } |
218 | else |
235 | else |
219 | partial_face_ofs = 0; |
|
|
220 | } |
|
|
221 | else if (!ixface.empty ()) |
|
|
222 | { |
|
|
223 | // use a lifo to send most recently requested images |
|
|
224 | faceidx facenum = ixface.back (); |
|
|
225 | ixface.pop_back (); |
|
|
226 | |
|
|
227 | if (fxix) |
|
|
228 | { |
236 | { |
229 | if (facedata *d = face_data (facenum, faceset)) |
237 | send_image (ix.idx); |
230 | { |
238 | ix.ofs = 0; |
231 | partial_face = facenum; |
|
|
232 | partial_face_ofs = d->data.size (); |
|
|
233 | } |
|
|
234 | } |
239 | } |
235 | else |
|
|
236 | send_image (facenum); |
|
|
237 | } |
240 | } |
238 | else |
241 | else |
239 | break; |
242 | ix.ofs = 0; |
240 | |
243 | |
241 | int consumed = ol - outputbuffer_len (); |
244 | int consumed = outputbuffer_len () - ol; |
|
|
245 | |
242 | avail -= consumed; |
246 | avail -= consumed; |
243 | rate_avail -= consumed; |
247 | rate_avail -= consumed; |
|
|
248 | |
|
|
249 | ol = outputbuffer_len (); |
|
|
250 | |
|
|
251 | if (!ix.ofs) |
|
|
252 | { |
|
|
253 | ixface.pop_back (); |
|
|
254 | |
|
|
255 | if (ixface.empty ()) |
|
|
256 | break; |
|
|
257 | } |
244 | } |
258 | } |
245 | } |
259 | } |
246 | } |
260 | } |
247 | |
261 | |