1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
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 |
9 | * it under the terms of the GNU General Public License as published by |
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 |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your option) 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License 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 |
19 | * along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /** |
24 | /** |
26 | * \file |
25 | * \file |
27 | * Main client/server loops. |
26 | * Main client/server loops. |
… | |
… | |
30 | * |
29 | * |
31 | * loop.c mainly deals with initialization and higher level socket |
30 | * loop.c mainly deals with initialization and higher level socket |
32 | * maintanance (checking for lost connections and if data has arrived.) |
31 | * maintanance (checking for lost connections and if data has arrived.) |
33 | */ |
32 | */ |
34 | |
33 | |
35 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
|
|
36 | |
|
|
37 | #include <global.h> |
34 | #include <global.h> |
38 | #include <sproto.h> |
35 | #include <sproto.h> |
39 | #include <sockproto.h> |
36 | #include <sockproto.h> |
40 | |
37 | |
41 | #include <sys/types.h> |
38 | #include <sys/types.h> |
… | |
… | |
47 | #include <unistd.h> |
44 | #include <unistd.h> |
48 | #include <arpa/inet.h> |
45 | #include <arpa/inet.h> |
49 | |
46 | |
50 | #include <loader.h> |
47 | #include <loader.h> |
51 | |
48 | |
|
|
49 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
|
|
50 | |
52 | #define MAX_QUEUE_DEPTH 500 //TODO |
51 | #define MAX_QUEUE_DEPTH 50 |
53 | #define MAX_QUEUE_BACKLOG 3. //TODO |
52 | #define MAX_QUEUE_BACKLOG 3. |
54 | |
53 | |
55 | void |
54 | void |
56 | client::reset_state () |
55 | client::reset_state () |
57 | { |
56 | { |
58 | if (!pl) |
57 | if (!pl) |
… | |
… | |
63 | } |
62 | } |
64 | |
63 | |
65 | void |
64 | void |
66 | client::queue_command (packet_type *handler, char *data, int datalen) |
65 | client::queue_command (packet_type *handler, char *data, int datalen) |
67 | { |
66 | { |
68 | tstamp stamp = now (); |
67 | tstamp stamp = NOW; |
69 | |
68 | |
70 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
69 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
71 | { |
70 | { |
72 | //TODO: just disconnect here? |
71 | //TODO: just disconnect here? |
73 | reset_state (); |
72 | reset_state (); |
… | |
… | |
85 | } |
84 | } |
86 | |
85 | |
87 | bool |
86 | bool |
88 | client::handle_command () |
87 | client::handle_command () |
89 | { |
88 | { |
90 | bool skipping = false; |
|
|
91 | |
|
|
92 | while (!cmd_queue.empty () |
89 | if (!cmd_queue.empty () |
93 | && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0.f)) |
90 | && state == ST_PLAYING |
|
|
91 | && pl->ob->speed_left > 0.f) |
94 | { |
92 | { |
95 | command &cmd = cmd_queue.front (); |
93 | command &cmd = cmd_queue.front (); |
96 | |
94 | |
97 | if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) |
95 | if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
98 | { |
96 | { |
99 | if (!skipping) |
|
|
100 | { |
|
|
101 | skipping = true; |
|
|
102 | reset_state (); |
97 | reset_state (); |
103 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
98 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
104 | } |
|
|
105 | |
|
|
106 | cmd_queue.pop_front (); |
|
|
107 | } |
99 | } |
108 | else |
100 | else |
109 | { |
|
|
110 | execute (cmd.handler, cmd.data, cmd.datalen); |
101 | execute (cmd.handler, cmd.data, cmd.datalen); |
|
|
102 | |
111 | cmd_queue.pop_front (); |
103 | cmd_queue.pop_front (); |
112 | return true; |
104 | return true; |
113 | } |
|
|
114 | } |
105 | } |
115 | |
106 | else |
116 | return false; |
107 | return false; |
117 | } |
108 | } |
118 | |
109 | |
119 | void |
110 | void |
120 | flush_sockets (void) |
111 | flush_sockets (void) |
121 | { |
112 | { |
… | |
… | |
131 | * |
122 | * |
132 | */ |
123 | */ |
133 | void |
124 | void |
134 | doeric_server (void) |
125 | doeric_server (void) |
135 | { |
126 | { |
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 |
127 | //TODO: should not be done here, either |
142 | for (unsigned i = 0; i < clients.size (); ++i) |
128 | for (unsigned i = 0; i < clients.size (); ++i) |
143 | { |
129 | { |
144 | client *ns = clients [i]; |
130 | client *ns = clients [i]; |
145 | |
131 | |
… | |
… | |
165 | if (last_weight != WEIGHT (pl->ob)) |
151 | 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", |
152 | 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)); |
153 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
168 | } |
154 | } |
169 | |
155 | |
170 | draw_client_map (pl->ob); |
156 | draw_client_map (pl); |
171 | |
157 | |
172 | if (update_look) |
158 | if (update_look) |
173 | esrv_draw_look (pl->ob); |
159 | esrv_draw_look (pl); |
174 | |
160 | |
175 | if (askface.empty () && !partial_face_ofs) |
161 | if (ixface.empty ()) |
176 | { |
162 | { |
177 | // regularly send a new face when queue is empty |
163 | // regularly send a new face when queue is empty |
178 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
164 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
179 | while (scrub_idx < faces.size () - 1) |
165 | while (scrub_idx < faces.size () - 1) |
180 | { |
166 | { |
181 | ++scrub_idx; |
167 | ++scrub_idx; |
|
|
168 | |
182 | if (!faces_sent [scrub_idx]) |
169 | if (!faces_sent [scrub_idx]) |
|
|
170 | if (faceinfo *f = face_info (scrub_idx)) |
|
|
171 | if (f->type == FT_FACE) // only scrub faces for now |
183 | { |
172 | { |
184 | send_face (scrub_idx); |
173 | send_face (scrub_idx, -120); |
185 | flush_fx (); |
174 | flush_fx (); |
186 | |
175 | |
187 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
176 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
188 | break; |
177 | break; |
189 | } |
178 | } |
190 | } |
179 | } |
191 | |
180 | |
192 | rate_avail = max_rate - outputbuffer_len (); |
181 | rate_avail = max_rate - outputbuffer_len (); |
193 | } |
182 | } |
194 | else |
183 | else |
195 | { |
184 | { |
196 | int ol = outputbuffer_len (); |
185 | int ol = outputbuffer_len (); |
197 | |
186 | |
198 | rate_avail = min (max_rate, rate_avail + max_rate); |
187 | rate_avail = min (max_rate + mss, rate_avail + max_rate); |
|
|
188 | |
|
|
189 | int avail = rate_avail; |
|
|
190 | |
|
|
191 | // if we can split images, round to next-lowest mss |
|
|
192 | if (fxix) avail -= avail % mss; |
|
|
193 | |
199 | rate_avail -= ol; |
194 | rate_avail -= ol; |
|
|
195 | avail -= ol; |
200 | |
196 | |
201 | int avail = rate_avail; |
197 | #if HAVE_TCP_INFO |
202 | |
198 | // further restrict the available bandwidth by the excess bandwidth available |
203 | // if we can split images, transfer up to mss packets if possible |
199 | avail = max (0, min (avail, (tcpi.tcpi_snd_cwnd - tcpi.tcpi_unacked + tcpi.tcpi_sacked) * mss)); |
204 | // but never more 768 bytes more. |
200 | #endif |
205 | if (fxix) avail += min (768, mss - (ol % mss)); |
|
|
206 | |
201 | |
207 | bg_scrub = BG_SCRUB_RATE; |
202 | bg_scrub = BG_SCRUB_RATE; |
208 | |
203 | |
209 | while (avail > 0) |
204 | while (avail > 0) |
210 | { |
205 | { |
211 | if (partial_face_ofs) |
206 | ixsend &ix = ixface.back (); |
|
|
207 | |
|
|
208 | if (facedata *d = face_data (ix.idx, faceset)) |
212 | { |
209 | { |
213 | if (facedata *d = face_data (partial_face, faceset)) |
210 | if (fxix) |
214 | { |
211 | { |
215 | // 9 bytes is enough for fx_FFFOOO, 40 leaves some room |
212 | // estimate the packet header overhead "ix " + idx + (new)ofs |
|
|
213 | int pktlen = 3 + ber32::encoded_size (ix.idx) + ber32::encoded_size (ix.ofs); |
216 | int chunk = min (min (avail - 40, MAXSOCKBUF - 9), partial_face_ofs); |
214 | int chunk = min (avail - packet::hdrlen, MAXSOCKBUF) - pktlen; |
217 | |
215 | |
|
|
216 | // only transfer something if the amount of data transferred |
|
|
217 | // has a healthy relation to the header overhead |
218 | if (chunk <= 0) |
218 | if (chunk < 64) |
219 | break; |
219 | break; |
220 | |
220 | |
|
|
221 | chunk = min (chunk, (int)ix.ofs); |
|
|
222 | |
221 | partial_face_ofs -= chunk; |
223 | ix.ofs -= chunk; |
|
|
224 | |
|
|
225 | //fprintf (stderr, "i%dx %6d: %5d+%4d (%4d)\n", fxix, ix.idx,ix.ofs,chunk, ixface.size());//D |
222 | |
226 | |
223 | packet sl ("ix"); |
227 | packet sl ("ix"); |
224 | |
228 | |
225 | sl << ber32 (partial_face) |
229 | sl << ber32 (ix.idx) |
226 | << ber32 (partial_face_ofs) |
230 | << ber32 (ix.ofs) |
227 | << data (d->data.data () + partial_face_ofs, chunk); |
231 | << data (d->data.data () + ix.ofs, chunk); |
228 | |
232 | |
229 | send_packet (sl); |
233 | send_packet (sl); |
230 | } |
234 | } |
231 | else |
235 | else |
232 | partial_face_ofs = 0; |
|
|
233 | } |
|
|
234 | else if (!askface.empty ()) |
|
|
235 | { |
|
|
236 | // use a lifo to send most recently requested images |
|
|
237 | faceidx facenum = askface.back (); |
|
|
238 | askface.pop_back (); |
|
|
239 | |
|
|
240 | if (fxix) |
|
|
241 | { |
236 | { |
242 | if (facedata *d = face_data (facenum, faceset)) |
237 | send_image (ix.idx); |
243 | { |
238 | ix.ofs = 0; |
244 | partial_face = facenum; |
|
|
245 | partial_face_ofs = d->data.size (); |
|
|
246 | } |
|
|
247 | } |
239 | } |
248 | else |
|
|
249 | send_image (facenum); |
|
|
250 | } |
240 | } |
251 | else |
241 | else |
252 | break; |
242 | ix.ofs = 0; |
253 | |
243 | |
254 | int consumed = ol - outputbuffer_len (); |
244 | int consumed = outputbuffer_len () - ol; |
|
|
245 | |
255 | avail -= consumed; |
246 | avail -= consumed; |
256 | rate_avail -= consumed; |
247 | rate_avail -= consumed; |
|
|
248 | |
|
|
249 | ol = outputbuffer_len (); |
|
|
250 | |
|
|
251 | if (!ix.ofs) |
|
|
252 | { |
|
|
253 | ixface.pop_back (); |
|
|
254 | |
|
|
255 | if (ixface.empty ()) |
|
|
256 | break; |
|
|
257 | } |
257 | } |
258 | } |
258 | } |
259 | } |
259 | } |
260 | } |
260 | |
261 | |