1 |
/* |
2 |
* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
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 it |
9 |
* under the terms of the GNU General Public License as published by the Free |
10 |
* Software Foundation; either version 2 of the License, or (at your option) |
11 |
* any later version. |
12 |
* |
13 |
* This program is distributed in the hope that it will be useful, but |
14 |
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 |
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 |
* for more details. |
17 |
* |
18 |
* You should have received a copy of the GNU General Public License along |
19 |
* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 |
* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 |
* |
22 |
* The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 |
*/ |
24 |
|
25 |
/** |
26 |
* \file |
27 |
* Main client/server loops. |
28 |
* |
29 |
* \date 2003-12-02 |
30 |
* |
31 |
* loop.c mainly deals with initialization and higher level socket |
32 |
* maintanance (checking for lost connections and if data has arrived.) |
33 |
*/ |
34 |
|
35 |
#include <global.h> |
36 |
#include <sproto.h> |
37 |
#include <sockproto.h> |
38 |
|
39 |
#include <sys/types.h> |
40 |
#include <sys/time.h> |
41 |
#include <sys/socket.h> |
42 |
#include <netinet/in.h> |
43 |
#include <netdb.h> |
44 |
|
45 |
#include <unistd.h> |
46 |
#include <arpa/inet.h> |
47 |
|
48 |
#include <loader.h> |
49 |
|
50 |
#define BG_SCRUB_RATE 4 // how often to send a face in the background |
51 |
|
52 |
#define MAX_QUEUE_DEPTH 500 |
53 |
#define MAX_QUEUE_BACKLOG 3. |
54 |
|
55 |
void |
56 |
client::reset_state () |
57 |
{ |
58 |
if (!pl) |
59 |
return; |
60 |
|
61 |
pl->run_on = 0; |
62 |
pl->fire_on = 0; |
63 |
} |
64 |
|
65 |
void |
66 |
client::queue_command (packet_type *handler, char *data, int datalen) |
67 |
{ |
68 |
tstamp stamp = NOW; |
69 |
|
70 |
if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
71 |
{ |
72 |
//TODO: just disconnect here? |
73 |
reset_state (); |
74 |
send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
75 |
} |
76 |
else |
77 |
{ |
78 |
cmd_queue.push_back (command ()); |
79 |
command &cmd = cmd_queue.back (); |
80 |
cmd.stamp = stamp; |
81 |
cmd.handler = handler; |
82 |
cmd.data = salloc<char> (datalen + 1, data); |
83 |
cmd.datalen = datalen; |
84 |
} |
85 |
} |
86 |
|
87 |
bool |
88 |
client::handle_command () |
89 |
{ |
90 |
if (!cmd_queue.empty () |
91 |
&& state == ST_PLAYING |
92 |
&& pl->ob->speed_left > 0.f) |
93 |
{ |
94 |
command &cmd = cmd_queue.front (); |
95 |
|
96 |
if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
97 |
{ |
98 |
reset_state (); |
99 |
send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
100 |
} |
101 |
else |
102 |
execute (cmd.handler, cmd.data, cmd.datalen); |
103 |
|
104 |
cmd_queue.pop_front (); |
105 |
return true; |
106 |
} |
107 |
else |
108 |
return false; |
109 |
} |
110 |
|
111 |
void |
112 |
flush_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 |
*/ |
125 |
void |
126 |
doeric_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 |
|
138 |
void |
139 |
client::tick () |
140 |
{ |
141 |
if (!pl || destroyed ()) |
142 |
return; |
143 |
|
144 |
/* Update the players stats once per tick. More efficient than |
145 |
* sending them whenever they change, and probably just as useful |
146 |
*/ |
147 |
esrv_update_stats (pl); |
148 |
|
149 |
if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) |
150 |
{ |
151 |
esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
152 |
if (last_weight != WEIGHT (pl->ob)) |
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 |
|
157 |
draw_client_map (pl); |
158 |
|
159 |
if (update_look) |
160 |
esrv_draw_look (pl); |
161 |
|
162 |
if (ixface.empty ()) |
163 |
{ |
164 |
// regularly send a new face when queue is empty |
165 |
if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
166 |
while (scrub_idx < faces.size () - 1) |
167 |
{ |
168 |
++scrub_idx; |
169 |
|
170 |
if (!faces_sent [scrub_idx]) |
171 |
{ |
172 |
send_face (scrub_idx); |
173 |
flush_fx (); |
174 |
|
175 |
bg_scrub = 1; // send up to one face per tick, unless an image was requested |
176 |
break; |
177 |
} |
178 |
} |
179 |
|
180 |
rate_avail = max_rate - outputbuffer_len (); |
181 |
} |
182 |
else |
183 |
{ |
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; |
196 |
|
197 |
while (avail > 0) |
198 |
{ |
199 |
ixsend &ix = ixface.back (); |
200 |
|
201 |
if (facedata *d = face_data (ix.idx, faceset)) |
202 |
{ |
203 |
if (fxix) |
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 |
|
208 |
if (chunk <= 0) |
209 |
break; |
210 |
|
211 |
ix.ofs -= chunk; |
212 |
|
213 |
packet sl ("ix"); |
214 |
|
215 |
sl << ber32 (ix.idx) |
216 |
<< ber32 (ix.ofs) |
217 |
<< data (d->data.data () + ix.ofs, chunk); |
218 |
|
219 |
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 |
|
237 |
if (!ix.ofs) |
238 |
{ |
239 |
ixface.pop_back (); |
240 |
if (ixface.empty ()) |
241 |
break; |
242 |
} |
243 |
} |
244 |
} |
245 |
} |
246 |
|