| 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 | /** |
| … | |
… | |
| 167 | { |
166 | { |
| 168 | ++scrub_idx; |
167 | ++scrub_idx; |
| 169 | |
168 | |
| 170 | if (!faces_sent [scrub_idx]) |
169 | if (!faces_sent [scrub_idx]) |
| 171 | { |
170 | { |
| 172 | send_face (scrub_idx); |
171 | send_face (scrub_idx, -120); |
| 173 | flush_fx (); |
172 | flush_fx (); |
| 174 | |
173 | |
| 175 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
174 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
| 176 | break; |
175 | break; |
| 177 | } |
176 | } |
| … | |
… | |
| 179 | |
178 | |
| 180 | rate_avail = max_rate - outputbuffer_len (); |
179 | rate_avail = max_rate - outputbuffer_len (); |
| 181 | } |
180 | } |
| 182 | else |
181 | else |
| 183 | { |
182 | { |
| 184 | int ol = outputbuffer_len (); |
183 | bool overload = false; |
| 185 | |
184 | |
| 186 | rate_avail = min (max_rate, rate_avail + max_rate); |
185 | #if HAVE_TCP_INFO |
| 187 | rate_avail -= ol; |
186 | // do bandwidth checking |
| 188 | |
187 | if (tcpi.tcpi_unacked + 1 > max (4, tcpi.tcpi_snd_cwnd)) |
| 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; |
|
|
| 196 | |
|
|
| 197 | while (avail > 0) |
|
|
| 198 | { |
188 | { |
| 199 | ixsend &ix = ixface.back (); |
189 | overload = true; |
| 200 | |
190 | if (next_rate_adjust <= NOW) |
| 201 | if (facedata *d = face_data (ix.idx, faceset)) |
|
|
| 202 | { |
191 | { |
| 203 | if (fxix) |
192 | next_rate_adjust = NOW + 2; |
|
|
193 | max_rate = max (max_rate >> 1, int (5000 * TICK)); |
|
|
194 | LOG (llevDebug, "tcp %s overloaded (%d + 1 > 4 | %d), rate now %d\n", |
|
|
195 | host, (int)tcpi.tcpi_unacked, (int)tcpi.tcpi_snd_cwnd, int (max_rate / TICK));//D |
|
|
196 | send_packet_printf ("drawinfo %d Due to possible network congestion, your output-rate has been reduced to %dbps.", |
|
|
197 | NDI_RED, int (max_rate / TICK)); |
|
|
198 | } |
|
|
199 | } |
|
|
200 | #endif |
|
|
201 | |
|
|
202 | if (!overload) |
|
|
203 | { |
|
|
204 | int ol = outputbuffer_len (); |
|
|
205 | |
|
|
206 | rate_avail = min (max_rate, rate_avail + max_rate); |
|
|
207 | rate_avail -= ol; |
|
|
208 | |
|
|
209 | int avail = rate_avail; |
|
|
210 | |
|
|
211 | // if we can split images, transfer up to mss-sized packets if possible |
|
|
212 | // but never 768 bytes more. |
|
|
213 | if (fxix) avail += min (768, mss - (ol % mss)); |
|
|
214 | |
|
|
215 | bg_scrub = BG_SCRUB_RATE; |
|
|
216 | |
|
|
217 | while (avail > 0) |
|
|
218 | { |
|
|
219 | ixsend &ix = ixface.back (); |
|
|
220 | |
|
|
221 | if (facedata *d = face_data (ix.idx, faceset)) |
| 204 | { |
222 | { |
| 205 | // 9 bytes is enough for fx_FFFOOO, 40 leaves some room for image data |
223 | if (fxix) |
|
|
224 | { |
|
|
225 | // only transfer something if the amount of data transferred |
|
|
226 | // has a healthy relation to the header overhead |
|
|
227 | if (avail <= 40) |
|
|
228 | break; |
|
|
229 | |
|
|
230 | // 9 bytes is enough for fx_FFFOOO |
| 206 | int chunk = min (min (avail - 40, MAXSOCKBUF - 9), ix.ofs); |
231 | int chunk = min (min (avail, MAXSOCKBUF - 9), (int)ix.ofs); |
| 207 | |
232 | |
| 208 | if (chunk <= 0) |
233 | if (chunk <= 0) |
| 209 | break; |
234 | break; |
| 210 | |
235 | |
| 211 | ix.ofs -= chunk; |
236 | ix.ofs -= chunk; |
| 212 | |
237 | |
|
|
238 | //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
|
|
239 | |
| 213 | packet sl ("ix"); |
240 | packet sl ("ix"); |
| 214 | |
241 | |
| 215 | sl << ber32 (ix.idx) |
242 | sl << ber32 (ix.idx) |
| 216 | << ber32 (ix.ofs) |
243 | << ber32 (ix.ofs) |
| 217 | << data (d->data.data () + ix.ofs, chunk); |
244 | << data (d->data.data () + ix.ofs, chunk); |
| 218 | |
245 | |
| 219 | send_packet (sl); |
246 | send_packet (sl); |
|
|
247 | } |
|
|
248 | else |
|
|
249 | { |
|
|
250 | send_image (ix.idx); |
|
|
251 | ix.ofs = 0; |
|
|
252 | } |
| 220 | } |
253 | } |
| 221 | else |
254 | else |
|
|
255 | ix.ofs = 0; |
|
|
256 | |
|
|
257 | int consumed = outputbuffer_len () - ol; |
|
|
258 | |
|
|
259 | avail -= consumed; |
|
|
260 | rate_avail -= consumed; |
|
|
261 | |
|
|
262 | ol = outputbuffer_len (); |
|
|
263 | |
|
|
264 | if (!ix.ofs) |
| 222 | { |
265 | { |
| 223 | send_image (ix.idx); |
266 | ixface.pop_back (); |
| 224 | ix.ofs = 0; |
267 | |
|
|
268 | if (ixface.empty ()) |
|
|
269 | break; |
| 225 | } |
270 | } |
| 226 | } |
271 | } |
| 227 | else |
|
|
| 228 | ix.ofs = 0; |
|
|
| 229 | |
|
|
| 230 | int consumed = ol - outputbuffer_len (); |
|
|
| 231 | |
|
|
| 232 | avail -= consumed; |
|
|
| 233 | rate_avail -= consumed; |
|
|
| 234 | |
|
|
| 235 | ol = outputbuffer_len (); |
|
|
| 236 | |
|
|
| 237 | if (!ix.ofs) |
|
|
| 238 | { |
|
|
| 239 | ixface.pop_back (); |
|
|
| 240 | if (ixface.empty ()) |
|
|
| 241 | break; |
|
|
| 242 | } |
|
|
| 243 | } |
272 | } |
| 244 | } |
273 | } |
| 245 | } |
274 | } |
| 246 | |
275 | |
