1 |
/* |
2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
* |
4 |
* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
* |
6 |
* 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 |
* |
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 |
* 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 |
* |
20 |
* The authors can be reached via e-mail to <support@deliantra.net> |
21 |
*/ |
22 |
|
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 |
* maintanance (checking for lost connections and if data has arrived.) |
31 |
*/ |
32 |
|
33 |
#include <global.h> |
34 |
#include <sproto.h> |
35 |
#include <sockproto.h> |
36 |
|
37 |
#include <sys/types.h> |
38 |
#include <sys/time.h> |
39 |
#include <sys/socket.h> |
40 |
#include <netinet/in.h> |
41 |
#include <netdb.h> |
42 |
|
43 |
#include <unistd.h> |
44 |
#include <arpa/inet.h> |
45 |
|
46 |
#define BG_SCRUB_RATE 4 // how often to send a face in the background |
47 |
|
48 |
#define MAX_QUEUE_DEPTH 50 |
49 |
#define MAX_QUEUE_BACKLOG 3. |
50 |
|
51 |
void |
52 |
client::reset_state () |
53 |
{ |
54 |
if (!pl) |
55 |
return; |
56 |
|
57 |
pl->run_on = 0; |
58 |
pl->fire_on = 0; |
59 |
} |
60 |
|
61 |
void |
62 |
client::queue_command (packet_type *handler, char *data, int datalen) |
63 |
{ |
64 |
tstamp stamp = NOW; |
65 |
|
66 |
if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
67 |
{ |
68 |
reset_state (); |
69 |
send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
70 |
} |
71 |
else |
72 |
{ |
73 |
cmd_queue.resize (cmd_queue.size () + 1); |
74 |
command &cmd = cmd_queue.back (); |
75 |
cmd.stamp = stamp; |
76 |
cmd.handler = handler; |
77 |
cmd.data = salloc<char> (datalen + 1, data); |
78 |
cmd.datalen = datalen; |
79 |
} |
80 |
} |
81 |
|
82 |
bool |
83 |
client::handle_command () |
84 |
{ |
85 |
if (!cmd_queue.empty () |
86 |
&& state == ST_PLAYING |
87 |
&& pl->ob->speed_left > 0.f) |
88 |
{ |
89 |
command &cmd = cmd_queue.front (); |
90 |
|
91 |
if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
92 |
{ |
93 |
reset_state (); // the command might actually reset some movement state etc. |
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 |
); |
103 |
} |
104 |
else |
105 |
execute (cmd.handler, cmd.data, cmd.datalen); |
106 |
|
107 |
sfree<char> (cmd.data, cmd.datalen + 1); |
108 |
cmd_queue.pop_front (); |
109 |
return true; |
110 |
} |
111 |
else |
112 |
return false; |
113 |
} |
114 |
|
115 |
void |
116 |
client::tick () |
117 |
{ |
118 |
if (!pl || destroyed ()) |
119 |
return; |
120 |
|
121 |
pl->dirty = true; |
122 |
|
123 |
/* Update the players stats once per tick. More efficient than |
124 |
* sending them whenever they change, and probably just as useful |
125 |
*/ |
126 |
pl->need_updated_stats (); |
127 |
esrv_update_stats (pl); |
128 |
|
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) |
135 |
{ |
136 |
pl->ob->update_stats (); |
137 |
esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
138 |
} |
139 |
|
140 |
draw_client_map (pl); |
141 |
|
142 |
if (update_look) |
143 |
esrv_draw_look (pl); |
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 |
// limit budget surplus/deficit by one mss, add per-tick budget |
184 |
rate_avail = min (rate_avail, mss) + max_rate; |
185 |
|
186 |
int max_send = rate_avail; |
187 |
|
188 |
#if HAVE_TCP_INFO |
189 |
// further restrict the available bandwidth by the excess bandwidth available |
190 |
min_it (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss); |
191 |
#endif |
192 |
|
193 |
// round to next-lowest mss |
194 |
max_send -= max_send % mss; |
195 |
|
196 |
if (ixface.empty ()) |
197 |
{ |
198 |
// regularly send a new face when queue is empty |
199 |
if (bg_scrub && !--bg_scrub) |
200 |
while (scrub_idx < faces.size () - 1) |
201 |
{ |
202 |
++scrub_idx; |
203 |
|
204 |
if (!faces_sent [scrub_idx]) |
205 |
if (faceinfo *f = face_info (scrub_idx)) |
206 |
if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now |
207 |
{ |
208 |
send_face (scrub_idx, -120); |
209 |
flush_fx (); |
210 |
|
211 |
bg_scrub = 1; // send up to one fx per tick, unless an image was requested |
212 |
break; |
213 |
} |
214 |
} |
215 |
} |
216 |
else |
217 |
{ |
218 |
bg_scrub = BG_SCRUB_RATE; |
219 |
|
220 |
for (;;) |
221 |
{ |
222 |
int avail = max_send - outputbuffer_len (); |
223 |
|
224 |
if (avail <= 0) |
225 |
break; |
226 |
|
227 |
ixsend &ix = ixface.back (); |
228 |
|
229 |
if (facedata *d = face_data (ix.idx, faceset)) |
230 |
{ |
231 |
// estimate the packet header overhead "ix " + idx + (new)ofs |
232 |
int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs); |
233 |
int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen; |
234 |
|
235 |
// only transfer something if the amount of data transferred |
236 |
// has a healthy relation to the header overhead |
237 |
if (chunk < 64) |
238 |
break; |
239 |
|
240 |
chunk = min (chunk, (int)ix.ofs); |
241 |
|
242 |
ix.ofs -= chunk; |
243 |
|
244 |
//fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
245 |
|
246 |
packet sl ("ix"); |
247 |
|
248 |
sl << ber32 (ix.idx) |
249 |
<< ber32 (ix.ofs) |
250 |
<< data (d->data + ix.ofs, chunk); |
251 |
|
252 |
send_packet (sl); |
253 |
} |
254 |
else |
255 |
ix.ofs = 0; |
256 |
|
257 |
if (!ix.ofs) |
258 |
{ |
259 |
ixface.pop_back (); |
260 |
|
261 |
if (ixface.empty ()) |
262 |
break; |
263 |
} |
264 |
} |
265 |
} |
266 |
|
267 |
rate_avail -= outputbuffer_len (); |
268 |
} |
269 |
|
270 |
void |
271 |
client::flush_sockets () |
272 |
{ |
273 |
for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
274 |
(*i)->flush (); |
275 |
} |
276 |
|
277 |
void |
278 |
client::clock () |
279 |
{ |
280 |
for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
281 |
(*i)->tick (); |
282 |
|
283 |
// give them all the same chances |
284 |
flush_sockets (); |
285 |
|
286 |
//TODO: should not be done here, either |
287 |
for (unsigned i = 0; i < clients.size (); ++i) |
288 |
clients[i]->refcnt_chk (); |
289 |
} |
290 |
|