… | |
… | |
26 | * Main client/server loops. |
26 | * Main client/server loops. |
27 | * |
27 | * |
28 | * \date 2003-12-02 |
28 | * \date 2003-12-02 |
29 | * |
29 | * |
30 | * loop.c mainly deals with initialization and higher level socket |
30 | * loop.c mainly deals with initialization and higher level socket |
31 | * maintenance (checking for lost connections and if data has arrived.) |
31 | * maintanance (checking for lost connections and if data has arrived.) |
32 | * The reading of data is handled in ericserver.c |
|
|
33 | */ |
32 | */ |
34 | |
33 | |
35 | |
34 | |
36 | #include <global.h> |
35 | #include <global.h> |
37 | #include <sproto.h> |
36 | #include <sproto.h> |
… | |
… | |
46 | #include <unistd.h> |
45 | #include <unistd.h> |
47 | #include <arpa/inet.h> |
46 | #include <arpa/inet.h> |
48 | |
47 | |
49 | #include <loader.h> |
48 | #include <loader.h> |
50 | |
49 | |
51 | /***************************************************************************** |
50 | #define MAX_QUEUE_DEPTH 500 //TODO |
52 | * Start of command dispatch area. |
51 | #define MAX_QUEUE_BACKLOG 5. //TODO |
53 | * The commands here are protocol commands. |
|
|
54 | ****************************************************************************/ |
|
|
55 | |
52 | |
56 | /* Either keep this near the start or end of the file so it is |
53 | void |
57 | * at least reasonablye easy to find. |
54 | client::reset_state () |
58 | * There are really 2 commands - those which are sent/received |
|
|
59 | * before player joins, and those happen after the player has joined. |
|
|
60 | * As such, we have function types that might be called, so |
|
|
61 | * we end up having 2 tables. |
|
|
62 | */ |
|
|
63 | |
|
|
64 | enum { |
|
|
65 | PF_PLAYER = 0x01, // must have valid player |
|
|
66 | PF_IMMEDIATE = 0x02, // TODO: hack, can be executed immediately |
|
|
67 | PF_PLAYING = 0x04, // must be in playing state |
|
|
68 | }; |
|
|
69 | |
|
|
70 | struct pkt_type |
|
|
71 | { |
55 | { |
72 | const char *name; |
56 | if (!pl) |
73 | void *cb; |
57 | return; |
74 | int flags; |
|
|
75 | |
58 | |
76 | bool may_execute (client *ns) |
59 | pl->run_on = 0; |
|
|
60 | pl->fire_on = 0; |
|
|
61 | } |
|
|
62 | |
|
|
63 | void |
|
|
64 | client::queue_command (packet_type *handler, char *data, int datalen) |
|
|
65 | { |
|
|
66 | tstamp stamp = now (); |
|
|
67 | |
|
|
68 | if (cmd_queue.size () >= MAX_QUEUE_DEPTH) |
77 | { |
69 | { |
78 | return (!(flags & PF_PLAYER) || ns->pl) |
70 | //TODO: just disconnect here? |
79 | && (!(flags & PF_PLAYING) || (ns->pl && ns->pl->state == ST_PLAYING)); |
71 | reset_state (); |
|
|
72 | send_packet_printf ("drawinfo %d command queue overflow, ignoring.", NDI_RED); |
80 | } |
73 | } |
81 | |
|
|
82 | void execute (client *ns, char *data, int datalen) |
|
|
83 | { |
|
|
84 | //TODO: only one format |
|
|
85 | if (flags & PF_PLAYER) |
|
|
86 | ((void (*)(char *, int, player * ))cb)((char *)data, datalen, ns->pl); |
|
|
87 | else |
74 | else |
88 | ((void (*)(char *, int, client *))cb)((char *)data, datalen, ns); |
75 | { |
89 | } |
76 | cmd_queue.push_back (command ()); |
90 | }; |
77 | command &cmd = cmd_queue.back (); |
91 | |
78 | cmd.stamp = stamp; |
92 | // SocketCommand, PlayingCommand, should not exist with those ugly casts |
79 | cmd.handler = handler; |
93 | #define SC(cb) (void *)static_cast<void (*)(char *, int, client *)>(cb), |
80 | cmd.data = salloc<char> (datalen + 1, data); |
94 | #define PC(cb) (void *)static_cast<void (*)(char *, int, player *)>(cb), PF_PLAYER | |
81 | cmd.datalen = datalen; |
95 | |
|
|
96 | /** |
|
|
97 | * Dispatch table for the server. |
|
|
98 | */ |
|
|
99 | static struct pkt_type packets[] = { |
|
|
100 | {"ncom", PC(NewPlayerCmd) PF_PLAYING }, |
|
|
101 | {"command", PC(PlayerCmd) PF_PLAYING }, |
|
|
102 | |
|
|
103 | {"examine", PC(ExamineCmd) PF_PLAYING | PF_IMMEDIATE }, |
|
|
104 | {"apply", PC(ApplyCmd) PF_PLAYING | PF_IMMEDIATE }, |
|
|
105 | {"reply", PC(ReplyCmd) PF_IMMEDIATE }, |
|
|
106 | {"lookat", PC(LookAt) PF_PLAYING | PF_IMMEDIATE }, |
|
|
107 | {"lock", PC(LockItem) PF_PLAYING | PF_IMMEDIATE }, |
|
|
108 | {"mark", PC(MarkItem) PF_PLAYING | PF_IMMEDIATE }, |
|
|
109 | {"move", PC(MoveCmd) PF_PLAYING | PF_IMMEDIATE }, |
|
|
110 | {"ext", PC(ExtCmd) PF_IMMEDIATE }, /* CF+ */ |
|
|
111 | {"mapredraw", PC(MapRedrawCmd) PF_IMMEDIATE }, /* Added: phil */ |
|
|
112 | {"mapinfo", PC(MapInfoCmd) PF_IMMEDIATE }, /* CF+ */ |
|
|
113 | |
|
|
114 | {"addme", SC(AddMeCmd) PF_IMMEDIATE }, |
|
|
115 | {"askface", SC(SendFaceCmd) 0 }, /* Added: phil */ |
|
|
116 | {"requestinfo", SC(RequestInfo) 0 }, |
|
|
117 | {"setfacemode", SC(SetFaceMode) PF_IMMEDIATE }, |
|
|
118 | {"setsound", SC(SetSound) PF_IMMEDIATE }, |
|
|
119 | {"setup", SC(SetUp) PF_IMMEDIATE }, |
|
|
120 | {"version", SC(VersionCmd) PF_IMMEDIATE }, |
|
|
121 | {"toggleextendedinfos", SC(ToggleExtendedInfos) PF_IMMEDIATE }, /*Added: tchize */ |
|
|
122 | {"toggleextendedtext", SC(ToggleExtendedText) PF_IMMEDIATE }, /*Added: tchize */ |
|
|
123 | {"asksmooth", SC(AskSmooth) 0 }, /*Added: tchize (smoothing technologies) */ |
|
|
124 | }; |
|
|
125 | |
|
|
126 | /** |
|
|
127 | * Handle client input. |
|
|
128 | * |
|
|
129 | * HandleClient is actually not named really well - we only get here once |
|
|
130 | * there is input, so we don't do exception or other stuff here. |
|
|
131 | * sock is the output socket information. pl is the player associated |
|
|
132 | * with this socket, null if no player (one of the init_sockets for just |
|
|
133 | * starting a connection) |
|
|
134 | */ |
|
|
135 | void |
|
|
136 | HandleClient (client *ns, player *pl) |
|
|
137 | { |
|
|
138 | /* Loop through this - maybe we have several complete packets here. */ |
|
|
139 | // limit to a few commands only, though, as to not monopolise the server |
|
|
140 | for (int repeat = 16; repeat--;) |
|
|
141 | { |
82 | } |
142 | /* If it is a player, and they don't have any speed left, we |
83 | } |
143 | * return, and will read in the data when they do have time. |
84 | |
144 | */ |
85 | bool |
|
|
86 | client::handle_command () |
|
|
87 | { |
|
|
88 | bool skipping = false; |
|
|
89 | |
|
|
90 | while (!cmd_queue.empty () |
145 | if (pl && pl->state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0) |
91 | && !(pl && pl->state == ST_PLAYING && pl->ob && pl->ob->speed_left < 0)) |
146 | return; |
92 | { |
|
|
93 | command &cmd = cmd_queue.front (); |
147 | |
94 | |
148 | int pkt_len = ns->read_packet (); |
95 | if (cmd.stamp + MAX_QUEUE_BACKLOG < now ()) |
149 | |
|
|
150 | if (pkt_len < 0) |
|
|
151 | { |
|
|
152 | LOG (llevError, "read error on player %s\n", &pl->ob->name); |
|
|
153 | /* Caller will take care of cleaning this up */ |
|
|
154 | ns->status = Ns_Dead; |
|
|
155 | return; |
|
|
156 | } |
96 | { |
157 | else if (pkt_len == 0) |
97 | if (!skipping) |
158 | /* Still dont have a full packet */ |
|
|
159 | return; |
|
|
160 | |
|
|
161 | /* First, break out beginning word. There are at least |
|
|
162 | * a few commands that do not have any paremeters. If |
|
|
163 | * we get such a command, don't worry about trying |
|
|
164 | * to break it up. |
|
|
165 | */ |
|
|
166 | int datalen; |
|
|
167 | char *data = strchr ((char *)ns->inbuf + 2, ' '); |
|
|
168 | |
|
|
169 | if (data) |
|
|
170 | { |
98 | { |
171 | *data++ = 0; |
99 | skipping = true; |
172 | datalen = pkt_len - (data - (char *)ns->inbuf); |
100 | reset_state (); |
|
|
101 | send_packet_printf ("drawinfo %d ignoring delayed commands.", NDI_RED); |
|
|
102 | } |
|
|
103 | |
|
|
104 | cmd_queue.pop_front (); |
173 | } |
105 | } |
174 | else |
106 | else |
175 | { |
107 | { |
176 | data = (char *)ns->inbuf + 2; // better read garbage than segfault |
108 | execute (cmd.handler, cmd.data, cmd.datalen); |
177 | datalen = 0; |
109 | cmd_queue.pop_front (); |
178 | } |
|
|
179 | |
|
|
180 | ns->inbuf [pkt_len] = 0; /* Terminate buffer - useful for string data */ |
|
|
181 | |
|
|
182 | for (pkt_type *pkt = packets; pkt < packets + (sizeof (packets) / sizeof (packets[0])); ++pkt) |
|
|
183 | if (!strcmp ((char *)ns->inbuf + 2, pkt->name)) |
|
|
184 | { |
|
|
185 | if (pkt->may_execute (ns)) |
|
|
186 | { |
|
|
187 | pkt->execute (ns, data, datalen); |
|
|
188 | ns->skip_packet (pkt_len); |
|
|
189 | //D//TODO not doing this causes random memory corruption |
|
|
190 | if (pkt->flags & PF_IMMEDIATE) |
|
|
191 | goto next_packet; |
|
|
192 | return; |
110 | return true; |
193 | } |
|
|
194 | } |
111 | } |
195 | |
|
|
196 | /* If we get here, we didn't find a valid command. Logging |
|
|
197 | * this might be questionable, because a broken client/malicious |
|
|
198 | * user could certainly send a whole bunch of invalid commands. |
|
|
199 | */ |
|
|
200 | LOG (llevDebug, "Bad command from client (%s)\n", ns->inbuf + 2); |
|
|
201 | ns->skip_packet (pkt_len); |
|
|
202 | next_packet: |
|
|
203 | ; |
|
|
204 | } |
112 | } |
|
|
113 | |
|
|
114 | return false; |
205 | } |
115 | } |
206 | |
116 | |
207 | void |
117 | void |
208 | flush_sockets (void) |
118 | flush_sockets (void) |
209 | { |
119 | { |
… | |
… | |
220 | * |
130 | * |
221 | */ |
131 | */ |
222 | void |
132 | void |
223 | doeric_server (void) |
133 | doeric_server (void) |
224 | { |
134 | { |
225 | int i, pollret; |
|
|
226 | fd_set tmp_read; |
|
|
227 | struct sockaddr_in addr; |
|
|
228 | socklen_t addrlen = sizeof (struct sockaddr); |
|
|
229 | player *pl, *next; |
|
|
230 | int maxfd = 0; |
|
|
231 | |
|
|
232 | #ifdef CS_LOGSTATS |
135 | #ifdef CS_LOGSTATS |
233 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
136 | if ((time (NULL) - cst_lst.time_start) >= CS_LOGTIME) |
234 | write_cs_stats (); |
137 | write_cs_stats (); |
235 | #endif |
138 | #endif |
236 | |
139 | |
237 | /* Go through the players. Let the loop set the next pl value, |
140 | /* Go through the players. Let the loop set the next pl value, |
238 | * since we may remove some |
141 | * since we may remove some |
239 | */ |
142 | */ |
240 | //TODO: must be handled cleanly elsewhere |
143 | //TODO: must be handled cleanly elsewhere |
241 | for (pl = first_player; pl; ) |
144 | for (player *pl = first_player; pl; ) |
242 | { |
145 | { |
243 | player *npl = pl->next; |
146 | player *npl = pl->next; |
244 | |
147 | |
245 | //TODO: must be handled cleanly elsewhere |
148 | //TODO: must be handled cleanly elsewhere |
246 | if (pl->socket->status == Ns_Dead) |
149 | if (!pl->socket || pl->socket->status == Ns_Dead) |
247 | { |
150 | { |
248 | save_player (pl->ob, 0); |
151 | save_player (pl->ob, 0); |
249 | |
152 | |
250 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
153 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
251 | { |
154 | { |
… | |
… | |
258 | } |
161 | } |
259 | |
162 | |
260 | pl = npl; |
163 | pl = npl; |
261 | } |
164 | } |
262 | |
165 | |
263 | FD_ZERO (&tmp_read); |
|
|
264 | |
|
|
265 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ) |
166 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ) |
266 | { |
167 | { |
267 | client *s = *i; |
168 | client *s = *i; |
268 | |
169 | |
269 | if (s->status == Ns_Dead) |
170 | if (s->status == Ns_Dead) |
270 | { |
171 | { |
271 | clients.erase (i); |
172 | clients.erase (i); |
272 | delete s; |
173 | delete s; |
273 | } |
174 | } |
274 | else |
175 | else |
275 | { |
|
|
276 | if (s->fd > maxfd) maxfd = s->fd; |
|
|
277 | |
|
|
278 | FD_SET (s->fd, &tmp_read); |
|
|
279 | |
|
|
280 | ++i; |
176 | ++i; |
281 | } |
|
|
282 | } |
|
|
283 | |
|
|
284 | struct timeval timeout; |
|
|
285 | |
|
|
286 | timeout.tv_sec = 0; |
|
|
287 | timeout.tv_usec = 0; |
|
|
288 | |
|
|
289 | pollret = select (maxfd + 1, |
|
|
290 | &tmp_read, 0, 0, |
|
|
291 | &timeout); |
|
|
292 | |
|
|
293 | if (pollret == -1) |
|
|
294 | { |
|
|
295 | LOG (llevError, "select failed: %s\n", strerror (errno)); |
|
|
296 | return; |
|
|
297 | } |
177 | } |
298 | |
178 | |
299 | /* We need to do some of the processing below regardless */ |
179 | /* We need to do some of the processing below regardless */ |
300 | |
180 | |
301 | /* Check for any input on the sockets */ |
181 | /* Check for any input on the sockets */ |
302 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
182 | for (sockvec::iterator i = clients.begin (); i != clients.end (); ++i) |
303 | { |
183 | { |
304 | client *s = *i; |
184 | client *s = *i; |
305 | player *pl = s->pl; |
185 | player *pl = s->pl; |
306 | |
186 | |
307 | //TODO: disassociate handleclient from socket readin |
187 | s->handle_packet (); |
308 | if (s->inbuf_len || FD_ISSET (s->fd, &tmp_read)) |
188 | s->handle_command (); |
309 | HandleClient (s, pl); |
|
|
310 | |
189 | |
311 | //TODO: should not be done here, either |
190 | //TODO: should not be done here, either |
312 | if (s->status != Ns_Dead && pl) |
191 | if (s->status != Ns_Dead && pl) |
313 | { |
192 | { |
314 | /* Update the players stats once per tick. More efficient than |
193 | /* Update the players stats once per tick. More efficient than |
315 | * sending them whenever they change, and probably just as useful |
194 | * sending them whenever they change, and probably just as useful |
316 | */ |
195 | */ |
317 | esrv_update_stats (pl); |
196 | esrv_update_stats (pl); |
|
|
197 | |
318 | if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob)) |
198 | if (pl->last_weight != -1 && pl->last_weight != WEIGHT (pl->ob)) |
319 | { |
199 | { |
320 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
200 | esrv_update_item (UPD_WEIGHT, pl->ob, pl->ob); |
321 | if (pl->last_weight != WEIGHT (pl->ob)) |
201 | if (pl->last_weight != WEIGHT (pl->ob)) |
322 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
202 | LOG (llevError, "esrv_update_item(UPD_WEIGHT) did not set player weight: is %lu, should be %lu\n", |
323 | (unsigned long) pl->last_weight, WEIGHT (pl->ob)); |
203 | (unsigned long) pl->last_weight, WEIGHT (pl->ob)); |
324 | } |
204 | } |
325 | |
205 | |
326 | /* draw_client_map does sanity checking that map is |
|
|
327 | * valid, so don't do it here. |
|
|
328 | */ |
|
|
329 | draw_client_map (pl->ob); |
206 | draw_client_map (pl->ob); |
|
|
207 | |
330 | if (s->update_look) |
208 | if (s->update_look) |
331 | esrv_draw_look (pl->ob); |
209 | esrv_draw_look (pl->ob); |
332 | } |
210 | } |
333 | } |
211 | } |
334 | } |
212 | } |