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 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. |
… | |
… | |
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 50 |
51 | #define MAX_QUEUE_DEPTH 50 |
52 | #define MAX_QUEUE_BACKLOG 3. |
52 | #define MAX_QUEUE_BACKLOG 3. |
53 | |
53 | |
|
|
54 | // disconnect a socket after this many seconds without an ack |
|
|
55 | #define SOCKET_TIMEOUT 16. |
|
|
56 | |
54 | void |
57 | void |
55 | client::reset_state () |
58 | client::reset_state () |
56 | { |
59 | { |
57 | if (!pl) |
60 | if (!pl) |
58 | return; |
61 | return; |
… | |
… | |
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 | } |
|
|
109 | |
|
|
110 | 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 | } |
112 | } |
136 | |
113 | |
137 | void |
114 | void |
138 | client::tick () |
115 | client::tick () |
139 | { |
116 | { |
… | |
… | |
143 | /* Update the players stats once per tick. More efficient than |
120 | /* Update the players stats once per tick. More efficient than |
144 | * sending them whenever they change, and probably just as useful |
121 | * sending them whenever they change, and probably just as useful |
145 | */ |
122 | */ |
146 | esrv_update_stats (pl); |
123 | esrv_update_stats (pl); |
147 | |
124 | |
148 | if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) |
125 | sint32 weight = pl->ob->client_weight (); |
149 | { |
126 | |
|
|
127 | if (last_weight != weight) |
150 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
128 | 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 | } |
|
|
155 | |
129 | |
156 | draw_client_map (pl); |
130 | draw_client_map (pl); |
157 | |
131 | |
158 | if (update_look) |
132 | if (update_look) |
159 | esrv_draw_look (pl); |
133 | esrv_draw_look (pl); |
|
|
134 | |
|
|
135 | mapinfo_queue_run (); |
|
|
136 | |
|
|
137 | #if HAVE_TCP_INFO |
|
|
138 | // check time of last ack, and, if too old, kill connection |
|
|
139 | socklen_t len = sizeof (tcpi); |
|
|
140 | |
|
|
141 | if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi)) |
|
|
142 | { |
|
|
143 | if (tcpi.tcpi_snd_mss) |
|
|
144 | mss = tcpi.tcpi_snd_mss; |
|
|
145 | |
|
|
146 | #if 0 |
|
|
147 | 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", |
|
|
148 | tcpi.tcpi_unacked, |
|
|
149 | tcpi.tcpi_sacked, |
|
|
150 | tcpi.tcpi_lost, |
|
|
151 | tcpi.tcpi_retrans, |
|
|
152 | tcpi.tcpi_fackets, |
|
|
153 | tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss, |
|
|
154 | |
|
|
155 | tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked)); |
|
|
156 | #endif |
|
|
157 | |
|
|
158 | // fast-time-out a player by checking for missign acks |
|
|
159 | // do this only when player is active |
|
|
160 | if (pl && pl->active |
|
|
161 | && tcpi.tcpi_last_ack_recv > int (SOCKET_TIMEOUT * 1000)) |
|
|
162 | { |
|
|
163 | send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)"); |
|
|
164 | write_outputbuffer (); |
|
|
165 | |
|
|
166 | LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd, |
|
|
167 | (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked); |
|
|
168 | destroy (); |
|
|
169 | } |
|
|
170 | } |
|
|
171 | #endif |
|
|
172 | |
|
|
173 | rate_avail = min (max_rate + mss, rate_avail + max_rate); |
|
|
174 | |
|
|
175 | int max_send = rate_avail; |
|
|
176 | |
|
|
177 | #if HAVE_TCP_INFO |
|
|
178 | // further restrict the available bandwidth by the excess bandwidth available |
|
|
179 | max_send = min (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss); |
|
|
180 | #endif |
|
|
181 | |
|
|
182 | // if we can split images, round to next-lowest mss |
|
|
183 | if (fxix) max_send -= max_send % mss; |
160 | |
184 | |
161 | if (ixface.empty ()) |
185 | if (ixface.empty ()) |
162 | { |
186 | { |
163 | // regularly send a new face when queue is empty |
187 | // regularly send a new face when queue is empty |
164 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
188 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
… | |
… | |
166 | { |
190 | { |
167 | ++scrub_idx; |
191 | ++scrub_idx; |
168 | |
192 | |
169 | if (!faces_sent [scrub_idx]) |
193 | if (!faces_sent [scrub_idx]) |
170 | if (faceinfo *f = face_info (scrub_idx)) |
194 | if (faceinfo *f = face_info (scrub_idx)) |
171 | if (f->type == FT_FACE) // only scrub faces for now |
195 | if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now |
172 | { |
196 | { |
173 | send_face (scrub_idx, -120); |
197 | send_face (scrub_idx, -120); |
174 | flush_fx (); |
198 | flush_fx (); |
175 | |
199 | |
176 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
200 | bg_scrub = 1; // send up to one fx per tick, unless an image was requested |
177 | break; |
201 | break; |
178 | } |
202 | } |
179 | } |
203 | } |
180 | |
|
|
181 | rate_avail = max_rate - outputbuffer_len (); |
|
|
182 | } |
204 | } |
183 | else |
205 | else |
184 | { |
206 | { |
185 | int ol = outputbuffer_len (); |
|
|
186 | |
|
|
187 | rate_avail = min (max_rate + mss, rate_avail + max_rate); |
|
|
188 | |
|
|
189 | int avail = rate_avail; |
|
|
190 | |
|
|
191 | // if we can split images, round to next-lowest mss |
|
|
192 | if (fxix) avail -= avail % mss; |
|
|
193 | |
|
|
194 | rate_avail -= ol; |
|
|
195 | avail -= ol; |
|
|
196 | |
|
|
197 | #if HAVE_TCP_INFO |
|
|
198 | // further restrict the available bandwidth by the excess bandwidth available |
|
|
199 | avail = max (0, min (avail, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss)); |
|
|
200 | #endif |
|
|
201 | |
|
|
202 | bg_scrub = BG_SCRUB_RATE; |
207 | bg_scrub = BG_SCRUB_RATE; |
203 | |
208 | |
204 | while (avail > 0) |
209 | for (;;) |
205 | { |
210 | { |
|
|
211 | int avail = max_send - outputbuffer_len (); |
|
|
212 | |
|
|
213 | if (avail <= 0) |
|
|
214 | break; |
|
|
215 | |
206 | ixsend &ix = ixface.back (); |
216 | ixsend &ix = ixface.back (); |
207 | |
217 | |
208 | if (facedata *d = face_data (ix.idx, faceset)) |
218 | if (facedata *d = face_data (ix.idx, faceset)) |
209 | { |
219 | { |
210 | if (fxix) |
220 | if (fxix) |
… | |
… | |
239 | } |
249 | } |
240 | } |
250 | } |
241 | else |
251 | else |
242 | ix.ofs = 0; |
252 | ix.ofs = 0; |
243 | |
253 | |
244 | int consumed = outputbuffer_len () - ol; |
|
|
245 | |
|
|
246 | avail -= consumed; |
|
|
247 | rate_avail -= consumed; |
|
|
248 | |
|
|
249 | ol = outputbuffer_len (); |
|
|
250 | |
|
|
251 | if (!ix.ofs) |
254 | if (!ix.ofs) |
252 | { |
255 | { |
253 | ixface.pop_back (); |
256 | ixface.pop_back (); |
254 | |
257 | |
255 | if (ixface.empty ()) |
258 | if (ixface.empty ()) |
256 | break; |
259 | break; |
257 | } |
260 | } |
258 | } |
261 | } |
259 | } |
262 | } |
260 | } |
|
|
261 | |
263 | |
|
|
264 | rate_avail -= outputbuffer_len (); |
|
|
265 | } |
|
|
266 | |
|
|
267 | void |
|
|
268 | client::flush_sockets (void) |
|
|
269 | { |
|
|
270 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
271 | (*i)->flush (); |
|
|
272 | } |
|
|
273 | |
|
|
274 | void |
|
|
275 | client::clock (void) |
|
|
276 | { |
|
|
277 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
278 | (*i)->tick (); |
|
|
279 | |
|
|
280 | // give them all the same chances |
|
|
281 | flush_sockets (); |
|
|
282 | |
|
|
283 | //TODO: should not be done here, either |
|
|
284 | for (unsigned i = 0; i < clients.size (); ++i) |
|
|
285 | clients[i]->refcnt_chk (); |
|
|
286 | } |
|
|
287 | |