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 (); |
… | |
… | |
91 | && state == ST_PLAYING |
91 | && state == ST_PLAYING |
92 | && pl->ob->speed_left > 0.f) |
92 | && pl->ob->speed_left > 0.f) |
93 | { |
93 | { |
94 | command &cmd = cmd_queue.front (); |
94 | command &cmd = cmd_queue.front (); |
95 | |
95 | |
96 | if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) |
96 | if (cmd.stamp + MAX_QUEUE_BACKLOG < NOW) |
97 | { |
97 | { |
98 | reset_state (); |
98 | reset_state (); |
99 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
99 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
100 | } |
100 | } |
101 | else |
101 | else |
… | |
… | |
123 | * |
123 | * |
124 | */ |
124 | */ |
125 | void |
125 | void |
126 | doeric_server (void) |
126 | doeric_server (void) |
127 | { |
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 |
128 | //TODO: should not be done here, either |
134 | for (unsigned i = 0; i < clients.size (); ++i) |
129 | for (unsigned i = 0; i < clients.size (); ++i) |
135 | { |
130 | { |
136 | client *ns = clients [i]; |
131 | client *ns = clients [i]; |
137 | |
132 | |
… | |
… | |
157 | if (last_weight != WEIGHT (pl->ob)) |
152 | 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", |
153 | 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)); |
154 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
160 | } |
155 | } |
161 | |
156 | |
162 | draw_client_map (pl->ob); |
157 | draw_client_map (pl); |
163 | |
158 | |
164 | if (update_look) |
159 | if (update_look) |
165 | esrv_draw_look (pl->ob); |
160 | esrv_draw_look (pl); |
166 | |
161 | |
167 | if (askface.empty () && !partial_face_ofs) |
162 | if (askface.empty () && !partial_face_ofs) |
168 | { |
163 | { |
169 | // regularly send a new face when queue is empty |
164 | // regularly send a new face when queue is empty |
170 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
165 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
… | |
… | |
191 | rate_avail -= ol; |
186 | rate_avail -= ol; |
192 | |
187 | |
193 | int avail = rate_avail; |
188 | int avail = rate_avail; |
194 | |
189 | |
195 | // if we can split images, transfer up to mss packets if possible |
190 | // if we can split images, transfer up to mss packets if possible |
196 | // but never more 768 bytes more. |
191 | // but never 768 bytes more. |
197 | if (fxix) avail += min (768, mss - (ol % mss)); |
192 | if (fxix) avail += min (768, mss - (ol % mss)); |
198 | |
193 | |
199 | bg_scrub = BG_SCRUB_RATE; |
194 | bg_scrub = BG_SCRUB_RATE; |
200 | |
195 | |
201 | while (avail > 0) |
196 | while (avail > 0) |