ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/loop.C
(Generate patch)

Comparing deliantra/server/socket/loop.C (file contents):
Revision 1.54 by root, Sun Jul 1 04:08:14 2007 UTC vs.
Revision 1.100 by root, Wed Nov 16 23:42:03 2016 UTC

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,2011,2012,2013,2014,2015,2016 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
55void 51void
56client::reset_state () 52client::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 ("msg %d log 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
111void 115void
112flush_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 */
125void
126doeric_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
138void
139client::tick () 116client::tick ()
140{ 117{
141 if (!pl || destroyed ()) 118 if (destroyed ())
142 return; 119 return;
143 120
121 if (pl)
122 {
123 pl->dirty = true;
124
144 /* Update the players stats once per tick. More efficient than 125 /* Update the players stats once per tick. More efficient than
145 * sending them whenever they change, and probably just as useful 126 * sending them whenever they change, and probably just as useful
146 */ 127 */
128 pl->need_updated_stats ();
147 esrv_update_stats (pl); 129 esrv_update_stats (pl);
148 130
149 if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) 131 if (pl->ns->update_spells)
150 { 132 esrv_update_spells (pl);
133
134 sint32 weight = pl->ob->client_weight ();
135
136 if (last_weight != weight)
137 {
138 pl->ob->update_stats ();
151 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); 139 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
152 if (last_weight != WEIGHT (pl->ob)) 140 }
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 }
156 141
157 draw_client_map (pl); 142 draw_client_map (pl);
158 143
159 if (update_look) 144 if (update_look)
160 esrv_draw_look (pl); 145 esrv_draw_look (pl);
146
147 mapinfo_queue_run ();
148 }
149
150#if HAVE_TCP_INFO
151 // check time of last ack, and, if too old, kill connection
152 socklen_t len = sizeof (tcpi);
153
154 if (!getsockopt (fd, IPPROTO_TCP, TCP_INFO, &tcpi, &len) && len == sizeof (tcpi))
155 {
156 if (tcpi.tcpi_snd_mss)
157 mss = tcpi.tcpi_snd_mss;
158
159#if 0
160 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",
161 tcpi.tcpi_unacked,
162 tcpi.tcpi_sacked,
163 tcpi.tcpi_lost,
164 tcpi.tcpi_retrans,
165 tcpi.tcpi_fackets,
166 tcpi.tcpi_snd_ssthresh, tcpi.tcpi_snd_cwnd, tcpi.tcpi_advmss, tcpi.tcpi_pmtu, tcpi.tcpi_advmss,
167
168 tcpi.tcpi_snd_cwnd - (tcpi.tcpi_unacked - tcpi.tcpi_sacked));
169#endif
170
171 // fast-time-out a player by checking for missing acks
172 // do this only when player is active
173 if (pl && pl->active
174 && tcpi.tcpi_last_ack_recv > int (socket_timeout * 1000))
175 {
176 send_msg (NDI_RED | NDI_REPLY, "connection-timeout", "safety disconnect due to tcp/ip timeout (no packets received)");
177 write_outputbuffer ();
178
179 LOG (llevDebug, "connection on fd %d closed due to ack timeout (%u/%u/%u)\n", fd,
180 (unsigned)tcpi.tcpi_last_ack_recv, (unsigned)tcpi.tcpi_last_data_sent, (unsigned)tcpi.tcpi_unacked);
181 destroy ();
182 }
183 }
184#endif
185
186 // limit budget surplus/deficit by one mss, add per-tick budget
187 rate_avail = min (rate_avail, mss) + max_rate;
188
189 int max_send = rate_avail;
190
191#if HAVE_TCP_INFO
192 // further restrict the available bandwidth by the excess bandwidth available
193 min_it (max_send, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss);
194#endif
195
196 // round to next-lowest mss
197 max_send -= max_send % mss;
161 198
162 if (ixface.empty ()) 199 if (ixface.empty ())
163 { 200 {
164 // regularly send a new face when queue is empty 201 // regularly send a new face when queue is empty
165 if (bg_scrub && !--bg_scrub && enable_bg_scrub) 202 if (bg_scrub && !--bg_scrub)
166 while (scrub_idx < faces.size () - 1) 203 while (scrub_idx < faces.size () - 1)
167 { 204 {
168 ++scrub_idx; 205 ++scrub_idx;
169 206
170 if (!faces_sent [scrub_idx]) 207 if (!faces_sent [scrub_idx])
208 if (faceinfo *f = face_info (scrub_idx))
209 if (f->type == FT_IMAGE || f->type == FT_SOUND) // only scrub faces and sounds for now
171 { 210 {
172 send_face (scrub_idx); 211 send_face (scrub_idx, -120);
173 flush_fx (); 212 flush_fx ();
174 213
175 bg_scrub = 1; // send up to one face per tick, unless an image was requested 214 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
176 break; 215 break;
177 } 216 }
178 } 217 }
179
180 rate_avail = max_rate - outputbuffer_len ();
181 } 218 }
182 else 219 else
183 { 220 {
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; 221 bg_scrub = BG_SCRUB_RATE;
196 222
223 for (;;)
224 {
225 int avail = max_send - outputbuffer_len ();
226
197 while (avail > 0) 227 if (avail <= 0)
198 { 228 break;
229
199 ixsend &ix = ixface.back (); 230 ixsend &ix = ixface.back ();
200 231
201 if (facedata *d = face_data (ix.idx, faceset)) 232 // estimate the packet header overhead "ix " + idx + (new)ofs
202 { 233 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
203 if (fxix) 234 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
204 {
205 // 9 bytes is enough for fx_FFFOOO, 40 leaves some room for image data
206 int chunk = min (min (avail - 40, MAXSOCKBUF - 9), ix.ofs);
207 235
236 // only transfer something if the amount of data transferred
237 // has a healthy relation to the header overhead
208 if (chunk <= 0) 238 if (chunk < 64)
209 break; 239 break;
210 240
241 chunk = min (chunk, (int)ix.ofs);
242
211 ix.ofs -= chunk; 243 ix.ofs -= chunk;
212 244
245 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
246
213 packet sl ("ix"); 247 packet sl ("ix");
214 248
215 sl << ber32 (ix.idx) 249 sl << ber32 (ix.idx)
216 << ber32 (ix.ofs) 250 << ber32 (ix.ofs)
217 << data (d->data.data () + ix.ofs, chunk); 251 << data (ix.data + ix.ofs, chunk);
218 252
219 send_packet (sl); 253 send_packet (sl);
220 }
221 else
222 {
223 send_image (ix.idx);
224 ix.ofs = 0;
225 }
226 }
227 else
228 ix.ofs = 0;
229
230 int consumed = ol - outputbuffer_len ();
231
232 avail -= consumed;
233 rate_avail -= consumed;
234
235 ol = outputbuffer_len ();
236 254
237 if (!ix.ofs) 255 if (!ix.ofs)
238 { 256 {
239 ixface.pop_back (); 257 ix_pop ();
258
240 if (ixface.empty ()) 259 if (ixface.empty ())
241 break; 260 break;
242 } 261 }
243 } 262 }
244 } 263 }
245}
246 264
265 rate_avail -= outputbuffer_len ();
266}
267
268void
269client::flush_sockets ()
270{
271 for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i)
272 (*i)->flush ();
273}
274
275void
276client::clock ()
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}
288

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines