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