ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/loop.C
Revision: 1.78
Committed: Sat Dec 27 01:25:00 2008 UTC (15 years, 4 months ago) by root
Content type: text/plain
Branch: MAIN
CVS Tags: rel-2_76, rel-2_77, rel-2_74, rel-2_75
Changes since 1.77: +19 -27 lines
Log Message:
gcfclient removal

File Contents

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