1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 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 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
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 Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /** |
25 | /** |
… | |
… | |
49 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
50 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
50 | |
51 | |
51 | #define MAX_QUEUE_DEPTH 50 |
52 | #define MAX_QUEUE_DEPTH 50 |
52 | #define MAX_QUEUE_BACKLOG 3. |
53 | #define MAX_QUEUE_BACKLOG 3. |
53 | |
54 | |
54 | // disconnect a socket after this many seconds without an ack |
|
|
55 | #define SOCKET_TIMEOUT 16. |
|
|
56 | |
|
|
57 | void |
55 | void |
58 | client::reset_state () |
56 | client::reset_state () |
59 | { |
57 | { |
60 | if (!pl) |
58 | if (!pl) |
61 | return; |
59 | return; |
… | |
… | |
95 | { |
93 | { |
96 | command &cmd = cmd_queue.front (); |
94 | command &cmd = cmd_queue.front (); |
97 | |
95 | |
98 | if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
96 | if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
99 | { |
97 | { |
100 | reset_state (); |
98 | reset_state (); // the command might actually reset some movement state etc. |
101 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
99 | |
|
|
100 | if (pl) |
|
|
101 | pl->failmsg ( |
|
|
102 | "Cannot keep up with your commands, ignoring them! " |
|
|
103 | "H<Your character cannot keep up with the instructions you give G<him|her>. " |
|
|
104 | "Try issuing commands slower, or, if G<he|she> is incapacitated (paralyzed and so on), " |
|
|
105 | "wait till your character can act again.\n\nIf G<he|she> is permanently stuck, then " |
|
|
106 | "try the B<suicide> command (or use B<chat> to ask somebody to B<invite> you out).>" |
|
|
107 | ); |
102 | } |
108 | } |
103 | else |
109 | else |
104 | execute (cmd.handler, cmd.data, cmd.datalen); |
110 | execute (cmd.handler, cmd.data, cmd.datalen); |
105 | |
111 | |
106 | sfree<char> (cmd.data, cmd.datalen + 1); |
112 | sfree<char> (cmd.data, cmd.datalen + 1); |
… | |
… | |
114 | void |
120 | void |
115 | client::tick () |
121 | client::tick () |
116 | { |
122 | { |
117 | if (!pl || destroyed ()) |
123 | if (!pl || destroyed ()) |
118 | return; |
124 | return; |
|
|
125 | |
|
|
126 | pl->dirty = true; |
119 | |
127 | |
120 | /* Update the players stats once per tick. More efficient than |
128 | /* Update the players stats once per tick. More efficient than |
121 | * sending them whenever they change, and probably just as useful |
129 | * sending them whenever they change, and probably just as useful |
122 | */ |
130 | */ |
123 | esrv_update_stats (pl); |
131 | esrv_update_stats (pl); |
124 | |
132 | |
125 | if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) |
133 | sint32 weight = pl->ob->client_weight (); |
|
|
134 | |
|
|
135 | if (last_weight != weight) |
126 | { |
136 | { |
|
|
137 | pl->ob->update_stats (); |
127 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
138 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
128 | if (last_weight != WEIGHT (pl->ob)) |
|
|
129 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
|
|
130 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
|
|
131 | } |
139 | } |
132 | |
140 | |
133 | draw_client_map (pl); |
141 | draw_client_map (pl); |
134 | |
142 | |
135 | if (update_look) |
143 | if (update_look) |
… | |
… | |
156 | tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss, |
164 | tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss, |
157 | |
165 | |
158 | tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked)); |
166 | tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked)); |
159 | #endif |
167 | #endif |
160 | |
168 | |
161 | // fast-time-out a player by checking for missign acks |
169 | // fast-time-out a player by checking for missing acks |
162 | // do this only when player is active |
170 | // do this only when player is active |
163 | if (pl && pl->active |
171 | if (pl && pl->active |
164 | && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000)) |
172 | && tcpi.tcpi_last_ack_recv > int (socket_timeout * 1000)) |
165 | { |
173 | { |
166 | send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)"); |
174 | send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)"); |
167 | write_outputbuffer (); |
175 | write_outputbuffer (); |
168 | |
176 | |
169 | LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd, |
177 | LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd, |
… | |
… | |
180 | #if HAVE_TCP_INFO |
188 | #if HAVE_TCP_INFO |
181 | // further restrict the available bandwidth by the excess bandwidth available |
189 | // further restrict the available bandwidth by the excess bandwidth available |
182 | max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss); |
190 | max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss); |
183 | #endif |
191 | #endif |
184 | |
192 | |
185 | // if we can split images, round to next-lowest mss |
193 | // round to next-lowest mss |
186 | if (fxix) max_send -= max_send % mss; |
194 | max_send -= max_send % mss; |
187 | |
195 | |
188 | if (ixface.empty ()) |
196 | if (ixface.empty ()) |
189 | { |
197 | { |
190 | // regularly send a new face when queue is empty |
198 | // regularly send a new face when queue is empty |
191 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
199 | if (bg_scrub && !--bg_scrub) |
192 | while (scrub_idx < faces.size () - 1) |
200 | while (scrub_idx < faces.size () - 1) |
193 | { |
201 | { |
194 | ++scrub_idx; |
202 | ++scrub_idx; |
195 | |
203 | |
196 | if (!faces_sent [scrub_idx]) |
204 | if (!faces_sent [scrub_idx]) |
… | |
… | |
218 | |
226 | |
219 | ixsend &ix = ixface.back (); |
227 | ixsend &ix = ixface.back (); |
220 | |
228 | |
221 | if (facedata *d = face_data (ix.idx, faceset)) |
229 | if (facedata *d = face_data (ix.idx, faceset)) |
222 | { |
230 | { |
223 | if (fxix) |
|
|
224 | { |
|
|
225 | // estimate the packet header overhead "ix " + idx + (new)ofs |
231 | // estimate the packet header overhead "ix " + idx + (new)ofs |
226 | int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs); |
232 | int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs); |
227 | int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen; |
233 | int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen; |
228 | |
234 | |
229 | // only transfer something if the amount of data transferred |
235 | // only transfer something if the amount of data transferred |
230 | // has a healthy relation to the header overhead |
236 | // has a healthy relation to the header overhead |
231 | if (chunk < 64) |
237 | if (chunk < 64) |
232 | break; |
238 | break; |
233 | |
239 | |
234 | chunk = min (chunk, (int)ix.ofs); |
240 | chunk = min (chunk, (int)ix.ofs); |
235 | |
241 | |
236 | ix.ofs -= chunk; |
242 | ix.ofs -= chunk; |
237 | |
243 | |
238 | //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
244 | //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
239 | |
245 | |
240 | packet sl ("ix"); |
246 | packet sl ("ix"); |
241 | |
247 | |
242 | sl << ber32 (ix.idx) |
248 | sl << ber32 (ix.idx) |
243 | << ber32 (ix.ofs) |
249 | << ber32 (ix.ofs) |
244 | << data (d->data.data () + ix.ofs, chunk); |
250 | << data (d->data.data () + ix.ofs, chunk); |
245 | |
251 | |
246 | send_packet (sl); |
252 | send_packet (sl); |
247 | } |
|
|
248 | else |
|
|
249 | { |
|
|
250 | send_image (ix.idx); |
|
|
251 | ix.ofs = 0; |
|
|
252 | } |
|
|
253 | } |
253 | } |
254 | else |
254 | else |
255 | ix.ofs = 0; |
255 | ix.ofs = 0; |
256 | |
256 | |
257 | if (!ix.ofs) |
257 | if (!ix.ofs) |