1 |
/* |
2 |
* CrossFire, A Multiplayer game for X-windows |
3 |
* |
4 |
* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
5 |
* Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team |
6 |
* Copyright (C) 1992 Frank Tore Johansen |
7 |
* |
8 |
* This program 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 2 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, write to the Free Software |
20 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
21 |
* |
22 |
* The author 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 |
#define BG_SCRUB_RATE 4 // how often to send a face in the background |
36 |
|
37 |
#include <global.h> |
38 |
#include <sproto.h> |
39 |
#include <sockproto.h> |
40 |
|
41 |
#include <sys/types.h> |
42 |
#include <sys/time.h> |
43 |
#include <sys/socket.h> |
44 |
#include <netinet/in.h> |
45 |
#include <netdb.h> |
46 |
|
47 |
#include <unistd.h> |
48 |
#include <arpa/inet.h> |
49 |
|
50 |
#include <loader.h> |
51 |
|
52 |
#define MAX_QUEUE_DEPTH 500 //TODO |
53 |
#define MAX_QUEUE_BACKLOG 3. //TODO |
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 |
#ifdef CS_LOGSTATS |
129 |
if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
130 |
write_cs_stats (); |
131 |
#endif |
132 |
|
133 |
//TODO: should not be done here, either |
134 |
for (unsigned i = 0; i < clients.size (); ++i) |
135 |
{ |
136 |
client *ns = clients [i]; |
137 |
|
138 |
ns->tick (); |
139 |
ns->refcnt_chk (); |
140 |
} |
141 |
} |
142 |
|
143 |
void |
144 |
client::tick () |
145 |
{ |
146 |
if (!pl || destroyed ()) |
147 |
return; |
148 |
|
149 |
/* Update the players stats once per tick. More efficient than |
150 |
* sending them whenever they change, and probably just as useful |
151 |
*/ |
152 |
esrv_update_stats (pl); |
153 |
|
154 |
if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) |
155 |
{ |
156 |
esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
157 |
if (last_weight != WEIGHT (pl->ob)) |
158 |
LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
159 |
(unsigned long) last_weight, WEIGHT (pl->ob)); |
160 |
} |
161 |
|
162 |
draw_client_map (pl->ob); |
163 |
|
164 |
if (update_look) |
165 |
esrv_draw_look (pl->ob); |
166 |
|
167 |
if (askface.empty () && !partial_face_ofs) |
168 |
{ |
169 |
// regularly send a new face when queue is empty |
170 |
if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
171 |
while (scrub_idx < faces.size () - 1) |
172 |
{ |
173 |
++scrub_idx; |
174 |
if (!faces_sent [scrub_idx]) |
175 |
{ |
176 |
send_face (scrub_idx); |
177 |
flush_fx (); |
178 |
|
179 |
bg_scrub = 1; // send up to one face per tick, unless an image was requested |
180 |
break; |
181 |
} |
182 |
} |
183 |
|
184 |
rate_avail = max_rate - outputbuffer_len (); |
185 |
} |
186 |
else |
187 |
{ |
188 |
int ol = outputbuffer_len (); |
189 |
|
190 |
rate_avail = min (max_rate, rate_avail + max_rate); |
191 |
rate_avail -= ol; |
192 |
|
193 |
int avail = rate_avail; |
194 |
|
195 |
// if we can split images, transfer up to mss packets if possible |
196 |
// but never more 768 bytes more. |
197 |
if (fxix) avail += min (768, mss - (ol % mss)); |
198 |
|
199 |
bg_scrub = BG_SCRUB_RATE; |
200 |
|
201 |
while (avail > 0) |
202 |
{ |
203 |
if (partial_face_ofs) |
204 |
{ |
205 |
if (facedata *d = face_data (partial_face, faceset)) |
206 |
{ |
207 |
// 9 bytes is enough for fx_FFFOOO, 40 leaves some room |
208 |
int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs); |
209 |
|
210 |
if (chunk <= 0) |
211 |
break; |
212 |
|
213 |
partial_face_ofs -= chunk; |
214 |
|
215 |
packet sl ("ix"); |
216 |
|
217 |
sl << ber32 (partial_face) |
218 |
<< ber32 (partial_face_ofs) |
219 |
<< data (d->data.data () + partial_face_ofs, chunk); |
220 |
|
221 |
send_packet (sl); |
222 |
} |
223 |
else |
224 |
partial_face_ofs = 0; |
225 |
} |
226 |
else if (!askface.empty ()) |
227 |
{ |
228 |
// use a lifo to send most recently requested images |
229 |
faceidx facenum = askface.back (); |
230 |
askface.pop_back (); |
231 |
|
232 |
if (fxix) |
233 |
{ |
234 |
if (facedata *d = face_data (facenum, faceset)) |
235 |
{ |
236 |
partial_face = facenum; |
237 |
partial_face_ofs = d->data.size (); |
238 |
} |
239 |
} |
240 |
else |
241 |
send_image (facenum); |
242 |
} |
243 |
else |
244 |
break; |
245 |
|
246 |
int consumed = ol - outputbuffer_len (); |
247 |
avail -= consumed; |
248 |
rate_avail -= consumed; |
249 |
} |
250 |
} |
251 |
} |
252 |
|