| 1 | /* |
1 | /* |
| 2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
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,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team |
|
|
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
| 7 | * |
5 | * |
| 8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
| 9 | * under the terms of the GNU General Public License as published by the Free |
7 | * the terms of the Affero GNU General Public License as published by the |
| 10 | * Software Foundation; either version 2 of the License, or (at your option) |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
| 11 | * any later version. |
9 | * option) any later version. |
| 12 | * |
10 | * |
| 13 | * This program is distributed in the hope that it will be useful, but |
11 | * This program is distributed in the hope that it will be useful, |
| 14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 | * for more details. |
14 | * GNU General Public License for more details. |
| 17 | * |
15 | * |
| 18 | * You should have received a copy of the GNU General Public License along |
16 | * You should have received a copy of the Affero GNU General Public License |
| 19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
17 | * and the GNU General Public License along with this program. If not, see |
| 20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
18 | * <http://www.gnu.org/licenses/>. |
| 21 | * |
19 | * |
| 22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 23 | */ |
21 | */ |
| 24 | |
22 | |
| 25 | /** |
23 | /** |
| 26 | * \file |
24 | * \file |
| 27 | * Main client/server loops. |
25 | * Main client/server loops. |
| … | |
… | |
| 43 | #include <netdb.h> |
41 | #include <netdb.h> |
| 44 | |
42 | |
| 45 | #include <unistd.h> |
43 | #include <unistd.h> |
| 46 | #include <arpa/inet.h> |
44 | #include <arpa/inet.h> |
| 47 | |
45 | |
| 48 | #include <loader.h> |
|
|
| 49 | |
|
|
| 50 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
46 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
| 51 | |
47 | |
| 52 | #define MAX_QUEUE_DEPTH 500 |
48 | #define MAX_QUEUE_DEPTH 50 |
| 53 | #define MAX_QUEUE_BACKLOG 3. |
49 | #define MAX_QUEUE_BACKLOG 3. |
| 54 | |
50 | |
| 55 | void |
51 | void |
| 56 | client::reset_state () |
52 | client::reset_state () |
| 57 | { |
53 | { |
| … | |
… | |
| 67 | { |
63 | { |
| 68 | tstamp stamp = NOW; |
64 | tstamp stamp = NOW; |
| 69 | |
65 | |
| 70 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
66 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
| 71 | { |
67 | { |
| 72 | //TODO: just disconnect here? |
|
|
| 73 | reset_state (); |
68 | reset_state (); |
| 74 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
69 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
| 75 | } |
70 | } |
| 76 | else |
71 | else |
| 77 | { |
72 | { |
| 78 | cmd_queue.push_back (command ()); |
73 | cmd_queue.resize (cmd_queue.size () + 1); |
| 79 | command &cmd = cmd_queue.back (); |
74 | command &cmd = cmd_queue.back (); |
| 80 | cmd.stamp = stamp; |
75 | cmd.stamp = stamp; |
| 81 | cmd.handler = handler; |
76 | cmd.handler = handler; |
| 82 | cmd.data = salloc<char> (datalen + 1, data); |
77 | cmd.data = salloc<char> (datalen + 1, data); |
| 83 | cmd.datalen = datalen; |
78 | cmd.datalen = datalen; |
| … | |
… | |
| 93 | { |
88 | { |
| 94 | command &cmd = cmd_queue.front (); |
89 | command &cmd = cmd_queue.front (); |
| 95 | |
90 | |
| 96 | if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
91 | if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
| 97 | { |
92 | { |
| 98 | reset_state (); |
93 | reset_state (); // the command might actually reset some movement state etc. |
| 99 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
94 | |
|
|
95 | if (pl) |
|
|
96 | pl->failmsg ( |
|
|
97 | "Cannot keep up with your commands, ignoring them! " |
|
|
98 | "H<Your character cannot keep up with the instructions you give G<him|her>. " |
|
|
99 | "Try issuing commands slower, or, if G<he|she> is incapacitated (paralyzed and so on), " |
|
|
100 | "wait till your character can act again.\n\nIf G<he|she> is permanently stuck, then " |
|
|
101 | "try the B<suicide> command (or use B<chat> to ask somebody to B<invite> you out).>" |
|
|
102 | ); |
| 100 | } |
103 | } |
| 101 | else |
104 | else |
| 102 | execute (cmd.handler, cmd.data, cmd.datalen); |
105 | execute (cmd.handler, cmd.data, cmd.datalen); |
| 103 | |
106 | |
|
|
107 | sfree<char> (cmd.data, cmd.datalen + 1); |
| 104 | cmd_queue.pop_front (); |
108 | cmd_queue.pop_front (); |
| 105 | return true; |
109 | return true; |
| 106 | } |
110 | } |
| 107 | else |
111 | else |
| 108 | return false; |
112 | return false; |
| 109 | } |
113 | } |
| 110 | |
114 | |
| 111 | void |
115 | 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 () |
116 | client::tick () |
| 140 | { |
117 | { |
| 141 | if (!pl || destroyed ()) |
118 | if (!pl || destroyed ()) |
| 142 | return; |
119 | return; |
|
|
120 | |
|
|
121 | pl->dirty = true; |
| 143 | |
122 | |
| 144 | /* Update the players stats once per tick. More efficient than |
123 | /* Update the players stats once per tick. More efficient than |
| 145 | * sending them whenever they change, and probably just as useful |
124 | * sending them whenever they change, and probably just as useful |
| 146 | */ |
125 | */ |
|
|
126 | pl->need_updated_stats (); |
| 147 | esrv_update_stats (pl); |
127 | esrv_update_stats (pl); |
| 148 | |
128 | |
| 149 | if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) |
129 | if (pl->ns->update_spells) |
|
|
130 | esrv_update_spells (pl); |
|
|
131 | |
|
|
132 | sint32 weight = pl->ob->client_weight (); |
|
|
133 | |
|
|
134 | if (last_weight != weight) |
| 150 | { |
135 | { |
|
|
136 | pl->ob->update_stats (); |
| 151 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
137 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
| 152 | if (last_weight != WEIGHT (pl->ob)) |
|
|
| 153 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
|
|
| 154 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
|
|
| 155 | } |
138 | } |
| 156 | |
139 | |
| 157 | draw_client_map (pl); |
140 | draw_client_map (pl); |
| 158 | |
141 | |
| 159 | if (update_look) |
142 | if (update_look) |
| 160 | esrv_draw_look (pl); |
143 | esrv_draw_look (pl); |
| 161 | |
144 | |
|
|
145 | mapinfo_queue_run (); |
|
|
146 | |
|
|
147 | #if HAVE_TCP_INFO |
|
|
148 | // check time of last ack, and, if too old, kill connection |
|
|
149 | socklen_t len = sizeof (tcpi); |
|
|
150 | |
|
|
151 | if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi)) |
|
|
152 | { |
|
|
153 | if (tcpi.tcpi_snd_mss) |
|
|
154 | mss = tcpi.tcpi_snd_mss; |
|
|
155 | |
|
|
156 | #if 0 |
|
|
157 | 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", |
|
|
158 | tcpi.tcpi_unacked, |
|
|
159 | tcpi.tcpi_sacked, |
|
|
160 | tcpi.tcpi_lost, |
|
|
161 | tcpi.tcpi_retrans, |
|
|
162 | tcpi.tcpi_fackets, |
|
|
163 | tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss, |
|
|
164 | |
|
|
165 | tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked)); |
|
|
166 | #endif |
|
|
167 | |
|
|
168 | // fast-time-out a player by checking for missing acks |
|
|
169 | // do this only when player is active |
|
|
170 | if (pl && pl->active |
|
|
171 | && tcpi.tcpi_last_ack_recv > int (socket_timeout * 1000)) |
|
|
172 | { |
|
|
173 | send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)"); |
|
|
174 | write_outputbuffer (); |
|
|
175 | |
|
|
176 | LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd, |
|
|
177 | (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked); |
|
|
178 | destroy (); |
|
|
179 | } |
|
|
180 | } |
|
|
181 | #endif |
|
|
182 | |
|
|
183 | rate_avail = min (max_rate + mss, rate_avail + max_rate); |
|
|
184 | |
|
|
185 | int max_send = rate_avail; |
|
|
186 | |
|
|
187 | #if HAVE_TCP_INFO |
|
|
188 | // further restrict the available bandwidth by the excess bandwidth available |
|
|
189 | max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss); |
|
|
190 | #endif |
|
|
191 | |
|
|
192 | // round to next-lowest mss |
|
|
193 | max_send -= max_send % mss; |
|
|
194 | |
| 162 | if (ixface.empty ()) |
195 | if (ixface.empty ()) |
| 163 | { |
196 | { |
| 164 | // regularly send a new face when queue is empty |
197 | // regularly send a new face when queue is empty |
| 165 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
198 | if (bg_scrub && !--bg_scrub) |
| 166 | while (scrub_idx < faces.size () - 1) |
199 | while (scrub_idx < faces.size () - 1) |
| 167 | { |
200 | { |
| 168 | ++scrub_idx; |
201 | ++scrub_idx; |
| 169 | |
202 | |
| 170 | if (!faces_sent [scrub_idx]) |
203 | if (!faces_sent [scrub_idx]) |
|
|
204 | if (faceinfo *f = face_info (scrub_idx)) |
|
|
205 | if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now |
| 171 | { |
206 | { |
| 172 | send_face (scrub_idx); |
207 | send_face (scrub_idx, -120); |
| 173 | flush_fx (); |
208 | flush_fx (); |
| 174 | |
209 | |
| 175 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
210 | bg_scrub = 1; // send up to one fx per tick, unless an image was requested |
| 176 | break; |
211 | break; |
| 177 | } |
212 | } |
| 178 | } |
213 | } |
| 179 | |
|
|
| 180 | rate_avail = max_rate - outputbuffer_len (); |
|
|
| 181 | } |
214 | } |
| 182 | else |
215 | else |
| 183 | { |
216 | { |
| 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; |
217 | bg_scrub = BG_SCRUB_RATE; |
| 196 | |
218 | |
| 197 | while (avail > 0) |
219 | for (;;) |
| 198 | { |
220 | { |
|
|
221 | int avail = max_send - outputbuffer_len (); |
|
|
222 | |
|
|
223 | if (avail <= 0) |
|
|
224 | break; |
|
|
225 | |
| 199 | ixsend &ix = ixface.back (); |
226 | ixsend &ix = ixface.back (); |
| 200 | |
227 | |
| 201 | if (facedata *d = face_data (ix.idx, faceset)) |
228 | if (facedata *d = face_data (ix.idx, faceset)) |
| 202 | { |
229 | { |
| 203 | if (fxix) |
230 | // estimate the packet header overhead "ix " + idx + (new)ofs |
| 204 | { |
231 | int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs); |
| 205 | // 9 bytes is enough for fx_FFFOOO, 40 leaves some room for image data |
232 | int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen; |
| 206 | int chunk = min (min (avail - 40, MAXSOCKBUF - 9), ix.ofs); |
|
|
| 207 | |
233 | |
|
|
234 | // only transfer something if the amount of data transferred |
|
|
235 | // has a healthy relation to the header overhead |
| 208 | if (chunk <= 0) |
236 | if (chunk < 64) |
| 209 | break; |
237 | break; |
| 210 | |
238 | |
|
|
239 | chunk = min (chunk, (int)ix.ofs); |
|
|
240 | |
| 211 | ix.ofs -= chunk; |
241 | ix.ofs -= chunk; |
| 212 | |
242 | |
|
|
243 | //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
|
|
244 | |
| 213 | packet sl ("ix"); |
245 | packet sl ("ix"); |
| 214 | |
246 | |
| 215 | sl << ber32 (ix.idx) |
247 | sl << ber32 (ix.idx) |
| 216 | << ber32 (ix.ofs) |
248 | << ber32 (ix.ofs) |
| 217 | << data (d->data.data () + ix.ofs, chunk); |
249 | << data (d->data.data () + ix.ofs, chunk); |
| 218 | |
250 | |
| 219 | send_packet (sl); |
251 | send_packet (sl); |
| 220 | } |
|
|
| 221 | else |
|
|
| 222 | { |
|
|
| 223 | send_image (ix.idx); |
|
|
| 224 | ix.ofs = 0; |
|
|
| 225 | } |
|
|
| 226 | } |
252 | } |
| 227 | else |
253 | else |
| 228 | ix.ofs = 0; |
254 | ix.ofs = 0; |
| 229 | |
255 | |
| 230 | int consumed = ol - outputbuffer_len (); |
|
|
| 231 | |
|
|
| 232 | avail -= consumed; |
|
|
| 233 | rate_avail -= consumed; |
|
|
| 234 | |
|
|
| 235 | ol = outputbuffer_len (); |
|
|
| 236 | |
|
|
| 237 | if (!ix.ofs) |
256 | if (!ix.ofs) |
| 238 | { |
257 | { |
| 239 | ixface.pop_back (); |
258 | ixface.pop_back (); |
|
|
259 | |
| 240 | if (ixface.empty ()) |
260 | if (ixface.empty ()) |
| 241 | break; |
261 | break; |
| 242 | } |
262 | } |
| 243 | } |
263 | } |
| 244 | } |
264 | } |
| 245 | } |
|
|
| 246 | |
265 | |
|
|
266 | rate_avail -= outputbuffer_len (); |
|
|
267 | } |
|
|
268 | |
|
|
269 | void |
|
|
270 | client::flush_sockets () |
|
|
271 | { |
|
|
272 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
273 | (*i)->flush (); |
|
|
274 | } |
|
|
275 | |
|
|
276 | void |
|
|
277 | client::clock () |
|
|
278 | { |
|
|
279 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
280 | (*i)->tick (); |
|
|
281 | |
|
|
282 | // give them all the same chances |
|
|
283 | flush_sockets (); |
|
|
284 | |
|
|
285 | //TODO: should not be done here, either |
|
|
286 | for (unsigned i = 0; i < clients.size (); ++i) |
|
|
287 | clients[i]->refcnt_chk (); |
|
|
288 | } |
|
|
289 | |
