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 |
… | |
… | |
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 | |
35 | |
36 | #include <global.h> |
36 | #include <global.h> |
37 | #include <sproto.h> |
37 | #include <sproto.h> |
… | |
… | |
47 | #include <arpa/inet.h> |
47 | #include <arpa/inet.h> |
48 | |
48 | |
49 | #include <loader.h> |
49 | #include <loader.h> |
50 | |
50 | |
51 | #define MAX_QUEUE_DEPTH 500 //TODO |
51 | #define MAX_QUEUE_DEPTH 500 //TODO |
52 | #define MAX_QUEUE_BACKLOG 5. //TODO |
52 | #define MAX_QUEUE_BACKLOG 3. //TODO |
53 | |
53 | |
54 | void |
54 | void |
55 | client::reset_state () |
55 | client::reset_state () |
56 | { |
56 | { |
57 | if (!pl) |
57 | if (!pl) |
… | |
… | |
70 | { |
70 | { |
71 | //TODO: just disconnect here? |
71 | //TODO: just disconnect here? |
72 | reset_state (); |
72 | reset_state (); |
73 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
73 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
74 | } |
74 | } |
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 |
75 | else |
81 | { |
76 | { |
82 | cmd_queue.push_back (command ()); |
77 | cmd_queue.push_back (command ()); |
83 | command &cmd = cmd_queue.back (); |
78 | command &cmd = cmd_queue.back (); |
84 | cmd.stamp = stamp; |
79 | cmd.stamp = stamp; |
85 | cmd.handler = handler; |
80 | cmd.handler = handler; |
86 | cmd.data = (char *)salloc (datalen + 1, data); |
81 | cmd.data = salloc<char> (datalen + 1, data); |
87 | cmd.datalen = datalen; |
82 | cmd.datalen = datalen; |
88 | } |
83 | } |
89 | } |
84 | } |
90 | |
85 | |
91 | bool |
86 | bool |
92 | client::handle_command () |
87 | client::handle_command () |
93 | { |
88 | { |
94 | if (pl && pl->state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0) |
89 | bool skipping = false; |
95 | return false; |
|
|
96 | |
90 | |
97 | if (cmd_queue.empty ()) |
91 | while (!cmd_queue.empty () |
98 | return false; |
92 | && !(state == ST_PLAYING && pl->ob && pl->ob->speed_left <= 0)) |
|
|
93 | { |
|
|
94 | command &cmd = cmd_queue.front (); |
99 | |
95 | |
100 | command &cmd = cmd_queue.front (); |
96 | if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) |
|
|
97 | { |
|
|
98 | if (!skipping) |
|
|
99 | { |
|
|
100 | skipping = true; |
|
|
101 | reset_state (); |
|
|
102 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
|
|
103 | } |
101 | |
104 | |
102 | if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) |
105 | cmd_queue.pop_front (); |
103 | { |
106 | } |
104 | reset_state (); |
107 | else |
105 | send_packet_printf ("drawinfo %d ignoring delayed command.", NDI_RED); |
108 | { |
|
|
109 | execute (cmd.handler, cmd.data, cmd.datalen); |
|
|
110 | cmd_queue.pop_front (); |
|
|
111 | return true; |
|
|
112 | } |
106 | } |
113 | } |
107 | else |
|
|
108 | execute (cmd.handler, cmd.data, cmd.datalen); |
|
|
109 | |
114 | |
110 | cmd_queue.pop_front (); |
|
|
111 | |
|
|
112 | return true; |
115 | return false; |
113 | } |
116 | } |
114 | |
117 | |
115 | void |
118 | void |
116 | flush_sockets (void) |
119 | flush_sockets (void) |
117 | { |
120 | { |
118 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
121 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
119 | if ((*i)->status != Ns_Dead) |
|
|
120 | (*i)->flush (); |
122 | (*i)->flush (); |
121 | } |
123 | } |
122 | |
124 | |
123 | /** |
125 | /** |
124 | * This checks the sockets for input, does the right thing. |
126 | * This checks the sockets for input, does the right thing. |
125 | * |
127 | * |
… | |
… | |
133 | #ifdef CS_LOGSTATS |
135 | #ifdef CS_LOGSTATS |
134 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
136 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
135 | write_cs_stats (); |
137 | write_cs_stats (); |
136 | #endif |
138 | #endif |
137 | |
139 | |
138 | /* Go through the players. Let the loop set the next pl value, |
140 | //TODO: should not be done here, either |
139 | * since we may remove some |
141 | for (int i = 0; i < clients.size (); ++i) |
140 | */ |
|
|
141 | //TODO: must be handled cleanly elsewhere |
|
|
142 | for (player *pl = first_player; pl; ) |
|
|
143 | { |
142 | { |
144 | player *npl = pl->next; |
|
|
145 | |
|
|
146 | //TODO: must be handled cleanly elsewhere |
|
|
147 | if (!pl->socket || pl->socket->status == Ns_Dead) |
|
|
148 | { |
|
|
149 | save_player (pl->ob, 0); |
|
|
150 | |
|
|
151 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
152 | { |
|
|
153 | terminate_all_pets (pl->ob); |
|
|
154 | pl->ob->remove (); |
|
|
155 | } |
|
|
156 | |
|
|
157 | leave (pl, 1); |
|
|
158 | final_free_player (pl); |
|
|
159 | } |
|
|
160 | |
|
|
161 | pl = npl; |
|
|
162 | } |
|
|
163 | |
|
|
164 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ) |
|
|
165 | { |
|
|
166 | client *s = *i; |
143 | client *s = clients [i]; |
167 | |
|
|
168 | if (s->status == Ns_Dead) |
|
|
169 | { |
|
|
170 | clients.erase (i); |
|
|
171 | delete s; |
|
|
172 | } |
|
|
173 | else |
|
|
174 | ++i; |
|
|
175 | } |
|
|
176 | |
|
|
177 | /* We need to do some of the processing below regardless */ |
|
|
178 | |
|
|
179 | /* Check for any input on the sockets */ |
|
|
180 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
|
|
181 | { |
|
|
182 | client *s = *i; |
|
|
183 | player *pl = s->pl; |
144 | player *pl = s->pl; |
184 | |
145 | |
185 | s->handle_packet (); |
146 | if (pl && pl->ns && !pl->ns->destroyed ()) |
186 | s->handle_command (); |
147 | { |
|
|
148 | client *ns = pl->ns; |
187 | |
149 | |
188 | //TODO: should not be done here, either |
|
|
189 | if (s->status != Ns_Dead && pl) |
|
|
190 | { |
|
|
191 | /* Update the players stats once per tick. More efficient than |
150 | /* Update the players stats once per tick. More efficient than |
192 | * sending them whenever they change, and probably just as useful |
151 | * sending them whenever they change, and probably just as useful |
193 | */ |
152 | */ |
194 | esrv_update_stats (pl); |
153 | esrv_update_stats (pl); |
195 | |
154 | |
196 | if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob)) |
155 | if (ns->last_weight != -1 && ns->last_weight != WEIGHT (pl->ob)) |
197 | { |
156 | { |
198 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
157 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
199 | if (pl->last_weight != WEIGHT (pl->ob)) |
158 | if (ns->last_weight != WEIGHT (pl->ob)) |
200 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
159 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
201 | (unsigned long) pl->last_weight, WEIGHT (pl->ob)); |
160 | (unsigned long) ns->last_weight, WEIGHT (pl->ob)); |
202 | } |
161 | } |
203 | |
162 | |
204 | draw_client_map (pl->ob); |
163 | draw_client_map (pl->ob); |
205 | |
164 | |
206 | if (s->update_look) |
165 | if (s->update_look) |
207 | esrv_draw_look (pl->ob); |
166 | esrv_draw_look (pl->ob); |
208 | } |
167 | } |
|
|
168 | |
|
|
169 | s->refcnt_chk (); |
209 | } |
170 | } |
210 | } |
171 | } |
211 | |
172 | |