| 1 | /* |
1 | /* |
| 2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 | * |
3 | * |
| 4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team |
5 | * Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team |
| 6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
| 7 | * |
7 | * |
| 8 | * This program 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 2 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, |
| 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 GNU General Public License |
| 19 | * along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
| 21 | * |
20 | * |
| 22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 23 | */ |
22 | */ |
| 24 | |
23 | |
| 25 | /** |
24 | /** |
| 26 | * \file |
25 | * \file |
| 27 | * Main client/server loops. |
26 | * Main client/server loops. |
| … | |
… | |
| 30 | * |
29 | * |
| 31 | * loop.c mainly deals with initialization and higher level socket |
30 | * loop.c mainly deals with initialization and higher level socket |
| 32 | * maintanance (checking for lost connections and if data has arrived.) |
31 | * maintanance (checking for lost connections and if data has arrived.) |
| 33 | */ |
32 | */ |
| 34 | |
33 | |
| 35 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
|
|
| 36 | |
|
|
| 37 | #include <global.h> |
34 | #include <global.h> |
| 38 | #include <sproto.h> |
35 | #include <sproto.h> |
| 39 | #include <sockproto.h> |
36 | #include <sockproto.h> |
| 40 | |
37 | |
| 41 | #include <sys/types.h> |
38 | #include <sys/types.h> |
| … | |
… | |
| 47 | #include <unistd.h> |
44 | #include <unistd.h> |
| 48 | #include <arpa/inet.h> |
45 | #include <arpa/inet.h> |
| 49 | |
46 | |
| 50 | #include <loader.h> |
47 | #include <loader.h> |
| 51 | |
48 | |
|
|
49 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
|
|
50 | |
| 52 | #define MAX_QUEUE_DEPTH 500 //TODO |
51 | #define MAX_QUEUE_DEPTH 50 |
| 53 | #define MAX_QUEUE_BACKLOG 3. //TODO |
52 | #define MAX_QUEUE_BACKLOG 3. |
|
|
53 | |
|
|
54 | // disconnect a socket after this many seconds without an ack |
|
|
55 | #define SOCKET_TIMEOUT 16. |
| 54 | |
56 | |
| 55 | void |
57 | void |
| 56 | client::reset_state () |
58 | client::reset_state () |
| 57 | { |
59 | { |
| 58 | if (!pl) |
60 | if (!pl) |
| … | |
… | |
| 63 | } |
65 | } |
| 64 | |
66 | |
| 65 | void |
67 | void |
| 66 | client::queue_command (packet_type *handler, char *data, int datalen) |
68 | client::queue_command (packet_type *handler, char *data, int datalen) |
| 67 | { |
69 | { |
| 68 | tstamp stamp = now (); |
70 | tstamp stamp = NOW; |
| 69 | |
71 | |
| 70 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
72 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
| 71 | { |
73 | { |
| 72 | //TODO: just disconnect here? |
74 | //TODO: just disconnect here? |
| 73 | reset_state (); |
75 | reset_state (); |
| 74 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
76 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
| 75 | } |
77 | } |
| 76 | else |
78 | else |
| 77 | { |
79 | { |
| 78 | cmd_queue.push_back (command ()); |
80 | cmd_queue.resize (cmd_queue.size () + 1); |
| 79 | command &cmd = cmd_queue.back (); |
81 | command &cmd = cmd_queue.back (); |
| 80 | cmd.stamp = stamp; |
82 | cmd.stamp = stamp; |
| 81 | cmd.handler = handler; |
83 | cmd.handler = handler; |
| 82 | cmd.data = salloc<char> (datalen + 1, data); |
84 | cmd.data = salloc<char> (datalen + 1, data); |
| 83 | cmd.datalen = datalen; |
85 | cmd.datalen = datalen; |
| … | |
… | |
| 85 | } |
87 | } |
| 86 | |
88 | |
| 87 | bool |
89 | bool |
| 88 | client::handle_command () |
90 | client::handle_command () |
| 89 | { |
91 | { |
| 90 | bool skipping = false; |
|
|
| 91 | |
|
|
| 92 | while (!cmd_queue.empty () |
92 | if (!cmd_queue.empty () |
| 93 | && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0)) |
93 | && state == ST_PLAYING |
|
|
94 | && pl->ob->speed_left > 0.f) |
| 94 | { |
95 | { |
| 95 | command &cmd = cmd_queue.front (); |
96 | command &cmd = cmd_queue.front (); |
| 96 | |
97 | |
| 97 | if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) |
98 | if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
| 98 | { |
99 | { |
| 99 | if (!skipping) |
|
|
| 100 | { |
|
|
| 101 | skipping = true; |
|
|
| 102 | reset_state (); |
100 | reset_state (); |
| 103 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
101 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
| 104 | } |
|
|
| 105 | |
|
|
| 106 | cmd_queue.pop_front (); |
|
|
| 107 | } |
102 | } |
| 108 | else |
103 | else |
| 109 | { |
|
|
| 110 | execute (cmd.handler, cmd.data, cmd.datalen); |
104 | execute (cmd.handler, cmd.data, cmd.datalen); |
|
|
105 | |
|
|
106 | sfree<char> (cmd.data, cmd.datalen + 1); |
| 111 | cmd_queue.pop_front (); |
107 | cmd_queue.pop_front (); |
| 112 | return true; |
108 | return true; |
| 113 | } |
|
|
| 114 | } |
109 | } |
| 115 | |
110 | else |
| 116 | return false; |
111 | return false; |
| 117 | } |
|
|
| 118 | |
|
|
| 119 | void |
|
|
| 120 | flush_sockets (void) |
|
|
| 121 | { |
|
|
| 122 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
| 123 | (*i)->flush (); |
|
|
| 124 | } |
|
|
| 125 | |
|
|
| 126 | /** |
|
|
| 127 | * This checks the sockets for input, does the right thing. |
|
|
| 128 | * |
|
|
| 129 | * A bit of this code is grabbed out of socket.c |
|
|
| 130 | * There are 2 lists we need to look through - init_sockets is a list |
|
|
| 131 | * |
|
|
| 132 | */ |
|
|
| 133 | void |
|
|
| 134 | doeric_server (void) |
|
|
| 135 | { |
|
|
| 136 | #ifdef CS_LOGSTATS |
|
|
| 137 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
|
|
| 138 | write_cs_stats (); |
|
|
| 139 | #endif |
|
|
| 140 | |
|
|
| 141 | //TODO: should not be done here, either |
|
|
| 142 | for (unsigned i = 0; i < clients.size (); ++i) |
|
|
| 143 | { |
|
|
| 144 | client *ns = clients [i]; |
|
|
| 145 | |
|
|
| 146 | ns->tick (); |
|
|
| 147 | ns->refcnt_chk (); |
|
|
| 148 | } |
|
|
| 149 | } |
112 | } |
| 150 | |
113 | |
| 151 | void |
114 | void |
| 152 | client::tick () |
115 | client::tick () |
| 153 | { |
116 | { |
| 154 | if (!pl || destroyed ()) |
117 | if (!pl || destroyed ()) |
| 155 | return; |
118 | return; |
|
|
119 | |
|
|
120 | pl->dirty = true; |
| 156 | |
121 | |
| 157 | /* Update the players stats once per tick. More efficient than |
122 | /* Update the players stats once per tick. More efficient than |
| 158 | * sending them whenever they change, and probably just as useful |
123 | * sending them whenever they change, and probably just as useful |
| 159 | */ |
124 | */ |
| 160 | esrv_update_stats (pl); |
125 | esrv_update_stats (pl); |
| 161 | |
126 | |
| 162 | if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) |
127 | sint32 weight = pl->ob->client_weight (); |
| 163 | { |
128 | |
|
|
129 | if (last_weight != weight) |
| 164 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
130 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
| 165 | if (last_weight != WEIGHT (pl->ob)) |
|
|
| 166 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
|
|
| 167 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
|
|
| 168 | } |
|
|
| 169 | |
131 | |
| 170 | draw_client_map (pl->ob); |
132 | draw_client_map (pl); |
| 171 | |
133 | |
| 172 | if (update_look) |
134 | if (update_look) |
| 173 | esrv_draw_look (pl->ob); |
135 | esrv_draw_look (pl); |
| 174 | |
136 | |
|
|
137 | mapinfo_queue_run (); |
|
|
138 | |
|
|
139 | #if HAVE_TCP_INFO |
|
|
140 | // check time of last ack, and, if too old, kill connection |
|
|
141 | socklen_t len = sizeof (tcpi); |
|
|
142 | |
|
|
143 | if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi)) |
|
|
144 | { |
|
|
145 | if (tcpi.tcpi_snd_mss) |
|
|
146 | mss = tcpi.tcpi_snd_mss; |
|
|
147 | |
|
|
148 | #if 0 |
|
|
149 | 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", |
|
|
150 | tcpi.tcpi_unacked, |
|
|
151 | tcpi.tcpi_sacked, |
|
|
152 | tcpi.tcpi_lost, |
|
|
153 | tcpi.tcpi_retrans, |
|
|
154 | tcpi.tcpi_fackets, |
|
|
155 | tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss, |
|
|
156 | |
|
|
157 | tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked)); |
|
|
158 | #endif |
|
|
159 | |
|
|
160 | // fast-time-out a player by checking for missign acks |
|
|
161 | // do this only when player is active |
|
|
162 | if (pl && pl->active |
|
|
163 | && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000)) |
|
|
164 | { |
|
|
165 | send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)"); |
|
|
166 | write_outputbuffer (); |
|
|
167 | |
|
|
168 | LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd, |
|
|
169 | (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked); |
|
|
170 | destroy (); |
|
|
171 | } |
|
|
172 | } |
|
|
173 | #endif |
|
|
174 | |
|
|
175 | rate_avail = min (max_rate + mss, rate_avail + max_rate); |
|
|
176 | |
|
|
177 | int max_send = rate_avail; |
|
|
178 | |
|
|
179 | #if HAVE_TCP_INFO |
|
|
180 | // further restrict the available bandwidth by the excess bandwidth available |
|
|
181 | max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss); |
|
|
182 | #endif |
|
|
183 | |
|
|
184 | // if we can split images, round to next-lowest mss |
|
|
185 | if (fxix) max_send -= max_send % mss; |
|
|
186 | |
| 175 | if (askface.empty ()) |
187 | if (ixface.empty ()) |
| 176 | { |
188 | { |
|
|
189 | // regularly send a new face when queue is empty |
| 177 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
190 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
| 178 | while (scrub_idx < faces.size () - 1) |
191 | while (scrub_idx < faces.size () - 1) |
| 179 | { |
192 | { |
| 180 | ++scrub_idx; |
193 | ++scrub_idx; |
|
|
194 | |
| 181 | if (!faces_sent [scrub_idx]) |
195 | if (!faces_sent [scrub_idx]) |
|
|
196 | if (faceinfo *f = face_info (scrub_idx)) |
|
|
197 | if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now |
| 182 | { |
198 | { |
| 183 | send_face (scrub_idx); |
199 | send_face (scrub_idx, -120); |
|
|
200 | flush_fx (); |
|
|
201 | |
| 184 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
202 | bg_scrub = 1; // send up to one fx per tick, unless an image was requested |
|
|
203 | break; |
|
|
204 | } |
|
|
205 | } |
|
|
206 | } |
|
|
207 | else |
|
|
208 | { |
|
|
209 | bg_scrub = BG_SCRUB_RATE; |
|
|
210 | |
|
|
211 | for (;;) |
|
|
212 | { |
|
|
213 | int avail = max_send - outputbuffer_len (); |
|
|
214 | |
|
|
215 | if (avail <= 0) |
|
|
216 | break; |
|
|
217 | |
|
|
218 | ixsend &ix = ixface.back (); |
|
|
219 | |
|
|
220 | if (facedata *d = face_data (ix.idx, faceset)) |
|
|
221 | { |
|
|
222 | if (fxix) |
|
|
223 | { |
|
|
224 | // estimate the packet header overhead "ix " + idx + (new)ofs |
|
|
225 | int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs); |
|
|
226 | int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen; |
|
|
227 | |
|
|
228 | // only transfer something if the amount of data transferred |
|
|
229 | // has a healthy relation to the header overhead |
|
|
230 | if (chunk < 64) |
|
|
231 | break; |
|
|
232 | |
|
|
233 | chunk = min (chunk, (int)ix.ofs); |
|
|
234 | |
|
|
235 | ix.ofs -= chunk; |
|
|
236 | |
|
|
237 | //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
|
|
238 | |
|
|
239 | packet sl ("ix"); |
|
|
240 | |
|
|
241 | sl << ber32 (ix.idx) |
|
|
242 | << ber32 (ix.ofs) |
|
|
243 | << data (d->data.data () + ix.ofs, chunk); |
|
|
244 | |
|
|
245 | send_packet (sl); |
|
|
246 | } |
|
|
247 | else |
|
|
248 | { |
|
|
249 | send_image (ix.idx); |
|
|
250 | ix.ofs = 0; |
|
|
251 | } |
|
|
252 | } |
|
|
253 | else |
|
|
254 | ix.ofs = 0; |
|
|
255 | |
|
|
256 | if (!ix.ofs) |
|
|
257 | { |
|
|
258 | ixface.pop_back (); |
|
|
259 | |
|
|
260 | if (ixface.empty ()) |
| 185 | break; |
261 | break; |
| 186 | } |
262 | } |
| 187 | } |
263 | } |
| 188 | } |
|
|
| 189 | else |
|
|
| 190 | while (!askface.empty () && outputbuffer_len () < max_rate) |
|
|
| 191 | { |
|
|
| 192 | // use a lifo to send most recently requested images |
|
|
| 193 | faceidx face = askface.back (); |
|
|
| 194 | askface.pop_back (); |
|
|
| 195 | |
|
|
| 196 | send_image (face); |
|
|
| 197 | |
|
|
| 198 | bg_scrub = BG_SCRUB_RATE; |
|
|
| 199 | } |
264 | } |
| 200 | } |
|
|
| 201 | |
265 | |
|
|
266 | rate_avail -= outputbuffer_len (); |
|
|
267 | } |
|
|
268 | |
|
|
269 | void |
|
|
270 | client::flush_sockets (void) |
|
|
271 | { |
|
|
272 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
273 | (*i)->flush (); |
|
|
274 | } |
|
|
275 | |
|
|
276 | void |
|
|
277 | client::clock (void) |
|
|
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 | |
