| 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,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 | * 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 16. |
| 53 | |
56 | |
| 54 | void |
57 | void |
| 55 | client::reset_state () |
58 | client::reset_state () |
| 56 | { |
59 | { |
| 57 | if (!pl) |
60 | if (!pl) |
| … | |
… | |
| 72 | reset_state (); |
75 | reset_state (); |
| 73 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
76 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
| 74 | } |
77 | } |
| 75 | else |
78 | else |
| 76 | { |
79 | { |
| 77 | cmd_queue.push_back (command ()); |
80 | cmd_queue.resize (cmd_queue.size () + 1); |
| 78 | command &cmd = cmd_queue.back (); |
81 | command &cmd = cmd_queue.back (); |
| 79 | cmd.stamp = stamp; |
82 | cmd.stamp = stamp; |
| 80 | cmd.handler = handler; |
83 | cmd.handler = handler; |
| 81 | cmd.data = salloc<char> (datalen + 1, data); |
84 | cmd.data = salloc<char> (datalen + 1, data); |
| 82 | cmd.datalen = datalen; |
85 | cmd.datalen = datalen; |
| … | |
… | |
| 98 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
101 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
| 99 | } |
102 | } |
| 100 | else |
103 | else |
| 101 | execute (cmd.handler, cmd.data, cmd.datalen); |
104 | execute (cmd.handler, cmd.data, cmd.datalen); |
| 102 | |
105 | |
|
|
106 | sfree<char> (cmd.data, cmd.datalen + 1); |
| 103 | cmd_queue.pop_front (); |
107 | cmd_queue.pop_front (); |
| 104 | return true; |
108 | return true; |
| 105 | } |
109 | } |
| 106 | else |
110 | else |
| 107 | return false; |
111 | return false; |
| 108 | } |
112 | } |
| 109 | |
113 | |
| 110 | void |
114 | 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 () |
115 | client::tick () |
| 139 | { |
116 | { |
| 140 | if (!pl || destroyed ()) |
117 | if (!pl || destroyed ()) |
| 141 | return; |
118 | return; |
|
|
119 | |
|
|
120 | pl->dirty = true; |
| 142 | |
121 | |
| 143 | /* Update the players stats once per tick. More efficient than |
122 | /* Update the players stats once per tick. More efficient than |
| 144 | * sending them whenever they change, and probably just as useful |
123 | * sending them whenever they change, and probably just as useful |
| 145 | */ |
124 | */ |
| 146 | esrv_update_stats (pl); |
125 | esrv_update_stats (pl); |
| 147 | |
126 | |
| 148 | if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) |
127 | sint32 weight = pl->ob->client_weight (); |
|
|
128 | |
|
|
129 | if (last_weight != weight) |
| 149 | { |
130 | { |
|
|
131 | pl->ob->update_stats (); |
| 150 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
132 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
| 151 | if (last_weight != WEIGHT (pl->ob)) |
|
|
| 152 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
|
|
| 153 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
|
|
| 154 | } |
133 | } |
| 155 | |
134 | |
| 156 | draw_client_map (pl); |
135 | draw_client_map (pl); |
| 157 | |
136 | |
| 158 | if (update_look) |
137 | if (update_look) |
| 159 | esrv_draw_look (pl); |
138 | esrv_draw_look (pl); |
|
|
139 | |
|
|
140 | mapinfo_queue_run (); |
|
|
141 | |
|
|
142 | #if HAVE_TCP_INFO |
|
|
143 | // check time of last ack, and, if too old, kill connection |
|
|
144 | socklen_t len = sizeof (tcpi); |
|
|
145 | |
|
|
146 | if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi)) |
|
|
147 | { |
|
|
148 | if (tcpi.tcpi_snd_mss) |
|
|
149 | mss = tcpi.tcpi_snd_mss; |
|
|
150 | |
|
|
151 | #if 0 |
|
|
152 | 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", |
|
|
153 | tcpi.tcpi_unacked, |
|
|
154 | tcpi.tcpi_sacked, |
|
|
155 | tcpi.tcpi_lost, |
|
|
156 | tcpi.tcpi_retrans, |
|
|
157 | tcpi.tcpi_fackets, |
|
|
158 | tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss, |
|
|
159 | |
|
|
160 | tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked)); |
|
|
161 | #endif |
|
|
162 | |
|
|
163 | // fast-time-out a player by checking for missign acks |
|
|
164 | // do this only when player is active |
|
|
165 | if (pl && pl->active |
|
|
166 | && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000)) |
|
|
167 | { |
|
|
168 | send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)"); |
|
|
169 | write_outputbuffer (); |
|
|
170 | |
|
|
171 | LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd, |
|
|
172 | (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked); |
|
|
173 | destroy (); |
|
|
174 | } |
|
|
175 | } |
|
|
176 | #endif |
|
|
177 | |
|
|
178 | rate_avail = min (max_rate + mss, rate_avail + max_rate); |
|
|
179 | |
|
|
180 | int max_send = rate_avail; |
|
|
181 | |
|
|
182 | #if HAVE_TCP_INFO |
|
|
183 | // further restrict the available bandwidth by the excess bandwidth available |
|
|
184 | max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss); |
|
|
185 | #endif |
|
|
186 | |
|
|
187 | // if we can split images, round to next-lowest mss |
|
|
188 | if (fxix) max_send -= max_send % mss; |
| 160 | |
189 | |
| 161 | if (ixface.empty ()) |
190 | if (ixface.empty ()) |
| 162 | { |
191 | { |
| 163 | // regularly send a new face when queue is empty |
192 | // regularly send a new face when queue is empty |
| 164 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
193 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
| 165 | while (scrub_idx < faces.size () - 1) |
194 | while (scrub_idx < faces.size () - 1) |
| 166 | { |
195 | { |
| 167 | ++scrub_idx; |
196 | ++scrub_idx; |
| 168 | |
197 | |
| 169 | if (!faces_sent [scrub_idx]) |
198 | if (!faces_sent [scrub_idx]) |
|
|
199 | if (faceinfo *f = face_info (scrub_idx)) |
|
|
200 | if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now |
| 170 | { |
201 | { |
| 171 | send_face (scrub_idx, -120); |
202 | send_face (scrub_idx, -120); |
| 172 | flush_fx (); |
203 | flush_fx (); |
| 173 | |
204 | |
| 174 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
205 | bg_scrub = 1; // send up to one fx per tick, unless an image was requested |
| 175 | break; |
206 | break; |
| 176 | } |
207 | } |
| 177 | } |
208 | } |
| 178 | |
|
|
| 179 | rate_avail = max_rate - outputbuffer_len (); |
|
|
| 180 | } |
|
|
| 181 | else if (!outq) // only send when bandwidth allows it |
|
|
| 182 | { |
209 | } |
| 183 | int ol = outputbuffer_len (); |
210 | else |
| 184 | |
211 | { |
| 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; |
212 | bg_scrub = BG_SCRUB_RATE; |
| 195 | |
213 | |
| 196 | while (avail > 0) |
214 | for (;;) |
| 197 | { |
215 | { |
|
|
216 | int avail = max_send - outputbuffer_len (); |
|
|
217 | |
|
|
218 | if (avail <= 0) |
|
|
219 | break; |
|
|
220 | |
| 198 | ixsend &ix = ixface.back (); |
221 | ixsend &ix = ixface.back (); |
| 199 | |
222 | |
| 200 | if (facedata *d = face_data (ix.idx, faceset)) |
223 | if (facedata *d = face_data (ix.idx, faceset)) |
| 201 | { |
224 | { |
| 202 | if (fxix) |
225 | if (fxix) |
| 203 | { |
226 | { |
|
|
227 | // estimate the packet header overhead "ix " + idx + (new)ofs |
|
|
228 | int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs); |
|
|
229 | int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen; |
|
|
230 | |
| 204 | // only transfer something if the amount of data transferred |
231 | // only transfer something if the amount of data transferred |
| 205 | // has a healthy relation to the header overhead |
232 | // has a healthy relation to the header overhead |
| 206 | if (avail <= 40) |
233 | if (chunk < 64) |
| 207 | break; |
234 | break; |
| 208 | |
235 | |
| 209 | // 9 bytes is enough for fx_FFFOOO |
236 | 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 | |
237 | |
| 215 | ix.ofs -= chunk; |
238 | ix.ofs -= chunk; |
| 216 | |
239 | |
| 217 | //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
240 | //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
| 218 | |
241 | |
| … | |
… | |
| 231 | } |
254 | } |
| 232 | } |
255 | } |
| 233 | else |
256 | else |
| 234 | ix.ofs = 0; |
257 | ix.ofs = 0; |
| 235 | |
258 | |
| 236 | int consumed = outputbuffer_len () - ol; |
|
|
| 237 | |
|
|
| 238 | avail -= consumed; |
|
|
| 239 | rate_avail -= consumed; |
|
|
| 240 | |
|
|
| 241 | ol = outputbuffer_len (); |
|
|
| 242 | |
|
|
| 243 | if (!ix.ofs) |
259 | if (!ix.ofs) |
| 244 | { |
260 | { |
| 245 | ixface.pop_back (); |
261 | ixface.pop_back (); |
| 246 | |
262 | |
| 247 | if (ixface.empty ()) |
263 | if (ixface.empty ()) |
| 248 | break; |
264 | break; |
| 249 | } |
265 | } |
| 250 | } |
266 | } |
| 251 | } |
267 | } |
| 252 | } |
|
|
| 253 | |
268 | |
|
|
269 | rate_avail -= outputbuffer_len (); |
|
|
270 | } |
|
|
271 | |
|
|
272 | void |
|
|
273 | client::flush_sockets (void) |
|
|
274 | { |
|
|
275 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
276 | (*i)->flush (); |
|
|
277 | } |
|
|
278 | |
|
|
279 | void |
|
|
280 | client::clock (void) |
|
|
281 | { |
|
|
282 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
283 | (*i)->tick (); |
|
|
284 | |
|
|
285 | // give them all the same chances |
|
|
286 | flush_sockets (); |
|
|
287 | |
|
|
288 | //TODO: should not be done here, either |
|
|
289 | for (unsigned i = 0; i < clients.size (); ++i) |
|
|
290 | clients[i]->refcnt_chk (); |
|
|
291 | } |
|
|
292 | |
