ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/loop.C
Revision: 1.68
Committed: Thu Aug 9 04:11:24 2007 UTC (16 years, 10 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.67: +1 -0 lines
Log Message:
*** empty log message ***

File Contents

# Content
1 /*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 *
8 * Crossfire TRT 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 <crossfire@schmorp.de>
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 8.
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.push_back (command ());
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 cmd_queue.pop_front ();
107 return true;
108 }
109 else
110 return false;
111 }
112
113 void
114 client::tick ()
115 {
116 if (!pl || destroyed ())
117 return;
118
119 /* Update the players stats once per tick. More efficient than
120 * sending them whenever they change, and probably just as useful
121 */
122 esrv_update_stats (pl);
123
124 if (last_weight != -1 && last_weight != WEIGHT (pl->ob))
125 {
126 esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob);
127 if (last_weight != WEIGHT (pl->ob))
128 LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n",
129 (unsigned long) last_weight, WEIGHT (pl->ob));
130 }
131
132 draw_client_map (pl);
133
134 if (update_look)
135 esrv_draw_look (pl);
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;
184
185 if (ixface.empty ())
186 {
187 // regularly send a new face when queue is empty
188 if (bg_scrub && !--bg_scrub && enable_bg_scrub)
189 while (scrub_idx < faces.size () - 1)
190 {
191 ++scrub_idx;
192
193 if (!faces_sent [scrub_idx])
194 if (faceinfo *f = face_info (scrub_idx))
195 if (f->type == FT_FACE || f->type == FT_SOUND) // only scrub faces and sounds for now
196 {
197 send_face (scrub_idx, -120);
198 flush_fx ();
199
200 bg_scrub = 1; // send up to one fx per tick, unless an image was requested
201 break;
202 }
203 }
204 }
205 else
206 {
207 bg_scrub = BG_SCRUB_RATE;
208
209 for (;;)
210 {
211 int avail = max_send - outputbuffer_len ();
212
213 if (avail <= 0)
214 break;
215
216 ixsend &ix = ixface.back ();
217
218 if (facedata *d = face_data (ix.idx, faceset))
219 {
220 if (fxix)
221 {
222 // estimate the packet header overhead "ix " + idx + (new)ofs
223 int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs);
224 int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen;
225
226 // only transfer something if the amount of data transferred
227 // has a healthy relation to the header overhead
228 if (chunk < 64)
229 break;
230
231 chunk = min (chunk, (int)ix.ofs);
232
233 ix.ofs -= chunk;
234
235 //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D
236
237 packet sl ("ix");
238
239 sl << ber32 (ix.idx)
240 << ber32 (ix.ofs)
241 << data (d->data.data () + ix.ofs, chunk);
242
243 send_packet (sl);
244 }
245 else
246 {
247 send_image (ix.idx);
248 ix.ofs = 0;
249 }
250 }
251 else
252 ix.ofs = 0;
253
254 if (!ix.ofs)
255 {
256 ixface.pop_back ();
257
258 if (ixface.empty ())
259 break;
260 }
261 }
262 }
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