1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team |
5 | * Copyright (C) 2002-2003 Mark Wedel & The Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | 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 |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The author can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /** |
25 | /** |
25 | * \file |
26 | * \file |
26 | * Main client/server loops. |
27 | * Main client/server loops. |
27 | * |
28 | * |
28 | * \date 2003-12-02 |
29 | * \date 2003-12-02 |
29 | * |
30 | * |
30 | * loop.c mainly deals with initialization and higher level socket |
31 | * loop.c mainly deals with initialization and higher level socket |
31 | * maintenance (checking for lost connections and if data has arrived.) |
32 | * maintanance (checking for lost connections and if data has arrived.) |
32 | * The reading of data is handled in ericserver.c |
|
|
33 | */ |
33 | */ |
34 | |
34 | |
|
|
35 | #define BG_SCRUB_RATE 4 // how often to send a face in the background |
35 | |
36 | |
36 | #include <global.h> |
37 | #include <global.h> |
37 | #include <sproto.h> |
38 | #include <sproto.h> |
38 | #include <sockproto.h> |
39 | #include <sockproto.h> |
39 | |
40 | |
… | |
… | |
47 | #include <arpa/inet.h> |
48 | #include <arpa/inet.h> |
48 | |
49 | |
49 | #include <loader.h> |
50 | #include <loader.h> |
50 | |
51 | |
51 | #define MAX_QUEUE_DEPTH 500 //TODO |
52 | #define MAX_QUEUE_DEPTH 500 //TODO |
52 | #define MAX_QUEUE_BACKLOG 5. //TODO |
53 | #define MAX_QUEUE_BACKLOG 3. //TODO |
53 | |
54 | |
54 | void |
55 | void |
55 | client::reset_state () |
56 | client::reset_state () |
56 | { |
57 | { |
57 | if (!pl) |
58 | if (!pl) |
… | |
… | |
70 | { |
71 | { |
71 | //TODO: just disconnect here? |
72 | //TODO: just disconnect here? |
72 | reset_state (); |
73 | reset_state (); |
73 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
74 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
74 | } |
75 | } |
75 | else if (!cmd_queue.empty () && cmd_queue.front ().stamp + MAX_QUEUE_BACKLOG < stamp) |
|
|
76 | { |
|
|
77 | reset_state (); |
|
|
78 | send_packet_printf ("drawinfo %d too many commands in queue, ignoring.", NDI_RED); |
|
|
79 | } |
|
|
80 | else |
76 | else |
|
|
77 | { |
81 | cmd_queue.push_back (command ( |
78 | cmd_queue.push_back (command ()); |
82 | stamp, handler, (char *)salloc (datalen + 1, data), datalen |
79 | command &cmd = cmd_queue.back (); |
83 | )); |
80 | cmd.stamp = stamp; |
|
|
81 | cmd.handler = handler; |
|
|
82 | cmd.data = salloc<char> (datalen + 1, data); |
|
|
83 | cmd.datalen = datalen; |
|
|
84 | } |
84 | } |
85 | } |
85 | |
86 | |
86 | bool |
87 | bool |
87 | client::handle_command () |
88 | client::handle_command () |
88 | { |
89 | { |
89 | if (pl && pl->state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0) |
90 | bool skipping = false; |
90 | return false; |
|
|
91 | |
91 | |
92 | if (cmd_queue.empty ()) |
92 | while (!cmd_queue.empty () |
93 | return false; |
93 | && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0)) |
94 | |
94 | { |
95 | command &cmd = cmd_queue.front (); |
95 | command &cmd = cmd_queue.front (); |
96 | |
96 | |
97 | if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) |
97 | if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) |
98 | { |
98 | { |
|
|
99 | if (!skipping) |
|
|
100 | { |
|
|
101 | skipping = true; |
99 | reset_state (); |
102 | reset_state (); |
100 | send_packet_printf ("drawinfo %d ignoring delayed command.", NDI_RED); |
103 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
101 | } |
104 | } |
|
|
105 | |
|
|
106 | cmd_queue.pop_front (); |
|
|
107 | } |
102 | else |
108 | else |
|
|
109 | { |
103 | execute (cmd.handler, cmd.data, cmd.datalen); |
110 | execute (cmd.handler, cmd.data, cmd.datalen); |
104 | |
|
|
105 | sfree (cmd.data, cmd.datalen); |
|
|
106 | cmd_queue.pop_front (); |
111 | cmd_queue.pop_front (); |
107 | |
|
|
108 | return true; |
112 | return true; |
|
|
113 | } |
|
|
114 | } |
|
|
115 | |
|
|
116 | return false; |
109 | } |
117 | } |
110 | |
118 | |
111 | void |
119 | void |
112 | flush_sockets (void) |
120 | flush_sockets (void) |
113 | { |
121 | { |
114 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
122 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
115 | if ((*i)->status != Ns_Dead) |
|
|
116 | (*i)->flush (); |
123 | (*i)->flush (); |
117 | } |
124 | } |
118 | |
125 | |
119 | /** |
126 | /** |
120 | * This checks the sockets for input, does the right thing. |
127 | * This checks the sockets for input, does the right thing. |
121 | * |
128 | * |
… | |
… | |
129 | #ifdef CS_LOGSTATS |
136 | #ifdef CS_LOGSTATS |
130 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
137 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
131 | write_cs_stats (); |
138 | write_cs_stats (); |
132 | #endif |
139 | #endif |
133 | |
140 | |
134 | /* Go through the players. Let the loop set the next pl value, |
141 | //TODO: should not be done here, either |
135 | * since we may remove some |
142 | for (unsigned i = 0; i < clients.size (); ++i) |
|
|
143 | { |
|
|
144 | client *ns = clients [i]; |
|
|
145 | |
|
|
146 | ns->tick (); |
|
|
147 | ns->refcnt_chk (); |
|
|
148 | } |
|
|
149 | } |
|
|
150 | |
|
|
151 | void |
|
|
152 | client::tick () |
|
|
153 | { |
|
|
154 | if (!pl || destroyed ()) |
|
|
155 | return; |
|
|
156 | |
|
|
157 | /* Update the players stats once per tick. More efficient than |
|
|
158 | * sending them whenever they change, and probably just as useful |
136 | */ |
159 | */ |
137 | //TODO: must be handled cleanly elsewhere |
160 | esrv_update_stats (pl); |
138 | for (player *pl = first_player; pl; ) |
161 | |
|
|
162 | if (last_weight != -1 && last_weight != WEIGHT (pl->ob)) |
|
|
163 | { |
|
|
164 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
|
|
165 | 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", |
|
|
167 | (unsigned long) last_weight, WEIGHT (pl->ob)); |
139 | { |
168 | } |
140 | player *npl = pl->next; |
|
|
141 | |
169 | |
142 | //TODO: must be handled cleanly elsewhere |
170 | draw_client_map (pl->ob); |
143 | if (!pl->socket || pl->socket->status == Ns_Dead) |
171 | |
|
|
172 | if (update_look) |
|
|
173 | esrv_draw_look (pl->ob); |
|
|
174 | |
|
|
175 | if (askface.empty ()) |
|
|
176 | { |
|
|
177 | // regularly send a new face when queue is empty |
|
|
178 | if (bg_scrub && !--bg_scrub && enable_bg_scrub) |
|
|
179 | while (scrub_idx < faces.size () - 1) |
|
|
180 | { |
|
|
181 | ++scrub_idx; |
|
|
182 | if (!faces_sent [scrub_idx]) |
|
|
183 | { |
|
|
184 | send_face (scrub_idx); |
|
|
185 | bg_scrub = 1; // send up to one face per tick, unless an image was requested |
|
|
186 | break; |
|
|
187 | } |
|
|
188 | } |
|
|
189 | |
|
|
190 | rate_avail = max_rate - outputbuffer_len (); |
|
|
191 | } |
|
|
192 | else |
|
|
193 | { |
|
|
194 | int ol = outputbuffer_len (); |
|
|
195 | |
|
|
196 | rate_avail = min (max_rate, rate_avail + max_rate); |
|
|
197 | rate_avail -= ol; |
|
|
198 | |
|
|
199 | int avail = rate_avail; |
|
|
200 | |
|
|
201 | // if we can split images, transfer up to mss packets if possible |
|
|
202 | if (fxix) avail += mss - (ol % mss); |
|
|
203 | |
|
|
204 | fprintf (stderr, "ra %6d a %6d ", rate_avail, avail); |
|
|
205 | |
|
|
206 | while (!askface.empty () && avail > 0) |
144 | { |
207 | { |
145 | save_player (pl->ob, 0); |
208 | // use a lifo to send most recently requested images |
|
|
209 | faceidx face = askface.back (); |
|
|
210 | askface.pop_back (); |
146 | |
211 | |
147 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
212 | send_image (face); |
148 | { |
|
|
149 | terminate_all_pets (pl->ob); |
|
|
150 | pl->ob->remove (); |
|
|
151 | } |
|
|
152 | |
213 | |
153 | leave (pl, 1); |
214 | bg_scrub = BG_SCRUB_RATE; |
154 | final_free_player (pl); |
215 | |
|
|
216 | int consumed = ol - outputbuffer_len (); |
|
|
217 | avail -= consumed; |
|
|
218 | rate_avail -= consumed; |
155 | } |
219 | } |
156 | |
220 | |
157 | pl = npl; |
221 | fprintf (stderr, "ra %6d a %6d\n", rate_avail, avail); |
158 | } |
|
|
159 | |
222 | |
160 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ) |
|
|
161 | { |
223 | } |
162 | client *s = *i; |
|
|
163 | |
|
|
164 | if (s->status == Ns_Dead) |
|
|
165 | { |
|
|
166 | clients.erase (i); |
|
|
167 | delete s; |
|
|
168 | } |
|
|
169 | else |
|
|
170 | ++i; |
|
|
171 | } |
|
|
172 | |
|
|
173 | /* We need to do some of the processing below regardless */ |
|
|
174 | |
|
|
175 | /* Check for any input on the sockets */ |
|
|
176 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
177 | { |
|
|
178 | client *s = *i; |
|
|
179 | player *pl = s->pl; |
|
|
180 | |
|
|
181 | s->handle_packet (); |
|
|
182 | s->handle_command (); |
|
|
183 | |
|
|
184 | //TODO: should not be done here, either |
|
|
185 | if (s->status != Ns_Dead && pl) |
|
|
186 | { |
|
|
187 | /* Update the players stats once per tick. More efficient than |
|
|
188 | * sending them whenever they change, and probably just as useful |
|
|
189 | */ |
|
|
190 | esrv_update_stats (pl); |
|
|
191 | |
|
|
192 | if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob)) |
|
|
193 | { |
|
|
194 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
|
|
195 | if (pl->last_weight != WEIGHT (pl->ob)) |
|
|
196 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
|
|
197 | (unsigned long) pl->last_weight, WEIGHT (pl->ob)); |
|
|
198 | } |
|
|
199 | |
|
|
200 | draw_client_map (pl->ob); |
|
|
201 | |
|
|
202 | if (s->update_look) |
|
|
203 | esrv_draw_look (pl->ob); |
|
|
204 | } |
|
|
205 | } |
|
|
206 | } |
224 | } |
207 | |
225 | |