1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team |
5 | * Copyright (©) 2002-2003,2007 Mark Wedel & The Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
9 | * it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
11 | * (at your option) any later version. |
11 | * any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, but |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 | * GNU General Public License for more details. |
16 | * for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License along |
19 | * along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 | * |
21 | * |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /** |
25 | /** |
26 | * \file |
26 | * \file |
27 | * Main client/server loops. |
27 | * Main client/server loops. |
… | |
… | |
30 | * |
30 | * |
31 | * loop.c mainly deals with initialization and higher level socket |
31 | * loop.c mainly deals with initialization and higher level socket |
32 | * maintanance (checking for lost connections and if data has arrived.) |
32 | * maintanance (checking for lost connections and if data has arrived.) |
33 | */ |
33 | */ |
34 | |
34 | |
35 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
|
|
36 | |
|
|
37 | #include <global.h> |
35 | #include <global.h> |
38 | #include <sproto.h> |
36 | #include <sproto.h> |
39 | #include <sockproto.h> |
37 | #include <sockproto.h> |
40 | |
38 | |
41 | #include <sys/types.h> |
39 | #include <sys/types.h> |
… | |
… | |
47 | #include <unistd.h> |
45 | #include <unistd.h> |
48 | #include <arpa/inet.h> |
46 | #include <arpa/inet.h> |
49 | |
47 | |
50 | #include <loader.h> |
48 | #include <loader.h> |
51 | |
49 | |
|
|
50 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
|
|
51 | |
52 | #define MAX_QUEUE_DEPTH 500 //TODO |
52 | #define MAX_QUEUE_DEPTH 500 |
53 | #define MAX_QUEUE_BACKLOG 3. //TODO |
53 | #define MAX_QUEUE_BACKLOG 3. |
54 | |
54 | |
55 | void |
55 | void |
56 | client::reset_state () |
56 | client::reset_state () |
57 | { |
57 | { |
58 | if (!pl) |
58 | if (!pl) |
… | |
… | |
63 | } |
63 | } |
64 | |
64 | |
65 | void |
65 | void |
66 | client::queue_command (packet_type *handler, char *data, int datalen) |
66 | client::queue_command (packet_type *handler, char *data, int datalen) |
67 | { |
67 | { |
68 | tstamp stamp = now (); |
68 | tstamp stamp = NOW; |
69 | |
69 | |
70 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
70 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
71 | { |
71 | { |
72 | //TODO: just disconnect here? |
72 | //TODO: just disconnect here? |
73 | reset_state (); |
73 | reset_state (); |
… | |
… | |
85 | } |
85 | } |
86 | |
86 | |
87 | bool |
87 | bool |
88 | client::handle_command () |
88 | client::handle_command () |
89 | { |
89 | { |
90 | bool skipping = false; |
|
|
91 | |
|
|
92 | while (!cmd_queue.empty () |
90 | if (!cmd_queue.empty () |
93 | && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0.f)) |
91 | && state == ST_PLAYING |
|
|
92 | && pl->ob->speed_left > 0.f) |
94 | { |
93 | { |
95 | command &cmd = cmd_queue.front (); |
94 | command &cmd = cmd_queue.front (); |
96 | |
95 | |
97 | if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) |
96 | if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
98 | { |
97 | { |
99 | if (!skipping) |
|
|
100 | { |
|
|
101 | skipping = true; |
|
|
102 | reset_state (); |
98 | reset_state (); |
103 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
99 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
104 | } |
|
|
105 | |
|
|
106 | cmd_queue.pop_front (); |
|
|
107 | } |
100 | } |
108 | else |
101 | else |
109 | { |
|
|
110 | execute (cmd.handler, cmd.data, cmd.datalen); |
102 | execute (cmd.handler, cmd.data, cmd.datalen); |
|
|
103 | |
111 | cmd_queue.pop_front (); |
104 | cmd_queue.pop_front (); |
112 | return true; |
105 | return true; |
113 | } |
|
|
114 | } |
106 | } |
115 | |
107 | else |
116 | return false; |
108 | return false; |
117 | } |
109 | } |
118 | |
110 | |
119 | void |
111 | void |
120 | flush_sockets (void) |
112 | flush_sockets (void) |
121 | { |
113 | { |
… | |
… | |
131 | * |
123 | * |
132 | */ |
124 | */ |
133 | void |
125 | void |
134 | doeric_server (void) |
126 | doeric_server (void) |
135 | { |
127 | { |
136 | #ifdef CS_LOGSTATS |
|
|
137 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
|
|
138 | write_cs_stats (); |
|
|
139 | #endif |
|
|
140 | |
|
|
141 | //TODO: should not be done here, either |
128 | //TODO: should not be done here, either |
142 | for (unsigned i = 0; i < clients.size (); ++i) |
129 | for (unsigned i = 0; i < clients.size (); ++i) |
143 | { |
130 | { |
144 | client *ns = clients [i]; |
131 | client *ns = clients [i]; |
145 | |
132 | |
… | |
… | |
165 | if (last_weight != WEIGHT (pl->ob)) |
152 | if (last_weight != WEIGHT (pl->ob)) |
166 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
153 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
167 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
154 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
168 | } |
155 | } |
169 | |
156 | |
170 | draw_client_map (pl->ob); |
157 | draw_client_map (pl); |
171 | |
158 | |
172 | if (update_look) |
159 | if (update_look) |
173 | esrv_draw_look (pl->ob); |
160 | esrv_draw_look (pl); |
174 | |
161 | |
175 | if (askface.empty () && !partial_face_ofs) |
162 | if (ixface.empty () && !partial_face_ofs) |
176 | { |
163 | { |
177 | // regularly send a new face when queue is empty |
164 | // regularly send a new face when queue is empty |
178 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
165 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
179 | while (scrub_idx < faces.size () - 1) |
166 | while (scrub_idx < faces.size () - 1) |
180 | { |
167 | { |
… | |
… | |
198 | rate_avail = min (max_rate, rate_avail + max_rate); |
185 | rate_avail = min (max_rate, rate_avail + max_rate); |
199 | rate_avail -= ol; |
186 | rate_avail -= ol; |
200 | |
187 | |
201 | int avail = rate_avail; |
188 | int avail = rate_avail; |
202 | |
189 | |
203 | // if we can split images, transfer up to mss packets if possible |
190 | // if we can split images, transfer up to mss-sized packets if possible |
204 | // but never more 768 bytes more. |
191 | // but never 768 bytes more. |
205 | if (fxix) avail += min (768, mss - (ol % mss)); |
192 | if (fxix) avail += min (768, mss - (ol % mss)); |
206 | |
193 | |
207 | bg_scrub = BG_SCRUB_RATE; |
194 | bg_scrub = BG_SCRUB_RATE; |
208 | |
195 | |
209 | while (avail > 0) |
196 | while (avail > 0) |
210 | { |
197 | { |
211 | if (partial_face_ofs) |
198 | if (partial_face_ofs) |
212 | { |
199 | { |
213 | if (facedata *d = face_data (partial_face, faceset)) |
200 | if (facedata *d = face_data (partial_face, faceset)) |
214 | { |
201 | { |
215 | // 9 bytes is enough for fx_FFFOOO, 40 leaves some room |
202 | // 9 bytes is enough for fx_FFFOOO, 40 leaves some room for image data |
216 | int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs); |
203 | int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs); |
217 | |
204 | |
218 | if (chunk <= 0) |
205 | if (chunk <= 0) |
219 | break; |
206 | break; |
220 | |
207 | |
… | |
… | |
229 | send_packet (sl); |
216 | send_packet (sl); |
230 | } |
217 | } |
231 | else |
218 | else |
232 | partial_face_ofs = 0; |
219 | partial_face_ofs = 0; |
233 | } |
220 | } |
234 | else if (!askface.empty ()) |
221 | else if (!ixface.empty ()) |
235 | { |
222 | { |
236 | // use a lifo to send most recently requested images |
223 | // use a lifo to send most recently requested images |
237 | faceidx facenum = askface.back (); |
224 | faceidx facenum = ixface.back (); |
238 | askface.pop_back (); |
225 | ixface.pop_back (); |
239 | |
226 | |
240 | if (fxix) |
227 | if (fxix) |
241 | { |
228 | { |
242 | if (facedata *d = face_data (facenum, faceset)) |
229 | if (facedata *d = face_data (facenum, faceset)) |
243 | { |
230 | { |